Cod sursa(job #1650134)
Utilizator | Data | 11 martie 2016 16:46:58 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <stdio.h>
using namespace std;
int ciur[2000100],n,k;
void citire()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
}
void rez()
{
for(int i=2;i<=n;i++)
if(!ciur[i])
{
k++;
for(int j=i*2;j<=n;j+=i)
ciur[j]=1;
}
}
int main()
{
citire();
rez();
printf("%d",k);
return 0;
}