qq_39921637的博客

#pragma GCC optimize(2) #include<bits/stdc++.h> using namespace std; typedef long long ll; int Case = 1; ll n, dp[25][15][3]; int pos[15]; ll dfs(int p, int mod, int status, bool up) { if(!p...

#pragma GCC optimize(2) #include<bits/stdc++.h> using namespace std; #define lowbit(x) ((x)&(-x)) typedef long long ll; const int maxn = 1e5+5; const int mod = 1e9+9; int Case = 1; ll dp[20]...

#pragma GCC optimize(2) #include<bits/stdc++.h> using namespace std; typedef long long ll; int Case = 1, t[100]; ll n, m, f[20][20][2005]; ll dfs(int pos,int o,int val,int lim) { if (pos==0)...

数据那么大肯定是数位DP呀。 DP状态很好分析出来，注意数位DP上判一下前导零的情况就行。 #include<bits/stdc++.h> using namespace std; const int maxn = 2005; typedef long long ll; char ss[maxn]; int bit[maxn]; ll dp[205][maxn]; const ll m...