Cod sursa(job #1028726)
Utilizator | Data | 14 noiembrie 2013 16:57:15 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
char v[2000001];
int main()
{
int n,k=0,i,j;
f>>n;
for( i=2;i<=n;i++)
{
if(v[i]==0)
{
for(j=i+i;j<=n;j+=i)
v[j]=1;
}
}
for(int i=2;i<=n;i++)
{
if(v[i]==0)k++;
}
g<<k;
return 0;
}