Cod sursa(job #2320104)
Utilizator | Data | 14 ianuarie 2019 11:20:30 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int euclid (int a , int b)
{
int c;
while(b)
{
c=a%b;
a=b;
b=c;
}
return a;
}
int main()
{ int n,cnt=0;
fin>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(euclid(i,j)==1)
cnt++;
fout<<cnt;
return 0;
}