Cod sursa(job #1113160)
| Utilizator | Data | 20 februarie 2014 13:20:24 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.3 kb |
#include<fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int v[2000005],n,k,j,i;
int main(){
fin>>n;
for(i=2;i<=n;i++){
if(v[i]==0){
k++;
for(j=i+i;j<=n;j=j+i)
v[j]=1;
}
}
fout<<k;
}
