摘要:
Shredding Company Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 6173 Accepted: 3361 Description You have just been put in charge of devel 阅读全文
摘要:
Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 12886 Accepted: 6187 Description A university network is composed of N computers. System ad 阅读全文
摘要:
#include<stdio.h>#define M 1000000007int fp(int a,int b){ long long ret=1,pow=a;//ret:返回值;pow:基底 while(b!=0){ if(b&1) ret=(ret*pow)%M; pow=(pow*pow)%M 阅读全文
摘要:
After having drifted about in a small boat for a couple of days, Akira Crusoe Maeda was finally cast ashore on a foggy island. Though he was exhausted 阅读全文
摘要:
递归求解, You are to determine the value of the leaf node in a given binary tree that is the terminal node of a path of least value from the root of the b 阅读全文
摘要:
Problem Description As we all know the Train Problem I, the boss of the Ignatius Train Station want to know if all the trains come in strict-increasin 阅读全文