Grady_Ne的博客

知识储备：strstr(str1,str2) 函数用于判断字符串str2是否是str1的子串。如果是，则该函数返回str2在str1中首次出现的地址；否则，返回NULL。输入字符型数据转化成整型数据：#include#include#includeusing namespace std;int main(){ char arr[100]; while(sc

KirinrikiWe define the distance of two strings A and B with same length n isdisA,B=∑i=0n−1|Ai−Bn−1−i|The difference between the two characters is defined as the difference in ASCII. You

Maximum SequenceTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1887    Accepted Submission(s): 671Problem DescriptionSteph is extre

Problem Description度度熊为了拯救可爱的公主，于是与邪恶大魔王战斗起来。邪恶大魔王的麾下有n个怪兽，每个怪兽有a[i]的生命值，以及b[i]的防御力。度度熊一共拥有m种攻击方式，第i种攻击方式，需要消耗k[i]的晶石，造成p[i]点伤害。当然，如果度度熊使用第i个技能打在第j个怪兽上面的话，会使得第j个怪兽的生命值减少p[i]-b[j]，当然如果伤害小于防御，

Regular polygon     On a two-dimensional plane, give you n integer points. Your task is to figure out how many different regular polygon these points can make.InputThe input file consist

In mathematics, the function d(n) denotes the number of divisors of positive integer n.For example, d(12)=6 because 1,2,3,4,6,12 are all 12's divisors. In this problem, giv

As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka somemath tasks to practice. There is one of them:Yuta has nn positive A1−An and their sum is m. Then

Kanade's sumGive you an array A[1..n]of length n.Let f(l,r,k) be the k-th largest element of A[l..r].Specially , f(l,r,k)=0 if r−l+1k.Give you k , you need

Balala Power!Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 4809    Accepted Submission(s): 387Problem DescriptionTalented Mr

先补比较简单的1001 和1011，最后再来看10021001                         Add More ZeroTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 2245    Accep

TrickGCDProblem DescriptionYou are given an array A , and Zhu wants to know there are how many different array B satisfy the following conditions?* 1≤Bi≤Ai* For each pair( l , r )

只有质数2,3,5,7这几个作为因子的数叫做,丑数,比如前20个丑数是(从小到大来说) 1,2,3,4,6,7,8,9,10,12,14,15,16,18,20,21,24,25和27输入：输入一个正整数n，当 n 输入为0  时结束输出：输出第 n 个丑数，每个数一行Sample Input123411Sample Output12