code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#define speedX ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
using namespace std;
// #define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
template<typename T>
void __p(T a) { cout << a << " "; }
template<typename T, typena... | #include <iostream>
#include <cstdio>
using namespace std;
int n, a, b;
int main()
{
cin >> n >> a >> b;
cout << n - a + b << endl;
return 0;
} |
#include <bits/stdc++.h>
#define fi first
#define se second
#define sz(a) (int)(a).size()
#define all(a) (a).begin(), (a).end()
#define reset(a,v) memset((a), v, sizeof(a))
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
in... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define mp make_pair
typedef long long int ll;
int main()
{
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
ll n; cin >> n;
ll k = 0;
set<ll> s;
for (... |
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#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 rep2... | #include <bits/stdc++.h>
using namespace std;
bool check(const int64_t x, vector<vector<int64_t>>& a) {
set<int> s;
for (auto i = 0; i < (int)a[0].size(); i++) {
auto t = 0;
for (auto j = 0; j < 5; j++)
t |= ((a[j][i] >= x) << j);
s.insert(t);
}
for (auto& i : s)
... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define DB double
#define U unsigned
#define P std::pair
#define LL long long
#define LD long double
#define pb emplace_back
#define MP std::make_pair
#define SZ(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#defin... | // 解き直し.
// https://atcoder.jp/contests/arc105/editorial/170
// C++(GCC 9.2.1)
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using P = pair<LL, LL>;
#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)... |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 500010, mod = 998244353;
int a[3];
int main() {
string s1, s2;
int d1 = 0, d2 = 0;
int n;
cin >> n;
while (n --) {
string s;
int h;
cin >> s >> h;
if(h >= d1) d2 = d1, s2 = s1, d1... | #define LOCAL0
#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
#define debug(msg) cout << (msg) << endl
#define FOR(i, a, b) for (ll i=a; i<=(b); i++)
#define ROF(i, a, b) for (ll i=a; i>=(b); i--)
#define pb(x) push_back(x)
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()
#define sz(x) (ll)x.size... |
//vec[i]の範囲外エラー表示
#define _GLIBCXX_DEBUG
//includeとusing
#include <bits/stdc++.h>
using namespace std;
//型名省略
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
template <class T> using P = pair<T,T>;
template <class T> using M = map<T,T>;
template <class T> using S = set<T>;
template <class... | #include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <algorithm>
#include <math.h>
#include <iomanip>
#define INF 100000000
#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() {
ll s,p;
cin >> s>>p;
... |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define N 300100
#define MOD 998244353
#define ll long long
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep2(i, a, b) for(int i = a; i <= b; ++i)
#define rep3(i, a, b) for(int i = a; i >= b; --i)
#define eb emplace_back
#define pb push_b... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x=0):x((x%mod+mod)%mod){}
mint operator-() const { return mint(-x);}
mint& operator+=(const mint a) {
if ((x += a.x) >= mod) x -= mod;
return *this;
}
... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a1,a2,a3;
cin>>a1>>a2>>a3;
int t;
if(a1>a2)
{
t=a1;
a1=a2;
a2=t;
}
if(a2>a3)
{
t=a2;
a2=a3;
a3=t;
}
if(a1>a2)
{
t=a1;
a1=a2;
a2=t;
}
if(a3-a2==a2-a1) cout<<"Yes";
else cout<<"No";
} | #include<iostream>
#include<string>
using namespace std;
main()
{
int n,x,a=0,b=0;
string s;
cin>>n>>x;
cin>>s;
for(int i=0; i<n; i++)
{
if(s[i]=='o')
{
x++;
}
else if(x>0)
{
x--;
}
}
cout<<x<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 1009;
struct Edges
{
Edges(){}
Edges(int x, char c):x(x), c(c){}
int x;
char c;
};
struct Vertices
{
Vertices(){}
Vertices(int x, int y, int d):x(x), y(y), d(d){}
int x, y, d;
bool operator < (const Vertices&a)
const
{
return ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int n, m;
vector<ll> a, b;
vector<vector<int>> g;
vector<bool> check;
ll dfs(int v) {
check[v] = true;
ll ret = b[v] - a[v];
for (auto nv : g[v]) {
if (check[nv]) contin... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pi acos(-1.0)
const int inf = 1e9;
signed main() {
int h, w, x, y;
cin >> h >> w >> x >> y;
string a[h + 1];
for (int i = 1; i <= h; i++) {
cin >> a[i];
a[i] = '*' + a[i];
}
if (a[x][y] == '#') {
cout << 0;
return 0;
}
int ans... | #include <bits/stdc++.h>
#define SZ(x) (int)(x).size()
#define ALL(x) (x).begin(),(x).end()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
using namespace std;
typedef double DB;
typedef long double LD;
typedef long long LL;
typedef unsigned long long ULL;
typedef p... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> pii;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
#define endl "\n"
#define VALUE(x) cerr << "The value of " << #x << " is " << x << endl
#define FOR(a, b, c) for (in... |
/*** In the name of Allah(swt), the most gracious, most merciful.***/
/*** Alhamdulillah for Everything ***/
#include <bits/stdc++.h>
#include<vector>
using namespace std;
typedef bool boo;
typedef int li;
typedef long il;
typedef unsigned long ul;
typ... |
#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar_unlocked(){
static char buf[1048576];
static int s = 1048576;
static int e = 1048576;
if(s == e && e == 1048576){
e = fread_unlocked(buf, 1, 1048576, stdin);
s = 0;
}
if(s == e){
return EOF;
}
r... | #include<iostream>
#include <bits/stdc++.h>
#include<algorithm>
#include <cstring>
#include <string.h>
#define endl "\n"
#define SRK ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define EPS 1e-6
#define MAX 100000
typedef long long ll;
const ll MOD = 1e9;
using namespace std;
int freq[1005];
bool comparis... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define Pint pair<int,int>
#define Pll pair<ll,ll>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
#define eb emplace_back
template<class T>void chmax(T &a,T b){if(a<b)a=b;}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, a, b) for (int i = a; i >= b; i--)
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
typedef long long LL;
typedef pair <int, int> P;
const int N = 2e5 + 5;
int n, a[N], b[N], c[N];
LL ans, res;
int main(... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define N 200005
#define INF 1000000005
#define INFLL 2e18
#define PI 3.1415926535897
typedef long long ll;
#define ALL(v) (v).begin(),(v).end()
#define SZ(x) int(x.size())
#define IN(a) cin>>(a)
#define OUT(a) cout<<(a)<<endl
typedef... | #include "bits/stdc++.h"
using namespace std;
typedef int ll;
typedef pair<ll ,ll> pll;
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define all(X) (X).begin(), (X).end()
#define REP(i,x,y) for(ll i = x;i <= y;++i)
#define fastio ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
ve... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
template<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}
template<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>=b)return 0; a=b; return 1;}
int dx[4]={0,1,0,-1}, dy[4]={1,0,... | #include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
//using mint = modint1000000007;
#define int long long
#define rep(i, n) for(int i = 0, i##_len=(n); i < i##_len; ++i)
#define per(i, n) for(int i = (n)-1; i >= 0 ; --i)
#define all(x) (x).begin(), (x).end()
#define rall(... |
#include <bits/stdc++.h>
#define optimizar_io ios_base::sync_with_stdio(0);cin.tie(0);
//#define ExecuteTime cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n"
#define pi acos(-1)
#define pb push_back
#define F first
#define S second
#define forr(i,a,b) for(ll i = (ll)a, asdf = (ll)b ; ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;typedef double db;
typedef pair<int, int> pii;typedef pair<ll, ll> pll;
typedef pair<int,ll> pil;typedef pair<ll,int> pli;
#define Fi first
#define Se second
#define _Out(a) cerr<<#a<<" = "<<(a)<<endl
const int INF = 0x3f3f3f3f, MAXN = 1e6 + 50;
const ll... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
cout<<7-a+7-b+7-c;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define vll vector<ll>
#define vpp vector<pair<pair<ll, ll>, ll>>
#define vp vector<pair<ll, ll>>
#define mk make_pair
#define pb push_back
#define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define N 1000000007
using namespace std;
void fun()
{
// code... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
char s[20];
ll g1(ll x){
vector<int> frec(10);
int i = 0;
while(x){
frec[x%10]++;
//s[i++]=x%10 + '0';
x/=10;
}
for(int i = 9; i >= 0; i--)
for(int j = 0; j < frec[i]; j++)
x=x*10+i;
return x;
}
ll g2(ll x){
v... | #include<bits/stdc++.h>
using namespace std;
int mod = 1e9+7;
int add(int a, int b){
int ans = a + b;
while(ans >= mod){
ans -= mod;
}
return ans;
}
void add_self(int & a, int b){
a = add(a,b);
}
int sub(int a, int b){
int ans = a - b;
while(ans < 0){
ans += mod;
}
re... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bou... | #include <bits/stdc++.h>
using namespace std;
int N;
int ans[1010][1010];
int main() {
cin >> N;
int m = 2;
ans[0][0] = 0; ans[0][1] = 1;
for(int q = 0; q < N - 1; q++) {
for(int i = 0; i < 2; i++) {
for(int j = 0; j < 2; j++) {
for(int k = 0; k < m / 2; k++) {
for(int l = 0; l < m; l++) {
ans... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define ull unsigned long long
#define ln cout<<"\n"
#define all(x) x.begin(),x.end()
typedef vector<int> vi;
typedef vector<long long> vl;
typedef pair<int,int> pi;
typedef pai... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define maxn 100005
#define maxm 200005
#define INF 1234567890
#define eps 1e-15
#define p 1000000007
const double pi=acos(-1);
template<class T>inline bool read(T &x)
{
x=0;register char c=getchar();register bool f=0;
while(!isdigit(c)){if(c==E... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll n;cin>>n;
vector<ll>a(n),b(n);
for(ll i=0;i<n;++i)
{
cin>>a[i];
}
for(ll i=0;i<n;++i)
{
cin>>b[i];
}
ll l=a[0],r=b[0];
for(ll i=1;i<n;++i)
{
if(a[i]>l)
{
l=a[i];
}
if(b[i]<r)
{
r=b[i];
}
}
if(l<=r)
... | // Date-- 24/04/2021
//practice
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
#define all(x) (x).begin(),(x).end()
#define rep(i,a,b) for(ll i = a; i<b ; i++)
#define sz(x) (int)((x).size())
#define PI ... |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define mo 1000000007
#define ll long long
#define maxn 1005
using namespace std;
int n,i,j,k,f[2][2];
ll ans;
ll ksm(ll x,ll y){
ll s=1;
for(;y;y/=2,x=x*x%mo) if (y&1)
s=s*x%mo;
return s;
}
void reverse(){
static int g[2][2];
for(i=0;i<2;... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
using namespace std;
template <class T = int>
using V = vector<T>;
template <class T = int>
using VV = V<V<T>>;
using ll = lo... |
#include<bits/stdc++.h>
// #pragma optimize("-O3")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,avx,mmx,tune=native")
using namespace std;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define INF 1e9
//#def... | //#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,fma,tune=native")
#include <bits/stdc++.h>
using namespace std ;
#define int int64_t //be careful about this
#define endl "\n"
#define f(i,a,b) for(int i=int(a);i<int... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
int n;
vector<vector<int>> es;
vector<int> a, b;
vector<int> depth;
void DepthDFS(int a, int d){
depth[a] = d;
for (int next : es[a]){
if (depth[next] == -1){
... | #pragma region RegionDefs
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0,i##_len=(n);i<i##_len;++i)
#define reps(i,l,r) for(int i=(l),i##_len=(r);i<i##_len;++i)
#define repr(i,l,r) for(int i=(r)-1,i##_left=(l);i>=i##_left;--i)
#define all(x) begin(x),end(x)
using namespace std;
typedef long long ll;
const ll INF... |
#include <bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
vo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,en,i;
i=0;
en=0;
cin >> N;
while (en<N) {
en=en+i;
i++;
}
cout << i-1 << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int BS=524288;
int CNT,rc;
char inb[BS];
inline char gchar(void){
if(CNT%BS==0){
CNT=0;
rc=fread(inb,1,BS,stdin);
}
return CNT<rc?inb[CNT++]:0;
}
inline int _readint(int *ptr){
int n=0,c=0;
*ptr=0;
... |
#include <bits/stdc++.h>
using namespace std;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using isize = ptrdiff_t;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using usize = size_t;
using f32 = float_t;
using f64 = double_t;
auto main()... | #include <bits/stdc++.h>
using namespace std;
//#define endl '\n'
#define pb push_back
#define ll long long
#define int ll
#define FF first
#define SS second
#define f(a,b,c) for(int a=b;a<=c;a++)
#define fd(a,b,c) for(int a=b;a>=c;a--)
#define fspr(X) fixed<<setprecision(X)
int mod = 1000000007;
ll mod_pow(ll ... |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn=3e5+5;
int a[maxn];
int b[maxn];
int flag[maxn];
void solve()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
for(int i=1;i<=n;i++)
{
cin>>b[i];
}
int sum=0;
for(int i=1;i<=n;... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... |
#include<bits/stdc++.h>
using namespace std;
inline int read(){
int res=0;
bool zf=0;
char c;
while(((c=getchar())<'0'||c>'9')&&c!='-');
if(c=='-')zf=1;
else res=c-'0';
while((c=getchar())>='0'&&c<='9')res=(res<<3)+(res<<1)+c-'0';
if(zf)return -res;
return res;
}
const int maxn=4e5+5,P=1e9+7;
int a[maxn];
int ... | #include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <tuple>
#include <utility>
#include <functional>
#include <set>
#include <map>
#include <bitset>
#include <list>
#include<iomanip>
using namespace std;
using ll = long long;
using UL... |
#include<bits/stdc++.h>
#define ll long long
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define w(t) ll t;cin>>t;while(t--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define fo(i,a,n) for(ll i=a;i<n;i++)
#define prec... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const int MOD=1e9+7;
int main(){
int N; cin >> N;
ll sum=0;
for(int i=0;i<N;i++){
ll a,b; cin >> a >> b;
sum+=(a+b)*(b-a+1)/2;
}
cout << sum << endl;
} |
#include<iostream>
#include<stdlib.h>
#include<string>
#include<iomanip>
using namespace std;
int main() {
int si, sj;
cin >> si >> sj;
int t[51][51],p[51][51],i,j,k;
for (i = 0; i < 50; i++) for (j = 0; j < 50; j++) cin >> t[i][j];
for (i = 0; i < 50; i++) for (j = 0; j < 50; j++) cin >> p[i][j];
... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
const ll MOD = 998244353;
const double PI = 3.141592653589793238;
int main(){
auto start = chrono::system_clock::now();
ll si, sj;
cin >> si >> sj;
ll nowi = si, nowj = sj;
vector<ll> t(2500);
for (ll i = 0; i < 50; ++i) {
for (ll j = 0... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e5+100;
int n,a[N];
int sum[N];
signed main(){
ios::sync_with_stdio(false),cin.tie(0);
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i];
sort(a+1,a+1+n);
for(int i=1;i<=n;i++){
sum[i]=sum[i-1]+a[i];
}
double ans=1... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll=long long;
using ld=long double;
using pll=pair<ll, ll>;
//using mint = modint1000000007;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
#define PI acos(-1)
#define oo 2e12
template<typenam... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
//freopen("input.in","r",stdin);
int n,x;
cin>>n>>x;
while(n--){
char ch;
cin>>ch;
if(ch=='o') x++;
else x=max(0,x-1);
}
co... | #include<bits/stdc++.h>
#define pb push_back
#define x first
#define y second
#define pdd pair<double,double>
#define pii pair<int,int>
#define pll pair<LL,LL>
#define mp make_pair
#define LL long long
#define ULL unsigned long long
#define sqr(x) ((x)*(x))
#define pi acosl(-1)
#define MEM(x) memset(x,0,sizeof(x))
#def... |
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cctype>
#include<cstdlib>
#include<ctime>
using std::max;
using std::min;
using std::sort;
using std::swap;
typedef long long LL;
int T;
LL N;
int main()
{
#ifndef ONLINE_JUDGE
freopen("1.in","r",stdin);
#endif
scanf("%d",&T);
while(T--)
{
scanf("%... | #include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
const int mod = 1000000007;
//const int mod = 998244353;
//MINT
struct mint {
ll x;
mint(ll x=0):x((x%... |
#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 n,m;cin>>n>>m;
rep(i,m) {
string s;
cin>>s;
}
rep(i,20) {
rep(j,20... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n';
const ll nmax = 1000000007;
int main(){
ll a, b;
cin >> a >> b;
ll sa = 0, sb = 0;
while(a > 0){
sa += (a%10);
a /= 10;
}while(b > 0){
sb += (b%10);
b /= 10;
}
cout << (... |
#include<iostream>
#include<array>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#incl... | //#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define uniq(x) x.resize(unique(all(x)) - x.begin())
#define ff first
#define ss second
#define pb push_back
#define emb ... |
#define _USE_MATH_DEFINES
#include <cmath>
#include <iostream>
#include <vector>
#include <array>
#include <map>
#include <unordered_map>
#include <list>
#include <set>
#include <unordered_set>
#include <queue>
#include <stack>
#include <cmath>
#include <algorithm>
#include <limits>
#include <numeric>
#include <iomanip... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
vector<vector<int>> t;
int ans=0;
int k;
int n;
void cal(int s,int cnt,vector<bool>ok,int sum){
for(int i=1;i<n;++i){
if(ok[i]==true || s==i)continue;
//int tmp=sum;
ok[i]=true;
sum+=t[s][i];
cal(i,cnt+1,ok,sum);
ok[i]=false;
... |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
typedef long long ll;
int main(){
//input, initialize
int a, b, c; cin >> a >> b >> c;
if(a == b){
cout << c << endl;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
#define all(v) v.begin(),v.end()
#define run ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0);
#define LL_MAX LLONG_MAX
#define ub(v,x) upper_b... |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define rng(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); --i)
#define per(i, b) gnr(i, 0, b)
#define all(obj) begin(obj), end(obj)
#define allr(ob... | #include <bits/stdc++.h>
using namespace std;
#define MAXN (int)(2 * 1e5 + 5)
#define MAXL 20
#define F first
#define S second
#define endl "\n"
#define MOD (lli)(1e9 + 7)
#define lli long long int
#define sz(a) int(a.size())
#define DEBUG if (0) cout << "aqui" << endl;
#define PI 2 * acos(0.0)
typedef pair<int, int>... |
#include<iostream>
#include<map>
#include<vector>
using namespace std;
typedef long long li;
#define maximize(a,b) (a<(b)?a=(b),1:0)
#define rep(i,n) for(li i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) {... | #include<iostream>
#include<string.h>
#include<string>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<bitset>
#include<math.h>
#include<stack>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef long double db;
typedef unsigned long long ull;
typedef vector<in... |
#include<bits/stdc++.h>
#define For(i,a,b) for(register int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(register int i=(a);i>=(b);--i)
#define int long long
using namespace std;
inline int read()
{
char c=getchar();int x=0;bool f=0;
for(;!isdigit(c);c=getchar())f^=!(c^45);
for(;isdigit(c);c=getchar())x=(x<<1)+... | #include <iostream>
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <utility>
#include <cmath>
#include <unordered_map>
#include <math.h>
#define mod 1000000007
#define PI 3.141592653589
typedef long long ll;
const long long INF=1e18;
const long long inf=1e5 + 5;
using namespace std;
ll powe... |
#include <bits/stdc++.h>
using namespace std;
const int K = 18;
const int N = 100005;
const int INF = 1e9;
int n, m;
vector<int> edges[N];
int k;
int c[K];
int dist[K][N];
void bfs(int u, int dist[]) {
queue<int> q;
for (int i = 0; i < n; ++i) dist[i] = -1;
q.push(u);
dist[u] = 0;
while (q.size()) {
... | #pragma GCC optimize(3,"Ofast","inline")
#include<bits/stdc++.h>
#define ll long long
#define maxn 1000005
#define inf 1e9
#define pb push_back
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
inline ll read()
{
ll x=0,w=1; char c=getchar();
while(c<'0'||c>'9') {... |
#include<stdio.h>
#include<math.h>
#include<vector>
#include<algorithm>
#define ll long long
using namespace std;
int main(){
ll N;
scanf("%lld",&N);
vector<ll> a(N);
for(ll i = 0; i < N; i++) scanf("%lld",&a.at(i));
sort(a.begin(),a.end());
for(ll i = 0; i < N - 1; i++){
if(a.at(i) == a.at(i + 1)){
a.erase(... | #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;
#ifdef ENABLE_DEBUG
#define dump(a) cerr<<#a<<"="<<a<<endl
#define dumparr(a,n) cerr<<#a<<"["<<n<<"]="<<a[n]<<endl
#else
#define dump(a)
#define dumparr(a,n)
#endif
#... |
#include <cstdio>
using namespace std;
const int mod = 998244353;
int a[50][50];
int par[100];
int cnt[100];
long long fact[51];
int find(int x) {
if (par[x] == x) return x;
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y) return;
par... | #include <iostream>
#include <vector>
#include <string>
#include <list>
#include <queue>
#include <algorithm>
#define rep(i, n) for(i = 0; i < (n); i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define MOD 998244353
#define PI 3.14159265358979323846
#define INF 1 << 30
using namespace std;
t... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define LB(a,x) lb(all(a),x)-a.begin(... | // /Applications/Geany.app/Contents/MacOS/geany
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define pairii pair<int,int>
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
const int NUM=1000030;
const int N = 1000... |
#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 <bits/stdc++.h>
using namespace std;
const int f[3][3] = {
{1, 0, 0},
{1, 1, 0},
{1, 2, 1}
};
const int mod = 3;
int lucas(int x, int y) {
int res = 1;
while (x) {
res = res * f[x % mod][y % mod] % mod;
x /= mod, y /= mod;
}
return res;
}
int mp[200];
void solve()... |
/* _
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
int cnt[300005],k,n;
signed main(){
cin>>n>>k;
for(int i=1;i<=n;i++){
int x;
cin>>x;
cnt[x]++;
}
int ans=0;
for(int i=0;i<n;i++){
if(cnt[i]<k){
ans+=i*(k-cnt[i]);
k=cnt[i];
}
}
cout<<ans<<endl;
}
|
//int a = s - '0'; 文字から数字
//小文字から大文字
//transform(a.begin(), a.end(), a.begin(), ::toupper);
//map 全探索
//auto begin = p.begin(), end = p.end();
//for (auto it = begin; it != end; it++) {}
//mapのキー：it->first mapのバリュー：it->second
//大文字判定 isupper(文字) 小文字判定 islower(文字)
//do{}while(next_permutation(ALL(配列)))
//小文字に対応する文字コード：S... | #include <iostream>
using namespace std;
const int INF = 0x3fffffff;
void chmin(int& a, int b){ if(a > b) a = b; }
int main(){
int N;
cin >> N;
int ans = INF;
for(int i = 0; i < N; i++){
int A, P, X;
cin >> A >> P >> X;
if(X > A) chmin(ans, P);
}
if(ans == INF) ans = -1;
... |
#ifdef LOCAL
#pragma warning(disable:4996)
#pragma warning(disable:4244)
#pragma warning(disable:4554)
#define gets gets_s
#endif
#include<map>
#include<set>
#include<list>
#include<cmath>
#include<stack>
#include<queue>
#include<cmath>
#include<vector>
#include<string>
#include<cctype>
#include<cstdio>
#include<cstri... | #include<bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define pb push_back
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);cout.tie(0);
const int MOD = 1000000007;
#define PI = acos(-1)
using namespace std ;
signed main(){
fastio ;
int n ;
cin >> n ;
vector<int> v ;
for(int... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ui unsigned int
#define ull unsigned ll
#define foi(n) for(ll i=0;i<n;i++)
#define foj(n) for(ll j=0;j<n;j++)
#define fok(n) for(ll k=0;k<n;k++)
#pragma GCC optimize("O3", "unroll-loops")
#define fixed(); cout << fixed << ... | #include <bits/stdc++.h>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
#define me0(a) memset(a,0,sizeof(a))
#define me1(a) memset(a,-1,sizeof(a))
#define op freopen("in.txt", "r", stdin)
#define op1 freopen("C:\\acm\\Cproj\\in.txt","r",stdin);
#define pr freopen("C:\\acm\\Cproj\\out.t... |
#include<bits/stdc++.h>
#define for0(i, n) for(int i = 0; i < (n); i++)
#define for1(i, n) for(int i = 1; i <= (n);i++)
#define puts(x) cout << (x) << "\n"
using namespace std;
int si, sj, t[60][60], p[60][60], M;
bool b1[50 * 51];
int score(string s) {
int xs = si, ys = sj, r = p[xs][ys];
for (char c : s) {
if (c ... | #include <bits/stdc++.h>
using namespace std;
template <typename T>
bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T>
bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int n = 50;
const int vi[] = {0, 1, 0, -1};
co... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> x(N);
vector<int> y(N);
for(int i=0;i<N;i++){
cin >> x.at(i);
cin >> y.at(i);
}
int num = 0;
float delx = 0;
float dely = 0;
for(int j=0;j<N;j++){
for(int k=j+1;k<N;k++){
dely = y.at(j) - y.a... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++(i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++(i))
#define REP_R(i, n) for (int i = (int)(n)-1; (i) >= 0; --(i))
#define REP3R(i, m, n) for (int i = (int)(n)-1; (i) >= (int)(m); --(i))
#define ALL(x) ::std::begin(x), ::std::en... |
#include<bits/stdc++.h>
using namespace std;
/**************************************************/
#define int long long
#define fr(i,st,c) for(int i=st;i<c;i++)
#define rfr(i,e,c) for(int i=e;i>=c;i--)
#define i_output(f1) cout<<(f1?"YES":"NO")<<endl;
#define vi vector<int>
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 998244353; //10^9+7:合同式の法
int main(){
ll H, W, p, ans, i, j,last;
cin >> H >> W;
vector<string> S(H);
for(string &s : S) {
cin >> s;
}
ans=1;i=0;j=0;last=0;
while(true){
p=-1;
ll now=i;j=0;
while(now>=0){
... |
#include<iostream>
using namespace std;
int main(void){
int N;
cin>>N;
int A[N];
for(int i=0;i<N;i++){
cin>>A[i];
}
int k,gcd=0;
for(int i=2;i<=1000;i++){
int gcd2=0;
for(int j=0;j<N;j++){
if(A[j]%i==0){
gcd2++;
}
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); ++(i))
typedef long long ll;
const int INF = 1001001001;
int main()
{
ll n;
cin >> n;
vector<ll> a(n);
rep(i, n)
{
cin >> a[i];
}
vector<ll> gcdd(1000);
rep(i, n)
{
rep(j, 10... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
#define FOR(i, n) for(int (i)=0; (i)<(n); (i)++)
#define FOR1(i, n) for(int (i)=1; (i)<=(n); (i)++)
#define FORI(i, n) for(int (i)=n-1; (i)>=0; (i)--)
template<class T, class U> void umin(T& x, const... | #include <bits/stdc++.h>
using namespace std;
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::valu... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
int D = abs(r1-r2) + abs(c1-c2);
int64_t Ap = r1 + c1;
int64_t Am = r1 - c1;
int64_t Bp = r2 + c2;
int64_t Bm = r2 - c2;
//0回
if(r1 == r2 && c1 == c2){
cout << 0 << endl;
return 0;
}
/... | #include <bits/stdc++.h>
#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 all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
using namespace std;
using ll = long long;
const int INF = 1e9;
const ll LINF = 1e18;
template <class T>
void get_uni... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using pl = pair<ll, ll>;
const ll INF = ll(1e18);
const ll mod = ll(998244353);
const double pi = acos(-1);
#define rep0(i,n) for(ll (i) = 0; (i) < (n); ++(i))
#define rrep0(i,n) for(ll (i) = (n) - 1; (i) ... | #include<bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long int
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define vii vector<pii>
#define pb push_back
#define B begin()
#define E end()
#define F first
#de... |
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cinttypes>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<string>
#include<stack>
#define FSCNd64 "%" SCNd64
#define FPRId64 "%" PRId64
using namespace std;
using ll=long long;... | #include<bits/stdc++.h>
#define For(i,x,y) for (register int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (register int i=(x);i<(y);i++)
#define Dow(i,x,y) for (register int i=(x);i>=(y);i--)
#define Debug(v) for (auto i:v) printf("%lld ",i);puts("")
#define mp make_pair
#define fi first
#define se second
#define pb push_b... |
/* � Ashiq Uddin Pranto
Department of Computer Science and Engineering
BATCH 27
University Of Rajshahi,Bangladesh
*/
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define FOR(x,y) for(ll i=x;i<=y;i++)
#define pb(x) push_back(x)
#define mp make_pair
#define pii pair<int,int>
#define pll ... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return 1;
}
return 0;
}
#define DEBUG
#ifdef DEBUG
templ... |
#include <stdio.h>
#include <limits.h>
#include <math.h>
#include <iostream>
#include <algorithm>
using namespace std;
//check if points are collinear or not
bool check_collinear(int x1, int y1, int x2, int y2, int x3, int y3){
int a = x1 * (y2 - y3) + x2 * (y3 - y1) + x3 * (y1 - y2);
if (a == 0)
retur... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string S; cin >> S;
string ans = "No";
vector<ll> d(10, 0);
for (ll i = 0; i < S.size(); i++) {
d[S[i] - '0']++;
}
if (S.size() == 1) {
if (S[0] == '8') ans = "Yes";
}... |
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
long long pows(long long a, long long b) {
if (a == 0) return 0;
long long left = b;
long long ks = a;
long long ans = 1;
while (left > 0) {
if (left%2 == 1) {
ans = ans*ks%MOD;
}
ks = ks*ks%MOD;
left /= 2;
}
retu... | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
int main()
{
ll n;
cin >> n;
ll cnt = 0;
unordered_set<ll> d={};
n += n;
for (ll i = 1; i <= sqrt(n); i++)
{
if (n%i==0){
if (i%2!=(n/i)%2){
... | /*
／＞ フ
| _ _|
／`ミ _x 彡
/ |
/ ヽ ?
／￣| | | |
| (￣ヽ＿_ヽ_)_)
＼二つ
*/
#pragma GCC optimize("Ofast","inline","-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define pf push_front
#define F first
#define S s... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
// --------------------------------------------------------
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... | /**
* @FileName a.cpp
* @Author kanpurin
* @Created 2021.04.29 06:43:59
**/
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main() {
int n,m;cin >> n >> m;
vector<vector<pair<int,int>>> a(n+1);
for (int i = 0; i < m; i++) {
int x,y,z;cin >> x >> y >> z;
a... |
#include <iostream>
using namespace std;
int main()
{
string x,z = "";
cin>>x;
for(int i = 0; i < x.length(); i++)
{
if(x[i] == '.')
break;
z += x[i];
}
cout<<z;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define re register int
#define inf 0x7fffffffffffffff
inline int read()
{
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch)){x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
return f==1?x:-x;
}
signed main()
... |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<string>
#include<stdio.h>
#include<stdlib.h>
#include<float.h>
#include<tuple>
#include<string.h>
#include<iomanip>
#include<stack>
#include<queue>
#include<map>
#include<deque>
#include<math.h>
using namespace std;
#define ll long long
... | #include <iostream>
#include <cmath>
#include <stdio.h>
#include <string.h>
#include <bits/stdc++.h>
#include <vector>
#include <array>
#include <tuple>
#include <algorithm>
using namespace std;
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / ... |
#include <bits/stdc++.h>
using namespace std;
#define F(i,l,r) for(int i=l;i<=r;i++)
#define ll long long
char p[10000];
int res=0;
int main()
{
int m,t,n;
cin >> n >> m >> t;
int vt=0;
int cnt=n;
F(i,1,m)
{
int x,y;
cin >> x >> y;
cnt-=(x-vt);
if(cnt<=0) break;
... | #include <bits/stdc++.h>
#define N 200005
#define M 400005
#define inf 1e18
#define mp make_pair
#define int long long
using namespace std;
int n,m;
int head[N],v[M],C[M],D[M],nxt[M],tot;
priority_queue<pair<int,int> > q;
int dis[N];
bool vis[N];
int read()
{
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9')
{
i... |
#include<bits/stdc++.h>
using namespace std;
char c2,c1,c3;
int main()
{
c1=getchar(),c2=getchar(),c3=getchar();
if (c1==c2&&c2==c3) printf("Won\n");
else printf("Lost\n");
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define MAX 101
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string slots;
cin>>slots;
if(slots[0]==slots[1]&&slots[1]==slots[2])
cout<<"Won";
else
cout<<"Lost";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main(){
string s;
std::cin >> s;
std::map<int,ll> ma;
rep(i,s.size()){
int num=(int)(s[i]-'0');
ma[num]++;
}
if(s.size()==1){
if(s[0]=='8')std::cout << "Yes" << '\n';
el... | #include <iostream>
using namespace std;
typedef long long ll;
ll num,b[200],sum=0;
int main()
{
ll n;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>num;
b[num%200]++;
}
for(int i=0;i<200;i++)
{
if(b[i]>=2)
{
sum+=b[i]*(b[i]-1)/2;
}
}
cout... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
int A,B,C;
cin >> A >> B >> C;
if(A + C <= B){
cout << "Aoki" << endl;
}else{
cout << "Takahashi" << endl;
}
return(0);
}
| #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 && C == 0 )
cout << "Aoki" << endl;
if ( A == B && C == 1 )
cout << "Takahashi" << endl;
} |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <math.h>
#include <tuple>
#include <set>
#include <unordered_map>
#include <stack>
#include <map>
#include <cstdlib>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define all(x) (x).begin(),(x)... | #include <cstdio>
#include <iostream>
#include <vector>
#include <cstring>
using namespace std;
# define rep(i,a,b) for(int i=(a); i<=(b); ++i)
inline int readint(){
int a = 0; char c = getchar(), f = 1;
for(; c<'0'||c>'9'; c=getchar())
if(c == '-') f = -f;
for(; '0'<=c&&c<='9'; c=getchar())
a = (a<<3)+(a<<1)+(c... |
#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
#include<cstdio>
#include<stdio.h>
#include<cmath>
#include<math.h>
#include<vector>
#include<set>
#include<queue>
#include<map>
#include<sstream>
#include<iomanip>
#define forn(i,n) for(int (i)=0;i<(n);i++)
#define pb push_back
#define mp make_p... | #include <iostream>
using namespace std;
void solve() {
int n;
string s1,s2,s3;
cin >> n >> s1 >> s2 >> s3;
cout << string(n,'0') << string(n,'1') << '0' << endl;
}
int main() {
int t;
cin >> t;
for (int _=0; _<t; _++) solve();
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) (v).begin(), (v).end()
using ll = long long;
using P = pair<ll,ll>;
int n;
vector<int> c(100005);
vector<bool> ok(100005,false);
vector<bool> visited(100005,false);
vector<int> g[100005];
vector<int> cnt(10000... | #include<bits/stdc++.h>
#define fast {ios_base::sync_with_stdio(false);cin.tie(NULL);}
using namespace std;
const int mxn=2e5+5;
int c[mxn];
vector<int> g[mxn];
map<int, int> mp;
set<int> ans;
void dfs(int x, int p){
if(mp[c[x]]==0)
ans.insert(x);
mp[c[x]]++;
for(auto y:g[x]){
if(y==p)
... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
double sx, sy, gx, gy;
cin >> sx >> sy >> gx >> gy;
double x = (sy*gx + gy*sx) / (sy + gy);
cout.precision(12);
cout << x;
return 0;
} | #include <iostream>
#include <string>
#include <cmath>
using namespace std;
int main() {
float R, X, Y;
cin >> R >> X >> Y;
double dist = sqrt(X * X + Y * Y);
int ans = 0;
while (true) {
ans++;
if (R == dist) break;
if (R < dist) dist -= R;
if (R > dist) {
ans += 1;
break;
}
}
cout << ans << ... |
#include <bits/stdc++.h>
using namespace std;
void input(int& rnMaxNum)
{
cin >> rnMaxNum;
}
bool is7NotIncluded(int nNum, int nBase)
{
while (nNum != 0)
{
if (nNum % nBase == 7)
return false;
nNum /= nBase;
}
return true;
}
int calc7NotIncluded(int nMaxNum)
{
int n7NotIncluded = 0;
for... | #include <bits/stdc++.h>
#define pb push_back
#define fst first
#define snd second
#define fore(i,a,b) for(int i=a,ggdem=b;i<ggdem;++i)
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(),x.end()
#define mset(a,v) memset((a),(v),sizeof(a))
#define FIN ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
using namespace st... |
// Problem : C - Friends and Travel costs
// Contest : AtCoder - AtCoder Beginner Contest 203（Sponsored by Panasonic）
// URL : https://atcoder.jp/contests/abc203/tasks/abc203_c
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
usi... | #include <iostream>
#include<bits/stdc++.h>
using namespace std;
int main() {
int n,k;
cin>>n>>k;
string p=to_string(n);
for(int i=1;i<=k;i++){
string tmp1=p,tmp2=p;
sort(tmp1.begin(),tmp1.end());
sort(tmp2.begin(),tmp2.end(),greater<int>());
p=to_string(stoi(tmp2)-stoi(tmp1));
}
cout<<p<<endl;
retur... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define endl '\n'
ll n,m;
vector <P> v,w;
set<ll> s;
int main(){
cin >> n >> m;
rep(i,m){
ll x,y;
cin >> x >> y;
v.emplace_back(x,y);
}
sort(v... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
long long x;
cin >> n >> x;
vector<long long> a(n);
for (int i=0;i<n;i++) cin >> a[i];
vector<vector<long long>> dp(n,vector<long long>(2,0));
vector<long long> mins(n);
long long nx = x;
... |
#include<bits/stdc++.h>
#include<bits/extc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
using namespace __gnu_pbds;
template<typename TH> void _dbg(const char* sdbg, TH h) { cerr<<sdbg<<"="<<h<<"\n"; }
template<typename TH, typename... TA> void _dbg(const char* sdbg, TH h, TA... t){
while(*sdbg != ',') { ce... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
using namespace __gnu_pbds;
int n;
vector<int> adj[200005];
ordered_set ins[200005], outs[2... |
#include <bits/stdc++.h>
using namespace std;
int main(){
//入力
int A,B,C,X,Y,Z;
cin >> X>>Y>>Z;
if(X>=Y && X>=Z){
A=X;
if(Y>=Z){
B=Y, C=Z;
} else {
B=Z, C=Y;
}
} else if(Y>=X && Y>=Z){
A=Y;
if(X>=Z){
B=X, C=Z;
... | #include<bits/stdc++.h>
//#include <atcoder/all>
#define rep(i,n)for(int i=0;(i)<(int)(n);i++)
#define REP(i,a,b)for(int i=(int)(a);(i)<=(int)(b);i++)
#define ALL(a) (a).begin(),(a).end()
#define pb push_back
#define fi first
#define se second
#define sz(x) ((int)x.size())
using namespace std;
//using namespace atc... |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
int main(){
ld S,P;
cin >> S >> P;
for(ld i=1;i<1e6+5;i++){
if((ll)(P/i)==(P/i)){
if((P/i)+i==S){
cout << "Yes" << endl;
return 0;
}
... | /****************************
///// Shubham Singhal
///// LNMIIT
*****************************/
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <functional>
// using namespace __gnu_pbds;
#define ff first
#define ss second
#define mp make_pai... |
#include<bits/stdc++.h>
using namespace std;
int main ()
{
int n;
cin>>n;
if(n%2==0)
cout<<"White"<<endl;
else
cout<<"Black"<<endl;
}
| #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ll t;
string s;
cin>>s;
cout<<s[1]<<s[2]<<s[0];
}
|
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
#define inf 1e15+18
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define mod 998244353
#define f1(i,n) for(i=1;i<=n;i++)
#define f0(i,n) for(i=0;i<n;i++)
#define w(x) while(x--)
const int maxn=10... | #include <bits/stdc++.h>
#define int long long
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
using namespace std;
const int MOD = 998244353;
const int N = 2e5 + 5;
int resh[N], f[N + 500], n, m;
vector <int> primes;
int pow(int a, int b) {
if (b == 0) retu... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<int(n);i++)
#define foreach(c,itr) for(__typeof((c).begin()) itr=(c).begin();itr!=(c).end();itr++)
typedef long long ll;
typedef pair<int,int> P;
const ll MOD=998244353;
ll modpow(ll x,ll n){
ll res=1;
while(n!=0){
if(n%2!=0) res=(... | #include<bits/stdc++.h>
using namespace std;
#define vec vector<int>
#define vecp vector<pair<int,int>>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define fr first
#define sc second
#define fr1(i,a,b) for(int i=a;i<b;i++)
#define fr2(i,a,b) for(int i=a;i>=b;i--)
#define fr3(i,a,b) for(int ... |
#include<bits/stdc++.h>
#define pb push_back
#define Int long long
using namespace std;
Int N,M,K;
Int h,w;
Int X,Y,Z;
const int MAXN=500005;
const int NAX=1005;
const int HIGH=1e8+500;
int main()
{
#ifndef ONLINE_JUDGE
freopen("inputf.txt","r",stdin);
freopen("outputf.txt","w",stdout);
#endif
cin>>N;
vector<... | #include <stdio.h>
int gcd(int a, int b) {
if (!a)
return b;
return gcd(b % a, a);
}
int main() {
int n, a, b;
scanf("%i%i", &n, &a);
for (int i = 1; i < n; i++) {
scanf("%i", &b);
a = gcd(a, b);
}
printf("%i", a);
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define lowbit(x) (x & (-x))
char __c, __neg, __digit[128] = {0}, __skip[128] = {0};
void init_io() {
LL i;
for (i = 0; i <= 9; i++) __di... | #include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define deb(x) cout << #x << " = " << x << endl;
typedef long long ll;
typedef long double ld;
const int MOD = 1e9 + 7;
void solve() {
int n;
cin >> n;
vector<ll> a(n);
for(ll &i : a) cin >> i;
ll ans = 0;
sort(a.begin(), a.end());
for(int i... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod=998244353;
int n,a[200005],ans=0;
int main(){
cin>>n;
for(int i=1;i<=n;i++)cin>>a[i];
sort(a+1,a+n+1);
for(int i=1,sum=0;i<=n;i++){
ans=(ans+1ll*a[i]*sum+1ll*a[i]*a[i])%mod;
sum=(sum*2ll+a[i])%mod;
}
cout<<ans;
} | #include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
#define cin(a,n) for(int i=0;i<n;i++) cin>>a[i]
#define cin2(a,b,n) for(int i=0;i<n;i++) cin>>a[i]>>b[i]
#define mod 998244353
#define pb push_back
#define pie 3.141592653589793238462643383279
vector<bool> prime;
vector<int> fact,inv,p... |
/** try <3 **/
#include<bits/stdc++.h>
using namespace std;
#define task "sol"
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define zs(v) ((int)(v).size())
#define BIT(x, i) (((x) >> (i)) & 1)
#define CNTBIT __builtin_popcountll
#define ALL... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> using vc = vector<T>;
template<class T> using vvc = vc<vc<T>>;
template<class T> using vvvc = vc<vvc<T>>;
template<class T> using vvvvc = vvc<vvc<T>>;
template<class T> using PQ = priority_queue<T>;
template<class T> using invPQ = pri... |
#include<iostream>
#include<vector>
#include<bitset>
using namespace std;
unsigned xorshift()
{
static unsigned y=2463534242;
y^=y<<13;
y^=y>>17;
y^=y<<5;
return y;
}
const int N=20;
int M;
string S[800];
string outH[N],outW[N];
int G[800][800];
using bit=bitset<800>;
bit rest;
bit can[N+1][800];
int cnt[800];
int... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
// memo fixed setprecision(20);
using vvll = vector<vector<ll>>;
ll mod =1e9+7;
/*"itob" int to "N"base */ template<typename TypeInt> string itob(const TypeInt v, int base){static const char table[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";s... |
#include <array>
#include <cstddef>
#include <cstdint>
constexpr std::size_t bsr64(std::uint64_t c) noexcept {
#ifdef __GNUC__
return 63 - __builtin_clzll(c);
#else
constexpr std::array<std::size_t, 64> table = {
0, 1, 2, 7, 3, 13, 8, 27, 4, 33, 14, 36, 9, 49, 28, 19,
5, 25, 34, 17, 15, 53, 37... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int,null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ordered_set_pair tree<pair<int,int>,null_type,less<pair<int... |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
#define int ll
ll score(char c[], int a){
ll ans = 0;
int num[10];
for(int i=0;i<10;i++) num[i]=0ll;
for(int i=0;i<4;i++) num[c[i]-'0']++;
num[a]++;
for(int i=0;i<10;i++) ans += i*pow(10,num[i]);
return ans;
}
main... | #include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <math.h>
#include <string>
using namespace std;
int calc_score(long score, int cards, int p){
score -= p* pow(10, cards - 1);
score += p * pow(10, cards);
return score;
}
int main(){
long k;
cin >> k;
int s_... |
// UpS0lver
#include <bits/stdc++.h>
using namespace std;
#define sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(), (c).end()
#define tr(c, i) for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define uns(v) sort((v).begin(), (v).end()), v.erase(unique(v.begin(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n-1); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int,int>;
constexpr int N = 2000;
vector<vector<int>> g(N);
int bfs(int start, int n) {
vector<int> dist(N, -1);
queue<int> q;
dist... |
#include <bits/stdc++.h>
typedef long long ll;
#define Boost \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define endl '\n'
#define fo(i, x, y) for (__typeof(x) i = x; i < y; ++i)
#define fr(i, x, y) for (__typeof(x) i = x; i > y; i--)
#define sz(x) (int)(x).size()
#define mp make_pa... | #include<bits/stdc++.h>
using namespace std;
// #pragma GCC target ("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimization ("unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC target("fpmath=387") //ex... |
#include<bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
string s; cin >> s;
for(int i = 1; i <= 10; i++) {
string t = s;
reverse(t.begin(), t.end());
if(t == s) {
cout << "Yes\n";
return 0;
}
s = '0' + s;
}
cout << "No\n";
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i,a,n) for(int i=(a);i<(n);++i)
#define eFOR(i,a,n) for(int i=(a);i<=(n... |
//by ciwomuli
//enter ICPC WF 2020
#include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <sstream>
#define LL long long
using namespace std;
template <typename T>
... | // #define _GLIBCXX_DEBUG
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <l... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
template<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}
template<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>b)return 0; a=b; return 1;}
#define bitUP(x,a) ((x>>a)&1)
int dx[4]={0,1,0,-1}, dy[4]={1,0,-1,0... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
using namespace std;
int main() {
long long r1,c1,r2,c2;
cin >> r1 >> c1;
cin >> r2 >> c2;
int ans;
long long dist = abs(r2-r1)+abs(c2-c1);
if(dist==0) ans=0;
else{
if(dist<=3) ans=1;
else{
if(abs(abs(r2-r1)==abs(c2-c1))) ans... |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
constexpr ll MOD = 998244353;
#ifndef ONLINE_JUDGE
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " (" << x.first << " : " ... | #include <bits/stdc++.h>
using namespace std;
#define ios ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR(i,m) for(int i = 0 ;i < m ;i++)
#define mem(a ,b) memset(a, (b) , sizeof(a))
#define all(cont) cont.begin(),cont.end()
#define mp make_pair
#define pb push_back
#define F f... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend... | #include<iostream>
using namespace std;
int n,k,mod,maxn;
int f[101][550001];
int main()
{
cin>>n>>k>>mod;
f[0][0]=1;
for(int i=1;i<=n;i++)
{
maxn=(i+1)*i/2*k;
for(int j=0;j<=maxn;j++)
{
long long sum=0;
for(int kk=0;kk<=k;kk++)
{
if(j-i*kk<0)break;
sum+=f[i-1][j-kk*i];
}
f[i][j]=sum%mo... |
//
//
// File Creation Date:
// Author: Gourav(https://github.com/GouravKhunger)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef vector<ll> vll;
typedef set<int> si;
typedef priority_queue... | //----AUTHOR:kkdrummer----/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef long double ld;... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const int INF = 1000100;
const ll mod=1e9+7;
typedef pair<int,int> P;
const double pi=acos(-1);
int main() {
int n;
cin>>n;
vector<ll> a(n);
rep(i,n)cin>>a[i];
ll ans=1e17;
rep(i,1<<(n-1)... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> A(N);
for(int i=0;i<N;i++) cin >> A[i];
vector<int> pow2(31,1);
for(int i=1;i<=30;i++) pow2[i] = pow2[i-1] * 2;
int ans = pow2[30];
for(int i=0;i<(1<<(N-1));i++){
bitset<20> B(i);
vector<int> XOR(30,0), no... |
#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int,int>;
#define ALL(a) (a).begin(),(a).end()
int main(){
string n;
cin >> n;
while(true){
if(n.back() == '0'){
... | #include<bits/stdc++.h>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
typedef long long int lli;
typedef vector<int> vi;
typedef vector<long long int> vlli;
typedef pair<int,int> pii;
typedef pair<long long int,long long int> plli;
typedef vector< vi > vvi ;
typedef vector< vlli > vvlli ;
... |
#include <algorithm>
#include <iomanip>
#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>
#in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define sz(x) int(x.size())
const int mod = 1e9 + 7;
const int inf = 2e9 + 5;
const ll linf = 9e18 + 5;
const ll ll0 = 0 * 1ll;
int n;
const int N = ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.