Cod sursa(job #1242514)
Utilizator | Data | 14 octombrie 2014 16:30:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
#include <cstdio>
using namespace std;
long long n,i,j,nr;
bool v[2000100];
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++){
j=i*2;
while(j<=n){
v[j]=false;
j+=i;}}
for(i=1;i<=n;i++)
if(v[i])nr++;
g<<nr;
return 0;}