码迷,mamicode.com
首页 >  
搜索关键字:lightoj    ( 714个结果
LightOJ - 1282 - Leading and Trailing(数学技巧,快速幂取余)
链接: https://vjudge.net/problem/LightOJ 1282 题意: You are given two integers: n and k, your task is to find the most significant three digits, and least ...
分类:其他好文   时间:2019-11-13 09:19:03    阅读次数:95
LightOJ 1418 Trees on My Island (Pick定理)
题目链接: "LightOJ 1418" Problem Description I have bought an island where I want to plant trees in rows and columns. So, the trees will form a rectangula ...
分类:其他好文   时间:2019-11-13 01:12:27    阅读次数:117
LightOJ - 1370 - Bi-shoe and Phi-shoe(欧拉函数)
链接: https://vjudge.net/problem/LightOJ 1370 题意: Bamboo Pole vault is a massively popular sport in Xzhiland. And Master Phi shoe is a very popular coac ...
分类:其他好文   时间:2019-11-13 01:05:17    阅读次数:103
LightOJ - 1148-Mad Counting (数学)
链接: https://vjudge.net/problem/LightOJ 1148 题意: Mob was hijacked by the mayor of the Town "TruthTown". Mayor wants Mob to count the total population o ...
分类:其他好文   时间:2019-11-12 13:28:08    阅读次数:70
Easy Game LightOJ - 1031(记忆化搜索+博弈)
You are playing a two player game. Initially there are n integer numbers in an array and player A and B get chance to take them alternatively. Each pl ...
分类:其他好文   时间:2019-10-27 17:09:51    阅读次数:88
LightOJ 1027 A Dangerous Maze (期望)
题目链接: "LightOJ 1027" Description You are in a maze; seeing $n$ doors in front of you in beginning. You can choose any door you like. The probability f ...
分类:其他好文   时间:2019-10-13 20:58:26    阅读次数:116
LightOJ 1030 Discovering Gold (概率/期望DP)
题目链接: "LightOJ 1030" Description You are in a cave, a long cave! The cave can be represented by a $1 \times N$ grid. Each cell of the cave can contain ...
分类:其他好文   时间:2019-10-13 20:48:29    阅读次数:113
LightOJ 1251 Stream My Contest(最小树形图)
最小树形图 个人理解就是求指定起点的有向图的最小生成树。 算法的大概步骤如下: 1. 遍历所有边,求得一步到达点v的距离in[v]和前驱pre[v].(若除根节点外有的点不可以被到达则无解) 2. 遍历所有点v,ans+in[v] (相当于从离v最近的点走到了v),看其是否在环上(一直跑pre,能跑 ...
分类:其他好文   时间:2019-10-06 16:43:33    阅读次数:92
概率dp lightoj 1342
题意:有N根木棍,每根木棍都有一个权值 其中有若干根可识别,若干根不可识别的,抽到了可识别的棍子,就不放回,抽到了不可识别的,就要放回 ,问所有棍子都至少被抽过一次后权值和的期望 不可识别的棍子,就相当于投掷一个质地均匀的骰子,问每一个面至少出现一次的期望投掷次数; 而这道题用到的是每一个权值出现的 ...
分类:其他好文   时间:2019-09-30 23:55:12    阅读次数:183
lightoj 1408 概率dp
https://blog.csdn.net/moon_sky1999/article/details/98097470 博主在此,牛逼神犇 题意:一个人在击球,有p的概率集中,有(1-p)的概率击不中。如果能够连续击中x次将停止,连续不集中y次也将停止。问最终停止击球时击球次数的期望。思路:设f[i ...
分类:其他好文   时间:2019-09-30 21:59:14    阅读次数:90
714条   上一页 1 2 3 4 5 6 ... 72 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!