2016 年 3月随笔档案 - 半根毛线

HDU 5249 离线树状数组求第k大+离散化

摘要：KPI Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1160 Accepted Submission(s): 488 Problem Desc 阅读全文

posted @ 2016-03-30 21:17 半根毛线阅读(311) 评论(0) 推荐(0)

费马小定理求逆元以及求逆元普遍式子总结

摘要：费马小定理(Fermat Theory) 假如p是质数，且(a,p)=1，那么 a(p-1)≡1（mod p）。即：假如a是整数，p是质数，且a,p互质(即两者只有一个公约数1)，那么a的(p-1)次方除以p的余数恒等于1。当涉及取模运算的计算中，如果有除法，不能直接除以一个数，而应该变成乘以它的阅读全文

posted @ 2016-03-27 15:20 半根毛线阅读(3243) 评论(0) 推荐(0)

HDU 5651 逆元

摘要：xiaoxin juju needs help Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 809 Accepted Submission(s 阅读全文

posted @ 2016-03-27 14:54 半根毛线阅读(250) 评论(0) 推荐(0)

HDU 5650 异或

摘要：so easy Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 235 Accepted Submission(s): 180 Problem D 阅读全文

posted @ 2016-03-27 14:28 半根毛线阅读(276) 评论(0) 推荐(0)

HDU 5646

摘要：Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 815 Accepted Submission(s): 298 记sum(a,k)=a+(a+ 阅读全文

posted @ 2016-03-21 21:53 半根毛线阅读(320) 评论(0) 推荐(0)

HDU 5645

摘要：Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 320 Accepted Submission(s): 194 阅读全文

posted @ 2016-03-21 21:36 半根毛线阅读(385) 评论(0) 推荐(0)

P2075 [NOIP2012T5]借教室区间更新+二分查找

摘要：P2075 [NOIP2012T5]借教室阅读全文

posted @ 2016-03-16 23:21 半根毛线阅读(403) 评论(0) 推荐(0)

HDU 5641

摘要：Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 916 Accepted Submission(s): 261 阅读全文

posted @ 2016-03-13 13:02 半根毛线阅读(312) 评论(0) 推荐(0)

HDU 5640

摘要：Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 188 Accepted Submission(s): 159 阅读全文

posted @ 2016-03-13 12:55 半根毛线阅读(223) 评论(0) 推荐(0)

8VC Venture Cup 2016 - Final Round (Div. 2 Edition) A

摘要：A. Orchestra time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Paul is at the orchestra. T 阅读全文

posted @ 2016-03-10 23:49 半根毛线阅读(273) 评论(1) 推荐(0)

Uva-oj Product 大数乘法

摘要：Product Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status Description The problem is to multiply two integers X, Y. (0<=X,Y 阅读全文

posted @ 2016-03-09 20:24 半根毛线阅读(262) 评论(0) 推荐(0)

Uva-oj Palindromes 暴力

摘要：Palindromes Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status Description A regular palindrome is a string of numbers or le 阅读全文

posted @ 2016-03-09 19:38 半根毛线阅读(241) 评论(0) 推荐(0)

Codeforces Round #344 (Div. 2) B

摘要：B. Print Check time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Kris works in a large comp 阅读全文

posted @ 2016-03-09 10:55 半根毛线阅读(200) 评论(0) 推荐(0)

Codeforces Round #345 (Div. 2) C （multiset+pair ）

摘要：C. Watchmen time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output Watchmen are in a danger and 阅读全文

posted @ 2016-03-08 18:58 半根毛线阅读(244) 评论(0) 推荐(0)

Codeforces Round #345 (Div. 2) B

摘要：B. Beautiful Paintings time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output There are n pictur 阅读全文

posted @ 2016-03-08 18:35 半根毛线阅读(254) 评论(0) 推荐(0)

Codeforces Round #345 (Div. 2) A

摘要：A. Joysticks time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Friends are going to play co 阅读全文

posted @ 2016-03-08 18:25 半根毛线阅读(243) 评论(0) 推荐(0)

HDU 1715 大数java

摘要：大菲波数 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16257 Accepted Submission(s): 5403 Problem D 阅读全文

posted @ 2016-03-07 20:39 半根毛线阅读(155) 评论(0) 推荐(0)

Codeforces Round #344 (Div. 2) A

摘要：A. Interview time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Blake is a CEO of a large co 阅读全文

posted @ 2016-03-07 16:55 半根毛线阅读(200) 评论(0) 推荐(0)

蓝桥杯最短路 spfa

摘要：问题描述给定一个n个顶点，m条边的有向图（其中某些边权可能为负，但保证没有负环）。请你计算从1号点到其他点的最短路（顶点从1到n编号）。输入格式第一行两个整数n, m。接下来的m行，每行有三个整数u, v, l，表示u到v有一条长度为l的边。输出格式共n-1行，第i行表示1号点到i+1号阅读全文

posted @ 2016-03-07 15:56 半根毛线阅读(269) 评论(0) 推荐(0)

HDU 5636 关键点的 floyd 最短路问题

摘要：Shortest Path Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 285 Accepted Submission(s): 92 Pr 阅读全文

posted @ 2016-03-05 23:36 半根毛线阅读(291) 评论(0) 推荐(0)

HDU 1596 floyd

摘要：find the safest road Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10450 Accepted Submission(s 阅读全文

posted @ 2016-03-05 14:39 半根毛线阅读(239) 评论(0) 推荐(0)

HDU 1535 SPFA 前向星存图优化

摘要：Invitation Cards Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2972 Accepted Submission(s): 13 阅读全文

posted @ 2016-03-05 12:20 半根毛线阅读(277) 评论(0) 推荐(0)

k好数数位dp

摘要：问题描述如果一个自然数N的K进制表示中任意的相邻的两位都不是相邻的数字，那么我们就说这个数是K好数。求L位K进制数中K好数的数目。例如K = 4，L = 2的时候，所有K好数为11、13、20、22、30、31、33 共7个。由于这个数目很大，请你输出它对1000000007取模后的值。输入格式阅读全文

posted @ 2016-03-03 16:22 半根毛线阅读(384) 评论(0) 推荐(0)

Codeforces Round #343 (Div. 2) B

摘要：B. Far Relative’s Problem time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Famil Door wan 阅读全文

posted @ 2016-03-01 20:03 半根毛线阅读(334) 评论(0) 推荐(0)

Codeforces Round #343 (Div. 2) A

摘要：A. Far Relative’s Birthday Cake time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Door's fa 阅读全文

posted @ 2016-03-01 19:55 半根毛线阅读(289) 评论(0) 推荐(0)

导航

03 2016 档案