Cod sursa(job #1496652)
| Utilizator | Data | 5 octombrie 2015 12:25:58 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main(){
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n;
fin>>n;
int v[n],suma=0;
for(int i=1;i<=n;++i){
v[i]=0;
}
for(int i=2;i<=n;++i){
if(v[i]==1)continue;
suma++;
for(int j=2;j<=n;++j){
if(i*j>n)break;v[i*j]=1;
}
}
fout<<suma;
}
