Add solutions

1714A. Everyone Loves to Sleep.cpp

@@ -0,0 +1,47 @@
+#include <algorithm>
+#include <cmath>
+#include <cstring>
+#include <iostream>
+#include <map>
+#include <set>
+#include <string>
+#include <vector>
+using namespace std;
+
+using ll = long long;
+using str = string;
+
+using pii = pair<int, int>;
+using pll = pair<ll, ll>;
+#define mp make_pair
+#define f first
+#define s second
+
+using vi = vector<int>;
+using vl = vector<ll>;
+using vs = vector<str>;
+using vc = vector<char>;
+
+#define sz(x) int((x).size())
+#define all(x) x.begin(), x.end()
+#define rall(x) x.rbegin(), x.rend()
+#define pb push_back
+#define eb emplace_back
+
+const int mod = 998244353; // 1e9+7;
+
+void solve() {
+
+}
+
+int main () {
+    ios_base::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int tc = 1;
+    cin >> tc;
+
+    while (tc--) solve();
+
+    return 0;
+}

1720A - Burenka Plays with Fractions.cpp

@@ -0,0 +1,57 @@
+#include <algorithm>
+#include <cmath>
+#include <cstring>
+#include <iostream>
+#include <map>
+#include <set>
+#include <string>
+#include <vector>
+using namespace std;
+
+using ll = long long;
+using str = string;
+
+using pii = pair<int, int>;
+using pll = pair<ll, ll>;
+#define mp make_pair
+#define f first
+#define s second
+
+using vi = vector<int>;
+using vl = vector<ll>;
+using vs = vector<str>;
+using vc = vector<char>;
+
+#define sz(x) int((x).size())
+#define all(x) x.begin(), x.end()
+#define rall(x) x.rbegin(), x.rend()
+#define pb push_back
+#define eb emplace_back
+
+const int mod = 998244353; // 1e9+7;
+
+void solve() {
+    ll a, b, c, d;
+	cin >> a >> b >> c >> d;
+
+	ll x = a * d, y = b * c;
+
+	if (x == y) cout << "0\n";
+
+	else if (y != 0 and x % y == 0 or x != 0 and y % x == 0)
+		cout << "1\n";
+
+	else cout << "2\n";
+}
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int tc = 1;
+    cin >> tc;
+
+    while (tc--) solve();
+
+    return 0;
+}

1726A - Mainak and Array.cpp

@@ -0,0 +1,64 @@
+#include <algorithm>
+#include <cmath>
+#include <cstring>
+#include <iostream>
+#include <map>
+#include <set>
+#include <string>
+#include <vector>
+using namespace std;
+
+using ll = long long;
+using str = string;
+
+using pii = pair<int, int>;
+using pll = pair<ll, ll>;
+#define mp make_pair
+#define f first
+#define s second
+
+using vi = vector<int>;
+using vl = vector<ll>;
+using vs = vector<str>;
+using vc = vector<char>;
+
+#define sz(x) int((x).size())
+#define all(x) x.begin(), x.end()
+#define rall(x) x.rbegin(), x.rend()
+#define pb push_back
+#define eb emplace_back
+
+const int mod = 998244353; // 1e9+7;
+
+void solve() {
+    int n;
+	cin >> n;
+
+	vi arr(n);
+	for (int i = 0; i < n; i++) cin >> arr[i];
+
+	int ans = 0;
+
+	for (int i = 1; i <= n - 1; i++)
+		ans = max(ans, arr[i] - arr[0]);
+
+	for (int i = 0; i < n - 1; i++)
+		ans = max(ans, arr[i] - arr[i + 1]);
+
+	for (int i = 0; i <= n - 2; i++)
+		ans = max(ans, arr[n - 1] - arr[i]);
+
+	cout << ans << '\n';
+}
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int tc = 1;
+    cin >> tc;
+
+    while (tc--) solve();
+
+    return 0;
+}

1732B. Ugu.cpp

