aboutsummaryrefslogtreecommitdiff
path: root/contests/Round939/C/main.cpp
diff options
context:
space:
mode:
authoromagdy7 <omar.professional8777@gmail.com>2024-04-14 17:07:15 +0200
committeromagdy7 <omar.professional8777@gmail.com>2024-04-14 17:07:15 +0200
commita842a62b4aadfc24e3f7c3a234325476868dcdad (patch)
tree89e54529a5d4c5198a6cf82ea4ab4a7f66b0a60d /contests/Round939/C/main.cpp
parentff7585043c5f48cf94bc7ace4ad1b8fe9b4df9ef (diff)
downloadcompetitive-programming-a842a62b4aadfc24e3f7c3a234325476868dcdad.tar.xz
competitive-programming-a842a62b4aadfc24e3f7c3a234325476868dcdad.zip
Solved 3 problems in the last Div.2
Diffstat (limited to 'contests/Round939/C/main.cpp')
-rwxr-xr-xcontests/Round939/C/main.cpp78
1 files changed, 78 insertions, 0 deletions
diff --git a/contests/Round939/C/main.cpp b/contests/Round939/C/main.cpp
new file mode 100755
index 0000000..cc893c7
--- /dev/null
+++ b/contests/Round939/C/main.cpp
@@ -0,0 +1,78 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpii = vector<pii>;
+using vi = vector<int>;
+using vll = vector<long long>;
+using mpii = map<int, int>;
+using mpll = map<ll, ll>;
+using db = long double;
+
+#define pb push_back
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define lb lower_bound
+#define ub upper_bound
+#define make_unique(x) \
+ sort(all((x))); \
+ (x).resize(unique(all((x))) - (x).begin())
+#define ceil(a, b) ((a) + (b)-1) / (b)
+
+const int mod = (int)1e9 + 7;
+const db pi = acos((db)-1);
+const int dx[4]{1, 0, -1, 0};
+const int dy[4]{0, 1, 0, -1};
+
+#ifdef LOCAL
+#include "debug.h"
+#else
+#define dbg(...) 42
+#endif
+
+/* stuff you should look for:
+ ---------------------------
+ * special cases (n=1?)
+ * int overflow, array bounds
+ * do smth instead of nothing and stay organized
+ * WRITE STUFF DOWN
+ * DON'T GET STUCK ON ONE APPROACH
+ */
+
+// 1 2 3 4
+// 2 2 3 4
+// 3 3 3 4
+// 4 4 4 4
+
+void solve() {
+ int n;
+ cin >> n;
+ ll sum = 0;
+ int j = 1;
+ for (int i = 1; i <= n; i++) {
+ sum += i * j;
+ j += 2;
+ }
+ cout << sum << ' ' << 2 * n << '\n';
+ for (int i = n - 1; i >= 0; i--) {
+ for (int t = 1; t <= 2; t++) {
+ cout << t << ' ' << i + 1;
+ for (int j = 1; j <= n; j++) {
+ cout << ' ' << j;
+ }
+ cout << '\n';
+ }
+ }
+}
+
+int main() {
+ ios_base::sync_with_stdio(false);
+ cin.tie(NULL);
+ int tt;
+ cin >> tt;
+ while (tt--) {
+ solve();
+ }
+}