Cod sursa(job #1107644)
Utilizator | Data | 14 februarie 2014 00:33:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
int i,n,k,v[2000001],j;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++)
v[i]=i;
for(i=2;i<=n;i++)
{
if(v[i]==-1)
i++;
for(j=i*2;j<=n;j=j+i)
v[j]=-1;
}
k=0;
for(i=2;i<=n;i++)
if(v[i]!=-1)
k++;
g<<k;
return 0;
}