Pagini recente » Cod sursa (job #1219643) | Cod sursa (job #210151) | Cod sursa (job #110622) | Cod sursa (job #1834808) | Cod sursa (job #115629)
Cod sursa(job #115629)
#include<fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
void ini(int a[100000],long long n)
{
int i;
for(i = 1; i <= n; i++)
a[i] = 0;
}
int prim(int q,long long n)
{
int i,j,b[100000],p = 1;
ini(b,n);
for(i = 2; i <= n; i++)
if(q%i == 0)
for(j = i;j <= n; j++)
if(j%i == 0)
b[j] = 1;
for(i = 2; i <= n; i++)
if(b[i] == 0)
p++;
return p;
}
void frac(long long n)
{
int i;
long long p=n;
for(i = 2; i <= n; i++)
p+=prim(i,n);
fout<<p;
}
int main()
{
long long n;
fin>>n;
frac(n);
fin.close();
fout.close();
return 0;
}