摘要: 坑爹题 1282. Computer Game Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description Brian is an enthusiast of computer games, especially those tha 阅读全文
posted @ 2016-10-20 23:11 KennyRom 阅读(263) 评论(0) 推荐(0) 编辑
摘要: 1753. 解码 Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description ZX是另一头04级的牛,他现在在UPen。他跟LLK经常通信,但他不喜欢直接把信息发给LLK,而是把信息通过一个规则转换后再发给LLK,这让LLK很郁闷。 阅读全文
posted @ 2016-10-20 22:30 KennyRom 阅读(256) 评论(0) 推荐(0) 编辑
摘要: #include #include #include using namespace std; //post expression compute int compute(int num1, int num2, char op) { if (op == '+') return num1 + num2; else if (op == '-') return num1 - num2; ... 阅读全文
posted @ 2016-10-20 12:24 KennyRom 阅读(180) 评论(0) 推荐(0) 编辑
摘要: #include #include #include #include using namespace std; char compare(char tp, char op) { if (((tp == '+' || tp == '-') && (op == '*' || op == '/')) || (tp == '#')) return ''; } int main() { st... 阅读全文
posted @ 2016-10-20 12:06 KennyRom 阅读(459) 评论(0) 推荐(0) 编辑
摘要: #include #include #include #include using namespace std; char compare(char tp, char op) { if (((tp == '+' || tp == '-') && (op == '*' || op == '/')) || tp == '#') return ''; } int main() { stac... 阅读全文
posted @ 2016-10-20 11:05 KennyRom 阅读(162) 评论(0) 推荐(0) 编辑
摘要: #include #include #include using namespace std; char compare(char tp, char op) { if (((tp == '+' || tp == '-') && (op == '*' || op == '/')) || (tp == '#')) return ''; } int compute(int n1, int n... 阅读全文
posted @ 2016-10-20 10:34 KennyRom 阅读(275) 评论(0) 推荐(0) 编辑
摘要: #include #include #include using namespace std; char compare(char tp, char op) { if (((tp == '+' || tp == '-') && (op == '*' || op == '/')) || (tp == '#')) return ''; } int compute(int n1, int n... 阅读全文
posted @ 2016-10-20 09:58 KennyRom 阅读(175) 评论(0) 推荐(0) 编辑