七里笑

WOJ

C语言基础(1) UVa(4) 笔试(11)

/ 注册

全部文章 / WOJ （共144篇）

WOJ1424-整数拆分

给你一个正整数N，现在要把这个正整数拆分成若干个正整数，使得它们的和等于N，并且使得它们的积最大。也就是说把一个正整数N，拆分成k个正整数bi (i>=1&&i<=k) 使得b1+b2+??+bk=N，并且b1*b2*??*bk最大(如果有多个拆分方案使得最大值相等，则...

2017-09-11

0 952

WOJ1419-无聊的游戏

xay和amr是两个很无聊的人，现在他两又在玩无聊的游戏。两个人拥有一摞特殊的牌，每张牌上只有一个正整数。现在两人轮流从牌里按顺序翻出一张放在桌上，如果其中一个人翻出的牌上的数字正好与桌上的另一张牌上的数字相同，那么他将获得并拿走这两张牌之间的所有牌（同时也包括这两张）。现在已知这一摞牌的顺序，你知...

2017-09-11

0 428

WOJ1416-WOJ

Alex likes solving problems on WOJ (http://acm.whu.edu.cn/oak). As we all know, a beautiful balloon will appears when a problem is solved. Alex loves...

2017-09-11

0 542

WOJ1413-Pinhole Imaging

When placing a board with a pinhole in the middle between an object and a screen, the reversed image of the object will appear on the screen. That is ...

2017-09-11

0 1193

WOJ1402-Build Your Home

Mr. Tenant is going to buy a new house. In fact, he is going to buy a piece of land and build his new house on it. In order to decide which piece of l...

2017-09-11

0 539

WOJ1420-可见点

平面上有m*n个整点，他们的坐标(x, y)满足1<=x<=m, 1<=y<=n, x,y都是整数。求从原点能看到的点的数量（如果某点与原点的连线上没有其他点，则该点能被原点看到）。输入格式第一行一个数t（1<=t<=15），表示数据的组数以下每...

2017-09-10

0 589

WOJ1414-URL

WHU ACM Team is working on a brand new web browser named "Whu-Super-Browser". You're in response for a powerful feature: recording the prev...

2017-09-10

0 448

WOJ1406-Internet Service Providers

A group of N Internet Service Provider companies (ISPs) use a private communication channel that has a maximum capacity of C traffic units per second....

2017-09-10

0 552

WOJ1386-Number Tricks

Dora loves impressing her friends with number tricks. One of her favorite tricks is to let them name a number n. Dora will then tell them, how many ze...

2017-09-10

0 574

WOJ1372-Sorting Algorithm

One of the fundamental problems of computer science is ordering a list of items. There?re a plethora of solutions to this problem, known as sorting al...

2017-09-10

0 532