- 博客(3)
- 收藏
- 关注
原创 CF Dinner with Emma 616B
#include #include const int MAX = 105; int arr[MAX][MAX]; int main() { int n, m, res = 0; std::cin >> n >> m; for (int i = 0; i != n; ++i) { int max = 0x3f3f3f3f; for (int j = 0; j != m; +
2016-01-15 12:48:10 614
原创 CF Comparing Two Long Integers 616A
字符串问题,逐个比较,分情况讨论。#include #include #define prin(x) std::cout << x << std::endl int main() { std::ios::sync_with_stdio(false); std::string a, b, longer, shorter; std::cin >> a >> b; bool falg =
2016-01-15 10:46:38 588
原创 lightOJ 1004 - Monkey Banana Problem
基础的DP问题#include #include #include const int MAX = 205; int arr[MAX][MAX]; int dp[MAX][MAX]; int main() { int T, cas = 0; std::cin >> T; while (T--) { memset(arr, 0, sizeof(arr)); memset(d
2016-01-12 10:36:18 483
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人