摘要:
分母是一定的C(m,3) 树状数组求每一个数能够在那些段中出现,若x出如今了s段中,分子加上w[x]*C(s,3) Victor and Toys Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/131072 K (Java/O 阅读全文
摘要:
题目例如以下: Being unique is so important to people on Mars that even their lottery is designed in a unique way. The rule of winning is simple: one bets on 阅读全文
摘要:
Description Write a program that finds and displays all pairs of 5-digit numbers that between them use the digits 0 through 9 once each, such that the 阅读全文