Cod sursa(job #2999760)
Utilizator | Data | 11 martie 2023 14:19:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int cnt, n;
int v[2000002];
int main()
{
f>>n;
for(int i=2; i<=n; i++)
if(v[i]==0)
{
cnt++;
for(int j=i+i; j<=n; j+=i)
v[j]=1;
}
g<<cnt;
return 0;
}