1
#include <cstdlib>
2
#include <cstdio>
3
#include <iostream>
4
#include <algorithm>
5
#include <cstring>
6
#include <map>
7
using namespace std;
8

9
typedef long long ll;
10
int T;
11
ll n, k;
12

13
int main() {
14
  cin >> T;
15
  while(T--) {
16
    cin >> n >> k;
17
    ll tmp = n / k;
18
    if(tmp) {
19
      ll t = k;
20
      k *= tmp;
21
      if(n % k) k += t;
22
    }
23
    tmp = k / n;
24
    if(k % n) cout << tmp + 1 << endl;
25
    else cout << tmp << endl;
26
  }
27
  return 0;
28
}

1
#include <cstdlib>
2
#include <cstdio>
3
#include <iostream>
4
#include <algorithm>
5
#include <cstring>
6
#include <map>
7
using namespace std;
8

9
typedef long long ll;
10
const int maxn = 117;
11
int T;
12
int n, k;
13
ll p[maxn], m[maxn], s[maxn], ans;
14

15
int main() {
16
  cin >> T;
17
  while(T--) {
18
    cin >> n >> k;
19
    ans = 0;
20
    for(int i = 1; i <= n; i++) cin >> p[i];
21
    for(int i = 1; i <= n; i++) s[i] = s[i - 1] + p[i];
22
    for(int i = 1; i <= n; i++) m[i] = (p[i + 1] * 100 / k + ((p[i + 1] * 100) % k ? 1 : 0)) - s[i];
23
    for(int i = 1; i < n; i++) if(m[i] < 0) m[i] = 0;
24
    for(int i = 1; i < n; i++) ans = max(ans, m[i]);
25
    cout << ans << endl;
26
  }
27
  return 0;
28
}

1
#include <cstdlib>
2
#include <cstdio>
3
#include <iostream>
4
#include <algorithm>
5
#include <cstring>
6
#include <map>
7
using namespace std;
8

9
typedef long long ll;
10
const int maxn = 1e5 + 17;
11
int T;
12
int n;
13
ll a[maxn], b[maxn], c[maxn], ans;
14

15
int main() {
16
  cin >> T;
17
  while(T--) {
18
    cin >> n;
19
    ans = 0;
20
    for(int i = 1; i <= n; i++) cin >> c[i];
21
    for(int i = 1; i <= n; i++) cin >> a[i];
22
    for(int i = 1; i <= n; i++) cin >> b[i];
23
    for(int i = 1; i <= n; i++) if(a[i] > b[i]) swap(a[i], b[i]);
24
    ll l = 0;
25
    for(int i = 1; i < n; i++, l+= 2) {
26
      if(b[i + 1] == a[i + 1]) {
27
        l += c[i] - 1;
28
        if(i != 1) ans = max(l, ans);
29
        l = 0;
30
        continue;
31
      }
32
      if(i > 1) ans = max(ans, l + c[i] - 1);
33
      l += c[i] - 1 - (b[i + 1] - a[i + 1]);
34
      if(b[i + 1] - a[i + 1] > l || i == 1) l = b[i + 1] - a[i + 1];
35
    }
36
    // cout << l << endl;
37
    l += c[n] - 1;
38
    ans = max(l, ans);
39
    cout << ans << endl;
40

41
  }
42
  return 0;
43
}

1
#include <cstdlib>
2
#include <cstdio>
3
#include <iostream>
4
#include <algorithm>
5
#include <cstring>
6
#include <map>
7
using namespace std;
8

9
typedef long long ll;
10
const int maxn = 1e6 + 17;
11
int T;
12
int n;
13
int fa[maxn], sz[maxn], p[maxn];
14

15
int getf(int x) {
16
  if(fa[x] == x) return x;
17
  return fa[x] = getf(fa[x]);
18
}
19

20
void merge(int x, int y) {
21
  int fx = getf(x), fy = getf(y);
22
  if(fx == fy) return;
23
  fa[fy] = fx, sz[fx] += sz[fy], sz[fy] = 0;
24
}
25

26
int main() {
27
  cin >> T;
28
  while(T--) {
29
    cin >> n;
30
    n++;
31
    string str;
32
    cin >> str;
33
    p[0] = -1, p[n] = -1;
34
    for(int i = 1; i < n; i++) p[i] = str[i - 1] =='L' ? 0 : 1;
35
    for(int i = 1; i <= n; i++) fa[i] = i, sz[i] = 1, fa[i + n] = i + n, sz[i + n] = 1;
36
    for(int i = 1; i <= n; i++) {
37
      if(p[i - 1] == 0) merge(i - 1 + n, i);
38
      if(p[i] == 1) merge(i + 1 + n, i);
39
    }
40
    for(int i = 1; i <= n; i++) {
41
      cout << sz[getf(i)] << " \n"[i == n];
42
    }
43
  }
44
  return 0;
45
}