Pagini recente » Cod sursa (job #2280788) | Cod sursa (job #559478) | Cod sursa (job #947297) | Cod sursa (job #2429606) | Cod sursa (job #2884312)
#include <iostream>
#include <fstream>
using namespace std;
long long int cmmdc(long long int a, long long int b){
if (b==0) return a;
return cmmdc(b, a%b);
}
int main()
{
ifstream fin;
fin.open("fractii.in");
long long int n;
fin >> n;
long long int counter = 0;
for (long long int p = 1; p<n+1; p++){
for (long long int q = 1; q<p+1; q++){
if ((p%2==0)&&(q%2==0)) continue;
if ((p%3==0)&&(q%3==0)) continue;
if ((p%5==0)&&(q%5==0)) continue;
if ((p%7==0)&&(q%7==0)) continue;
if ((p%11==0)&&(q%11==0)) continue;
if ((p%13==0)&&(q%13==0)) continue;
if ((p%17==0)&&(q%17==0)) continue;
if ((p%19==0)&&(q%19==0)) continue;
if ((p%23==0)&&(q%23==0)) continue;
if ((p%29==0)&&(q%29==0)) continue;
if ((p%31==0)&&(q%31==0)) continue;
if ((p%37==0)&&(q%37==0)) continue;
if ((p%41==0)&&(q%41==0)) continue;
if (q>p/2) counter++;
else{
if (cmmdc(p, q) == 1) counter++;
}
}
}
ofstream fout;
fout.open("fractii.out");
fout << (counter*2-1);
fin.close();
fout.close();
return 0;
}