code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using lb = long double;
#define fi first
#define se second
#define pb push_back
ll times_cap(ll a, ll b) {
if (log10(a) + log10(b) >= 17.0)return 1e17;
else return a * b;
}
typedef pair<int64_t, int64_t> P;
int main(){
ll x,y;
cin>>x>>y;
if... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main () {
int a, b;
cin >> a >> b;
ll K;
cin >> K;
ll cmp[63][63];
for (int i = 0; i <= 60; i ++) {
cmp[i][0] = cmp[i][i] = 1;
for (int j = 1; j < i; j ++) {
cmp[i][j] = cmp[i - 1][j] + cmp[i - 1][j - 1];
}
}
int s... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
#define ll long long
#define F(type, i, a, b, incr) for (type i = a; i <= (type)(b); i += (type)(incr))
#define RF(type, i, a, b, decr) for (type i = a; i >= (type)(b); i -= (type)(decr))
#define sz(a) sizeof(a)
#define deb(a) cerr ... | /* -> Bismillahir Rahmanir Rahim <- */
#include <bits/stdc++.h>
using namespace std;
//Some Hints
//Find odd and even return 1 || 0
// __builtin_parity() if x is ll use __builtin_parityll(x)
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a * (b / gcd(a, b)))
// count how many 0 in a by... |
#include <bits/stdc++.h>
#define DEBUG if(0)
#define lli __int128
#define ldouble long double
using namespace std;
/*
(2x + 2y)n + x <= t < (2x + 2y)n + x + y
range = y (max 500)
(p + q)n + p <= t < (p + q)(n + 1)
range = q (max 500)
try all combinations of mod (500^2)
t - (2x + 2y)n - x == remY
t - (2x + 2y)n =... | #include<iostream>
#include<utility>
using namespace std;
typedef long long ll;
int T;
ll X,Y,Q,P;
ll A,B,ans;
ll ext_gcd(ll p,ll q,ll& x, ll& y) { // get px+qy=gcd(p,q)
if(q==0) return x=1,y=0,p;
ll g=ext_gcd(q,p%q,y,x);
y-=p/q*x;
return g;
}
pair<ll,ll> crt(ll a1,ll mo1,ll a2,ll mo2) { // return (x,y) y=lcm(a1,... |
#include <iostream>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, s, n) for (ll i = s; i < (n); i++)
const ll MOD ... | #include <bits/stdc++.h>
#include <cassert>
#define rep(i, N) for (int i = 0; i < (N); ++i)
#define rep2(i, a, b) for (ll i = a; i <= b; ++i)
#define rep3(i, a, b) for (ll i = a; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define nl '\n'
#define endl '\n'
#define all(c)... |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
// string N;
int main() {
int x = 0;
cin >> x;
if (x < 0) {
cout << 0;
}
else {
cout << x;
}
//int k = N.length();
//const char* N_ch = N.c_str();
//int mod0 = 0;
//int mod1 = 0;
//int mod2 = 0;
//for (int i = 0; i < k;... | #include <iostream>
//#include <string>
//#include <algorithm>
using namespace std;
int main()
{
int X;
cin >> X;
cout << 100 - X%100;
} |
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
using namespace std;
#define REP(i,n) for(ll (i) = (0);(i) < (n);++i)
#define REV(i,n) for(ll (i) = (... | #include <bits/stdc++.h>
#include <cstdlib>
#include <pthread.h>
#include <sstream>
#include <string>
using namespace std;
#define mem1(a) memset(a,-1,sizeof(a))
#define mem0(a) memset(a,0,sizeof(a))
#define ln "\n"
#define ll long long int
#define Mod 1000000007
#define lld long double
template<typename T_vector>
vo... |
#include <bits/stdc++.h>
#define MAX 50
#define SQRDMAX 2500
#define K 1
using namespace std;
int si, sj, tiles[SQRDMAX], weights[SQRDMAX];
list<tuple<int, int>> path;
bitset<SQRDMAX> visited;
const int directions[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
void setTile(int i, int j) {
visited.flip(i * MAX + j);
... | #include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
int main() {
int n = ri();
int a[n];
for (auto &i : a) i = ri();
int res = 2000000000;
for (int i = 0; i < 1 << (n - 1); i++) {
int xored = 0;
int ored = 0;
for (int j = 0; j <= n; j++) {
if (j < n) ored |= a[j];
if (j == n ... |
#include"bits/stdc++.h"
#define rep(i,n) for(ll i=0;i<n;++i)
#define ALL(x) x.begin(),x.end()
#define BACK(x) x.rbegin(),x.rend()
#define MOD 1000000007
#define INF INT_MAX
#define FLOAT_ANS setprecision(30)
#define elif else if
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main(void)... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <functional>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <bitset>
#include <math.h>
#include <random>
#include <chrono>
#include <assert.h>
#include <climits>
using n... |
#include <bits/stdc++.h>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9+7))
#define REP(i, n) for(int i=0;i<int(n);++i)
#define REPA(x, v) for(auto&& x:v)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#de... | #include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <stack>
#include <cassert>
#include <map>
#include <numeric>
#include <cstring>
#include <set>
#include <ctime>
#include <queue>
#include <cmath>
#include <iomanip>
#include <iterator>
#include <bitset>
#include <unordered_set>
usin... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,k,right=1000000000,left=-1; cin >> n >> k;
int lim = k*k/2 + 1;
bool a;
vector<vector<int>> park(n,vector<int>(n));
vector<vector<int>> s(n+1,vector<int>(n+1));
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cin >> park.at(i).at(j);
}
}
while(rig... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define pp pair<ll,ll>
#define ld long double
#define all(a) (a).begin(),(a).end()
#define mk make_pair
constexpr int inf=1000001000;
constexpr ll INF=2e18;
constexpr ll mod=1000000007;
// ll MOD=998244353;
... |
#include <iostream>
#include<string>
using namespace std;
string nyu,totyu,kekka;
int main() {
cin >> nyu;
char totyu = nyu[0];
string kekka = nyu + totyu;
kekka = kekka.erase(0,1);
cout <<kekka;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int... |
#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 vpll=vector<ll>;
using v... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define mp make_pair
#define fr first
#define sc second
int n,m,q;
int w[52],v[52];
int x[52];
int main(){
scanf("%d%d%d",&n,&m,&q);
for(int i=0;i<n;i++){
scanf("%d%d",&w[i],&v[i]);
}
for(int i=0;i<m;i++)scanf(... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
using P = pair<long long,long long>;
using ll = long long;
int main() {
ll N,W;
cin >> N >> W;
int p[N];
vector<tuple<int,int,int>> vec(N);
rep(i,N) cin >> get<0>(vec.at(i)) >> get<1>(vec.at(i)) >> get<2>... | // AtCoder template
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i = 0; i < n; ++i)
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,m; cin >> n >> m;
vector<ll> h(n); rep(i,n) cin >> h[i];
vector<ll> w(m); rep(i,m) cin >> w[i];
sort(h.b... |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define ll long long
#define vi vector<int>
#define pii pair<int,int>
#define F first
#define S second
#define pb push_back
#define rep(i, a, b) for(int i = a; i < b; i++)
#define repr(i, a, b) for(int i = a - 1; i >= b; i--)
#define ite... | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
ll a,b;
cin>>a>>b;
if(a==b)
{
vector<ll>v;
for(ll i=1; i<=a; i++)
{
v.push_back(i);
v.push_back(i*-1);
}
ll si=v.size();
for(ll i=0; i<si-1; i++)
... |
#include<bits/stdc++.h>
#define FastIO ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define uniq(v) (v).erase(unique(all(v)),(v).end())
#define sz(x) (int)((x).size())
#define fr first
#define sc ... | #include<bits/stdc++.h>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <stdlib.h>
#include <vector>
#include <set>
#include <cassert>
#include <numeric>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
#define ALL(a) (a).begin(),(a).end()... |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VP... | #ifdef GCC_VERSION
#include<bits/stdc++.h>
#endif
#include <iostream>
#include <set>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <tuple>
#include <algorithm>
#include <functional>
#include <deque>
#include <queue>
#include <cstring>
#include <chrono>
#include <numeric>
#ifdef _DEBUG
... |
#include "bits/stdc++.h"
using namespace std;
#define mod 1000000007
#define pie 3.142857143
#define ll long long int
#define fr(i,a,n) for(ll i=a;i<n;i++)
#define vi vector<int>
#define vlli vector<ll>
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define fv(i,a) for(auto i:a)
#define sz(a) int((a).si... | #include<bits/stdc++.h>
// #include<atcoder/all>
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
#define all(x) (x).begin(),(x).end()
#pragma ... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
double n,x0,y0,xn2,yn2;
cin>>n>>x0>>y0>>xn2>>yn2;
double cx=(x0+xn2)/2;
double cy=(y0+yn2)... | #include <bits/stdc++.h>
using namespace std;
#define For(i,n) for(ll i = 0; i < n; i++)
#define For1(i,n) for(ll i = 1; i < n; i++)
#define Forn(i,n) for(int i = n-1; i >=0 ; i--)
#define FOR(i,f,n) for(ll i = f; i < n; i++)
#define Forit(it,v) for(auto it = v.begin(); it != v.end(); it++)
#define pb push_back
#defin... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#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++)
using ll = long long;
using vec = vector<ll>;
using vec2 = vector<vector<ll>>;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
int main(){
ll h,... |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define endl "\n"
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int n,m,t;
cin >> n >> m >> t;
pair<int,int> arr[m];
for (int i=0;i<=m-1;i++)
{
cin >> arr[i].first >> arr[i].secon... | #include<iostream>
using namespace std;
int main()
{
int n, m, t;
bool yee=true;
cin>>n>>m>>t;
int r=0;
int last=0;
int mx=n;
while(m--)
{
int a,b;
cin>>a>>b;
int now=a-last;
n-=now;
if(n<=0) {yee=false;}
n=min(mx,(n+b-a));
... |
#include <bits/stdc++.h>
#define Rep(i,n,m) for(int i=(int)(n);i<(int)(m);i++)
#define rep(i,n) Rep(i,0,n)
#define all(v) v.begin(),v.end()
using namespace std;
using ll=long long;
using vi=vector<int>;
#define _GLIBCXX_DEBUG
const int mod=998244353;
int main(){
int N;cin>>N;
vector<int> f(N); rep(i,N) cin >> f... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define drep(i,n) for (int i = (n)-1; i >= 0; --i)
#define dup(x,y) (((x)+(y)-1)/(y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const l... |
#include <bits/stdc++.h>
#define pb push_back
#define ff first
#define ss second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll INF = (ll)1<<62;
const ll MOD = 1e9+7;
const int iINF = 1<<30;
const double PI = 3.14159265359;
void solve(){
ll n;
cin >> n;
vector<ll> fi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define int long long int
#define INF 1e14
#define dd double
#define MOD 1000000007
#define my_sizeof(type) ((char *)(&type+1)-(char*)(&type))
#define nl cout<<endl
#define fill(a,val) memset(... |
#include <bits/stdc++.h>
#define int long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define pre(i,a,b) for(int i=(b);i>=(a);i--)
#define ios ios::sync_with_stdio(false),cin.tie(0);
#define pb push_back
#define ps push
#define fi first
#define se second
#define ps push
#define Inf 0x3f3f3f3f3f3f3f3f
#define eps ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fast_io ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define all(v) v.begin(),v.end()
const int mod = 1e9 + 7;
int main (){
fast_io;
int n;
cin >> n;
string s;
cin >> s;
string start = s.substr(0, ... |
/*
Another source code by:
_ _ _ _ _ _____ _
| \ | (_) | (_) / ____| | |
| \| |_| |_ _ _ __ | | __ _ __ | |_
| . ` | | __| | '_ \| | |_ | '_ \| __|
| |\ | | |_| | | | | |__| | |_) | |_
|_| \_|_|\__|_|_| |_|\_____| .__/ \__|
| |
... | #include <bits/stdc++.h>
namespace IO{
char buf[1000000],*p1,*p2;
inline char getc(){
if(p1==p2) p2=(p1=buf)+fread(buf,1,10,stdin);
return p1==p2?EOF:*(p1++);
}
template<typename tp>inline void r(tp &n){
n=0;char c=getc();
while(!isdigit(c)) c=getc();
while( isdig... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAXN = 2e1 + 5;
int fa[MAXN];
int find(int x) {
return fa[x] == x ? x : fa[x] = find(fa[x]);
}
void merge(int x, int y) {
fa[find(y)] = find(x);
}
vector<int> vec;
int res, col[MAXN];
int n, m, g[MAXN][MAXN];
void dfs(int k) {
if (... | #include <cstdio>
int n, x, sum, a, b;
int main() {
scanf("%d%d", &n, &x);
x *= 100;
for(int i = 1; i <= n; i++){
scanf("%d%d", &a, &b);
sum += a*b;
if(sum > x) return printf("%d", i), 0;
}
puts("-1");
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
int total = 0;
cin >> N;
for(int i = 1;total < N;i++){
total += i;
if(total >= N){
cout << i << endl;
break;
}
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
int n;
cin>>n;
vector<int> t(n);
int sum=0;
rep(i,n){
cin>>t[i];
sum+=t[... |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vpl = vector<pair<ll, ll>>;
using pll = pair<ll, ll>;
#define rep(i, k, n) for(ll i = k; i < n; i++)
#define pb push_back
#define mp make_pair
//dijkstra + bitDP
ll n, m, k;
co... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll x,y,r,ans;
ll inp(){
string s;
bool f=true,neg=false;
cin>>s;
if(s.front()=='-'){
s.erase(s.begin());
neg=true;
}
for(int i=0;i<s.size();i++)if(s[i]=='.'){
while(s.size()<=i+4)s+='0';
f=false... |
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <string>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n) - 1; i >= 0; i--)
#define FOR(i, a, b) for... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,c,i,j,x,y,z,m,l,k=0,op=0,c1=0,sum=0,x1,y1,po=1;
cin>>n>>x>>y>>z;
cout<<(n*z)-(x*y);
return 0;
}
|
/*----------------------*/
/*----- Monazo1997 -----*/
/*----------------------*/
#include <bits/stdc++.h>
using namespace std;
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
typedef long long ll;
#define FIN ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define forr(i, a, b) for(ll i = (... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,sa,wa;
vector<int> god;
cin>>a>>b;
if(a==b){
for(int i=1;i<=a;i++){
god.push_back(i);
god.push_back(-1*i);
}
}else if(a>b){
sa=a-b;
wa=0;
for(int i=1;i<=sa+1;i++){
god.push_back(i);
wa+=i;
}
... |
#include <bits/stdc++.h>
using namespace std;
#define fr(i,n) for(int i = 0; i<n; i++)
typedef long long ll;
#define rmin(a,b) a = min<ll>(a,b)
//solves https://atcoder.jp/contests/abc193/tasks/abc193_e
ll div(ll a, ll b, bool ceil){
ll ans = abs(a/b);
bool pos = (a<0)==(b<0);
if(a%b and ceil==pos) ans++;
if(!po... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
#include<cstdio>
#include<map>
#include<set>
#include<cmath>
using namespace std;
typedef long long ll;
int main(){
int n;cin>>n;
ll size=pow(2,n);
ll res1=0,res2=0,maxv1=0,maxv2=0;
for(int i=0;i<size/2;i++){
... |
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
using namespace std;
const int INF = 1 * (1 << 30);
const int mINF = -1 * (1 << 30);
int main()
{
string s;
cin >> s;
if (s.find(".") != string::npos)
{
s.erase(s.find("."));
}
cout << s << endl... | #include<bits/stdc++.h>
using namespace std;
#define _ 0
const int maxn=1e5+5;
const int inf=0x3f3f3f3f;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
string x;
cin>>x;
for(int i=0;i<=x.size()-1;i++)
{
... |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i,n) for(int i = 0; i < (n); i++)
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
sort(a.begin(), a.end());
ll ans = 0;
rep(i,n) ... | #include<bits/stdc++.h>
using namespace std;
#pragma region atcoder
/*#include <atcoder/all>
using namespace atcoder;
//using mint = modint998244353;
//using mint = modint1000000007;*/
#pragma endregion
#pragma region macros
using ll = long long;
using pii = pair<int, int>;
template <class T> using V = vector<T>;
templ... |
/*
Author: Arnab Sinha
███████╗██╗ ██╗███████╗██████╗ ██╗ ██████╗ ██████╗██╗ ██╗███████╗██████╗ █████╗ █████╗
██╔════╝██║ ██║██╔════╝██╔══██╗ ██║ ██╔═══██╗██╔════╝██║ ██╔╝██╔════╝██╔══██╗██╔══██╗██╔══██╗
███████╗███████║█████╗ ██████╔╝ ██║ ██║ ██║██║ █████╔╝... | #include <iostream>
#include <vector>
#include <algorithm>
int main(){
int N;
std::cin >> N;
std::vector<int> A(N), B(N);
for(int i=0; i<N; ++i){
std::cin >> A.at(i) >> B.at(i);
}
int A_min=A.at(0), A_i=0, B_min=B.at(0), B_i=0;
for(int i=0; i<N; ++i){
if(A_min>A.at(i)){
A_min = A.at(i); A_i = i;
}
if... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007;
constexpr long long INF = 1000000000 + 100;
constexpr long long LINF = 1000000000000000000 + 100;
#define all(v) v.begin(), v.end()
#define rep(i, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main() {
LL N, L, R;
scanf("%lld",&N);
L = 0, R = N + 1;
while(L < R - 1) {
LL mid = (L + R) / 2;
//printf("%lld %lld %lld\n",L,R,mid);
if (mid > 2e9) {
R = mid;
} else if ((mid + 1) * ... |
#include<bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll MOD = 1000000007;
int main() {
string S;
cin >> S;
REP(i, S.size() - 1) {
i += 1;
if(!('A' <= S[i] && S[i] <= 'Z')) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define pb push_back
#define eb emplace_back
#define sz size
#define ALL(v) v.begin(),v.end()
const long long INF = 1LL << 60;
using namespace std;
using ll = long long;
using P = pair<in... |
#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#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{... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(void){
int n;
cin >> n;
vector< int > p(n+1);
vector< vector< int > > p2c(n+1, vector< int >());
for(int i = 2; i <= n; i++){
cin >> p[i];
p2c[p[i]].push_back(i);
}
vector< int > dp(n+1,... |
#include <iostream>
using namespace std;
typedef long long ll;
int main (void)
{
ll b , c;
cin >> b >> c;
ll la , ra , lb , rb;
ll ans = 0;
if (b > 0)
{
lb = b - c / 2;
rb = b + (c - 2) / 2;
la = -b - (c - 1) / 2;
ra = -(b - (c - 1) / 2);
if (lb > ra)
ans = rb - lb + ra - la + 2;
else
ans =... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
int main(){
ll b,c;cin>>b>>c;
ll ans=0;
bool f=true;
if(b<0) f=false;
b=abs(b);
if(b==0){
ans=c;
}else if(c>2*b){
if(f) ans=2*b+c-1;
else ans=2*b+c;
}else if(c>=3){
ans=2*c-1;
... |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int N_MAX = 5002;
int p=998244353;
short c[5002][5002];
typedef long long ll;
int main()
{
int h,w,k,hh,ww,i,j,l,t;
ll m[N_MAX];
char cc;
cin >> h >> w >> k;
vector<ll> res(h+w-1),b(h+w-1);
for(i=0;i<h;i++)
fill(c[i],c[i]+w,0);... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9+7;
int solve_naive(const int n, const int s, const int k){
int cnt = 0;
ll now = s;
while (now % n != 0 && cnt < n){
now += k;
cnt += 1;
}
if (cnt >= n){
return -1;
}
return cn... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
const int INF = int (1e9) + int (1e5);
const ll INFL = ll(2e18) + ll(1e10);
const ui MOD = 1E9 ... | #include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
#include<numeric>
using namespace std;
using ll = int64_t;
using Graph = vector<vector<int> >;
cons... |
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
constexpr int MOD = 998244353;
constexpr int prob = 665496236;
long long dp[5001];
int pow(long long x, int n){
long long ret = 1;
while (n > ... | #include <bits/stdc++.h>
#define fir first
#define sec second
#define PB push_back
#define MP make_pair
#define all(a) (a).begin(), (a).end()
#define sz(a) (a).size()
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i < (int)(n); ++i)
#define foreach(itr, c)... |
// Problem: E - Come Back Quickly
// Contest: AtCoder - AtCoder Beginner Contest 191
// URL: https://atcoder.jp/contests/abc191/tasks/abc191_e
// Memory Limit: 1024 MB
// Time Limit: 3000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <algorithm>
#include <bitset>
#include <cassert>
#includ... | #pragma GCC optimize("Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
template<typename T>
vector<T> dijkstra(int s, vector<vector<pair<int, T>>> &G){
const int n = G.size();
vector<T> d(n, numeric_limits<T>::max());
vector<int> b(n, -1);
priority_queue<pair<T, int>, vector<pair... |
#include <bits/stdc++.h>
using namespace std;
int a,b,c;
int main(){
cin>>a>>b>>c;
set<int> se;
se.insert(a);
se.insert(b);
se.insert(c);
if(se.size()==3)cout<<0<<endl;
else{
if(a==b)cout<<c<<endl;
else if(b==c)cout<<a<<endl;
else cout<<b<<endl;
}
} | #include <bits/stdc++.h>
const long long INF = 1e9;
const long long MOD = 1e9 + 7;
//const long long MOD = 998244353;
const long long LINF = 1e18;
using namespace std;
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIB... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
long long S=0,ans=0;
vector<long long> A(N);
for(int i=0;i<N;i++){
cin >> A[i];
S+=A[i];
}
sort(A.begin(),A.end());
for(int i=0;i<N;i++){
ans+=S-(N-i)*A[i];
S-=A[i];
}
cout... | #include <bits/stdc++.h>
#include <numeric>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = (int)(n) - 1 ; i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (int)(b); i++)
#define ALL(v) (v).begin(), (v).end()
#define MIN(v) *min_element((v).begin(), (v).end())
#define MAX(v) ... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#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 co(... | #include<bits/stdc++.h>
using namespace std;
//======================
//
// Template OleschY
//
// Die M�glichkeiten der deutschen Grammatik k�nnen
// einen, wenn man sich darauf, was man ruhig, wenn
// man m�chte, sollte, einl�sst, �berraschen.
// - @Gedankenbalsam
//
//======================
//====================... |
#include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#include<tuple>
#include<cstring>
#include<bitset>
#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define ... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <ios>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using Q = tuple<int,int,int, int, int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
r... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); ++i)
#define fixed_setprecision(n) fixed << setprecision((n))
#define execution_time(ti) printf("Execution Time: %.4lf sec\n", 1.0 * (clock() - ti) / CLOCKS_PER_SEC);
#define pai 3.1415926535897932384
#define NUM_MAX 2e18
#define NUM_MIN -1e9
using names... |
#include <iostream>
#include <sstream>
#include <algorithm>
#include <cmath>
#include <functional>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
using namespace std;
#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; ... | #include <bits/stdc++.h>
#define ll long long
#define rgi register int
using namespace std;
const int M=2e3+7,modd=998244353;
int n,m;
bitset<M>a[M];
inline int read(){
int w=0,r=1;char c=getchar();
while(!(isdigit(c)||c=='-'))c=getchar();
if(c=='-'){r=-1;c=getchar();}
while(isdigit(c)){w=(w<<3)+(w<<1)+c-'0';c=getc... |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define REP(i,n) for(int _n=n, i=0;i<_n;++i)
#define FOR(i,a,b) for(int64_t i=(a),_b=(b);i<=_b;++i)
#define FORD(i,a,b) for(int64_t i=(a),_b=(b);i>=_b;--i)
using ull = uint64_t;
using... | #include <algorithm>
#include <cstdio>
#include <cmath>
using std::min;
long long c1, r1, c2, r2;
int main(void) {
scanf("%lld%lld%lld%lld", & r1, & c1, & r2, & c2);
if (r1 == r2 && c1 == c2) {
puts("0");
return 0;
}
if (llabs(r2 - r1) + llabs(c2 - c1) <= 3 || r1 + c1 == r2 + c2 || r1 - c1 == r2 - c2) {
put... |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
const int MAX = 200000;
int main(){
int N,M,Q,op[MAX],p[MAX],A,B;
bool rev=false;
ll multX,multY,plusX,plusY,preM,preP,x,y;
vector<int> q[MAX],index[MAX];
vector<P> first;
P xy[MAX];
P an... | #include <iostream>
#include <cstdio>
#include <vector>
#include <iomanip>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <queue>
using namespace std;
using VI = vector <int>;
using VVI = vector <VI>;
using DI = deque <int>;
const int INF ... |
#include<iostream>
#include<cctype>
using namespace std;
int main(void){
char a,b;
cin>>a>>b;
cout<<(char)(a=='Y'?toupper(b):b)<<endl;
return 0;
} | /** I can do this all day **/
#pragma GCC optimize("O2")
#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;
#define all(x) (x).begin(),(x).e... |
#include <bits/stdc++.h>
using namespace std;
int main(void){
string str1,str2;
int i;
cin >> str1;
str2 = "";
for(i=0;i<str1.size();i++){
if(str1.at(str1.size()-i-1) == '6')str2 += "9";
else if(str1.at(str1.size()-i-1) == '9')str2 += "6";
else str2 += str1.at(str1.size()-i-1);
}
cout << str2... | #include<bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
int n;
cin >> n;
int ans = n / 100;
if ( n % 100 ) ans ++;
cout << ans;
}
|
#include<bits/stdc++.h>
using namespace std;
# define ll long long
# define read read1<ll>()
# define Type template<typename T>
Type T read1(){
T t=0;
char k;
bool vis=0;
do (k=getchar())=='-'&&(vis=1);while('0'>k||k>'9');
while('0'<=k&&k<='9')t=(t<<3)+(t<<1)+(k^'0'),k=getchar();
return vis?-t:t;
}
# define fre(k... | #include<bits/stdc++.h>
#define dbug printf("I am here\n");
#define Fast ios_base::sync_with_stdio(false); cin.tie(0);
#define vs v.size()
#define ss s.size()
#define sz(a) a.size()
#define sot(v) sort(v.begin(),v.end())
#define all(v) (v).begin(), (v).end()
#define rev(v) re... |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#in... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
const int areTests = 0;
string s;
void run_test(int testcase) {
cin >> s;
int ans = 0;
for(int pin = 0; pin < 10000; pin++) {
string str = to_string(pin);
while(str.size() < 4) str = "0" + str;
set <int> r;
for(int i = 0; i < 10; i++) {
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define all(v) v.begin(), v.end()
const ll mod=1000000007;
const string yesno(bool ans){
return (ans?"Yes":"No");
}
int main() {
int a,b;cin>>a>>b;
int x,y;
x=(a+b)/2;
y=(a-b)/2;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
int main(){
ios_base::sync_with_stdio(0);
cin.tie(NULL); cout.tie(NULL);
int a, b, suma = 0, sumb = 0;
cin >> a >> b;
while(a){
suma += a % 10;
a /= 10;
}
while(b){
sumb ... |
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
double pi=acos(-1);
#define ll long lon... | #include<bits/stdc++.h>
#define int long long
#define rep(i,a,b) for(register int i=(a);i<=(b);i++)
#define per(i,a,b) for(register int i=(a);i>=(b);i--)
using namespace std;
const int N=2009,inf=0x3f3f3f3f3f3f3f3f;
inline int read() {
register int x=0, f=1; register char c=getchar();
while(c<'0'||c>'9') {if(c... |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
char s=S.at(0);
string Sback=S.substr(1);
cout << Sback+s << endl;
} | #include <bits/stdc++.h>
#include <algorithm>
using namespace std;
typedef long long int ll;
int main(){
string s;
cin>>s;
reverse(s.begin(),s.end());
for(int i=0;i<s.length();i++){
if(s[i]=='6'){
s[i]='9';
}
else if(s[i]=='9'){
s[i]='6';
}
}
cout<<s<<endl;
return 0;
}
|
#include <bits/stdc++.h>
int main(){
int N, M;
std::cin >> N >> M;
std::vector< std::vector< int > > AB(N);
std::map< int, int > cost;
for(int i=0; i<M; i++){
int a, b, c;
std::cin >> a >> b >> c;
a--;
b--;
int ab = a * N + b;
auto itr = cost.find(ab)... | #include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
typedef long long LL;
const LL MOD = 1e9 + 7;
const int N = 1e5 + 7, M = 1e7, OO = 0x3f3f3f3f;
#define AC ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin.sync_with_stdio(0);
int main()
{
LL n,m,t,flag=1,last=0,cap;
cin>>n>>m>>t;
cap=n;
... |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
void Main() {
double A, B, W;
cin >> A >> B >> W;
W *= 1000;
double minimum = W / B;
double maximum = W / A;
bool foundMin = false;
bool foundMax = false;
int minInt = 1000000000;
int maxInt = -1;
for (int i ... | /*
Author : MatsuTaku
Date : 02/18/21
*/
#include <bits/stdc++.h>
using namespace std;
#include <x86intrin.h>
#ifndef ONLINE_JUDGE
#define Assert(cond) assert(cond)
#else
#define Assert(cond)
#endif
#define rep(i, n) for (size_t i = 0, i##_len = (n); i < i##_len; i++)
using lint = long long in... |
#include <bits/stdc++.h>
template<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}
template<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i... | #include <bits/stdc++.h>
using namespace std;
vector<int> v , T;
void build(int node, int l, int r) {
if (l == r) {
T[node] = v[l];
}
else {
int mid = (l + r) / 2;
build(2 * node, l, mid);
build(2 * node + 1, mid + 1, r);
T[node] = T[2 * node] ^ T[2 * node + 1];
}... |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
#include <set>
#include <functional>
#include <... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <sstream>
#include <unordered_map>
#include <unordered_se... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxN = 205;
vector <int> v[2];
int dp[maxN][maxN][maxN][2][2];
int a[maxN];
int n;
int rec(int pos = 0, int s1 = 0, int s2 = 0, bool ac1 = 0, bool ac2 = 0) {
if(pos == n) return (s1 == s2 && ac1 && ac2);
int &res = dp[pos][s1][s2][ac1]... | #include <bits/stdc++.h>
#define debug(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long LL;
const int MAXN = 55;
const int MOD = 1E9 + 7;
LL n, x, a[MAXN], g[MAXN], lim[MAXN], dp[MAXN][2];
template <class T>
void read(T& x) {
x = 0;
T f = 1;
char ch = getchar();
while (ch <... |
#include<iostream>
#include<vector>
#include<cmath>
#include<string>
#include<algorithm>
#include<map>
#include<utility>
#include<cstdio>
#include<cmath>
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL<<60;
const ll di[] = {-1, 0, 1, 0};
const ll dj[] = {0, -1, 0, 1};
vec... | #include <bits/stdc++.h>
#define REP(i, nn ) for(int i = 0 ; i < (int) nn; i++)
#define REPS(i, ss, nn ) for(int i = ss ; i < (int) nn; i++)
#define REV(i, ss, nn ) for(int i = ss ; i >= nn; i--)
#define deb(x) std::cout << #x << " " << x << endl;
#define debl(x) std::cout << #x << " " << x << " ";
#define all(x) x.beg... |
#include <bits/stdc++.h>
#define ll long long
#define int long long
#define arr(a) new int[a]
#define db1(x) cout<<#x<<"="<<x<<'\n'
#define db2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<'\n'
#define db3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<'\n'
#define dbV(arr) cout << #arr << "=[ "; \
for(auto i:ar... | #include<bits/stdc++.h>
using namespace std;
#define loopi(n) for(ll i=0;i<n;i++)
#define loopj(n) for(ll j=0;j<n;j++)
#define loopk(n) for(ll k=0;k<n;k++)
#define loopnode(v) for(ll i : v)
#define mod7 1000000007
#define mod9 1000000009
#define mod8 100000000
#define modl 998244353
#define pb push_back
#define mp mak... |
#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false);cin.tie(0);
#define ch(a) (int(a-'a')+1)
#define mm(a) memset(a,0,sizeof(a))
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define inf 0x7FFFFFFF
typedef long long ll;
const int Maxx=3*1e5+10;
ll a[Maxx];
int main()
{
int n;
IO... | #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>
#define ll long long
#define X first
#define Y second
#define pii pair<int,int>
#define ld long long double
using namespace std;
int const N = 18;
int x[N], y[N], z[N];
int target;
ll oo = 1e16;
int n;
ll mem[N][1<<18];
ll cal(int i, int j){
return abs(x[i] - x[j]) + abs(y[i]-y[j]) + max(0... | #include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
#define endl "\n"
vector<bool>B(100005);
vector<bool>B2(100005);
vector<int>Ans(100005);
struct Edge {
int to, id;
Edge(int to, int id) :to(to), id(id) {}
};
vector<Edge>g[100005];
vector... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios_base::sync_with_stdio(false); cin.tie(nullptr);
ll n; cin >> n;
if(n % 100 == 0)
{
cout << 100;
return 0;
}
else
{
ll p = n / 100;
p++;
p = p * 100;
cout << ab... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <assert.h>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <map>
#include <unordered_map>
#includ... |
#include <iostream>
int main()
{
int N;
std::cin>>N;
int result=1e9+1;
int A,P,X;
for(int i=0;i<N;i++)
{
std::cin>>A>>P>>X;
if(X-A>0)if(result>P)result=P;
}
if(result==1e9+1)result=-1;
std::cout<<result<<std::endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<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 mx = 0; int mn = 10000;
for(int i = 0; i < N; i++){
mx = max (A[i], mx);
mn = min(B[i], mn);
... |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
using ll = long long int;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);
#define l_ength size
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll b){
... | #include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep(i, n) repd(i, 0, n)
using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
const ul mod = 1000000007;
class number {
public:
l... |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#define rep(x, s, t... | #include<bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimization ("unroll-loops")
using namespace std;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
temp... |
#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>;
const int MOD = 1000000007;
int main() {
int T;
cin >> T;
rep(i, T) {
ll N, A, B;
cin >> N >> A >> B;
ll d = max(0LL, N - A - B + 1) % MOD... | // 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... |
#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"bits/stdc++.h"
using namespace std;
typedef long long ll;
int main(){
ll n,k;
cin>>n>>k;
vector<pair<ll,ll>>a(n);
for(ll i=0;i<n;i++)cin>>a[i].first>>a[i].second;
sort(a.begin(),a.end());
ll now=0;
for(ll i=0;i<n;i++){
if(k-(a[i].first-now)<0){
cout<<now+k<... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)//iをaからn
#define per(i,n,a) for (int i=a-1;i>=n;i--)//iをnからa
#define db(x) cout << #x << " = " << x << endl
#define db2(x, y) cout << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")\n"; //デバッグ用
#define all(x) (x).begin(), (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int arr[3];
for(int i=0;i<3;i++){
cin>>arr[i];
}
sort(arr,arr+3);
cout<<(arr[1]+arr[2]);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repll(i,n) for(long long i = 0; i < (long long)(n); i++)
int main(){
int t;
cin >> t;
rep(i, t){
string s;
cin >> s;
int ans = 0;
if(string(s.size()... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ff first
#define ss second
#define rsz resize
#define ins insert
#define mp make_pair
#define pf push_front
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
#define sz(x) (int)(x).siz... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int x;
cin>>x;
cout<<max(x,0ll)<<endl;
} | #include<bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
if(x < 0) cout << "0" << endl;
else cout << x << endl;
} |
#pragma GCC optimize("O3")
#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 ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
// find_by_order(k): It returns to ... | #include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define FIO ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define vi vector<ll>
#define pb push_back
#define F first
#define S second
#define all(v) (v).begin(),(v).end()
#define pii pair<ll,ll>
#define vii vector<pii>
#defin... |
#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/segtree>
// using namespace atcoder;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
typedef vector<pll> vpll;
typedef... | #include <bits/stdc++.h>
using namespace std;
// clang-format off
// #include <atcoder/all>
// using namespace atcoder;
// using mint = modint1000000007;
// using mint = modint998244353
using ll = int64_t;
template <class T>
istream& operator>>(istream& is, vector<T>& v) {
for (auto& a : v) cin >> a;
return is... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i64 i=0; i<n; i++)
#define all(v) v.begin(),v.end()
#define pp pair<int,int>
using Graph=vector<vector<int>>;
using i64=int64_t;
int main() {
int si,sj;cin>>si>>sj;
vector<vector<int>> t(50,vector<int>(50));
rep(i,50) {
rep(j,50) {
... | //雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se seco... |
#include <iostream>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <utility>
#include <queue>
#include <deque>
#include <iomanip>
#include <cmath>
// 最大公約数
template<typename T> T gcd(T a, T b)
{
if (a < b) {
return gcd(b, a);
}
else {
const T mod = a % b;
if (mod == 0) {
retu... | #include <bits/stdc++.h>
using namespace std;
int main() {int N;cin>>N;
vector<long long>A(N),B(N);
for(int i=0;i<N;i++)
cin>>A.at(i);
for(int i=0;i<N;i++)
cin>>B.at(i);
long long c=0;
int d=0;
for(int i=0;i<N;i++)
... |
// Rakib (CSE'19)
#include<bits/stdc++.h>
#define boost_ ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define pb push_back
#define read(i,n,a) f... | #include <bits/stdc++.h>
using namespace std;
#define ll long long //data types used often, but you don't want to type them time by time
#define ull unsigned long long
#define ui unsigned int
//#define ld long double
#define mod 998244353
//define inf 100000000000010
#define us unsigned short
#define IOS ios_base::sy... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
if (r1 == r2 && c1 == c2)
cout << 0 << endl;
else if (r1 + c1 == r2 + c2 || r1 - c1 == r2 - c2 ||
abs(r1 - r2) + abs(c1 - c2) <= 3)
cout << 1 << endl;
else if (a... | #line 1 "C.cpp"
#include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = std::int_fast64_t;
using std::cout;
using std::cerr;
using std::endl;
using std::cin;
template<typename T>
std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(siz... |
#include<iostream>
using namespace std;
int n,T[5007],C[5007],A[5007],G[5007];
char s[5007];
int main(){
cin>>n;
cin>>s+1;
for(int i=1;i<=n;i++){
T[i]=T[i-1];
C[i]=C[i-1];
A[i]=A[i-1];
G[i]=G[i-1];
if(s[i]=='A')A[i]++;
if(s[i]=='C')C[i]++;
if(s[i]=='G')G[i]++;
if(s[i]=='T')T[i]++;
}
int ans=0,a=0,c... |
// Problem : B - DNA Sequence
// Contest : AtCoder - AtCoder Regular Contest 104
// URL : https://atcoder.jp/contests/arc104/tasks/arc104_b
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
// $%U%$
// Mere bas ka nahi hai
// still i'm trying
// apna time... |
#include <bits/stdc++.h>
using namespace std;
#define fo(i, n) for (i = 0; i < n; i++)
#define Fo(i, k, n) for (i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
#define ll long long
#define si(x) scanf("%d", &x)
#define sl(x) scanf("%lld", &x)
#define ss(s) scanf("%s", s)
#define pi(x) printf("%d\n", x)
#define p... | #include<bits/stdc++.h>
using namespace std;
int n;
int main()
{
cin>>n;
for(int i=1;i<=n;++i)
printf("%d %d\n",(2*i)%n+1,(2*i-1)%n+1);
} |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx")
#pragma GCC target ("avx2,fma")
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
//#include <atcoder/all>
#define F first
#define S second
#define int long ... | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#define int long long
#define rep(i, n) for(i = 0; i < n; i++)
using namespace std;
const int DEPTH = 19... |
/*************************BALIGA***************************************/
#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;
#define lli long long int
#define ulli unsigned long long int
#define lld long double
#define MP ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x) cerr << "Line " << __LINE__ << ": " << #x << " = " << (x) << "\n";
#define spa << " " <<
#define fi first
#define se second
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
using ld =... |
#include <bits/stdc++.h>
//#include <chrono>
#pragma GCC optimize("Ofast")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using v... | #pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <limits>
#include <list>
#include <numeric>
#inclu... |
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <stack>
#include <queue>
#include <array>
#include <bitset>
#include <cstdio>
#include <string>
#include <vector>
#include <random>
#include <chrono>
#include <utility>
#include <numeric>
#include <cstdlib>
#include <cstring>
#incl... | #include <bits/stdc++.h>
using namespace std;
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << '(' << p.first << ',' << p.second << ')';
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << '{';
f... |
/*input
helloAtZoner
*/
#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 tree<long long,null_type,less_equal<long long>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
//order_of_key #of elements... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int run_test(){
string s;
cin >> s;
int ans = 0;
for(int i = 0; i <= 8; i++){
if(s[i] == 'Z' && s[i+1] == 'O' && s[i+2] == 'N' && s[i+3] =='e'){
ans++;
}
}
cout << ans;
return 0;
}
int main()
{
io... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main()
{
int n,x;
cin>>n;
int l=1,r=2e9;
while(r-l>1)
{
int m=l+r>>1;
if(m*(m+1)/2<=n+1)
l=m;
else
r=m;
}
cout<<n-l+1<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int K;
cin >> K;
ll ans = 0;
for (int i = 1; i <= K; i++)
{
int jEnd = K / i;
for (int j = i; j <= jEnd; j++)
{
int p = K / (i * j);
if (p < j)
break;
... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define deb(x) cout<< #x << " " << x << "\n";
#define MAX 9223372036854775807
#define MIN -9223372036854775807
#define setbits(n) __builtin_popcountll(n)
#define mkunique(a... | #include <bits/stdc++.h>
#define N 400005
#define ll long long
using namespace std;
inline int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int T;
int n;
int a[N];
int main()
{
n = read... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
class BIT{
public:
int size;
vector<long long> tree;
BIT(int n){
size = n;
tree = vector<long long>(n, 0);
return;
}
void add(int n, long long a) {
assert(n < size... | #include <bits/stdc++.h>
//#include <atcoder/modint.hpp>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
const int mod2=998244353;
using P = pair<int,int>;
using Pl= pair<ll,ll>;
using ld=long double;
using V=vector<int>... |
#include<bits/stdc++.h>
#define x first
#define y second
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define mem(x,val) memset(x,val,sizeof x)
#define pii pair<int,int>
#define pb emplace_back
#define ar array
#define int long long
#define FOR(i, a, b) for(int i = a; i < b; i++)
#define F0R(i, n)... | #include <bits/stdc++.h>
using namespace std;
int main(){
int A,B,C;
cin >>A>>B>>C;
if(A>B){
cout <<"Takahashi"<<endl;
}
if(A<B){
cout <<"Aoki"<<endl;
}
if(A==B){
if(C==0){
cout <<"Aoki"<<endl;
}
if(C==1){
cout <<"Takahashi"<<endl;
}
}
} |
#include<bits/stdc++.h>
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define sc(a) scanf("%c",&a)
#define ss(a) scanf("%s",a)
#define pi(a) printf("%d\n",a)
#define pl(a) printf("%lld\n",a)
#define pc(a) putchar(a)
#define ms(a) memset(a,0,sizeof(a))
#define repi(i, a, b) f... | #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 <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].... | // SmartCoder
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace __gnu_pbds;
using namespace std;
#define sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(), (c)... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
void solve(){
ll n,i,j;
cin >> n;
map<ll,ll> mp;
for(i=0;i<n;i++) {
ll x; cin >> x;
mp[x]++;
}
ll ans = n*(n-1)/2;
for(auto k:mp)
ans -= ( (k.second-1) * k.second ) / 2;
cout<< ans;
}
int main()... | #include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#i... |
#include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<map>
#include<vector>
#include<math.h>
#include<stdio.h>
#include<stack>
#include<queue>
#include<tuple>
#include<cassert>
#include<set>
#include<bitset>
#include<functional>
#include <fstream>
//#include<bits/stdc++.h>... | #include <bits/stdc++.h>
using namespace::std;
int main() {
int N;
cin >> N;
string s, t;
cin >> s >> t;
int s0 = 0;
int t0 = 0;
int ans = 0;
for(int i = 0; i < N; i++) {
if(s[i] == '0' && t[i] == '1') {
ans += 1;
s0 += 1;
} else if(s[i] == '1' &&... |
#include <algorithm>
#include <iostream>
#include <vector>
#include <set>
#include <cstdio>
#include <math.h>
#include <string>
#include <sstream>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <cassert>
#include <iterator>
#include <cstring>
#include <fstream>
#include <cstdio>
#inc... | #include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define gnr(i,a,b) for(ll i=ll(b)-1;i>=ll(a);i--)
#defi... |
#include <bits/stdc++.h>
using namespace std;
using db = double;
bool win(string s, string t) {
int num[2][10];
for (int i = 0; i < 2; i ++) {
for (int j = 0; j < 10; j ++) {
num[i][j] = 0;
}
}
for (int i = 0; i < 5; i ++) {
int kj = (int)s[i] - (int)'0';
num[0][kj] ++;
}
for (int j = ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int n, t1[10], t2[10], sum1, sum2;
string a, b;
double res;
int main() {
cin >> n >> a >> b;
REP(i, 4) t1[a[i]-'0']++, t2[b[i]-'0']++;
REP(i, 10) sum1 += i*pow(10, t1[i]), sum2 += i*pow(10, t2[i]);
for (int i=1; i<10; ... |
#include <array>
#include <iostream>
using namespace std;
using arr = array<int, 10>;
int func_g1(const arr& a) {
int t = 0;
for (int i = 9; i >= 0; i--) {
for (int jj = 0; jj < a[i]; jj++) {
t = t * 10 + i;
}
}
return t;
}
int func_g2(const arr& a) {
int t = 0;
for (int i = 0; i < 10; i++) ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
int main(){
int n,s,d;cin>>n>>s>>d;
string ans="No";
REP(i,n){
int x,y;cin>>x>>y;
if(s>x&&d<y) ans="Yes";
//if(d<y) ans="Yes";
}
cout<<ans<<endl;
} |
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const long long Maxn=2e5+10;
const long long Maxm=Maxn<<2;
const long long mod=998244353;
long long a[Maxn],c[Maxn];
long long tag[Maxm],sum[Maxm];
long long p[Maxn];
long long n,ans;
inline long long read()
{
long long s=0,... | #include <iostream>
#include <vector>
#include <utility>
#include<algorithm>
#include <string>
#include <map>
#include <cmath>
#include <queue>
#include <random>
#include <tuple>
#include <set>
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main(){
ll n;
cin >>... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; } //numの桁数を求める
int main()
{
ll n;
cin >> n;
ll a,b;
ll total = 0;
rep(i,n){
cin >> a >> b;
total += (b*(b+1)/2) - (a*(a-... | #pragma Ofast
//#pragma GCC optimize("Ofast,no-stack-protector")
#include<bits/stdc++.h>
#define int long long
#define float double
using namespace std;
signed main(){
srand(time(NULL));
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int a;
cin>>a;
string b;
cin>>b;
bool fail=0;
int suc=-1;
int three=3;
for(int ii... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.