lz

摘要： 题目描述 Now an emergent task for you is to open a password lock. The password is consisted of four digits. Each digit is numbered from 1 to 9.Each time, 阅读全文

摘要： 题目描述 A mining base needs to build some robots to collect at least 10000 units of resource. Each robot will start from the base, reach the diggings in 阅读全文

摘要： 题目描述 You are given a string S of length 2N consisting of lowercase English letters.There are 22N ways to color each character in S red or blue. Among 阅读全文

摘要： B.指引 排序+贪心+set #include <iostream> #include<cstdio> #include<set> #include<algorithm> using namespace std; struct Node{int x,y;}a[100005],b[100005]; b 阅读全文

摘要： A.Missing Runners #include <iostream> #include<cstdio> using namespace std; int vis[60005]; int main() { int n;scanf("%d",&n); for(int i=1;i<=n-1;i++) 阅读全文

摘要： A.骰子 规律 #include <iostream> #include<cstdio> typedef long long ll; using namespace std; ll dp[5][100005],sum[5][100005]; ll n,m; void init(){ dp[1][1] 阅读全文

摘要： D.菱菱的旅途 排序 #include <iostream> #include<cstdio> #include<algorithm> typedef long long ll; using namespace std; struct Node{ ll v,id; }node[1000005]; b 阅读全文

摘要： A.Exchange 模拟 #include <iostream> #include<cstdio> typedef long long ll; using namespace std; int main() { ll a,b,k;scanf("%lld%lld%lld",&a,&b,&k); ll 阅读全文

摘要： B.矩阵快速幂 等比数列二分求和 #include <iostream> #include<cstdio> #include<cstring> using namespace std; int n,k,mod; const int MAXN=35; struct Mat{ int n,m; int 阅读全文

摘要： A.Little Sub and Pascal's Triangle 求杨辉三角形第n行(n=0,1,...)的奇数个数 规律： #include <iostream> #include<cstdio> #include<cstring> #include<cmath> #include<algor 阅读全文