Cod sursa(job #2859772)
Utilizator | Data | 1 martie 2022 21:25:52 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.57 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int prim(int n, int m)
{
int r;
while(m != 0)
{
int r = n % m;
n = m;
m = r;
}
return n;
}
int main()
{
int n;
f >> n;
int c=0;
for (int i=1; i<=n; i++)
{
int j=1,ok=0;
while(ok==0)
{
if(prim(i,j)==1)
c++;
j++;
if(j==n+1)
ok=1;
}
}
g<<c;
}