Cod sursa(job #1559039)
Utilizator | Data | 29 decembrie 2015 22:24:53 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int i, j, fr, ci, cj;
long long int n;
ifstream f("fractii.in");
ofstream g("fractii.out");
f>>n;
fr=0;
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
{
ci=i;
cj=j;
while(ci!=cj)
{
if(ci>cj)
ci=ci-cj;
else cj=cj-ci;
}
if(ci==1 || cj==1)
fr++;}
g<<fr<<endl;
f.close();
g.close();
}