Cod sursa(job #2068448)
Utilizator | Data | 17 noiembrie 2017 21:46:55 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
int div(int n,int x)
{
int r;
while(x)
{
r=n%x;
n=x;
x=r;
}
return n;
}
int main()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
int N,k=0,P,Q;
f>>N;
for(P=1;P<=N;P++)
for(Q=1;Q<=N;Q++)
if(div(P,Q)==1)
k++;
g<<k;
f.close();
g.close();
}