原创 Codeforces Round #457 (Div. 2) B. Jamie and Binary Sequence (changed after round)貪心
B. Jamie and Binary Sequence (changed after round) time limit per test 2 seconds memory limit per test 256 megabyt
原创 梁友棟-柏世奇算法
在計算機圖形學中,梁友棟—柏世奇算法是一個線段裁剪算法。梁友棟—柏世奇算法使用直線的參數方程和不等式組來描述線段和裁剪窗口的交集。求解出的交集將被用於獲知線的哪些部分是應當繪製在屏幕上的,其基本思想是:在計算線段與裁剪窗交集之前做盡可能多
原创 Educational Codeforces Round 36 B. Browser 簡單貪心
B. Browser time limit per test 1 second memory limit per test 256 megabytes input standard input output
原创 Codeforces Round #457 (Div. 2) A. Jamie and Alarm Snooze簡單模擬
A. Jamie and Alarm Snooze time limit per test 2 seconds memory limit per test 256 megabytes input standard input
原创 Codeforces Round #460 (Div. 2) B. Perfect Number 模擬
B. Perfect Number time limit per test 2 seconds memory limit per test 256 megabytes input standard input outpu
原创 Codeforces Round #460 (Div. 2) A. Supermarket 水題*
A. Supermarket time limit per test 2 seconds memory limit per test 256 megabytes input standard input output s
原创 Codeforces Round #459 (Div. 2) A. Eleven 水題
A. Eleven time limit per test 1 second memory limit per test 256 megabytes input standard input output standa
原创 Educational Codeforces Round 36 C. Permute Digits DP
C. Permute Digits time limit per test 1 second memory limit per test 256 megabytes input standard input output
原创 Codeforces Round #460 (Div. 2) D. Substring 拓撲排序+DP | 記憶化搜索
D. Substring time limit per test 3 seconds memory limit per test 256 megabytes input standard input output sta
原创 Codeforces Round #459 (Div. 2) B. Radio Station STL map的使用
B. Radio Station time limit per test 2 seconds memory limit per test 256 megabytes input standard input output
原创 Codeforces Round #457 (Div. 2) C. Jamie and Interesting Graph 構造
C. Jamie and Interesting Graph time limit per test 2 seconds memory limit per test 256 megabytes input standard
原创 Educational Codeforces Round 36 D. Almost Acyclic Graph 圖論
D. Almost Acyclic Graph time limit per test 1 second memory limit per test 256 megabytes input standard input
原创 Educational Codeforces Round 36 A. Garden 水題
A. Garden time limit per test 1 second memory limit per test 256 megabytes input standard input output standar
原创 Codeforces Round #460 (Div. 2) C. Seat Arrangements 思維
C. Seat Arrangements time limit per test 1 second memory limit per test 256 megabytes input standard input out
原创 Codeforces Round #464 (Div. 2) D. Love Rescue 並查集
D. Love Rescuetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVal