Cod sursa(job #899103)
| Utilizator | Data | 28 februarie 2013 12:56:11 | |
|---|---|---|---|
| Problema | Fractii | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include<fstream>
#include<iostream>
using namespace std;
int cmmdc(int p,int q)
{while(p!=q)
{if(p>q)
p-=q;
else
q-=p;}
return p;
}
long int n;
int main ()
{ long int v[100000],i,a,b,j;
int m;
ifstream f("fractii.in");
ofstream g("fractii.out");
f>>n; m=0;
for(i=1;i<=n;i++)
v[i]=i;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{a=v[i]; b=v[j];
if(cmmdc(a,b)==1)
m++;
}
g<<m<<'\n';
f.close();
g.close();
return 0;
}
