目录

String（800）

Skibidus and Amog'u（800）

Apples in Boxes（1100）

---

 

String（800）

https://codeforces.com/problemset/problem/2062/A

#include <iostream>
#include <string>
using namespace std;
int main()
{int t;cin >> t;while (t--){int res = 0;string s;cin >> s;for (int i = 0; i < s.size(); i++){if (s[i] == '1'){res++;}}cout << res << endl;}return 0;
}

Skibidus and Amog'u（800）

https://codeforces.com/problemset/problem/2065/A

#include <iostream>
#include <string>
using namespace std;
int main()
{int t;cin >> t;while (t--){string s;cin >> s;for (int i = 0; i < s.size() - 2; i++){cout << s[i];}cout << "i" << endl;}return 0;
}

Apples in Boxes（1100）

https://codeforces.com/problemset/problem/2107/B

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define int long long
void solve()
{int n, k;cin >> n >> k;vector<int> a(n);for (int i = 0; i < n; i++){cin >> a[i];}sort(a.begin(), a.end());a[n - 1]--;sort(a.begin(), a.end());if (a[n - 1] - a[0] > k){cout << "Jerry\n";return;}int sum = 0;for (int i = 0; i < n; i++){sum += a[i];}if (sum % 2 == 0){cout << "Tom\n";}else{cout << "Jerry\n";}
}
signed main()
{int t;cin >> t;while (t--){solve();}return 0;
}