摘要:
对于这题看完正解之后才知道该如何解决;先分别输入数,并标记其出现的次数;然后用Sort快排函数从小到大排序;然后从左到右暴力枚举,看是否这个数出现过;代码: 1 #include 2 #include 3 #include 4 #include 5 using namespace std; 6 7... 阅读全文
摘要:
World Cup NoiseTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 16369Accepted: 8095DescriptionBackground "KO-RE-A, KO-RE-A" shout 54.000 happ... 阅读全文
摘要:
Recaman's SequenceTime Limit:3000MSMemory Limit:60000KTotal Submissions:22363Accepted:9605Descriptio... 阅读全文
摘要:
Time Limit:1000MSMemory Limit:10000KTotal Submissions:42232Accepted:25527Description73 88 1 02 7 4 44 5 2 6 5(Figure 1)Figure 1 sh... 阅读全文