摘要:
Codeforces Round #690 (Div. 3) A. Favorite Sequence Solution 按要求输出即可 #include <iostream> #include <vector> using namespace std; const int maxn = 333; 阅读全文
摘要:
AtCoder Beginner Contest 185 A - ABC Preparation Solution 输出最小值 #include <iostream> #include <algorithm> using namespace std; int main() { int a1, a2, 阅读全文
摘要:
Codeforces Round #686 (Div. 3) A. Special Permutation Solution: 偶数直接倒序,奇数将前$n - 1$个倒序,最后将1和n互换位置。 Code: #include <iostream> using namespace std; int m 阅读全文
摘要:
Atcoder Beginner Contest 184 A-Determinant Solution: 输出$ad-bc$ #include <iostream> using namespace std; int main() { int a, b, c, d; cin >> a >> b >> 阅读全文
摘要:
AtCoder Beginner Contest 183 F-Confluence Problem Statement \(N\) students are about to go to school. Student \(i\) belongs to Class \(C_i\). After le 阅读全文
摘要:
牛客小白月赛29-B二进制 题目描述: scimoon 有一个坏掉的计算器,这个计算器仅接受 $0\sim 2^{20}-1$ 的数 这个计算器只支持一种操作,举个例子,输入一个数 x,这个数会按顺序进行 n 次操作,在第 i 次操作中,有一个操作符 $op_i$ 和一个数 $a_i$ 如果 \ 阅读全文
摘要:
D:Returning Home-Codeforces Round #675 (Div. 2) Problem: Yura has been walking for some time already and is planning to return home. He needs to get h 阅读全文
摘要:
The Rotation Game UVA - 1343 Problem: Solution: IDA*经典题,难点有两个: 乐观估价函数,因为每次移动最多导致一个1/2/3进入中间的八个格子中,所以如果当前中间的1/2/3的数量加上剩余迭代次数小与8则必然无法到达,剪枝。 移动的操作方式,具体见代 阅读全文
摘要:
The Morning after Halloween(UVA-1601) Problem:https://vjudge.net/problem/UVA-1601 Input: 5 5 2 ##### #A#B# # # #b#a# ##### 16 4 3 ################ ## 阅读全文
摘要:
Equilibrium Mobile(UVA-12166) Problem A mobile is a type of kinetic sculpture constructed to take advantage of the principle of equilibrium. It consis 阅读全文