上一页 1 ··· 24 25 26 27 28 29 30 31 32 ··· 38 下一页
摘要: http://acm.hdu.edu.cn/showproblem.php?pid=3974 Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description T 阅读全文
posted @ 2019-08-27 02:18 jiamian22 阅读(302) 评论(0) 推荐(0)
摘要: http://acm.hdu.edu.cn/showproblem.php?pid=1540 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Problem Description Du 阅读全文
posted @ 2019-08-26 19:45 jiamian22 阅读(239) 评论(0) 推荐(0)
摘要: http://acm.hdu.edu.cn/showproblem.php?pid=4027 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others) Problem Description A 阅读全文
posted @ 2019-08-25 19:17 jiamian22 阅读(309) 评论(0) 推荐(0)
摘要: http://poj.org/problem?id=3264 Time Limit: 5000MS Memory Limit: 65536K Description For the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always 阅读全文
posted @ 2019-08-25 03:48 jiamian22 阅读(222) 评论(0) 推荐(0)
摘要: http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1610 https://vjudge.net/contest/318019#problem/F Painting some colored segments on a line 阅读全文
posted @ 2019-08-25 03:01 jiamian22 阅读(229) 评论(0) 推荐(0)
摘要: HDU-6708 Windows Of CCPC(打表,递归) http://acm.hdu.edu.cn/showproblem.php?pid=6708 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Jav 阅读全文
posted @ 2019-08-24 03:18 jiamian22 阅读(572) 评论(0) 推荐(0)
摘要: http://poj.org/problem?id=2528 https://www.luogu.org/problem/UVA10587 Description The citizens of Bytetown, AB, could not stand that the candidates in 阅读全文
posted @ 2019-08-22 23:30 jiamian22 阅读(242) 评论(0) 推荐(0)
摘要: POJ-3468 - A Simple Problem with Integers(线段树区间更新模板) http://poj.org/problem?id=3468 Description You have N integers, A1, A2, ... , AN. You need to dea 阅读全文
posted @ 2019-08-22 01:26 jiamian22 阅读(287) 评论(0) 推荐(0)
摘要: https://www.luogu.org/problem/P2967 https://ac.nowcoder.com/acm/contest/1077/B 题目描述 Farmer John's cows love their video games! FJ noticed that after p 阅读全文
posted @ 2019-08-21 15:21 jiamian22 阅读(238) 评论(0) 推荐(0)
摘要: https://www.luogu.org/problem/P1037 题目描述 给出一个整数 n(n<1030) 和 k 个变换规则(k<=15)。 规则: 一位数可变换成另一个一位数:规则的右部不能为零。 例如:n=234。有规则(k=2): 2-> 5 3-> 6 上面的整数 234 经过变换 阅读全文
posted @ 2019-08-20 22:09 jiamian22 阅读(936) 评论(0) 推荐(0)
上一页 1 ··· 24 25 26 27 28 29 30 31 32 ··· 38 下一页