摘要：
问是否存在一棵二叉树，最大深度为N，且深度为 i 的叶子节点有A[i]个；如果存在，输出二叉树最大可能的节点数；不存在，输出-1 阅读全文
摘要：
Educational Codeforces Round 88 (Rated for Div. 2) - D 题意 要求找到**“区间和-区间最大值”**的最大值 限制 Time limit per test: 1.5 seconds Memory limit per test: 512 megab 阅读全文
摘要：
拥有无数杯冷水无数杯热水，热水温度为 h ，冷水温度为 c；从热水开始，每次交替 热水-冷水 倒入另一个盆中；盆中水的温度为倒入的水温平均值；问最少倒几次能使得盆中水的温度最接近于 t 阅读全文
摘要：
本场一言难尽，故事在官方题解配图中，给本题出题人点踩hhh... 题面 time limit per test: 2 seconds memory limit per test: 256 megabytes Description You've been in love with Coronavir 阅读全文
摘要：
题面 Time limit per test: 2 seconds Memory limit per test: 256 megabytes Description Consider all binary strings of length m (1≤m≤60). A binary string i 阅读全文
摘要：
题面 Time limit per test: 2 seconds Memory limit per test: 256 megabytes Description You are given four positive integers n, m, a, b (1≤b≤n≤50; 1≤a≤m≤50 阅读全文
摘要：
题面 Time limit per test: 2 seconds Memory limit per test: 256 megabytes Description You are given n strings a1,a2,…,an: all of them have the same lengt 阅读全文
摘要：
题面 Time limit per test: 2 seconds Memory limit per test: 256 megabytes Description You are given a regular polygon with 2⋅n vertices (it's convex and 阅读全文
摘要：
题面 Time limit per test: 2 seconds Memory limit per test: 256 megabytes Description You are given a regular polygon with 2⋅n vertices (it's convex and 阅读全文
摘要：
题面 Time limit per test: 1 second Memory limit per test: 256 megabytes Description Like any unknown mathematician, Yuri has favourite numbers: A , B , 阅读全文