Cod sursa(job #1576203)
Utilizator | Data | 22 ianuarie 2016 10:46:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
long long n;
bool c[1000];
f>>n;int i,j;
for (i=0;i<=n;i++)
c[i]=1;
c[0]=0;c[1]=0;
for (i=0;i<n;i++)
{
if (c[i]!=0)
{
j=i;
while(j+i<n)
{
c[i+j]=0;
j=j+i;
}
}
}
int k=0;
for (i=0;i<n;i++)
if (c[i]!=0) k++;
g<<k;
return 0;
}