Adrian099的博客

A - Donut Shops CodeForces - 1373AThere are two rival donut shops.The first shop sells donuts at retail: each donut costs a dollars.The second shop sells donuts only in bulk: box of b donuts costs c dollars. So if you want to buy x donuts from this sho

A - Common Subsequence水题 直接上代码#include <iostream>#include <vector>#include <string>#include <queue>#include <algorithm>#include <cmath>#include <ctime>#include <cstdio>#include <sstream>#inc

这场一共过了3个大水题题 排名倒数 捞的一逼主要问题 : 1 读题效率太低 十几分钟才能读懂一个题 对于题目意思理解模糊 水题过的也不够快 2. 一卡题就丧失积极性了，容错率太低题意思路： 遍历一遍看看从2到N有没有比第一个大的代码：#include<bits/stdc++.h>using namespace std;int a[10001];int main(){ int N; cin >> N; for(int i = 0; i <

C - A Cookie for You CodeForces - 1371C题意 : 用菱形组成图示图按 有几种方案思路 : 恶心的一比 刚开始没看懂wa了好激发 实际输出n即可代码：#include<iostream>#include<queue>#include<stack>#include<cstring>#include<stdlib.h>#include<cstdio>#include<iost

A - Magical Sticks CodeForces - 1371AA penguin Rocher has n sticks. He has exactly one stick with length i for all 1≤i≤n.He can connect some sticks. If he connects two sticks that have lengths a and b, he gets one stick with length a+b. Two sticks, that