思维
文章平均质量分 57
weixin_46250672
这个作者很懒,什么都没留下…
展开
-
中位数定理
Arranging The Sheep中位数定理:所有数到中间位置之和最短#include<stdio.h>#include<string.h>#include<queue>#include<math.h>#include<algorithm>#include<queue>using namespace std;typedef long long ll;const int N=1e6+10;#define inf原创 2021-06-07 21:08:51 · 282 阅读 · 0 评论 -
Permutation by Sum
A permutation is a sequence of n integers from 1 to n, in which all the numbers occur exactly once. For example, [1], [3,5,2,1,4], [1,3,2] are permutations, and [2,3,2], [4,3,1], [0] are not.Polycarp was given four integers n, l, r (1≤l≤r≤n) and s (1≤s≤n(原创 2021-05-30 17:33:31 · 155 阅读 · 0 评论 -
Ordinary Number
Let’s call a positive integer n ordinary if in the decimal notation all its digits are the same. For example, 1, 2 and 99 are ordinary numbers, but 719 and 2021 are not ordinary numbers.For a given number n, find the number of ordinary numbers among the n原创 2021-05-13 10:30:24 · 710 阅读 · 0 评论 -
青蛙爬井
有一口深度为 high米的水井,井底有一只青蛙,它每天白天能够沿井壁向上爬 up米,夜里则顺井壁向下滑 down米,若青蛙从某个早晨开始向外爬,对于任意指定的 high、up和 down 值(均为自然数),计算青蛙多少天能够爬出井口?输入格式输入3个正整数:high、up 和 down。输出格式输出一个整数,表示天数。输出单独占一行。注意:不能简单地认为每天上升的高度等于白天向上爬的距离减去夜间下滑的距离,因为若白天能爬出井口,则不必等到晚上。数据范围1≤down<up<hi原创 2021-04-09 18:32:35 · 90 阅读 · 0 评论 -
单词替换
输入一个字符串,以回车结束(字符串长度<=100)。该字符串由若干个单词组成,单词之间用一个空格隔开,所有单词区分大小写。现需要将其中的某个单词替换成另一个单词,并输出替换之后的字符串。Input输入包括3行,第1行是包含多个单词的字符串 s;第2行是待替换的单词a(长度 <= 100);第3行是a将被替换的单词b(长度 <= 100).s, a, b 最前面和最后面都没有空格.Output输出只有 1 行,将s中所有单词a替换成b之后的字符串。Sample Input原创 2021-04-09 16:34:46 · 77 阅读 · 0 评论 -
母牛哥与子序列
链接:https://ac.nowcoder.com/acm/contest/13504/I来源:牛客网众所周知,一个序列拥有许多非空子序列。所谓子序列就是在原序列中任意删除 0 个或多个元素,然后保持剩下元素的顺序不变所形成的序列。非空子序列集意味着剩下的子序列不能为空。比如对于序列[1, 2, 3],它的所有非空子序列为:[1, 2, 3],[1, 2],[1, 3],[2, 3],[1],[2],[3]。再比如序列 [1, 1],它的非空子序列有:[1, 1],[1] (删除了第一个 1),[原创 2021-04-04 11:12:16 · 174 阅读 · 0 评论 -
HTML
If you ever tried to read a html document on a Macintosh, you know how hard it is if no Netscape is installed.Now, who can forget to install a HTML browser? This is very easy because most of the times you don’t need one on a MAC because there is a Acrobat原创 2021-02-28 22:41:36 · 122 阅读 · 1 评论 -
Radar Installation
Assume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each small island is a point locating in the sea side. And any radar installation, locating on the coasting, can only cover d distance, so an island in the原创 2021-02-21 22:52:48 · 255 阅读 · 0 评论 -
Pavel and Triangles
##Pavel and TrianglesPavel has several sticks with lengths equal to powers of two.He has a0 sticks of length 20=1, a1 sticks of length 21=2, …, an−1 sticks of length 2n−1.Pavel wants to make the maximum possible number of triangles using these sticks. T原创 2021-02-11 22:18:31 · 100 阅读 · 0 评论 -
升级版的平方和
题目描述现在给出两个正整数m,n。m是m组测试样例,对于给出的n,找到一组解x,y,z使得xx+yy+z*z=n,按照x,y,z,非递减的顺序输出最小正整数解。输入描述输入一个m,表示m组测试样例,每组测试样例输入一个n。输出描述每两组输出样例之间有空行隔开,若找不到合法解,就输出0 0 0样例输入2310样例输出1 1 10 0 0数据范围0<n<=480000,0<m<=1000题解 : n的值很大 所以最好用两层for循环 再用前两个数来确原创 2020-12-30 19:28:42 · 52 阅读 · 0 评论 -
A+B
I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.InputThe first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line consis原创 2020-12-26 08:32:21 · 104 阅读 · 0 评论 -
城市间紧急救援
作为一个城市的应急救援队伍的负责人,你有一张特殊的全国地图。在地图上显示有多个分散的城市和一些连接城市的快速道路。每个城市的救援队数量和每一条连接两个城市的快速道路长度都标在地图上。当其他城市有紧急求助电话给你的时候,你的任务是带领你的救援队尽快赶往事发地,同时,一路上召集尽可能多的救援队。输入格式:输入第一行给出4个正整数N、M、S、D,其中N(2≤N≤500)是城市的个数,顺便假设城市的编号为0 ~ (N−1);M是快速道路的条数;S是出发地的城市编号;D是目的地的城市编号。第二行给出N个正整数,原创 2020-12-22 17:59:32 · 154 阅读 · 0 评论 -
最大子序列
Given a sequence a[1],a[2],a[3]…a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.InputThe first line of the input contains an integer T(1<=T<=20) w原创 2020-10-15 20:24:51 · 1028 阅读 · 0 评论 -
Moving Tables
The famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure.The floor has 200 rooms each on the north side and south side along the corri...原创 2020-04-16 14:05:22 · 98 阅读 · 0 评论 -
cf1462
Polycarp was given an array of a[1…n] of n integers. He can perform the following operation with the array a no more than n times:》Polycarp selects the index i and adds the value ai to one of his choice of its neighbors. More formally, Polycarp adds the v原创 2020-12-17 13:53:04 · 65 阅读 · 0 评论