Cod sursa(job #752801)
| Utilizator | Data | 29 mai 2012 16:44:27 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <fstream>
using namespace std;
unsigned P, Q;
unsigned euclid(unsigned P, unsigned Q)
{
unsigned d;
while (Q)
{
d=P%Q;
P=Q;
Q=d;
}
return (P==0 || P==1);
}
int main()
{
unsigned N;
ifstream fin("fractii.in");
fin>>N;
fin.close();
unsigned c=0;
for (P=2; P<=N-1; P++)
for (Q=P; Q<=N-1; Q++)
if (P/Q!=1 && euclid(P,Q)==1 )
c++;
fstream fout("fractii.out");
fout<<(c*2+1+N);
fout.close();
return 0;
}
