Cod sursa(job #880204)
Utilizator | Data | 16 februarie 2013 14:49:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
long int v[2000000];
int main()
{
long int n,s=0;
in>>n;
for(int k=2;k<=n;k++)
{
if(v[k]==0)
{
s++;
v[k]=1;
}
for(int i=k*2;i<=n;i=k+i)
{
if(i%k==0) v[i]=1;
}
}
out<<s;
}