佛奴儿

分类

未归档(985)

/ 注册

TA的专栏 0篇文章 0人订阅

职场那些事儿

0篇文章 0人学习

全部文章（共985篇）

Codeforces Round #446 (Div. 2) A. Greed【模拟】

A. Greed time limit per test 2 seconds memory limit per test 256 megabytes input standard input ...

2017-11-24

0 395

Educational Codeforces Round 33 (Rated for Div. 2) D. Credit Card

D. Credit Card time limit per test 2 seconds memory limit per test 256 megabytes input standard input ...

2017-11-24

0 412

Educational Codeforces Round 33 (Rated for Div. 2) C. Rumor【并查集+贪心/维护集合最小值】

C. Rumor time limit per test 2 seconds memory limit per test 256 megabytes input standard input ...

2017-11-24

0 483

Educational Codeforces Round 33 (Rated for Div. 2) B. Beautiful Divisors【进制思维/打表】

B. Beautiful Divisors time limit per test 2 seconds memory limit per test 256 me...

2017-11-24

0 453

Educational Codeforces Round 33 (Rated for Div. 2) A. Chess For Three【模拟/逻辑推理】

A. Chess For Three time limit per test 1 second memory limit per test 256 megabytes input standard input ...

2017-11-24

0 436

java中的BigInteger

头文件 import java.io.*; import java.math.*; 读入 Scanner cin = Scann(System.in); while(cin.hasNext()) <-> !=EOF n = cin.nextInt(); <->...

2017-11-21

0 392

动态规划-最长上升子序列（LIS模板）多解+变形

问题描述一个数的序列bi，当b1 < b2 < ... < bS的时候，我们称这个序列是上升的。对于给定的一个序列(a1, a2, ..., aN)，我们可以得到一些上升的子序列(ai1, ai2, ..., aiK)，这里1 <= i1 < i2 < ......

2017-11-20

0 535

Codeforces Round #447 (Div. 2) C. Marco and GCD Sequence【构造/GCD】

C. Marco and GCD Sequence time limit per test 1 second memory limit per test 256 megabytes input standard...

2017-11-20

0 499

Codeforces Round #447 (Div. 2) B. Ralph And His Magic Field【数论/组合数学】

B. Ralph And His Magic Field time limit per test 1 second memory limit per test 256 megabytes input stand...

2017-11-20

0 476

Codeforces Round #447 (Div. 2) A. QAQ【三重暴力枚举】

A. QAQ time limit per test 1 second memory limit per test 256 megabytes input standard input ...

2017-11-20

0 317