Round 640

Author: phoenixx1

CodeForces/Round #640 (Div. 4)/Alice Bob and Candies.cpp

@@ -0,0 +1,45 @@
+//author @Nishant
+
+#include<bits/stdc++.h>
+using namespace std;
+int main(){
+    int t;
+    cin >> t;
+    while(t--){
+        int n;
+        cin >> n;
+        long long a;
+        deque<long long> arr;
+        cin >> a;
+        long long AS = a, BS = 0;
+        long long AC = a, BC = 0;
+        for(long long i = 2; i <= n; i++){
+            cin >> a;
+            arr.push_back(a);
+        }
+        long long count = 1, last = 0;
+        while(!arr.empty()){
+            if(last == 0){
+                while(!arr.empty() && BC <= AC){
+                    BC += arr.at(arr.size() - 1);
+                    arr.pop_back();
+                }
+                BS += BC;
+                last = 1;
+                AC = 0;
+                count++;
+            }else{
+                while(!arr.empty() && AC <= BC){
+                    AC += arr.at(0);
+                    arr.pop_front();
+                }
+                AS += AC;
+                last = 0;
+                BC = 0;
+                count++;
+            }
+        }
+        cout << count << " " << AS << " " << BS << endl;
+    }
+    return 0;
+}

CodeForces/Round #640 (Div. 4)/K-th Not Divisible by n.cpp

@@ -0,0 +1,20 @@
+//author @Nishant
+
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int t;
+    cin >> t;
+    while(t--){
+        int n, k;
+        cin >> n >> k;
+        int ans = k + (k / (n - 1));
+        if(ans % n == 0){
+            cout << ans - 1 << endl;
+        }else{
+            cout << ans << endl;
+        }  
+    }
+    return 0;
+}

CodeForces/Round #640 (Div. 4)/Sum of Round Numbers.cpp

@@ -0,0 +1,30 @@
+//author @Nishant
+
+#include<bits/stdc++.h>
+using namespace std;
+
+int main(){
+    int t;
+    cin >> t;
+    while(t--){
+        int n;
+        cin >> n;
+        int temp = n;
+        int i = 1;
+        vector<int> a;
+        while(n){
+            int temp = n % 10;
+            if(temp != 0){
+                a.push_back(temp * i);
+            }
+            i *= 10;
+            n /= 10;
+        }
+        cout << a.size() << endl;
+        for(int x : a){
+            cout << x << " ";
+        }
+        cout << endl;
+    }
+    return 0;
+}