Cod sursa(job #2003670)
Utilizator | Data | 23 iulie 2017 16:14:49 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
int e[2000000], n, i, k=0;
f>>n;
for(i=2;i<=n;i++)
e[i]=1;
for(i=2;i<=n;i++)
if(e[i]==1){
for(int j=i+i;j<=n;j+=i) e[j]=0;
k++;
}
g<<k;
}