Cod sursa(job #863239)
Utilizator | Data | 23 ianuarie 2013 17:09:50 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<iostream>
#include<fstream>
using namespace std;
int n,g;
char l[20000000];
int main()
{
int j,i;
ifstream r("ciur.in");
ofstream z("ciur.out");
r>>n;
for(i=2; i<=n; i++)
l[i]=1;
for(i=2; i<=n; i++)
if(l[i]!=0)
{
g++;
for(j=i+i; j<=n; j+=i)
l[j]=0;
}
z<<g;
}