随笔分类 - OJ Atcoder
摘要:D - joisino's travel Problem Statement There are N towns in the State of Atcoder, connected by M bidirectional roads. The i-th road connects Town Ai a
阅读全文
摘要:C - 4-adjacent Time limit : 2sec / Memory limit : 256MB Score : 400 points Problem Statement We have a sequence of length N, a=(a1,a2,…,aN). Each ai i
阅读全文
摘要:A - Ice Tea Store Time limit : 2sec / Memory limit : 256MB Score : 300 points Problem Statement You've come to your favorite store Infinitesco to buy
阅读全文
摘要:C - Make a Rectangle Time limit : 2sec / Memory limit : 256MB Score : 300 points Problem Statement We have N sticks with negligible thickness. The len
阅读全文
摘要:B - Two Switches Time limit : 2sec / Memory limit : 256MB Score : 200 points Problem Statement Alice and Bob are controlling a robot. They each have o
阅读全文
摘要:E - Decrease (Judge ver.) Time limit : 2sec / Memory limit : 256MB Score : 600 points Problem Statement We have a sequence of length N consisting of n
阅读全文
摘要:D - Decrease (Contestant ver.) Time limit : 2sec / Memory limit : 256MB Score : 600 points Problem Statement We have a sequence of length N consisting
阅读全文
摘要:C - Cat Snuke and a Voyage Time limit : 2sec / Memory limit : 256MB Score : 300 points Problem Statement In Takahashi Kingdom, there is an archipelago
阅读全文
摘要:A - Getting Difference Time limit : 2sec / Memory limit : 256MB Score : 300 points Problem Statement There is a box containing N balls. The i-th ball
阅读全文
摘要:C - Splitting Pile Time limit : 2sec / Memory limit : 256MB Score : 300 points Problem Statement Snuke and Raccoon have a heap of N cards. The i-th ca
阅读全文
摘要:D - Fennec VS. Snuke Time limit : 2sec / Memory limit : 256MB Score : 400 points Problem Statement Fennec and Snuke are playing a board game. On the b
阅读全文

浙公网安备 33010602011771号