code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define pii pair<int, int>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define rfor(i, b, a) for(int i = b; i >= a; i--)
#define X first
#define Y second
#define pb push_back
#define DEBUG(x) cout << '>' << #x << ':' << x <... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<=b;++i)
#ifndef ONLINE_JUDGE
#define dbg(x...) do{cout << "\033[32;1m" << #x << "->" ; err(x);} while(0)
void err(){cout << "\033[39;0m" << endl;}
template<template<typename...> class T,typename t,typename... A>
void err(T<t> a,A... x){for (a... |
#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef pair<ll,ll> Pll;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
long long n, c;
cin >> n >> c;
map<int, vector<int>> m;
for (int i = 0; i < n; ++i) {
int a, b, ci;
cin >> a >> b >> ci;
m[a].push_back(ci);
m[b+1].push_back(-ci);
}
... |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
ll c[500][500];
int main() {
int n;
cin >> n;
r... | #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(a) int(a.size())
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define fin(a) { cout << a << endl; return 0; }
#define debug(a) { cerr << #a << ": " ... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define all(x) (x).begin(),(x).end()
using namespace std;
constexpr int INF = 1e9, MOD = 1e9 + 7;
constexpr int64_t LINF = 5e18, LMOD = 998244353;
// #include <atcoder/all>
// using namespace atcoder;
// const int dy[]={0,-1,0,1,1,-1,-1,1};
// const int dx[... | #include <bits/stdc++.h>
using namespace std;
int a,b,c;
double f[105][105][105],ans;
int main() {
cin>>a>>b>>c;
f[a][b][c]=1;
for(int i=0; i<100; i++) {
for(int j=0; j<100; j++) {
for(int k=0; k<100; k++) {
if (i && (i + j + k) > 0)
f[i + 1][j][k] += f[i][j][k] * (i) / (i + j + k);
if (j && (i + j... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
#define rep(i, n) for (int i=0; i<(n); ++i)
#define rrep(i, n) for (int i=0; i<=(n); ++i)
#define each(v, i) for (auto i : v)
#define pb push_back
#define sz (int)(x).size()
#define fi first
#define se second
#define maxs... | #include <stdio.h>
typedef long long ll;
int main(void) {
ll i, n, now, ans = 0, t;
scanf("%lld", &n);
for(i = 1; i <= n; ++i) {
t = 1;
now = i;
while(now) {
if(now % 8 == 7) {
t = 0;
break;
}
now /= 8;
}
now = i;
while(now) {
if(now % 10 == 7) {
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,a,b) for (int i = (a); i < (b); ++i)
#define erep(i,a,b) for (int i = (a); i <= (b); ++i)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),rend()
#define yn(bool) if(bool){cout<<"Yes"<<endl;}else{cout... | #include <iostream>
#include <cstring>
using namespace std;
int main() {
char s[100001];
cin>>s;
int n;
n=strlen(s);
for(int i=n-1;i>=0;i--){
if(s[i]=='6'){
cout<<'9';
}
else if(s[i]=='9'){
cout<<'6';
}
else{
cout<<s[i];
}
}
} |
#include<bits/stdc++.h>
#define ll long long
#define double long double
#define rep(i,n) for(ll i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define mod (ll)(1e9+7)
#define inf (ll)(3e18+7)
#define pi (double) acos(-1)
#define P pair<int,int>
#define PiP pair<int,pair<int,int>>
#define all(x) x.begin(),x.end... | // 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<map>
#include<cmath>
#include<list>
#include<queue>
#include<bitset>
#include<cstdio>
#include<vector>
#include<string>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#define ll long long
#define lbw 1000000009
#define inf 2147483647
using namespace std;
ll read(){ll ans=0,f=1;char ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define rep(i,n) for(ll i=0;i<(ll)n;++i)
int main(){
ll n;cin >> n;
ll ans = 0;
rep(i,n){
ll a,b;cin >> a >> b;
ans += b*(b+1)/2 - (a-1)*a/2;
}
cout << ans << endl;
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
constexpr int N = 5005;
constexpr long long MOD = 998244353;
int n, m, k;
vector< string> s;
long long dp[N][N];
long long power(long long a, int b) {
long long rv = 1;
while (b) {
if (b & 1) rv = rv * a % MOD;
(a *= a) %= MOD;
b /= 2;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
struct edge {int to, cost; };
int main(){
int h, w, n, m;
cin >> h >> w >> n >> m;
vector<vector<int>> mp1(h, vector<int>(w,0));
vector<vector<int>> mp2(h, vector<int>(w,0));
vector<P> a;
for(int i=0; i<n; i++){... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define LETS_GET_SCHWIFTY ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ff first
#de... | #include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double db;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tr... |
#include <bits/stdc++.h>
using namespace std;
typedef int_fast32_t int32;
typedef int_fast64_t int64;
const int32 inf = 1e9+7;
const int32 MOD = 1000000007;
const int64 llinf = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define POSSIBLE(n) cout << ((n) ?... | #include<cstdio>
#include<cstring>
#define N 300001
using namespace std;
bool chose[N];
int a[N],answer;
int n,left[N],right[N];
void dfs(int k)
{
if (k==n)
{
int num=1;
left[num]=1;
for (int i=1;i<n;i++)
{
if (chose[i])
{
right[num]=i;
left[++num]=i+1;
}
}
right[num]=n;
int ans=0;
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a, b;
cin >> a >> b;
auto f = [&](string s) {
int res = 0;
for (char c : s) res += c-'0';
return res;
};
int ans = max(f(a), f(b));
cout << ans << '\n';
return 0;
} | /**
*
* @Author : Sindys
* Language : C++
*/
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <queue>
#include <iomanip>
#include <map>
#include <set>
#include <limits>//numeric_limits<int>::max() ... numeric_limits<int>::min()
#include <cmath>
#include <bitset>
#include <tuple>
#... |
#include <bits/stdc++.h>
using namespace std;
constexpr int N = 2e5 + 100;
int n, q;
int fa[N], clas[N];
map<int, map<int, int>> son_num;
int Find(int x) {
// return fa[x] == x ? fa[x] : fa[x] = Find(fa[x]);
if (fa[x] == x) return fa[x];
else return fa[x] = Find(fa[x]);
}
void Union(int x, int y) {
x... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
inline int read() {
int x = 0, f = 1; char c = getchar();
while (!isdigit(c)) { if (c == '-') f = - f; c = getchar(); }
while (isdigit(c)) x = x * 10 + (c ^ 48), c = getchar();
return x * f;
}
const int inf = 1e9 + 1e7, N = 2e5 + 1... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int (i) = 0; (i) < (int)(n); (i)++)
int N, K;
vector<pair<long long, long long>> AB;
long long solve() {
long long tmp = 0;
long long balance = K;
rep(i, N) {
long long A = AB[i].first; long long B = AB[i].second;
if (A >... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, start, n) for (int i = start; i < (n); i++)
using ll = long long;
int main()
{
int N;
cin >> N;
string S;
string T;
cin >> S >> T;
int Szero = 0;
int Tzero = 0;
rep(i,0,N){
if(S.at(i) == '0') Szero++;
if(T.at... |
#include <iostream>
int main(){
int A, B, W, Wg;
int min=1000001, max=0;
std::cin >> A >> B >> W;
Wg = W * 1000;
for (int i = 1; i <= 1000000; i++) {
if ((A * i <= Wg) && (B * i >= Wg)) {
if (i < min) min = i;
if (i > max) max = i;
}
}
if (min == 2001 ... | /*
As fire is shrouded in smoke, a mirror by dust and a child by the womb,
so is the universe enveloped in desire.
It is the wise man’s constant enemy; it tarnishes the face of wisdom.
It is as insatiable as a flame of fire.
It works through the senses, the mind and the reason;
and with their ... |
#line 1 "c.cpp"
#pragma region Macros
#include <bits/stdc++.h>
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... | // Problem: C - Max GCD 2
// Contest: AtCoder - Japanese Student Championship 2021
// URL: https://atcoder.jp/contests/jsc2021/tasks/jsc2021_c
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
// Problem: C. The Sports Festival
// Contest: Codeforces - Codeforces Round ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL);
int A[3];
for (int i = 0; i < 3; ++i)
cin >> A[i];
sort(A, A + 3);
if (A[0] + A[2] - 2 * A[1] == 0)
cout << "Yes\n";
else
cout << "No\n";
}
| #include <iostream>
#include <string>
#include <math.h>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <set>
#include <queue>
#include <deque>
#include <map>
#include <stack>
#include <cmath>
#include <stdio.h>
using namespace std;
#define mod 1000000007
#define mod2 998244353
#define ten5 100005
#... |
//================code===================//
//#define TLE
#ifdef TLE
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#endif
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <ctime>
#include <random>
#include <chrono>
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n - 1; i >= 0; i--)
#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 SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#de... |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#include <utility>
#include <iomanip>
#include <... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<string.h>
#include<stdint.h>
#include<queue>
using namespace std;
void _setup()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
}
int main() {
_setup();
int a;
cin >> a;
int res = a * 108 / 100;
if(res < 206) cout << "Yay!\n";
... |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define MOD9 998244353
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
template<class T> bool chmax(T &x, const T &y){if (x < y) {x = y; return true;} return false;}
template<class T> bool chmin(T &x, const T &y){if (x > y) {x = y; return ... | #include <bits/stdc++.h>
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<x<<endl
using namespace std;
using ll = long long;
const ll MOD = 1e9+7; // 998244353
const ll LINF = LLONG_MAX; // ~ 10^18 ~ 1<<60
const int INF = INT_MAX;
const doub... |
#include <bits/stdc++.h>
using namespace std;
int main(){
cout << fixed << setprecision(20);
int K;
cin >> K;
string S;
cin >> S;
string T;
cin >> T;
vector<int> cnt(10, K);
for (int i = 0; i < 4; i++){
cnt[S[i] - '0']--;
cnt[T[i] - '0']--;
}
long long ans1 = 0, ans2 = 0;
for (int i = 1;... | #include <iostream>
#include <math.h>
#include <algorithm>
#include <vector>
#define ll long long int
#define REP(i, n) for(ll i = 0; i < n; i++)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOR(i, m, n) for(ll i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
#define PI 3.141592653589793
us... |
#include <bits/stdc++.h>
using namespace std;
int main(){
unsigned long long n;
cin >> n;
unsigned long long a = 5;
for (int i = 0; i < 26; i++) {
unsigned long long b = 3;
for (int j = 0; j < 38; j++) {
if (n == a + b){
cout << j+1 << " " << i+1 << endl;
return 0;
}
... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
//#define ACL
#ifdef ACL
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#if __has_include("acl-all.h")
#include "acl-all.h" //on Wandbox
using namespace atcoder;
#endif
#endif //#ifdef ACL
typedef long... |
#include <bits/stdc++.h>
using namespace std;
int main (void){
vector<int> hoge(3);
cin >> hoge[0] >> hoge[1] >> hoge[2];
sort(hoge.begin(), hoge.end());
cout << hoge[1] + hoge[2] << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define gc() (p1 == p2 ? (p2 = buf + fread(p1 = buf, 1, 1 << 20, stdin), p1 == p2 ? EOF : *p1++) : *p1++)
#define read() ({ register int x = 0, f = 1; register char c = gc(); while(c < '0' || c > '9') { if (c == '-') f = -1; c = gc();} while(c >= '0' && c <= '9') x = x * 10 ... |
#include <bits/stdc++.h>
using namespace std;
#define for_(i, s, e) for (int i = s; i < (int) e; i++)
#define for__(i, s, e) for (ll i = s; i < e; i++)
typedef long long ll;
typedef vector<int> vi;
typedef array<int, 2> ii;
#define endl '\n'
int main() {
#ifdef mlocal
freopen("test.in", "r", stdin);
freopen(... | #include <bits/stdc++.h>
using namespace std;
template<typename T = int> vector<T> create(size_t n){ return vector<T>(n); }
template<typename T, typename... Args> auto create(size_t n, Args... args){ return vector<decltype(create<T>(args...))>(n, create<T>(args...)); }
int main(){
ios::sync_with_stdio(false);
cin.tie... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define io ios::sync_with_stdio(false); cin.tie(0)
int a[3003][5];
int main()
{
io;
int n;... | #include<bits/stdc++.h>
using namespace std;
#define N 10005
bitset<N>p[5],f[3];
int n,i,l,r,cnt,mid,a[N][10],c[10],fl,b[5][5],e[10];
bool check(){
int i;
for(i=1;i<=n;++i)f[0][i]=f[1][i]=f[2][i]=1;
for(i=0;i<5;++i){
f[e[i]]&=p[i];
}
if(f[0].count()&&f[1].count()&&f[2].count())return 1;
return 0;
}
void dfs(int... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define sz(v) v.size()
#define INF 100000000000000 //10^14
template <typename T>
bool chmax(T &a, const T& b) ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=2e3+5,MOD=1e9+7;
int n,m,tot,ans,k;
int u[N][N],d[N][N],l[N][N],r[N][N];
char str[N][N];
inline int pow(int a,int n)
{
int res=1;
while (n)
{
if (n&1) res=res*a%MOD;
a=a*a%MOD;
n>>=1;
}
return res;
}
signed main(){
scanf("%l... |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long uLL;
typedef pair<int,int> pii;
typedef pair<double,double> pdd;
const int N=3e5+5;
const int M=1e5+5;
const int inf=0x3f3f3f3f;
const int mod=1e9+7;
const double eps=1e-8;
const long double pi=acos(-1.0L);
#define ls (i<<1)
#... | #include<bits/stdc++.h>
using namespace std;
#define fi(a,b) for(int i=a;i<b;i++)
#define fj(a,b) for(int j=a;j<b;j++)
#define ff first
#define ss second
#define ll long long
#define ld long double
#define ull unsigned long long
#define bp(x) __builtin_popcount(x)
#define pr(x) for(auto it: x) cout<<... |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP2(i, a, n) for (int i = a; i < n; i++)
#define REPR(i, n) for (int i = n - 1; 0 <= i; i--)
#define REPR2(i, n, a) for (int i = n; a <= i; i--)
using V = vector<int>;
using P = pair<int, int>;
using S = string;
using l... |
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define pii pair<int, int>
#define pll pair<long long,long long>
#define vl vector<long long>
#define vll vector<pll>
#define vi vector<int>
#define vii vector<pii>
#define... | //BY: YASH JAIN, CF: yashjain0333
#include <bits/stdc++.h>
using namespace std;
#define May_the_fork_be_with_you ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define deb(x) cout<<#x<<": "<<x<<endl;
#define MOD 1000000007
#define INF 1e18
#define ll long long
#define f first
#d... |
#include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD (1LL<<63)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ld long double
#define vi vector<ll>
#define vvi vector<vi>
#define BITLE(n) (1LL<<((ll)n))
#define SUBS(s,f,t) ((s).substr((f),(t)-(f... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define spu ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
// ~ ~ ~ ~ minmedian ~ ~ ~ ~
// ~ ~ ~ ~ median ~ ~ ~ ~
//dp+二分
//dp策略：遍历每一个格子，以当前格子为右下角的方阵有多少个格子小于等于给定值
//二分策略： 对于mid 如果存在一种sqare cnt>= (k*k+1)/2 在左面找，else 在右面找
const i... |
#include<bits/stdc++.h>
#define reg register
typedef long long ll;
using namespace std;
inline int qr(){
int x=0,f=0;char ch=0;
while(!isdigit(ch)){f|=ch=='-';ch=getchar();}
while(isdigit(ch)) {x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
return f?-x:x;
}
const int maxn=2e5+100;
const int mod=998244353;
int n;
struct no... | #include <bits/stdc++.h>
using namespace std;
#define _ <<" "<<
#define sz(x) ((int) (x).size())
typedef pair<int, int> pii;
typedef long long ll;
const int maxn = 5e5 + 5;
template<class T> void print(T & x){ cout << x; }
template<class T,class U> void print(pair<T,U> & p){cout << "("; print(p.first); cout << ", "; pr... |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define isNum(a) (a >= '0' && a <= '9')
#define SP ... | #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >>... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define MOD 1000000007
#define INF LLONG_MAX
#define MINF LLONG_MIN
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(NULL); cout.tie(NULL);
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#def... | #include<bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ff first
#define ss s... |
//@formatter:off
#include<bits/stdc++.h>
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(i,n) for (ll i = 0; i < ll(n); ++i)
#define rep2(i,s,n) for (ll i = ll(s); i < ll(n); ++i)
#define rep3(i,s,n,d) for(ll i = ll(s); i < ll(n); i+=d)
#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)
#defi... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long add(long long a, long long b) {
long long res = a + b;
if (res >= mod) res -= mod;
return res;
}
long long sub(long long a, long long b) {
long long res = a - b + mod;
if (res >= mod) res -= mod;
return re... |
#include <bits/stdc++.h>
#include <unordered_set>
// https://atcoder.jp/contests/abc192/tasks/abc192_c
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vs = vector<string>;
#define rep(i, n) for (int i = 0; i < (in... | #include <bits/stdc++.h>
#define Fast cin.tie(0), ios::sync_with_stdio(0)
#define All(x) x.begin(), x.end()
#define louisfghbvc int t; cin >> t; while(t--)
#define sz(x) (int)(x).size()
using namespace std;
typedef long long LL;
typedef pair<LL, LL> ii;
typedef vector<LL> vi;
template<typename T> istream& operator>>(... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
typedef long long ll;
const ll mod = 1000 * 1000 * 1000 + 7;
vector<string> v;
vector<vector<int>> row, col;
ll power(ll x, ll n) {
ll res = 1;
for (; n; n >>= 1, x = (x * x) % mod)
if (n & 1) res = (res * x) % mod;
... | #include <bits/stdc++.h>
#define fo(i,a,b) for(int i=a;i<=b;++i)
#define fod(i,a,b) for(int i=a;i>=b;--i)
using namespace std;
typedef long long LL;
const int N=500500;
int read(int &n)
{
bool q=0;n=0;char ch=' ';
for(;ch!='-'&&(ch<'0'||ch>'9');ch=getchar());
if(ch=='-')ch=getchar(),q=1;
for(;ch>='0'&&ch<='9';ch=ge... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define INF 1000000007
//0=48,A=65,a=97
int main() {
int n,k;cin >> n >> k;
string s;cin >> s;
for(int i = 0; i < k; i++) {
s += s;
string t;
for(int j = 0; j < 2*n; j+=2) {
if(s... | #include <bits/stdc++.h>
using namespace std;
template<typename T>
struct Doubling {
using F = function<int(int,int)>;
private:
const int LOG, n;
vector<vector<int>> index, DP;
vector<vector<T>> sum;
public:
Doubling(const int n_, const int LOG_ = (int)log2(numeric_limits<long long>::ma... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define nline "\n"
const ll M1=1e9+7;
const ll M2=998244353;
const ll N=100005;
const ll INF_MUL=1e13; ... | #include "bits/stdc++.h"
#define int long long
#define endl '\n'
using namespace std;
typedef long long ll;
typedef long double ld;
#define db(x) cerr << #x << ": " << x << '\n';
#define read(a) int a; cin >> a;
#define reads(s) string s; cin >> s;
#define readb(a, b) int a, b; cin >> a >> b;
#define readc(a, b, c) i... |
#include <iostream>
using namespace std;
const int mn=2e5;
long arr[mn+1]={};
long prec[mn+1]={};
long bestcp[mn+1]={};
int main() {
int N;
cin>>N;
for(int i=1;i<=N;i++){
cin>>arr[i];
prec[i]=arr[i]+prec[i-1];
bestcp[i]=max(bestcp[i-1],prec[i]);
//cout<<bestcp[i]<<' ';
}
//cout<<'\n';
long ans=0;
for(int... | #include <iostream>
#include <vector>
#include <map>
using namespace std;
using lint = long long;
void solve() {
int n;
cin >> n;
lint ans = 0, sum = 0;
map<lint, lint> cnt{{0, 1}};
for (int i = 0; i < n; ++i) {
lint x;
cin >> x;
if (i % 2) x = -x;
sum += x;
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> PP;
//#define MOD 1000000007
#define MOD 998244353
#define INF 2305843009213693951
//#define INF 810114514
#define PI 3.141592653589
#define setdouble setprecision
#define REP(i,n) for(ll i=0;i<(n);++i)
#define OREP(i,n) for(ll i=1;... | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
#define int long long
#define mod 998244353ll
#define maxn (100)
int a[maxn][maxn], exp[maxn], pa[maxn], siz[maxn], vis[maxn];
int findset(int v) {
return pa[v] = pa[v] == v? v: findset(pa[v]);
}
signed main()
{
int... |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define ll long long
#define ld long double
#define test ll t=0;cin>>t; while(t--)
#define loop(i,a,b) for(i=a;i<=b;i++)
#define loopr(i,a,b) for(i=a;i>=b;i--)
#define lb lower_bound
#define ub upper_bound
#defin... | #include<iostream>
#include<queue>
#include<vector>
#include<map>
#include<algorithm>
#define int long long int
using namespace std;
signed main(){
int n, k, temp;
cin >> n >> k;
vector<int> arr(n);
for(int i=0;i<n;i++) cin >> arr[i];
sort(arr.begin(), arr.end());
vector<int> count(arr[arr.size... |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utilit... | #include "bits/stdc++.h"
using namespace std;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
s... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define LB(a,x) lb(all(a),x)-a.begin(... | //#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
#define rep2(x,fr,to) for(int x=(fr);x<(to);x++)
#define rep(x,to) for(int x=0;x<(to);x++)
#define repr(x,fr,to) for(int x=(fr);x>=(to);x--)
#define all(c) c.begin(),c.end()
#define sz(v) (int)v.size()
typedef long long ll; typedef vector<int> V... |
#include <bits/stdc++.h>
using namespace std;
//#define int long long
template <typename T>
vector <T> uniq(vector <T> v) {
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()), v.end());
return v;
}
int32_t main() {
ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n; cin >... | #include <bits/stdc++.h>
#define clr(x) memset(x,0,sizeof(x))
#define For(i,a,b) for (int i=(a);i<=(b);i++)
#define Fod(i,b,a) for (int i=(b);i>=(a);i--)
#define fi first
#define se second
#define kill _z_kill
#define y0 _z_y0
#define y1 _z_y1
#define x0 _z_x0
#define x1 _z_x1
#define pb(x) push_back(x)
#define mp(x,y)... |
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<long long> vl;
typedef vector<vector<long long>> vvl;
typedef vector<vector<vector<long long>>> vvvl;
typedef pair<int, int> pii;
typedef pair<long long, long l... | #include <iostream>
#include <algorithm>
#include <tuple>
#include <vector>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <cassert>
using namespace std;
using ll = long long;
int num[1005];
int main()
{
int n, m;
cin >> n >> m;
vector<int> a(n), b(m);
for(i... |
#include <iostream>
#include <string>
using namespace std;
int main() {
int i,l_S;
char c;
string S,T="",U;
cin >> S ;
l_S=S.size();
for(i=0;i<l_S ;i++){
c=S[i];
if(c=='6'){
T +="9";
}
else if(c=='9'){
T +="6";
}
else{
... | #include<bits/stdc++.h>
#define MAX 5000
#define MOD 1000000007
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a,b,c;
cin>>a>>b>>c;
cout<<21-(a+b+c)<<endl;
return 0;
} |
#include <iostream>
#include <iomanip>
#include <vector>
#include <map>
#include <algorithm>
#include <string>
#include <numeric>
#include <cmath>
#include <math.h>
#define cPI 3.14159265358979323846
using namespace std;
void func()
{
int64_t N;
cin >> N;
double m=0, e=0, c=0;
for (int64_t i = 0; i < N; ++i)
{
... | /* author:hellojim */
#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<sstream>
#incl... |
#include <bits/stdc++.h>
#include<sstream>
#include<string>
#include<vector>
#include <set>
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define mp make_pair
#define ll long long
#define lb lower_bound
#define ub upper_bound
#define endl "\n"
#define ff first
#define s... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define PI 3.141592653589793238462643383279502884L
#define make_unique(vec) vec.resize(distance(vec.begin(),unique(vec.begin(),vec.end())))
#... |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL)
#define elif else if
#define rep(i,s,e) for(int i=s;i<e;++i)
#define ret(i,c) for(auto i:c)
#define all(a) a.begin(),a.end()
#define len(a) (a.size())
#define pb push_back
#define fi first
#define se second
#define mp make_pair
using... | #include <bits/stdc++.h>
using namespace std;
#include<cstdlib>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
typedef long long ll;
int main(){
int n,x;
cin >> n >> x;
string s;
cin >> s;
rep(i,n){
if(s.at(i)=='o') x++;
else x = max(x-1, 0);
}
cout << x;
} |
#include <iostream>
using namespace std;
int main() {
char c1;
char c2;
char c3;
cin >> c1;
cin >> c2;
cin >> c3;
if ( c1 == c2 && c2 == c3 ) cout << "Won";
else cout << "Lost";
return 0;
}
| #include <stdio.h>
constexpr unsigned char H[16] = {0, 1, 0, 3, 1, 1, 1, 1, 0, 1, 2, 2, 3, 1, 2, 3};
int main() {
unsigned char n, k;
scanf("%hhd %hhd", &n, &k);
getchar_unlocked();
unsigned char h[101], h2[101];
for (unsigned char i = 0; i < n; i++) h[i] = getchar_unlocked() - 80;
for (unsigned char i = ... |
#include<bits/stdc++.h>
#define ll long long
#define int long long
using namespace std;
const int MOD = 998244353;
int n, m;
const int M = 5e3 + 5;
int dp[15][M], fact[M];
ll exp(ll a,ll n){
if(a==0) return 0;
if(n==0) return 1;
if(n==1) return a;
ll ans = exp(a,n/2);
ans*=ans; ans%=MOD;
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define endl '\n'
#define debug(e) cerr << #e << ": " << e << endl;
#define fast_io; ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const ll MOD=998244... |
// Author : Sarthak Kapoor
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int ll
#define rep(i,n) for(int i=0;i<n;++i)
#define repa(i,a,n) for(int i=a;i<n;++i)
#define repr(i,n) for(int i=n-1;i>=0;--i)
#define ll long long
#define pi pair<int,in... | #include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
long long a[105],l,k,n,m,f[105][2],c[105],b[105];
int main()
{
scanf("%lld%lld",&n,&m);
for (int i=1;i<=n;i++)
scanf("%lld",&a[i]);
sort(a+1,a+1+n);l=m;
for (int i=n;i>=1;i--)
{
b[i]=l/a[i];
l=l%a[i];
}
for (int i=1;i<n... |
#include<string>
#include<bits/stdc++.h>
#include<iostream>
using namespace std;
// driver program
int main()
{
int n, x;
string s;
cin >> n >> x;
cin >> s;
for (int i = 0; i < n; i++)
{
if (x < 0) { x = 0;}
else if (s[i] == 'x') { x += -1; }
else if (s[i] == 'o') { x += 1; }
}
if (x < 0) { x = 0; }... | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
int main(){
int H, W;
cin >> H >> W;
vector<string> T(H);
rep(i, H) cin >> T[i];
vector<vector<int>> S(H, vector<int>(W, 0));
rep(i, H){
rep(j, W){
if(T[i][j] == '.')
S[i][j] = 0;
else
... |
#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;
typedef long long ll;
typedef long double ld;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cctype>
#define N 201000
template<typename T> inline void read(T &x) {
x = 0; char c = getchar(); bool flag = false;
while (!isdigit(c)) { if (c == '-') flag = true; c = getchar(); }
while (isdigit(c)) x = x * 10 + (c ^ 48), c = ... |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <iostream>
#include <fstream>
#ifndef PRELUDE_H
#define PRELUDE_H
#define M_PI 3.14159265358979323846
#define EPS 1e-9
#include <algorithm>
#include <cmath>
#include <numeric>
#include <vector>
#include... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<long long> Vll;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
ll n,q;
cin >> n >> q;
Vll a(n);
rep(i,n)cin >> a[i];
sort(a.begin(),a.end()... |
#pragma GCC optimize("Ofast", "unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
constexpr ll mod = 1000000007LL;
int N;
char caa, cab, cba, cbb;
void input(void){
cin >> N;
cin >> caa >> cab >> cba >> cbb;
}
ll modpow(ll a, ll b){
if (b == 0... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> PII;
const int maxn=100010,mod=1000000007;
#define MP make_pair
#define PB push_back
#define lson o<<1,l,mid
#define rson o<<1|1,mid+1,r
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define ROF(i,a,b) for(int i=(a);i>=(b);i--)
#def... |
#pragma GCC optimize("Ofast")
#pragma GCC optimization("unroll-loops")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
#pragma GCC optimize("no-stack-protector")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using name... | /*
* ────────────── •✵•✵• ──────────────
* | In The Name of Allah |
* | Author: Amir Hossein Farhadi |
* | Created: 2021-04-28 |
* ────────────── •✵•✵• ──────────────
*/
// ju't ujnf up spbs !
#include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#incl... |
#include <bits/stdc++.h>
#define ll long long int
#define db double
#define pb push_back
#define mpr make_pair
#define andl "\n"
#define f first
#define s second
#define mset(x,y) memset(x,y,sizeof(x))
#define fr(i,n) for(long long int i=0;i<n;i++)
#define trace(it,x) for(auto it = (x).begin(); it != (x).end(); it++)
#... | //x<<y=x*2^y,x>>y=x/2^y
//1e5+3 is prime
// in a matrix, all elements of a primary diagonal have constant diff of coordinates
// and a secondary diagonal has constant sum of coordinates
//use ll() for using an integer in self-built fn
//(x&-x) bitwise and of (x and its 2's complement) returns (last set bit)
//eg if x=1... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n=0;
long long int a=0,s=0,mx=0,x=0;
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%lld",&x);
mx=max(mx,x);
a+=x;
s+=a;
printf("%lld\n",s+i*mx);
}
return 0;
} | #include<stdio.h>
#define rep(i,N) for(int i=0;i<(int)N;i++)
static inline int IN(void)
{
int x=0,f=1,c=getchar();while(c<48||c>57){if(c==45){f=-f;}c=getchar();}
while(c>47&&c<58){x=x*10+c-48,c=getchar();}return f*x;
}
static inline void OUT(long x){if(x<0){putchar('-'),x=-x;}if(x>=10){OUT(x/10);}putchar(x-x/10*10+... |
#include<iostream>
#include<vector>
#include<queue>
using namespace std;
#define int long long
#define P pair<int,int>
template<class T>int chmin(T&a,const T&b){if(b<a){a=b;return 1;}return 0;}
void dijkstra()
{
int n,m;cin>>n>>m;
int cnt=0;
vector<vector<P>>g(n);
for(int i=0;i<m;i++)
{
int a,b,cst=1;cin>>a>>b;... | #pragma region Macros
#include <bits/stdc++.h>
#if defined(LOCAL) || defined(ONLINE_JUDGE) || defined(_DEBUG)
#include <atcoder/all>
#endif
using namespace std;
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i, n) for(int i=(n); i>=0; --i)
#define FOR(i, n, m) for(int i=(m), i##_len=(n); i<i##... |
#include <bits/stdc++.h>
using namespace std;
#define REPP(i,a,b,d) for(int i=(a);i<=(int)(b);i+=(d))
#define REP(i,a,b) REPP(i,a,b,1)
#define REVV(i,a,b,d) for(int i=(a);i>=(int)(b);i-=(d))
#define REV(i,a,b) REVV(i,a,b,1)
#define FOR(i,a) for(int i=0; i<(int)(a); i++)
#define FORD(i,a) for(int i=(int)(a)-1; i>=0; i--... | #include<bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#define endl "\n"
#define pb push_back
#define ll long long
#define d1(x) cerr << #x << "--> " <... |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#include<queue>
using namespace std;
#define LL long long
#define DB double
#define MAXN 100
#define Pr pair<int,int>
#define X first
#define Y second
#define INF 1000000001
#define mem(x,v) memset(x,v,sizeof(x))
LL read(){
... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
#define mp make_pair
#define pb push_back
#define ll long long
//#define debug(x) ;
#define debug(x) cerr << #x << " = " << x << "\n";
ostream& operator<<(ostream& cerr, vector<ll> a... |
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
bool vis[200001] = {false};
vector<int> graph[200001];
void dfs(int node, int par , int& temp){
vis[node] = true;
temp++;
for(auto& c : graph[node]){
if(vis[c] == false)
dfs(c , node , temp);
}
}
int main(){
int n;
cin>>n;
int a[... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
... |
#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
using ll = long long;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define _... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define pb(a) push_back(a)
#define vll vector<ll>
#define loop(i, n) for(ll i=1;i<=n;i++)
#define loop0(i, n) for(ll i=0;i<n;i++)
#define in(i) scanf("%lld", &i);
#define out(i) printf("%lld", i)
#define pll pair<ll, ll>
#define vpll vector<pair<l... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<double> vd;
typedef pair<int,int> pii;
#define lll int64_t //need to use g++ -std=c++11 or more ...
#define pb push_back
#define For(i,n) for(int i=0;i<n;i++)
#define fi first
#define se sec... | #include <bits/stdc++.h>
using namespace std;
void fastio() {
cin.tie(nullptr);
cin.sync_with_stdio(false);
}
using LL = long long;
using LD = long double;
const LL MOD = 1e9+7;
const LL INF = 1e18;
const LL N = 3e5+1;
const LD eps = 1e-9;
#define S second
#define F first
#define vt vector
int main () {
fastio... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <utility>
#include <tuple>
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{... | #pragma region
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define repc(i, m, n) for (int i = m; i < n; i++)
#define reprc(i, m, n) for (int i = m; i > n; i--)
#define all(v) v.begin(), v.end()
#define INF 1e9
#defin... |
//----AUTHOR: eeshan_deo_iitkgp----/
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define ll long long
#define ld long double
#define pb push_back
#define ppb pop_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vb vector<bool>
#define vd vecto... | #include <bits/stdc++.h>
using namespace std;
using llong = long long;
using ldbl = long double;
using lpair = pair<llong, llong>;
#define ALL(x) x.begin(), x.end()
constexpr llong mod = 1e9+7;
constexpr llong inf = mod * mod;
int main() {
llong N;
cin >> N;
N *= 1.08;
cout << (N < 206 ? "Yay!": N == 206 ?... |
#include <bits/stdc++.h>
#define LL long long
#define pii pair<int,int>
#define pll pair<LL,LL>
#define INF 0x7f3f3f3f
using namespace std;
const int MAX = 2e5+10;
double f[110][110][110];
int main()
{
//freopen("in.txt","r",stdin);
int Cas = 1;
//scanf("%d",&Cas);
while(Cas--)
{
int a,b... | #include<bits/stdc++.h>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define int long long
#define pb push_back
#define ins insert
#define rs resize
#define br break;
#define cont continue;
#define vi vector<int>
#... |
#include <iostream>
using namespace std;
long long int N;
long long int A[100000];
long long int P[100000];
long long int X[100000];
long long int cost_min = 1000000000;
void solve() {
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> A[i] >> P[i] >> X[i];
long long int zaiko = X[i] - A[i];
if (zaiko ... | #include<bits/stdc++.h>
namespace imzzy{
#define endl '\n'
#define rgi register int
typedef long long ll;
class fastin{private:int _ch,_f;
public:inline fastin&operator>>(char&c){c=getchar();return*this;}
template<typename _Tp>inline fastin&operator>>(_Tp&_x){
_x=0;while(!isdigit(_ch))_f|=(_ch==45),_ch=getchar()... |
#include<iostream>
using namespace std;
int main() {
int a,b;cin>>a>>b;
cout << a*2+100-b<<endl;
return 0;
} | #include "algorithm"
#include "iostream"
#include "numeric"
#include "iomanip"
#include "cstring"
#include "math.h"
#include "bitset"
#include "string"
#include "vector"
#include "random"
#include "chrono"
#include "ctime"
#include ... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <string>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <stack>
#include <numeric>
#define inf 0x3f3f3f3f
#define MAXN 50005
using namespace std;
typedef long long ll;
t... | #include <bits/stdc++.h>
#define ff first
#define ss 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>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
using ll = long long;
//<< fixed << setprecision(n) 小数第n位まで表示
template <class T> void chmin(T& a, T b) {
if(a > b) {
a = b;
}
}
template <class T> void chmax(T& a, T b) {
if(a < b) {
a = b;
}
}
... | /*
Mbak Sana Dong
Mbak Chaeyoung Dong
Mbak Seulgi Dong
*/
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
int n,i,j,k,x,y,ans,temp,curr,m;
int tc;
string s;
cin >> n >> s;
s = " " + s;
ll seulgi = 0;
map<pair<int,int>, int> mp;
mp[{0, 0}] = ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int inf = 1001001001;
ll INF = 1001001001001001001;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define rep(i, n) FOR(i, 0, n)
#define all(x) x.begin(), x.end()
#define pb push_back
#define pf push_front
ll MOD = 1000000007;
using P = pair... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int h,w,ans;
cin>>h>>w;
ans=(h-1)*(w-1);
vector<vector<char>> a(h,vector<char>(w));
for(int i=0;i<h;i++)
{
for(int j=0;j<w;j++)
{
cin>>a.at(i).at(j);
}
}
for(int i=0;i<h-1;i++)
{
for(int j=0;j<w-1;j++)
{
int bla... |
/*
This too shall pass
*/
#pragma GCC optimize "trapv"
#include <bits/stdc++.h>
using namespace std;
#define MOD (int)(1e9+7)
#define MOD1 998244353
#define pii pair <int, int>
#define INF 2e18
#define int long long
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//optimal subsequences-2 technocup round-3 2020
using namespace std;
using namespace __gnu_pbds;
const int N=2e5+10;
//#define d double
#define F first
#define S second
#define ll long long int
#define FastIO ios_base:... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for(int i=0; i<n; i++)
//global parameter
int main(void){
int a, b, c;
cin >> a >> b >> c;
a = 7 - a;
b = 7 - b;
c = 7 - c;
cout << a+b+c << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
cout << 21-a-b-c << endl;
} |
#include<bits/stdc++.h>
typedef long long LL;
using namespace std;
const int N=2e5+100;
int n,stk[N],top; char str[N];
int main() {
scanf("%d%s",&n,str+1);
for(int i=1;i<=n;++i) {
if(top >= 2 && str[stk[top-1]] == 'f' && str[stk[top]] == 'o' && str[i] == 'x')
top -= 2;
else stk[++top]=i;
}
cout<<top;
retur... | #include<stdio.h>
#include<iostream>
int main() {
int x;
int y;
int z;
std::cin >> x;
std::cin >> y;
if(x==y){
z = x;
}
else{
z = 3 - x - y;
}
std::cout << z;
return 0;
} |
#include <bits/stdc++.h>
// 1. dp
typedef long double ld;
#define int long long
#define gcd __gcd
#define endl "\n"
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define mod2 998244353
#define maxe *m... | //#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <math.h>
#include <cmath>
#include <algorithm>
#include <climits>
#include <functional>
#include <cstring>
#include <string>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <vector>
#include <stack>
#include <queue>
#include <dequ... |
#include <cstdio>
const long long mod = 998244353;
int w[105];
long long f[105][105][20005];
int main(){
int n;
scanf("%d",&n);
for(int i = 1; i <= n; i++) scanf("%d",&w[i]);
f[0][0][10000] = 1;
long long ans = 0;
for(int i = 1; i <= n; i++){
int u = w[i];
for(int j = 0; j <= i; j++){
for(int k = 0; 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
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long l... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,k;
cin>>n>>k;
int sum=0;
int a[n+1][k+1];
for(int i=1;i<=n;i++){
for(int j=1;j<=k;j++){
sum+=(i*100)+j;
}
}
cout<<sum;
}
| #include <iostream>
#include <vector>
#include <algorithm>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <queue>
using namespace std;
int main(){
int x, y;
cin >> x >> y;
if (x == y) cout << x << endl;
else {
cout << 3-x-y << endl;
}
return 0... |
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define mp make_pair
int p = 998244353;
int mul(int a, int b) {
return (1LL * a * b) % p;
}
int add(int a, int b) {... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep3(i,m,n) for(int (i)=m;(i)<=(n);(i)++)
#define rep3rev(i,m,n) for(int (i)=m;(i)>=(n);(i)--)
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
#define fi first
#define se second
#define pb p... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n;
cin >> n;
vector<double> dp(n + 1, 0);
dp[1] = 0;
for(ll i = 2; i <= n; i++)
{
dp[i] = dp[i - 1] + 1.0 * n / (n - i + 1);
}
printf("%.11f... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
// 2D Vector: vector<vector<int>> nums(n,vector<int>(m,0));
int main(){
int n;
cin>>n;
vector<int>a;
vector<int>b;
for(int i=0;i<n;i++){
int q;
cin>>q;
a.pb(q);
}
for(int i=0;i<n;i... | #include <bits/stdc++.h>
using namespace std;
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
#define pb push_back
#define mp make_pair
#define cotu cout
#define itn int
#define Red ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#def... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
int main()
{
int N;
cin >> N;
int T[N];
rep(i, 0, N) cin >> T[i];
int tot = accumulate(T, T + N, 0);
bool dp[N + 1][900011];
fill((int *)dp, (in... | // fuml namshebaazi
#include <bits/stdc++.h>
#define endl "\n";
using namespace std;
typedef long long ll;
int dp[100005][105];
void solve()
{
int n;cin>>n;
vector<int> v(n);
int sum=0;
for(int i=0;i<n;i++) {
cin>>v[i];
sum+=v[i];
}
memset(dp,0,sizeof(dp));
for(int i=0;i<=n;i++) dp[0][i]=1;
for(int i=1;i<=s... |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s, t; cin >> s;
deque<char> deq;
bool rev = false;
for(int i = 0; i < (int)s.size(); ++i){
if(s[i] == 'R'){rev = !rev;}
else if(s[i] != 'R' && rev == false){deq.push_back(s[i]);}
else{deq.push_front(s[i]);}
}
if(rev == true){re... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,k,n) for (int i = k; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
const ll INF = (ll)1e16;
void chmin(ll &a, ll b) { a = min(a, b); }
void chmax(ll &a, ll b) { a = max(a, b); }
void solve() {
... |
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > stru... | #include<bits/stdc++.h>
#define speed ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define fs first
#define sd second
#define rept(i,n) for(ll i=0;i<n;i++)
#define rrept(i,n) for(ll i=n-1;i>=0;i--)
#define all(v) v.begin(),v.end()
#define mpit map<ll,ll>::iterator
#define stit set<ll,ll>::iterator
#def... |
/**
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⡀⠀⠀⠀⠀⢀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⣠⡖⠁⠀⠀⠀⠀⠀⠀⠈⢲⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⣼⡏⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢹⣧⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⣸⣿⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⣿⣇⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⣿⣿⡇⠀⢀⣀⣤⣤⣤⣤⣀⡀⠀⢸⣿⣿⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⢻⣿⣿⣔⢿⡿⠟⠛⠛⠻⢿⡿⣢⣿⣿⡟⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⣀⣤⣶⣾⣿⣿⣿⣷⣤⣀⡀⢀⣀⣤⣾⣿⣿⣿⣷⣶⣤⡀⠀⠀⠀⠀
⠀⠀⢠⣾⣿⡿⠿⠿⠿⣿⣿⣿⣿⡿⠏⠻⢿⣿⣿⣿⣿⠿⠿⠿⢿⣿⣷⡀⠀⠀
⠀⢠⡿⠋⠁⠀⠀⢸⣿⡇⠉⠻⣿⠇⠀⠀⠸⣿⡿⠋⢰⣿⡇⠀⠀⠈⠙⢿⡄⠀
⠀⡿⠁⠀⠀⠀⠀⠘⣿⣷⡀⠀⠰⣿⣶⣶⣿⡎⠀⢀⣾⣿⠇⠀⠀⠀⠀⠈⢿⠀
⠀⡇⠀⠀⠀⠀... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
//typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef vector<int> Vi;
//typedef tuple<int, int, int> T;
#define FOR(i,s,x) for(int i=s;i<(int)(x);i++)
#define REP(i,x) FOR(i,0,x)
#define ALL(c) c.begin(), c.end()
#define DUMP( x ) cerr << ... |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int _ = 1;
void _solve() {
int n;
cin>>n;
vector< vector<int> >v(n , vector<int>(2));
for(int i = 0 ; i <n ;i++) {
cin>>v[i][0]>>v[i][1];
}
int ans = 0;
for(int i = 0 ; i <n ;i++) {
for(int j = i+1 ; j ... | #include<bits/stdc++.h>
#define ll long long int
#define pb push_back
#define po pop_back
#define mp make_pair
#define fi first
#define se second
#define LLM LONG_LONG_MAX
#define LLm LONG_LONG_MIN
#define hello ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define MOD 1000000007
using namespace std;
bool comp(l... |
#include<bits/stdc++.h>
using namespace std;
int main() {
int a,b,x,y;
cin>>a>>b>>x>>y;
if(a>b) {
cout<<x+min(y,2*x)*(a-b-1);
} else {
cout<<min(y,2*x)*(b-a)+x;
}
return 0;
} | #include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<algorithm>
#include<cstring>
using namespace std;
queue<pair<pair<int, int>, int>> que;
int dist[2][110];
bool in_que[2][110];
bool in_range(int y)
{
return y >= 1 && y <= 100;
}
int main()
{
i... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define vec vector
#define rep(i,n) for (int i=0; i<(n); i++)
#define print(a) cout << a << endl
#define fix(n) fixed << setprecision(n)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define Yes "Yes"
#d... | // Username: WillTheBill
// Time of creation: 2020-10-29 13:25
// Original filename: m.cp.cpp
#include<bits/stdc++.h>
using namespace std;
// shortcuts
#define pb push_back
#define fi first
#define se second
#define all(_v) _v.begin(),_v.end()
#define ll long long
// IO
#define multitest signed __T; cin >> __T; whil... |
#include<bits/stdc++.h>
using namespace std;
#define MAX_N 200200
#define MAX_M 400400
int vis[MAX_N], used[MAX_N], match[MAX_M], dist[MAX_N], n, m, ans;
queue<int> q;
vector<int> v[MAX_N];
void bfs(){
while(!q.empty()){
int u = q.front(); q.pop();
for(auto e : v[u]){
if(match[e] && !... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
//#define mydeb(fmt, ...) fprintf(stderr, fmt, __VA_ARGS__)
#define mydeb(fmt, ...)
map<int,int>union_find_p... |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include<iostream>
#include<cmath>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define mod 1000000007
#define one(x) __builtin_popcountll(x)
#define zero(x) __builtin_ctzll(x)
#d... | #include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
int main() {
double Sx, Sy, Gx, Gy;
cin >> Sx >> Sy >> Gx >> Gy;
double a = (Gy + Sy) / (Gx - Sx);
double c = Gy - (a * Gx);
double b = (-1 * c) / a;
cout << fixed << setprecision(10) << b << endl;
return 0;
}
|
// #pragma GCC optimize("Ofast")
#include <vector>
#include <iostream>
#include <utility>
#include <cmath>
#include <set>
#include <algorithm>
#include <queue>
#include <string>
#include <utility>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vll;
typedef vector<int> vi... | #include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
#include<utility>
using namespace std;
#define int long long
#define endl "\n"
constexpr long long INF = (long long)1e18;
constexpr long long MOD = 1'000'000'007;
struct fast_io {
fast_io(){
std::cin.tie(n... |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace st... | #include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358979323
#define ll long long int
#define vi vector <int>
#define vl vector <ll>
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define ff first
#define ss second
#define MOD 1000000007
ll power(ll a, ll b) { //a^b
ll res = 1;
a = a % MOD;... |
#include<bits/stdc++.h>
using namespace std;
using namespace std;
int n,a[100005],dp[100005][2],cnt[100005][2];
const int mod=1e9+7;
int M(int x){return x>=mod?x-mod:x;}
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)scanf("%d",&a[i]);
dp[1][0]=a[1];cnt[1][0]=1;
for(int i=2;i<=n;i++)
{
cnt[i][0]=M(cnt[i-1][0]... | #include <bits/stdc++.h>
#define int long long
#define f first
#define s second
#define rep(i,a,b)for(int i=a;i<b;i++)
#define pb push_back
const int mod = 1e9 + 7;
const int INF = 1e18;
const int SIZE = 1e5 + 5;
using namespace std;
void solve() {
int n;
cin >> n;
int a[n];
rep(i, 0, n) {ci... |
/**
* @brief atcoder
* @author yao
*/
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <utility>
#include <algorithm>
#include <functional>
#include <climits>
#define ft first
#define sd second
#ifdef DBG
# define dbg_pri(x...) fprintf(stderr,x)
#else
# define dbg_pri(x...) 0... | // Author :: <Hitesh_Saini>
#include<bits/stdc++.h>
#define __speed() ios_base::sync_with_stdio(false), cin.tie(nullptr);
#define dbg(x) cout << "(" << __LINE__ << ": "<< #x << " = " << x << ")\n"
#define Yes(x) print((x) ? "Yes" : "No")
#define tt int t; for (cin >> t; t--; )
#define f0(i, n) for (i = 0; i < (... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ull unsigned long long int
int main() {
double a,b;
cin >> a >> b;
double ans;
ans = ((a-b)/a)*100;
cout << std::fixed << std::setprecision(18) << ans;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <list>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <limits>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <numeric>
#include <math.h>
#include <string.h>
#include <stdlib.... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
template<class T>
bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; }
template<class T>
bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
using ll = long long;
usi... | #include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
bool flag=true;
deque<char> ans;
for(int i=0;i<S.size();i++){
if(S[i]=='R')flag=(!flag);
else if(flag){
if(!ans.empty() && S[i]==ans.back())ans.pop_back();
else ans.push_back(S[i]);
}
else{
if(!ans.empty() && S[i]==an... |
#include<iostream>
using namespace std;
int H,W,A;
int dp[17][1<<16][9];
main()
{
cin>>H>>W>>A;
dp[0][0][A]=1;
for(int i=0;i<H;i++)for(int j=0;j<=W;j++)for(int k=0;k<1<<W;k++)
{
int t=(1<<W)-k-1;
if(j==W)
{
int a=__builtin_popcount(t);
for(int l=a;l<=A;l++)dp[i+1][t][l-a]+=dp[i][k][l];
}
if(t>>j&1)
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
void recursive(vector<vector<int>>& arr, int h, int w, int& ans,int a_count, int a)
{
if(a==a_count)
{
ans++;
return;
}
if(a_count<a){
for(int i=0;i<h;i++)
{
for(int j=0;j<w-1;j++)
... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
#include <cstring>
#include <utility>
#include <numeric>
#include <set>
using namespace std;
int main(){
long long N;
cin >> N;
set<long long> numSet;
for(long long i = 2; i <= 100000; i++){
if(i * ... | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <u... |
#include <bits/stdc++.h>
using namespace std ;
int main (){
char a,b,c;
cin>>a>>b>>c;
cout<<b<<c<<a;
return 0;
} | //x<<y=x*2^y,x>>y=x/2^y
//1e5+3 is prime
// in a matrix, all elements of a primary diagonal have constant diff of coordinates
// and a secondary diagonal has constant sum of coordinates
//use ll() for using an integer in self-built fn
//(x&-x) bitwise and of (x and its 2's complement) returns (last set bit)
//eg if x=1... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.