随笔分类 -  思维题

摘要:题目链接:https://codeforces.com/problemset/problem/1260/D You are playing a computer game, where you lead a party of mm soldiers. Each soldier is characte 阅读全文
posted @ 2019-12-02 20:15 执||念 阅读(349) 评论(0) 推荐(0)
摘要:题目链接:https://codeforces.com/problemset/problem/658/E Codeforces is a wonderful platform and one its feature shows how much someone contributes to the 阅读全文
posted @ 2019-11-27 20:35 执||念 阅读(227) 评论(0) 推荐(0)
摘要:题目链接:https://codeforces.com/problemset/problem/658/D Limak is a little polar bear. He doesn't have many toys and thus he often plays with polynomials. 阅读全文
posted @ 2019-11-27 14:04 执||念 阅读(204) 评论(0) 推荐(0)
摘要:题目链接:https://codeforces.com/contest/1262/problem/D2 D2. Optimal Subsequences (Hard Version) time limit per test 3 seconds memory limit per test 256 me 阅读全文
posted @ 2019-11-25 13:47 执||念 阅读(346) 评论(0) 推荐(0)
摘要:链接:https://ac.nowcoder.com/acm/contest/2272/H来源:牛客网 「土」巨石滚滚 时间限制:C/C++ 1秒,其他语言2秒 空间限制:C/C++ 131072K,其他语言262144K 64bit IO Format: %lld 题目描述 帕秋莉掌握了一种土属性 阅读全文
posted @ 2019-11-24 15:52 执||念 阅读(302) 评论(0) 推荐(0)
摘要:题目链接:http://codeforces.com/problemset/problem/652/F n ants are on a circle of length m. An ant travels one unit of distance per one unit of time. Init 阅读全文
posted @ 2019-11-13 21:45 执||念 阅读(248) 评论(0) 推荐(0)
摘要:题目链接:http://codeforces.com/gym/101981/attachments 题目大意:输入两个串 问你第一个串能不能转化为第二个串,翻转次数无限制,但是每次只能翻转K个连续相同的字母 思路:找到两个串中连续的相等的K个字符,可以把他们提到串的最前面(也可以全部消掉,因为不管位 阅读全文
posted @ 2019-10-19 15:22 执||念 阅读(494) 评论(0) 推荐(0)
摘要:题目链接:https://nanti.jisuanke.com/t/41298 Here is a square matrix of n * nn∗n, each lattice has its value (nn must be odd), and the center value is n * 阅读全文
posted @ 2019-09-14 11:02 执||念 阅读(255) 评论(0) 推荐(0)
摘要:题目链接:http://codeforces.com/contest/1204/problem/D1 D1. Kirk and a Binary String (easy version) time limit per test 1 second memory limit per test 256 阅读全文
posted @ 2019-08-21 15:22 执||念 阅读(571) 评论(0) 推荐(0)
摘要:题目链接:http://www.51nod.com/Challenge/Problem.html#problemId=1157 1157 全是1的最大子矩阵 1.0 秒 131,072.0 KB 40 分 4级题 1157 全是1的最大子矩阵 1.0 秒 131,072.0 KB 40 分 4级题 阅读全文
posted @ 2019-07-20 16:10 执||念 阅读(320) 评论(0) 推荐(0)
摘要:题目链接:http://codeforces.com/contest/878/problem/D D. Magic Breeding time limit per test 4 seconds memory limit per test 1024 megabytes input standard i 阅读全文
posted @ 2019-05-13 21:35 执||念 阅读(285) 评论(0) 推荐(0)
摘要:题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5544 学习链接:https://www.cnblogs.com/qscqesze/p/4902518.html https://blog.csdn.net/snowy_smile/article/det 阅读全文
posted @ 2019-04-10 20:27 执||念 阅读(287) 评论(0) 推荐(0)
摘要:题目链接:http://codeforces.com/problemset/problem/776/C C. Molly's Chemicals time limit per test 2.5 seconds memory limit per test 512 megabytes input sta 阅读全文
posted @ 2019-03-27 20:57 执||念 阅读(444) 评论(0) 推荐(0)
摘要:题目链接:https://ac.nowcoder.com/acm/contest/393/C 链接:https://ac.nowcoder.com/acm/contest/393/C来源:牛客网 题目描述 给定m个长为n的序列a1,a2,…,ama1,a2,…,am。 小Z想问你: n∑i1=1n∑ 阅读全文
posted @ 2019-03-21 21:46 执||念 阅读(248) 评论(0) 推荐(0)
摘要:题目链接:https://www.nowcoder.com/acm/contest/180/B 链接:https://www.nowcoder.com/acm/contest/180/B来源:牛客网 时间限制:C/C++ 1秒,其他语言2秒 空间限制:C/C++ 262144K,其他语言524288 阅读全文
posted @ 2018-09-08 15:29 执||念 阅读(241) 评论(0) 推荐(0)
摘要:I J I: Carryon的字符串 时间限制: 1 s 内存限制: 128 MB 提交 我的状态 时间限制: 1 s 内存限制: 128 MB 时间限制: 1 s 内存限制: 128 MB 题目描述 Carryon最近喜欢上了一些奇奇怪怪的字符,字符都是英文小写字母,但奇怪的是a可能比b小,也可能 阅读全文
posted @ 2018-08-13 15:11 执||念 阅读(212) 评论(0) 推荐(0)
摘要:题目链接:http://codeforces.com/problemset/problem/589/D Welcoming autumn evening is the best for walking along the boulevard and n people decided to do so 阅读全文
posted @ 2018-08-02 17:00 执||念 阅读(179) 评论(0) 推荐(0)
摘要:题目链接:https://vjudge.net/contest/242578#problem/B Dasha decided to bake a big and tasty layer cake. In order to do that she went shopping and bought n 阅读全文
posted @ 2018-08-01 11:42 执||念 阅读(147) 评论(0) 推荐(0)
摘要:题目链接:https://vjudge.net/contest/239445#problem/H 题目大意:输入n,k,有n*n* n*n的网格,要求每行每列刚好有k个*,每n*n的小方格内也刚好有k个*。 思路:不是自己写出来的,大概思路就是从第一排开始放,放满k个,然后跳到下一行,在这行的基础上 阅读全文
posted @ 2018-07-31 10:46 执||念 阅读(112) 评论(0) 推荐(0)
摘要:题目链接:https://vjudge.net/contest/241341#problem/I 题目大意:输入t,t组样例,输入n,m,有n个圆槽,m个硬币,接下来m行代表每个硬币所在的位子,要求你移动硬币使得相邻的硬币距离相等,输出最小的最大移动步数(这里所指的是 一个硬币最大移动的步数) 个人 阅读全文
posted @ 2018-07-29 17:33 执||念 阅读(277) 评论(0) 推荐(0)