Cod sursa(job #352018)
| Utilizator | Data | 30 septembrie 2009 08:49:18 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <vector>
#include <fstream>
#include <iostream>
using namespace std;
int main(){
ifstream in("ciur.in");
ofstream out("ciur.out");
int x=0,n=0;in>>n;
vector<bool> v;
v.insert(v.end(),n+1,false);
v[0]=v[1]=true;
for(int i=2;i<=n;i++){
for(int j=i+i;j<=n;j+=i){
v[j]=true;
}
}
for(int i=0;i<=n;i++){
if(!v[i]) x++;
}
out<<x;
}
