問題：B - Shift only #include <algorithm> #include <iostream> using namespace std; #define REP(i, n) for (int i = 0; i < (n); ++i) int main(void) { const int INF = 1e9; int n, a, ans = INF; cin.tie(0); ios::sync_with_stdio(false); cin >> n; REP(i, n) { int cnt</iostream></algorithm>…

問題：A - Placing Marbles #include <iostream> #include <string> using namespace std; #define REP(i, n) for (int i = 0; i < (n); ++i) int main(void) { string s; int ans = 0; cin.tie(0); ios::sync_with_stdio(false); cin >> s; REP(i, s.length()) { if (s[i] == </string></iostream>…