Cod sursa(job #1605334)
Utilizator | Data | 18 februarie 2016 22:13:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,i,j,k;
char a[2000001];
int main()
{
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
fin>>n;k=1;
for(i=2;i<=n;i++)
if(a[i]==0){k++;
for(j=2;j*i<=n;j++)
a[i*j]='1';}
fout<<k;
return 0;
}