摘要:
1 /*UVa 11292 Dragon of Loowater*/ 2 #include 3 #include 4 #include 5 #include 6 using namespace std; 7 int n,m; 8 int main(){ 9 while(scanf("%d%d",&n,&m) && n!=0 && m!=0){ 10 in... 阅读全文
摘要:
然而等于是默了一遍标程 阅读全文
摘要:
quicksum Given a string of digits, find the minimum number of additions required for the string to equal some target number. Each addition is the equi 阅读全文