Cod sursa(job #1471585)
| Utilizator | Data | 14 august 2015 15:21:45 | |
|---|---|---|---|
| Problema | Triplete | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include<fstream>
using namespace std;
ifstream in("triplete.in");
ofstream out("triplete.out");
const int nmax = 4100;
int n, m, vecini[nmax];
long long act;
int main(){
int player_unu=0;
in>>n>>m;
for(int i = 0; i<m; i++)
{
int a, b;
in>>a>>b;
vecini[a]++;
vecini[b]++;
}
for(int i = 1; i<=n; i++)
{
act += (long long)(vecini[i] * (n - vecini[i] - 1));
}
act /= 2;
out<<(n - 1) * (n - 2) * n / 6 - act<<'\n';
return player_unu;
}