【免费】经典ACM题总结（中山大学）资源-CSDN文库

经典ACM题总结

需积分: 0 45 浏览量 2011-04-09 15:33:00 上传评论收藏 638KB PDF 举报

资源推荐

资源详情

资源评论

第一次 ACM

ACM

ACM 总结（ 7

ACM

ACM ）

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set –

–

– 1001

1001

1001 A

A +

+ B

B Problem

Problem

.....................................................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set –

–

– 1037

1037

1037 Gridland

Gridland

...................................................................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set –

–

– 1045

1045

1045 HangOver

HangOver

...............................................................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set –

–

– 1048

1048

1048 Financial

Financial

Financial Management

Management

....................................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set –

–

– 1049

1049

1049 I

I Think

Think

Think I

I Need

Need

Need a

a Houseboat

Houseboat

........................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set –

–

– 1067

1067

1067 Color

Color

Color Me

Me Less

Less

Less 有问题

....................................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set –

–

– 1073

1073

1073 Round

Round

Round and

and

and Round

Round

Round We

We Go

............................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set –

–

– 1113

1113

1113 u

u Calculate

Calculate

Calculate e

......................................................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set –

–

– 1115

1115

1115 Digital

Digital

Digital Roots

Roots

......................................................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set –

–

– 1151

1151

1151 Word

Word

Word Reversal

Reversal

..................................................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set –

–

– 1216

1216

1216 Deck

Deck

........................................................................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set -

- 1240

1240

1240 IBM

IBM

IBM Minus

Minus

Minus One

One

..................................................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set -

- 1241

1241

1241 Geometry

Geometry

Geometry Made

Made

Made Simple

Simple

................................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set -

- 1251

1251

1251 Box

Box

Box of

of Bricks

Bricks

......................................................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set -

- 1292

1292

1292 Integer

Integer

Integer Inquiry

Inquiry

.................................................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set -

- 1331

1331

1331 Perfect

Perfect

Perfect Cubes

Cubes

.....................................................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set -

- 1337

1337

1337 Pi

...............................................................................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set -

- 1350

1350

1350 The

The

The Drunk

Drunk

Drunk Jailer

Jailer

...............................................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set -

- 1382

1382

1382 A

A Simple

Simple

Simple Task

Task

....................................................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set -

- 1712

1712

1712 Skew

Skew

Skew Binary

Binary

........................................................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set -

- 1730

1730

1730 Crazy

Crazy

Crazy Tea

Tea

Tea Party

Party

.................................................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set -

- 1760

1760

1760 Doubles

Doubles

..................................................................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set -

- 1763

1763

1763 A

A Simple

Simple

Simple Question

Question

Question of

of Chemistry

Chemistry

.............................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set -

- 1797

1797

1797 Least

Least

Least Common

Common

Common Multiple

Multiple

................................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set -

- 1871

1871

1871 Steps

Steps

Steps //

// 既然没有代码记录！！！

....................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set -

- 1879

1879

1879 Jolly

Jolly

Jolly Jumpers

Jumpers

Jumpers //

// 又是没有代码

................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set -

- 1915

1915

1915 Above

Above

Above Average

Average

..................................................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set -

- 2001

2001

2001 Adding

Adding

Adding Reversed

Reversed

Reversed Numbers

Numbers

.........................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set -

- 2201

2201

2201 No

No Brainer

Brainer

............................................................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set -

- 2388

2388

2388 Beat

Beat

Beat the

the

the Spread!

Spread!

..............................................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set -

- 2947

2947

2947 Abbreviation

Abbreviation

.......................................................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set -

- 2965

2965

2965 Accurately

Accurately

Accurately Say

Say

Say "CocaCola"!

"CocaCola"!

.......................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set -

- 2969

2969

2969 Easy

Easy

Easy Task

Task

..............................................................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set -

- 2970

2970

2970 Faster,

Faster,

Faster, Higher,

Higher,

Higher, Stronger

Stronger

..............................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set -

- 2987

2987

2987 Misspelling

Misspelling

...........................................................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set -

- 2988

2988

2988 Conversions

Conversions

........................................................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set –

–

– 3313

3313

3313 Clock//

Clock//

Clock// 没有代码 ……

...........................................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set –

–

– 3322

3322

3322 Who

Who

Who is

