Cod sursa(job #1107620)
Utilizator | Data | 14 februarie 2014 00:03:29 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
using namespace std;
int main()
{
int i,n,j, prim=0;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
bool v[2000000]={};
for(i=2;i<=n;i++)
if(v[i]==false)
{
prim++;
for(j=2*i;j<=n;j=j+i)
{v[j]=true;}
}
g<<prim;
return 0;
}