Cod sursa(job #1370426)
Utilizator | Data | 3 martie 2015 14:30:45 | |
---|---|---|---|
Problema | Mins | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include <bits/stdc++.h>
using namespace std;
const int Nmax = 1000000;
int phi[Nmax + 1];
int C, D;
int main()
{
ifstream in("mins.in");
ofstream out("mins.out");
long long sol = 0;
in >> C >> D;
C--; D--;
for ( int i = 1; i <= C; ++i )
for ( int j = 1; j <= D; ++j )
if ( __gcd(i, j) == 1 )
sol++;
out << sol;
return 0;
}