From 54b80ddf4b2fc2bad493ba99eef8426cd08a5bfc Mon Sep 17 00:00:00 2001
From: ShazidMahsrafi <shazid456@gmail.com>
Date: Fri, 12 Jul 2024 19:31:12 +0600
Subject: [PATCH] feat: Add solutions for Codeforces problems 1992 A, B, and C

---
 Codes/1992 A - Only Pluses/1992A.cpp          | 43 +++++++++++++++++
 Codes/1992 B - Angry Monk/1992B.cpp           | 47 +++++++++++++++++++
 .../1992C.cpp                                 | 46 ++++++++++++++++++
 Readme.md                                     |  3 ++
 4 files changed, 139 insertions(+)
 create mode 100644 Codes/1992 A - Only Pluses/1992A.cpp
 create mode 100644 Codes/1992 B - Angry Monk/1992B.cpp
 create mode 100644 Codes/1992 C - Gorilla and Permutation/1992C.cpp

diff --git a/Codes/1992 A - Only Pluses/1992A.cpp b/Codes/1992 A - Only Pluses/1992A.cpp
new file mode 100644
index 0000000..b513720
--- /dev/null
+++ b/Codes/1992 A - Only Pluses/1992A.cpp	
@@ -0,0 +1,43 @@
+#include <bits/stdc++.h>
+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  rrep(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()
+{
+    vector<int>v(3);
+    cin>>v[0]>>v[1]>>v[2];
+    for(int i=0; i<5; ++i)
+        (*min_element(all(v)))++;
+    cout<<v[0]*v[1]*v[2]<<endl;
+}
+
+signed main()
+{
+    FAST;
+    int TCS = 1;
+    cin >> TCS;
+    for (int TC = 1; TC <= TCS; ++TC)
+    {
+      // cout<<"Case "<<TC<<": ";
+      solve();
+    }
+}
\ No newline at end of file
diff --git a/Codes/1992 B - Angry Monk/1992B.cpp b/Codes/1992 B - Angry Monk/1992B.cpp
new file mode 100644
index 0000000..63c76a4
--- /dev/null
+++ b/Codes/1992 B - Angry Monk/1992B.cpp	
@@ -0,0 +1,47 @@
+#include <bits/stdc++.h>
+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  rrep(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()
+{
+    int n,k;
+    cin>>n>>k;
+    vector<int>v(k);
+    for(auto &i:v)  cin>>i;
+    sort(all(v));
+    int ans=0;
+    for(int i=0; i<k-1; ++i)
+        ans += 2*v[i]-1;
+    cout<<ans<<endl;
+}
+
+signed main()
+{
+    FAST;
+    int TCS = 1;
+    cin >> TCS;
+    for (int TC = 1; TC <= TCS; ++TC)
+    {
+      // cout<<"Case "<<TC<<": ";
+      solve();
+    }
+}
\ No newline at end of file
diff --git a/Codes/1992 C - Gorilla and Permutation/1992C.cpp b/Codes/1992 C - Gorilla and Permutation/1992C.cpp
new file mode 100644
index 0000000..4dbb00a
--- /dev/null
+++ b/Codes/1992 C - Gorilla and Permutation/1992C.cpp	
@@ -0,0 +1,46 @@
+
+#include <bits/stdc++.h>
+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  rrep(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()
+{
+    int n,m,k;
+    cin>>n>>m>>k;
+    for(int i=n; i>=m+1; --i)
+        cout<<i<<" ";
+    for(int i=1; i<=m; ++i)
+        cout<<i<<" ";
+    cout<<endl;
+}
+
+signed main()
+{
+    FAST;
+    int TCS = 1;
+    cin >> TCS;
+    for (int TC = 1; TC <= TCS; ++TC)
+    {
+      // cout<<"Case "<<TC<<": ";
+      solve();
+    }
+}
diff --git a/Readme.md b/Readme.md
index a316247..98c8f89 100644
--- a/Readme.md
+++ b/Readme.md
@@ -361,6 +361,9 @@ This repository contains my solutions of Codeforces problems. They are in C++ la
 | 349 | 1989 A | Catch the Coin | [Question](https://codeforces.com/problemset/problem/1989/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1989%20A%20-%20Catch%20the%20Coin)
 | 350 | 1989 B | Substring and Subsequence | [Question](https://codeforces.com/problemset/problem/1989/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1989%20B%20-%20Substring%20and%20Subsequence)
 | 351 | 1989 C | Two Movies | [Question](https://codeforces.com/problemset/problem/1989/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1989%20C%20-%20Two%20Movies)
+| 352 | 1992 A | Only Pluses | [Question](https://codeforces.com/problemset/problem/1992/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1992%20A%20-%20Only%20Pluses)
+| 353 | 1992 B | Angry Monk | [Question](https://codeforces.com/problemset/problem/1992/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1992%20B%20-%20Angry%20Monk)
+| 354 | 1992 C | Gorilla and Permutation | [Question](https://codeforces.com/problemset/problem/1992/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1992%20C%20-%20Gorilla%20and%20Permutation)