From e4d09054d865aac478e5e62229023ffc87d18450 Mon Sep 17 00:00:00 2001 From: ShazidMahsrafi Date: Sun, 14 Jul 2024 01:17:17 +0600 Subject: [PATCH] Add solutions for Codeforces problems 1606 A and 1607 B --- Codes/1606 A - AB Balance/1606A.cpp | 46 ++ Codes/1607 B - Odd Grasshopper/1607B.cpp | 45 ++ Readme.md | 510 ++++++++++++----------- 3 files changed, 347 insertions(+), 254 deletions(-) create mode 100644 Codes/1606 A - AB Balance/1606A.cpp create mode 100644 Codes/1607 B - Odd Grasshopper/1607B.cpp diff --git a/Codes/1606 A - AB Balance/1606A.cpp b/Codes/1606 A - AB Balance/1606A.cpp new file mode 100644 index 0000000..5eefad1 --- /dev/null +++ b/Codes/1606 A - AB Balance/1606A.cpp @@ -0,0 +1,46 @@ +#include +using namespace std; +#ifdef ONLINE_JUDGE +#define dbg(...) +#else +#include "Assets/debug.h" +#endif +#define int long long +#define ll long long +#define endl '\n' +#define ff first +#define ss second +#define ins insert +#define pb push_back +#define ppb pop_back +#define sz(x) (int)(x).size() +#define all(x) x.begin(), x.end() +#define rep(i,a,b) for(int i=a; i=b; --i) +#define yn(f) f? cout<<"YES\n":cout<<"NO\n" +#define FAST (ios_base::sync_with_stdio(false), cin.tie(nullptr)); +ll pow(ll x,ll y,ll m=1e9+7) {ll ans=1;x%=m;while(y){if(y&1)ans=(ans*x)%m;x=(x*x)%m;y>>=1;}return ans;} + +void solve() +{ + string s; + cin>>s; + if(s[0]!=s[s.size()-1]) + { + if(s[0]=='a') s[0]='b'; + else s[0]='a'; + } + cout<> TCS; + for (int TC = 1; TC <= TCS; ++TC) + { + // cout<<"Case "< +using namespace std; +#ifdef ONLINE_JUDGE +#define dbg(...) +#else +#include "Assets/debug.h" +#endif +#define int long long +#define ll long long +#define endl '\n' +#define ff first +#define ss second +#define ins insert +#define pb push_back +#define ppb pop_back +#define sz(x) (int)(x).size() +#define all(x) x.begin(), x.end() +#define rep(i,a,b) for(int i=a; i=b; --i) +#define yn(f) f? cout<<"YES\n":cout<<"NO\n" +#define FAST (ios_base::sync_with_stdio(false), cin.tie(nullptr)); +ll pow(ll x,ll y,ll m=1e9+7) {ll ans=1;x%=m;while(y){if(y&1)ans=(ans*x)%m;x=(x*x)%m;y>>=1;}return ans;} + +void solve() +{ + ll n, x; + cin >> x >> n; + int m = x & 1 ? 1 : -1; + if(n % 4 == 1) x += m * n; + else if(n % 4 == 2) x -= m; + else if(n % 4 == 3) x -= m * (n + 1); + cout << x << endl; +} + +signed main() +{ + FAST; + int TCS = 1; + cin >> TCS; + for (int TC = 1; TC <= TCS; ++TC) + { + // cout<<"Case "<