Cod sursa(job #1010844)
Utilizator | Data | 15 octombrie 2013 20:02:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream>
#define nmax 2000005
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,count;
char used[nmax];
int main()
{
int i,j;
f>>n;
for(i=2; i<=n; ++i)
used[i]=1;
for(i=2; i<=n; ++i)
if(used[i])
{
++count;
for(j=i+i; j<=n; j+=i)
used[j]=0;
}
g<<count<<"\n";
return 0;
}