Cod sursa(job #3036587)
Utilizator | Data | 24 martie 2023 16:59:25 | |
---|---|---|---|
Problema | Paduri de multimi disjuncte | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool f[2000005];
int cnt,n;
int main()
{
fin>>n;
f[0]=1;
f[1]=1;
for(int i=2;i<=n;i++)
{
if(f[i]==0)
{
cnt++;
for(int j=2;j<=n/i;j++)
{
f[i*j]=1;
}
}
}
fout<<cnt;
fin.close();
fout.close();
return 0;
}