C. Cheap Kangaroo time limit per test1 second memory limit per test256 megabytes There are N kangaroos going out to eat at an Indian restaurant. The ith kangaroo wants to eat exactly xi food. The kangaroos all want to order the same size of plates, but each one can order more than one...
Educational Codeforces Round 81 (Rated for Div. 2) Finished → Virtual participation Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests. If you've seen these problems, a virtual contest ...
Problem - 433C - Codeforces解题报告 对于这题本人刚开始的时候的想法是:先把最大两数差的位置找到然后merge计算一个值再与一连串相同的数做merge后计算一个值比较取最大值输出;可提交后发现不对,于是本人就搜了一下正解发现原来这题的正确解题思路是:采用数学中的中位数原理,分别把某数两边相邻且不同的数存...
Problem Link A. Almost Prime time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output A. Almost P
Codeforces 1019C Sergey's problem 构造,原文链接https://www.cnblogs.com/zhouzhendong/p/CF1019C.html题目传送门-CF1019C题意给定一个有$n$个节点、$m$条边的有向图,没有自环,但是可能存在环。现在要求选出一个点集满足一下条件。设原来的所有点构成的点集为$V
题目链接:Problem - E - Codeforces 题意: t组数据,给定n个点、点u有颜色au的有根树,点1为该树的根,定义f(u,v)为u→v的路径上的颜色数目,u不是v祖先时无定义。对于所有点对(u,v),其中u不一定相异于v,设l为u,v的最近公共祖先,求maxf(l,u)⋅f(l...
Codeforces Beta Round #2 C. Commentator problem 模拟退火果然是一个非常高端的东西,思路神马的全然搞不懂啊~ 题目大意: 给出三个圆,求一点到这三个圆的两切线的夹角相等。 解题思路: 对于这个题来说还是有多种思路的 。只是都搞不明确~~ /害羞脸...
codeforces problem solutions. Contribute to codejoydo/codeforces development by creating an account on GitHub.
Codeforces gym/102956/problem/F 2020-2021 Winter Petrozavodsk Camp, Belarusian SU Contest (XXI Open Cup, Grand Prix of Belarus) F. Border Similarity Undertaking 本来自己总结完不太想写的,但是想这道题过程一开始只想到了bitset的做法或者分治但是不太会合并那个玩意,还是记录一下。感谢lzz...
你的算法需要优化。其实不需要去找出每对匹配的i j，只要找出数量就可以了。我给段简单的代码，你看看应该就明白了。include <stdio.h> double table[256];char str[100001];void main(){ char *p = str;int i;double n=0;gets(str);while(*p)table[*(p++)]+=1;for (int i = 1; i...