Cod sursa(job #842483)
Utilizator | Data | 26 decembrie 2012 22:30:41 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream in("fractii.in");
ofstream out("fractii.out");
long n,i,j,c,nf=0,ai,bj,au;
in>>n;
nf=2*n-1;
for(i=2;i<=n;i++)
for(j=2;j<=n;j++)
{
ai=i;bj=j;
if(ai<bj) {au=ai;ai=bj;bj=au;}
if(ai%bj!=0)
{
while(ai%bj!=0)
{
c=ai%bj; ai=bj; bj=c;
}
if(c==1) nf++;
}
}
out<<nf;
return 0;
}