POJ
文章平均质量分 61
tao_tao_bu_jue
-
展开
-
FOJ 1000 PKU 1000 FJNU 1000 A+B Problem
Calculate a + b InputThe input will consist of a series of pairs of integers a and b,separated by a space, one pair of integers per line. OutputFor each pair of input integers a and b you should outpu原创 2008-07-18 19:51:00 · 654 阅读 · 0 评论 -
POJ 1002 487-3279
模拟题-_____________-487-3279Time Limit: 2000MSMemory Limit: 65536KTotal Submissions: 77597Accepted: 12790Description企业喜欢用容易被记住的电话号码。让电话号码容易被记住的一个办法是将它写成一个容易记住的单词或者短语。例如,你需要给滑原创 2008-08-08 09:48:00 · 1265 阅读 · 0 评论 -
FOJ 1543 Avoid The Lakes
Avoid The LakesTime Limit:1sMemory limit:32MAccepted Submit:46Total Submit:60Farmer Johns farm was flooded in the most recent storm, a fact only aggravated by原创 2008-08-08 11:20:00 · 480 阅读 · 0 评论 -
PKU 3619 二项式系数
一个需要好好记下的结论(n&k)==k那么c(n,k)为奇数~证明使用数学归纳法这么不叙述了 #include using namespace std;int main(){int n,k; while(cin>>n>>k) if((n&k)==k) coutelse coutreturn 0;}原创 2008-08-18 21:03:00 · 486 阅读 · 0 评论 -
PKU 1597 Uniform Generator
应该说也是一个需要记下的结论吧,gcd(a,b)==1的时候就可以简单证明下:如果gcd(a,b)==1,那么a*p(p>=1) mod b 必定不为0,所以必定取到1..b-1内的所有值#include using namespace std;int gcd(int a,int b){return b?gcd(b,a%b):a;}int main(){原创 2008-08-18 21:24:00 · 545 阅读 · 0 评论 -
POJ 3318 Matrix Multiplication
Matrix MultiplicationTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 6414Accepted: 1186DescriptionYou are given three n × n matrices A, B and C. Does the equation转载 2008-08-08 09:56:00 · 2832 阅读 · 1 评论 -
PKU 3070 Fibonacci
经典的用矩阵解决的题目.f(k)表示数列的第k项,那么可以很容易的得到f(n) 1 1 f(1) = 的n-1次方 * f(n-1) 1 0 f(0) -______________原创 2008-08-18 20:46:00 · 587 阅读 · 0 评论 -
PKU_3699 miniSQL
模拟题...比较繁琐..过的人代码普遍很长.......注意方格中的内容"居中"方格宽度=这一列的最大字符串长度+2然后居中的时候,设字程是L,方格长K那么对于字的左边来说,应该有(K-L)/2的空格右边则要有K-L-(K-L)/2个空格.注意方格宽度=这一列的最大字符串长度+2这一列的最大字符串长度并不一定就是项目的名字miniSQLTime Limit: 1000MSMemory Limi原创 2008-10-05 22:06:00 · 865 阅读 · 0 评论 -
PKU_2239 Selecting Courses
构图的时候是课程序号(0..n-1)到课的节数((p-1)*12+q-1)然后土土匹配就可以AChttp://acm.pku.edu.cn/JudgeOnline/problem?id=2239#include using namespace std;#define N 1000bool map[N][N],visit[N];int n,m,match[N];bool dfs(int pre){原创 2008-10-24 21:37:00 · 452 阅读 · 0 评论 -
PKU_1845 Sumdiv
http://acm.pku.edu.cn/JudgeOnline/problem?id=1845SumdivTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 2659Accepted: 461DescriptionConsidertwo natural numbers A and B. Let S be the sum of原创 2008-10-09 22:03:00 · 885 阅读 · 0 评论 -
Beavergnaw
BeavergnawTime Limit:1sMemory limit:32MAccepted Submit:284Total Submit:505When chomping a tree the beaver cuts a very specific shape out of the tree trunk.原创 2008-08-08 09:19:00 · 639 阅读 · 0 评论 -
PKU 3191 The Moronic Cowmpouter
-2进制,和2进制差不多,不过要注意奇数时的区别还有-2进制不能表示所有的数,所以测试的时候可能有些数字得到的结果是错的-____________-不知道这题啥意义..... #include #include using namespace std;vectorint> m;int main(){ int n; while(原创 2008-08-18 20:53:00 · 546 阅读 · 0 评论 -
PKU 3639 Exchange Rates
典型的dp0dp[i+1].usa=max{int(dp[j].can/r[i]*0.97)} 0dp[i+1].can=max{int(dp[j].usa*r[i]*0.97)} 0很简单的DP题不过题目很邪恶,精度问题要注意-_____________-是说每次取到0.01..不能疏忽#include #include using namespace原创 2008-08-18 20:34:00 · 497 阅读 · 0 评论 -
FOJ_1002_HangOver
How far can you make a stack of cards overhang a table? If you have one card, you can create a maximum overhang of half a card length. (We're assuming that the cards must be perpendicular to原创 2008-07-18 20:08:00 · 719 阅读 · 0 评论 -
FOJ_1001_Duplicate Pair
An array of length n, with address from 1 to n inclusive, contains entries from the set {1,2,...,n-1} and there's exactly two elements with the same value. Your task is to find out the value原创 2008-07-18 20:03:00 · 1368 阅读 · 0 评论 -
FOJ 1544 PKU 3615 Cow Hurdles
Cow HurdlesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 564 Accepted: 254DescriptionFarmer John wants the cows to prepare for the county jumping原创 2008-08-08 08:58:00 · 924 阅读 · 0 评论 -
POJ 1753 Flip Game BFS+位压缩状态
http://acm.pku.edu.cn/JudgeOnline/problem?id=1753Flip GameTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 2565Accepted: 1016DescriptionFlip game is played on a rec原创 2008-08-08 09:27:00 · 15062 阅读 · 0 评论 -
POJ 3625 Building Roads
Building RoadsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 1204Accepted: 307DescriptionFarmer John had just acquired several new farms! He wants to connect th原创 2008-08-08 09:43:00 · 504 阅读 · 0 评论 -
POJ 2688 FOJ 1634 Cleaning Robot
Cleaning RobotTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 936Accepted: 391DescriptionHere, we want to solve path planning for a mobile robot cleaning a rectangul原创 2008-08-08 09:51:00 · 2054 阅读 · 0 评论 -
POJ 3233 Matrix Power Series
转至:http://blog.csdn.net/wohenlaoshia/archive/2008/08/07/2784489.aspx http://acm.pku.edu.cn/JudgeOnline/problem?id=3233Matrix Power SeriesTime Limit: 3000MSMemory Limit: 131072KT转载 2008-08-08 10:01:00 · 1677 阅读 · 5 评论 -
FOJ 1174 Dice Stacking
Dice StackingTime Limit:1sMemory limit:32MAccepted Submit:27Total Submit:36Chun-Soo is playing a dice stacking game. Six faces of a die are squares of the same si原创 2008-08-08 10:38:00 · 694 阅读 · 0 评论 -
POJ 2545 Hamming Problem
For each three prime numbers p1, p2 and p3, lets define Hamming sequence Hi(p1, p2, p3), i=1, ... as containing in increasing order all the natural numbers whose only prime divisors are原创 2008-08-08 11:52:00 · 1213 阅读 · 0 评论 -
树状数组
树状数组 树状数组是一个查询和修改复杂度都为log(n)的数据结构,假设数组a[1..n], 那么查询a[1]+...+a的时间是log级别的,而且是一个在线的数据结构, 支持随时修改某个元素的值,复杂度也为log级别。 来观察这个图: 令这棵树的结点编号为C1,C2...Cn。令每个结点的值为这棵树的值的总和,那么容易发现: C1 = A转载 2008-12-30 17:42:00 · 857 阅读 · 0 评论