小坏蛋_千千

Price ListTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/131072 K (Java/Others)Total Submission(s): 270    Accepted Submission(s): 177Problem DescriptionThere are  shop

描述 小Hi最近在教邻居家的小朋友小学奥数，而最近正好讲述到了三阶幻方这个部分，三阶幻方指的是将1~9不重复的填入一个3*3的矩阵当中，使得每一行、每一列和每一条对角线的和都是相同的。 三阶幻方又被称作九宫格，在小学奥数里有一句非常有名的口诀：“二四为肩，六八为足，左三右七，戴九履一，五居其中”，通过这样的一句口诀就能够非常完美的构造出一个九宫格来。 有意思的是，

Description Seiji Hayashi had been a professor of the Nisshinkan Samurai School in the domain of Aizu for a long time in the 18th century. In order to reward him for his meritorious career in educati

Description The D-pairs of a string of letters are the ordered pairs of letters that are distance D from each other. A string is D-unique if all of its D-pairs are different. A string is surprising i

问题描述 终于又开学啦。呃喵最喜欢的就是开学了，因为这样她又可以愉快地翘课了（啊？） 呃喵接下来有n节课程需要上（换句话说，可以翘。） 每节课程有相应的课程类型与课程翘课价值。 有一点需要注意的是，呃喵不可以翘同一类课程超过两次，就是如果这类课已经翘了两次，接下来就一定要上。 问你在这个条件下，呃喵可以获得的最大翘课价值。输入描述 第一行为一个整数T

Problem Description 我们建造了一个大项目！这个项目有n个节点，用很多边连接起来，并且这个项目是连通的！ 两个节点间可能有多条边，不过一条边的两端必然是不同的节点。 每个节点都有一个能量值。 现在我们要编写一个项目管理软件，这个软件呢有两个操作： 1.给某个项目的能量值加上一个特定值。 2.询问跟一个项目相邻的项目的能量值之和。

Description In Korea, the naughtiness of the cheonggaeguri, a small frog, is legendary. This is a well-deserved reputation, because the frogs jump through your rice paddy at night, flattening rice pl

The Binding of IsaacTime Limit: 2000MS Memory limit: 65536K题目描述Ok, now I will introduce this game to you...Isaac is trapped in a maze which has many common rooms…Li

FibonacciTime Limit: 2000MS Memory limit: 131072K题目描述Fibonacci numbers are well-known as follow: Now given an integer N, please find out whether N can be represented as the sum of se

JulyedTime Limit: 2000MS Memory limit: 65536K题目描述    Julyed is preparing for her CET-6. She has N words to remember, but there is only M days left. If she can’t remember all these words,

Problem Description Calculate ∑ni=1im mod (1000000000+7)\sum_{i=1}^ni^m~mod~(1000000000+7) for given n，m.Input Input contains two integers n,m(1≤n≤1000,0≤m≤10).Output Output the answer in a sin

Description Dear Liao I never forget the moment I met with you. You carefully asked me: “I have a very difficult problem. Can you teach me?”. I replied with a smile, “of course”. You replied:”Gi

Description The game “The Pilots Brothers: following the stripy elephant” has a quest where a player needs to open a refrigerator. There are 16 handles on the refrigerator door. Every handle can

Description Flip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side of each piece is white and the other one is black and each piece is lying e

Description When a radio station is broadcasting over a very large area, repeaters are used to retransmit the signal so that every receiver has a strong signal. However, the channels used by each rep

NanoApe Loves Sequence ⅡTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 262144/131072 K (Java/Others)Total Submission(s): 520    Accepted Submission(s): 253Problem DescriptionN

The Best Seat in ACM ContestTime Limit: 1000MS Memory limit: 65536K题目描述Cainiao is a university student who loves ACM contest very much. It is a festival for him once when he attends ACM

Rotation Lock PuzzleTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1836    Accepted Submission(s): 580Problem DescriptionAlice

Hamming DistanceTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1845    Accepted Submission(s): 740Problem Description(From wiki

Whoooa! There is a spy in Marjar University. All we know is that the spy has a special ID card. Please find him out!

3868 - Earthstone: Easy VersionTime Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%lld & %lluSubmit Status Practice ZOJ 3867DescriptionEarthstone is a famous online c

题目1 : 搜索一·24点时间限制:10000ms单点时限:1000ms内存限制:256MB 描述周末，小Hi和小Ho都在家待着。在收拾完房间时，小Ho偶然发现了一副扑克，于是两人考虑用这副扑克来打发时间。小Ho：玩点什么好呢？小Hi：两个人啊，不如来玩24点怎么样，不靠运气就靠实力的游戏。小Ho：好啊，好啊。

Problem DTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 247    Accepted Submission(s): 174Problem Description度熊所居住的 D 国，是一个完全尊重

NanoApe Loves SequenceTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/131072 K (Java/Others)Total Submission(s): 409    Accepted Submission(s): 189Problem DescriptionNan

Face The Right WayTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 4172 Accepted: 1918DescriptionFarmer John has arranged his N (1 ≤ N ≤ 5,000) cows in a

DanganronpaTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 315    Accepted Submission(s): 227Problem DescriptionChisa Yukizome w

Description You have an array a with length n, you can perform operations. Each operation is like this: choose two adjacent elements from a, say x and y, and replace one of them with gcd(x, y), where