Cod sursa(job #971016)
| Utilizator | Data | 8 iulie 2013 11:48:43 | |
|---|---|---|---|
| Problema | Fractii | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <iostream>
#include<fstream>
using namespace std;
long divizor(long a,long b)
{
while(a!=b)
{
if(a>b)
a=a-b;
else
b=b-a;
}
return a;
}
int main()
{
int k,i,j;
long unsigned n;
ifstream f("fractii.in");
ofstream g("fractii.out");
f>>n;
k=0;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
if(divizor(i,j)==1)
k++;
}
g<<k;
return 0;
}
