Cod sursa(job #613945)
| Utilizator |  Daniel Toniuc dtoniuc |
Data | 5 octombrie 2011 09:27:01 |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.3 kb |
#include <iostream>
#include <fstream>
using namespace std;
char x[2000001];
int main()
{
int n,nr=0;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for (int i=2;i<=n;i++)
{
if(x[i]==0)
{
nr++;
for(int j=2;i*j<=n;j++)
x[i*j]=1;
}
}
fout<<nr;
return 0;
}