Cod sursa(job #1949343)
Utilizator | Data | 1 aprilie 2017 22:31:38 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 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((p==1 or q==1) or (p==1 and q==1)) G++;
else if(prim(p,q)) G++;
g<<G<<'\n';
return 0;
}