Pagini recente » Cod sursa (job #889874) | Cod sursa (job #1670024) | Cod sursa (job #2755220) | Cod sursa (job #1803632) | Cod sursa (job #1750635)
#include <fstream>
#include <math.h>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int solve(int n){
}
int main()
{
int n;
fin>>n;
int ct=0;
for(int p=1;p<=n;p++){
for(int q=1;q<=n;q++){
int ok=1;
if(p==1||q==1){
ct++;
ok=0;
} else if(p==2&&q%2==0||q==2&&p%2==0||p==q||p==3&&q%3==0||q==3&&p%3==0){
ok=0;
} else {
for(int d=2;d<=p/2&&d<=q/2;d++)
if(p%d==0&&q%d==0||p%q==0||q%p==0)
ok=0;
}
if(ok==1)
ct++;
}
}
fout<<ct;
return 0;
}