Cod sursa(job #2546845)
Utilizator | Data | 14 februarie 2020 17:21:31 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int prim[2000005],n,cnt;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
if(__gcd(i,j)==1)
cnt++;
}
fout<<cnt;
}