Cod sursa(job #2244541)
Utilizator | Data | 22 septembrie 2018 23:54:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{ifstream f("ciur.in");
ofstream g("ciur.out");
int N,k=0;
char a[2000004];
f>>N;
for(int i=2;i<=N;i++)
a[i]=1;
for(int i=2;i<=N;i++)
{
if(a[i])
{k++;
for(int j=i+i;j<=N;j=j+i)
a[j]=0;}}
g<<k;
return 0;}