Cod sursa(job #1308728)
Utilizator | Data | 4 ianuarie 2015 16:37:29 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<iostream>
#include<fstream>
#define nmax 2000005
using namespace std;
int main()
{
int n,i,j,c;
bool a[nmax];
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=1;i<=n;i++) a[i]=0;
c=1;
for(i=3;i<=n;i+=2)
if(a[i]==0)
{for(j=i+i;j<=n;j+=i) a[j]=1;
c++;}
g<<c;
return 0;
}