- 博客(3)
- 资源 (2)
- 收藏
- 关注
RSS订阅原创 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
173
原创 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
288
原创 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
302
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人