Cod sursa(job #2316739)
| Utilizator | Data | 12 ianuarie 2019 12:40:09 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
char v[2000005];
int n,nr;
int main()
{
int i,j;
f>>n;
v[0]=v[1]=1;
for(i=2;i<=n;i++)
{
if(v[i]==0)
{
nr++;
for(j=i*2;j<=n;j+=i)
v[j]=i;
}
}
g<<nr;
return 0;
}
