Teilwall

摘要： 题目：DescriptionThe recreation center of WHU ACM Team has indoor billiards, Ping Pang, chess and bridge, toxophily, deluxe ballrooms KTV rooms, fishing, climbing, and so on.We all like toxophily.Bob is hooked on toxophily recently. Assume that Bob is at point (0,0) and he wants to shoot the fruits on 阅读全文

摘要： 题目：DescriptionA square is a 4-sided polygon whose sides have equal length and adjacent sides form 90-degree angles. It is also a polygon such that rotating about its centre by 90 degrees gives the same polygon. It is not the only polygon with the latter property, however, as a regular octagon also h 阅读全文

摘要： 链接：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=27642#overview这一次是二分、三分全场.............也是本人我第一次做这类的题目.......虽然如此但感觉还不错.....这次的组队赛名次与上次持平，但AC个数与第一名相同，只是时间多了......总体来说有进步~嗯~队友给力啊~~A.POJ 1905 Expanding Rods给出了弧长L和弧长两端的直线l距离，求弧长和直线的最大距离~采用二分求圆的半径，在l/2和一个代入式子中能使L'小于所给的L的半径之间二分求取合适的半径r(L'= 阅读全文

摘要： 题目：DescriptionThe only printer in the computer science students' union is experiencing an extremely heavy workload. Sometimes there are a hundred jobs in the printer queue and you may have to wait for hours to get a single page of output.Because some jobs are more important than others, the Hack 阅读全文

摘要： 题目链接：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=27454#overview比赛.........还是英语没学好啊........有些题目看不懂.............= =A.Printer Queue//单独讲.............B.Parencodings很简单.......我是开了三个数组a[n],b[n],c[n]-------------a[n]代表输入的n个数，b[n]代表是输出的n个数，c[n]代表n个左括号的状态（配对了还是没有配对）；b[0]=1;若a[i]-a[i-1]>0,那么i右括号所 阅读全文

摘要： 题目：E -A simple stone gameTime Limit:1000MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 3922DescriptionAfter he has learned how to play Nim game, Mike begins to try another stone game which seems much easier.The game goes like this: Two players start the game with a pi 阅读全文

摘要： 题目链接：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=27048#problem/C数学知识：参考：http://youyouaoshu.i.sohu.com/blog/view/87628890.htm（1） 整数的唯一分解定理： 任意正整数都有且只有一种方式写出其素因子的乘积表达式。 A=(p1^k1)*(p2^k2)*(p3^k3)*....*(pn^kn) 【其中p1,p2,p3.....pi均为质数】（2） 约数和公式：对于已经分解的整数A=(p1^k1)*(p2^k2)*(p3^k3)*....*(pn^kn)（S为. 阅读全文

摘要： 题目链接：http://www.bnuoj.com/bnuoj/contest_show.php?cid=2009#problem/0A.........水题，在学校学C的时候就做过的..............代码如下： 1 #include 2 #include 3 using namespace std; 4 int main() 5 { 6 int n,a,i,j=0; 7 while(scanf ("%d",&n)!=EOF) 8 { 9 j=0;10 if(n==0) break;11 for (i=1;;i++)1... 阅读全文

摘要： //题目链接:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=27048#problem/G没什么好说的，直接暴力.....= = 1 #include 2 #include 3 #include 4 using namespace std; 5 6 #define M 1000000 7 char a[M]; 8 int b[M]; 9 10 int main()11 {12 int T,i,x,j;13 scanf("%d",&T);14 while(T--)15 {16 17 i... 阅读全文

摘要： 题目：DescriptionAssume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each small island is a point locating in the sea side. And any radar installation, locating on the coasting, can only cover d distance, so an island in the sea can be covered by a radiu 阅读全文