Cod sursa(job #1637503)
Utilizator | Data | 7 martie 2016 17:47:40 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
int n, i=2, j, az=0, t[1000]={0}, tor=0;
f>>n;
for(j=1; j<=n; j++)
t[j]=j;
t[1]=0;
while(i*i<=n)
{
for(j=i+1; j<=n; j++)
{
if(j%i==0)
{
t[j]=0;
}
}
i++;
}
for(i=1; i<=n; i++)
{
if(t[i]!=0)
az++;
}
g<<az;
return 0;
}