he_qingjun的博客

位运算位运算。。。 AC代码： #include <iostream> #include <stdio.h> #include <stdlib.h> #include <math.h> using namespace std; typedef long long ll; int main(){ ll x,s; while(~scanf("%lld%lld",&x,&s)){ ll ans = .

下面的是二进制法，第一个是数字版的，第二个是非连续数字版的 解释看代码 #include <iostream> #include <string> using namespace std; int main(){ int n; cin >> n; for(int i = 0;i<(1<<n);i++){ //因为1-n的子集有2^n个 int cnt = 0; //用来控制格式输出的 cout << "{

题目：https://codeforces.com/contest/1547/problem/D Co-growing Sequence A sequence of non-negative integers a1,a2,…,an is called growing if for all i from 1 to n−1 all ones (of binary representation) in ai are in the places of ones (of binary representation)