摘要: Colonel has n badges. He wants to give one badge to every of his n soldiers. Each badge has a coolness factor, which shows how much it's owner reached 阅读全文
posted @ 2017-07-20 19:21 Edee 阅读(189) 评论(0) 推荐(0) 编辑
摘要: There is a famous railway station in PopPush City. Country there is incredibly hilly. The station was built in last century. Unfortunately, funds were 阅读全文
posted @ 2017-07-20 16:50 Edee 阅读(190) 评论(0) 推荐(0) 编辑
摘要: 读入一个只包含 +, -, *, / 的非负整数计算表达式,计算该表达式的值。 Input测试输入包含若干测试用例,每个测试用例占一行,每行不超过200个字符,整数和运算符之间用一个空格分隔。没有非法表达式。当一行中只有0时输入结束,相应的结果不要输出。 Output对每个测试用例输出1行,即该表达 阅读全文
posted @ 2017-07-19 20:41 Edee 阅读(600) 评论(0) 推荐(0) 编辑
摘要: Ray又对数字的列产生了兴趣: 现有四张卡片,用这四张卡片能排列出很多不同的4位数,要求按从小到大的顺序输出这些4位数。 Input每组数据占一行,代表四张卡片上的数字(0<=数字<=9),如果四张卡片都是0,则输入结束。 Output对每组卡片按从小到大的顺序输出所有能由这四张卡片组成的4位数,千 阅读全文
posted @ 2017-07-19 11:24 Edee 阅读(642) 评论(0) 推荐(0) 编辑
摘要: 这是一段 WA代码........... #include #include #include using namespace std; void main() { stack c; int T,len; cin >> T; getchar(); string str; while (T--) { getline(c... 阅读全文
posted @ 2017-07-18 20:28 Edee 阅读(158) 评论(0) 推荐(0) 编辑
摘要: #include #include #include #include using namespace std; typedef long long LL; const int coeff[3] = { 2,3,5 }; int main() { priority_queue, greater >pq; sets; pq.push(1); s.insert(1)... 阅读全文
posted @ 2017-07-18 10:55 Edee 阅读(117) 评论(0) 推荐(0) 编辑
摘要: 1 #include 2 using namespace std; 3 int main() 4 { 5 int T, n; 6 cin >> T; 7 while (T--) 8 { 9 cin >> n; 10 if (n 3) 26 ... 阅读全文
posted @ 2017-07-18 09:13 Edee 阅读(264) 评论(0) 推荐(0) 编辑
摘要: 2017-07-172017-07-172017-07-17 阅读全文
posted @ 2017-07-17 10:35 Edee 阅读(239) 评论(0) 推荐(0) 编辑