Cod sursa(job #3369339)
| Utilizator | Data | 19 octombrie 2026 19:26:05 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream o("ciur.out");
int v[2000001];
void ciur(int n)
{
int i,j;
v[1]=1;
for(int i=4;i<=n;i+=2)
v[i]=1;
for(i=3;i*i<=n;i+=2)
{
if(v[i]==0)
{
for(j=i*i;j<=n;j+=2*i)
v[j]=1;
}
}
}
int main()
{
int n,s=0;
f>>n;
ciur(n);
for(int i=2;i<=n;i++)
{
if(v[i]==0)
s++;
}
o<<s;
return 0;
}