Cod sursa(job #2706097)
| Utilizator | Data | 13 februarie 2021 19:37:58 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("cmmdc.in");
ofstream out("cmmdc.out");
int main()
{
int n,k=0;
in>>n;
int i=1,j=1,ci,cj;
while(i<=n)
{
ci=i;
cj=j;
if(ci<cj) swap(ci,cj);
int r=ci%cj;
while(r!=0)
{
ci=cj;
cj=r;
r=ci%cj;
}
if(cj==1) k++;
j++;
if(j>n)
{
i++;
j=1;
}
}
out<<k;
return 0;
}
