![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM题解
文章平均质量分 78
ACShine
这个作者很懒,什么都没留下…
展开
-
TOJ 1296 Prime Distance
The branch of mathematics called number theory is about properties of numbers. One of the areas that has captured the interest of number theoreticians for thousands of years is the question of primali原创 2010-01-23 20:10:00 · 575 阅读 · 0 评论 -
TOJ 1138. Binomial Showdown
In how many ways can you choose k elements out of n elements, not taking order into account? Write a program to compute this number.Input SpecificationThe input file will contain one or more test原创 2010-01-28 20:37:00 · 618 阅读 · 0 评论 -
ZOJ Problem Set - 1091 Knight Moves
BFS+STL-queue教学级题目 #include#includeusing namespace std;struct point{ int x; int y; int step;}st,et;int mp[10][10];queuemv;void visit(){ point pp; if(mv.front().x+10&&mp[m原创 2010-02-23 15:49:00 · 556 阅读 · 0 评论 -
ZOJ Problem Set - 3301 Make Pair
浙大月赛由于zoj貌似不存代码,那俺就贴博客上好了……http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3301 #includeusing namespace std;struct point { int num; int value;}po[10050];struct part原创 2010-02-23 16:19:00 · 758 阅读 · 0 评论 -
ZOJ Problem Set - 1093Monkey and Banana
简单DP #include#include#includeusing namespace std;struct point{ int x; int y; int value; int wi;}mp[10000];int cmp(point a,point b){ if(a.x==b.x)return a.y<b.y; re原创 2010-03-03 20:50:00 · 418 阅读 · 0 评论