【未分类】
iluwuli_
会当临绝顶
展开
-
A == B ?
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2054原创 2014-07-21 20:17:43 · 377 阅读 · 0 评论 -
素数回文
素数回文 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 11046 Accepted Submission(s): 2578 Problem Description xiaoou33对既是素数又是回文的数特别感兴趣转载 2014-07-30 23:23:01 · 530 阅读 · 0 评论 -
Catch That Cow
题目链接:http://poj.org/problem?id=3278 Catch That Cow Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 46146 Accepted: 14467 Description Farmer John has原创 2014-07-28 22:21:52 · 320 阅读 · 0 评论 -
Leftmost Digit
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1060原创 2014-07-28 21:45:40 · 369 阅读 · 0 评论 -
Pots
题目链接:poj.org/problem?id=3414 Description You are given two pots, having the volume of A and B liters respectively. The following operations can be performed: FILL(i) fill the pot i (1原创 2014-07-28 21:39:32 · 461 阅读 · 0 评论 -
poj 3233 Matrix Power Series(二分)
Matrix Power Series Time Limit: 3000MS Memory Limit: 131072K Total Submissions: 14827 Accepted: 6365 Description Given a n × n matrix A and a positive integer k, find原创 2014-08-01 21:07:12 · 446 阅读 · 2 评论 -
poj 2689 Prime Distance
Prime Distance Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 12083 Accepted: 3229 Description The branch of mathematics called number theory is about pro原创 2014-08-01 21:20:11 · 374 阅读 · 0 评论 -
Fibonacci
Fibonacci Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9184 Accepted: 6511 Description In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn原创 2014-07-31 22:16:33 · 396 阅读 · 0 评论 -
HDU 1299 Diophantus of Alexandria
Diophantus of Alexandria Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2360 Accepted Submission(s): 899 Problem Description Diop原创 2014-07-31 22:32:52 · 341 阅读 · 0 评论 -
DZY Loves Chessboard
题目链接:http://vjudge.net/contest/view.action?cid=49649#problem/C原创 2014-07-21 18:43:28 · 407 阅读 · 0 评论 -
Communication System
题目链接:http://poj.org/problem?id=1018 Description We have received an order from Pizoor Communications Inc. for a special communication system. The system consists of several devices. For each d原创 2014-07-24 19:06:11 · 396 阅读 · 0 评论 -
Romantic (扩展欧几里德算法)
HDU 2669 http://acm.hdu.edu.cn/showproblem.php?pid=2669 Romantic Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3061 Accepted Submission原创 2014-07-31 08:59:55 · 407 阅读 · 0 评论