Pagini recente » Cod sursa (job #1810771) | Cod sursa (job #3030727) | Cod sursa (job #2107701) | Cod sursa (job #1234407) | Cod sursa (job #1110133)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int a[1005];
int prim(int x)
{
for (int i=2;i<=x/2;i++)
if(x%i==0)
return 0;
return 1;
}
void generare()
{ int k=0;
for(int i=2;i<=1000;i++)
if(prim(i)==1)
{ k++;
a[k]=i;
}
}
int main()
{
long int n,s=0;
generare();
f>>n;
for(long int i=2;i<=n;i++)
{
int k=0;
for(int j=1;a[j]<=i;j++)
if(i%a[j]==0)
{k++;
s=s+(n/a[j])+1-k;
}
}
g<<n*n-s;
return 0;
}