Cod sursa(job #2018891)
| Utilizator | Data | 6 septembrie 2017 12:07:36 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
using namespace std;
bool v[2000000];
int n;
void ciur ()
{
int i;
v[0]=1;
v[1]=1;
int j;
for (i=2;i<=n;i++)
{
if (v[i]==0)
{
for (j=i+i;j<=n;j=j+i)
{
v[j]=1;
}
}
}
}
int main()
{
ifstream in("ciur.in");
ofstream out("ciur.out");
in>>n;
int i;
int s=0;
ciur();
for (i=1;i<=n;i++)
{
if (v[i]==0)
{
cout<<i<<"\n";
s++;
}
}
cout<<"\n"<<s;
in.close();
out.close();
return 0;
}
