Pagini recente » Algoritmiada 2012 - Clasament Runda 2, Clasele 11-12 | Cod sursa (job #2720028) | Cod sursa (job #1315425) | Cod sursa (job #2889662) | Cod sursa (job #453140)
Cod sursa(job #453140)
#include<fstream.h>
int prim(int a, int b)
{ while(a!=b)
{ if(a>b)a=a-b;
else b=b-a;
}
if(a==1) return 1;
return 0;
}
void main()
{ long n;
ifstream in("fractii.in");
in>>n;
in.close();
int s=0;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(prim(i,j))
s++;
ofstream out("fractii.out");
out<<s;
out.close();
}