Pagini recente » Cod sursa (job #2975857) | Cod sursa (job #251997) | Cod sursa (job #1764921) | Cod sursa (job #1240816) | Cod sursa (job #1192887)
#include <iostream>
#include<fstream>
using namespace std;
ifstream f;
ofstream g;
long int i,j,n,p,z;
long long k;
long int t[1000002];
int main()
{
f.open("fractii.in");
g.open("fractii.out");
f>>n;
t[1]=1;
for(i=2;i<=n;i++)
if(!t[i])
{
for(j=i;j<=n;j+=i)t[j]=t[j]*10+i;
}
k=n;
for(i=2;i<=n;i++)
{
p=t[i];
k+=n;
z=0;
while(p%10)
{
k=k-(n/(p%10));
p/=10;
if(z)k++;
z++;
}
}
g<<k;
g.close();
}