Pagini recente » Cod sursa (job #1576807) | Cod sursa (job #577552) | Cod sursa (job #749071) | Cod sursa (job #1916094) | Cod sursa (job #25048)
Cod sursa(job #25048)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f1("puteri.in");
ofstream f2("puteri.out");
int cmmdc(int n, int m, int p)
{
int c1, c2, c3, cf, r;
while (m!=0)
{
r=n%m;
n=m;
m=r;
}
c1=n;
while (p!=0)
{
r=c1%p;
c1=p;
p=r;
}
cf=c1;
return cf;
}
main()
{
int m[100001][4], n, a1,b1,c1,a2,b2,c2, rez,i,j;
f1>>n;
rez=0;
for (i=1; i<=n; i++)
f1>>m[i][1]>>m[i][2]>>m[i][3];
for (i=1; i<=n; i++)
{
a1=m[i][1]; b1=m[i][2]; c1=m[i][3];
for (j=i+1; j<=n; j++)
{
a2=m[j][1]; b2=m[j][2]; c2=m[j][3];
if (cmmdc(a1+a2, b1+b2, c1+c2)!=1) rez+=1;
}
}
f2<<rez;
f1.close();
f2.close();
return 0;
}