Cod sursa(job #1007421)
Utilizator | Data | 8 octombrie 2013 21:52:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
#include <string.h>
using namespace std;
int n,nr=1;
bool a[2000000];
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
fin>>n;
for(int i=3;i<=n;i+=2)
if(!a[i])
{
nr++;
for(int j=i+i;j<=n;j+=i)
a[j]=1;
}
fout<<nr;
return 0;
}