这是一道数学题 可惜我太菜了 只有看了题解才会做 #include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const long long inf=1e18;
inline long long read(){long long x=0,f=1,ch
Codeforces Global Round 1 题解:The Editorial of the First Codeforces Global Round code1083,A:其实mod 2计算一下就行了 B:删掉最长的k-1段,sort C: Code Blocks?x是a的二进制最高位, 考虑对于a!=2^(x+1)-1,
cf劲啊 原题: We have a string of letters 'a' and 'b'. We want to perform some operations on it. On each step we choose one of substrings "ab" in the string and replace it with the string "bba". If we have no "ab&