is Older?

Older?

....................................................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set -

- 3323

3323

3323 Somali

Somali

Somali Pirates

Pirates

...................................................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set -

- 3328

3328

3328 Wu

Wu Xing

Xing

.................................................................................................

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set -

- 3333

3333

3333 Guess

Guess

Guess the

the

the Price

Price

.................................................................................

浙江科技学院 ACM 习题第一次总结（蓝燕） 2010-4-19

ZOJ

ZOJ Problem

Problem

Problem Set

Set

Set –

–

– 1037

1037

1037 Gridland

Gridland

Time Limit: 1 Second Memory Limit: 32768 KB

Background

For years, computer scientists have been trying to find efficient solutions to different

computing [ 计算 ] problems. For some of them efficient algorithms [ 算法 ] are already available,

these are the "easy" problems like sorting [ 整理；排序；分类拣选 ] , evaluating a polynomial [ 多

项式 ] or finding the shortest path in a graph. For the "hard" ones only exponential-time

algorithms [ 指数时间算法 ] are known. The traveling-salesman problem belongs to this latter

group. Given a set of N towns and roads between these towns, the problem is to compute the

shortest path allowing a salesman to visit each of the towns once and only once and return to

the starting point.

Problem

The president of Gridland has hired you to design a program that calculates the length of the

shortest traveling-salesman tour for the towns in the country. In Gridland, there is one town

at each of the points of a rectangular grid [ 直角坐标网 ] . Roads run from every town in the

directions North, Northwest, West, Southwest, South, Southeast, East, and Northeast,

provided that there is a neighboring town in that direction. The distance between neighboring

towns in directions North-South or East-West is 1 unit. The length of the roads is measured by

the Euclidean distance [ 欧几里得距离 ] . For example, Figure 7 shows 2 * 3-Gridland, i.e., a

rectangular grid of dimensions [ 规模，大小 ] 2 by 3. In 2 * 3-Gridland, the shortest tour has

length 6.

Figure 7: A traveling-salesman tour in 2 * 3-Gridland.

Input

The first line contains the number of scenarios [ 剧情 ( 情况 ) ] .

For each scenario, the grid dimensions m and n will be given as two integer numbers in a

single line, separated by a single blank, satisfying 1 < m < 50 and 1 < n < 50.

Output

The output for each scenario begins with a line containing "Scenario #i:", where i is the

number of the scenario starting at 1. In the next line, print the length of the shortest

traveling-salesman tour rounded to two decimal digits. The output for every scenario ends

with a blank line.

Sample

Sample Input

Input

2 2

剩余89页未读，继续阅读

评论收藏

内容反馈

dengjianqiang2011

粉丝: 59
资源: 26

经典ACM题总结（中山大学）

中山大学acm比赛试题

重点大学的ACM题库和解答荟萃第一部分(chm)

中山大学大学生程序设计竞赛

ACM经典解题报告（多年总结的）

ACM大牛总结的线段树专辑,超经典的-1

ACM动态规划总结 动态规划经典题傻瓜式讲解

中山大学ACM模板 中山大学 ACM 模板

acm试题湖南大学acm试题

acmacm经典题库

北京大学ACM题库、北京大学ACM源码、浙江大学ACM源码

浙江大学ＡＣＭ题库 浙江大学ＡＣＭ题库

浙江大学ACM题库答案

浙江大学ACM题库

ACM练习题ACM各种练习题ACM各种练习题ACM各种练习题

acm 经典acm经典acm经典acm经典

中山大学ACM模板

ACM动态规划经典题

中山大学ACM模板.rar

浙江大学acm题库 2636道

浙江大学的ACM试题

北大ACM题库（3000多道题）

经典ACM题Gone Fishing C++源代码

非常不错的ACM经典试题

Qt上位机软件串口通讯，视频源码，免费下载

代码随想录算法PDF.rar

张玉生《C语言程序设计》双色版 C语言程序设计理论教材习题参考答案.pdf

cloud compare用户手册（中文+英文）

CRC8/CRC16/CRC32常见几个标准的算法及C语言实现

最新资源

ACM动态规划总结动态规划经典题傻瓜式讲解

中山大学ACM模板中山大学 ACM 模板

浙江大学ＡＣＭ题库浙江大学ＡＣＭ题库