@@ -0,0 +1,58 @@
+#include <algorithm>
+#include <cmath>
+#include <cstring>
+#include <iostream>
+#include <map>
+#include <set>
+#include <string>
+#include <vector>
+using namespace std;
+
+using ll = long long;
+using str = string;
+
+using pii = pair<int, int>;
+using pll = pair<ll, ll>;
+#define mp make_pair
+#define f first
+#define s second
+
+using vi = vector<int>;
+using vl = vector<ll>;
+using vs = vector<str>;
+using vc = vector<char>;
+
+#define sz(x) int((x).size())
+#define all(x) x.begin(), x.end()
+#define rall(x) x.rbegin(), x.rend()
+#define pb push_back
+#define eb emplace_back
+
+const int mod = 998244353; // 1e9+7;
+
+void solve() {
+    int n;
+	cin >> n;
+	str s;
+	cin >> s;
+
+	int cnt = 1;
+	for (int i = 1; i < n; i++) {
+		if (s[i - 1] != s[i]) cnt++;
+	}
+
+	if (s[0] == '1' || cnt == 1) cout << cnt - 1 << '\n';
+	else cout << cnt - 2 << '\n';
+}
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int tc = 1;
+    cin >> tc;
+
+    while (tc--) solve();
+
+    return 0;
+}

1733B. Rule of League.cpp

@@ -0,0 +1,59 @@
+#include <algorithm>
+#include <cmath>
+#include <cstring>
+#include <iostream>
+#include <map>
+#include <set>
+#include <string>
+#include <vector>
+using namespace std;
+
+using ll = long long;
+using str = string;
+
+using pii = pair<int, int>;
+using pll = pair<ll, ll>;
+#define mp make_pair
+#define f first
+#define s second
+
+using vi = vector<int>;
+using vl = vector<ll>;
+using vs = vector<str>;
+using vc = vector<char>;
+
+#define sz(x) int((x).size())
+#define all(x) x.begin(), x.end()
+#define rall(x) x.rbegin(), x.rend()
+#define pb push_back
+#define eb emplace_back
+
+const int mod = 998244353; // 1e9+7;
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int tc = 1;
+    cin >> tc;
+
+    while (tc--) {
+		int n, x, y;
+    	cin >> n >> x >> y;
+
+		if (x > y) swap(x, y);
+
+		if (x || !y || (n - 1) % y) {
+			cout << -1 << '\n';
+			continue;
+		}
+
+		for (int k = 2; k <= n; k += y) {
+			for (int i = 1; i <= y; i++) cout << k << ' ';
+		}
+
+		cout << '\n';
+	}
+
+    return 0;
+}

1735B. Tea with Tangerines.cpp

@@ -0,0 +1,57 @@
+#include <algorithm>
+#include <cmath>
+#include <cstring>
+#include <iostream>
+#include <map>
+#include <set>
+#include <string>
+#include <vector>
+using namespace std;
+
+using ll = long long;
+using str = string;
+
+using pii = pair<int, int>;
+using pll = pair<ll, ll>;
+#define mp make_pair
+#define f first
+#define s second
+
+using vi = vector<int>;
+using vl = vector<ll>;
+using vs = vector<str>;
+using vc = vector<char>;
+
+#define sz(x) int((x).size())
+#define all(x) x.begin(), x.end()
+#define rall(x) x.rbegin(), x.rend()
+#define pb push_back
+#define eb emplace_back
+
+const int mod = 998244353; // 1e9+7;
+
+void solve() {
+    int n;
+    cin >> n;
+
+    vi a(n);
+    int ans = 0;
+    for (auto &i : a) {
+        cin >> i;
+        ans += (i - 1) / (2 * a[0] - 1);
+    }
+
+    cout << ans << '\n';
+}
+
+int main () {
+    ios_base::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int tc = 1;
+    cin >> tc;
+
+    while (tc--) solve();
+
+    return 0;
+}