Cod sursa(job #1359507)
| Utilizator | Data | 24 februarie 2015 23:07:33 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <vector>
#include <cstdlib>
#include <fstream>
#include <cmath>
using namespace std;
int prime[2000001];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int N,M;
cin>>N;
prime[2]=0;
prime[1]=1;
int l=0;
for(int x=2;x<=N;x++){
if(!prime[x]){
l++;
for(int j=x;j<=N;j+=x)
prime[j]=1;
}
}
cout<<l;
return 0;
}
