CF Update

Author: Tanjim131

Codeforces/1400/236-2-B.cpp

@@ -0,0 +1,44 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+#include <cmath>
+
+using namespace std;
+
+int main(int argc, char const *argv[])
+{
+ int n, k;
+ cin >> n >> k;
+ vector <int> a(n);
+ for(int i = 0 ; i < n ; ++i){
+ cin >> a[i];
+ }
+ // answer depends only on the height of the first tree (a_0, a_0 + k, a_0 + 2k, ... , a_0 + (n - 1) * k)
+ // brute force the height of the first tree [1, 1000]
+ int best_height = -1;
+ int minimum_operations = numeric_limits<int>::max();
+ for(int height = 1 ; height <= 1000 ; ++height){
+ // for each height of the first tree, find the other heights (height_j = height + j * k)
+ // then find the number of operations
+ int operations = 0;
+ for(int j = 0 ; j < n ; ++j){
+ if(height + j * k != a[j]){
+ ++operations;
+ }
+ }
+ if(minimum_operations > operations){
+ minimum_operations = operations;
+ best_height = height;
+ }
+ }
+ cout << minimum_operations << '\n';
+ for(int i = 0 ; i < n ; ++i){
+ int new_height = best_height + i * k;
+ if(new_height > a[i]){
+ cout << "+ " << i + 1 << " " << new_height - a[i] << '\n';
+ } else if(new_height < a[i]){
+ cout << "- " << i + 1 << " " << a[i] - new_height << '\n';
+ }
+ }
+ return 0;
+}

Codeforces/666-2-A.cpp

@@ -0,0 +1,33 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+int main(int argc, char const *argv[])
+{
+ int t;
+ cin >> t;
+ while(t--){
+ int n;
+ cin >> n;
+ vector <int> count(26, 0);
+ for(int i = 0 ; i < n ; ++i){
+ string s;
+ cin >> s;
+ for(int j = 0 ; j < s.length() ; ++j){
+ ++count[s[j] - 'a'];
+ }
+ }
+ // each alphabet count must be a multiple of n
+ bool possible = true;
+ for(int i = 0 ; i < 26 ; ++i){
+ if(count[i] == 0) continue;
+ if(count[i] % n != 0){
+ possible = false;
+ break;
+ }
+ }
+ cout << (possible ? "YES" : "NO") << '\n'; 
+ }
+ return 0;
+}