Cod sursa(job #2116470)
Utilizator | Data | 27 ianuarie 2018 17:47:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
using namespace std;
int x[2000000],n,k=0;
int main()
{
ifstream in("ciur.in");
ofstream out("ciur.out");
in>>n;
for(int i=2;i<n;i++)
if(x[i]==0)
{
k++;
for(int j=i+i;j<n;j+=i)
x[j]=1;
}
out<<k;
return 0;
}