左眼皮跳跳

POJ 1365 Prime Land 快速幂

Team FormationTime Limit: 3 Seconds      Memory Limit: 131072 KB For an upcoming programming contest, Edward, the headmaster of Marjar University, is forming a two-man team fromN student

1563: LexicographyTime Limit: 1 Sec  Memory Limit: 128 MBSubmit: 342  Solved: 111[Submit][Status][Web Board]DescriptionAn anagram of a string is any string that can be formed using the

B. School Markstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle Vova studies programming in an elite

1420: We love FibonaQTime Limit: 3 Sec  Memory Limit: 128 MB   64bit IO Format: %lldSubmitted: 7  Accepted: 3[Submit][Status][Web Board]DescriptionYou will find CQ is a very bored man wh

RGCDQTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 309    Accepted Submission(s): 156Problem DescriptionMr. Hdu is interested

Kiki & Little Kiki 2Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2265    Accepted Submission(s): 1146Problem DescriptionThere

/*思路:1.先选三个点 2.去掉同行情况 3.去掉同列情况 4.枚举矩形大小去掉重复情况*/#pragma comment(linker, "/STACK:1024000000,1024000000")#include#include#include#include#include#include#include#include#in

1095 - Arrange the NumbersPDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBConsider this sequence {1, 2, 3 ... N}, as an initial se

Beauty of ArrayTime Limit: 2 Seconds      Memory Limit: 65536 KB Edward has an array A with N integers. He defines the beauty of an array as the summation of all distinct integers in the a

Problem DescriptionThere are n black balls and m white balls in the big box.Now, DZY starts to randomly pick out the balls one by one. It forms a sequence S. If at the i-th operation,

Problem DescriptionAs one of the most powerful brushes, zhx is required to give his juniorsn problems.zhx thinks the ith problem's difficulty is i. He wants to arrange these problems in a

hdu1030 数学题简单数学题，找规律，找到了就发现很水。从三个角度看这个图，level，left，right，如下图，题目的答案就是3个图上2个点之间的层数的高度差之和。例如 6 12 ，level=1，left=1，right=1，答案就是3。例如 3 12 ，level=2，left=1，right=2，答案就是6。  #

此题感觉好难，比赛时推两个小时

POJ 1840 数学

POJ 3370 Halloween treats（抽屉原理）

Problem DescriptionGood news for us: to release the financial pressure, the government started selling galaxies and we can buy them from now on! The first one who bought a galaxy was Tianming Yun an

Problem DescriptionAlexandra has a little brother. He is new to programming. One day he is solving the following problem: Given an positive integer N, judge whether N is prime.The problem above is

Language:DefaultFibonacciTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9972 Accepted: 7114DescriptionIn the Fibonacci integer sequence, F0 = 0

Problem DescriptionFFZ's birthday is coming. GTY wants to give a gift to ZZF. He asked his gay friends what he should give to ZZF. One of them said, 'Nothing is more interesting than a number multis

650. 2 Keys KeyboardDescriptionHintsSubmissionsDiscussSolutionPick OneInitially on a notepad only one character 'A' is present. You can perform two operations on this notepad for each step:Cop...