junior19的博客

Though our Head Chef retired from sport programming long back, but that did not affect his passion to contribute to the programming community. He still remains engaged by creating new problems and pas

"C" Magic ArtifactTime limit2 secondsMemory limit256 megabytesMaxim is playing a video game. It has n levels, numbered from 1 to n. Levels can be completed in

C - CoinsTime limit : 2sec / Memory limit : 256MBScore : 800 pointsProblem StatementThere are X+Y+Z people, conveniently numbered 1 through X+Y+Z. Person i has Ai gold coins,

E - guruguruTime limit : 2sec / Memory limit : 256MBScore : 700 pointsProblem StatementSnuke is buying a lamp. The light of the lamp can be adjusted to m levels of brightness, re

D - Fennec VS. SnukeTime limit : 2sec / Memory limit : 256MBScore : 400 pointsProblem StatementFennec and Snuke are playing a board game.On the board, there are N cells numbere

A1206. 小Z的袜子时间限制：1.0s   内存限制：512.0MB  总提交次数：1578   AC次数：478   平均分：49.23将本题分享到：         查看未格式化的试题   提交   试题讨论试题来源　　2010中国国家集训队命题答辩问题描述　　作为一个生活散漫的人，小Z

D. Tree and Queriestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have a rooted tree consisting of n v

C. Pocket Booktime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne day little Vasya found mom's pocket book

Matrix MultiplicationTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 19099 Accepted: 4108DescriptionYou are given three n × n matrices A, B and C. Doe

B. Cards Sortingtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasily has a deck of cards consisting of n

D. Mike and distributiontime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMike has always been thinking abou

OO’s SequenceTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 4011    Accepted Submission(s): 1484Problem DescriptionOO has got

思路：假如b=2，中心为A，重心为B，那么A-X-B，为了令A和B合法，必须添加节点X-X-A-X-B-(XXX)，这就是b=2时需要的最少节点数，B每增大1就要增加4个节点；当b=0和b=1时有一些细节要处理。# include using namespace std;int main(){ int t, n, b; scanf("%d",&t); while(

B. High Loadtime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputArkady needs your help again! This time he dec

B. The Golden Agetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputUnlucky year in Berland is such a year tha

C. Hacker, pack your bags!time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIt's well known that the best wa

C. Planningtime limit per test1 secondmemory limit per test512 megabytesinputstandard inputoutputstandard outputHelen works in Metropolis airport. She is respon

All submissions for this problem are available.Long long ago, there is a magic board. The magic board has N*N cells: N rows and Ncolumns. Every cell contains one integer, which is 0 initially. L

C. Qualification Roundstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputSnark and Philip are preparing the

Given two integers L and K. You are to find the minimum integer R such that Sum of the number of divisors of all numbers from L to R is greater than K.InputFirst Line specifies an integer T, the numbe...

B. Ralph And His Magic Fieldtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputRalph has a magic field which i

C. Remove Extra Onetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a permutation p of length

D. Inversion Countingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA permutation of size n is an array o

2241: [SDOI2011]打地鼠Time Limit: 10 Sec  Memory Limit: 512 MBSubmit: 1479  Solved: 946[Submit][Status][Discuss]Description打地鼠是这样的一个游戏：地面上有一些地鼠洞，地鼠们会不时从洞里探出头来很短时间后又缩回洞中。玩家的目标是在地鼠伸出头时，用锤子砸其头部，砸到的地鼠越多分数也就越

1153 选择子序列 题目来源： Codility基准时间限制：1 秒 空间限制：131072 KB 分值: 40 难度：4级算法题 收藏 关注长度为N的整数数组A，所有的数均不相同，假设下标从0开始。找到一个最长的数组B，B数组的长度为K，数值范围是0 - N - 1，记录的是A数组的下标。满足A[B[0]] > A[B[1]] > A[B[2]] >...A[B[K]]，并且...

