Cod sursa(job #2504431)
| Utilizator | Data | 4 decembrie 2019 21:59:44 | |
|---|---|---|---|
| Problema | Fractii | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <fstream>
using namespace std;
int main()
{ ifstream fin("fractii.in");
ofstream fout("fractii.out");
unsigned int N,i,j,copie1,copie2,nr=0;
fin>>N;
for(i=1; i<=N; i++)
for(j=1; j<=N; j++)
{
copie1=i;
copie2=j;
while(copie1!=copie2)
if(copie1>copie2)
copie1=copie1-copie2;
else
copie2=copie2-copie1;
if(copie1==1)
nr++;
}
fout<<nr;
fin.close();
fout.close();
return 0;
}
