Cod sursa(job #1121884)
Utilizator | Data | 25 februarie 2014 14:37:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int n,x[2000002];
int main()
{ in>>n;int i,j,k=0;
double radb;
radb=sqrt((double)n);
for( i=2;i<=radb;i++)
for(j=i*i;j<=n;j=j+i)
{if(x[j]==0)k++;x[j]=1;}
out<<n-k-1;
return 0;
}