玄不救非，氪不改命

分类

HDU(22) POJ(90) PTA(60) UVa(2) 未归档(111) 百练(1) 题解(8)

/ 注册

全部文章（共294篇）

POJ 3579 Median

Median Time Limit: 1000MS Memory Limit: 65536K Description Given N numbers, X1, X2, … , XN, let us calculate the difference of every pair of number...

2019-06-16

0 876

POJ 3270 Cow Sorting

Cow Sorting Time Limit: 2000MS Memory Limit: 65536K Description Farmer John’s N (1 ≤ N ≤ 10,000) cows are lined up to be milked in the evening. Eac...

2019-06-16

0 778

POJ 3104 Drying

Drying Time Limit: 2000MS Memory Limit: 65536K Description It is very hard to wash and especially to dry clothes in winter. But Jane is a very smar...

2019-06-16

0 407

POJ 3260 The Fewest Coins

The Fewest Coins Time Limit: 2000MS Memory Limit: 65536K Description Farmer John has gone to town to buy some farm supplies. Being a very efficient...

2019-06-15

0 403

HDU 3591 The trouble of Xiaoqian

The trouble of Xiaoqian Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description In the country of ALPC...

2019-06-15

0 431

PTA 天梯赛 L2-005 集合相似度 (25 point(s))

L2-005 集合相似度 (25 point(s)) 给定两个整数集合，它们的相似度定义为：Nc/Nt×100%。其中Nc是两个集合都有的不相等整数的个数，Nt是两个集合一共有的不相等整数的个数。你的任务就是计算任意一对给定集合的相似度。输入格式：输入第一行给出一个正整数N（≤50），是...

2019-06-13

0 614

POJ 3111 K Best

K Best Time Limit: 8000MS Memory Limit: 65536K Case Time Limit: 2000MS Special Judge Description Demy has n jewels. Each of her jewels has some val...

2019-06-13

0 794

POJ 2976 Dropping tests

Dropping tests Time Limit: 1000MS Memory Limit: 65536K Description In a certain course, you take n tests. If you get ai out of bi questions correct...

2019-06-13

0 548

POJ 3273 Monthly Expense

Monthly Expense Time Limit: 2000MS Memory Limit: 65536K Description Farmer John is an astounding accounting wizard and has realized he might run ou...

2019-06-12

0 419

POJ 3258 River Hopscotch

River Hopscotch Time Limit: 2000MS Memory Limit: 65536K Description Every year the cows hold an event featuring a peculiar version of hopscotch tha...

2019-06-12

0 395