乐逍遥xwl

Codeforces Round #573 (Div. 2) A. Tokitsukaze and Enhancement

摘要： Codeforces Round #573 (Div. 2) A. Tokitsukaze and Enhancement Tokitsukaze is one of the characters in the game "Kantai Collection". In this game, ever 阅读全文

posted @ 2019-07-13 21:05 乐逍遥xwl 阅读(287) 评论(0) 推荐(0) 编辑

POJ 3614 Sunscreen （优先队列）

摘要： Sunscreen Description To avoid unsightly burns while tanning, each of the C (1 ≤ C ≤ 2500) cows must cover her hide with sunscreen when they're at the 阅读全文

posted @ 2019-07-09 21:19 乐逍遥xwl 阅读(158) 评论(0) 推荐(0) 编辑

POJ 3176 Cow Bowling （数塔DP）

摘要： Cow Bowling Description The cows don't use actual bowling balls when they go bowling. They each take a number (in the range 0..99), though, and line u 阅读全文

posted @ 2019-07-09 19:18 乐逍遥xwl 阅读(136) 评论(0) 推荐(0) 编辑

POJ 1862 Stripies （优先队列）

摘要： Stripies Description Our chemical biologists have invented a new very useful form of life called stripies (in fact, they were first called in Russian 阅读全文

posted @ 2019-07-08 21:07 乐逍遥xwl 阅读(189) 评论(0) 推荐(0) 编辑

Codeforces Round #569 (Div. 2) A. Alex and a Rhombus

摘要： Codeforces Round #569 (Div. 2) A. Alex and a Rhombus While playing with geometric figures Alex has accidentally invented a concept of a n-th order rho 阅读全文

posted @ 2019-06-22 20:39 乐逍遥xwl 阅读(292) 评论(0) 推荐(0) 编辑

Codeforces Round #569 (Div. 2) B. Nick and Array

摘要： Codeforces Round #569 (Div. 2) B. Nick and Array Nick had received an awesome array of integers a=[a1,a2,…,an] as a gift for his 5 birthday from his m 阅读全文

posted @ 2019-06-22 20:34 乐逍遥xwl 阅读(424) 评论(0) 推荐(0) 编辑

Codeforces Round #569 (Div. 2) C. Valeriy and Deque

摘要： Codeforces Round #569 (Div. 2) C. Valeriy and Deque Recently, on the course of algorithms and data structures, Valeriy learned how to use a deque. He 阅读全文

posted @ 2019-06-22 20:18 乐逍遥xwl 阅读(559) 评论(0) 推荐(0) 编辑

Cheese Aizu - 0558 （bfs）

摘要：奶酪问题今年JOI镇乳酪厂也开始生产奶酪，老鼠走出窝了。JOI町被划分成东西南北，各区是巢、芝士厂、障碍物或空地。老鼠从窝里出来，到所有的奶酪工厂，每人吃一个奶酪。这个镇上，有N个奶酪厂，每个厂都只生产一种奶酪。奶酪的硬度因工厂而异，硬度从1到N的奶酪生产厂家正好各有一个。老鼠的第一个体力是阅读全文

posted @ 2019-06-21 21:14 乐逍遥xwl 阅读(304) 评论(0) 推荐(0) 编辑

hdu 3786 找出直系亲属（dfs）

摘要：找出直系亲属 Problem Description 如果A，B是C的父母亲，则A，B是C的parent，C是A，B的child，如果A，B是C的（外）祖父，祖母，则A，B是C的grandparent，C是A，B的grandchild，如果A，B是C的（外）曾祖父，曾祖母，则A，B是C的great- 阅读全文

posted @ 2019-06-18 22:02 乐逍遥xwl 阅读(169) 评论(0) 推荐(0) 编辑

Codeforces Round #567 (Div. 2) B. Split a Number

摘要： Codeforces Round #567 (Div. 2) B. Split a Number Dima worked all day and wrote down on a long paper strip his favorite number n consisting of l digits 阅读全文

posted @ 2019-06-17 19:02 乐逍遥xwl 阅读(322) 评论(0) 推荐(0) 编辑

导航

公告