Fix: Simplify output format for Josephus Problem to match test requirements

Author: apurvavats

archive/c/c-plus-plus/josephus-problem.cpp

@@ -1,11 +1,12 @@
 #include <iostream>
-#include <vector>
+#include <stdexcept>
 using namespace std;
 
 int josephus(int n, int k) {
     int res = 0;
-    for (int i = 1; i <= n; i++)
+    for (int i = 1; i <= n; ++i) {
         res = (res + k) % i;
+    }
     return res + 1;
 }
 
@@ -15,13 +16,23 @@ int main(int argc, char* argv[]) {
         return 1;
     }
 
-    int n = stoi(argv[1]);
-    int k = stoi(argv[2]);
-    if (n <= 0 || k <= 0) {
+    try {
+        int n = stoi(argv[1]);
+        int k = stoi(argv[2]);
+
+        if (n <= 0 || k <= 0) {
+            cerr << "Invalid input" << endl;
+            return 1;
+        }
+
+        cout << josephus(n, k) << endl;
+        return 0;
+
+    } catch (const invalid_argument&) {
+        cerr << "Invalid input" << endl;
+        return 1;
+    } catch (const out_of_range&) {
         cerr << "Invalid input" << endl;
         return 1;
     }
-
-    cout << josephus(n, k) << endl;
-    return 0;
 }