苏格拉没有底

Palindrome Numbers Time Limit:1000MS Memory Limit:65536K Total Submissions:3948 Accepted:1505 Descr...

题目描述 A mining base needs to build some robots to collect at least 10000 units of resource. Each robot will start from the base, reach the diggings in S minutes, work for W minutes, and then take C un...

题目描述 Let { A1,A2,...,An } be a permutation of the set{ 1,2,..., n}. If i < j and Ai > Aj then the pair (Ai,Aj) is called an "inversion" of the permutation. For example, the permutation {3, ...

原题地址 #include<cstdio> #include<cstring> #include<algorithm> #include<iostream> #include<string> #include<vector> #include<stack> #include<bitset> #in...