Cod sursa(job #1242508)
Utilizator | Data | 14 octombrie 2014 16:26:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#include <cstdio>
#define M 2000010
using namespace std;
long long n,i,div,nr;
bool v[M];
int main(){
freopen("ciur.in","r",stdin);
ofstream g ("ciur.out");
scanf("%d",&n);
for(i=2;i<=n;i++)
v[i]=true;
for(i=2;i<=n;i++){
div=i*2;
while(div<=n){
v[div]=false;
div+=i;}}
for(i=1;i<=n;i++)
if(v[i])nr++;
g<<nr;
return 0;}