evi__的专栏

Oil Deposits Problem Description The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time,

题目链接   Nightmare Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6225    Accepted Submission(s): 3051 Problem Description Ignatius

题目链接 Ignatius and the Princess I Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 10724 Accepted Submission(s): 3272 Special Judge Problem

逃离迷宫 Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 12605    Accepted Submission(s): 3017 Problem Description 　　给定一个m × n (m行, n列)

Red and Black Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7720    Accepted Submission(s): 4842 Problem Description There is a r

胜利大逃亡 Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 23143    Accepted Submission(s): 8927 Problem Description Ignatius被魔王抓走了,有一天魔

Rescue Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 13329    Accepted Submission(s): 4858 Problem Description Angel was caught b

Open the Lock Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3491    Accepted Submission(s): 1541 Problem Description Now an emerg

Nightmare Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6154    Accepted Submission(s): 3020 Problem Description Ignatius had a n

本题链接   题意:输入3个数 n,k,m ,问通过对n对m进行若干 +, - , * , % 4种操作后 ,能不能得到一个数N,使得 N%k == (n+1)%k 　　 若能,则输出进行操作次数 若不能,则输出0 　　 输入有多组数据,输入0 0 0表示所有数据结束. 这里的 % 不能直接使用 因为,题目中的%是数论中的取模. %： 如果 a = b * q + r (q > 0

诡异的楼梯 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others) Total Submission(s): 7715    Accepted Submission(s): 1860 Problem Description Hogwarts正式开学以后,Harr

Fire Net Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5519    Accepted Submission(s): 3102 Problem Description Suppose that we h

题目描述 小明置身于一个迷宫，请你帮小明找出从起点到终点的最短路程。 小明只能向上下左右四个方向移动。 输入格式 输入包含多组测试数据。输入的第一行是一个整数T，表示有T组测试数据。 每组输入的第一行是两个整数N和M（1 接下来N行，每行输入M个字符，每个字符表示迷宫中的一个小方格。 字符的含义如下： ‘S’：起点 ‘E’：终点 ‘-’：空地，可以通过 ‘#’：障碍，无法

Find The Multiple Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 16144   Accepted: 6600   Special Judge Description Given a positive integer n, write a pr