Cod sursa(job #895155)
Utilizator | Data | 27 februarie 2013 10:17:31 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
char v[2000005];
int main()
{
int n=0,i,t=0,k;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for (i=2;i<=n;i++)
if (v[i]==0)
{
k=2;
t++;
while (i*k<=n)
{
v[i*k]=1;
k++;
}
}
fout<<t;
return 0;
}