SDAU_ZG

摘要： Problem Description 在N*N的方格棋盘放置了N个皇后，使得它们不相互攻击（即任意2个皇后不允许处在同一排，同一列，也不允许处在与棋盘边框成45角的斜线上。你的任务是，对于给定的N，求出有多少种合法的放置方法。 Input 共有若干行，每行一个正整数N≤10，表示棋盘和皇后的数量； 阅读全文

摘要： Problem Description Mr. West bought a new car! So he is travelling around the city.One day he comes to a vertical corner. The street he is currently i 阅读全文

摘要： Problem Description There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black til 阅读全文

摘要： Problem Description Now, here is a fuction:<br>&nbsp;&nbsp;F(x) = 6 * x^7+8*x^6+7*x^3+5*x^2-y*x (0 &lt;= x &lt;=100)<br>Can you find the minimum value 阅读全文

摘要： Problem Description There is a strange lift.The lift can stop can at every floor as you want, and there is a number Ki(0 <= Ki <= N) on every floor.Th 阅读全文

摘要： The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of 阅读全文

摘要： Problem Description A有1数m，B来猜.B每猜一次，A就说&quot;太大&quot;，&quot;太小&quot;或&quot;对了&quot; 。 <br>问B猜n次可以猜到的最大数。 <br> Input 第1行是整数T,表示有T组数据，下面有T行 <br>每行一个整数n 阅读全文

摘要： 问题描述：A factory produces products packed in square packets of the same height h and of the sizes 1*1, 2*2, 3*3, 4*4, 5*5, 6*6. These products are alway 阅读全文

摘要： 问题描述："Yakexi, this is the best age!" Dong MW works hard and get high pay, he has many 1 Jiao and 5 Jiao banknotes(纸币), some day he went to a bank and 阅读全文

摘要： 问题描述：Current work in cryptography involves (among other things) large prime numbers and computing powers of numbers among these primes. Work in this a 阅读全文