![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
刷题记录
iron_head
这个作者很懒,什么都没留下…
展开
-
codeup墓地 问题 A: 简单计算器
codeup墓地 问题 A: 简单计算器// An highlighted block#include<iostream>#include<queue>#include<stack>#include<map>#include<string>#include<cstring>#include<iomanip...原创 2019-09-23 21:06:38 · 256 阅读 · 0 评论 -
A1051 Pop Sequence (25 分)
1051 Pop Sequence (25 分)Given a stack which can keep M numbers at most. Push N numbers in the order of 1, 2, 3, …, N and pop randomly. You are supposed to tell if a given sequence of numbers is a pos...原创 2019-09-24 16:27:26 · 243 阅读 · 0 评论 -
A1056
#include<iostream>#include<queue>using namespace std;class mouse{ public: int weight, rank, num;};int main(){ queue<mouse> q; int i, j, np, ng, temp, groups; scanf("%d%d",...原创 2019-09-25 19:10:28 · 124 阅读 · 0 评论