随笔分类 -  数论

CF2B The least round way
摘要:题目 样例 3 1 2 3 4 5 6 7 8 9 0 DDRR 题解 CODE #include<bits/stdc++.h> using namespace std; const int N = 1010; int dp[N][N][2]; int main(){ int n; scanf("% 阅读全文

posted @ 2020-10-31 23:42 LT-Y 阅读(80) 评论(0) 推荐(0)

阶乘之和 / 洛谷P1009
摘要:题目 https://www.luogu.com.cn/problem/P1009 CODE //高精度 #include<bits/stdc++.h> using namespace std; int n, a[100010], b[100010], c[100010], len, lenc = 阅读全文

posted @ 2020-07-25 21:54 LT-Y 阅读(131) 评论(0) 推荐(0)

nth Permutation / LightOJ - 1060
摘要:Given a string of characters, we can permute the individual characters to make new strings. At first we order the string into alphabetical order. Then 阅读全文

posted @ 2020-03-12 22:46 LT-Y 阅读(110) 评论(0) 推荐(0)