Cod sursa(job #1262343)
| Utilizator |  Trusca Petre petre2015 |
Data | 13 noiembrie 2014 09:00:19 |
|---|---|---|---|
| Problema | Fractii | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.31 kb |
#include<fstream>
using namespace std;
int divizor(int a,int b)
{while(a!=b)
{if(a>b)
a=a-b;
else
b=b-a;}
return a;}
int main(){
ifstream f("fractii.in");
ofstream g("fractii.out");
long long n,k=0;
f>>n;
for(int i=1;i<=n;i++)
{for(int j=1;j<=n;j++)
if(divizor(i,j)==1)
k++;
}
g<<k;
f.close();
g.close();
return 0;
}
