Codeforces 842C Ilya And The Tree(树上DP+因子个数估计)

C. Ilya And The Tree time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Ilya is very fond...

2017-08-30 11:05:57

阅读数:845

评论数:4

ZOJ 3424 Rescue(和式变形递推公式降低复杂度)

Rescue Time Limit: 3 Seconds Memory Limit: 65536 KB The princess is trapped in a magic place. In this place, there are N magic stones. In orde...

2017-08-29 19:46:01

阅读数:264

评论数:0

Codeforces 845G Shortest Path Problem?(异或最短路)

G. Shortest Path Problem? time limit per test 3 seconds memory limit per test 512 megabytes input standard input output standard output Yo...

2017-08-28 14:05:31

阅读数:716

评论数:2

HDU 6071 Lazy Running(同余+最短路)

Lazy Running Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others) Total Submission(s): 287    Accepted Submission(...

2017-08-04 15:13:36

阅读数:1079

评论数:5

UVA 11149 Power of Matrix(求幂函数的前n项和)

题目大意:     给你一个矩阵A,求A^1+A^2+A^3+...+A^n 解题思路:     利用和快速幂一样的思想,我们可以对原式变形。     当n为偶数的时候:     当n为奇数的时候:     所以,我们就可以用递归每次先求出n/2的前n项和,然后利用矩阵快速幂和上面的式...

2017-07-15 20:52:17

阅读数:452

评论数:0

HDU 4965 Fast Matrix Calculation(矩阵快速幂)

Fast Matrix Calculation Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1700    Accepted...

2017-07-15 19:14:14

阅读数:145

评论数:0

进制转换(-R进制)

1004: 进制转换(-R进制) Time Limit: 1 Sec  Memory Limit: 128 MB   64bit IO Format: %lld Submitted: 3  Accepted: 1 [Submit][Status][Web Board] Descrip...

2017-03-06 10:29:40

阅读数:854

评论数:0

hihoCoder 1473 小Ho的强迫症(加法取模)

时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 小Ho在一条笔直的街道上散步。街道上铺着长度为L的石板,所以每隔L距离就有一条石板连接的缝隙,如下图所示。 小Ho在散步的时候有奇怪的强迫症,他不希望脚踩在石板的缝隙上。(如果小...

2017-03-05 15:45:46

阅读数:808

评论数:0

Codeforces Round 718C(维护矩阵的线段树)

C. Sasha and Array time limit per test 5 seconds memory limit per test 256 megabytes input standard input output standard output ...

2016-09-25 15:51:04

阅读数:847

评论数:0

Codeforces 233C Partial Sums(特殊三角矩阵压缩)

C. Partial Sums time limit per test 4 seconds memory limit per test 256 megabytes input standard input output standard output Yo...

2016-09-02 14:46:12

阅读数:440

评论数:0

HDU 3608 0 or 1(求一个数因子和的奇偶)

0 or 1 Time Limit: 6000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3460    Accepted Submission(s): 988...

2016-08-26 09:45:45

阅读数:507

评论数:0

POJ 3420 Quad Tiling(轮廓线DP+矩阵快速幂)

Quad Tiling Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 4076   Accepted: 1856 Description Tired of t...

2016-08-24 09:44:15

阅读数:879

评论数:1

Codeforces 707C Pythagorean Triples(已知直角三角形一边求另两边)

C. Pythagorean Triples time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Katya studi...

2016-08-21 07:52:47

阅读数:859

评论数:0

ZOJ 1136&&POJ 1465 Multiple(BFS+同余定理)

Multiple Time Limit: 1000MS   Memory Limit: 32768K Total Submissions: 7215   Accepted: 1546 Description a program that, given a natural num...

2016-08-17 20:04:49

阅读数:399

评论数:0

HDU 5792 World is Exploding (容斥原理+离散化+树状数组)

World is Exploding Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 330    Accepted Submiss...

2016-08-03 09:01:05

阅读数:522

评论数:0

HDU 5723 Abandoned country (最小生成树+期望)

Abandoned country Time Limit: 8000/4000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 2226    Accepted Submissio...

2016-07-20 21:25:20

阅读数:315

评论数:0

POJ 3421 X-factor Chains (整数分解+组合数)

X-factor Chains Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 6496   Accepted: 2018 Description Given ...

2016-07-15 21:20:01

阅读数:573

评论数:0

POJ 1930 Dead Fraction (无限循环小数转化为分数)

Dead Fraction Time Limit: 1000MS   Memory Limit: 30000K Total Submissions: 2597   Accepted: 845 Description Mike is frantically scrambling ...

2016-07-15 16:23:40

阅读数:306

评论数:0

HDU 4405 Aeroplane chess(概率dp)

Aeroplane chess Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3119    Accepted Submissio...

2016-07-13 16:54:19

阅读数:363

评论数:0

POJ 3370 Halloween treats(抽屉原理)

Every year there is the same problem at Halloween: Each neighbour is only willing to give a certain total number of sweets on that day, no matter how...

2016-07-10 21:07:06

阅读数:351

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