Cod sursa(job #1357496)
Utilizator | Data | 23 februarie 2015 22:36:51 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include <cmath>
#include <algorithm>
#include <fstream>
using namespace std;
int main()
{
int p, q, n;
ifstream in("fractii.in");
ofstream out("fractii.out");
in>>n;
int count;
for(p = 1; p <= n; p++) {
for(q = 1; q <= n; q++)
if(__gcd(p, q) == 1) count++;
}
out<<count;
return 0;
}