From a842a62b4aadfc24e3f7c3a234325476868dcdad Mon Sep 17 00:00:00 2001 From: omagdy7 Date: Sun, 14 Apr 2024 17:07:15 +0200 Subject: Solved 3 problems in the last Div.2 --- contests/Round939/C/main.cpp | 78 ++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 78 insertions(+) create mode 100755 contests/Round939/C/main.cpp (limited to 'contests/Round939/C/main.cpp') 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 + +using namespace std; + +using ll = long long; +using pii = pair; +using vpii = vector; +using vi = vector; +using vll = vector; +using mpii = map; +using mpll = map; +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(); + } +} -- cgit v1.2.3