From 426af43117eec452c8508a19a58759d9693d39c3 Mon Sep 17 00:00:00 2001
From: ShazidMahsrafi <shazid456@gmail.com>
Date: Tue, 9 Jan 2024 22:43:36 +0600
Subject: [PATCH] Remove unnecessary files and update .gitignore

---
 .gitignore |  1 +
 1919A.cpp  | 75 --------------------------------------------------
 1919B.cpp  | 80 ------------------------------------------------------
 3 files changed, 1 insertion(+), 155 deletions(-)
 delete mode 100644 1919A.cpp
 delete mode 100644 1919B.cpp

diff --git a/.gitignore b/.gitignore
index 4827a80..478f358 100644
--- a/.gitignore
+++ b/.gitignore
@@ -1,3 +1,4 @@
 Test/
 To solve/
+Upload/
 Generator.py
\ No newline at end of file
diff --git a/1919A.cpp b/1919A.cpp
deleted file mode 100644
index 38ded02..0000000
--- a/1919A.cpp
+++ /dev/null
@@ -1,75 +0,0 @@
-#include<bits/stdc++.h>
-using namespace std;
-
-#define FAST_IO             (ios_base:: sync_with_stdio(false),cin.tie(NULL));
-
-#define int                 long long
-#define ll                  long long
-#define ull                 unsigned long long
-#define endl                '\n'
-#define ff                  first
-#define ss                  second
-#define pb                  push_back
-#define all(x)              x.begin(), x.end()
-#define sz(x)               (int)(x).size()
-
-#define yes                 cout<<"YES"<<endl
-#define no                  cout<<"NO"<<endl
-#define neg1                cout<<-1<<endl
-
-#define PI                  3.141592653589793238
-#define MIN                 INT_MIN
-#define MAX                 INT_MAX
-#define INF                 LONG_LONG_MAX
-#define MOD                 1000000007
-#define LLM                 1000000000000000007
-
-ll factorial(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 factorial(n) / factorial(n - r); }
-ll nCr(ll n, ll r)              { return factorial(n) / (factorial(r) * factorial(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);}
-ull mypow(ull a, ull b)         { ull ans = 1; a%=MOD; while(b){ if (b&1) ans = (ans*a) % MOD; a = (a*a) % MOD; b >>= 1; } return ans; }
-bool isPrime(ll n)              { if(n <= 1) return false; for(ll i = 2; i*i <= n; i++) if(n % i == 0) return false; return true; }
-
-#ifndef ONLINE_JUDGE
-#define dbg(x) cerr << #x <<" "; _print(x); cerr << endl;
-#define dbgin(x) cerr << #x <<" "; _print(x); cerr << ";"<<endl;
-#else
-#define dbg(x)
-#define dbgin(x)
-#endif
-
-void _print(int t) {cerr << t;}void _print(string t) {cerr << t;}void _print(char t) {cerr << t;}
-void _print(long double t) {cerr << t;}void _print(double t) {cerr << t;}void _print(unsigned ll t) {cerr << t;}
-template <class T, class V> void _print(pair <T, V> p);
-template <class T> void _print(vector <T> v);template <class T> void _print(set <T> v);
-template <class T, class V> void _print(map <T, V> v);template <class T> void _print(multiset <T> v);
-template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.first); cerr << ","; _print(p.second); cerr << "}";}
-template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
-template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
-template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
-template <class T> void _print(unordered_set <T> v) {cerr<<"[ "; for(T i : v) {_print(i); cerr<<" ";} cerr<<"]";}
-template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
-template <class T, class V> void _print(multimap <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";} 
-template <class T, class V> void _print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
-/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-
-void solve()
-{
-    int a,b;
-    cin>>a>>b;
-    if((a+b)&1)
-        cout<<"Alice"<<endl;
-    else
-        cout<<"Bob"<<endl;
-}
-
-int32_t main()
-{
-    FAST_IO;
-    int TC = 1;
-    cin >> TC;
-    while (TC--) 
-        solve();
-}
diff --git a/1919B.cpp b/1919B.cpp
deleted file mode 100644
index 45774dc..0000000
--- a/1919B.cpp
+++ /dev/null
@@ -1,80 +0,0 @@
-#include<bits/stdc++.h>
-using namespace std;
-
-#define FAST_IO             (ios_base:: sync_with_stdio(false),cin.tie(NULL));
-
-#define int                 long long
-#define ll                  long long
-#define ull                 unsigned long long
-#define endl                '\n'
-#define ff                  first
-#define ss                  second
-#define pb                  push_back
-#define all(x)              x.begin(), x.end()
-#define sz(x)               (int)(x).size()
-
-#define yes                 cout<<"YES"<<endl
-#define no                  cout<<"NO"<<endl
-#define neg1                cout<<-1<<endl
-
-#define PI                  3.141592653589793238
-#define MIN                 INT_MIN
-#define MAX                 INT_MAX
-#define INF                 LONG_LONG_MAX
-#define MOD                 1000000007
-#define LLM                 1000000000000000007
-
-ll factorial(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 factorial(n) / factorial(n - r); }
-ll nCr(ll n, ll r)              { return factorial(n) / (factorial(r) * factorial(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);}
-ull mypow(ull a, ull b)         { ull ans = 1; a%=MOD; while(b){ if (b&1) ans = (ans*a) % MOD; a = (a*a) % MOD; b >>= 1; } return ans; }
-bool isPrime(ll n)              { if(n <= 1) return false; for(ll i = 2; i*i <= n; i++) if(n % i == 0) return false; return true; }
-
-#ifndef ONLINE_JUDGE
-#define dbg(x) cerr << #x <<" "; _print(x); cerr << endl;
-#define dbgin(x) cerr << #x <<" "; _print(x); cerr << ";"<<endl;
-#else
-#define dbg(x)
-#define dbgin(x)
-#endif
-
-void _print(int t) {cerr << t;}void _print(string t) {cerr << t;}void _print(char t) {cerr << t;}
-void _print(long double t) {cerr << t;}void _print(double t) {cerr << t;}void _print(unsigned ll t) {cerr << t;}
-template <class T, class V> void _print(pair <T, V> p);
-template <class T> void _print(vector <T> v);template <class T> void _print(set <T> v);
-template <class T, class V> void _print(map <T, V> v);template <class T> void _print(multiset <T> v);
-template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.first); cerr << ","; _print(p.second); cerr << "}";}
-template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
-template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
-template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
-template <class T> void _print(unordered_set <T> v) {cerr<<"[ "; for(T i : v) {_print(i); cerr<<" ";} cerr<<"]";}
-template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
-template <class T, class V> void _print(multimap <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";} 
-template <class T, class V> void _print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
-/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
-
-void solve()
-{
-    int n,ans=0;
-    string s;
-    cin>>n>>s;
-    for(auto c:s)
-    {
-    	if(c=='+')
-    		ans++;
-    	else
-    		ans--;
-    }
-    cout<<abs(ans)<<endl;
-}
-
-int32_t main()
-{
-    FAST_IO;
-    int TC = 1;
-    cin >> TC;
-    while (TC--) 
-        solve();
-}