Cod sursa(job #1494885)
Utilizator | Data | 1 octombrie 2015 22:46:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int v[2000005];
int main()
{
int i,n,k=0,j,a;
f>>n;
for(i=2;i<=n;i++)
v[i]=i;
for(i=2;i<=n;i++)
{
a=1;
while(j<=n)
{
j=i*a;
a++;
v[j]=0;
}
if(v[i]!=0)
k++;
}
g<<k;
return 0;
}