Pagini recente » Cod sursa (job #1110363) | Rating Benchia Madalin (madutzu1597) | Cod sursa (job #574800) | Cod sursa (job #321611) | Cod sursa (job #2883930)
#include <iostream>
#include <fstream>
using namespace std;
const int MAXN = 1e6;
ifstream fin( "mins.in" );
ofstream fout( "mins.out" );
// trebuie sa determinam toate fractiile ireductibile a / b
int divprimi[MAXN+1];
int main() {
int n, m, gcd, fractiiIred, nr, i, j;
divprimi[1] = 0;
for( i = 2; i <= MAXN; i++ ) {
if( !divprimi[i] ) {
for( j = i + i; j <= MAXN; j += i )
divprimi[j]++;
}
}
fin >> n >> m;
fractiiIred = 0;
for( gcd = 1; gcd <= min( n, m ); gcd++ ) {
if( gcd != 1 && divprimi[gcd] == 0 )
divprimi[gcd] = 1;
nr = ( ( n - 1 ) / gcd ) * ( ( m - 1 ) / gcd );
if( divprimi[gcd] % 2 == 1 )
fractiiIred -= nr;
else
fractiiIred += nr;
}
fout << fractiiIred;
}