随缘&不屈 - 博客园

UVALive - 3661 - Animal Run（最大流最小割定理——平面图最小割）

摘要： Problem UVALive - 3661 - Animal Run Time Limit: 6000 mSec Problem Description Input Output Sample Input 3 4 5 6 4 4 3 1 7 5 3 5 6 7 8 8 7 6 5 5 5 5 6 阅读全文

posted @ 2019-05-19 15:28 随缘&不屈阅读(278) 评论(0) 推荐(0)

POJ - 3910 - GCD Determinant（数论——GCD矩阵）

摘要： Problem POJ - 3910 - GCD Determinant Problem POJ - 3910 - GCD Determinant Problem POJ - 3910 - GCD Determinant Time Limit: 1000 mSec Problem Descripti 阅读全文

posted @ 2019-05-15 17:06 随缘&不屈阅读(317) 评论(0) 推荐(0)

POJ - 1284- Primitive Roots（数论——原根个数）

摘要： Problem POJ - 1284- Primitive Roots Time Limit: 1000 mSec Problem Description We say that integer x, 0 < x < p, is a primitive root modulo odd prime p 阅读全文

posted @ 2019-05-08 22:49 随缘&不屈阅读(565) 评论(0) 推荐(0)

Educational Codeforces Round 59 (Rated for Div. 2) - D. Compression（思维）

摘要： Problem Educational Codeforces Round 59 (Rated for Div. 2) - D. Compression Time Limit: 2500 mSec Problem Description Input Output Print one number: m 阅读全文

posted @ 2019-05-02 18:23 随缘&不屈阅读(221) 评论(0) 推荐(0)

CodeCraft-19 and Codeforces Round #537 (Div. 2) - D. Destroy the Colony（动态规划+组合数学）

摘要： Problem CodeCraft-19 and Codeforces Round #537 (Div. 2) - D. Destroy the Colony Time Limit: 2000 mSec Problem Description Input Output For each questi 阅读全文

posted @ 2019-05-02 02:35 随缘&不屈阅读(212) 评论(0) 推荐(0)

Codeforces Round #536 (Div. 2) - D. Lunar New Year and a Wander（最短路）

摘要： Problem Codeforces Round #536 (Div. 2) - D. Lunar New Year and a Wander Time Limit: 3000 mSec Problem Description Input Output Output a line containin 阅读全文

posted @ 2019-05-01 17:15 随缘&不屈阅读(170) 评论(0) 推荐(0)

Codeforces Round #536 (Div. 2) - E. Lunar New Year and Red Envelopes（动态规划——01背包）

摘要： Problem Codeforces Round #536 (Div. 2) - E. Lunar New Year and Red Envelopes Time Limit: 3000 mSec Problem Description Input Output Output one integer 阅读全文

posted @ 2019-05-01 15:23 随缘&不屈阅读(219) 评论(0) 推荐(0)

Codeforces Round #556 (Div. 2) - C. Prefix Sum Primes（思维）

摘要： Problem Codeforces Round #556 (Div. 2) - D. Three Religions Time Limit: 1000 mSec Problem Description Input Output Sample Input 51 2 1 2 1 Sample Outp 阅读全文

posted @ 2019-04-30 22:27 随缘&不屈阅读(302) 评论(0) 推荐(0)

Codeforces Round #556 (Div. 2) - D. Three Religions（动态规划）

摘要： Problem Codeforces Round #556 (Div. 2) - D. Three Religions Time Limit: 3000 mSec Problem Description Input Output Sample Input 6 8abdabc+ 1 a+ 1 d+ 2 阅读全文

posted @ 2019-04-30 22:15 随缘&不屈阅读(457) 评论(0) 推荐(1)

Codeforces Global Round 1 - D. Jongmah（动态规划）

摘要： Problem Codeforces Global Round 1 - D. Jongmah Time Limit: 3000 mSec Problem Description Input Output Print one integer: the maximum number of triples 阅读全文

posted @ 2019-04-29 21:16 随缘&不屈阅读(333) 评论(0) 推荐(0)