Cod sursa(job #3172989)
Utilizator | Data | 21 noiembrie 2023 17:43:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<iostream>
#include <fstream>
using namespace std;
bool t[2000005];
int main()
{
int N,i,S=0,j;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>N;
for(i=2;i*i<=N;i++)
{
for(j=2*i;j<=N;j=j+i)
{
t[j]=true;
}
}
for(i=2;i<=N;i++)
{
if(t[i]==false)
{
S++;
}
}
cout<<S;
return 0;
}