Cod sursa(job #1685056)
Utilizator | Data | 11 aprilie 2016 14:38:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
int n,i,t,j;
bool o[2000001];
void ciur()
{
int i;
for (i=2;i<=n;i++)
if (!o[i])
{
t++;
for (j=i;j<=n;j+=i) o[j]=1;
}
}
int main()
{
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
fin>>n;
ciur();
fout<<t;
fin.close();
fout.close();
return 0;
}