Cod sursa(job #3362995)

Utilizator CorvinJudge0Corvin Judge CorvinJudge0 Data 13 august 2026 12:17:33
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 0.43 kb
#include <fstream>
using namespace std;
const int N=2000000;
bool ciur[N+1];
int n,k;
int main()
{
    ifstream fin("ciur.in")
    ofstream fout("ciur.out")
    fin>>n
       ciur[0]=ciur[1]=1;
    for(int i=2; i<=n; i++)
        if(ciur[i]==0)
            for(int j=i*2; j<=n; j+=i)
            {
                ciur[j]=1;
            }
    for(i=1;i<=n;i++)
    {
      if(ciur[i]==0)
      {
        k++;
      }
    }
        return 0;
}