摘要：
恢复内容开始 A - Puzzle Pieces 解题思路：这题就只有n或者m为1；或者n=2，m=2的时候才能够达成题目的目标。所以将这两个特判一下，其他的直接输出NO就行了 1 //#include<bits/stdc++.h> 2 #include <iostream> 3 #include 阅读全文
摘要：
Number Sequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 236241 Accepted Submission(s): 60 阅读全文
摘要：
ICPC North Central NA Contest 2017 部分题解 B. Pokemon Go Go 大意：用最短路径来抓住所有的稀有精灵，DFS求最短路 #include <bits/stdc++.h> #define mem(a) memset(a,0,sizeof(a)) #def 阅读全文
摘要：
Problem Description Contest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is gues 阅读全文
摘要：
借鉴博客：https://blog.csdn.net/hollay/article/details/89433928 https://blog.csdn.net/Alibaba_lhl/article/details/79914061 Problem Description Given a sequ 阅读全文
摘要：
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 515227 Accepted Submission(s): 98635 Problem Desc 阅读全文
摘要：
You're given an array a1,…,ana1,…,an of nn non-negative integers. Let's call it sharpened if and only if there exists an integer 1≤k≤n1≤k≤n such that 阅读全文
摘要：
Let's define a number ebne (even but not even) if and only if its sum of digits is divisible by 22 but the number itself is not divisible by 22. For e 阅读全文
摘要：
Checkers 参考链接：https://blog.csdn.net/imzxww/article/details/79601824 Problem Little X, Little Y and Little Z are playing checkers when Little Y is anno 阅读全文
摘要：
Codeforces 519 E - A and B and Lecture Rooms Problem A and B are preparing themselves for programming contests. The University where A and B study is 阅读全文