[OJ]1013: 狐狸与小狗

2019-1-15 写技术

Description Upwinder最近喜欢上了一款古老的起源于Scandinavia(斯堪迪纳维亚半岛)的小游戏。具体的游戏规则如下: 1. 棋盘设定 棋盘的大小为8行8列,有两个玩家:狐狸和小狗。初始的时候有4只小狗被放置在棋盘最上边一行的4个黑色格子里;而1只狐狸被放在最下边一行的某个黑色格子里。以棋盘左上角为原点,向下为行的正方向,向右为列的正方向,从1开始给每一个格子编号. 2. 移动规则 (1) 两个玩家轮流下棋。 (2) 狐狸每轮可以斜着向上或斜着向下移动至相邻的一个空...

阅读全文>>

标签: C

评论(0) 浏览(1452)

[OJ]1012:Prestige

2019-1-14 写技术

Description Are you watching closely? Every great magic trick consists of three acts. The first act is called The Pledge, the magician shows you something ordinary, but of course, it probably isn't. The second act is called The Turn. The magician makes his ordinary something ...

阅读全文>>

标签: C

评论(0) 浏览(1331)

[OJ]1011:Counting Pixels

2019-1-13 写技术

Description Did you know that if you draw a circle that fills the screen on your 1080p high definition display, almost a million pixels are lit? That's a lot of pixels! But do you know exactly how many pixels are lit? Let's find out! Assume that our display is set on a Cartes...

阅读全文>>

标签: C

评论(0) 浏览(1257)

[OJ]1010:Water Drinking

2019-1-13 写技术

Description The Happy Desert is full of sands. There is only a kind of animal called camel living on the Happy Desert. Cause they live here, they need water here. Fortunately, they find a pond which is full of water in the east corner of the desert. Though small, but enough. However...

阅读全文>>

标签: C

评论(0) 浏览(1356)

[OJ]1009:抛硬币

2019-1-12 写技术

Description James得到了一堆有趣的硬币,于是决定用这些硬币跟朋友们玩个小游戏。在一个N行M列的表格上,每一个第i行第j列的格子上都放有一枚James的硬币,抛该硬币正面朝上的概率为Pij,所有抛硬币事件两两之间是相互独立的。 现在,玩家在M列硬币中,从每一列里各选择1枚,共M枚,构成一组。如此重复选择N组出来,且保证被选择过的硬币不能再选。选好组之后,每组的M枚硬币各抛一次,如果都是正面朝上,则该组胜利,总分赢得1分;否则该组失败,总分不加也不减。请问,如果让你自行选择硬币的分组,游戏总得分的数学期望的最大值是多少? ...

阅读全文>>

标签: C

评论(0) 浏览(1284)

[OJ]1008:

2019-1-12 写技术

Description A Horcrux is an object in which a Dark wizard or witch has hidden a fragment of his or her soul for the purpose of attaining immortality. Constructing a Horcrux is considered Dark magic of the foulest, most evil kind, as it violates laws of nature and morality, and requi...

阅读全文>>

标签: C

评论(0) 浏览(1171)

[OJ]1005:Binary Search Tree analog

2019-1-11 写技术

Input The first integer of the input is T, the number of test cases. Each test case has two lines. The first line contain an integer N,(1<=N<=1000), the number of numbers need to be inserted into the BST. The second line contain N integers separated by space, each integer is in the...

阅读全文>>

标签: C

评论(0) 浏览(1225)

[OJ]1004:Xi and Bo

2019-1-11 写技术

Description Bo has been in Changsha for four years. However he spends most of his time staying his small dormitory. One day he decides to get out of the dormitory and see the beautiful city. So he asks to Xi to know whether he can get to another bus station from a bus station. Xi is n...

阅读全文>>

标签: C

评论(0) 浏览(1579)

[OJ]1003:UC Browser

2019-1-10 写技术

You can get 10 experiences after using UC Browser one day in a row, 20 experiences for two days in a row, 30 experiences for three days in a row, 40 experiences for four days in a row, 50 experiences for five days in a row. If you use UC Browser six days in a row, the experiences you can g...

阅读全文>>

标签: C

评论(0) 浏览(1265)

关键字过滤功能

2018-11-27 写技术

针对于大量营销评论,评论区已经增加了关键字过滤功能。

阅读全文>>

标签: html

评论(0) 浏览(1218)

Powered by anycle 湘ICP备15001973号-1