摘要：
Integer InquiryTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9196Accepted Submission(s): 2354Problem DescriptionOne of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 阅读全文
摘要：
Robot MotionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5011Accepted Submission(s): 2321Problem DescriptionA robot has been programmed to follow the instructions in its path. Instructions for the next direction the robot is to move are laid dow 阅读全文
摘要：
康托展开： 对于全排列中形成的一个数组，可以知道他是排列中的第几种...具体公式为：X=an*(n-1)!+an-1*(n-2)!+...+ai*(i-1)!+...+a2*1!+a1*0! 其中，a为整数数组，并且0 2 #include 3 using namespace std; 4 int main() 5 { 6 int arr[12]={1},t,i,j,count; 7 long long sum; 8 for(i=1;i>t;12 while(t--)13 {14 scanf("%s",str);15 sum=0;... 阅读全文
摘要：
Computer TransformationTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4842 Accepted Submission(s): 1769 Problem DescriptionA sequence consisting of one digit, the number 1 is initially written into a computer. At each successive time step, the c 阅读全文