code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include<bits/stdc++.h>
using namespace std;
const int N=2e+5+10;
vector<int> adj[N];
pair<int,int> edj[N];
int n,lft[N],rgt[N],t;
long long int c[N];
void dfs(int v,int p)
{
lft[v]=++t;
for(auto c:adj[v])
{
if(c!=p)
{
dfs(c,v);
}
}
rgt[v]=t;
}
int main()
{
cin>>n;
for(int i=1;i<n;i++)
{
cin>>edj[i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, s, n) for(int i = (int)(s); i < (int)(... |
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
#define inf 1000000000000000018
int mod = 1e9 + 7;
int po(int x, int y, int m) { if (y == 0) return 1; int t = po(x, y / 2, m) % m; t = (t * t) % m; if (y & 1) return (t * x) % m; return t % m; }
void fun() {
vector<vector<int>> ncr... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF INT_MAX
#define FIO ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL);
#define mod 1000000007ll
#define forn(i,n) for(in... |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < n; i++)
#define rep(i,a,n) for (int i = a; i < n; i++)
#define SORT(s) sort(s.begin(), s.end())
#define vi vector<int>
#define vll vector<ll>
#define vs vector<string>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
i... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
int n;
cin>>n;
int a[(1<<n)];
int maxi = -1,ind;
for(int i=0;i<(1<<n);i++) {
cin>>a[i];
if(maxi<a[i]){
maxi=a[i];
ind=i;
}
}
if(ind >= (1<<(n-1)) ){
maxi=-1;
... |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using vi = vector<int64_t>;
using vvi = vector<vi>;
using pii = pair<int64_t, int64_t>;
using vvp = vector<vector<pii>>;
int64_t INF = 1e18;
int64_t mod = 1e9+7;
... | #pragma GCC optimize("Ofast")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
const long double Pi = 3.141592653;
const ll mod=1e9+7;
long long INF = 1000000000000000000;
bool cmp(pair<int,int>a,pair<int,int>b)
{
... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve() {
int n, a;
string s;
cin >> n >> a >> s;
for (int i = 0; i < n; i++) {
if (s[i] == 'x') {
if (a > 0) {
a--;
}
} else {
a++;
}
}
cout << a << "\n";
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t = ... | #include<bits/stdc++.h>
#define rep(i, n) for(int i=0;i<n;++i)
using namespace std;
typedef long long ll;
int main() {
int n;
double d, h;
cin >> n >> d >> h;
double max_h = 0;
rep(i, n) {
double x, y;
cin >> x >> y;
max_h = max(max_h, (d * y - h * x) / (d - x));
}
... |
#include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
#define ui unsigned int
#define us unsigned short
#define inf_int 1e9
#define inf_ll 1e18
#define mod 1000000007
#define smod 998244353
const int maxN = 1e5 + 5;
ll table[maxN][2]; // + -
ll cnt[maxN][2];
ll mulmod(ll... | #include <cstdio>
#include <algorithm>
#define int long long
const int M = 200005, p = 998244353;
int n, m, f[20][M], fac[M], inv[M], ans;
int Pow(int a, int b) {
int an = 1;
while(b) {
if(b & 1) an = an * a % p;
a = a * a % p;
b >>= 1;
}
return an;
}
int C(int n, int m) {
if(n < m) return 0;
return fac[n] ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define rep2(i, s, n) for(long long i=(s);i<(long long)(n);i++)
#define repi(i, n) for(int i=0;i<(int)(n);i++)
#define rep2i(i, s, n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(), v.end()
#define rall(v) v... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPR(i, n) for (int i = (n); i >= 0; i--)
#define FOR(i, m, n) for (int i = (m); i < (int)(n); i++)
#define INF 1000000000
//配列 vector<型> 配列名(要素数, 初期値);
//二次元配列 vector... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define Pr pair<ll, ll>
#define Tp tuple<int, int, int>
using Graph = vector<vector<int>>;
vector<int> col;
vector<int> ans;
vector<int> col2;
// dfs
// s:始点 i:dfs回数 t:始点からの距離
vector<int> vis;
void d... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvl = vector<vector<long>>;
using pii = pair<int, int>;
using pil ... |
#include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
using namespace std;
int main()
{
vector<int> v;
vector<int> u;
int N,a,b;
cin>>N;
for(int i=0;i<N;i++){
cin>>a;
v.push_back(a);
}
for(int q=0;q<N;q++){
cin>>b;
u.push_back(b);
}
int result = inner_p... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define rep(i,a) for(ll i=0; i< a; i++)
#define rep1(i,a) for(ll i = 1; i< a; i++)
#define foi(i, a, b) for(ll i = a; i<b ; i++)
#define fod(i, a, b) for(ll i = a; i>=b ; i--)
#define max3(a, b, c) max(max(a, b), c)
#defin... |
#include <bits/stdc++.h>
using namespace std;
#define scd(v) scanf("%d",&v)
#define scld(v) scanf("%ld",&v)
#define sclld(v) scanf("%lld",&v)
#define scs(v) scanf("%s",&v)
#define sclf(v) scanf("%lf",&v)
#define rep(i, j) for(int i = 0;i < j;i++)
#define all(v) v.begin(),v.end()
#define cnt(v,n) count(ALL(v),n)
#defi... | #include <bits/stdc++.h>
using namespace std;
const int MX = 1e5 + 5;
int N, M;
long long int odd, even;
string s[MX];
int main(){
cin.tie(nullptr), ios::sync_with_stdio(false);
cin >> N >> M;
for(int i = 0; i < N; i++) cin >> s[i];
for(int i = 0; i < N; i++){
int cnt = 0;
for(char c... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
int T;
cin >> T;
ll tmp;
for (int i = 0; i < T; i++) {
cin >> tmp;
if(tmp%2){
cout << "Odd" << endl;
}else if(tmp%4){
cout << "Same" << endl;
} else{
co... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> v(n, vector<int> (4));
for (int i = 0; i < n; i++) {
v.at(i).at(0) = 500 * (i % 20);
v.at(i).at(1) = 1000 * (i / 20);
v.at(i).at(2) = v.at(i).at(0) + 500;
v.at(i).at(3) = v.at(i).at(1) + 1000;
}
... |
#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;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int getRand(int l, int r)
{
uniform_int_distribution<int> uid(l, r);
return uid(rng);... | #include<bits/stdc++.h>
using namespace std;
string s;
long long k , diff [300005] , num [300005][20];
long long mod = 1e9 + 7 , dp [200005][3][17] , kk;
map < char , long long > mp;
long long ff ( int x , int on , int dif )
{
if ( dif > 16 ) return 0;
if ( x == s . size () )
{
if ( dif == k ) retur... |
#include<bits/stdc++.h>
#define ll long long
#define rep(i,a,b) for(i=a;i<b;i++)
#define pb push_back
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define hell 1000000007
using namespace std;
ll pr (ll x , ll y)
{
ll ans=1;
if(y==0) return 1;
while(y>0)
{
if(y%2) ans*=x;
... | #include<bits/stdc++.h>
using namespace std;
#define GODSPEED ios:: sync_with_stdio(0);cin.tie(0);cout.tie(0);cout<<fixed;cout<<setprecision(15);
#define f first
#define s second
#define newl cout<<"\n";
#define pb push_back
#define mset(... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve() {
int a, b, c; cin >> a >> b >> c;
cout << a + b + c - min(a, (min(b, c))) << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input1.txt", "r", stdin);
freope... | #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++)
typedef long long ll;
#define ALL(v) v.begin(), v.end()
#define vmax(v) *max_element(ALL(v))
#define vmin(v) *... |
#include<stdio.h>
#include<iostream>
#include<stdlib.h>
#include<string>
#include<algorithm>
#include <cstring>
#include<math.h>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdint>
#include <map>
#include <functional>
using namespace std;
typedef long long ll;
typedef unsigned long long llu;
const... | #include "bits/stdc++.h"
using namespace std;
using ll=int64_t;
using ld=long double;
using ull=unsigned long long;
template <class T>
using grid=vector<vector<T>>;
#define ALL(x) x.begin(),x.end()
#define rep(iter,from,to) for(ll iter=from;iter<to;++iter)
const ll MOD=1e9+7;
const ll INF=1e17;
//#####################... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.en... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int mod = 998244353;
const int INF = 1e9 + 100;
const ll LINF = 1e18 + 100;
#ifdef DEBUG
#define dbg(x) cout << #x << " = " << (x) << endl << flush;
#define dbgr(s, f) { cout << #s << ": "; ... |
// D - Happy Birthday! 2
#include <bits/stdc++.h>
using namespace std;
#define vec vector
using vi = vec<int>;
#define rp(i,s,e) for(int i=(s);i<(e);++i)
#define sz(a) int(a.size())
int N;
vi A(200);
vec<vi> B(200);
vec<bool> used(200);
void print(int n, vi v){
cout<< n <<" "; rp(i, 0, n) cout<< v[i] << (i<n-1? " ":... | #include <bits/stdc++.h>
using namespace std;
const int N=2e2+5;
char w[N][N],s[N],t[N];
void prework(){
w['R']['R']=w['R']['S']=w['S']['R']='R';
w['S']['S']=w['S']['P']=w['P']['S']='S';
w['P']['P']=w['P']['R']=w['R']['P']='P';
}
int main(){
prework();
int n,k;scanf("%d%d%s",&n,&k,s);
while(k--)... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
int main(){
double t; ll n; cin>>t>>n;
double r=(100.0*n+t-1)/t;
cout<<(ll)r+(n-1)<<endl;
} | #include<algorithm>
#include<bitset>
#include<cassert>
#include<cfloat>
#include<climits>
#include<cmath>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_se... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef pair <int,int> Pii;
#define reg register
#define mp make_pair
#define pb push_back
#define Mod1(x) ((x>=P)&&(x-=P))
#define Mod2(x) ((x<0)&&(x+=P))
#define rep(i,a,b) for(int i=a,i##end=b;i<=i#... | #include <iostream>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <tuple>
#include <string>
#include <list>
#include <map>
using namespace std;
int min(int a,int b){
if(a>b){
return b;
}else{
return a;
}
}
long long in... |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int mask_to_int(string s)
{
int ret = 0;
for (size_t i = 0; i < s.size(); ++i)
ret = (ret * 2) + (s[i] == '1');
return ret;
}
int main()
{
int n, m;
cin >> n >> m;
vector<int> a(n);
for (int i = 0; i < n;... | #pragma GCC optimize("unroll-loops")
#pragma GCC optimize("O3")
#pragma GCC target("avx,avx2,fma")
#include <algorithm>
#include <iostream>
#include <utility>
#include <cstring>
#include <cassert>
#include <vector>
#include <random>
#include <cstdio>
#include <string>
#include <queue>
#include <tuple>
#include <map>
#i... |
#include <bits/stdc++.h>
using namespace std;
int h, w, a, b, res;
void dfs(int idx, int bt, int a, int b)
{
if (idx == h * w)
++res;
if (bt & (1 << idx))
dfs(idx + 1, bt, a, b);
if (b)
dfs(idx + 1, bt | (1 << idx), a, b - 1);
if (a)
{
if (!(bt & (1 << (idx ... | #include<bits/stdc++.h>
//#include <boost/math/common_factor.hpp>
using namespace std;
// Ordered Set VSCODE M KAM NI KARRA PATANI KIA DARD HAI
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type,less<int>, rb_tree_tag,tree_order_st... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define fill(a,b) memset(a,b,sizeof(a))
#define f first
#define s second
#define pb push_back
#define inf 1e17
#define ninf -1*1e17
#define mod 1000000007
#define N 500005
#defin... | #include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#define N 111
#define NN 401000
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 << 1) + (x << 3) + (... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a,b,c;
cin>>a>>b>>c;
ll x = max(a,max(b,c));
if(a == x) a = -1;
else if(b == x) b = -1;
else if(c == x) c = -1;
x += max(a,max(b,c));
cout<<x<<"\n";
}
| #include<bits/stdc++.h>
using namespace std;
// #define int long long int
#define ld long double
#define F first
#define S second
#define P pair<int,int>
#define pb push_back
#define mod 1000000007
#define endl '\n'
const int N = 1e5 + 5; //change it when n7eeded
void solve() {
int a[3];
for (int... |
#include<bits/stdc++.h>
using namespace std;
long long arr[300010];
long long arr2[300010];
int main()
{
long long a,b,c,d,e,i,j;
cin >> a >> b;
long long k=0,chk=0;
for(i=0;i<a;i++)
{
cin >> d;
arr[d]++;
chk=max(d,chk);
k=max(arr[d],k);
}
for(i=0;i<=chk;i+... | #include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<complex>
#include<cstdio>
#define initdp(a,b) for(int i=0;i<=a;i++)for(int j=0;j<=b;j++)dp[i][j]=-1;
#define fi first
#define se second
#define pb push_back
#d... |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
if(s[0] == s[1] && s[0] == s[2]){
cout << "Won" << endl;
}else{
cout << "Lost" << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
set<char> var(begin(s),end(s));
if(var.size()==1){
cout<<"Won";}
else{
cout<<"Lost";}}
|
#include <bits/stdc++.h>
#ifdef DEBUG_BUILD
# include "debugger.hpp"
#else
# define debug(...)
#endif
using namespace std;
using ll = long long;
using ld = long double;
using pll = std::pair<ll, ll>;
template <class T> using vec = std::vector<T>;
template <class T> using vec2 = std::vector<vec<T>>;
template <class T> u... | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include<string>
using namespace std;
int main(){
long long k;
cin>>k;
long long count1[10]={0};
long long count2[10]={0};
long long count3[10]={0};
for(long long i=1;i<=9;i++){
count3[i]=k;
}
string s;
string t;
cin>>s;
cin>>t;
for... |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/hash_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define LL long long
#define int long long
#define ull unsigned long long
#define fi first
#define s... | #include <iostream>
using namespace std;
int main()
{
int a,b,c,d;
cin >> a>>b>>c>>d;
cout << max(a,b)-min(c,d);
return 0;
} |
#include <iostream>
#include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
string p[520];
signed main(){
int mx = 0;
int h,w;
cin >> h >> w;
int ans = 1;
for(int i = 0;i < h;i++){
cin >> p[i];
}
bool able = true;
for(int i = 0;i < w;i++){
int sti = i;
int stj = 0;
bool... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define reg register
#define For(i,a,b) for(reg int i=a;i<=b;++i)
#define Down(i,a,b) for(reg int i=a;i>=b;--i)
#define ull unsigned long long
#define ll long long
inline int max(int x,int y){return x>y?x:y;}
inline int min(int x,int y){return x<y?x:y;... |
#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 int long long
#define ull unsigned long long
#define ll long long
#define M 998244353
#define pb push_back
#defin... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr long long MOD = 1e9 + 7;
template <typename T1, typename T2>
inline void chmin(T1 &a, T2 b) ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, l, n) for (int i = (int)(l); i < (int)(n); i++)
#define drep(i, n, l) for (int i = (int)(n); i > (int)(l); i--)
#define INF INT_MAX
#define INFF (pow(2,64))
#define def (200007)
#define MOD (1000000007)
typedef int64_t intt;
typedef vector<int> veci;
typedef ... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
using ld = long double;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vector<int>>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;
constexpr char newl = '\n'... |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author aajisaka
*/
#include<bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T... | #include<bits/stdc++.h>
using namespace std;
#define debug(n) cerr << #n << ':' << n << endl;
#define dline cerr << __LINE__ << endl;
using ll = long long;
template<class T, class U> using P = pair<T,U>;
template<class T> using Heap = priority_queue<T>;
template<class T> using heaP = priority_queue<T,vector<T>,gr... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, k, n) for (int i = k; i < (int)(n); i++)
#define repd(i, n) for (int i = n-1; i >= 0; i--)
#define rrepd(i, k, n) for (int i = n-1; i >= (int)(k); i--)
#define all(x) (x).begin(),(x).end()
#define chmax(x,y... | //Bismillahir Rahmanir Rahim
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<pair<int, int>> vpi;
#define pb push_back... |
#include <algorithm>
#include <array>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define ll long long
#define pii std::pair<int, int>
#define pdd std::pair<double, double>
#define INF (1LL << 33)
#d... | #include <bits/stdc++.h>
#define SIZE 200005
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
int A[SIZE];
int L[SIZE],R[SIZE];
int main()
{
int n;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&A[i]);
A[i]--;
}
set <int> zan,need;
for(int i=0;i+1<n;i++)
{
if(need.find(A[i])!... |
#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>
#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 all(c) begin(c), end(c)
#define ok() put... |
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
#define double long double
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef vector<pii> VP;
t... | /*include&using-----------------------------------------------------------------------*/
#include <bits/stdc++.h>
using namespace std;
/*debug-------------------------------------------------------------------------------*/
#define _GLIBCXX_DEBUG
#ifdef _DEBUG
#define debug(...) COUT(__VA_ARGS__)
#else
#define debug(..... |
#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 int long long
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
int32_t main()
{
int n,q;
cin>>n>>q;
order... | #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>
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin)... |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
struct point {
T x, y;
point() : x(), y() { }
point(T x, T y) : x(x), y(y) { }
point operator+() const { return *this; }
point operator-() const { return point(-x, -y); }
point &operator+=(const point &p) { return x += p.x, y... | #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 ... |
//https://atcoder.jp/contests/abc183/tasks/abc183_c
//C - Travel
#include <bits/stdc++.h>
using namespace std;
const int MAXN=10;
int nums[MAXN][MAXN];
int main() {
int n,k;
cin>>n>>k;
int i;
for (i=1; i<=n; i++) {
for (int j=1; j<=n; j++) {
cin>>nums[i][j];
}
}
... | #include <bits/stdc++.h>
#include <math.h>
#include <cmath>
using namespace std;
using ll =long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vecto... |
/*問題番号：A*/
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
if(N%100 == 0){
cout << N/100 << endl;
}
else{
cout << N/100 + 1 << endl;
}
} |
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
void Main() {
// input
ll N;
cin >> N;
// process
// output
cout << N - 1 << endl;
}
int main() {
std::cout << std::fixed << std::setprecision(15);
Main();
... |
#include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cstdlib>
using namespace std;
#define ll long long
#define for1(i,n,a,b) for(ll (i)=(n);(i)<=(a);(i)+=(b))
#define for2(i,n,a,b) for(ll (i)=(n);(i)>=(a);(i)-=(b))
ll a[1005];
int main()
{
ll n;
... | #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 pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define tr(it, a) for (... |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
#define ll long long
#define pi (3.141592653589)
#define mod 1000000007
#define float double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(c) c.begin(), c.end()
#define min3(a, b, c) min(c, m... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define repA(i, a, n) for(int i = a; i <= (n); ++i)
#define repD(i, a, n) for(int i = a; i >= (n); --i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define fill(a) memse... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int M = 1e9 + 7;
vector<int> v = {1, 1, 2, 6, 24};
int ans = 0;
vector<int> v1;
int n;
void fun(int x, int c, vector<int> a)
{
if(c == 4)
{
int t1 = 24;
for(int i = 0; i < 10; i++)
t1 /= v[a[i]];
ans += t1;
return;
}... | /*
Author : $%U%$
Time : $%h%$:$%m%$:$%s%$, $%D%$/$%M%$/$%Y%$
*/
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python!
using pi = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
using vi = vector... |
#include <bits/stdc++.h>
#define rep(i,n) for ((i)=1;(i)<=(n);(i)++)
#define rep0(i,n) for ((i)=0;(i)<(n);(i)++)
using namespace std;
long long n,m,s,i;
vector<int> ans;
long long gcd(long long x,long long y){
if(!y) return x;
long long t=gcd(y,x%y);
s+=x/y;return t;
}
void print(long long x,long long y){
if(!x){
... | #include<bits/stdc++.h>
//#pragma GCC optimize "trapv"
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>
#define fast_az_fuk ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long
#define lll __int128
#define ull u... |
#include <fstream>
#include <iostream>
#include <algorithm>
#include <array>
#include <bitset>
#include <complex>
#include <functional>
#include <map>
#include <memory>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#... | #include <bits/stdc++.h>
using namespace std;
int n, m;
string s, t="atcoder";
int solve(int w) {
string p = s;
int ans = 0;
for (int i=0; i<w; ++i) {
int ok = 0;
for (int j=i; j<n; ++j) {
if (p[j]==t[i]) {
for (int k=j; k>i; --k) swap(p[k],p[k-1]);
ans += j-i;
ok = 1;
break;
}
}
if (!o... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<ll,ll> ii;
typedef vector<ii> vii;
const ll mod = 1e9+7;
main(){
ll a,b;cin>>a>>b;
ll now = 2*a + 100;
cout<<now-b;
} | /*
I am the Best of The World
Nafis_Cruciatus
*/
#include<bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<long long, null_type, less<long long>, rb_tree_tag,
tree_order_statistics_node_update>
... |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for... | #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 ll long long
#define endl "\n"
#define f first
#define s second
#define ar array
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define sz(X)... |
/*
problem :
algorithm :
created : Programmer_juruo
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define N 2000005
#define M 2005
#define lowbit(x) x & (-x)
#define F1(i, n) for(int i = 1; i <= n; i++)
#define F(i, a, n) for(int i = a; i <= n; i++)
#define F0(i, n) for(int i = 0; i < n; i++)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = 998244353;
#define rep(i,e) for(ll i = 0; i < e; i++)
#define endl
#define dbg(x) cout<<x<<ln
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
int main()
{
fast_cin();
ll a[3];
rep(i,3)
{
cin>>a[i];
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
string S;
cin >> S;
queue<int> I;
for (ll i = 0; i < N; ++i) {
if (S[i] == '1') {
I.emplace(i);
}
}
string T;
cin >> T;
vector<int> E;
for (ll i = ... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll LLINF = 1LL << 62;
int mod = 1000000007;
int main(void){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N; cin >> N;
string S, T; cin >> S >> T;
... |
#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 << ": " ... |
// Problem : D - Takahashi Unevolved
// Contest : AtCoder - AtCoder Beginner Contest 180
// URL : https://atcoder.jp/contests/abc180/tasks/abc180_d
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
/*ヽ｀、ヽ｀｀、ヽ｀ヽ｀、、ヽ ｀ヽ 、ヽ｀🌙｀ヽヽ｀ヽ、ヽ｀
ヽ｀、ヽ｀｀、ヽ 、｀｀、 ｀、ヽ｀ 、｀ ヽ... |
#include <bits/stdc++.h>
#include <iostream>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
vector<int> tileID(50 * 50);
vector<int> steped(50 * 50);
int x, y;
string ans = "";
cin >> y >> x;
rep(i,50 * 50) {
cin >> tileID... | #include <bits/stdc++.h>
// #include <atcoder/modint>
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define INF 2000000000000000000
#define ll long long
#define ld long double
#define pll pair<ll, ll>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; }... |
#include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
int main() {
int n = ri();
int k = ri();
int m = ri();
auto add = [&] (int &a, int b) {
a += b;
if (a >= m) a -= m;
};
std::vector<std::vector<int> > dp(n + 1);
dp[0] = { 1 };
for (int i = 1; i < n; i++) {
dp[i].resize(dp[i... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define endl '\n'
#define D(x) cerr << #x << " = " << (x) << '\n'
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;
const int N = 102;
int n, k, mo... |
#include<bits/stdc++.h>
#define pi 3.141592653589793238
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define MOD 1000000007
#define INF 999999999999999999
#define pb push_back
#define ff first
#define ss second
#define mt make_tuple
#define ll long long
#defin... | #include <bits/stdc++.h>
#define N 500005
using namespace std;
char A[N], B[N];
set<int>st[2];
int C[N], D[N];
int ans = 0;
int main()
{
int n;
scanf("%d", &n);
scanf("%s", A);
for (int i = 0; i < n; ++i) if (A[i] == '0') C[++C[0]] = i;
scanf("%s", B);
for (int i = 0; i < n; ++i) if (B[i] == '0') D[++D[0]... |
#include<bits/stdc++.h>
typedef long double db;
db slope(int x1,int y1,int x2,int y2){return 1.0*(y1-y2)/(x1-x2);}
int main(){
int n,D,H;
std::cin>>n>>D>>H;
db min=INFINITY;
for(int i=0;i<n;++i){
int d,h;
std::cin>>d>>h;
min=std::min(min,slope(d,h,D,H));
}
std::cout<<std::max((db)0,H-min*D)<<std::endl;
... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int n, k, m;
cin >> n >> k >> m;
int a, sum=0;
rep(i, n-1){
cin >> a;
sum += a;
}
int m2 = m*n;
int dif = m2 - sum;
if(dif > k) cout << -1 << endl;
else if(dif... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll MOD = 1e9 + 7;
//constexpr ll MOD = 998244353;
//constexpr ll MOD = ;
ll mod(ll A, ll M) {return (A % M + M) % M;}
constexpr ll INF = 1LL << 60;
template<cla... | #include <bits/stdc++.h>
using namespace std;
int lcm(int a, int b){
int lcm = 0, m = min(a, b);
for (int i = m; i > 0; i--){
if (a%i==0 && b%i==0){
lcm = i;
break;
}
}
return lcm;
}
int main(){
int N;
cin >> N;
vector<int> A(N);
for (int i ... |
#include <bits/stdc++.h>
#define Mod 998244353
using namespace std;
typedef long long ll;
inline int read() {
int out = 0;
bool flag = false;
register char cc = getchar();
while (cc < '0' || cc > '9') {
if (cc == '-') flag = true;
cc = getchar();
}
while (cc >= '0' && cc <= '9') {
out = (out << 3)... | // C++(GCC 9.2.1)
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
const LL MOD = 998244353;
int board[1010][1010]; // マスの色... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int T;
cin>>T;
for(int i=0;i<T;i++){
int64_t L,R;
cin>>L>>R;
int64_t A=R-L*2+1;
if(A<1) cout<<0;
else{
cout<<A*(A+1)/2;
}
cout<<endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
ll l, r;
cin >> l >> r;
ll ans;
if (2 * l <= r)
ans = (r - 2 * l + 2) * (r - 2 * l + 1) / 2;
else
ans = 0;
cout << ans << '\n';
}
int main() {
int t;
cin >> t;
while (t--)
... |
#include <bits/stdc++.h>
using namespace std;
// loops
#define fora(i,a,b) for(int i=a;i<=b;++i)
#define forb(i,a,b) for(int i=a;i>=b;--i)
#define forc(i,a,b) for(int i=a;i<b;++i)
#define For(x,y) for(auto x : y)
// data structure
#define ii pair<int,int>
#define fi first
#define se second
#define pb push_back
#def... | #include<bits/stdc++.h>
using namespace std;
bool check(int k, int n, vector<int> &v)
{
vector<int> vk;
for (int x: v)
{
if (x%k == 0)
vk.push_back(x);
if (k > x)
return false;
}
if (vk.size() == 0)
return false;
int G = vk[0];
... |
#include <bits/stdc++.h>
#define int long long
using pii=std::pair<int,int>;
using namespace std;
int t, n;
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> t;
for(int cases = 0; cases < t; cases++)
{
cin >> n;
string s;
for(int i = 0; i < 3; i++)
... | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <tuple>
#include <math.h>
#include <set>
#include <stack>
#include <bitset>
#include <map>
#include <cassert>
#include <queue>
#include <cstring>
#include <random>
#include <unord... |
/** Created by: Humberto Yusta
Codeforces User: humbertoyusta
Country: Cuba */
#include<bits/stdc++.h>
using namespace std;
/// Pragmas
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline","03") // Optimization flags
//#pragma GCC option("arch=native","t... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
scanf("%d", &n);
vector<long long> a(n);
for (long long &x : a)
scanf("%lld", &x);
long long ans = LONG_LONG_MAX;
vector<long long> nums = {2,
3,
5,
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, s, n) for(int i = (int)(s); i < (int)(... | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
using namespace std;
typedef long long ll;
const long double PI = (acos(-1));
const long long MOD = 1000000007;
static const int MAX_INT = std::numeric_limits<int>::max();
static cons... |
#include<bits/stdc++.h>
using namespace std;
char s[500005],t[500005];
int f[500005][2],v[500005];
int main()
{
int n,cnt=0;
long long ans=0;
scanf("%d",&n);
scanf("%s\n%s",s+1,t+1);
for(int i=1;i<=n;i++)if(s[i]=='1')v[++cnt]=i;
long long now=1;
for(int i=1;i<=n;i++)
{
while(now<... |
#include <iostream>
#include <climits>
#include <vector>
using namespace std;
int main()
{
int n;
string s, t;
cin >> n;
cin >> s;
cin >> t;
// 偶奇が同じか判別する
int sSum = 0, tSum = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '1') sSum++;
if (t[i] == '1') tSum++;
}
if ((sSum - tSum) % 2 == ... |
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const long long mod=(long long)1e9+7;
long long ans,cnt[3010][3010],n,s[3010],Now;
int main()
{
//freopen("in.txt","r",stdin);
scanf("%lld",&n);
for(int i=1;i<=n;i++)
{
scanf("%lld",&Now);
s[i]=s[i-1]+Now;
}
cnt[1][0]=1;
for(int i=1... | #include <bits/stdc++.h>
using namespace std;
const long long int MOD = 998244353;
int N,K;
int board[50][50];
long long int fact[51];
bool check1[50];
bool check2[50];
int uf[50];
int find(int x)
{
if(uf[x] < 0)
{
return x;
}
return uf[x] = find(uf[x]);
}
bool merge(int x,int y)
{
x = find(x);
y = find(y);... |
#include <bits/stdc++.h>
using namespace std ;
#define time cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" secs"<<endl;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL);
#define endl "\n"
typedef unsigned long long int ull ;
#define int long long
int MOD = 1e7+7 ;
int gcd(int a, int b){
if(b... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using LL = long long;
using LD = long double;
using ordered_set = tree<LL,null_type,less<LL>,rb_tree_tag,tree_order_statistics_node_update>;
void fastio() {
cin.tie... |
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main() {
// your code goes here;
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t=1;
//cin>>t;
while(t--)
{
ll n;
cin>>n;
ll prmi=0;
ll a[n];
map<ll,ll>m;
for(ll i=0;i<n;i++)
{
cin>>a[i];
m[... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
using vi = vector<int>;
using vb = vector<bool>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using vpii = vector<pii>;
using vpll = vector<pll>;
const ll LIN... |
// time-limit: 2000
// problem-url: https://atcoder.jp/contests/abc185/tasks/abc185_e
#include <bits/stdc++.h>
#define endl "\n"
#define int long long
#define double long double
#define precise \
fixed << setprecision(12)
#define debug(var) \
if (debugging) \
cerr << (#var) << ": " << var << endl
const bo... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
using ll = long long;
using P = pair<in... |
#ifdef __LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using PIL = pair<int,ll>;
using PLI = pair<ll,int>;
using PLL = pair<ll,ll>;
using Graph = vector<vector<int>>;
using Cost_Graph = vector<vector<PIL>>;
template<class T> bool chmin(... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ull unsigned long long
#define ll long long
#define M 998244353
#define pb push_back
#define p_q priority_queue
#define pii pair<ll,ll>
#define vi vector<ll>
#define vii ... |
#define MOD 1000000007
#pragma GCC target("popcnt")
#include <bits/stdc++.h>
#include <numeric>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
const int N=1000001;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int l,r;
i... | #include<iostream>
#include<math.h>
#include<iomanip>
#include<vector>
#include<algorithm>
#include<queue>
#include<string>
#include<stdlib.h>
#include<stack>
using namespace std;
#define PI 3.14159265358979
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#include<set>
char s[501][501];
int main(void)
{
... |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mod 1000000007
#define F first
#define S second
#define all(v) (v).begin(),(v).end()
#define np next_permutation
#define lp(i,n) for(int i=0;i<n;i++)
#define lps(i,j,n) for(int i=j;i<n;i++)
#define vii vector<vi>
#define vb vector<bool>
#define ... | #include<iostream>
using namespace std;
typedef long long ll;
ll n;
int main(){
cin >> n;
ll l = 1,r = 1e10;
while(l < r){
ll mid = l + r + 1 >> 1;
if((1 + mid) * mid / 2 > n + 1){
r = mid - 1;
}else if((1 + mid) * mid / 2 == n + 1){
l = mid;
break;
}else{
l = mid;
}
}
cout << n - l... |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
#include<map>
#include<iostream>
#include <cstring>
#include <iomanip>
#include <algorithm>
#define forr(i,a,b) for(int i=a;i<=b;i++)
#define F first
#define S second
#define input ios_base::sync_with_stdio(0);cin.tie(0);
const double PI = acos(-1.0);
using namespace... | #include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
#define double long double
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef vector<pii> VP;
t... |
#include <bits/stdc++.h>
#define ll long long
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define REP(i, n) for(int i=0;i<(int)(n);++i)
#define FOR(i,l,h) for(int i=(int)(l);i<=(int)(h);++i)
#define FORD(i,h,l) for(int i=(int)(h);i>=(int)(l);--i)
//#define max(a,b) a>b?a:b
//#define m... | #include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
int main(){
int j=0,n,a[10];
bool zeroend=false;
cin>>n;
for(int i=0;n>0;i++){
if(n%10!=0){
zeroend=true;
}
if(zeroend){
a[j]=n%10;
j++;
}
n/=10;
}
for(int i=0;i<j/2;i++){
if(a[i]!=a[j-1-i]){... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
constexpr ll MOD=1000000007;
constexpr ll INF=1e18;
int main(){
int n, m; cin >> n >> m;
vector<... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <string>
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <iomanip>
using namespace std;
using ll = long long;
using ull = unsigned lo... |
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(10);
int n, m, k;
cin >> n >> m >> k;
vector<int> is_back(n + 1);
for (int i = 0; i < k; i++) {
int p;
cin >> p;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< "... |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define PRINT(a) cout << (a) << endl
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ... | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define int ll
#define each(i, a) for (auto &&i : (a))
using ll = long long;
using ld = long double;
using vi = v... |
#include <bits/stdc++.h>
using namespace std;
int n;
int main()
{
scanf("%d", &n);
printf("%d", 100-n%10-(n/10%10)*10);
return 0;
} | // #include<vector>
// #include<iostream>
// #include<stdio.h>
// #include<string>
// #include<algorithm>
#include<array>
#include<bits/stdc++.h>
using namespace std;
int main() {
double x;
cin >> x;
int memo = x;
x = 1.0*x / 100;
x = ceil(x)*100;
if ( memo % 100 == 0) {
cout << 100 << endl;
} else
cout << ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
const int dy[4] = { -1, 0, 1, 0 }, dx[4] = { 0, 1, 0, -1 };
char mp[1000][1000];
vector<int> gph[2000];
bool chk[2000];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int r, c;
cin >> r >> c;
gph[... | #include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
using namespace __gnu_pbds;
using namespace std;
using ll = long long;
using ld = long double;
typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_nod... |
#include <bits/stdc++.h>
#define ll long long int
#define vll vector<long long int>
using namespace std;
ll MOD = 1e9 + 7;
void solver(){
ll n;
cin>>n;
vll a(n),b(n),c(n);
map<ll,ll> mp;
for(ll i=0;i<n;i++)cin>>a[i];
for(ll i=0;i<n;i++)cin>>b[i];
for(ll i=0;i<n;i++)cin>>c[i];
for(ll i=0;i<n;i++){
mp[b[c... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int,int> PI;
typedef vector<int> VI;
typedef vector<PI> VPI;
template<class T> bool tmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool tmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
#define PB(x) pus... |
#line 1 "main.cpp"
#include <bits/stdc++.h>
using namespace std;
// template {{{
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define range(i, l, r) for (i64 i = (i64)(l); i < (i64)(r); (i) += 1)
#define rrange(i, l, r) for (i64 i = (i64)(r) - 1; i >= (i64)(l); (i... | #include <bits/stdc++.h>
using namespace std;
int n;
int a[505];
int ans[250005],len;
int p=1;
void doSwap(int pos) {
if(p%2==1) {
int x=rand()%2;
if(2*x+1==pos || 2*x+2==pos) {
x^=1;
}
swap(a[2*x+1],a[2*x+2]);
ans[++len]=2*x+1;
p++;
}else {
if(pos==2 || pos==3) {
swap(a[4],a[5]);
ans[++le... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int n,m;
const int N=505;//点数
const int M=5e5+5;//边数
int End[M],Last[N],Next[M],Len[M],e;//链式前向星
void add_edge(int x,int y,int z)
{
End[++e]=y;
Next[e]=Last[x];
Last[x]=e;
Len[e]=z;
}
int dis[N],cnt[N];//cnt记录各个点入队次数
queue<int> q;
bool inq[N];//in... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#ifndef aa
#define trace(...)
#define endl '\n'
#endif
#define pb push_back
#define u... |
#define _USE_MATH_DEFIMES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <ioman... | #include <bits/stdc++.h>
#define rep(i, a, b) for(int i = (int)(a); i <= (int)(b); i++)
struct ad{
int left, up, right, down;
};
int time_start;
int Num;
std::vector<ad> ads;
std::vector<std::pair<ad,int>> ads_start;
void in(){
std::cin >> Num;
ads.resize(Num);
ads_start.resize(Num);
rep(i,0,Num-... |
#include <bits/stdc++.h>
using namespace std;
#define rep( i, n, m ) for(int i = ( n ); i < ( m ); i++)
#define rep_d( i, n, m ) for(int i = ( n ) - 1; i >= ( m ); i--)
#define sort_asc( X ) sort(( X ).begin(), ( X ).end())
#define sort_desc( X ) sort(( X ).begin(), ( X ).end(), greater <>())
typedef long long int ll;... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include <atcoder/all> // g++ main.cpp -std=c++17 -I .
using namespace std;
// using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
template<class T,class U> inline bool chmin(T&x,U y){if(x>y){x=y;return tru... |
/**
11 11 000000 111111
11 11 00 111111
1111 00 11
11 11 00 11
11 11 000000 11 **/
#include<bits/stdc++.h>
using namespace std;
#define fto(i, a, b) for(int i = a; i <= b; ++i)
#define fdto(i, a, b) for(int i = a; i >= b; --i)
#define buga... | #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;
template <class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long int
#define pb push_back
#de... |
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if (a > b) {
swap(a, b);
}
if (b > c) {
swap(b, c);
}
if (a > b) {
swap(a, b);
}
if (c - b == b - a) {
cout << "Yes" << endl;
} else... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define deb(x) cout << #x << " " << x << endl;
#define mod 1000000007
#define fast std::ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define endl "\n"
const ll INF = 1e18;
const ll NEGINF = -1 * INF;
/*NOTES: Take care of ll vs int
... |
#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <lim... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
string N;
cin >> N;
int ans=0;
rep(i,9){
if( (N[i] == 'Z') && (N[i+1] == 'O') && (N[i+2] == 'N') && (N[i+3] == 'e') )ans++;
}
cout << ans << endl;
} |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) a.size()
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e9+7)
#define I... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <map>
#include <queue>
#include <functional>
#include <vector>
#include <stack>
#include <set>
//#define int long long
using namespace std;
typedef long long ll;
const int maxn=1007;
const int inf=0x3f3f3f3f;
const i... |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define unused [[maybe_unused]]
#define tempT template<class T>
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define debug(x) cerr << #x << ": " << x << endl
#define ans_exit(x) { c... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef pair<int,pii> pip;
const int MAXN = 505;
const int INF = 1000000007;
int A[MAXN][MAXN], B[MAXN][MAXN], min_dist[MAXN][MAXN];
set <pip> dijk;
void update_dijk(int nr, int nc, int nwt)
{
if (nwt < min_dist[nr][nc])
{
dijk.erase(pip(min_d... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,dp[100][100];
double cnt,ans;
string s[100],t;
int main(void){
cin>>n;
for(int i=0;i<n;i++){
cin>>s[i];
for(int j=0;j<n;j++){
if(i==j)dp[i][j]=0;
else if(s[i][j]=='0')dp[i][j]=1e9;
else d... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i, x, y) for(int i = (x); i < (y); ++i)
#define REP(i, x, y) for(int i = (x); i <= (y); ++i)
#define PB push_back
#define MP make_pair
#define PH push
#define fst first
#define snd second
typedef long long ll;
typedef unsigned long long ull;
typedef double lf;
... |
#include <cstdio>
#include <vector>
constexpr int maxn = 2e5+10;
std::vector<int> g[maxn];
int dist[maxn], color[maxn], t = 1, l, r;
bool has[maxn];
void dfs(int u, int p = 0) {
for(int v : g[u]) {
if(v == p) continue;
dist[v] = dist[u] + 1;
dfs(v, u);
}
}
void pre(int u, int p = 0) {
has[u] = u == r;
fo... | #include <bits/stdc++.h>
using namespace std;
#define int long long
struct point {
int x, y, ind;
};
bool comp(point a, point b) {
return a.x < b.x;
}
void solve() {
int n; cin >> n;
vector<point> a(n), b(n);
for (int i = 0 ; i < n; ++i) {
cin >> a[i].x >> a[i].y;
b[i].x = a[i].y; b[... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define repn(i,n) rep(i,0,n)
const double EPS = 1e-5;
const int MOD = 1e9+7;
const int INF = INT_MAX / 2;
//for(auto &h : H){ cout << h << " ";} cout << endl;
int main(){
int r1,c1,r2,c2;
cin >> r1 >... | #include <bits/stdc++.h>
using namespace std;
#define flush cout.flush
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pl = pair<ll, ll>;
const ll INF = 1e9 + 7;
const ll mod = 1e9 + 7;
const ll mod2 = 998244353;
const ld eps = 1e-9;
const ld PI = acos(-1);
ll cur = -1;
ll calc(... |
#include <bits/stdc++.h>
#define lc (o<<1)
#define rc ((o<<1)|1)
using namespace std;
#define DebugP(x) cout << "Line" << __LINE__ << " " << #x << "=" << x << endl
typedef long long LL;
typedef complex<double> Comp;
const int maxn = 2e5 + 5;
const int inf = 0x3f3f3f3f;
const int modu = 998244353;
template<class T>
i... | #include <iostream>
#include <iomanip>
#include <fstream>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <vector>
#include <algorithm>
#include <cmath>
#include <complex>
#include <chrono>
using namespace std;
int main(int argc, const char * argv[]) {
ios::sync_with_stdio(false);
ci... |
#include<iostream>
#include <bits/stdc++.h>
#include<stdio.h>
#include <string.h>
using namespace std;
#define ll long long
#define INF 1000007
#define MAX 500007
#define EPS 1e-9
#define PI acos(-1.0)
#define nl "\n"
#define F first
#define S second
typedef vector<ll> vi;
typedef priority_queue<ll , vector<ll> , great... | #include<bits/stdc++.h>
#define pb push_back
using namespace std;
#define G getchar()
int read()
{
int x=0; bool flg=false; char ch=G;
for (;!isdigit(ch);ch=G) if (ch=='-') flg=true;
for (;isdigit(ch);ch=G) x=(x<<3)+(x<<1)+(ch^48);
return flg?-x:x;
}
#undef G
#define fi first
#define se second
typedef long long ll;... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, a, b) for (int (i) = (a); (i) <= (b); (i)++)
#define ROF(i, a, b) for (int (i) = (a); (i) >= (b); (i)--)
#define REP(i, n) FOR(i, 0, (n)-1)
#define sqr(x) ((x) * (x))
#define all(x) (x).begin(), (x).end()
#de... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll N, M; cin >> N >> M;
vector<ll> h(N), w(M);
vector<ll> ida(N - 1);
for(ll i = 0; i < N; i++)cin >> h[i];
for(ll i = 0; i < M; i++)cin >> w[i];
sort(h.begin(), h.end());
for(ll i = 0; i < N - 1; i++)ida[i] =... |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int i,j,l;
long long res=1;
cin >> l;
for (int i = 1; i < 12; i++) {
res = (res * (l-i))/i;
}
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using ull = unsigned long long;
using ll = long long;
using namespace std;
#define pf printf
#define sc scanf
#define nline cout << '\n'
#define dbg(x) \
cout << "debug " << #x << ": " << x << '\n';
#define inp(t) cin >> (t)
#define out(t) cout << (t)
#define... |
//
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
typedef long long ll;
typedef long double ld;
const ll mod = 1e9 + 7;
int main ()
{
ios_base::sync_with_stdio (0); cin.tie (0); cout.tie (0);
int x;
cin >> x;
int n = 100 - x % 100;
cout << n;
}
| #include<bits/stdc++.h>
#define ll long long
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define sz(x) (int)(x).size()
#define PB push_back
#define PI 3.1415926535897932384626433832795
#define what(x) cout<<#x<<" is "<<x<<endl;
using namespace std;
#ifdef LOCAL//ONLINE_JUDGE
#include "D:\c_c++... |
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long long
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define endl '\n'
#define pi 3.141592653589793238
#define mp make_pair
... | #include <bits/stdc++.h>
using namespace std;
const int MX = 200000;
char s[3][MX + 1], t[MX + 2];
bool check(int n) {
for (int i = 0; i < 3; i++) {
int k = 0;
for (int it = 0; it < 2; it++) {
for (int j = 0; j < 2 * n; j++) {
if (s[i][j] == t[k]) k++;
}
}
if (k < 2 * n + 1) return false;
}
... |
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/rope>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/pb_ds/trie_policy.hpp>
// using namespace __gnu_pbds;
// using namespace __gnu_cxx;
// typedef tree<long long, null_type, std::less<long l... | #include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#define int long long
#define pb push_back
#... |
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <algorithm>
using namespace std;
template <class T>
class bit {
public:
bit(int n);
bit(T* array, int n);
~bit();
void add(int x, T value);
T get(int x) const; // [0, x]
T get(int x, int y) const; // [x, y]
int lower_bound... | # include <bits/stdc++.h>
#define rep(i,l,r)for(int i=(l);i<(r);i++)
# define rrep(i,r,l) for(int i=(r); i>=l; --i)
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((int)(x).size())
# define pb push_back
# define optimize_cin() cin.tie(0); ios::sync_with_stdio(false)
using namespace std;
typedef long long lint;
t... |
#include<bits/stdc++.h>
using namespace std;
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/gcd(a,b)
#define p pair<long long,long long>
#define endl '\n'
#define iof freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define pi acos(-1)
int fx[]={0,0,1,-1,1,1,-1,-1};
int fy[]={1,-1,0,0,-1,1,-1,1};
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define Sort(a) sort(a.begin(), a.end())
#define RSort(a) sort(a.rbegin(), a.rend())
#define Output(a) cout << a << endl
typedef long long int ll;
typedef vector<int> vi;
typedef vector<long long> vll;
const int INF = 1<<30;... |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < (n); ++i)
#define FOR(i, m, n) for(ll i = m; i < (n); i++)
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
using vi = vector<int>;
using vii = vector<vi>;
using pii = pair<int, int>;
using vl = vector<ll... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define Pr pair<ll,ll>
#define Tp tuple<int,int,int>
using Graph = vector<vector<int>>;
int main(){
string S[3];
unordered_map<char,int> lab; int k = 0;
rep(i,3){
cin >> S[i];
re... |
#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>
using namespace std;
#define ll long long
#define rep(i,a,n) for(int i=a;i<n;i++)
#define fastin ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#define mk make_pair
int main(){
fastin
int a,b,c;
cin>>a>>b>>c;
if(a==b){
cout<<c<<endl;
}
else if(a==c)
... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define debug(x) cerr << #x << ": " << x << '\n'
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
for(int i = 0;i < 10; ++i){
bool check = true;
for(int j = 0;j < s.length()/2; ++j){
if(s[j] != s[s.length() - j -1]){
check = false;
break;
}
}
if(check){
cout << "Yes" << endl;
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.