题目链接:点击传送 MG loves apple Time Limit: 3000/1500 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others) Problem Description MG is a rich boy. He has n apples, each has a value of V(0<=V<=9). A valid number does not contain a leading zero, and…

MG loves apple  Accepts: 20  Submissions: 693  Time Limit: 3000/1500 MS (Java/Others)  Memory Limit: 262144/262144 K (Java/Others) 问题描述 MGMG是一个财富爆表的男孩子.他拥有N(1<=N<=100000)N(1<=N<=100000)个苹果,每个苹果上标有一个数字00~99,代表它的价值. 一个合法的数字是不含有前导零的,这nn个苹果恰好排成了一个…

MG loves string Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 131    Accepted Submission(s): 50 Problem Description MG is a busy boy. And today he's burying himself in such a problem: For a…

MG loves string    Accepts: 30    Submissions: 67  Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others) 问题描述 MGMG是一个很忙碌的男孩子.今天他沉迷于这样一个问题: 对于一个长度为NN的由小写英文字母构成的随机字符串,当它进行一次变换,所有字符ii都会变成a[i]a[i]. MGMG规定所有a[i]a[i]构成了2626个…

NanoApe Loves Sequence 题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=5805 Description NanoApe, the Retired Dog, has returned back to prepare for the National Higher Education Entrance Examination! In math class, NanoApe picked up sequences once aga…

NanoApe Loves Sequence Ⅱ 题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=5806 Description NanoApe, the Retired Dog, has returned back to prepare for for the National Higher Education Entrance Examination! In math class, NanoApe picked up sequences on…

[题目链接]:http://acm.hdu.edu.cn/showproblem.php?pid=6020 [题意] 给你一个长度为n的数字,然后让你删掉k个数字,问你有没有删数方案使得剩下的N-K个数字是3的倍数; [题解] 这里我们枚举最后N-K个数字它的最高位是第几位; 这样我们就能在枚举最高位的时候直接判断这个数字是不是0;这样对合法性的处理就简单很多了; 我们枚举第i位是最高位,言外之意就是说前i-1个数字已经全部被删掉了; 则我们要在i+1..n这些数字里面再删掉k-i+1个数字才行…

题意:计算Bestcoder四题的得分. 思路:直接模拟,4项分数直接计算后输出.注意不要低于百分之40的分. //#include <bits/stdc++.h> #include <iostream> #include <cstdio> #define LL long long using namespace std; ; int a[N]; int b[N]; int cal() { ; ans=(/*(-a[])-b[]* >*/*(-a[])-b[]*:…

题链: http://acm.hdu.edu.cn/showproblem.php?pid=6021 题解: 题意:对于一个长度为 N的由小写英文字母构成的随机字符串,当它进行一次变换,所有字符 i 都会变成a[i].同时变换数组:a[i]是26个字母组成的排列.现在需要知道这个随机串变换到自身的期望变换次数.请你输出期望答案乘上26^N以后模 1000000007的结果. 容斥,LCM 其实题目要求的就是每种串(共有 26^N种串)回到自身的变化次数之和. 暴力求法就是:看每种串的每个字符在循…

题目链接 Problem Description Kblack loves flags, so he has infinite flags in his pocket. One day, Kblack is given an chessboard and he decides to plant flags on the chessboard where the position of each flag is described as a coordinate , which means tha…