added 1931 A,B,C
This commit is contained in:
ShazidMahsrafi
parent
3995a93c00
commit
67ae4f0afe
75
Codes/1931 A - Recovering a Small String/1931A.cpp
Normal file
75
Codes/1931 A - Recovering a Small String/1931A.cpp
Normal file
@ -0,0 +1,75 @@
|
||||
#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;
|
||||
cin>>n;
|
||||
int first = max(1ll,n-52);
|
||||
int second = max(1ll,n-first-26);
|
||||
int third = max(1ll,n-first-second);
|
||||
cout<<char(first+'a'-1)<<char(second+'a'-1)<<char(third+'a'-1)<<endl;
|
||||
}
|
||||
|
||||
int32_t main()
|
||||
{
|
||||
FAST_IO;
|
||||
int TC = 1;
|
||||
cin >> TC;
|
||||
while (TC--)
|
||||
solve();
|
||||
}
|
||||
85
Codes/1931 B - Make Equal/1931B.cpp
Normal file
85
Codes/1931 B - Make Equal/1931B.cpp
Normal file
@ -0,0 +1,85 @@
|
||||
#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;
|
||||
cin>>n;
|
||||
vector<int>v(n);
|
||||
int net=0;
|
||||
for(auto &i:v) cin>>i,net+=i;
|
||||
int x=net/n, r=0;
|
||||
for(int i=0; i<n; ++i)
|
||||
{
|
||||
if(r+v[i]<x)
|
||||
{
|
||||
no;
|
||||
return;
|
||||
}
|
||||
r = v[i]+r-x;
|
||||
}
|
||||
yes;
|
||||
}
|
||||
|
||||
int32_t main()
|
||||
{
|
||||
FAST_IO;
|
||||
int TC = 1;
|
||||
cin >> TC;
|
||||
while (TC--)
|
||||
solve();
|
||||
}
|
||||
80
Codes/1931 C - Make Equal Again/1931C.cpp
Normal file
80
Codes/1931 C - Make Equal Again/1931C.cpp
Normal file
@ -0,0 +1,80 @@
|
||||
#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;
|
||||
cin>>n;
|
||||
vector<int>v(n);
|
||||
for(auto &i:v) cin>>i;
|
||||
int i=0, j=n-1, left=0, right=0;
|
||||
while(i<n && v[i]==v[0]) i++,left++;
|
||||
while(j>=0 && v[j]==v[n-1]) j--,right++;
|
||||
if(v[0]==v[n-1])
|
||||
cout<<max(0LL, n-left-right)<<endl;
|
||||
else
|
||||
cout<<min(n-left,n-right)<<endl;
|
||||
}
|
||||
|
||||
int32_t main()
|
||||
{
|
||||
FAST_IO;
|
||||
int TC = 1;
|
||||
cin >> TC;
|
||||
while (TC--)
|
||||
solve();
|
||||
}
|
||||
@ -277,6 +277,9 @@ This repository contains my solutions of Codeforces problems. They are in C++ la
|
||||
| 265 | 1927 E | Klever Permutation | [Question](https://codeforces.com/problemset/problem/1927/E) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1927%20E%20-%20Klever%20Permutation)
|
||||
| 266 | 1928 A | Rectangle Cutting | [Question](https://codeforces.com/problemset/problem/1928/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1928%20A%20-%20Rectangle%20Cutting)
|
||||
| 267 | 1928 B | Equalize | [Question](https://codeforces.com/problemset/problem/1928/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1928%20B%20-%20Equalize)
|
||||
| 268 | 1931 A | Recovering a Small String | [Question](https://codeforces.com/problemset/problem/1931/A) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1931%20A%20-%20Recovering%20a%20Small%20String)
|
||||
| 269 | 1931 B | Make Equal | [Question](https://codeforces.com/problemset/problem/1931/B) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1931%20B%20-%20Make%20Equal)
|
||||
| 270 | 1931 C | Make Equal Again | [Question](https://codeforces.com/problemset/problem/1931/C) | [Solution](https://github.com/ShazidMashrafi/Codeforces-Solutions/tree/master/Codes/1931%20C%20-%20Make%20Equal%20Again)
|
||||
|
||||
|
||||
|
||||
|
||||
Loading…
Reference in New Issue
Block a user