随笔分类 -  数论

A - Bi-shoe and Phi-shoe 欧拉函数
摘要:/** 题目:A - Bi-shoe and Phi-shoe 链接:https://vjudge.net/contest/154246#problem/A 题意:每一个数都有一个得分,它的得分就是,假定这个数为n,那么=xi这个数。 求n个数xi对应找出来的yi的和。 思路: 第一种做法 递推求出欧拉函数数组,然后特殊处理1的值设定为0; 然后对要求的n个数排序,从小到大找一个满足条件的yi,... 阅读全文

posted @ 2017-03-16 12:30 hnust_accqx 阅读(321) 评论(0) 推荐(0)

hdu3208 Power of Integer
摘要:/** 题目:H - Power of Integer 链接:https://vjudge.net/contest/152887#problem/H 题意:给出区间[a, b],问你区间[a, b]所有数的幂的和是多少,定义一个 数的幂是这样的:对于一个数y,存在一个最小的数x,有一个最大的k,使得 阅读全文

posted @ 2017-03-15 20:50 hnust_accqx 阅读(122) 评论(0) 推荐(0)

C. Magic Five
摘要:C. Magic Five Problem Description There is a long plate s containing n digits. Iahub wants to delete some digits (possibly none, but he is not allowed 阅读全文

posted @ 2015-10-21 20:27 hnust_accqx 阅读(427) 评论(0) 推荐(0)

The Boss on Mars
摘要:The Boss on Mars Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2327 Accepted Submission(s): 718 阅读全文

posted @ 2015-10-21 18:53 hnust_accqx 阅读(551) 评论(0) 推荐(0)

C. Beautiful Numbers
摘要:C. Beautiful Numbers Problem Description Vitaly is a very weird man. He's got two favorite digits a and b. Vitaly calls a positive integer good, if th 阅读全文

posted @ 2015-09-28 20:22 hnust_accqx 阅读(857) 评论(0) 推荐(0)

导航