Cod sursa(job #791810)
Utilizator | Data | 25 septembrie 2012 15:03:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,numar;
char v[20000005];
int main()
{
f>>n;
for(int i=2;i<=n;i++)
if(v[i]==0)
{
numar++;
for(int j=i;j<=n;j+=i)
v[j]='1';
}
g<<numar;
return 0;
}