#include
#include
#include
using namespace std;
int main()
{
int n;
cin>>n;
bool flag[1005];
memset(flag,0,sizeof(flag));
vector v1;
for(int i=2;
i<=n;
++i)
{
if(flag[i]==0)
{
for(int j=i*i;
j<=n;
j+=i)
flag[j]=1;
for(int j=i;
j<=n;
j*=i)
v1.push_back(j);
}
}
cout< 推荐阅读
- codeforces B. Young Explorers
- codeforces C. Mere Array
- codeforces D. Omkar and Bed Wars
- codeforces C. Omkar and Waterslide
- codeforces B. Omkar and Infinity Clock
- codeforces B. Ternary Sequence
- 题库-CF|【Codeforces Round 370 (Div 2) E】【线段树 等比数列 区间合并】Memory and Casinos 赌场区间[l,r] l进r先出的概率
- 题库-CF|【Codeforces Round 263 (Div 2)C】【贪心 哈弗曼思维】Appleman and Toastman 每个非1size子树延展为2子树的最大权
- Codeforces|Codeforces Round #605 (Div. 3) D. Remove One Element
- Codeforces|Codeforces Round #643 (Div. 2) B.Young Explorers