done 3 sorting problems

CSES - CSES Problem Set/Introducotry_Problems/Two_Knights.cpp

@@ -0,0 +1,16 @@
+//  Two Knights
+
+#include<bits/stdc++.h>
+
+using namespace std;
+using ll = long long;
+
+int main() {
+    int n;
+    cin >> n;
+    for (ll i = 1; i <= n; i++) {
+        ll total_possibilities = i * i * (i*i - 1) / 2;
+        cout << total_possibilities - (4 * (i-1) * (i - 2)) << endl;
+    }
+    return 0;
+}