hpuzsk的博客

400. 第 N 位数字难度中等181在无限的整数序列1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, ...中找到第n位数字。注意：n是正数且在 32 位整数范围内（n < 231）。示例 1：输入：3输出：3示例 2：输入：11输出：0解释：第 11 位数字在序列 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, ... 里是 0 ，它是 10 的一部分。题目描述如上。做题思路要清晰，不要被情绪...

Eddy's research IITime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3845    Accepted Submission(s): 1417Problem DescriptionAs is k

1968: [Ahoi2005]COMMON 约数研究Time Limit: 1 Sec  Memory Limit: 64 MBSubmit: 1412  Solved: 1072[Submit][Status][Discuss]DescriptionInput只有一行一个整数 N（0 Output只有一行输出，为整数M，即f(1)到f(N)的累加

GTW likes mathTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 259    Accepted Submission(s): 129Problem DescriptionAfter atten

geometryTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 205    Accepted Submission(s): 155Problem DescriptionThere is a point P 

Problem DescriptionYou are given two numbers N and M.Every step you can get a new N in the way that multiply N by a factor of N.Work out how many steps can N be equal to M at least.If N can't be to M forever,print −1.

There is a number N.You should output "YES" if N is a multiple of 2, 3 or 5,otherwise output "NO". InputThere are multiple test cases, no more than 1000 cases.For each case,the line contains a integer N.(0<N<1030) OutputFor each test case,output t

You are given a sequence of N integers.You should choose some numbers(at least one),and make the product of them as big as possible.It guaranteed that **the absolute value of** any product of the numbers you choose in the initial sequence will not bigg

GameTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1202    Accepted Submission(s): 414Problem DescriptionXY is playing a game

美素数Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 4756    Accepted Submission(s): 1634Problem Description　　小明对数的研究比较热爱，一谈到数，脑子里

1041: [HAOI2008]圆上的整点Time Limit: 10 Sec  Memory Limit: 162 MBSubmit: 2838  Solved: 1238[Submit][Status][Discuss]Description求一个给定的圆(x^2+y^2=r^2)，在圆周上有多少个点的坐标是整数。InputrOutput

奇数阶魔方Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3212    Accepted Submission(s): 1708Problem Description一个 n 阶方阵的元素是1,2,...,

2005: [Noi2010]能量采集Time Limit: 10 Sec  Memory Limit: 552 MBSubmit: 2494  Solved: 1475[Submit][Status][Discuss]Description栋栋有一块长方形的地，他在地上种了一种能量植物，这种植物可以采集太阳光的能量。在这些植物采集能量后，栋栋再使用一个能量汇集机器把这些植

The sum problemTime Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19582    Accepted Submission(s): 5772Problem DescriptionGiven a s

Herd SumsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 771    Accepted Submission(s): 374Problem DescriptionThe cows in farmer

F(N)Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4073    Accepted Submission(s): 1430Problem DescriptionGiving the N, can y

find the nth digitTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9821    Accepted Submission(s): 2879Problem Description假设：S1

DZY Loves BallsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 748    Accepted Submission(s): 412Problem DescriptionThere are n

The number of divisors(约数) about Humble NumbersTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3100    Accepted Submission(s): 1508P

The MAXTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2054    Accepted Submission(s): 890Problem DescriptionGiving N integers,

Octorber 21stTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3687    Accepted Submission(s): 2267Problem DescriptionHDU's 50th b

Wolf and RabbitTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6381    Accepted Submission(s): 3187Problem DescriptionThere is a

1192: [HNOI2006]鬼谷子的钱袋Time Limit: 10 Sec  Memory Limit: 162 MBSubmit: 2443  Solved: 1785[Submit][Status][Discuss]Description鬼谷子非常聪明，正因为这样，他非常繁忙，经常有各诸侯车的特派员前来向他咨询时政。有一天，他在咸阳游历的时候，朋友告诉他在咸阳最大

1008: [HNOI2008]越狱Time Limit: 1 Sec  Memory Limit: 162 MBSubmit: 6235  Solved: 2658[Submit][Status][Discuss]Description监狱有连续编号为1...N的N个房间，每个房间关押一个犯人，有M种宗教，每个犯人可能信仰其中一种。如果相邻房间的犯人的宗教相同，就可能发生

1257: [CQOI2007]余数之和sumTime Limit: 5 Sec  Memory Limit: 162 MBSubmit: 2787  Solved: 1278[Submit][Status][Discuss]Description给出正整数n和k，计算j(n, k)=k mod 1 + k mod 2 + k mod 3 + … + k mod n的值，其

King's CakeTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 835    Accepted Submission(s): 602Problem DescriptionIt is the king's

Jam's math problemTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 821    Accepted Submission(s): 390Problem DescriptionJam has a

Rikka with ChessTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 521    Accepted Submission(s): 434Problem DescriptionYuta gives

CA Loves StickTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 695    Accepted Submission(s): 245Problem DescriptionCA loves to

校庆神秘建筑Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2061    Accepted Submission(s): 681Problem Description杭州电子科技大学即将迎来50周年的校庆，

1072: [SCOI2007]排列permTime Limit: 10 Sec  Memory Limit: 162 MBSubmit: 1507  Solved: 945[Submit][Status][Discuss]Description给一个数字串s和正整数d, 统计s有多少种不同的排列能被d整除（可以有前导0）。例如123434有90种排列能被2整除，其中末位为

Strange Way to Express IntegersTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 12873 Accepted: 4104DescriptionElina is reading a book written by Ruji

Let it BeadTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5367 Accepted: 3587Description"Let it Bead" company is located upstairs at 700 Cannery Row in

求出矩阵的值以及输出逆矩阵，英语不好，略拗口。上代码：#include#include#includeint map1[110][110],i,j,k,l,m,n,p,vis[110][110],num;int just[110][110];int just2[110][110];void print(int map[][110],int n)//打印矩阵 { int j;

Baby Ming and Weight liftingTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1344    Accepted Submission(s): 491Problem Description

DZY Loves PartitionTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1293    Accepted Submission(s): 481Problem DescriptionDZY l

xiaoxin juju needs helpTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1358    Accepted Submission(s): 387Problem DescriptionAs

2456: modeTime Limit: 1 Sec  Memory Limit: 1 MBSubmit: 2488  Solved: 1066[Submit][Status][Discuss]Description给你一个n个数的数列，其中某个数出现了超过n div 2次即众数，请你找出那个数。Input第1行一个正整数n。第2行n个正整数用空格隔开

CubeTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1672    Accepted Submission(s): 1321Problem DescriptionCowl is good at solvi

相遇周期Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2634    Accepted Submission(s): 1344Problem Description2007年3月26日，在中俄两国元首的见证