Cod sursa(job #965354)
Utilizator | Data | 23 iunie 2013 23:17:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
using namespace std;
#include<fstream>
ifstream eu("ciur.in");
ofstream tu("ciur.out");
#define Nmax 2000005
bool prim[Nmax];
int N,ct;
int main()
{
int i,j;
eu>>N;
for(i=2;i<=N;i++)
prim[i]=1;
for(i=2;i<=N;i++)
{
if(prim[i]==1)
{
ct++;
for(j=i+i;j<=N;j=j+i)
prim[j]=0;
}
}
tu<<ct<<"\n";
return 0;
}