PHarr

摘要： A - Children and Candies (ABC Edit) n = int(input()) print( n * (n+1) // 2 ) B - Unhappy Hacking (ABC Edit) 用栈模拟一下？但是栈的遍历比较麻烦这里用vector实现 #include<bits 阅读全文

摘要： A - Fighting over Candies 签到 #include <bits/stdc++.h> using namespace std; int read(){...} const int N = 1e6+5; int main(){ int a = read() , b = read( 阅读全文