Pagini recente » Istoria paginii runda/winners1 | Cod sursa (job #2163984) | Cod sursa (job #2085272) | Cod sursa (job #1322764) | Cod sursa (job #2003702)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int main()
{
int i, j, n, fractii=0, e[100000];
cin>>n;
for(i=1;i<=n;i++)
e[i]=1;
for(i=2;i<=n;i++)
if(e[i])
for(int j=i+i;j<=n;j+=i)
e[j]=0;
fractii+=n;
for(i=2;i<=n;i++)
for(j=1;j<=n;j++){
int ok=1;
for(int k=2;k<j+i;k++)
if(i%k==0 && j%k==0){
ok=0;
break;
}
if(ok) fractii++;
}
cout<<fractii;
}