CF
向前走别回头
在读学生一枚。
展开
-
CF Round #520 (Div. 2)
A A PrankB MathC Banh-miD Fun with Integers原创 2018-11-16 00:51:20 · 618 阅读 · 0 评论 -
CF Round #540 (Div. 3)
ACM题集:https://blog.csdn.net/weixin_39778570/article/details/83187443题目链接:https://codeforces.com/contest/1118B给定一个数列,问有多少个点,断掉这个点后的新数列,奇数下标部分和等于偶数下标部分的和---------------------------------------------...原创 2019-02-27 22:02:52 · 175 阅读 · 0 评论 -
CF Round #542 (Div. 2)
CF Round #542 (Div. 2)原创 2019-02-27 16:04:50 · 391 阅读 · 0 评论 -
Codeforces Global Round 1
ACM题集:https://blog.csdn.net/weixin_39778570/article/details/83187443题目链接:https://codeforces.com/contest/1110A Parity奇偶判断B Tape有1到m 有n个区间点 使用不超过k个木板,覆盖所有点,要求木板最短---------------------------------...原创 2019-02-11 17:44:24 · 388 阅读 · 0 评论 -
CF Round #535 (Div. 3)
ACM题集:https://blog.csdn.net/weixin_39778570/article/details/83187443题目链接:https://codeforces.com/contest/1108A给出俩个区间[L1,R1] [L2,R2] 输出x属于第一个区间,y属于第二个区间,并且x不等于y保证有解 -------------------------------...原创 2019-02-08 14:53:02 · 217 阅读 · 0 评论 -
CF Round #537 (Div. 2)
ACM题集:https://blog.csdn.net/weixin_39778570/article/details/83187443题目链接:https://codeforces.com/contest/1111A元音之间可以互相转换,辅音之间可以互相转换,若两个句子无法转换成同个句子输出No否则输出Yes #include<bits/stdc++.h>#defin...原创 2019-02-06 00:39:43 · 563 阅读 · 0 评论 -
CF Round #536 (Div. 2)
ACM题集:https://blog.csdn.net/weixin_39778570/article/details/83187443题目链接:https://codeforces.com/contest/1106A模拟,输出十字型X的数量 #include<bits/stdc++.h>#define ll long long#define fo(i,j,n) for(...原创 2019-02-06 00:35:33 · 158 阅读 · 0 评论 -
CF Round #533 (Div. 2)
ACM题集:https://blog.csdn.net/weixin_39778570/article/details/83187443题目链接:https://codeforces.com/contest/1105A有n个数,找到一个t然后把这n个数变到与t的差的绝对值小于等于1改变一个数的代价为新数-原数的绝对值问最小的费用是多少因为数的范围在1到100,而且n比较小 所以枚举t...原创 2019-01-31 18:23:46 · 228 阅读 · 0 评论 -
CF Round #532 (Div. 2)
ACM题集:https://blog.csdn.net/weixin_39778570/article/details/83187443题目链接:https://codeforces.com/contest/1100A题意:有两种数,一种1,一种-1,现有一个这两种数组成的数列从数列里去掉一些数,问剩下1的个数和-1的个数的差的绝对值最大是多少解:当把1和-1相加就可以表示 1的个数减...原创 2019-01-14 20:59:12 · 451 阅读 · 3 评论 -
Educational Round 58 (Rated for Div. 2)
题目:https://codeforces.com/contest/1101A题(过)求是k的倍数且不在区间[l,r]里的最小数 #include<bits/stdc++.h>#define ll long long#define fo(i,j,n) for(register int i=j; i<=n; ++i)using namespace std;int q...原创 2019-01-12 16:52:48 · 238 阅读 · 0 评论 -
CF Round #531 (Div. 3)
ACM题集:https://codeforces.com/contest/1102题目链接:https://codeforces.com/blog/entry/64439A题(略)#include<bits/stdc++.h>#define ll long long #define fo(i,j,n) for(register int i=j; i<=n; ++i)u...原创 2019-01-11 13:47:40 · 1080 阅读 · 0 评论 -
CF Round #524 (Div. 2)
ACM题集:https://blog.csdn.net/weixin_39778570/article/details/83187443题目链接:https://codeforces.com/contest/1080A题题意:一个请帖需要2个红色,5个绿色,8个蓝色。一个notebook包含了k个相同的颜色。问最少需要多少个notebook能制作n和请帖#include<bits/s...原创 2018-11-26 17:38:27 · 390 阅读 · 0 评论 -
CF Round #523 (Div. 2)
ACM题集:https://blog.csdn.net/weixin_39778570/article/details/83187443题目链接:https://codeforces.com/contest/1061官方题解:https://codeforces.com/blog/entry/63384A题题意:1,2,3,4,…n每个数都有无限个,问数k最少能由1~n中几个数组成#in...原创 2018-11-26 17:13:40 · 1386 阅读 · 0 评论 -
CF Round #521 (Div. 3)
A Frog JumpingB Disturbed PeopleC Good ArrayD Cutting OutE Thematic ContestsF1 Pictures with Kittens原创 2018-11-18 15:41:23 · 317 阅读 · 0 评论 -
CF Round #522 (Div. 2)
1032A - Kitchen Utensils1032B - Personalized Cup1032C - Playing Piano1032D - Barcelonian Distance1032E - The Unbearable Lightness of Weights原创 2018-11-21 13:30:08 · 392 阅读 · 2 评论 -
CF-1300-Creating a Characters
ACM题集:https://blog.csdn.net/weixin_39778570/article/details/83187443题目链接https://codeforces.com/contest/1217/problem/A题意给定加点数,还有有原始的体力和智力,要就把加点数加完之后体力大于智力,一共有多少种加点方式#include<bits/stdc++.h>#d...原创 2019-09-13 20:17:53 · 227 阅读 · 0 评论