Jinyu__Wang-优快云博客

原创 JNOJ 送礼

1121: Greedy Gift Givers 贪婪的送礼者 Time Limit: 1 Sec Memory Limit: 128 MB Submit: 64 Solved: 17 [Submit][Status][Web Board] Description 对于一群要互送礼物的朋友,你要确定每个人送出的礼物比收到的多多少(and vice versa for tho

2017-04-09 10:27:35 337 1

原创 JNOJ period

1109: Period Time Limit: 3 Sec Memory Limit: 30 MB Submit: 23 Solved: 14 [Submit][Status][Web Board] Description For each prefix of a given string S with N characters (each character has

2017-04-08 23:18:24 441

原创 acm JNOJ 大数

1107: Josephus Time Limit: 1 Sec Memory Limit: 128 MB Submit: 35 Solved: 12 [Submit][Status][Web Board] Description Josephus problem is named after Flavius Josephus, a Jewish historian livi

2017-04-08 15:22:30 442

原创 JNOJ 查并集

1113: 并查集 Time Limit: 1 Sec Memory Limit: 128 MB Submit: 82 Solved: 29 [Submit][Status][Web Board] Description 今天，暨大ACM训练实验室每个人都穿了衣服。 Input 第一行一个整数t表示数据组数。对于每组数据：第一行为整数n与m，（学

2017-04-08 12:19:41 396

原创 JNOJ Fractal

1106: Fractal Time Limit: 1 Sec Memory Limit: 30 MB Submit: 38 Solved: 20 [Submit][Status][Web Board] Description A fractal is an object or quantity that displays self-similarity, in a so

2017-04-08 00:11:51 337

原创 JNOJ 三个分数

1102: 三个分数 Time Limit: 1 Sec Memory Limit: 128 MB Submit: 41 Solved: 16 [Submit][Status][Web Board] Description 给出一个整数n（1 请判断能否找到三个不相等的正整数x、y、z，使得等式 2/n = 1/x + 1/y + 1/z 成立。

2017-04-07 17:52:27 401

原创 JNOJ 1101 travel

1101: Travel Time Limit: 1 Sec Memory Limit: 128 MB Submit: 126 Solved: 22 [Submit][Status][Web Board] Description One day, Doraemon have words with his friend Nobi and decided to take a

2017-04-07 13:48:13 278

原创 acm选数

1003: 选数 Time Limit: 1 Sec Memory Limit: 128 MB Submit: 28 Solved: 15 [Submit][Status][Web Board] Description 　　已知 n 个整数 x1,x2,…,xn，以及一个整数 k（k＜n）。从 n 个整数中任选 k 个整数相加，可分别得到一系列的和。例如当 n=4，k＝3

2017-04-07 10:47:52 571

Jinyu_Wang的博客