Rotepad的博客

题目：Mad scientist Mike has just finished constructing a new device to search for extraterrestrial intelligence! He was in such a hurry to launch it for the first time that he plugged in the power wir...

题目：outputstandard outputMad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.However, all Mike has is lots o...

题目：Little Petya has a birthday soon. Due this wonderful event, Petya's friends decided to give him sweets. The total number of Petya's friends equals ton.Let us remind you the definition of the g...

题目：传送门代码：#include <bits/stdc++.h>using namespace std;int main(){ int T; scanf("%d", &T); while (T--) { char a[100005], b[100005]; int aa, bb, c; ...

题目：Recently Maxim has found an array ofnintegers, needed by no one. He immediately come up with idea of changing it: he invented positive integerxand decided to add or subtract it from arbitrary...

题目：戳一戳题解：哎，当时真没想到会要二分啊，不过加深了自己对lower_bound跟upper_bound的理解，先找到直接生成的。然后通过暴力（结合二分）去求解。代码：#include<bits/stdc++.h>#define LL long long#define N 200005using namespace std;int m,k;LL n,x,s,...

题目：CodeForces - 849A 题意：给定一个序列，问能否将其划分为奇数个子序列，并且每个子序列都是奇数个，并且每个子序列的头尾元素都是奇数。题解：想复杂了。1. n个数，如果首尾为偶数，那么肯定不行2. n个数，有奇数段，每段有奇数个，那么肯定满足总数n也为奇数，这样的话就说明让他本身为一个序列就可以满足了，所以当首尾为奇数时，直接判断n是否为奇数就行代码：...