Cod sursa(job #1217542)
| Utilizator | Data | 7 august 2014 17:41:25 | |
|---|---|---|---|
| Problema | Triplete | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
//O(n^3)
#include <fstream>
#define nmax 4100
using namespace std;
ifstream fi("triplete.in");
ofstream fo("triplete.out");
bool S[nmax][nmax];
int main(void)
{
int n,m;
for (fi>>n>>m;m--;)
{
int x,y;
fi>>x>>y;
S[x][y]=1;
S[y][x]=1;
}
unsigned long long R=0;
for (int i=1;i<n-1;++i)
for (int j=i+1;j<n;++j)
for (int a=j+1;a<=n;++a)
if (S[i][j] && S[i][a] && S[j][a]) ++R;
fo<<R<<"\n";
fo.close();
return 0;
}
