Cod sursa(job #247582)
Utilizator | George Mihai 630263 | Data | 23 ianuarie 2009 12:30:42 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
const int N=2000001;
int main(){
int n;
f>>n;
char c[N]={0};
for (int i=2;i*i<=n;i++)
if (c[i]==0)
for(int j=i*i;j<=n;j+=i)
c[j]=1;
int nr=0;
for(int i=2;i<=n;i++)
if(c[i]==0)
nr++;
g<<nr<<endl;
return 0;}