blue_hpu的博客

The Pilots Brothers' refrigeratorTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 25859 Accepted: 9979 Special JudgeDescriptionThe game “The Pilots

A为一个方阵，则Tr A表示A的迹（就是主对角线上各项的和），现要求Tr(A^k)%9973。 Input数据的第一行是一个T，表示有T组数据。每组数据的第一行有n(2  Output对应每组数据，输出Tr(A^k)%9973。 Sample Input22 21 00 13 999999991 2 34 5 67 8

七夕节那天,月老来到数字王国,他在城门上贴了一张告示,并且和数字王国的人们说:"你们想知道你们的另一半是谁吗?那就按照告示上的方法去找吧!"人们纷纷来到告示前,都想知道谁才是自己的另一半.告示如下:数字N的因子就是所有比N小又能被N整除的所有正整数,如12的因子有1,2,3,4,6.你想知道你的另一半吗?本来是暴力打表，结果超时，居然可以直接暴力过，

FibonacciTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4892    Accepted Submission(s): 2272Problem Description2007年到来了。经过2006年一年的修

Number SequenceTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 158460    Accepted Submission(s): 38811Problem DescriptionA number se

Non-square Equationtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLet's consider equation:x2 + s(x)·x - n = 0, whe

February 29   PDF (English)StatisticsForumTime Limit: 1 second(s)Memory Limit: 32 MBIt is 2012, and it's a leap year. So there is a "February2

Consistent Verdicts   PDF (English)StatisticsForumTime Limit: 5 second(s)Memory Limit: 32 MBIn a 2D plane N persons are standing and each of t

机会渺茫Time Limit:5000MS    Memory Limit:262144KB    64bit IO Format:%lld & %lluSubmitStatusDescription小Hi最近在追求一名学数学的女生小Z。小Z其实是想拒绝他的，但是找不到好的说辞，于是提出了这样的要求：对于给定的两个正整数N和M，小Hi随机选取一个N的约数N'，小Z随机选取一

Palindrome Transformationtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputNam is playing with a string on his computer.

OR in Matrixtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLet's define logical OR as an operation on two logical valu

Prime TimeEuler is a well-known matematician, and, among many other things, he discovered that the formula n 2 + n + 41 produces a prime for 0 ≤ n < 40. For n = 40, the formula produces 1681, which

n个盘子的汉诺塔问题的最少移动次数是2^n-1,即在移动过程中会产生2^n个系列。由于发生错移产生的系列就增加了，这种错误是放错了柱子，并不会把大盘放到小盘上，即各柱子从下往上的大小仍保持如下关系 ： n=m+p+q a1>a2>...>am b1>b2>...>bp c1>c2>...>cq ai是A柱上的盘的盘号系列，bi是B柱上的盘的盘号系列， ci是C柱上的盘的盘号系列

DescriptionYou are given two integers: n and k, your task is to find the most significant three digits, and least significant three digits ofnk.InputInput starts with an integer T (≤

time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputJohn Doe started thinking about graphs. After some thought he decided that

Problem Description“ 改革春风吹满地,不会AC没关系;实在不行回老家，还有一亩三分地。谢谢!（乐队奏乐）”话说部分学生心态极好，每天就知道游戏，这次考试如此简单的题目，也是云里雾里，而且，还竟然来这么几句打油诗。好呀，老师的责任就是帮你解决问题，既然想种田，那就分你一块。这块田位于浙江省温州市苍南县灵溪镇林家铺子村，多边形形状的一块地，原本是

Ultra-QuickSortTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 59469 Accepted: 22019DescriptionIn this problem, you have to analyze a particular sorting

Link/Cut Treetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputProgrammer Rostislav got seriously interested in the Link

New Year Tabletime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputGerald is setting the New Year table. The table has the

放苹果Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 33440 Accepted: 20735Description把M个同样的苹果放在N个同样的盘子里，允许有的盘子空着不放，问共有多少种不同的分法？（用K表示）5，1，1和1，5，1 是同一种分法。

Faulty OdometerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9339 Accepted: 5782DescriptionYou are given a car odometer which displays the miles trave

Smallest DifferenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10607 Accepted: 2896DescriptionGiven a number of distinct decimal digits, you can for

最大的位或Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1221    Accepted Submission(s): 492Problem DescriptionB君和G君聊天的时候想到了如下的问题。给定自然

AreaTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6494 Accepted: 2842DescriptionBeing well known for its highly innovative products, Merck would defin

985的0-1串难题 [二分、尺取]时间限制: 1 Sec 内存限制: 128 MB提交: 18 解决: 7 状态题目描述985有一个长度为nn的0−10−1串，已知他最多可以修改kk次（每次修改一个字符即0−>10−>1 或者 1−>01−>0），他想知道连续的全11子串最长是多少。输入第一行输入一个整数TT，代表有TT组测试数据。每组数据

最大和难题 [思维]时间限制: 1 Sec 内存限制: 128 MB提交: 34 解决: 4 状态题目描述985有2∗n−12∗n−1个整数，他每次可以将其中nn个数变号，操作次数不限，问他可以得到的最大和。输入第一行输入一个整数TT，代表有TT组测试数据。每组数据占两行，第一行输入一个整数nn代表元素个数，下面一行输入2∗n−12∗n−1个

MZL's xorTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1279    Accepted Submission(s): 795Problem DescriptionMZL loves xor very mu

严格递增连续子段 [模拟]时间限制: 1 Sec 内存限制: 128 MB提交: 67 解决: 4 题目描述给定一个有N个正整数组成的序列，你最多可以改变其中一个元素，可以修改为任意的整数。问可以得到的严格递增连续子段的最大长度。输入第一行输入一个整数T，代表有T组测试数据。每组数据占两行，第一行输入一个整数N，代表元素个

街区最短路径问题时间限制：3000 ms  |  内存限制：65535 KB难度：4描述 一个街区有很多住户，街区的街道只能为东西、南北两种方向。住户只可以沿着街道行走。各个街道之间的间隔相等。用(x,y)来表示住户坐在的街区。例如（4,20），表示用户在东西方向第4个街道，南北方向第20个街道。现在要建一个邮局，使得各个住户到邮局的距离之和

DescriptionFactorial of an integer is defined by the following functionf(0) = 1f(n) = f(n - 1) * n, if(n > 0)So, factorial of 5 is 120. But in different bases, the factorial may be different

1912: 小火山的爱情密码Time Limit: 1 Sec  Memory Limit: 128 MBSubmit: 212  Solved: 56SubmitStatusWeb BoardDescription小火山获得了一个字符串，然而大火山让小火山从里面截取一段字符串，并且让小火山截取的字符串满足一些字符达到一定数量。小火山觉得很容易，但是他想要知

FliptileTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 7394 Accepted: 2787DescriptionFarmer John knows that an intellectually satisfied cow is a happ

Magic Powder - 2Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 670D2DescriptionThe term of this problem is the s

Task scheduleTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2901    Accepted Submission(s): 1005Problem Description有一台机器，并且给你这台机器的工

River HopscotchTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 11497 Accepted: 4946DescriptionEvery year the cows hold an event featuring a peculiar v

The Frog's GamesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 6177    Accepted Submission(s): 3011Problem DescriptionThe annual Ga

Can you find it?Time Limit: 10000/3000 MS (Java/Others)    Memory Limit: 32768/10000 K (Java/Others)Total Submission(s): 23851    Accepted Submission(s): 6046Problem DescriptionGive you th

Cable masterTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3798    Accepted Submission(s): 1463Problem DescriptionInhabitants of th

Can you solve this equation?Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16580    Accepted Submission(s): 7363Problem Description

简单计算器Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17991    Accepted Submission(s): 6333Problem Description读入一个只包含 +, -, *, / 的非负整