Cod sursa(job #1916285)
Utilizator | Data | 9 martie 2017 08:52:52 | |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <cmath>
#include <fstream>
using namespace std;
char a[2000001];
int n,i,r,j,cnt,x,k;
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for(i=2;i<=n;i++) a[i]=1;
for(i=2;i<=n;i++)
if(a[i]==1)
{
for(j=i+i;j<=n;j=j+i)
a[j]=0;
cnt++;
}
fout<<cnt;
return 0;
}