![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
hdu
浩1001
这个作者很懒,什么都没留下…
展开
-
2018 Multi-University Training Contest 3 Problem D. Euler Function
原题:http://acm.hdu.edu.cn/contests/contest_showproblem.php?pid=1004&cid=804 Problem DescriptionIn number theory, Euler's totient function φ(n) counts the positive integers up to a given intege...原创 2018-07-30 21:01:35 · 122 阅读 · 0 评论 -
2018 Multi-University Training Contest 3 Problem L. Visual Cube
原题:http://acm.hdu.edu.cn/showproblem.php?pid=6330Problem DescriptionLittle Q likes solving math problems very much. Unluckily, however, he does not have good spatial ability. Everytime he meets a ...原创 2018-07-30 21:09:19 · 234 阅读 · 0 评论 -
2018 Multi-University Training Contest 3 Problem F. Grab The Tree
原题:http://acm.hdu.edu.cn/showproblem.php?pid=6324 Problem DescriptionLittle Q and Little T are playing a game on a tree. There are n vertices on the tree, labeled by 1,2,...,n, connected by n−1 ...原创 2018-07-30 21:19:32 · 216 阅读 · 0 评论 -
HDU6335 Problem D. Nothing is Impossible
原题:http://acm.hdu.edu.cn/showproblem.php?pid=6335Problem Descriptionm students, including Kazari, will take an exam tomorrow.The paper consists of exactly n problems, the i-th problem contains ai...原创 2018-08-01 21:44:51 · 415 阅读 · 0 评论 -
HDU6336 Problem E. Matrix from Arrays
Problem DescriptionKazari has an array A length of L, she plans to generate an infinite matrix M using A.The procedure is given below in C/C++:int cursor = 0;for (int i = 0; ; ++i) { for (i...原创 2018-08-01 21:51:19 · 384 阅读 · 0 评论 -
HDU6342 Problem K. Expression in Memories
原题:http://acm.hdu.edu.cn/showproblem.php?pid=6342Problem K. Expression in MemoriesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 422 ...原创 2018-08-01 22:00:07 · 177 阅读 · 0 评论 -
HDU6343 Problem L. Graph Theory Homework
原题:http://acm.hdu.edu.cn/showproblem.php?pid=6343 分析:签到题,直接拿第一个数和最后一个数进行运算即可,记得向下取整。#include<bits/stdc++.h>using namespace std;const int maxn = 100000+100;int a[maxn];int t, n, m;...原创 2018-08-01 22:03:21 · 142 阅读 · 0 评论 -
HDU6386-Age of Moyu
Age of MoyuTime Limit: 5000/2500 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 970 Accepted Submission(s): 264 Problem DescriptionMr.Quin love fishes s...原创 2018-08-13 20:48:17 · 307 阅读 · 0 评论 -
HDU-6395-Sequence (矩阵快速密, 加整数分块)
原题:http://acm.hdu.edu.cn/showproblem.php?pid=6395分析:题意是给一个了数列递推式,问第n项取模的值。这道题的范围很大所以没法使用直接跑循环地推的方法求第n项,很容易就能分析出应该转化成矩阵的方法,然后使用矩阵快速密来求解第n项的值。题目给的递推式是一个非线性的关系,所以一开始就想转化成线性关系然后再将转移矩阵求出来,但是这道题没法转化成线性关...原创 2018-08-14 01:50:54 · 495 阅读 · 0 评论