hdu1712

maksyuki 发表于 oj 分类,标签:
0
hdu1712

ACboy needs your help

Problem Description

ACboy has N courses this term, and he plans to spend at most M days on study.Of course,the profit he will gain from different course depending on the days he spend on it.How to arrange the M days for the >>继续阅读

hdu1698

maksyuki 发表于 oj 分类,标签:
0
hdu1698

Just a Hook

Problem Description

In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecutive metallic sticks which are of the same length. >>继续阅读

hdu1671

maksyuki 发表于 oj 分类,标签:
0
hdu1671

Phone List

Problem Description

Given a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. Let’s say the phone >>继续阅读

hdu1576

maksyuki 发表于 oj 分类,标签:
0
hdu1576

A/B

Problem Description

要求(A/B)%9973,但由于A很大,我们只给出n(n=A%9973)(我们给 >>继续阅读

hdu1573

maksyuki 发表于 oj 分类,标签:
0
hdu1573

X问题

Problem Description

求在小于等于N的正整数中有多少个X满足:X mod a[0] = b[0], X mod a[1] = b[1], X mod a[2] = b[2], …, X mod a[i] = b[i], … (0 < a[i] <= 10)。

Input

输入数据的第一行为一个正整数T,表示有T组测试数据。每组测试 >>继续阅读

hdu1421

maksyuki 发表于 oj 分类,标签: ,
0
hdu1421

搬寝室

Problem Description

搬寝室是很累的,xhd深有体会.时间追述2006年7月9号,那天xhd迫于无奈要从27号楼搬到3号楼,因为10号要封楼了.看着寝室里的n件物品,xhd开始发呆,因为n是一个小于2000的整数,实在是太多了,于是xhd决定随便搬2*k件过去就行了.但还是会很累,因为2*k也不小是一个不大于n的整数.幸运的是xhd根据多年的搬东西的经验发现每搬一次的疲劳度是和左右手的物品的重量差的平方成正比 >>继续阅读

hdu1395

maksyuki 发表于 oj 分类,标签: ,
0
hdu1395

2^x mod n = 1

Problem Description

Give a number n, find the minimum x(x>0) that satisfies 2^x mod n = 1. >>继续阅读

hdu1251

maksyuki 发表于 oj 分类,标签:
0
hdu1251

统计难题

Problem Description

Ignatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量 >>继续阅读

hdu1240

maksyuki 发表于 oj 分类,标签:
0
hdu1240

Asteroids!

Problem Description

You're in space. >>继续阅读

hdu1238

maksyuki 发表于 oj 分类,标签:
0
hdu1238

Substrings

Problem Description

You are given a number of case-sensitive strings of alphabetic characters, >>继续阅读

hdu1232

maksyuki 发表于 oj 分类,标签:
0
hdu1232

畅通工程

Problem Description

某省调查城镇交通状况,得到现有城镇道路统计表,表中列出了每条道路直接连通的城镇。省政府“畅通工程”的目标是使全省任何两个城镇间都可以实现交通 >>继续阅读

hdu1166

maksyuki 发表于 oj 分类,标签:
0
hdu1166

敌兵布阵

Problem Description

C国的死对头A国这段时间正在进行军事演习,所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务 >>继续阅读

hdu1164

maksyuki 发表于 oj 分类,标签:
0
hdu1164

Eddy's research I

Problem Description

Eddy's interest is very extensive, recently he is interested in prime number. Eddy discover the all number owned can be divided into the multiply of prime number, but he can't write program, so Eddy has to as >>继续阅读

hdu1160

maksyuki 发表于 oj 分类,标签: ,
0
hdu1160

FatMouse's Speed

Problem Description

FatMouse believes that the fatter a mouse is, the faster it runs. To disprove >>继续阅读

hdu1159

maksyuki 发表于 oj 分类,标签:
0
hdu1159

Common Subsequence

Problem Description

A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = <x1, x2, ..., xm> another sequence Z = <z1, z2, ..., zk> is a subsequence >>继续阅读

hdu1114

maksyuki 发表于 oj 分类,标签:
0
hdu1114

Piggy-Bank

Problem Description

Before ACM can do anything, a budget must be prepared and the >>继续阅读