Cod sursa(job #189143)
| Utilizator | Data | 12 mai 2008 12:56:13 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.61 kb |
#include<fstream>
using namespace std;
int main()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
int i,S[1000001],j,k,r,l;
long 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;
}