数学
Kelin__
One loves the sunset, when one is so sad...
展开
-
[HDU6833]A Very Easy Math Problem
题意求∑a1=1n∑a2=1n⋯∑ax=1n(∏j=1xajk)f(gcd(a1,a2,...,ax))⋅gcd(a1,a2,...,ax)mod 109+7\sum_{a_1=1}^n\sum_{a_2=1}^n\cdots\sum_{a_x=1}^n\Big(\prod_{j=1}^xa_j^k\Big)f(\gcd(a_1,a_2,...,a_x))\cdot\gcd(a_1,a_2,...,a_x)\mod 10^9+7a1=1∑na2=1∑n⋯ax=1∑n(j=1∏xa原创 2020-08-07 00:05:31 · 948 阅读 · 0 评论 -
[NowCoder5673E]Enigmatic Partition
题意定义整数nnn的拆分n=a1+a2+...+amn=a_1+a_2+...+a_mn=a1+a2+...+am为"enigmatic partition"为符合以下条件的拆分:ai∈Za_i\in Zai∈Z且1≤ai≤n1\le a_i\le n1≤ai≤n。ai≤ai+1≤ai+1a_i\le a_{i+1}\le a_i+1ai≤ai+1≤ai+1am=a1+2a_m=a_1+2am=a1+2设f(n)f(n)f(n)表示nnn有多少种不同的"enigmati原创 2020-08-05 20:44:08 · 1878 阅读 · 0 评论 -
[HDU6755]Fibonacci Sum
题意定义Fibonacci 数列:F0=0,F1=1Fn=Fn−1+Fn−2 (n>1)F_0=0,F_1=1\\F_n=F_{n-1}+F_{n-2}\ (n>1)F0=0,F1=1Fn=Fn−1+Fn−2 (n>1)给定整数N,c,kN,c,kN,c,k,求∑n=0NFnckmod 109+9\sum_{n=0}^NF_{nc}^k\mod{10^9+9}n=0∑NFnckmod109+9N,c≤1018,k≤105N,c\le1原创 2020-07-21 23:40:40 · 1502 阅读 · 2 评论