func_code_string: #include <bits/stdc++.h>   using namespace std;   const int N = 700 + 5;   int n, m, d[N], cnt[N][N];   bitset<N> adj[N];   long long ans;   int main() {     scanf( %d%d , &n, &m);     for (int i = 0, u, v; i < m; i++) {       scanf( %d%d , &u, &v);       d[--u]++, d[--v]++;       adj[u][v] = adj[v][u] = true;     }     for (int u = 0; u < n; u++)       for (int v = u; v < n; v++)         cnt[u][v] = cnt[v][u] = (adj[u] & adj[v]).count();     for (int u = 0; u < n; u++)       for (int v = 0; v < n; v++)         if (adj[u][v]) {           for (int x = 0; x < n; x++)             ans += 1LL * (u ^ x && v ^ x) * (cnt[u][x] - adj[x][v]) *                    (cnt[v][x] - adj[x][u]);           ans -= cnt[u][v] * (d[u] - 2);         }     printf( %lld n , ans / 10);   }   