Cod sursa(job #1249975)
Utilizator | Data | 27 octombrie 2014 18:27:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream ciurin("ciur.in");
ofstream ciurout("ciur.out");
int sir[2000002];
void ciur(int n)
{
int i,j,rez=0;
for (i=2;i<=n;++i)
if (sir[i]==0){
++rez;
for (j=i+i;j<=n;j+=i)
sir[j]=1;
}
ciurout<<rez;
}
int main()
{
int n,i;
ciurin>>n;
ciur(n);
return 0;
}