模拟
XinxiZon
这个作者很懒,什么都没留下…
展开
-
I - I HRBUST - 2322(模拟)
Kim正在玩一款手游,在这款游戏中,Kim可以选择若干个角色编成一队作战。为了挑战不同的关卡,Kim需要不断的调整编队阵容。然而随着游戏不断更新,队伍成员变得越来越多,Kim已经记不清哪些角色在队伍中,哪些角色不在队伍中了。请你写一个程序来帮助他。具体来说,Kim有三种可以执行的操作。1x:把x号角色加入队伍。如果x号角色已经在队伍中,什么都不会发生。2x:把x号...原创 2019-04-26 15:35:16 · 279 阅读 · 0 评论 -
编码问题
设有一个数组A:ARRAY[0..N-1] OF INTEGER;数组中存放的元素为0~N-1之间的整数,且A[i]≠A[j](当i≠j时)。例如: N=6时,有:A=(4,3,0,5,1,2) 此时,数组A的编码定义如下: A[0]的编码为0; A[i]的编码为:在A[0],A[1],……A[i-1]中比A[i]的值...原创 2019-05-01 21:24:04 · 779 阅读 · 3 评论 -
C - Time(模拟)
Digital clock use 4 digits to express time, each digit is described by 3*3 characters (including”|”,”_”and” “).now given the current time, please tell us how can it be expressed by the digital clock....原创 2019-03-29 19:09:45 · 308 阅读 · 0 评论 -
H - A Simple Triangle NBUT - 1226(模拟)
In this problem you need to make a triangle ,just like the sample out. The element in the ith row and jth columnshould be the product(乘积) of i and j.InputThe first line of input is an integer C ...原创 2019-03-29 19:14:03 · 107 阅读 · 0 评论 -
M - Lisp em SCU - 4490(模拟)
Time Limit: 1000 MS Memory Limit: 131072 K DescriptionThere are two lists and they may be intersected with each other. You must judge if they are intersected and find the first node the...原创 2019-03-29 20:22:52 · 142 阅读 · 0 评论 -
D - SPY NBUT - 1220(模拟)
The National Intelligence Council of X Nation receives a piece of credible information that Nation Y will send spies to steal Nation X’sconfidential paper. So the commander ofThe National Intelligen...原创 2019-03-29 21:18:32 · 307 阅读 · 0 评论 -
A. The Useless Toy(模拟)
题目链接题意:v<^>代表上下左右四个方向,输入的数字表示转动的时间,每秒转动一次,求所给出的是顺时针旋转还是逆时针,如果无法判断,输出undefined。思路:直接暴力,分别列举上下左右为起始点的情况,把顺时针逆时针的四个符号按转动次序分别存入两个字符数组中,按输入的数字%4与其下标进行对比,判断是哪种旋转方式,如果数字既符合顺时针,又符合逆时针,则是第三种情况....原创 2019-04-05 09:20:38 · 131 阅读 · 0 评论 -
H - H HDU - 5547(模拟)
Yi Sima was one of the best counselors of Cao Cao. He likes to play a funny game himself. It looks like the modern Sudoku, but smaller.Actually, Yi Sima was playing it different. First of all, he tr...原创 2019-04-16 19:27:15 · 181 阅读 · 0 评论