Mitsuha_的博客

传送门Problem A：Secret of Chocolate Poles思路：简单dp。d[i][0/1]d[i][0/1]d[i][0/1]表示高度为i时，顶层圆盘是0/1颜色时的方案数。#include<bits/stdc++.h&amp

CouleurTime Limit: 6 Seconds Memory Limit: 131072 KBDreamGrid has an array of n integers. On this array he can perform the following operation: choose an element that was not previously chosen ...

E. Tufuramatime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne day Polycarp decided to rewatch his absolute favourite episode of well-known TV ser...

Just h-index                                                              Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 132768/132768 K (Java/Others)                                         ...

Super Mario                                                            Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)                                              ...

Feed the dogsTime Limit: 6000MS Memory Limit: 65536KTotal Submissions: 21924 Accepted: 6959DescriptionWind loves pretty dogs very much, and she has n pet dogs

K-th NumberTime Limit: 20000MS Memory Limit: 65536KTotal Submissions: 63091 Accepted: 22209Case Time Limit: 2000MSDescriptionYou are working for Macroha