zhang_di233的专栏

题目描述给定一个0-1串，请找到一个尽可能长的连续子串，其中包含的0与1的个数相等。组数很多，注意常数优化。。。输入 一个字符串，只包含01，长度不超过1000000输出 一行一个整数，最长的0与1的个数相等的子串的长度。思路：如果某子串中0与1的

DescriptionDZY loves chemistry, and he enjoys mixing chemicals.DZY has n chemicals, and m pairs of them will react. He wants to pour these chemicals into a test tube, and he needs to pour them

Problem Description有一台机器，并且给你这台机器的工作表，工作表上有n个任务，机器在ti时间执行第i个任务，1秒即可完成1个任务。有m个询问，每个询问有一个数字q，表示如果在q时间有一个工作表之外的任务请求，请计算何时这个任务才能被执行。机器总是按照工作表执行，当机器空闲时立即执行工作表之外的任务请求.Input输入的第一行包含一个整数T， 表示一共有T组

DescriptionThere are n swords of different weights Wiand n heros of power Pi.Your task is to find out how many ways the heros can carry the swords so that each hero carries exactly one sword.

DescriptionRecently kiki has nothing to do. While she is bored, an idea appears in his mind, she just playes the checkerboard game.The size of the chesserboard is n*m.First of all, a coin is place

DescriptionSuppose there are a polynomial which has n nonzero terms, please print the integration polynomial of the given polynomial.The polynomial will be given in the following way, and you

Problem DescriptionOne day, a useless calculator was being built by Kuros. Let's assume that number X is showed on the screen of calculator. At first, X = 1. This calculator only supports two type

Problem DescriptionElves are very peculiar creatures. As we all know, they can live for a very long time and their magical prowess are not something to be taken lightly. Also, they live on trees.

DescriptionAlice and Bob are playing the following game with strings of letters.Before the game begins, an initial string and a target string are decided. The initial string is at least as l

DescriptionYou have two empty jugs and tap that may be used to fill a jug. When filling a jug from the tap, you can only fill it completely (i.e., you cannot partially fill it to a desired level

DescriptionLittle girl Susie went shopping with her mom and she wondered how to improve service quality.There are n people in the queue. For each person we know time ti needed to serve him

DescriptionFibsieve had a fantabulous (yes, it's an actual word) birthday party this year. He had so many gifts that he was actually thinking of not having a party next year.Among these gifts th

DescriptionPolycarpus participates in a competition for hacking into a new secure messenger. He's almost won.Having carefully studied the interaction protocol, Polycarpus came to the conclusio

DescriptionYou are given two positive integers – A and B. You have to check whether A is divisible by all the prime divisors of B.InputThe first line of the input contains an integer T d

题目描述塔防游戏 是一类很出名的游戏，在游戏里，你需要建造一些防御塔来攻击怪兽从而保卫小鑫国王。现在又有一波怪兽来袭了，你需要知道小鑫国王能否顶住怪兽的攻击。怪兽所走的路是一条直线，这条直线上有N个格子（连续编号从1到N）。在怪兽敌人赶来之前，你需要建造M个防御塔。每个防御塔的攻击范围是[L, R]，意味着这个防御

题目描述多组输入。对于每组输入：(1 )接下来的n行，每行三个整数Si，Pi，Mi，分别代表第i种物品的数量，价格与质量()。输出对于每组数据，输出一个整数代表答案。思路：由于V范围太大所以不能用常规的背包来解决这个问题，而种数n很小，最大才是3，所以我就想到了用枚举每种物体放多少件的每种情况来求解该问题的答案。示例输入1 1010 1 10

题目描述题意很简单,给出5个数字，你可以使用 ‘ + ’ ,  ‘ - ’ , ‘ * ’运算符（运算符没有优先级关系），使得最后计算的结果等于23,其中给出的5个数字可以任意改变顺序。输入 输入5个数字，每个数字的大小范围为[1,50]。输出 如果最后的运算结果可以等于23,输出Yes,不能的话输出No。思路：用深搜对这五个数进行三种运算。

DescriptionYou are given a sequence a consisting of n integers. Find the maximum possible value of  (integer remainder of ai divided byaj), where 1 ≤ i, j ≤ n and ai ≥ aj.Input

DescriptionTwilight Sparkle was playing Ludo with her friends Rainbow Dash, Apple Jack and Flutter Shy. But she kept losing. Having returned to the castle, Twilight Sparkle became interest

Problem DescriptionYtaaa作为一名特工执行了无数困难的任务，这一次ytaaa收到命令，需要炸毁敌人的一个工厂，为此ytaaa需要制造一批炸弹以供使用。 Ytaaa使用的这种新型炸弹由若干个炸药组成，每个炸药都有它的威力值，而炸弹的威力值为组成这个炸弹的所有炸药的最大威力差的平方，即(max-min)^2，假设一个炸弹有5个炸药组成，威力分别为5 9 8 2 1，那么它

DescriptionDZY has a sequence a, consisting of n integers.We'll call a sequence ai, ai + 1, ..., aj(1 ≤ i ≤ j ≤ n) a subsegment of the sequence a. The value (j - i + 1) denotes the length of t

DescriptionI am going to my home. There are many cities and many bi-directional roads between them. The cities are numbered from0 to n-1 and each road has a cost. There are m roads. You are given