From 47ec891f81ef2ea6153db39d898b61e1cfec7120 Mon Sep 17 00:00:00 2001 From: Alex Date: Wed, 25 Feb 2026 19:58:20 +0100 Subject: [PATCH] Fix and test template --- A. Perfect Root.cpp | 155 ------------------------------------- src/A. Perfect Root.cpp | 156 +++++++++++++++++++++++++++++++++++++ src/B. Prefix Max.cpp | 165 ++++++++++++++++++++++++++++++++++++++++ template.cpp | 149 ++++++++++++++++++++++++++++++++++++ 4 files changed, 470 insertions(+), 155 deletions(-) delete mode 100644 A. Perfect Root.cpp create mode 100644 src/A. Perfect Root.cpp create mode 100644 src/B. Prefix Max.cpp create mode 100644 template.cpp diff --git a/A. Perfect Root.cpp b/A. Perfect Root.cpp deleted file mode 100644 index 9227f07..0000000 --- a/A. Perfect Root.cpp +++ /dev/null @@ -1,155 +0,0 @@ -// https://codeforces.com/contest/2185/problem/A - -// #define FAST_EXECUTION -// #define INTERACTIVE_MODE - -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include -#include - -// https://github.com/coder3101/cf-template/blob/master/template.cc -const long long INF = 9223372036854775807; -const long long MOD = 1e9 + 7; - -#ifndef ONLINE_JUDGE -#define WATCH(key, val)\ - printf("Watched %s -> %s \n", key, std::to_string(val).c_str()); -#define WATCH_CONTAINER(key, val)\ - printf("Watched %s : ", key);\ - for (auto e : val)\ - printf(" %s", std::to_string(e).c_str());\ - printf("\n"); -#define WATCH_MAP(map)\ - printf("Watching Map\n");\ - for (auto e : map)\ - printf("%s -> %s\n", std::to_string(e.first).c_str(),\ - std::to_string(e.second).c_str());\ - printf("\n"); -#else -#define WATCH(key, val)\ - do {\ - } while (false); -#define WATCH_CONTAINER(key, val)\ - do {\ - } while (false); -#define WATCH_MAP(map)\ - do {\ - } while (false); -#endif - -#ifdef FAST_EXECUTION -#pragma GCC optimize("O3") -#pragma comment(linker, "/stack:247474112") -#endif - -#define REP(n) for(int t=0; t= 0; i--) -#define RFOR_S(i, n, k) for (i = n - 1; i >= 0; i -= k) -#define MAX_OF(x, y) ((x > y) ? x : y) -#define MIN_OF(x, y) ((x > y) ? y : x) -#define MIN_IN(A) *(std::min_element(A.begin(), A.end())); -#define MAX_IN(A) *(std::max_element(A.begin(), A.end())); -#define MAX_AT(A) (std::max_element(A.begin(), A.end()) - A.begin()); -#define MIN_AT(A) (std::min_element(A.begin(), A.end()) - A.begin()); -#define TESTCASE\ - int testcase;\ - std::cin>>testcase;\ - while(testcase--) -#define GCD(a,b) std::__gcd(a,b); -#define LCM(a,b) (a)*((b)/std::__gcd(a,b)); -#define SORT(A) std::sort(A.begin(), A.end()); -#define RSORT(A) std::sort(A.rbegin(), A.rend()); -#define REVERSE(A) std::reverse(A.begin(), A.end()); -#define ANY(container, result, condition)\ - result = false;\ - for (const auto &e : container)\ - if (condition(e)) {\ - result = true;\ - break;\ - } -#define ALL(container, result, condition)\ - result = true;\ - for (const auto &e : container)\ - if (!condition(e)) {\ - result = false;\ - break;\ - } -#ifdef INTERACTIVE_MODE -#define iprint(...)\ - printf(__VA_ARGS__);\ - fflush(stdout); -#else -#define iprint(...) printf(__VA_ARGS__); -#endif - -#define LL long long -#define L long -#define ULL unsigned long long -#define I int -#define D double -#define UI unsigned int -#define VEC(i) std::vector -#define MAP(a, b) std::map -#define UMAP(a, b) std::unordered_map -#define SET(a) std::set -#define USET(a) std::unordered_set -#define MSET(a) std::multiset -#define STR std::string -#define PAIR(a,b) std::pair -#define PAIRI std::pair -#define READ_INT(var) scanf("%d", &var) -#define READ_STR(var) std::cin >> var -#define READ_LONG(var) scanf("%lld", &var) -#define WRITE_INT(var) printf("%d", var) -#define WRITE_LONG(var) printf("%lld", var) -#define WRITE_STR(var) std::cout << var -#define WRITE_VEC_LL(val)\ - for (auto e : val)\ - printf("%lld ", e); -#define WRITE_VEC_I(val)\ - for (auto e : val)\ - printf("%d ", e); - -#define pb push_back -#define eb emplace_back - -LL power(LL x, ULL y) { - LL res = 1; - x = x % MOD; - while (y > 0) { - if (y & 1) - res = (res*x) % MOD; - y = y>>1; - x = (x*x) % MOD; - } - return res; -} - -const int N = 1e9; - -int main() { - TESTCASE { - int n; - READ_INT(n); - int i; - int j = 1; - FFOR(i, j, n + 1) { - WRITE_INT(j * j); - printf(" "); - } - printf("\n"); - } - - return 0; -} \ No newline at end of file diff --git a/src/A. Perfect Root.cpp b/src/A. Perfect Root.cpp new file mode 100644 index 0000000..70f3ab7 --- /dev/null +++ b/src/A. Perfect Root.cpp @@ -0,0 +1,156 @@ +// https://codeforces.com/contest/2185/problem/A + +// #define FAST_EXECUTION +// #define INTERACTIVE_MODE + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +using namespace std; + +// https://github.com/coder3101/cf-template/blob/master/template.cc +const long long INF = 9223372036854775807; +const long long MOD = 1e9 + 7; + +#ifndef ONLINE_JUDGE +#define WATCH(key, val)\ + printf("Watched %s -> %s \n", key, to_string(val).c_str()); +#define WATCH_CONTAINER(key, val)\ + printf("Watched %s : ", key);\ + for (auto e : val)\ + printf(" %s", to_string(e).c_str());\ + printf("\n"); +#define WATCH_MAP(map)\ + printf("Watching Map\n");\ + for (auto e : map)\ + printf("%s -> %s\n", to_string(e.first).c_str(),\ + to_string(e.second).c_str());\ + printf("\n"); +#else +#define WATCH(key, val)\ + do {\ + } while (false); +#define WATCH_CONTAINER(key, val)\ + do {\ + } while (false); +#define WATCH_MAP(map)\ + do {\ + } while (false); +#endif + +#ifdef FAST_EXECUTION +#pragma GCC optimize("O3") +#pragma comment(linker, "/stack:247474112") +#endif + +#define REP(n) for(int t=0; t= 0; i--) +#define RFOR_S(i, n, k) for (i = n - 1; i >= 0; i -= k) +#define MAX_OF(x, y) ((x > y) ? x : y) +#define MIN_OF(x, y) ((x > y) ? y : x) +#define MIN_IN(A) *(min_element(A.begin(), A.end())) +#define MAX_IN(A) *(max_element(A.begin(), A.end())) +#define MAX_AT(A) (max_element(A.begin(), A.end()) - A.begin()) +#define MIN_AT(A) (min_element(A.begin(), A.end()) - A.begin()) +#define TESTCASE\ + int testcase;\ + cin>>testcase;\ + while(testcase--) +#define GCD(a,b) __gcd(a,b) +#define LCM(a,b) (a)*((b)/__gcd(a,b)) +#define SORT(A) sort(A.begin(), A.end()); +#define RSORT(A) sort(A.rbegin(), A.rend()); +#define REVERSE(A) reverse(A.begin(), A.end()); +#define ANY(container, result, condition)\ + result = false;\ + for (const auto &e : container)\ + if (condition(e)) {\ + result = true;\ + break;\ + } +#define ALL(container, result, condition)\ + result = true;\ + for (const auto &e : container)\ + if (!condition(e)) {\ + result = false;\ + break;\ + } +#ifdef INTERACTIVE_MODE +#define iprint(...)\ + printf(__VA_ARGS__);\ + fflush(stdout); +#else +#define iprint(...) printf(__VA_ARGS__); +#endif + +#define LL long long +#define L long +#define ULL unsigned long long +#define I int +#define D double +#define UI unsigned int +#define VEC(i) vector +#define MAP(a, b) map +#define UMAP(a, b) unordered_map +#define SET(a) set +#define USET(a) unordered_set +#define MSET(a) multiset +#define STR string +#define PAIR(a,b) pair +#define PAIRI pair +#define READ_INT(var) scanf("%d", &var); +#define READ_STR(var) cin >> var; +#define READ_LONG(var) scanf("%lld", &var); +#define WRITE_INT(var) printf("%d", var); +#define WRITE_LONG(var) printf("%lld", var); +#define WRITE_STR(var) cout << var; +#define WRITE_VEC_LL(val)\ + for (auto e : val)\ + printf("%lld ", e); +#define WRITE_VEC_I(val)\ + for (auto e : val)\ + printf("%d ", e); + +#define pb push_back +#define eb emplace_back + +LL power(LL x, ULL y) { + LL res = 1; + x = x % MOD; + while (y > 0) { + if (y & 1) + res = (res*x) % MOD; + y = y>>1; + x = (x*x) % MOD; + } + return res; +} + +const int N = 1e9; + +int main() { + TESTCASE { + int n; + READ_INT(n); + int i; + FFOR(i, 1, n + 1) { + WRITE_INT(i * i); + printf(" "); + } + printf("\n"); + } + + return 0; +} \ No newline at end of file diff --git a/src/B. Prefix Max.cpp b/src/B. Prefix Max.cpp new file mode 100644 index 0000000..77eaa56 --- /dev/null +++ b/src/B. Prefix Max.cpp @@ -0,0 +1,165 @@ +// https://codeforces.com/contest/2185/problem/B + +// #define FAST_EXECUTION +// #define INTERACTIVE_MODE + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +using namespace std; + +// https://github.com/coder3101/cf-template/blob/master/template.cc +const long long INF = 9223372036854775807; +const long long MOD = 1e9 + 7; + +#ifndef ONLINE_JUDGE +#define WATCH(key, val)\ + printf("Watched %s -> %s \n", key, to_string(val).c_str()); +#define WATCH_CONTAINER(key, val)\ + printf("Watched %s : ", key);\ + for (auto e : val)\ + printf(" %s", to_string(e).c_str());\ + printf("\n"); +#define WATCH_MAP(map)\ + printf("Watching Map\n");\ + for (auto e : map)\ + printf("%s -> %s\n", to_string(e.first).c_str(),\ + to_string(e.second).c_str());\ + printf("\n"); +#else +#define WATCH(key, val)\ + do {\ + } while (false); +#define WATCH_CONTAINER(key, val)\ + do {\ + } while (false); +#define WATCH_MAP(map)\ + do {\ + } while (false); +#endif + +#ifdef FAST_EXECUTION +#pragma GCC optimize("O3") +#pragma comment(linker, "/stack:247474112") +#endif + +#define REP(n) for(int t=0; t= 0; i--) +#define RFOR_S(i, n, k) for (i = n - 1; i >= 0; i -= k) +#define MAX_OF(x, y) ((x > y) ? x : y) +#define MIN_OF(x, y) ((x > y) ? y : x) +#define MIN_IN(A) *(min_element(A.begin(), A.end())) +#define MAX_IN(A) *(max_element(A.begin(), A.end())) +#define MAX_AT(A) (max_element(A.begin(), A.end()) - A.begin()) +#define MIN_AT(A) (min_element(A.begin(), A.end()) - A.begin()) +#define TESTCASE\ + int testcase;\ + cin>>testcase;\ + while(testcase--) +#define GCD(a,b) __gcd(a,b) +#define LCM(a,b) (a)*((b)/__gcd(a,b)) +#define SORT(A) sort(A.begin(), A.end()); +#define RSORT(A) sort(A.rbegin(), A.rend()); +#define REVERSE(A) reverse(A.begin(), A.end()); +#define ANY(container, result, condition)\ + result = false;\ + for (const auto &e : container)\ + if (condition(e)) {\ + result = true;\ + break;\ + } +#define ALL(container, result, condition)\ + result = true;\ + for (const auto &e : container)\ + if (!condition(e)) {\ + result = false;\ + break;\ + } +#ifdef INTERACTIVE_MODE +#define iprint(...)\ + printf(__VA_ARGS__);\ + fflush(stdout); +#else +#define iprint(...) printf(__VA_ARGS__); +#endif + +#define LL long long +#define L long +#define ULL unsigned long long +#define I int +#define D double +#define UI unsigned int +#define VEC(i) vector +#define MAP(a, b) map +#define UMAP(a, b) unordered_map +#define SET(a) set +#define USET(a) unordered_set +#define MSET(a) multiset +#define STR string +#define PAIR(a,b) pair +#define PAIRI pair +#define READ_INT(var) scanf("%d", &var); +#define READ_STR(var) cin >> var; +#define READ_LONG(var) scanf("%lld", &var); +#define WRITE_INT(var) printf("%d", var); +#define WRITE_LONG(var) printf("%lld", var); +#define WRITE_STR(var) cout << var; +#define WRITE_VEC_LL(val)\ + for (auto e : val)\ + printf("%lld ", e); +#define WRITE_VEC_I(val)\ + for (auto e : val)\ + printf("%d ", e); + +#define pb push_back +#define eb emplace_back + +LL power(LL x, ULL y) { + LL res = 1; + x = x % MOD; + while (y > 0) { + if (y & 1) + res = (res*x) % MOD; + y = y>>1; + x = (x*x) % MOD; + } + return res; +} + +const int N = 1e9; + +int main() { + TESTCASE { + int n; + READ_INT(n) + int i; + VEC(int) array(n); + FOR(i, n) { + READ_INT(array[i]) + } + int id_max = MAX_AT(array); + if (id_max) { + swap(array[id_max], array[0]); + } + int value = 0; + FOR(i, n) { + value += *max_element(array.begin(), array.begin() + i); + } + WRITE_INT(value) + printf("\n"); + } + + return 0; +} \ No newline at end of file diff --git a/template.cpp b/template.cpp new file mode 100644 index 0000000..3359de1 --- /dev/null +++ b/template.cpp @@ -0,0 +1,149 @@ +// https://codeforces.com/contest/2185/problem/B + +// #define FAST_EXECUTION +// #define INTERACTIVE_MODE + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +using namespace std; + +// https://github.com/coder3101/cf-template/blob/master/template.cc +const long long INF = 9223372036854775807; +const long long MOD = 1e9 + 7; + +#ifndef ONLINE_JUDGE +#define WATCH(key, val)\ + printf("Watched %s -> %s \n", key, to_string(val).c_str()); +#define WATCH_CONTAINER(key, val)\ + printf("Watched %s : ", key);\ + for (auto e : val)\ + printf(" %s", to_string(e).c_str());\ + printf("\n"); +#define WATCH_MAP(map)\ + printf("Watching Map\n");\ + for (auto e : map)\ + printf("%s -> %s\n", to_string(e.first).c_str(),\ + to_string(e.second).c_str());\ + printf("\n"); +#else +#define WATCH(key, val)\ + do {\ + } while (false); +#define WATCH_CONTAINER(key, val)\ + do {\ + } while (false); +#define WATCH_MAP(map)\ + do {\ + } while (false); +#endif + +#ifdef FAST_EXECUTION +#pragma GCC optimize("O3") +#pragma comment(linker, "/stack:247474112") +#endif + +#define REP(n) for(int t=0; t= 0; i--) +#define RFOR_S(i, n, k) for (i = n - 1; i >= 0; i -= k) +#define MAX_OF(x, y) ((x > y) ? x : y) +#define MIN_OF(x, y) ((x > y) ? y : x) +#define MIN_IN(A) *(min_element(A.begin(), A.end())) +#define MAX_IN(A) *(max_element(A.begin(), A.end())) +#define MAX_AT(A) (max_element(A.begin(), A.end()) - A.begin()) +#define MIN_AT(A) (min_element(A.begin(), A.end()) - A.begin()) +#define TESTCASE\ + int testcase;\ + cin>>testcase;\ + while(testcase--) +#define GCD(a,b) __gcd(a,b) +#define LCM(a,b) (a)*((b)/__gcd(a,b)) +#define SORT(A) sort(A.begin(), A.end()); +#define RSORT(A) sort(A.rbegin(), A.rend()); +#define REVERSE(A) reverse(A.begin(), A.end()); +#define ANY(container, result, condition)\ + result = false;\ + for (const auto &e : container)\ + if (condition(e)) {\ + result = true;\ + break;\ + } +#define ALL(container, result, condition)\ + result = true;\ + for (const auto &e : container)\ + if (!condition(e)) {\ + result = false;\ + break;\ + } +#ifdef INTERACTIVE_MODE +#define iprint(...)\ + printf(__VA_ARGS__);\ + fflush(stdout); +#else +#define iprint(...) printf(__VA_ARGS__); +#endif + +#define LL long long +#define L long +#define ULL unsigned long long +#define I int +#define D double +#define UI unsigned int +#define VEC(i) vector +#define MAP(a, b) map +#define UMAP(a, b) unordered_map +#define SET(a) set +#define USET(a) unordered_set +#define MSET(a) multiset +#define STR string +#define PAIR(a,b) pair +#define PAIRI pair +#define READ_INT(var) scanf("%d", &var); +#define READ_STR(var) cin >> var; +#define READ_LONG(var) scanf("%lld", &var); +#define WRITE_INT(var) printf("%d", var); +#define WRITE_LONG(var) printf("%lld", var); +#define WRITE_STR(var) cout << var; +#define WRITE_VEC_LL(val)\ + for (auto e : val)\ + printf("%lld ", e); +#define WRITE_VEC_I(val)\ + for (auto e : val)\ + printf("%d ", e); + +#define pb push_back +#define eb emplace_back + +LL power(LL x, ULL y) { + LL res = 1; + x = x % MOD; + while (y > 0) { + if (y & 1) + res = (res*x) % MOD; + y = y>>1; + x = (x*x) % MOD; + } + return res; +} + +const int N = 1e9; + +int main() { + TESTCASE { + + } + + return 0; +} \ No newline at end of file