Cod sursa(job #1047508)
| Utilizator | Data | 4 decembrie 2013 16:51:37 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
#include<cmath>
using namespace std;
int main()
{
fstream in("ciur.in");
fstream out("ciur.out");
int N,i,j,suma=0,p;
bool v[2000001]={0};
in>>N;
for(i=2;i<=N;i++)
if(v[i]==0)
{
for(j=i+i;j<=N;j=j+i)
v[j]=1;
suma=suma+1;
}
out<<suma;
in.close();
out.close();
return 0;
}
