code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
// “Alhamdulillah for Everything”
#include<bits/stdc++.h>
using namespace std;
//---------DEFINES------------
#define pai acos(-1)
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define mp... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
cin >> a >> b >> c;
if(a==b)
{
cout << c << endl;
}
else if(b==c)
{
cout << a << endl;
}
else if(c==a)
{
cout << b << endl;
}
else
{
cout << 0 << endl;
}
return 0;
} |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
#define pb(a) push_back(a)
#define set0(a) memset(a,0,sizeof(a))
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define dwn(i,a,b) for(int i=(a);i>=(b);i--)
#define INF 0x3f3f3f3f
typedef long long ll;
int main(){
int T; cin>>T;
while(T--){
ll n... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll t, n;
scanf("%lld", &t);
while (t--) {
scanf("%lld", &n);
if (n%2==1) {
printf("Odd\n");
}
else {
if (n % 4 == 2) {
printf("Same\n");
}
else {
printf("Even\n");
}
}
}
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll b,c,ans;
ll solve1(ll b,ll c){
ll depth=c/2,flip=c&1;
if(depth<b)return (1+depth)*2-(!flip);
else return b*2+1;
}
ll solve2(ll b,ll c){
ll depth=c/2,flip=c&1;
return max(ll(0),depth*2-(!flip));
}
int main(){
scanf("%lld%lld... | //wtrl,everybody hangbeat me
#include<bits/stdc++.h>
/*#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<queue>
#include<vector>
#include<stack>
#include<sstre... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
double EPS=1e-9;
int INF=1000000005;
long ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long
#define all(x) x.begin(),x.end()
#define MOD 1000000007
#define PI acos(-1)
#define EPS 1e-9
#define debug cerr <<
#define var(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define close << "\n";
int total_n... |
/* ** ** ****** ****** ****** ** ****** ***
** ** ** ** ** ** ** ** ** ** ** *********
**\../** ****** ****** ** ** ****** ** ** ***
** ** ** ** ** ** ** ** ** ** ** ** *****
** ** ** ** ** ** ** ****** ****** ****** *****
*/
#include <bits/stdc+... | #include <bits/stdc++.h>
#define N 200005
#define int long long
using namespace std;
void solve(){
int n;
cin >> n;
vector<pair<int,int>> v;
for(int i=0;i<n;i++){
int t,l,r;
cin >> t >> l >> r;
l *=2;
r *=2;
if(t == 2 || t == 4)r--;
if(t == 3 || t == 4)... |
#include <bits/stdc++.h>
using namespace std;
#define FOR(it, ar) for(auto &it: ar)
#define loop(i, start, end) for(auto i = (start); i <= (end); i++)
#define loopSkip(i, start, end, skip) for(auto i = (start); i <= (end); i += skip)
#define loopRev(i, start, end) for(int i = (start); i >= (end); i--)
#define FLASH i... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
bool testcase(){
ll n;
cin>>n;
vector<ll> arr;
for(int i=0;i<n;++i){
ll temp;
cin>>temp;
arr.push_back(temp);
}
sort(arr.begin(),arr.end());
for(int i=0;i<n-1;++i){
if(abs(arr[i]-arr[i+1])!=1)
return false;
}
return true;
}
i... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int,int>;
#define ff first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
const int mod = 1e9+7;
const int inf = 1e9;
const int mx = 1e6+5;
int n; string s;
void solve(int cs){
// cout << "Case " << c... | #include <algorithm>
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <cmath>
using namespace std;
using ll = long long;
using ull = unsigned long long;
constexpr ll LLINF {1001002003004005006};//ll = 9*LLINF
constexpr int INTINF {1000000000};//int = 2*INTINF
#define rep(i,n) for(in... |
#include <cstdio>
int main() {
char a = getchar(), b = getchar(), c = getchar();
if(a == b && a == c) puts("Won");
else puts("Lost");
return 0;
} | #include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <algorithm>
#include <iomanip>
#include <string.h>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
typedef long long lint;
usi... |
#include<bits/stdc++.h>
//#pragma GCC optimize "trapv"
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
#define fast_az_fuk ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long
#define lll __int128
#define ull u... |
#include<bits/stdc++.h>
#include<iomanip>
using namespace std;
#define REP(i,n) for(int i = 0;i < n;i++)
#define RNG(i,s,n) for(int i = s;i <= n;i++)
#define _RNG(i,e,s) for(int i = e;i >= s;i--)
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define dup(x,y) (x + y - 1) / (y)
#define all(x) (x).beg... |
/**
* author: akifpathan
* created: Monday 10.05.2021 06:02:17 PM
**/
#ifdef akifpathan
#include "debug.h"
#else
#include<bits/stdc++.h>
using namespace std;
#define debug(x...)
#endif
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
//mt19937_64 rng(chrono::s... | #include <bits/stdc++.h>
int main(){
std::string s1, s2, s3;
std::cin >> s1 >> s2 >> s3;
std::map< int, int > mp;
std::vector< int > s1v(s1.size());
std::vector< int > s2v(s2.size());
std::vector< int > s3v(s3.size());
for(int i=0; i<s1.size(); i++){
auto itr = mp.fin... |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007 // 998244353
#define INFLL (1LL<<62)
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define all(v) v... | //#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
//#pragma GCC target("avx,avx2")
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//# include <x86intrin.h>
# include <bits/stdc++.h>
# include <ext/pb_ds/assoc_container.hpp>
# include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
us... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(a) a.begin(),a.end()
using namespace std;
using ll=long long;
using P=pair<int,int>;
template<typename T>
using v=vector<T>;
template<typename T>
using vv=vector<v<T>>;
template<typename T>
using vvv=vector<vv<T>>;
int main(){
int n;... | #include<bits/stdc++.h>
using namespace std;
const int N=4e5+7;
typedef long long LL;
struct str{
int v,x;
}p[N];
bool operator <(str a,str b){
return a.v>b.v;
}
set<int> S;
int main()
{
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)S.insert(i);
for(int i=1;i<=n;i++)scanf("%d",&p[i].v),p[i].x=n-i+1;
for(int i=1;i<... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxm=2e6+5;
char s[maxm];
char t[maxm];
int n;
signed main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin>>n;
cin>>(s+1);
cin>>(t+1);
vector<int>pos;
for(int i=1;i<=n;i++){
s[i]-='0',t[i]-='0';
if(... | //ABC 182 C - To 3
//题目地址：https://atcoder.jp/contests/abc182/tasks/abc182_c
#include <stdio.h>
#include <stdint.h>
#include <inttypes.h>
int main() {
int64_t n;
scanf("%" SCNd64, &n);
int cnt[3] = { 0 };
while (n) {
cnt[n % 10 % 3]++;
n /= 10;
}
int cur = (cnt[1] + 2 * cnt... |
#pragma region RegionDefs
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0,i##_len=(n);i<i##_len;++i)
#define reps(i,l,r) for(int i=(l),i##_len=(r);i<i##_len;++i)
#define repr(i,l,r) for(int i=(r)-1,i##_left=(l);i>=i##_left;--i)
#define all(x) begin(x),end(x)
using namespace std;
typedef long long ll;
const ll INF... | // #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <cmath>
#include <iomanip>
#include <numeric>
#define ll long long int
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define drep(i, n) for(ll i = ((ll)(n)... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(long long N, std::vector<long long> A, std::vector<long long> B){
ll ma = 0;
ll mi = 1e9;
for(int i = 0;i < N;i++){
ma = max(A[i], ma);
mi = min(B[i], mi);
}
cout<<max(mi - ma + 1, 0LL)<<endl;
}
int ma... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N = 100100;
const int mod = 1000000007;
ll v[100];
int main()
{
ll n;
cin >> n;
ll z = 1;
ll minn = n;
for(int i = 1; i <= 61; i++){
z = z*2;
if(n < z){
break;
}
ll k = n / z;
ll x = k + i + (n-k*z);
minn = min(minn,x)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair <int, int> pin;
const int N = 4e5 + 5;
const int Maxn = 4e5;
const ll P = 998244353LL;
int n, m;
ll fac[N], ifac[N];
template <typename T>
inline void read(T &X) {
char ch = 0; T op = 1;
for (X = 0; ch > '9' ... |
#include <iostream>
#include <vector>
using namespace std;
template <class T>
T gcm(T a, T b) {
if (a < b) {
T w = a;
a = b;
b = w;
}
while (b != 0) {
T w = a % b;
a = b;
b = w;
}
return a;
}
int main() {
vector<long long> p = { 2, 3, 5, 7, 11... | #include <cstdio>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
const int N=505;
int n;
int a[N][N];
int diff[N];
int ans_a[N],ans_b[N];
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
scanf("%d",&a[i][j]);
bool flag=true;
for(int i=1;i<n;i++)
d... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
#define inf 0x3f3f3f3f3f3f3f3f
string s;
int dig[65];
ll pow(ll a, ll b) {
ll res = 1;
while(b) {
if(b & 1) res = res * a;
// if()
a = a * a;
}
return res;
}
int len;
ll m;
bool solve(ll r) {
ll sum = 0;
int f = 1;
... |
#include <bits/stdc++.h>
using namespace std;
long long n,k,a[10][10];
vector<int>sol={1,2,3,4,5,6,7,8};
int ans=0;
void solve(int i){
long long tmp=0;
for(int i=0;i<n;i++){
tmp+=a[sol[i]][sol[i+1]];
}
tmp+=a[sol[n-1]][1];
if(tmp==k)ans+=1;
tmp=0;
while(next_permutation(sol.begin(),sol.... | #include<iostream>
#include<algorithm>
using namespace std;
const int N = 1e5 + 10;
int n, x;
int a[N];
int main(){
cin >> n >> x;
for(int i = 0; i < n; i++) cin >> a[i];
int i = 0, j = 0;
while(j < n){
if(a[j] == x) j++;
else a[i++] = a[j++];
}
for(int k = 0; k < i; k++) cout... |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define PRINT(a) cout << (a) << endl
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ... | //author-micheal corleone
//the godfather
#include <bits/stdc++.h>
#include <set>
#include<algorithm>
#include <set>
#include<algorithm>
#define ll long long int
#define in(n) scanf("%lld",&n)
#define in2(a,b) scanf("%lld %lld",&a,&b)
#define out(n) printf("%lld\n",n)
#define inf 999999999999999999
#define endl "\n"
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(x) ((x).begin()), ((x).end())
#define READ(x) (cin >> (x))
#define WRITE_N(x) (cout << (x) << endl)
#define WRITE(x) (cout << (x))
#define WRITE_Y... | #include <bits/stdc++.h>
using namespace std;
const int N=105;
long long x;
int mem[N][N][N],vis[N][N][N],vid;
int arr[N];
int n,k;
int go(int ind,int rem,int remi)
{
if(ind>=n) return (rem==0&&remi==0?0:-(1<<30));
int &ret=mem[ind][rem][remi];
if(vis[ind][rem][remi]==vid) return ret;
vis[ind][rem][remi]=vid;
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int r, c;
cin >> r >> c;
vector<vector<ll>> a(r, vector<ll>(c - 1)), b(r - 1, vector<ll>(c));
for (int i = 0; i < r; i++) {
for (int j = 0; j < c - 1; j++) {
cin >> a.a... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define Rep(i,n) for(int i = 1; i <= n; i++)
#define sz(x) int(x.size())
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define YesorNo(a) printf(a ? "Yes\n" : "No\n")
#define debug(x) cerr << #x << ": " <<... |
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int n,m,tot,head[N];
long long dis[N];
bool vis[N];
struct Star
{
int to,nxt,c,d;
}edge[2*N];
void Lian(int x,int y,int z,int w)
{
tot++;
edge[tot].c=z;
edge[tot].d=w;
edge[tot].nxt=head[x];
edge[tot].to=y;
head[x]=tot;
}
struct Point
{
long long ... | /* -*- coding: utf-8 -*-
*
* e.cc: E - Rush Hour 2
*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<u... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
return (ull)rng() % B;
}
// 1-indexed
template<typename T>
struct BIT{
int n;
vect... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll; //int:2*10**9
typedef long double ld;
typedef pair<ll,ll> P;
#define REP(i,n) for(ll i = 0; i<(ll)(n); i++)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)
#define pb push_back
#define MOD 1000000007 //998244353... |
#include <bits/stdc++.h>
// #include <atcoder/all>
#include <cmath>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll INFI = 1001001001;
const ll INFL = 1001001001001001001;
const ll MOD = (int)1e9 + 7;
const double EPS = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, ... | #include <bits/stdc++.h>
template <class T>
inline void read(T &x) {
static char ch;
static bool opt;
while (!isdigit(ch = getchar()) && ch != '-');
x = (opt = ch == '-') ? 0 : ch - '0';
while (isdigit(ch = getchar()))
x = x * 10 + ch - '0';
if (opt)
x = ~x + 1;
}
template <class T>
inline void putint... |
#include <bits/stdc++.h>
//#include <cmath>
typedef long long ll;
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define mod 1000000007
//#define lld long double
#define mii map<int, int>
#define mci map<char, int>
#define msi map<string, int>
#define pii pair<int, int>... | /* -> Written by <-
-----------
|K_A_Z_A_M_A|
|___________|
| ___ |
| (^_^) |
| /( | )\ |
|____|_|____|
H O A N G
*/
#include <bits/stdc++.h>
#define Task ""
#define F first
#define S second
#define eb emplace_back
#define bit(x, i) ... |
#include<bits/stdc++.h>
using namespace std;
struct node{long long x,y;}f[200002];
long long n,a=0,b=0,cnt=0;
bool cmp(node x,node y){return 2*x.x+x.y>2*y.x+y.y;}
int main(){
scanf("%lld",&n);
for(int i=0;i<n;++i)scanf("%lld%lld",&f[i].x,&f[i].y),a+=f[i].x;
sort(f,f+n,cmp);
while(b<=a){b+=f[cnt].x+f[cnt... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;... |
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
bool cmp(pair<ll,ll> a, pair<ll, ll> b){
return (2*a.first+a.second) > (2*b.first+b.second);
}
int main(){
ll n, i, ans=0, ak=0, x, y;
cin>>n;
vector<pair<ll, ll>> vt;
for(i=0;i<n;i++){
cin>>x>>y;
vt.push_back({x, ... |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using ld = long double;
int main() {
ld a, b, c;
cin >> a >> b >> c;
ll X = round(a * 10000);
ll Y = round(b * 10000);
ll R = round(c * 10000);
vector<string> str;
ll ans = 0;
ll x_s = ceil((X-R)/10000.0)*10000;
ll x_e = floor((X+... | // {{{ by unolight
#include <bits/stdc++.h>
#include <unistd.h>
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC diagnostic ignored "-Wunused-function"
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x),end(x)
#define RALL(x) rbegin(x),rend(x)
#define REP(i,n) for ( int i=0; i<int(n); i++ )
#define REP... |
#include <iostream>
using namespace std;
int main() {
string str;
cin >> str;
int len = str.length();
for(int i = 0; i < len; i++) {
if(str[i] == '.') {
break;
} else {
cout << str[i];
}
}
cout << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
/*ll t ;
cin>>t;
while(t --) {
} */
ll n;
cin>>n;
if(n % 100 == 0) {
cout<<n / 100<<"\n";
}
else {
cout <<(n / 100) + 1<<"\n";
}
}
|
#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define ll long long
#define pp pair<ll, ll>
#define lb lower_bound
#define ub upper_bound
#define mk make_pair
#define pb push_back
#define llp(i, x, n) for (ll i = x; i < n; i++)
#define fr first
#define ss second
#... | #include <algorithm>
#include <iostream>
#include <vector>
int main() {
size_t n_num;
std::cin >> n_num;
std::vector<int64_t> nums(n_num);
for (auto &ele : nums) {
std::cin >> ele;
}
std::sort(nums.begin(), nums.end());
int64_t ans = 0;
int64_t delta = 0;
for (size_t i = 0; i < n_num; i++) {
... |
#include<bits/stdc++.h>
#define HAS_TEST_CASE 0
namespace rG{
typedef long long ll;
const int N=5e5;
int n,m,k,a[N+10];
char s[N+10];
inline void main(){
int a,b;
scanf("%d%d",&a,&b);
printf("%d\n",2*a+100-b);
}
} // namespace rG
int main(){
#if defined(LOCAL)&&HAS_TEST_CASE
freopen("tmp.out","w",stdout);
#... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
//template
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
using ll=long long int;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
template<typename T>inline bool ch... |
//include
//------------------------------------------
#include <string>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <complex>
#include <ss... |
/*/ Author : Abhishek Chauhan /*/
#include<bits/stdc++.h>
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
using namespace __gnu_pbds;
using namespace std;
// a+b = a^b + 2*(a&b)
// According to Fermat's little theorem, (a^b)%mod = ((a^(b%(mod - 1)))%mod) if mod is a pri... |
#include "bits/stdc++.h"
#define ll long long
#define lld long double
#define MOD 1000000007
#define inf 1000000000000000000LL
#define pii pair<ll,ll>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL);... | #include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#define ll long long
#define MAXN 300005
#define uns unsigned
#define INF 0x3f3f3f3f
#define MOD 1000000007ll
using namespace std;
inline ll read(){
ll x=0;bool f=1;char s=getchar(... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using oset = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
using int64 = long long;
void fastIO() {
ios_base::sync_with_stdio(fal... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
const int N=205;
int n,a[N];
vector<int>v,res1,res2;
vector<int>save[N];
bool flag;
void dfs(int cur,int sum){
sum%=200;
if(flag) return;
if(cur==n+1){
if(save[sum].size()&&v.size()){
flag=true;
res1=save[sum];
... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#define rep(i,begin, end) for (ll i = begin; i < (ll)(end); i++)
using namespace std;
using ll = long long;
template<typename T>
using vec2 = vector<vector<T>>;
template<typename T>
using vec3 = ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// ap + bq = gcd(a, b) なる (p, q) を求め d = gcd(a, b) を返す
ll extgcd(const ll a, const ll b, ll &p, ll &q){
if (b==0) { p=1; q=0; return a; }
ll d = extgcd(b, a%b, q, p);
q -= a/b * p;
return d;
}
// x mod s = a, x mod t = b なる x >= 0 の最小... |
#include <iostream>
using namespace std;
#define int long long
int gcd(int a,int b)
{
return b?gcd(b,a%b):a;
}
int LCM(int a, int b)
{
return a/gcd(a, b)*b;
}
signed main()
{
int n, m , s;
cin>>n;
s = 1;
for (int i = 2; i <=n; i++)
s = LCM(s, i);
s++;
cout<<s;
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,m,a,b=13,c,d,e,f,g,h,p,q,r,fr,sc,tr,sz=0,tz,i,j,k,mx=LLONG_MIN,mn=LLONG_MAX;
long long x=1,y=1,cnt=0,res=0,ans=1,sum=0; long long flg=0,flag=1,na=0,as=1;
vector<long long>u,v,w; vector< pair<long long,long long> >vct; vector... |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for (int i = a; i < b; i++)
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
typedef string str;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll... | #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
// const ll p = 998244353;
const ll nax = 100001;
int binpow(int a, int n, int p) {
if (!n) return 1;
if (n & 1) return binpow(a, n - 1, p) * a % p;
return binpow(a * a % p,... |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<string>
#include<functional>
#include<iomanip>
#define rep(i,n,m) for(int i=(n);i<(int)(m);i++)
#define reps(i,... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int inf=0x3f,INF=0x3f3f3... |
/**
* author: tomo0608
* created: 14.03.2021 17:00:40
**/
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include<atcoder/all>
using namespace atcoder;
#endif
typedef long long ll;
typedef long double ld;
template <class T> using V = vector<T>;
temp... | //#pragma GCC optimize("O3")
#include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define pb push_back
#define mp make_pair
#define mod 998244353
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define all(x) x.begin(),x.end()
#define F first
#define S second
#define fo(i,n) for(int i=0;i... |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
template<class A, class B>void tostring(pair<A, B>p) { cerr<<"(" + to_string(p.first) + ", " + to_string(p.second) + ")";}
template<class A>void tostring(A v) {int f = 1;string r = "{";for (auto& x : v) {if (!f) {r += ", ";}f = 0;r += to_string(x);}r += "}... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fastio ios_base::sync_with_stdio(0);cin.tie(0)
#define fp(i,a,b) for(ll i=a ; i<b ; i++)
#define fn(i,a,b) for(int i=a ; i>=b ; i--)
#define ones(x) __built... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, ans=0;
cin >> N;
vector<int> A(N);
for(int i=0;i<N;i++)
cin >> A.at(i);
for(int i=0;i<N;i++){
if(A.at(i) > 10)
ans += A.at(i) -10;
}
cout << ans << endl;
} | #include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int A[N], B[N];
for(int i=0; i<N; i++){
cin >> A[i];
}
for(int i=0; i<N; i++){
cin >> B[i];
}
int ans=0;
for(int i=0; i<N; i++){
ans+=A[i]*B[i];
}
if(ans==0){
cout << "Yes" ... |
#include<bits/stdc++.h>
using namespace std;
//main sample
//by six_sigma
#define fastio ios::sync_with_stdio(false);cin.tie(0);
#define ll long long int
//defining loops
#define lp0(i,a) for(i=0;i<a;i++)
#define lp1(i,a) for(i=1;i<=a;i++)
//defining file input output(T.N.T.I)
#define f_input freopen("input.txt","r",s... | #include <bits/stdc++.h>
using namespace std;
#define Rep(i,j,n) for(int i=j; i<n; i++)
#define rep(i,n) for(int i=0; i<n; i++)
#define PI 3.14159265359
#define INF 1000100100//0000000
#define MOD 1000000007
#define all(x) (x).begin(),(x).end()
typedef long long ll;
#define P pair<int, int>
//#define P pair<ll, ll>
//#... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr long long MOD = 1e9 + 7;
signed main() {
int n, m;
cin >> n >> m;
vector<pair<in... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
string S,T;
cin>>S>>T;
int ans=0;
vector<int>A,B;
for(int i=0,cnt=0;i<N;i++){
if(S[i]=='0')A.push_back(i);
if(T[i]=='0')B.push_back(i);
}
if(A.size()!=B.size()){
cout<<"-1\n";return 0;
}
for(int i=0;i<A.size();i+... |
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define For(i, a, b) for (ll i = (a); i <= (b); i++)
#define Forx(i, a, b, x) for (ll i = (a); i <= (b); i+=x)
#define debug(x) cout <<" || "<< #x << " is= " << x <<endl; //use for debug
#define read(a) ll a; cin >> a;
... | #include <iostream>
#include <algorithm>
#include <unordered_set>
#include <set>
#include <vector>
#include <queue>
#include <map>
#include <numeric>
#include <math.h>
using namespace std;
#define rep(i, n) for (long long int i = 0; i < (long long int)(n); i++)
#define irep(i, n) for (long long int i = 1; i <= (long ... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define fon(i,n) for(int i=0;i<n;i++)
#define fo(i,n) for(int i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<ll ,ll>
#define vii vector<int>
#define vll vector<ll>... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, m; cin >> n >> m;
vector<ll> a(m); for(int i = 0; i < m; i++) cin >> a[i];
sort(a.begin(), a.end());
a.insert(a.begin(), 0);
a.push_back(n+1);
vector<ll> v;
ll k = n;
for(int i = 0;... |
#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long int
#define mod 1000000007
#define FIO ios_base::sync_with_stdio(false);cin.tie(NULL);
int main() {
FIO;
int n;
cin>>n;
int l = 1;
int r = n;
int ans = -1;
while(l<=r){
long long mid = (l+r)/2;
... |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main() {
int N;
int maxA; int minB;
cin >> N;
vector<int>A(N); vector<int>B(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
for (int i = 0; i < N; i++) {
cin >> B.at(i);
}
maxA = *max_element(A.begin(),A.end());
minB ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double lxd;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
#define mem(dp, a) memset(dp, a, sizeof dp)
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
#defin... |
/*Rabbi Zidni Ilma*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define scl(n) scanf("%lld",&n)
#define scll(n,m) scanf("%lld %lld",&n,&m)
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define mod 1000000007
#define read freopen("input.txt","r",stdin)
#define write... | #include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
int ans = 0;
for(int i = 0; i < n; i++){
int d;
cin>>d;
if(d > 10){
ans += d - 10;
}
}
cout<<ans;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,i,k,t,ans=0;
cin>>n;
unordered_map<long long,long long> mp;
for(i=0; i<n; i++){
cin>>k;
t = k%200;
mp[t]++;
}
for(auto x : mp){
if(x.second>1){
for(i=1; i<x.second; i++){
ans = ans + i;
... | /*
** Author: Kartikey Tewari
** Time: 10-04-2021 13:06:53
*/
#include <bits/stdc++.h>
#define ll long long
#define mod (ll)998244353
using namespace std;
ll power (ll a, ll b)
{
ll ans=1;
while (b>=1)
{
if (b%2==1)
{
ans=(ans*a)%mod;
b--;
}
else
... |
#include<iostream>
#include<algorithm>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); i++)
int main() {
int n;
cin >> n;
const int INF = 1001001001;
int l = 0, r = INF;
rep(i, n) {
int a;
cin >> a;
l = max(l, a);
}
rep(i, n) {
int b;
c... | #include<bits/stdc++.h>
using namespace std;
#define all(x) sort(x.begin(),x.end())
#define int long long
#define pb push_back
#define pii pair<int,int>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define mod 1e9+7
#define inf 1e18
#define garou99 ios_base::sync_with_stdio(false); cin.tie(NULL);
int pow(int p,int r,int m){... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> using vt = vector<T>;
template<class T> using vvt = vector<vt<T>>;
template<class T> using ttt = tuple<T,T>;
using tii = tuple<int,int>;
using tiii = tuple<int,int,int>;
using vi = vector<int>;
#define rep(i,n) for(int i=0;i<(int)(n);i... | #pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-variable"
#include <iostream> // IO
#include <cmath> // sqrt, trig, ceil, log
#include <utility> // swap, pair
// #include <algorithm> // sort, binary search, reverse, merge
// #include <bitset>
// #include <cstdio>
// #include <cstdlib> //abs, at... |
#include <bits/stdc++.h>
using namespace std;
// Type alias
using ll = long long;
using ld = double;
using pi = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
using ti3 = tuple<int, int, int>;
using vi = vector<int>;
using vll = vector<ll>;
using vld = vector<ld>;
using vpi = vector<pi>;
using v... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define int ll
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vpii = vector<pii>;
using vvpii = vector<vpii>;
template<typename T, typename U>
ostream& operator<<(ostream& o, const pair<T,U>& p... |
#include <bits/stdc++.h>
#define lc (o<<1)
#define rc ((o<<1)|1)
#define PB push_back
#define MK make_pair
using namespace std;
#define DebugP(x) cout << "Line" << __LINE__ << " " << #x << "=" << x << endl
const int maxn = 5000 + 5;
const int modu = 998244353; // 1e9 + 7
const int inf = 0x3f3f3f3f;
const double eps = ... | #include <bits/stdc++.h>
using namespace std;
int n;
int a[505];
int ans[250005],len;
int p=1;
void doSwap(int pos) {
if(p%2==1) {
int x=rand()%2;
if(2*x+1==pos || 2*x+2==pos) {
x^=1;
}
swap(a[2*x+1],a[2*x+2]);
ans[++len]=2*x+1;
p++;
}else {
if(pos==2 || pos==3) {
swap(a[4],a[5]);
ans[++le... |
#include<iostream>
#include<algorithm>
#include<string>
#include<map>
#define rep(i, n) for(int i=0; i<n; i++)
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
if(n%2==0) cout << "White" << endl;
else cout << "Black" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ull unsigned long long
#define loops(i, s, n) for (ll i = s; i < (ll)n; i++)
#define loop(i, n) loops(i, 0, n)
#define ALL(a) a.begin(), a.end()
#define pub push_back
#define pob pop_back
#define mp make_pair
#define dump(... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define vint vector<int>
#define vll vector<ll>
#define vstr vector<string>
#define vvint vector<vector<int> >
#define vvll vector<vector<ll> >
#define vip vector<pair<int,int> >
#define v... | #include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long LL;
int n;
int a[105],dp[105][100005];
int main(){
cin>>n;
int sum=0;
for(int i=1;i<=n;i++)cin>>a[i],sum+=a[i];
dp[0][0]=1;
for(int i=0;i<n;i++)
for(int j=0;j<=sum;j++){
if(dp[i][j]){
... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
int n,k,u,v;
vector<int> adj[200002];
vector<int> leaf;
int cnt = 0;
bool vis[200002];
int dfs(int u , int t){
vis[u] = true;
int cur = 0;
int rec = 0;
for(int i=0;i<adj[u].size();i++){
if(!vis[adj[u][i]]){... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int vi[200001];
vector<int> g[200001];
ll A[200001], b[200001];
ll ans=-1000000001;
ll maxi[200001];
void predfs(int u)
{
vi[u]=1;
for(int j=0;j<g[u].size();j++)
{
int v=g[u][j];
if(!vi[v])
{
... |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
#define all(v) v.begin(),v.end()
#define run ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0);
#define mod 1000000007
#define decimal(n,k) cout<<fix... | #include<bits/stdc++.h>
using namespace std;
using Graph=vector<vector<int>>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
typedef long long ll;
int main(){
string X;
cin>>X;
string Y;
int N=X.size();
for(int i=0;i<N;i++){
if(X[i]=='.'){
break;
}
else{
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main(){
int n;
std::cin >> n;
ll ans=0;
rep(i,n){
ll a,b;
std::cin >> a>>b;
ll add=(a+b)*(b-a+1)/2;
ans+=add;
}
std::cout << ans << '\n';
return 0;
}
| #include<iostream>
using namespace std;
const int N=1e6+10;
int a[N];
int main(){
int n;
cin>>n;
int sum=0;
for(int i=0;i<n;i++){
cin>>a[i];
if(a[i]>10){
sum=sum+(a[i]-10);
}
}
cout<<sum;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int judge(int a,int b){
int c=a+b;
if(c>=15&&b>=8){
cout << 1 << endl;
}
else if(c>=10&&b>=3){
cout << 2 << endl;
}
else if(c>=3){
cout << 3 << endl;
}
else{
cout << 4 << endl;
}
return 0;
}
int main(){
int a,b;
cin >> a >> b;
jud... | #include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
inline void read(int& x){
static char c;
while(!isdigit(c=getchar()));x=c^48;
while(isdigit(c=getchar()))x=(x*10)+(c^48);
}
inline void read(ll& x){
... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=n... | #include <bits/stdc++.h>
using namespace std;
int main(){
char c;
bool o = 0, f = 0;
while((c = getchar()) > 64){
if(o != (c<97)){
f = 1;
break;
}
o = !o;
}
cout << (f? "No" : "Yes") << endl;
} |
#include <bits/stdc++.h>
using namespace std;
long long count_inward(long long B, long long C){
long long ans = 1;
if(C){
if(B > 0){
ans++;
}
if(B < 0){
B *= -1;
C--; ans++;
}
}
if(B == 0 or C == 0) return ans;
long long k = min(B-1, (C-1)/2);
ans += 2*k; C -= 2*k; B ... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int64 b, c;
cin >> b >> c;
int64 l1 = b - c / 2;
int64 u1 = b + max(c - 2, 0LL) / 2;
int64 l2 = -b - max(c - 1, 0LL) / 2;
int64 u2 = -b + max(c - 1, 0... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, S, D;
cin >> N >> S >> D;
vector<pair<int, int>> magic(N);
bool a = false;
for (int i = 0; i < N; i++) {
cin >> magic.at(i).first;
cin >> magic.at(i).second;
if(magic.at(i).first < S && D < magic.at(i).second)... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n[N];
int main(){
int a, b , c ,d;
cin >> a >> b >> c>>d;
cout << b -c;
}
|
#include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
using namespace std;
#pragma GCC optimize("O3","unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC target("avx2")
#define sync ios_base::sync_with_stdio(0); ci... | #include <bits/stdc++.h>
using namespace std;
// 型
#define ll int64_t // ll -> int64_t
using graph = vector<vector<int>>; // グラフ型
// for文
#define lp(i,n) for(int i=0;i<n;i++) // 変数 i をおいて n 回繰り返し
#define lp_(i,n) for(int i=0;i<=n;i++) // 条件に＝つき
#define lpp(i,n,m) for(int i=n;i<m;i++) // 開始と終... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define f first
#define s second
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll s,p;
cin >> s >> p;
for(ll i=1; i*i<=p; i++)
{
ll x = i , y = p/i;
if (x*y == p && ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define INF ((1LL<<62)-(1LL<<31))
typedef long long ll;
int main()
{
int n;
cin >> n;
vector<ll> c(n*n);
rep(i,n*n) cin >> c[i];
ll mi=INF,ni;
rep(i,n) {
if(mi>c[i*n]) {
mi=c[i*n];
... |
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#include <algorithm>
#include <iostream>
#include <bitset>
#include <vector>
#include <array>
using namespace std;
#define f(x,y,z) for(int x=y;x<=z;++x)
vector<int> v[200001];
int n, a, b, it;
array<int, 200001> jr, dlm, nmr;
bitset<200001> sdh;
void jrk(int x) {
... | #include <iostream>
using namespace std;
const int N = 400'009;
int p[N];
int find(int x) {
if (p[x] != x) {
p[x] = find(p[x]);
}
return p[x];
}
int sz[N];
int cycle[N];
int main() {
#ifndef LOCAL
cin.tie(0);
#endif
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 0; i < N; ++i) {
... |
#include<bits/stdc++.h>
using namespace std;
#define DONTSYNC ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL) //dont use stdio with iostream functions //input and output are out of order now!
#define TEST unsigned long long T; cin>>T; while(T--) //loop over each testcase
#define endl "\n"
#define for... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
... |
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+5;
const int mod=1e9+7;
int ans[N],parent[N];
vector<pair<int,int>>adj[N];
pair<pair<int,int>,int>edges[N];
int FindParent(int x)
{
if(parent[x] == x)return x;
return parent[x]=FindParent(parent[x]);
}
void DFS(int cur,int par)
{
int x,y;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define sf(x) scanf("%d",&x)
#define sfl(x) scanf("%lld",&x)
#define pf(x) printf("%d\n",x)
#define pfl(x) printf("%lld\n",x)
#define endl '\n'
#define... |
#include<bits/stdc++.h>
using namespace std;
template<typename T>inline T read(){
T x=0,f=0;char c=getchar();
while(!isdigit(c)) f=c=='-',c=getchar();
while(isdigit(c)) x=x*10+c-48,c=getchar();
return f?-x:x;
}
#define int long long
namespace run{
const int N=1e5+9;
int n,a[N],b[N],ans;
priority_queue<int> pq[2]... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#define rep(i,l,r) for(int i=(l);i<=(r);++i)
#define per(i,r,l) for(int i=(r);i>=(l);--i)
using namespace std;
typedef long ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
int main(){
int N;
cin >> N;
if (N%2 == 0){
cout << "White" << endl;
}
else cout << "Black" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin>>n;
if(n%2==0)
cout<<"White"<<endl;
else
cout<<"Black"<<endl;
return 0;
}
|
/* HAVE PATIENCE YOU CAN SOLVE EVERY QUESTION
JUST THINK*/
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
#include<bits/stdc++.h>
//#include <unordered_set>
//#include <unordered_map>
using namespace std;
int mod = 1000000007;
const double pi = 3.141592653689793238460;
const int inf =... | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define pii pair < int , int >
#define F first
#define S second
#define endl '\n'
#define int long long
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC optimize("Ofast,no-stack-protector,unro... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<double, double>;
using pld = pair<ld, ld>;
ll gcd(ll a, ll b)
{
while (b)
{
ll aux = b;
b = a % b;
... | // header {{{
// header {{{
using namespace std;
#include <bits/stdc++.h>
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
#define ASSERT(expr...) assert((expr))
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = ... |
//
// Created by yamunaku on 2020/10/24.
//
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define repl(i, l, r) for(int i = (l); i < (r); i++)
#define per(i, n) for(int i = ((n)-1); i >= 0; i--)
#define perl(i, l, r) f... | #include <bits/stdc++.h>
#define mk make_pair
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
int main(){
int n, m;
while(cin>>n>>m){
if(m<0 || (m>=n-1 && m!=0)){
printf("-1\n");
}
else{
if(m>0){
int tmp = ... |
// #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define dd double
#define ld long double
#define sl(n) scanf("%lld", &n)
#define si(n) scanf("%d", &n)
#define sd(n) scanf("%lf", &n)
#d... | #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,avx512f,avx512bw,avx512bitalg")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
usi... |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#define for0(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define forc(i, l, r) for (int i = (int)(l); i <= (int)(r); ++i)
#define f... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define sz(x) ((int)(x).size())
#define endl "\n"
#define fastio ios_base::sync_with_stdio(false); cin.tie(nullptr);
#define all(x) x.begin(),x.end()
#define y1 omg
#define INF 1000000010
#define FOR(x, n) for(int x=0;... |
#include <bits/stdc++.h>
using namespace std;
void printmat(const vector<vector<int>>& mat) {
for (auto row : mat) {
for (int elem : row)
cout << elem << " ";
cout << endl;
}
}
void printv(const vector<long long>& v) {
for (int elem : v)
cout << elem << " ";
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string inp;
cin >> inp;
string ans = "";
for(int i = 0; i < inp.length(); i++){
if(inp[i] == '.'){break;}
else{ans = ans + inp[i];}
}
cout << ans;
} |
#include<bits/stdc++.h>
#define ll long long
#define mxn 200002
#define mod 1000000007ll
using namespace std;
ll mem[mxn][17][2], n, k;
char str[mxn];
ll dp1(int pos, int rem, bool f)
{
if(pos==0)return (rem==0);
ll ret= mem[pos][rem][f];
if(ret!=-1)return ret;
ret= 0;
if(f)
{
ret= (k-r... | #define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <stack>
#include <vector>
#include <queue>
#include <map>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
#define REP(i,n) for(int i = 0; i < (int)n; i++)
#defin... |
#include<bits/stdc++.h>
using namespace std;
using ll=int64_t;
template<class T,class U> inline bool chmin(T&x,U y){if(x>y){x=y;return true;}return false;}
template<class T,class U> inline bool chmax(T&x,U y){if(x<y){x=y;return true;}return false;}
void solve(){
string s;
cin>>s;
if(s.length()==1){
... | //#pragma GCC optimize ("Ofast")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops")
//#include <x86intrin.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
#define PI 3.141592653589793L
#define FAST ios::sync_with_stdio(false); cin.tie(NULL);... |
#include <cstdio>
const int maxn = 1e6 + 100;
struct node
{
int to,next,lab;
}E[maxn];
int n,m,head[maxn],tot,col[maxn];
inline void add(int x,int y,int lab) { E[++tot].next = head[x],E[tot].to = y,E[tot].lab = lab,head[x] = tot; }
void dfs(int u)
{
for(int p = head[u],v;p;p=E[p].next)
{
if(col[v = E[p].to]) conti... | //#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define pb push_back
template<typename T>
class SegTree {
int n; // 葉の数
vector<T> data; // データを格納するvector
... | #pragma GCC target ("avx2")
//#pragma GCC optimize "trapv"
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#define input(a,n) for(ll i1=0;i1<n;i1++)cin>>a[i1]
#define ll long long
#define pi 2 * acos(0.0)
#define usll unordered_set<ll>
#define sll set<ll>
#define vll v... |
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
using ll = long long;
#define print(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
//ax + by = gcd(a, b) ���� x, y ��Ԃ�
ll e... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pint;
typedef pair<ll,ll> pll;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<pint> vpint;
typedef vector<pll> vpll;
#define vint2(v,n,m,init) vector<vector<int>> v(... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define FORR(i, m, n) for (int i = (m); i >= (n); i--)
#define REP(i, n) FOR(i, 0, (n))
#define REPR(i, n) FORR(i, (n) - 1, 0)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define FOR... | #include<bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#endif
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef std::vector<vector<int> > vv... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0;i < n; i++)
using ll = long long;
using P = pair<int,int>;
const ll INF = 1e18;
const int MX = 2005;
int main() {
string s1,s2,s3;
cin >> s1 >> s2 >> s3;
int l1 =s1.size();
int l2 =s2.size();
int l3 =s3.size();
ll n1,... | #include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
using namespace std;
using ll = long long;
int n;
int st[10], val[256];
string a, b, c;
bool dfs(int i, int car);
bool search(char c, int i, int car) {
for(int j = 0; j < 10; ++j) if(!st[j]) {
st[j] = c;
val[c] = j;
if(dfs(i, car)) return... |
#include <bits/stdc++.h>
#define N 100
using namespace std;
using ll = long long;
ll nck[N][N];
int main() {
ios_base::sync_with_stdio(false); cin.tie(nullptr);
for (int i=0; i<N; i++) {
nck[i][0] = 1;
for (int j=1; j<=i; j++) {
nck[i][j] = nck[i-1][j-1] + nck[i-1][j];
}
}
ll a, b, k; cin>>a>>b>>k; --k... | #include <bits/stdc++.h>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ld long double
#define ll long long
using namespace std;
#define MOD 1000000007
ll gcd(ll a, ll b) {
if (b == 0) return a;
if (a == 0) return b;
return gcd(b, a % b);
}
ll calc(ll n, ll a, ll b) {
bool doneA[a + 1], ... |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n, k;
cin >> n >> k;
for(int i = 0; i < k; i++){
if(n % 200 == 0){
n = n / 200;
}else{
n = n * 1000 + 200;
}
}
cout << n << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int N,X,i;
cin >> N >> X;
char c;
for(i = 0;i < N;i++){
cin >> c;
if(c == 'o') X+=1;
else X = max(0,X - 1);
}
cout << X << endl;
}
|
// Created by ...
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define rep(i,a,b) for(int i=a; i<b; i++)
#define repe(i,a,b) for(int i=a; i<=b; i++)
#define ll long long
#define ui unsigned int
#define pb push_back
#define deb(x) cout << #x << '=' << x << endl
#define deb2(x,y) cout << #x << '=' <... | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define fastio ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define pb push_back
#define pf push_front
#define mp make_pair
#define mod 1000000007
#define vll vector<ll>
#define inf 3e15 +7
#define pll pair<ll,ll>
#define ff first
#define ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const long long INF = (1LL<<62);
using Graph = vector<vector<int>>;
using LLPair = pair<LL, LL>;
using WeightedGraph = vector<vector<LLPair>>; //(対向頂点、コスト)
using PriorityQ = priority_queue<LLPair, vector<LLPair>, greater<LLPair>>;
void dijkstra(Weig... | #include <algorithm>
#include <array>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define ll long long
#define pii std::pair<int, int>
#define pdd std::pair<double, double>
#define INF (1LL << 33)
#d... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,srt,end) for(ll i = (srt); i < (ll)(end); i++)
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5;
//cout << std::fixed << std::setprecision(15) << y << endl;
// For debug
// Ref: https://qiita.com/ysuzuki19/items/d89... | // Problem: D - Staircase Sequences
// Contest: AtCoder - AtCoder Beginner Contest 190
// URL: https://atcoder.jp/contests/abc190/tasks/abc190_d
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#de... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
constexpr ll INF = 1e18+7;
int n, a[105];
ll x, dp[2][105][105], ans = INF;
int main(){
scanf("%d%lld", &n, &x);
rep(i,n) scanf("%d", a+i);
for(int i=1; i<=n; i++){
fill(dp[0][0], dp[1][n], -INF);
dp[1][... | /*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
*$* WRITER:kakitamasziru/OxOmisosiru *$*
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#ifdef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <stdio.h>
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algori... |
#include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &t) {
t=0; char ch=getchar(); int f=1;
while (ch<'0'||ch>'9') { if (ch=='-') f=-1; ch=getchar(); }
do { (t*=10)+=ch-'0'; ch=getchar(); } while ('0'<=ch&&ch<='9'); t*=f;
}
typedef long long ll;
const int mod=998244353;
int n,m,K;
char s[1... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using ll = long long;
using ld = long double;
#define FOR(i, a, b) for(ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) FOR(i, 0, n)
#define rFOR(i, a, b) for(ll i = (ll)(a - 1); i >= (ll)(b); i--)
#define rrep(i, a) rFOR(i, a, 0)
#define pb push_back
using namespace... |
#include<iostream>
using namespace std;
int main() {
int n;
cin >> n;
double x[n], y[n];
for (int i = 0;i < n;i++) {
cin >> x[i] >> y[i];
}
int flag = 0;
for (int i = 0;i < n - 2;i++) {
for (int j = i + 1;j < n - 1;j++) {
for (int k = j + 1;k < n;k++) {
if (x[i] == x[j]) {
if (x[i] == x[k]) {
... | //clear adj and visited vector declared globally after each test case
//check for long long overflow
//Mod wale question mein last mein if dalo ie. Ans<0 then ans+=mod;
//Incase of close mle change language to c++17 or c++14
/**#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unro... |
#include <bits/stdc++.h>
using namespace std;
void hoge(int a, int b) {
if (a>b) {
cout << ">" << endl;
} else if (a<b) {
cout << "<" << endl;
} else {
cout << "=" << endl;
}
return;
}
int main() {
int A, B, C;
cin >> A >> B >> C;
// cout << pow(A,C) << endl;
// cout << pow(B,C) << end... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vcc = vector<vc>;
using Pii = pair<int,int>;
using ld = long double;
#define rep(i,n) for(int i... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef map<int,int> mii;
typedef vector<int> vi;
typedef vector<vector<int>> vii;
typedef vector<long long> vl;
typedef vector<vector<ll>> vll;
typedef vector<bool> vb;
typede... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
... |
/*
/+===================================================+\
//+---------------------------------------------------+\\
|.|\\...>>>>>>> Hollwo_Pelw's 2nd template<<<<<<<...//|.|
\\+---------------------------------------------------+//
\+===================================================+/
*/
#include <bits/stdc++.h>
u... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, h;
cin >> n >> h;
if(h % n == 0)
cout << "Yes";
else
cout <<"No";
}
|
#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << '(' << ... | #include <bits/stdc++.h>
#define DEBUG if(0)
#define lli long long int
#define ldouble long double
using namespace std;
const int maxX = 72, maxPrimes = 20;
bool notPrime[maxX + 1];
vector<lli> primes;
const int maxN = 72;
lli a, b; int n;
int primesMask[maxN + 1];
lli memo[maxN + 1][1LL << maxPrimes];
lli solve(int ... |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#i... | // clang-format off
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#ifndef godfather
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,av... |
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target("avx2")
// 293206GT
#include <array>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <climits>
#include <limits>
#include <set>
#include <map>
#include <queue>
//#include <unordered_map>
//#include... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i,s,n) for(int i = s; i < (int)(n); i++)
int main() {
string s;
cin >> s;
deque<char>deq;
int rc = 0;
rep(i, 0, s.size()) {
if (s[i] == 'R') rc++;
else {
if (rc % 2 == 0) deq.push_back(s[i]);
else d... |
// Template
#include "bits/stdc++.h"
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep3(i, l, r) for (int i = (int)(l); i < (int)(r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define per(i, n) for (ll i = (ll)(n) - 1; i >= 0; ... | #include<bits/stdc++.h>
using namespace std;
template<class T> void chmin(T &a,T b){if(a>b) a=b;};
int main(){
int N;cin>>N;
vector<long> x,y,z;
for(int i=0;i<2*N;i++){
long a;char c;cin>>a>>c;
if(c=='R') x.push_back(a);
if(c=='G') y.push_back(a);
if(c=='B') z.push_back(a);
}
int l,m,n,cnt;... |
#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <utility>
#include <queue>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <climits>
using namespace std;
#define MOD 1000000007
#define PI 3.1415926535897932384626433832... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mkp make_pair
#define mt make_tuple
#define ff first
#define ss second
#define M1 1000000007
#define M2 998244353
#define fl(i,a,b) for(ll i=a;i<b;i++)
#define bfl(i,a,b) for(ll i=b-1;i>=a;i-... |
#include <bits/stdc++.h>
#define DEBUG if(0)
#define lli long long int
#define ldouble long double
using namespace std;
const int maxN = 5e3; int n, m, k;
char mat[maxN][maxN + 1];
const lli mod = 998244353;
lli base;
lli solve1(int i = 0, int j = 0)
{
if (i >= n || j >= m) return 0;
if (i == n - 1 && j == m - 1... | #include<bits/stdc++.h>
#define For(i,j,k) for (int i=(int)(j);i<=(int)(k);i++)
#define Rep(i,j,k) for (int i=(int)(j);i>=(int)(k);i--)
#define pii pair<int,int>
#define fi first
#define se second
#define PB push_back
#define ll long long
#define ull unsigned long long
#define pll pair<ll,ll>
#define y1 orzkcz
using n... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.