Cod sursa(job #795498)
Utilizator | Data | 8 octombrie 2012 21:32:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
bool prim[2000005];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,j,nr;
nr=0;
for(i=2;i<=n;i++)
{
if(prim[i]==0)
{
nr++
for[j=i+i;j<=n;j+=i]
prim[j]=1;
}
g << nrl
return 0;
}