Cod sursa(job #445376)
Utilizator | Data | 23 aprilie 2010 17:29:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include<iostream>
#include<fstream.h>
char v[2000001]={0};long i,k,j,n;
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for(i=2;i<=n;i++)
if(v[i]==0)
{
k++;
for(j=2;j<=n/i;j++)
v[i*j]=1;
}
fout<<k;
fin.close();
fout.close();
return 0;}