ACM
文章平均质量分 73
向着曙光前进
。。。。
展开
-
ACMA - MG loves gold
MG is a lucky boy. He is always be able to find gold from underground. It is known that the gold is a sequence with nn elements, which has its own color CC.MG can dig out a continuous原创 2017-04-22 16:07:01 · 259 阅读 · 0 评论 -
A - Fxx and string (ACM)
Young theoretical computer scientist Fxx get a string which contains lowercase letters only.The string SS contains nn lowercase letters S1S2…SnS1S2…Sn.Now Fxx wants to know how many three原创 2017-05-20 11:05:26 · 283 阅读 · 0 评论 -
B - Fxx and game )(ACM)
Young theoretical computer scientist Fxx designed a game for his students. In each game, you will get three integers X,k,tX,k,t.In each step, you can only do one of the following moves: 1.转载 2017-05-20 11:08:59 · 321 阅读 · 0 评论 -
牛客练习赛10第二题
#include#include#include#include#include#define LL long long#define N 1000009using namespace std;int a[N], n;int b[N], r;int maxn[N];int main(){ scanf("%d", &n); for (int i = 1; i <= n;转载 2018-01-19 18:50:46 · 468 阅读 · 0 评论 -
NBA Finals
Consider two teams, Lakers and Celtics, playing a series ofNBA Finals until one of the teams wins n games. Assume that the probabilityof Lakers winning a game is the same for each game and equal to p ...原创 2018-04-12 14:59:12 · 420 阅读 · 0 评论 -
扩展欧几里得算法
扩展欧几里得算法是啥,那就要先知道什么是欧几里得算法欧几里得算法扩展欧几里得算法是欧几里得算法的推广,利用欧几里得算法的思想和递归求得贝祖等式a*x+b*y=gcd(a,b)不定方程中的一组x和y的解。原理如下:设a>b当b=0时,很显然a*x=gcd(a,b)=a,所以x=1,而y为任意数,为了同一和方便我们令y=0;当a>b>0时,设有两组等式a*x1+b*y1...转载 2018-04-23 20:54:19 · 221 阅读 · 0 评论 -
Romantic
Problem Description The Sky is Sprite.The Birds is Fly in the Sky.The Wind is Wonderful.Blew Throw the TreesTrees are Shaking, Leaves are Falling.Lovers Walk passing, and so are You. ....................原创 2018-04-26 15:48:11 · 422 阅读 · 0 评论 -
数位DP——2018数,吉比特笔试题
题目:给定一个n求1到n之间的2018数,2018数数字中含有 2018即为2018数例如,210198,32108;10218不是2018数,数据范围1e9;解法:数位dp,数位dp理解,记忆话加递归,将每一位的数字状态保存下来,以后用到时直接调用结果代码中写了我对此题的理解 ,可能对大家有点帮助,数位dp入门参看:https://blog.csdn.net/qq_37632935/...原创 2019-04-23 22:43:58 · 399 阅读 · 0 评论 -
剑指offer 求出1 ~ 13的整数中1出现的次数 求和
求出1 ~ 13的整数中1出现的次数,并算出100 ~ 1300的整数中1出现的次数?为此他特别数了一下1~13中包含1的数字有1、10、11、12、13因此共出现6次,但是对于后面问题他就没辙了。ACMer希望你们帮帮他,并把问题更加普遍化,可以很快的求出任意非负整数区间中1出现的次数(从1 到 n 中1出现的次数)。数位dp,剑指offer解题思路:对于数据过大的题目而言有两种考虑* 推...原创 2019-07-12 17:18:35 · 349 阅读 · 0 评论