From 4fd5103dead9d9b9c85137e987e71f7293db7e88 Mon Sep 17 00:00:00 2001
From: ShazidMahsrafi <shazid456@gmail.com>
Date: Thu, 17 Aug 2023 11:13:52 +0600
Subject: [PATCH] initial commit

---
 1196A Three Piles of Candies/1196A.cpp | 48 +++++++++++++++++
 313A Ilya and Bank Account/313A.cpp    | 74 ++++++++++++++++++++++++++
 2 files changed, 122 insertions(+)
 create mode 100644 1196A Three Piles of Candies/1196A.cpp
 create mode 100644 313A Ilya and Bank Account/313A.cpp

diff --git a/1196A Three Piles of Candies/1196A.cpp b/1196A Three Piles of Candies/1196A.cpp
new file mode 100644
index 0000000..3e3d158
--- /dev/null
+++ b/1196A Three Piles of Candies/1196A.cpp	
@@ -0,0 +1,48 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+#define ll          long long
+#define ul          unsigned long long
+#define pb          push_back
+#define ss          second
+#define ff          first
+#define fr(m)       for(int i=0; i<m; i++)
+#define fro(m)      for(int i=1; i<m; i++)
+#define frj(m)      for(int j=0; j<m; j++)
+#define frr(n)      for(int i=n; i>=0; i--)
+#define nl          '\n'
+#define yes         cout<<"YES"<<nl
+#define no          cout<<"NO"<<nl
+#define all(x)      x.begin(), x.end()
+#define dbg(x)    cerr << #x <<" "<< x << endl;
+#define fast_io  (ios_base:: sync_with_stdio(false),cin.tie(NULL));
+
+ll fact(ll n){ if(n==0) return 1; ll res = 1; for (ll i = 2; i <= n; i++) res = res * i; return res;}
+ll nPr(ll n, ll r) { return fact(n) / fact(n - r); }
+ll nCr(ll n, ll r) { return fact(n) / (fact(r) * fact(n - r)); }
+ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }
+ll lcm(ll a, ll b) { return (a * b) / gcd(a, b);}
+ll mypow(ll a, ll b){ ll ans = 1; while(b){ if (b&1) ans = (ans*a) ; b /= 2; a = (a*a); } return ans; }
+bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i <= sqrt(n); i++) if(n % i == 0) return false; return true;}
+
+#define PI          3.141592653589793238;
+#define INF         LONG_LONG_MAX;
+#define MOD         1e9+7;
+
+//////////////////////////////////Code Start/////////////////////////////////////
+
+void solve()
+{
+    ll a,b,c;
+    cin>>a>>b>>c;
+    ll ans=(a+b+c)/2;
+    cout<<ans<<nl;
+}
+ 
+int main()
+{
+    fast_io;
+    int TC = 1;
+    cin >> TC;
+    while (TC--) solve();
+}
\ No newline at end of file
diff --git a/313A Ilya and Bank Account/313A.cpp b/313A Ilya and Bank Account/313A.cpp
new file mode 100644
index 0000000..aeb1c09
--- /dev/null
+++ b/313A Ilya and Bank Account/313A.cpp	
@@ -0,0 +1,74 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+#define ll          long long
+#define ul          unsigned long long
+#define pb          push_back
+#define ss          second
+#define ff          first
+#define fr(m)       for(int i=0; i<m; i++)
+#define fro(m)      for(int i=1; i<m; i++)
+#define frj(m)      for(int j=0; j<m; j++)
+#define frr(n)      for(int i=n; i>=0; i--)
+#define nl          '\n'
+#define yes         cout<<"YES"<<nl
+#define no          cout<<"NO"<<nl
+#define all(x)      x.begin(), x.end()
+#define dbg(x)    cerr << #x <<" "<< x << endl;
+#define fast_io  (ios_base:: sync_with_stdio(false),cin.tie(NULL));
+
+ll fact(ll n){ if(n==0) return 1; ll res = 1; for (ll i = 2; i <= n; i++) res = res * i; return res;}
+ll nPr(ll n, ll r) { return fact(n) / fact(n - r); }
+ll nCr(ll n, ll r) { return fact(n) / (fact(r) * fact(n - r)); }
+ll gcd(ll a, ll b) { if (b == 0) return a; return gcd(b, a % b); }
+ll lcm(ll a, ll b) { return (a * b) / gcd(a, b);}
+ll mypow(ll a, ll b){ ll ans = 1; while(b){ if (b&1) ans = (ans*a) ; b /= 2; a = (a*a); } return ans; }
+bool isPrime(ll n) { if(n <= 1) return false; for(ll i = 2; i <= sqrt(n); i++) if(n % i == 0) return false; return true;}
+
+#define PI          3.141592653589793238;
+#define INF         LONG_LONG_MAX;
+#define MOD         1e9+7;
+
+//////////////////////////////////Code Start/////////////////////////////////////
+
+void solve()
+{
+    string s;
+    cin>>s;
+    if(s[0]!='-')
+        cout<<s<<nl;
+    else
+    {
+        for(int i=1; i<s.size(); ++i)
+        {
+            if(s[i]=='0')
+            {
+                s.erase(i,1);
+            }
+            else 
+                break;
+        }
+        int sz = s.size()-1;
+        if (s[sz-1]>s[sz])
+        {
+            s.erase(sz-1,1);
+            if(s=="-0")
+                cout<<0<<nl;
+            else    
+                cout<<s<<nl;
+        }
+        else
+        {
+            s.pop_back();
+            cout << s <<nl;
+        }
+    }
+}
+ 
+int main()
+{
+    fast_io;
+    int TC = 1;
+    //cin >> TC;
+    while (TC--) solve();
+}
\ No newline at end of file