摘要： Problem Description Alice and Bob are playing a game.The game is played on a set of positive integers from 1 to n.In one step, the player can choose a 阅读全文

摘要： 1 https://www.cnblogs.com/nysanier/archive/2011/04/19/2020778.html 2 3 4 #include 5 #include 6 #include 7 #include 8 #include 9 #include 10 #include 11 #include 12 using namespace ... 阅读全文

摘要： 1 https://blog.csdn.net/yuehailin/article/details/68961304 1 #include <iostream> 2 #include <cstdio> 3 #include <algorithm> 4 #include <cstring> 5 #in 阅读全文

摘要： Distinct Values Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3105 Accepted Submission(s): 1000 阅读全文

摘要： Maximum Multiple Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1500 Accepted Submission(s): 650 阅读全文

摘要： 65536K Let's consider some math problems. JSZKC has a set A=\{1,2,...,N\}A={1,2,...,N}. He defines a subset of AA as 'Meo set' if there doesn't exist 阅读全文

摘要： 阅读全文

摘要： 65536K Persona5 is a famous video game. In the game, you are going to build relationship with your friends. You have NN friends and each friends have 阅读全文

摘要： 65536K 动态归化+滚动数组 JSZKC is the captain of the lala team. There are NN girls in the lala team. And their height is [1,N][1,N] and distinct. So it means 阅读全文

摘要： JSZKC is the captain of the lala team. There are NN girls in the lala team. And their height is [1,N][1,N] and distinct. So it means there are no two 阅读全文