Acerkoo

摘要： B. Micro-Worldtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have a Petri d... 阅读全文

摘要： A. Commentary Boxestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBerland Footb... 阅读全文

摘要： 问题 J: Rotated Palindromes 题目描述 Takahashi and Aoki are going to together construct a sequence of integers.First, Takahashi will provide a sequence of i 阅读全文

摘要： District DivisionTime Limit: 1 Second Memory Limit: 65536 KB Special JudgeEzio learned a lot from his uncle Mario in Villa A... 阅读全文

摘要： 问题 I: Sequence时间限制: 1 Sec 内存限制: 128 MB提交: 25 解决: 15[提交][状态][讨论版][命题人:admin]题目描述You are given an integer sequence of length N. The i-... 阅读全文

摘要： 问题 J: Simple Knapsack 题目描述 You have N items and a bag of strength W. The i-th item has a weight of wi and a value of vi.You will select some of the it 阅读全文

摘要： 题目背景在双人对决的竞技性比赛，如乒乓球、羽毛球、国际象棋中，最常见的赛制是淘汰赛和循环赛。前者的特点是比赛场数少，每场都紧张刺激，但偶然性较高。后者的特点是较为公平，偶然性较低，但比赛过程往往十分冗长。本题中介绍的瑞士轮赛制，因最早使用于 18951895 年在瑞士... 阅读全文

摘要： 问题 I: T-shirt时间限制: 1 Sec 内存限制: 64 MB提交: 14 解决: 7[提交][状态][讨论版][命题人:admin]题目描述JSZKC is going to spend his vacation! His vacation has N... 阅读全文

摘要： 问题 J: JS Set时间限制: 1 Sec 内存限制: 128 MB提交: 3 解决: 2[提交][状态][讨论版][命题人:admin]题目描述Let’s consider some math problems. JSZKC has a set A={1,2... 阅读全文

摘要： 6481: Integers on a Tree 题目描述 We have a tree with N vertices. The vertices are numbered 1,2,…,N. The i-th (1≤i≤N−1) edge connects the two vertices Ai 阅读全文