摘要：D. Presents in Bankopolis time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output D. Presents in 阅读全文

摘要：C. Mice problem time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output C. Mice problem time lim 阅读全文

摘要：B. Igor and his way to work time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output B. Igor and 阅读全文

摘要：D. Volatile Kite time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output D. Volatile Kite time l 阅读全文

摘要：C. Voltage Keepsake time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output C. Voltage Keepsake 阅读全文

摘要：B. Valued Keys time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output You found a mysterious fu 阅读全文

摘要：A. Vicious Keyboard time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output A. Vicious Keyboard 阅读全文

摘要：E. Exam Cheating time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output E. Exam Cheating time l 阅读全文

摘要：A. Buying A House 分别向左右枚举，找到符合题意的点，输出最短的长度*10。 #include <bits/stdc++.h> using namespace std; int n, k, s, a[105]; int main() { scanf("%d%d%d", &n, &s, 阅读全文

摘要：A 模拟+dfs暴搜 #include <iostream> #include <cstdio> #include <algorithm> using namespace std; const int MAXN = 4; int vis[MAXN][MAXN][MAXN]; int xi[] = { 阅读全文

摘要：A。Astonishing Combinatorial Number 题目大意：给你n, m, k,问你C（i， j）%k= 0的个数{1 <= i <=n, 1 <=j <= m } 题解：我们可以先预处理组合数，由组合数公式变形 A[i][j] = （A[i-1][j-1] + A[i-1][j 阅读全文