Cod sursa(job #1937939)
Utilizator | Data | 24 martie 2017 14:17:18 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int n,p,q,G;
int prim(int a, int b)
{
while(a!=b) { if(a>b) a=a-b;
else b=b-a;
}
if(a==1) return 1;
return 0;
}
int main()
{
f>>n;
for(p=1;p<=n;p++) for(q=1;q<=n;q++) if(prim(p,q)) G++;
g<<G<<'\n';
return 0;
}