T1:Attack
答案为 \(\lceil\frac{A}{B}\rceil\)
代码实现
a, b = map(int, input().split())
print((a+b-1)//b)
T2:Find snuke
爆搜
代码实现
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int di[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dj[] = {-1, 0, 1, -1, 1, -1, 0, 1};
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) cin >> s[i];
string T = "snuke";
rep(si, h)rep(sj, w) {
rep(v, 8) {
int i = si, j = sj;
rep(k, 5) {
if (i < 0 or j < 0 or i >= h or j >= w) break;
if (s[i][j] != T[k]) break;
if (k == 4) {
i = si; j = sj;
rep(nk, 5) {
cout << i+1 << ' ' << j+1 << '\n';
i += di[v]; j += dj[v];
}
return 0;
}
i += di[v]; j += dj[v];
}
}
}
return 0;
}