Pagini recente » Cod sursa (job #2742626) | Cod sursa (job #2044630) | Cod sursa (job #2111619) | Cod sursa (job #2204931) | Cod sursa (job #189139)
Cod sursa(job #189139)
#include<fstream>
using namespace std;
int main()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
int i,S[100000],j,k,r,l;
long int N;
f>>N;
f.close();
for(i=1;i<=N;i++)
S[i]=N;
for(i=2;i<=N;i++)
{
j=i;
k=1;
r=0;
while(j<=N)
{
j=i*k;
if(j>i) S[j]=S[j]-1;
k++;
if(j<=N) r++;
}
S[i]=S[i]-r;
}
l=0;
for(i=1;i<=N;i++)
{
l=l+S[i];
}
g<<l;
g.close();
return 0;
}