Cod sursa(job #1004197)
Utilizator | Data | 2 octombrie 2013 11:47:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
char a[2000001];
int main()
{
int n,i,j,count;
ifstream fin("ciur.in");
fin>>n;
fin.close();
for(i=3;i*i<=n;i+=2)
if(a[i]==0)
for(j=i*i;j<=n;j+=2*i)
a[j]='1';
count = 1;
for (i=3;i<=n;i+=2)
if (a[i] == 0) count++;
ofstream fout("ciur.out");
fout<<count<<"\n";
fout.close();
return 0;
}