Cod sursa(job #1490514)
Utilizator | Data | 23 septembrie 2015 18:26:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
char ciur[20000001];
int main()
{
int n,k=0,i,j;
in>>n;
for(i=2;i<=n;i++)
ciur[i]=1;
for(i=2;i<=n;i++)
if(ciur[i])
{k++;
for(j=2*i;j<=n;j=j+i)
ciur[j]=0;}
out<<k;
return 0;
}