Cod sursa(job #688275)
Utilizator | Data | 23 februarie 2012 13:29:45 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include<fstream>
using namespace std;
int main()
{
unsigned long long int n, i, j, auxi, auxj, rez=0;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
fin>>n;
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
{
auxi=i;
auxj=j;
while(auxi!=auxj)
if(auxi>auxj)
auxi-=auxj;
else
auxj-=auxi;
if(auxi==1)
rez++;
}
fout<<rez;
return 1;
}