06 2018 档案

cf 教育场 . Micro-World
摘要：B. Micro-Worldtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have a Petri d... 阅读全文
posted @ 2018-06-16 22:04 Acerkoo 阅读(264) 评论(0) 推荐(0)
cf 教育场 45Commentary Boxes
摘要：A. Commentary Boxestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBerland Footb... 阅读全文
posted @ 2018-06-16 21:37 Acerkoo 阅读(151) 评论(0) 推荐(0)
Rotated Palindromes
摘要：问题 J: Rotated Palindromes 题目描述 Takahashi and Aoki are going to together construct a sequence of integers.First, Takahashi will provide a sequence of i 阅读全文
posted @ 2018-06-12 14:33 Acerkoo 阅读(227) 评论(0) 推荐(0)
zoj 4045 District Division
摘要：District DivisionTime Limit: 1 Second Memory Limit: 65536 KB Special JudgeEzio learned a lot from his uncle Mario in Villa A... 阅读全文
posted @ 2018-06-11 21:30 Acerkoo 阅读(245) 评论(0) 推荐(0)
问题 I: Sequence
摘要：问题 I: Sequence时间限制: 1 Sec 内存限制: 128 MB提交: 25 解决: 15[提交][状态][讨论版][命题人:admin]题目描述You are given an integer sequence of length N. The i-... 阅读全文
posted @ 2018-06-09 22:10 Acerkoo 阅读(275) 评论(0) 推荐(0)
问题 J: Simple Knapsack
摘要：问题 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 阅读全文
posted @ 2018-06-09 22:04 Acerkoo 阅读(159) 评论(0) 推荐(0)
P1309 瑞士轮
摘要：题目背景在双人对决的竞技性比赛，如乒乓球、羽毛球、国际象棋中，最常见的赛制是淘汰赛和循环赛。前者的特点是比赛场数少，每场都紧张刺激，但偶然性较高。后者的特点是较为公平，偶然性较低，但比赛过程往往十分冗长。本题中介绍的瑞士轮赛制，因最早使用于 18951895 年在瑞士... 阅读全文
posted @ 2018-06-07 11:13 Acerkoo 阅读(218) 评论(0) 推荐(0)
问题 I: T-shirt
摘要：问题 I: T-shirt时间限制: 1 Sec 内存限制: 64 MB提交: 14 解决: 7[提交][状态][讨论版][命题人:admin]题目描述JSZKC is going to spend his vacation! His vacation has N... 阅读全文
posted @ 2018-06-05 22:00 Acerkoo 阅读(139) 评论(0) 推荐(0)
问题 J: JS Set
摘要：问题 J: JS Set时间限制: 1 Sec 内存限制: 128 MB提交: 3 解决: 2[提交][状态][讨论版][命题人:admin]题目描述Let’s consider some math problems. JSZKC has a set A={1,2... 阅读全文
posted @ 2018-06-04 21:53 Acerkoo 阅读(209) 评论(0) 推荐(0)
6481: Integers on a Tree
摘要：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 阅读全文
posted @ 2018-06-03 21:21 Acerkoo 阅读(162) 评论(0) 推荐(0)
6492: Connectivity
摘要：6492: Connectivity时间限制: 1 Sec 内存限制: 128 MB提交: 128 解决: 34[提交][状态][讨论版][命题人:admin]题目描述There are N cities. There are also K roads and L... 阅读全文
posted @ 2018-06-03 17:12 Acerkoo 阅读(179) 评论(0) 推荐(0)
6468: Snuke's Coloring
摘要：6468: Snuke's Coloring时间限制: 2 Sec 内存限制: 128 MB提交: 50 解决: 22[提交][状态][讨论版][命题人:admin]题目描述We have a grid with H rows and W columns. At ... 阅读全文
posted @ 2018-06-03 16:03 Acerkoo 阅读(158) 评论(0) 推荐(0)
6463: Tak and Hotels II
摘要：6463: Tak and Hotels II时间限制: 1 Sec 内存限制: 128 MB提交: 95 解决: 29[提交][状态][讨论版][命题人:admin]题目描述N hotels are located on a straight line. The... 阅读全文
posted @ 2018-06-03 15:05 Acerkoo 阅读(202) 评论(0) 推荐(0)
Til the Cows Come Home
摘要：Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the mor... 阅读全文
posted @ 2018-06-02 17:11 Acerkoo 阅读(124) 评论(0) 推荐(0)
哈密顿绕行世界问题
摘要：一个规则的实心十二面体，它的 20个顶点标出世界著名的20个城市，你从一个城市出发经过每个城市刚好一次后回到出发的城市。 Input前20行的第i行有3个数,表示与第i个城市相邻的3个城市.第20行以后每行有1个数m,m=1.m=0退出. Output输出从第m个城市... 阅读全文
posted @ 2018-06-02 15:26 Acerkoo 阅读(181) 评论(0) 推荐(0)
Avito Code Challenge 2018 D. Bookshelves
摘要：D. Bookshelves time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output D. Bookshelves time limit 阅读全文
posted @ 2018-06-01 17:13 Acerkoo 阅读(121) 评论(0) 推荐(0)