F - Number of DigitsTime limit : 2sec / Memory limit : 256MBScore : 900 pointsProblem StatementFor a positive integer n, let us define f(n) as the number of digits in base 10.You are given an integer ...

C. A Mist of Florescencetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAs the boat drifts down the river, a wood full of blossoms shows up on the ...

Description有n朵花,每朵花有三个属性:花形(s)、颜色(c)、气味(m),用三个整数表示。现在要对每朵花评级,一朵花的级别是它拥有的美丽能超过的花的数量。定义一朵花A比另一朵花B要美丽,当且仅Sa>=Sb,Ca>=Cb,Ma>=Mb。显然,两朵花可能有同样的属性。需要统计出评出每个等级的花的数量。Input第一行为N,K (1 <= N ...

题目链接题意：给N（1e5）个数的一个全排列，每次可以交换相邻的数，问最小交换次数达到数组满足a[i+1] = (a[i]%n)+1。思路：假如换成1，2，3...n的排列，显然答案就是逆序数，那么加如1最终在位置2，留意到逆序数的变化与数字5的位置有关，因为数字5要最终去位置1了，所以枚举1的最终位置，过程O(1)维护逆序数。# include <bits/stdc++.h&...

C. Painting the Fencetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have a long fence which consists ofnnsections. Unfort...

C - Rabbit ExerciseTime limit : 2sec / Memory limit : 256MBScore : 800 pointsProblem StatementThere are N rabbits on a number line. The rabbits are conveniently numbered 1 throug

E. Pretty Songtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputWhen Sasha was studying in the seventh grade,

链接：http://codeforces.com/gym/101246/problem/BB. 3D City Modeltime limit per test1 secondmemory limit per test256 megabytesinputinput.txtoutputoutput.txtA

Problem H: tmk买礼物Description今天是校赛的日子，为了庆祝这么喜庆的日子，TMK打算买些礼物给女票LSH庆祝一下。TMK进入了雪梨超市，然后刚踏入的一瞬间，店主就对TMK说：“恭喜你成为了本店第2147483647位顾客，本店在搞一个活动，对本店第2147483647位顾客进行赠送活动。你先看看你有多少钱？”TMK一摸口袋，发

Problem E: 倒水(Water)Description一天，CC买了N个容量可以认为是无限大的瓶子，开始时每个瓶子里有1升水。接着~~CC发现瓶子实在太多了，于是他决定保留不超过K个瓶子。每次他选择两个当前含水量相同的瓶子，把一个瓶子的水全部倒进另一个里，然后把空瓶丢弃。(不能丢弃有水的瓶子)显然在某些情况下CC无法达到目标，比如N=3,K=1。此时

B. Gerald is into Arttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputGerald bought two very rare paintings

1190. [福州培训2010] 最大和★☆   输入文件：maxsum.in   输出文件：maxsum.out   简单对比时间限制：1 s   内存限制：128 MB【题目描述】N个数围成一圈，要求从中选择若干个连续的数（注意每个数最多只能选一次）加起来，问能形成的最大的和。【输入格式】第一行输入N，表示数字的个数，第二行输入这N个数字。【

10471: 数列游戏 ITime Limit: 2 Sec  Memory Limit: 128 MBSubmit: 63  Solved: 13[Submit][Status][Web Board]Description给定一个长度为N的序列，首先进行A次操作，每次操作在Li和Ri这个区间加上一个数Ci。然后有B次询问，每次询问Li到Ri的区间和。初

SumTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1490    Accepted Submission(s): 758Problem DescriptionThere is a number seque

1682 中位数计数基准时间限制：1 秒 空间限制：131072 KB 分值: 40 难度：4级算法题 收藏 关注中位数定义为所有值从小到大排序后排在正中间的那个数，如果值有偶数个，通常取最中间的两个数值的平均数作为中位数。现在有n个数，每个数都是独一无二的，求出每个数在多少个包含其的区间中是中位数。