Cod sursa(job #1504167)
Utilizator | Data | 17 octombrie 2015 14:22:48 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
int v[1000];
int main()
{
int n,k=0,j,i;
in>>n;
for (i=2; i<=n; i++)
{
if (v[i]==0)
{
for (j=i; j<=n; j=j+i)
{
v[j]=1;
}
k++;
}
}
out<<k;
return 0;
}