题目链接:https://codeforces.com/contest/1543/problem/C 题意: 给定三张牌,每次抽取一张牌,给定这三张牌被抽到的概率,分别记为 \(c,m,p\),并给定一个波动因子 \(v\),设当前抽到的这张牌被抽到的概率为 \(a\),若\(a \le v ...
During the quarantine, Sicromoft has more free time to create the new functions in Celex . The developers made a new functionGAZ GIZ, which infinitely fills an infinite table to the right and down fr ...
2020-05-27 07:44 0 564 推荐指数:
题目链接:https://codeforces.com/contest/1543/problem/C 题意: 给定三张牌,每次抽取一张牌,给定这三张牌被抽到的概率,分别记为 \(c,m,p\),并给定一个波动因子 \(v\),设当前抽到的这张牌被抽到的概率为 \(a\),若\(a \le v ...
http://codeforces.com/problemset/problem/599/C 题目大意: 有n个城堡的高度 让你最多分成几个块 每个块排过序之后 整体是按照升序来的 分析: i之前的最大值只要小于等于i之后的最小值 ans++ ...
Great Graphs 题意 给你一个数组\(d\),\(d[i]\)表示从节点\(1\)到其他各个节点的最短路的长度,然后你可以对这个图进行加边(可以是负边),但不允许存在一个权值和为负数的回 ...
There is a river of width n">nn. The left bank of the river is cell 0">00 and the right bank is c ...
链接: https://codeforces.com/contest/1182/problem/C 题意: You are given n words, each of which consists of lowercase alphabet letters. Each word ...
题意: \(f(i)=x\),\(x\)为最小的不能整除\(i\)的数.求\(\sum^{n}_{i=1}f(i)\ mod\ 10^9+7\). 题解:首先,\(1,2,..., ...
目录 Description State Input Output Solution Code ...
Robert C. Martin( 罗伯特·C·马丁),作为世界级软件开发大师、设计模式和敏捷开发先驱、C++ Report杂志前主编,也是敏捷联盟(Agile Alliance)的第一任主席,我们尊称他为“ Bob 大叔(Uncle Bob)”。如今,年逾六十的 Bob 大叔过着典型 ...