一本通1109
#include <bits/stdc++.h>
#define rep(i,j,n) for(register int i=j;i<=n;i++)
#define Rep(i,j,n) for(register int i=j;i>=n;i--)
#define low(x) x&(-x)
using namespace std ;
typedef long long LL ;
const int inf = INT_MAX >> 1 ;
inline LL In() { LL res(0) , f(1) ; register char c ;
#define gc c = getchar()
while(isspace(gc)) ; c == '-' ? f = - 1 , gc : 0 ;
while(res = (res << 1) + (res << 3) + (c & 15) , isdigit(gc)) ;
return res * f ;
#undef gc
}
int n , m ;
const int N = 5000 + 5 ;
bool vis[N] ;
bool flg(1) ;
inline void Ot() {
n = In() , m = In() ;
rep(i,1,n) vis[i] = 0 ;
rep(i,1,m) rep(j,1,n/i) vis[i*j]^=1 ;
rep(i,1,n) {
if(!vis[i]) continue ;
if(flg) {
cout << i , flg = 0 ;
continue ;
}
cout << ',' << i ;
}
}
signed main() {
// freopen("test.in","r",stdin) ;
return Ot() , 0 ;
}
不存在十全十美的文章 如同不存在彻头彻尾的绝望