http://codeforces.com/problemset/problem/807/A A. Is it rated? time limit per test              2 seconds memory limit per test        256 megabytes input       standard input output standard output Is it rated? Here it is. The Ultimate Question of C…

Codeforces Round #423 (Div. 1, rated, based on VK Cup Finals) A.String Reconstruction B. High Load C. DNA Evolution 题意:给定一个只包含A,T,C,G的字符串S,有如下两种操作 1)修改一个点的字母. 2)给定一个字符串e ($\left | e \right |\leq 10$),生成一个由e重复组成的新串,eee...,问$S_{l..r}$中有几个字母跟这个新的字符串一一对应…

[题目链接]:http://codeforces.com/contest/807/problem/A [题意] 给你n个人在一场CF前后的rating值; 问你这场比赛是不是计分的 [题解] 如果有一个人的rating变了; 则是计分的; 否则: 按照题目所给的规则判断是maybe还是unrated; O(N^2) [Number Of WA] 0 [完整代码] #include <bits/stdc++.h> using namespace std; #define lson l,m,rt&…

http://codeforces.com/contest/831 A. Unimodal Array time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Array of integers is unimodal, if: it is strictly increasing in the beginning; after that…

Polycarp watched TV-show where k jury members one by one rated a participant by adding him a certain number of points (may be negative, i. e. points were subtracted). Initially the participant had some score, and each the marks were one by one added…

http://codeforces.com/problemset/problem/807/C C. Success Rate time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output You are an experienced Codeforces user. Today you found out that during your…

B. T-Shirt Hunt http://codeforces.com/problemset/problem/807/B time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Not so long ago the Codecraft-17 contest was held on Codeforces. The top 25 p…

题目链接:http://codeforces.com/contest/807/problem/E 题意:已知每个数都能用x=1 + 2 + 4 + ... + 2k - 1 + r (k ≥ 0, 0 < r ≤ 2k)来表示, 给出一串数字问这串数字能有几个x表示.输出可能的长度. 题解:这题比较巧妙具体还是看代码理解一下,不好解释. #include <iostream> #include <cstring> #include <vector> #includ…

题目链接:http://codeforces.com/contest/807/problem/D 题意:对于动态计分的 Codeforces Round ,已知每题的 score 是根据 Round 参加人数和该题过题人数计算,两者之比结合上图得出该题的分数.某人在该题的得分为 score*(1−t/250) 其中 t 表示通过该题的时间. 已知参加该场比赛的所有参加者的过题情况(包括 Vasya 和 Petya),问如何通过增加新的参赛者(尽量少),使得 Vasya 的最终得分高于 Petya…

题目链接:http://codeforces.com/contest/807/problem/C 题意:记 AC 率为当前 AC 提交的数量 x / 总提交量 y .已知最喜欢的 AC 率为 p/q (pq∈[0,1]) . 求最少在提交多少题(AC or NOT)能恰好达到 AC 率为 p/q 题解:当然可以用数学的方法来求解,我的解法并不是用什么数学方法,直接二分暴力就行. 由于(x+s)/(y+s+us)=(p/q)(s表示ac的,us表示没ac的)所以不妨设 x+s=k*p,y+s+us…