Cod sursa(job #2377505)
| Utilizator | Data | 10 martie 2019 13:56:34 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,k=0;
f>>n;
int a[n]={0};
for(int i=0;i<n;i++){
a[i]=1;
}
for(int i=2;i<n;i++){
if(a[i]==1){
for(int j=2;j*i<n;j++){
a[j*i]=0;
}
k++;
}
}
g<<k;
return 0;
}
