Cod sursa(job #569936)
| Utilizator | Data | 2 aprilie 2011 12:50:36 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
#define dim 1000002
long long v[dim];
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, i, j, a, b;
for(i=1;i<=dim;++i)
for(j=i;j<dim;j+=i)
v[j]+=i;
for(i=1;i<=dim;++i)
v[i]=v[i]+v[i-1];
fin>>n;
fout<<n;
//for(i=1;i<=n;++i)
//{
// fin>>a >>b;
// fout<<v[b]-v[a-1]<<'\n';
// }
return 0;
}