added 1915 (A-D)
This commit is contained in:
ShazidMahsrafi
parent
8c4ccc5a2f
commit
802ce4451b
71
Codes/1915A Odd One Out/1915A.cpp
Normal file
71
Codes/1915A Odd One Out/1915A.cpp
Normal file
@ -0,0 +1,71 @@
|
||||
#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 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,c;
|
||||
cin>>a>>b>>c;
|
||||
cout<<(a^b^c)<<endl;
|
||||
}
|
||||
|
||||
int32_t main()
|
||||
{
|
||||
FAST_IO;
|
||||
int TC = 1;
|
||||
cin >> TC;
|
||||
while (TC--)
|
||||
solve();
|
||||
}
|
||||
90
Codes/1915B Not Quite Latin Square/1915B.cpp
Normal file
90
Codes/1915B Not Quite Latin Square/1915B.cpp
Normal file
@ -0,0 +1,90 @@
|
||||
#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 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()
|
||||
{
|
||||
vector<int>freq(3,0);
|
||||
for(int i=0; i<3; ++i)
|
||||
{
|
||||
string s;
|
||||
cin>>s;
|
||||
for(int j=0; j<3; ++j)
|
||||
{
|
||||
if(s[j]=='?')
|
||||
continue;
|
||||
else
|
||||
freq[s[j]-'A']++;
|
||||
}
|
||||
}
|
||||
for(int i=0; i<3; ++i)
|
||||
{
|
||||
if(freq[i]<3)
|
||||
{
|
||||
cout<<char(i+'A')<<endl;
|
||||
return;
|
||||
}
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
int32_t main()
|
||||
{
|
||||
FAST_IO;
|
||||
int TC = 1;
|
||||
cin >> TC;
|
||||
while (TC--)
|
||||
solve();
|
||||
}
|
||||
87
Codes/1915C Can I Square/1915C.cpp
Normal file
87
Codes/1915C Can I Square/1915C.cpp
Normal file
@ -0,0 +1,87 @@
|
||||
#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 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 << "]";}
|
||||
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
|
||||
|
||||
bool is_square(int num)
|
||||
{
|
||||
int x= sqrt(num);
|
||||
return x*x==num;
|
||||
}
|
||||
|
||||
void solve()
|
||||
{
|
||||
int n;
|
||||
cin>>n;
|
||||
int sum=0;
|
||||
for(int i=0; i<n; ++i)
|
||||
{
|
||||
int x;
|
||||
cin>>x;
|
||||
sum +=x;
|
||||
}
|
||||
if(is_square(sum))
|
||||
yes;
|
||||
else
|
||||
no;
|
||||
}
|
||||
|
||||
int32_t main()
|
||||
{
|
||||
FAST_IO;
|
||||
int TC = 1;
|
||||
cin >> TC;
|
||||
while (TC--)
|
||||
solve();
|
||||
}
|
||||
97
Codes/1915D Unnatural Language Processing/1915D.cpp
Normal file
97
Codes/1915D Unnatural Language Processing/1915D.cpp
Normal file
@ -0,0 +1,97 @@
|
||||
#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 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 << "]";}
|
||||
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
|
||||
|
||||
bool is_v(char ch)
|
||||
{
|
||||
return ch=='a' || ch=='e';
|
||||
}
|
||||
|
||||
void solve()
|
||||
{
|
||||
int n;
|
||||
string s,ans;
|
||||
cin>>n>>s;
|
||||
for(int i=0; i<n; i+=2)
|
||||
{
|
||||
if(i+3<n && is_v(s[i+3]))
|
||||
{
|
||||
ans.pb(s[i]);
|
||||
ans.pb(s[i+1]);
|
||||
ans.pb('.');
|
||||
}
|
||||
else
|
||||
{
|
||||
ans.pb(s[i]);
|
||||
ans.pb(s[i+1]);
|
||||
ans.pb(s[i+2]);
|
||||
ans.pb('.');
|
||||
i++;
|
||||
}
|
||||
}
|
||||
ans.pop_back();
|
||||
if(is_v(s[n-1]))
|
||||
ans.pop_back();
|
||||
cout<<ans<<endl;
|
||||
}
|
||||
|
||||
int32_t main()
|
||||
{
|
||||
FAST_IO;
|
||||
int TC = 1;
|
||||
cin >> TC;
|
||||
while (TC--)
|
||||
solve();
|
||||
}
|
||||
@ -221,6 +221,10 @@ This repository contains my solutions of Codeforces problems. They are in C++ la
|
||||
| 1914D | Three Activities | [Question](https://codeforces.com/problemset/problem/1914/D) | [Solution]
|
||||
| 1914E1 | Game with Marbles (Easy Version) | [Question](https://codeforces.com/problemset/problem/1914/E1) | [Solution]
|
||||
| 1914E2 | Game with Marbles (Hard Version) | [Question](https://codeforces.com/problemset/problem/1914/E2) | [Solution]
|
||||
| 1915A | Odd One Out | [Question](https://codeforces.com/problemset/problem/1915/A) | [Solution]
|
||||
| 1915B | Not Quite Latin Square | [Question](https://codeforces.com/problemset/problem/1915/B) | [Solution]
|
||||
| 1915C | Can I Square? | [Question](https://codeforces.com/problemset/problem/1915/C) | [Solution]
|
||||
| 1915D | Unnatural Language Processing | [Question](https://codeforces.com/problemset/problem/1915/D) | [Solution]
|
||||
| 1917A | Least Product | [Question](https://codeforces.com/problemset/problem/1917/A) | [Solution]
|
||||
| 1917B | Erase First or Second Letter | [Question](https://codeforces.com/problemset/problem/1917/B) | [Solution]
|
||||
|
||||
|
||||
Loading…
Reference in New Issue
Block a user