摘要：
https://ac.nowcoder.com/acm/contest/338/I 题解：首先轮到出手的时候如果在（0,0）上肯定是输的，而（0,1）（1,0）（0,2）（2,0）（1,1）肯定是赢的; 往上递推，某一个（x，y）如果可以走的（x-1，y）（x，y-1）（x-1，y-1）三点都是必输 阅读全文
posted @ 2019-01-06 19:22
DWVictor
阅读(373)
评论(0)
推荐(0)
摘要：
链接：https://ac.nowcoder.com/acm/contest/338/J来源：牛客网 题目描述 Less taolu, more sincerity. This problem is very easy to solve. You may be very tired during t 阅读全文
posted @ 2019-01-06 19:11
DWVictor
阅读(427)
评论(0)
推荐(0)
摘要：
链接：https://ac.nowcoder.com/acm/contest/338/G来源：牛客网 题目描述 This is a very simple problem! Your only job is to calculate a + b + c + d! 输入描述: There are se 阅读全文
posted @ 2019-01-06 19:09
DWVictor
阅读(350)
评论(0)
推荐(0)
摘要：
链接：https://ac.nowcoder.com/acm/contest/338/H来源：牛客网 题目描述 Kuangyeye is a dalao of the ACM school team of Hunan University. His favorite food are hamburg 阅读全文
posted @ 2019-01-06 19:02
DWVictor
阅读(523)
评论(0)
推荐(0)
摘要：
https://ac.nowcoder.com/acm/contest/338/G 链接：https://ac.nowcoder.com/acm/contest/338/G来源：牛客网 题目描述 This is a very simple problem! Your only job is to c 阅读全文
posted @ 2019-01-06 14:01
DWVictor
阅读(1510)
评论(0)
推荐(0)
浙公网安备 33010602011771号