Cod sursa(job #1494906)
Utilizator | Data | 1 octombrie 2015 23:02:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <bits/stdc++.h>
#define N
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int v[1999990];
int main()
{
int i,n,k=0,j;
f>>n;
for(i=2;i<=n;i++)
v[i]=i;
for(i=2;i<=n;i++)
{
if(v[i]!=0)
k++;
for(j=i+i;j<=n;j+=i)
v[j]=0;
}
g<<k;
return 0;
}