Cod sursa(job #1118453)
Utilizator | Data | 24 februarie 2014 11:13:38 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream d("ciur.in");
ofstream o("ciur.out");
const int N=1+2e7;
int n,i,j,nr;
bool q[N];
int main()
{
d>>n;
for(int i=2;i<=n;i++)
if(!q[i])
{
nr++;
for(j=1;i*j<=n;j++)
q[i*j]=true;
}
o<<nr;
return 0;
}