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