Cod sursa(job #1142461)
Utilizator | Popescu Nicolae-Aurelian Acuas | Data | 13 martie 2014 20:56:14 |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int long long n,v[1000000],i,j,k,ca,cb,r;
int euclid(int a, int b,int d)
{
ca=a;
cb=b;
if (cb == 0) {
d = ca;}
else
euclid(cb, ca % cb,d);
return ca;
}
int main()
{
f>>n;
for(i=1;i<=n;i++)
v[i]=i;
for(i=1;i<=n;i++)
{for(j=1;j<=n;j++)
{r=euclid(v[i],v[j],1);
if(ca==1)
k++;}
}
g<<k<<endl;
return 0;
}