dp
抠脚老騷
这个作者很懒,什么都没留下…
展开
-
AtCoder Beginner Contest 247
AtCoder Beginner Contest 247B - Unique Nicknames#include <bits/stdc++.h>#pragma GCC optimize(2)using namespace std;#define int long longtypedef long long LL;typedef long long ll;const int INF = 0x3f3f3f3f;//const int inf = 1e18;const in原创 2022-04-25 21:00:35 · 204 阅读 · 0 评论 -
dp-[NOIP2000]方格取数
[NOIP2000]方格取数n^4#include <bits/stdc++.h>#pragma GCC optimize(2)using namespace std;#define int long longtypedef long long LL;typedef long long ll;const int INF = 0x3f3f3f3f;//const int inf = 1e18;const int mod = 998244353;//const int原创 2022-04-06 19:57:49 · 192 阅读 · 0 评论 -
dp-能量项链
能量项链#include <bits/stdc++.h>#pragma GCC optimize(2)using namespace std;#define int long longtypedef long long LL;typedef long long ll;const int INF = 0x3f3f3f3f;//const int inf = 1e18;const int mod = 998244353;//const int mod = 1e9 + 7;原创 2022-04-05 19:44:26 · 216 阅读 · 0 评论 -
dp太难了
专项学习 - dp给你一个长度为50的数字串,问你有多少个子序列构成的数字可以被3整除 答案对1e9+7取模#include <bits/stdc++.h>#define int long longusing namespace std;//const int mod = 998244353;const int mod = 1e9 + 7;const int maxn = 1e6 + 10;int dp[55][3];void solve() { string t原创 2021-09-17 17:32:02 · 210 阅读 · 0 评论 -
AtCoder Beginner Contest 217
AtCoder Beginner Contest 217C - Inverse of Permutation#include <bits/stdc++.h>#pragma GCC optimize(2)using namespace std;#define int long longtypedef long long LL;typedef long long ll;const int INF = 0x3f3f3f3f;//const int inf = 1e18;//con原创 2021-09-06 20:36:25 · 186 阅读 · 0 评论 -
Codeforces Round #708 (Div. 2)
Codeforces Round #708 (Div. 2)E1 - Square-free division (easy version)素数筛,分解质因数#include <bits/stdc++.h>#pragma GCC optimize(2)using namespace std;#define int long longtypedef long long LL;typedef long long ll;const int INF = 0x3f3f3f3f;con原创 2021-03-20 20:53:33 · 165 阅读 · 1 评论 -
Panasonic Programming Contest (AtCoder Beginner Contest 195)
Panasonic Programming Contest (AtCoder Beginner Contest 195)B - Many Oranges最小为mi=(w+b-1)/b最大直接让mi自增倒不符和为止,即w>mab||w<maa#include <bits/stdc++.h>//#pragma GCC optimize(2)using namespace std;#define int long longtypedef long long LL;typ原创 2021-03-15 10:33:17 · 376 阅读 · 1 评论 -
2021牛客寒假算法基础集训营6
2021牛客寒假算法基础集训营6A 回文括号序列计数我们定义一个字符串S是回文的,表示S的左右反转和S相同。我们定义一个字符串是括号序列:空串是括号序列。两个括号序列P和Q的拼接是括号序列。如果P是括号序列,’(’+P+’)'是括号序列。求长度为 n (0<=n<=10^9) 的回文括号序列的方案数,对 998244353 取膜。#include <bits/stdc++.h>//#pragma GCC optimize(2)#define int lo原创 2021-03-12 20:49:01 · 157 阅读 · 0 评论 -
dp学习
dp学习1.#include <bits/stdc++.h>#define int lltypedef long long ll;const int INF = 0x3f3f3f3f3f;const int mod = 1e9 + 7;const int maxn = 3e5 + 10;const int N=205;using namespace std;void solve(){ int dp[251]; int type[5]={1,5,10,25,5原创 2020-09-07 22:45:00 · 131 阅读 · 0 评论