code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pll;
typedef vector<pll> vpll;
#define ff first
#define ss seco... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
int sum(int d)
{
int sum = 0;
while (d > 0)
{
sum += d % 10;
d /= 10;
}
return sum;
}
void solve()
{
int a, b;
cin >> a >> b;
cout << max(sum(a), sum(b)) << endl;
}
int main()
{
int t = 1;
/... |
#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <complex>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
#include <... | #include <iostream>
#include <vector>
#include <numeric>
#include <queue>
#include <iomanip>
using namespace std;
typedef double ld;
vector<pair<int, int>> v; int n;
struct DSU {
vector<int> rank, parent;
DSU(int _n) : rank(_n, 1), parent(_n) {
iota(parent.begin(), parent.end(), 0);
}
int find(const int& u) {... |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<string.h>
#include<cstring>
#include<string>
typedef long long ll;
using namespace std;
const int MAX=0x3f3f3f;
const int MIN=-0x3f3f3f;
const int N=3e5+5;
ll a[N];
ll cnt[N];
int main()
{
int n,k;
cin >> n >> k;
ll minc=MAX;
ll maxc=MIN;
for(int i=1... | #include <bits/stdc++.h>
using namespace std;
enum Direction{
BACKWARD,
FORWARD,
UNDIRECTED
};
struct Edge{
int v, u, direction;
int other(int x){
if(x == u)
return v;
return u;
}
void set_source(int x){
if(x == u)
direction = FORWARD;
else
dir... |
#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()
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 ... | // E - Count Descendants
#include <bits/stdc++.h>
using namespace std;
#define vec vector
using vi = vec<int>;
using vvi = vec<vi>;
using ll = int64_t;
using PR = pair<ll,ll>;
#define all(x) (x).begin(),(x).end()
#define rp(i,s,e) for(int i=(s);i<(e);++i)
#define irp(i,s,e) for(int i=(s);i>(e);--i)
#define sz(a) int(a.... |
#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << '(' << ... | #include <bits/stdc++.h>
using namespace std;
#define fr(i,n) for(int i = 0; i<n; i++)
typedef long long ll;
#define rmin(a,b) a = min<ll>(a,b)
//solves https://atcoder.jp/contests/abc193/tasks/abc193_e
ll div(ll a, ll b, bool ceil){
ll ans = abs(a/b);
bool pos = (a<0)==(b<0);
if(a%b and ceil==pos) ans++;
if(!po... |
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
for (ll i = 1; ; i++) if (stoll(to_string(i) + to_string(i)) > N) {
cout << i - 1 << endl;
return 0;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
scanf("%lld", &n);
int ans = 0;
for(int i = 1; ; i++) {
string s = to_string(i);
s += s;
if(stoll(s) <= n) {
ans++;
}
else break;
}
printf("%d\n", ans);
}
|
#include <cstdio>
#include <cstring>
#include <string>
#define min(a, b) ((a) < (b) ? (a) : (b))
using namespace std;
static constexpr int cm = 1 << 17;
char cn[cm], *ci = cn + cm, ct;
inline char getcha() {
if (ci - cn == cm) {
fread(cn, 1, cm, stdin);
ci = cn;
}
return *ci++;
}
inline int getint() {
int A ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i,n) for(ll i=1;i<=(ll)(n);i++)
const int mod = 1e9+7;
template< int mod >
struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
... |
#include <iostream>
#include<algorithm>
#include<iomanip>
#include<cstdio>
#include<cmath>
#include<string>
#include <cstring>
#include<queue>
#include<set>
#include<stack>
#include <numeric>
using namespace std;
typedef long long ll;
ll x, y, a, b;
int main()
{
cin >> x >> y >> a >> b;
ll ans = 0;
while ((a - 1) * x... | // 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)
/*ヽ｀、ヽ｀｀、ヽ｀ヽ｀、、ヽ ｀ヽ 、ヽ｀🌙｀ヽヽ｀ヽ、ヽ｀
ヽ｀、ヽ｀｀、ヽ 、｀｀、 ｀、ヽ｀ 、｀ ヽ... |
#pragma GCC optimize ("-O2")
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define deb(x) cout<< #x << " " << x << "\n";
#define MAX 9223372036854775807
#define MIN -9223372036854775807
#define setbits(n) __builtin_popcountll(n)
#define mkunique(a) a.re... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ll long long
#define rep(i,n) for(ll i = 0; i < (n); ++i)
#define REP(i,x,n) for(ll i = (x); i < (n); ++i)
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
const ll mod = 1e9+7;
const ll INF =... |
/**
* author: otera
**/
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60;
#define rep(i, n) for(int i = 0; i < n; ++ i)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)... | #include <bits/stdc++.h>
using namespace std;
#define M1 1000000007
#define M2 998244353
#define INF 1e18
#define ll long long
#define pll pair<ll,ll>
#define REP(i,a,b) for(ll i=a;i<b;i++)
#define REPR(i,a,b) for(ll i=b-1;i>=a;i--)
#define forr(i,n) for(ll i=0;i<n;i++)
#define F first
#define S second
#define pb push... |
#define _USE_MA_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#inc... | #include <bits/stdc++.h>
using namespace std;
typedef int_fast32_t int32;
typedef int_fast64_t int64;
const int32 inf = 1e9+7;
const int32 MOD = 1000000007;
const int64 llinf = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define POSSIBLE(n) cout << ((n) ?... |
#include<bits/stdc++.h>
using namespace std;
using int64 = long long;
// const int mod = 1e9 + 7;
const int mod = 998244353;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);... | #include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:... |
/*
你指尖跃动的电光，是我此生不变的信仰，唯我超电磁炮永世长存！
君指先跃动の光は、私の一生不変の信仰に、唯私の超電磁砲永世生き！
唯我超电磁炮永世长存
我心所属依旧超电磁炮
超凡入圣吾炮任可再战
电闪雷鸣炮姐征战天下
磁轨炮学园最强电击使
炮姐震古烁今吾炮赛高
永无止境炮党头顶青天
世人皆知唯我哔哩哔哩
长驱直入最强电击公主
存二次元此生无悔入炮
我炮还能再战100年
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1000005;
struct IO_Tp {
const static int _I_B... | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<queue>
#include<vector>
#include<limits.h>
#define IL inline
#define re register
#define LL long long
#define ULL unsigned long long
#ifdef TH
#define debug printf("Now is %d\n",__LINE__);
#els... |
//#pragma GCC optimize ("O2")
//#pragma GCC optimize ("Ofast")
// IN THE NAME OF GOD
#include <bits/stdc++.h>
using namespace std;
typedef pair <int, int> pii;
template <typename Head>
inline void dout(Head in) {
cerr << in << '\n';
}
int main() {
ios::sync_with_stdio(false), cin.tie(NULL);
int n;
cin >> n;
... | #include <cstdio>
#include <cmath>
#include <iostream>
#include <set>
#include <algorithm>
#include <vector>
#include <map>
#include <cassert>
#include <string>
#include <cstring>
#include <queue>
using namespace std;
#define rep(i,a,b) for(int i = a; i < b; i++)
#define S(x) scanf("%d",&x)
#define S2(x,y) scanf("%d%... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define REP(i,s,n) for(int i = s; i < n; i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
using Graph = vector<vector<int>>;
const int INF = 1000000007;
int main(){
int n;
cin >> n;
vector<pair<int,int>>xy(n);... | // CTRL+ALT+M
#include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define int long long int
#define vi vector<int>
#define vb vector<bool>
#define vc vector<char>
#define vpi vector<pair<int,int>>
#define pii pair<int,int>
#define pb push_back
#define inf 1e18
#define ff first
#define ss second
#defin... |
#include <bits/stdc++.h>
#include <cassert>
#define rep(i, N) for (int i = 0; i < (N); ++i)
#define rep2(i, a, b) for (ll i = a; i <= b; ++i)
#define rep3(i, a, b) for (ll i = a; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define nl '\n'
#define endl '\n'
#define all(c)... | // テスト
#include<ctime>
#include<cmath>
#include<queue>
#include<cstdio>
#include<cctype>
#include<algorithm>
#define ll long long
using namespace std;
const ll N=2e5+7;
const ll INF=1ll<<55;
ll read() {
char c;
ll x=0,f=1;
while(!isdigit(c=getchar()))
f-=2*(c=='-');
while (isdigit(c)){
x=x*10+(c-48)*f;
c=get... |
//#include <atcoder/all>
#include <bits/stdc++.h>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if... | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long int n,q,i,ng,ok,mid;
cin >> n >> q;
vector<long long int> a(n+1),k(q),c(n+1);
a.at(0) = 0;
c.at(0) = 0;
for(i=1; i<=n; i++){
cin >> a.at(i);
c.at(i) = a.at(i) - i;
}
for(i=0; i<q; i++){
c... |
#include "bits/stdc++.h"
using namespace std;
#define for_(i, s, e) for (int i = s; i < (int) e; i++)
#define for__(i, s, e) for (ll i = s; i < e; i++)
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
#define endl '\n'
// if two adjacent nodes have same reachability, then they are in SCC
// no... | #include <bits/stdc++.h>
typedef long long int ll;
#define INF 1e18
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
ll x;
cin >> n >> x;
vector<int> arr(n);
for(int i=0;i<n;i++){
cin >> arr[i];
}
ll res=INF;
fo... |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B, C;
string win;
cin >> A >> B >> C;
if( C == 0) {
while(1) {
A--;
if( A < 0 ) {
win = "Aoki";
break;
}
B--;
if( B < 0 ) {... | #include <iostream>
#include <cstdio>
#include<bits/stdc++.h>
using namespace std;
int solve(int a,int b,int c)
{
if(a==b)
return c;
else if(a==c)
return b;
else if(b==c)
return a;
return 0;
}
int main(){
int a,b,c;
cin>>a>>b>>c;
cout<<sol... |
#include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define FORR(i, n) for(ll i = (ll)n - 1LL; i >= 0LL; i--)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using ll = long long;
constexpr ll Mod = 998244353;
constexpr ll mod = 1e9 + 7;
constexpr ll inf =... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <utility>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)
int main(){
string S; cin >> S;
int ans = 0;
rep(i,10000){
int K[4] = {i/1000,i/100%10,i/10%10... |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n;
cin >> n;
set<long long> ans;
long long lpn = min(n, 10000000ll);
for(int i = 1; i <= lpn; i++){
if(n%i == 0){
ans.insert(i);
ans.insert(n/i);
}
}
while(!ans.empty()){
cout << *begin(ans) << endl;
ans... | #include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
cout << n - 1 << endl;
} |
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <b... | #include "bits/stdc++.h"
using namespace std;
using li = long long;
const char newl = '\n';
template <class T> vector<vector<T>> vv(const unsigned int n, const unsigned int m, const T x) { return vector<vector<T>>(n, vector<T>(m, x)); }
template <class T> vector<vector<vector<T>>> vvv(const unsigned int n, const unsign... |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
using vii = vector<vector<int>>;
using vi = vector<int>;
int main()
{
int n, k, m;
cin >> n >> k >> m;
vi a(n-1);
int sum = 0;
rep(i, n - 1) {
... | #include<bits/stdc++.h>
using namespace std;
const int N=100010;
int main(){
int a,b,w;
cin>>a>>b>>w;
int m=1e9,M=0;
for(int n=1;n<=1e6;n++){
if(a*n<=1000*w&&1000*w<=b*n){
m=min(m,n);
M=max(M,n);
}
}
if(M==0)cout<<"UNSATISFIABLE";
else cout<<m<<' '<<M;
} |
#include <iostream>
using namespace std;
void chmax(double& a, double b){ if(a < b) a = b; }
int main(){
int N;
double D, H, ans = 0;
cin >> N >> D >> H;
while(N--){
double d, h;
cin >> d >> h;
chmax(ans, h - d * (H - h) / (D - d));
}
cout << ans << endl;
} | #define _GIBCXX_DEBUG
#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 namespace std;
using ll = long long;
int main(void) {
int N;
double D, H;
cin >> N >> D >> H;
vector<double> d(N);
vector<double> h(N);
re... |
#include<cstdio>
#define ll long long
ll n;
int main(){
scanf("%lld",&n);
for(ll i=3,a=1;i<=n;i*=3,a++)
for(ll j=5,b=1;j<=n;j*=5,b++)
if(i+j==n){printf("%d %d",a,b);return 0;}
printf("-1");
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define mod 998244353
#define INF 998244353
#define ull unsigned long long
#define pb push_back
#define endl '\n'
#define pi acos(-1)
#define pii pair<ll int,ll int>
#define all(a) ... |
#include<bits/stdc++.h>
using namespace std;
const int N = 500003;
int n;
char s[N],t[N];
int main()
{
scanf("%d%s%s",&n,s+1,t+1);
long long sum = 0ll;
int p=2;
while(p<=n && s[p]!='1') ++p;
for(int i=1;i<=n;++i) {
if(p==i) {
++p;
while(p<=n && s[p]!='1') ++p;
... | #include <bits/stdc++.h>
using namespace std;
char S[500005];
char T[500005];
priority_queue<int, vector<int>, greater<int> > A;
vector<int> B;
int main(){
int N;
scanf("%d", &N);
scanf(" %s %s", S, T);
int sizeA = 0;
for(int i = 0; i < N; i ++){
if(S[i] == '1'){
A.push(i);
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<pair<ll,ll> > vpl;//追加はmake_pairを使う
typedef long double ld;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll> > pqg; //昇順のPriority queue
#define rep(i, n) for... | #include <bits/stdc++.h>
#define ln '\n'
#define all(dat) dat.begin(), dat.end()
#define loop(i, to) for (int i = 0; i < to; ++i)
#define cont(i, to) for (int i = 1; i <= to; ++i)
#define circ(i, fm, to) for (int i = fm; i <= to; ++i)
#define foreach(i, dat) for (__typeof(... |
#include<bits/stdc++.h>
#define ll int
#define ld long double
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen ("input.txt" , "r" , stdin);
// freopen ("OUTPUT.txt" , "w" , stdout);
#endif
ll tc=1;
//cin>>tc;
while(tc--)
{
ll n,w;
cin>>n>>w;
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int x, y, a, b, temp1, temp2;
cin >> a >> b;
x = (a + b) / 2;
y = a - x;
cout << x << " " << y << "\n";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
double EPS=1e-9;
int INF=1000000005;
long ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(int)(n); i++)
#define rep1(i, n) for(int i=1; i<=(int)(n); i++)
#define rep2(i, n, m) for(int i=(int)n; i<=(int)m; i++)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> wi;
typedef vector<ll> vl;
const ll inf=1LL<<60;
const ... |
#include<bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> //Policy Based Data Structure
// using namespace __gnu_pbds; //Policy Based Data Structure
using namespace std;
// typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> pbds; //Policy Based Data Structure
/... | #include"bits/stdc++.h"
using namespace std;
using ll = long long;
#define rep(i,m,n) for(ll i=m;i<n;i++)
const ll mod = 1000000007;
const long double pai = 3.14159265358979;
int main() {
ll n;
cin >> n;
vector<long double>a(n);
rep(i, 0, n)cin >> a[i];
sort(a.begin(), a.end());
long double sum = 0;
rep(i, 0, n)... |
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const long long inf = 1LL<<60;
using ll = long long;
template<int MOD> struct ModInt {
static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
ModInt... | //------------------------------------------
// C++ templete
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;
//type
//------------------------------------------
using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using vi=vector<int>;
using vll=vector<ll>;
us... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<int, int>;
using VI = vector<int>;
#define fst first
#define snd second
const int N = 105;
string adj[N];
int n;
bool vis[N];
void dfs(int u) {
if (vis[u]) return;
vis[u] = true;
for (int v = 0; v < n; v++) {
if (adj[v][u] ... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define tej ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define ve vector<int>
#define vl vector<long long int>
#define vp vector<pair<long long int,long long int>>
#define pb push_back
#define fi first
#define se second
#define pb push... |
//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//#define int long long
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repa(i,a,n) for (long long i = (a); i < (long long)(n); i++)
#define Rrep(i,n) for (long long i = (long long)(n)-1; i >= 0; i--)
#define Rrepa(i,a,n) for (long long i = (long l... |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <iomanip>
using namespace std;
using ll = long long int;
vector<string> myspliter(const string &s, const char delimiter){
vector<string> res;
string part = "";
for(auto &p:... | #ifdef Rahul
#include "RAHUL.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define error(...) 42;
#endif
#define SZ(v) int((v).size())
#define ALL(vec) begin(vec), end(vec)
typedef long long i64;
template<typename T> inline bool uax(T &x, T y) {return (y > x) ? x = y, true : false;}
template<typename T> inline... |
#include "bits/stdc++.h"
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
long long a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, m = 0, n = 0, p = 0, q = 0, mod = 1000000007, pi = 3.1415926535;
string s1, s2;
char moji;
cin >> a;
cout << (a-1)/100+1 << endl;
retur... | #include <iostream>
using namespace std;
#include <math.h>
bool IsPrime(int num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false; // 偶数はあらかじめ除く
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
// 素... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define speed ios_base::sync_with_stdio(0); cin.tie(0);
#define FL(i,a,n) for(ll i=a;i<n;i++)
#define even(x) ... | #include<bits/stdc++.h>
using namespace std;
void __print(int x){cout<<x;}void __print(long x){cout<<x;}
void __print(long long x){cout<<x;}void __print(unsigned x){cout<<x;}
void __print(unsigned long x){cout<<x;}void __print(unsigned long long x){cout<<x;}
void __print(float x){cout<<x;}void __print(double x){cout<<x... |
#include <bits/stdc++.h>
using namespace std;
#define forr(i,m,n) for (int i=(m); i<=(n); i++)
#define forv(i,m,n) for (int i=(m); i>=(n); i--)
#define forall(it,p) for (auto it = p.begin(); it != p.end(); ++it)
#define R 998244353
#define DBG 1
typedef pair<int,int> pii;
typedef long long ll;
typedef pair<ll,ll> pll;
... | #include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=998244353;
int dp[3005][3005];
signed main(){
int n,k;
cin>>n>>k;
dp[0][0]=1;
for(int i=1;i<=n;i++){
for(int j=i;j>=1;j--){
dp[i][j]=(dp[i-1][j-1]+dp[i][j*2])%mod;
}
}
cout<<dp[n][k];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
const int MOD = 998244353;
int n, sz[N], rt[N], comp;
int get(int u) {
if (rt[u] == u) {
return u;
}
rt[u] = get(rt[u]);
return rt[u];
}
void mrg(int u, int v) {
u = get(u);
v = get(v);
if (u == v) {
retu... | #include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
int main(void){
int N, xbuf;
cin >> N;
long long D1buf = 0;
long long D2buf = 0;
long long D3buf = 0;
for(int i=0; i<N; i++){
cin >> xbuf;
D1buf += abs(xbuf);
D2buf += (long long)xbuf * xbuf;
... |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define dbl(k, x) fixed << setprecision(k) << (x)
template <typename _T>
inline void _DBG(const char *s, _T x) {
cerr << s << " = " << x << "\n";
}
template <typename _T, typename... args>
void _DBG(const c... | #include <bits/stdc++.h>
#define F first
#define S second
#define rep(i, a, b) for(int i = (a); i < (b); ++i)
#define per(i, a, b) for(int i = (b)-1; i >= (a); --i)
#define bck(i, a, b) if ((i) >= (a) && (i) < (b))
#define trav(x, a) for (auto &x : (a))
#define sz(a) (int)(a).size()
#define all(x) (x).begin(), (x).end(... |
#include <bits/stdc++.h>
#define numm ch-48
#define pd putchar(' ')
#define pn putchar('\n')
#define int long long int
using namespace std;
template<typename T>
void read(T &res) {
bool flag = false;
char ch;
while (!isdigit(ch = getchar())) (ch == '-') && (flag = true);
for (res = numm; isdigit(ch = ... | #include <bits/stdc++.h>
#include <iostream>
#include<stdio.h>
#include<math.h>
#include<string.h>
using namespace std;
double mina(double a,double b)
{
if(a<=b)
return a;
return b;
}
double maxa(double a,double b)
{
if(a<=b)
return b;
return a;
}
int main() {
long long int t,n,i,j,k,l,fla... |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 1e9;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep2(i, x, n) for(int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
vo... | #include<iostream>
#include<iomanip>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<deque>
#include<set>
#include<stack>
#include<numeric>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
struct Ed... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define vi vector<int>
#define pii pair<int,int>
#define piii pair<int, pii>
#define pb push_back
#define fs first
#define sc second
//#define ONLINE_JUDGE
#define endl "\n"
#define pow2(i) (1<<(i))
#define d0(x) cout<<x<<" "
#define d... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
if((s[0]==s[1]) && (s[1]==s[2]))
cout<<"Won"<<'\n';
else
cout<<"Lost"<<'\n';
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define vl vector<ll>
#define pii pair<int, int>
void allprime(int n, bool prime[])
{
for (int p=2; p*p<=n; p++)
{
if (prime[p] ... | /*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).be... |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using ld = long double;
using vld = vector<ld>;
using vb = vector<bool>;
#define rep(i, n) for ... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#in... |
#include<bits/stdc++.h>
using namespace std;
#define SZ(v) ((int)(v).size())
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) (v).begin(),(v).end()
template<typename T>inline bool chkmin(T &a,const T &b){return a>b?a=b,1:0;}
template<typename T>inline bool chkmax(T &a,const T &b){return a<b?a=b,1:0;}
typedef long... | #include <iostream>
int main() {
int x;
std::cin >> x;
if(x >= 0) std::cout << x;
else std::cout << 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define ull unsigned long long
#define endl "\n"
#define loop(n) for(int i = 0; i<n; ++i)
const int N = 1e3+5;
int n, freq[N], x;
bool permutation = true;
int main()
{
IOS;
cin >> n... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
set<int> S;
for(int i = 0;i<N;i++){
int a;
cin >> a;
S.insert(a);
}
if(N == S.size()) cout << "Yes" <<endl;
else cout << "No" <<endl;
} |
#include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int ... | #include <iostream>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <stack>
#include <bitset>
#include <functional>
#include <random>
#include <casser... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll one = 1;
const ll INF = 9223372036854775807; //10^18
const int inINF = 2147483647; //10^9
const ll MO... | #include <bits/stdc++.h>
using namespace std;
#define REPP(i,a,b,d) for(int i=(a);i<=(int)(b);i+=(d))
#define REP(i,a,b) REPP(i,a,b,1)
#define REVV(i,a,b,d) for(int i=(a);i>=(int)(b);i-=(d))
#define REV(i,a,b) REVV(i,a,b,1)
#define FOR(i,a) for(int i=0; i<(int)(a); i++)
#define FORD(i,a) for(int i=(int)(a)-1; i>=0; i--... |
#include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<queue>
#include<vector>
#include<stack>
#include<sstream>
#include<algorithm>
#define... | #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 <bits/stdc++.h>
// #include <atcoder/all>
// #include "icld.cpp"
using namespace std;
using ll = long long int;
using pii = pair<int,int>;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using ss = string;
using db = double;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define ull unsigned long long
#define mp make_pair
void solve()
{
ll n,m;
cin>>n>>m;
vector<ll>v(n);
ll i,j;
for(i=0;i<n;i++)cin>>v[i];
sort(v.begin(),v.end());
vector<ll>form(m);
for(i=0;i<m;i++)cin>>fo... |
#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
//using namespace boost::multiprecision;
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> P;
#define PI 3.141592653589793
#define MOD 1000000007
//#define MOD 998244353
#define ALL(obj) (obj).begin(),(obj).e... | #include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
const int M = 300005;
int read()
{
int x=0,f=1;char c;
while((c=getchar())<'0' || c>'9') {if(c=='-') f=-1;}
while(c>='0' && c<='9') {x=(x<<3)+(x<<1)+(c^48);c=getchar();}
return x*f;
}
int n,m,tot,f[M],dis[M];
struct edge
... |
// -----------------------------------
// author : MatsuTaku
// country : Japan
// created : 11/01/20 20:25:34
// -----------------------------------
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr); ios::sync_with_stdio(false);
int n,m; cin>>n>>m;
vector<i... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i,a,b) for(int i=a;i<=b;i++)
inline ll r() {
ll x=0,f=1;
char c=getchar();
while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return x*f;
}
#define d r()
ll a,b,c;
int main(){
a=d,b=d,c=d;
printf("... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
int main(){
int h, w;
cin >> h >> w;
int v = 1000;
int a[h][w];
rep(i,h) {
rep(j,w) {
cin >> a[i][j];
v = min(v,a[i][j]);
}
}
int ans = 0;
rep(i,h) {
rep(j,w) {
... | #include<bits/stdc++.h>
using namespace std;
int h,w,ans,a[10001],minm=101;
int main(){
scanf("%d%d",&h,&w);
for(int i=1;i<=h*w;i++){
scanf("%d",&a[i]);
minm=min(minm,a[i]);
}
sort(a+1,a+h*w+1);
int x=min(minm,a[(h*w+1)>>1]);
for(int i=1;i<=h*w;i++)ans+=a[i]-x;
printf("%d\n",ans);
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll a,b,c;
cin>>a>>b>>c;
if(a==b)
cout<<c;
else if(b==c)
cout<<a;
else if(a==c)
cout<<b;
else
cout<<0;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
int main() {
int a, b, c;
cin >> a >> b >> c;
set<int> set;
set.insert(a);
set.insert(b);
set.insert(c);
if (set.size() == ... |
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#pragma GCC optimize(2)
#include<set>
#include<map>
#include<cmath>
#include<queue>
#include<random>
#include<bitset>
#include<string>
#include<vector>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<unordered_map>
#include<... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
int nod (int n) {
int result = ((n <= 1) ? 1 : log10(n) + 1);
return result;
}
int npr(int n , int r){
int result;
if (n- r == 0) result = 2;
else result = ((n * (n+ 1)) / 2) / ((n - r) * (n - r + 1) / 2... |
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846 // pi
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
#define rep(a,n) fo... | #include <iostream>
#include <math.h>
#include <iomanip>
#include <bits/stdc++.h>
#include <string.h>
#include <string>
#include <algorithm>
#define ll long long int
#define pb push_back
#define fi first
#define se second
#define mem(a,b) memset(a,b,sizeof(a))
#define debug(x) cout << (#x) << " = " << x << endl;
#defin... |
#include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
int main() {
int h = ri();
int w = ri();
int x = ri() - 1;
int y = ri() - 1;
std::string s[h];
for (auto &i : s) std::cin >> i;
int cnt = -3;
for (int i = x; i < h && s[i][y] != '#'; i++) cnt++;
for (int i = x; i >= 0 && s[i][y] != '#... | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) begin(a), end(a)
#define RALL(a) rbegin(a), rend(a)
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<typename T> using Graph = vector<vector<T>>;
template<typename T> using Spacial = vector<vector<vector<T>>>;
template<typ... |
#include<iostream>
#include<queue>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<map>
using namespace std;
#define PI 3.1415926535898
const int mm=1e7+10;
double arr[mm];
int main()
{
int n;
cin>>n;
int maxx=-1;
int minn=1e9;
for(int i=1;i<=n;i++)
{
int a;
cin>>a;
maxx=max(a,maxx);
}
for(... | #include<iostream>
using namespace std;
#include<bits/stdc++.h>
typedef long long int ll;
int main(){
ll n;cin>>n;
ll arr[n];
ll cnt=n*(n-1)/2;map<ll,ll>mp;
for(int i=0;i<n;i++){
cin>>arr[i];
mp[arr[i]]++;
}
for(auto it=mp.begin();it!=mp.end();it++){
ll c=it->second*(it->second-1)/2;
cnt-=c;... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(n);i++)
const ll INF = 1LL<<60;
int main(){
ll diri[4]={0,1,0,-1};
ll dirj[4]={1,0,-1,0};
ll H,W;
cin>>H>>W;
char a[H][W];
pair<ll,ll> goal;
queue<pair<ll,ll>> que;
vector<vector<ll>> dist(H,vector<ll... | //debug icin gdb kullanmayi dene
#include<bits/stdc++.h>
using namespace std;
#define mods 1000000007
#define pb push_back
#define mp make_pair
#define st first
#define nd second
typedef long long int lint;
typedef unsigned long long int ulint;
lint fastpow(lint tab,lint us){
if(tab==0) return 0;
if(tab==1) return 1;... |
#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;
///Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
#de... | #include<iostream>
#include<vector>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
const int maxN=10;
vector<vector<int>> T(maxN, vector<int> (maxN, -1));
bool used[maxN];
vector<int> v={0};
int N,K;
int dfs(){
if(v.size()==N){
v.push_back(0);
int sum=0;
rep(i, N){
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define _FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define pii pair<int , int>
#define pb emplace_back
const int MAXX = 1e5 + 5;
int b , c ;
signed main()
{
_FastIO;
cin >> b >> c;
long long ans = 0;
... | #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
typedef pair<long long, long long> pll;
long long b, c;
int solve() {
scanf("%lld %lld", &b, &c);
long long ans = 0;
pll range1 = {b - c/2, b + max(0LL, c - 2) / 2};
pll range2 = {-b - (c - 1) / 2, -b + (c - 1) / 2};
// cerr << range1.f... |
#include<bits/stdc++.h>
#define ll long long int
#define rep(x,start,end) for(auto x=start;x!=end;x++)
using namespace std;
ll A,B,C;
void atcoder()
{
cin>>A>>B>>C;
}
char eq(ll A, ll B)
{
if (A < B)
{
return '<';
}
else if (A > B)
{
return '>';
}
return '=';
}
ch... | #include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define frfr freopen("input.txt","r",stdin); //freopen("output.txt","w",stdout);
#define endl "\n"
#define loop(i,n) for(int i=0;i<n;i++)
#define ll long long int
void solve(){
int a , b ,c;
cin >> a >> b >> ... |
#include<bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);
#define ll long long
#define t() int t;cin>>t;while(t--)
#define lt() long long int t;cin>>t;while(t--)
#define ff first
#define ss second
#define pb... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N=10;
int counter = 0;
int maru_num = 0;
int hatena_num = 0;
for (int i = 0; i < N; i++) {
if( S[i] == 'o' ){
maru_num++;
}
if( S[i] == '?' ){
hatena_num++;
}
}
for (int i = 0; ... |
#include <iostream>
using namespace std;
int main()
{
int n;
cin>>n;
int a[n]={0};
int check[200]={0};
long long ans=0;
for(int i=0;i<n;i++)
{
cin>>a[i];
if(check[a[i]%200]!=0)
ans+=check[a[i]%200];
check[a[i]%200]++;
}
cout<<ans;
return ... | #include <bits/stdc++.h>
using namespace std;
int n;
vector<int> a;
int dp[101][100001];
void solve() {
cin >> n;
a.resize(n);
int sum = 0;
for(int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
for(int i = 0; i <= n; i++)
dp[i][0] = 1;
for(int i = 0; i < n; i++) {
... |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
int main() {
int n, m, k;
int N[100] = {0};
pair<int, int> K[17], M[101];
function<int(int)> rec = [&](int i) {
if (i == k) {
int cnt = 0;
for (int j = 0; j < m; ++j) {
auto[f, s] = M[j];
if (N[f] && N[s]) cnt++;
... | #include<bits/stdc++.h>
#define SORT(v) sort(v.rbegin() , v.rend())
#define si(n) scanf( "%d" , &n)
#define sii(n , m) scanf( "%d %d" , &n , &m)
#define sl(n) scanf( "%lld" , &n)
#define sll(n , m) scanf( "%lld %lld" , &n, &m)
#define ss(cad) scanf( "%s" , cad)
#define sz(x) (int)x.size()
#define PB push_back
#define f... |
#include <bits/stdc++.h>
using namespace std;
// 解法1 1次式を持つDP の実装
int main() {
int n, m, k;
cin >> n >> m >> k;
vector<bool> ng(n, false);
for (int i = 0; i < k; i++) {
int a;
cin >> a;
ng[a] = true;
}
vector<vector<double>> g(n + m, vector<double>(2, 0.0));
vector<double> sum(2, 0.0);
for (int i = n - 1... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
int n, m, k, a, cnt;
bool f[100005];
complex<double> p[100005];
int main(){
scanf("%d%d%d", &n, &m, &k);
rep(i,k){
scanf("%d", &a);
f[a] = true;
}
for(int i=n-1; i>=0; i--){
if(f[i]){
cnt++;
if(cnt >= m) return 0 * p... |
#include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int a = 0;
int b = -1;
for(int i = 1; i < n + 1; i++) {
int v, p;
cin >> v >> p;
a += v * p / 100;
if(a > x) {
b = i;
i = n;
}
if((n == 1) and (x == 0) and (v == 1) ... | #include<bits/stdc++.h>
using namespace std;
vector<int > G[25];
vector<int > V;
vector<int > P;
int a[105],vis[105];
long long ans=0;
bool check(int u,int c){
for(int i=0;i<G[u].size();i++){
if (a[G[u][i]] == c) return false ;
}
return true ;
}
void BFS(int u){
V.clear();
queue<int> q;
q.push(u);
vis[u]=1;
w... |
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define endl "\n"
#define ll long long
#define sz(s) (int)(s.size())
#define INF 0x3f3f3f3f3f3f3f3fLL
#define all(v) v.begin(),v.end()
#define watch(x) cout<<(#x)<<" = "<<x<<endl
const int dr[] { -1, -1, 0, 1, 1, 1, 0, -1 };... | /*** keep hungry and calm CoolGuang! ***/
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#include<stdio.h>
#include<queue>
#include<algorithm>
#include<string.h>
#include<iostream>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
typedef long long ll;
typedef... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define rng(v) v.begin(),v.end()
#define rngr(v) v.rbegin(),v.rend()
const long long INF = 1LL << 60;
using name... | // URL
#include <iostream>
#include <string>
using namespace std;
#define loop(i, a, b) for (int i = a; i < b; i++)
#define mp make_pair
#define pb push_back
#define sz size
#define rsz resize
typedef long long LL;
const char NL = '\n';
const char SP = ' ';
const char HB[] = "HOBA";
const LL llinf = 9e18;
const int ii... |
#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); +... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<map>
#include<algorithm>
#define N 200005
using namespace std;
int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
return x*f;
}
int n,a[N],maxn=... |
#include <iostream>
#include <cmath>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <iterator>
#include <unordered_map>
#include <unordered_set>
#include <sstream>
#include <fstream>
#... | #include<bits/stdc++.h>
using namespace std;
int main(){
int64_t R, X, Y;
cin >> R >> X >> Y;
int64_t D = X*X + Y*Y;
int64_t ok = 1e7;
int64_t ng = 0;
while(ok - ng > 1){
int64_t mid = (ok+ng)/2;
int64_t K = mid*R;
if(K > D/K || (K == D/K && D%K == 0)){
ok = mid;
}
else{
ng =... |
#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... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int lld;
typedef pair<int,int> pi;
typedef pair<lld,lld> pl;
typedef pair<int,lld> pil;
typedef pair<lld,int> pli;
typedef vector<int> vit;
typedef vector<vit> vitt;
typedef vector<lld> vlt;
typedef vector<vlt> vltt;
typedef vector<pi> vpit;
typedef vector... | #include <bits/stdc++.h>
using namespace std;
int main(void){
string S;
cin >> S;
swap(S[0], S[2]);
swap(S[0], S[1]);
cout << S << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (ll i=0; i<n; ++i)
#define all(obj) (obj).begin(),(obj).end()
#define MOD 1000000007
#define PI acos(-1)
#define INF = 1001001001;
using namespace std;
using Graph = vector<vector<long long>>;
typedef long long ll;
long long GCD(long long x, long long y) { return y ? GCD(y... | //#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define sz(a) (int)a.size()
#define INF 0x3f3f3f3f
#define DNF 0x7f7f7f7f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define PiL pair <ll , ll>
#define PLL pair <ll ... |
#include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
using namespace std;
int main(){
long n,temp,temp1,ans;cin>>n;
long digit=to_string(n).size();
if(digit%2==1){
temp=pow(10,digit/2)-1;
ans=temp;
}else{
temp=n/pow(10,digit/2);
temp1=n%(long)pow(1... | #include<bits/stdc++.h>
using namespace std ;
#define ll long long
#define pb push_back
#define all(v) v.begin(),v.end()
#define sz(a) (ll)a.size()
#define F first
#define S second
#define INF 2000000000000000000
#define popcount(x) ... |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <unordered_map>
#include <iomanip>
#include <cmath>
#include <queue>
#include <... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#i... |
#include <bits/stdc++.h>
using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;
class rep {
struct Iter {
usize itr;
constexpr Iter(const u... | #include<bits/stdc++.h>
using namespace std;
int mod=1000000007;
int main()
{
int m,h;
cin>>m>>h;
if(h%m==0)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
}
/* common mistakes:
long long
pass constants as &
*/
|
#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;
int a[233];
char ch[1000000+10];
bool Check(int x,int y,int z)
{
a[x]--;
a[y]--;
a[z]--;
if((a[x]>=0)&&(a[y]>=0)&&(a[z]>=0)) return true;
a[x]++;
a[y]++;
a[z]++;
return false;
}
int main()
{
scanf("%s",ch+1);
for(int i=1;ch[i];i++)
a[ch[i] - '0']++;
int n... |
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define A... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define bit(n,k) ((n>>k)&1)
using namespace std;
typedef long long ll;
ll x,y;
unordered_map<ll,ll> mp;
ll Dfs(ll n){
if(n <= x) return x - n;
if(n % 2 == 0) return mp[n] = min(n - x, Dfs(n / 2) + 1);
if(mp.count(n)) return mp[n];
r... |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using P = pair<int,int>;
/*
for(int i=0;i<n;i++){
}
*/
int main(){
int n;
cin>>n;
cout<<n-1<<endl;
}
| #include <bits/stdc++.h>
typedef long long ll;
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
using namespace std;
// void solve()
// {
// }
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
// int t;
// cin >> t;
// while (t--)
// solve();
int n;
cin >> n;
int ... |
// Problem: B - 200th ABC-200
// Contest: AtCoder - KYOCERA Programming Contest 2021（AtCoder Beginner Contest 200）
// URL: https://atcoder.jp/contests/abc200/tasks/abc200_b
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
using nam... | // Problem: B - 200th ABC-200
// Contest: AtCoder - KYOCERA Programming Contest 2021（AtCoder Beginner Contest 200）
// URL: https://atcoder.jp/contests/abc200/tasks/abc200_b
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include<bits/stdc++.h>
using namespace std;
#d... |
#include <bits/stdc++.h>
// #define int long long
#define ff first
#define ss second
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ti tuple<int, int, int>
#define vi vector<int>
#define vl vector<ll>
#define vii vecto... | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int k; cin>>k;
string s,t; cin>>s>>t;
vector<int> vec(9,k);
for(int i=0;i<4;i++){
vec.at(s.at(i)-'0'-1)--;
vec.at(t.at(i)-'0'-1)--;
} //vec内が残り枚数を示すことに。なお合計枚数は9k-8枚
double ans=0;
cout << fixed<<setprecision(... |
#include <cmath>
#include <deque>
#include <algorithm>
#include <iterator>
#include <list>
#include <tuple>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <stack>
#include <string>
#include <vector>
#include <fstream>
#include <iostream>
#include <functional>
#... | #include<bits/stdc++.h>
using namespace std;
using P = pair<int64_t,int64_t>;
const int MAX = (1<<19);
int64_t dp[MAX];
int main(){
int N, M;
cin >> N >> M;
vector<vector<P>> vec(N,vector<P>(0));
for(int i=0; i<M; i++){
int X, Y, Z;
cin >> X >> Y >> Z;
X--;
vec[X].push_back(P(Y,Z));
}
dp[0] ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
ty... | #include <iostream>
#include <cstdio>
#define maxn 500005
using namespace std;
int n, pos[maxn], cnt;
char s[maxn], t[maxn];
int main()
{
scanf("%d%s%s", &n, s + 1, t + 1);
for (int i = 1; i <= n; i++)
{
if(t[i] == '1') pos[++cnt] = i;
}
int now = 1, st = 0;
long long ans = 0;
for (int i = 1; i <= n; i++)
{
... |
#include<bits/stdc++.h>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long int
#define mod 1000000007
#define inf 1e18+42
#define endl "\n"
#define pi 3.1415926535897932384626433832795028841971693993751058
#def... | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
typedef vector<int> vi;
#define all(x) x.begin(), x.end()
#define FIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
#define deb(x) ... |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
bool check(ll K) {
string S=to_string(K);
for(auto x:S) {
if(x=='7') {
return false;
}
}
return true;
}
ll hachi(ll k) {
ll t=1;
ll s=0;
while(k>=8) {
s+=(k%8)*t;
k/=8;
t*=10;
... | #include <bits/stdc++.h>
using namespace std;
bool check(int i){
for(int j = i; j > 0; j /= 10){
if(j % 10 == 7){
// cout << j << endl;
return true;
}
}
for(int k = i; k > 0; k /= 8){
if(k % 8 == 7){
// cout << k << endl;
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<char> vc;
typedef pair<int, int> pii;
typedef map<int, int> dictii;
typedef map<string, int> dictsi;
typedef map<string, string> dictss;
typedef pair<string, string> pss;
typedef set<i... | #include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
string s;
string search = "ZONe";
cin >> s;
int count = 0;
for (int i = 0; i < 9; i++)
{
//cout << s.substr(i, 4) << endl;
if (s.substr(i, 4) == se... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int nax=4e5+10,mod=1e9+7;
char s[nax];
int f[nax],c[nax],n;
int get(int m,int k)
{
if(c[m]>c[k]+c[m-k])
return 0;
return f[m]*f[k]*f[m-k]%3;
}
int32_t main()
{
int tt=1;
//cin>>tt;
while(tt--)
{
cin>>n;
... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
const ll MOD = 3;
ll calc_pow(ll x, ll pow) {
if (pow == 0) return 1;
ll a = calc_pow(x, pow / 2);
a = a * a % MOD;
if (pow % 2 == 1) a *= x;
return a % MOD;
}
ll calc_div(ll a, ll b) {
retu... |
/*
JAI JAGANNATH!
*/
//@Author : zanj0
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define ff first
#define ss second
#define pb push_back
#define MOD 1000000007
#define inf 1e18
#define ps(x,y) fixed<<setprecision(y... | #include <bits/stdc++.h>
using namespace std;
#define deb(k) cerr << #k << ": " << k << "\n";
#define size(a) (int)a.size()
#define fastcin cin.tie(0)->sync_with_stdio(0);
#define st first
#define nd second
#define pb push_back
#define mk make_pair
#define int long long
typedef long double ldbl;
typedef double dbl;
typ... |
#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
using pii = pair<int, int>;
#define rep(i, s, n) for (int i = (int)s; i <... | #include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#include <stack>
#include <algorithm>
#include <cmath>
typedef long long ll;
using namespace std;
ll Atoi(string s, ll radix, ll m)
{
ll ans = 0;
for (ll i = 0; i < s.size(); i++)
{
char t = s[i];
if (ans > m/radix)
... |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <climits>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstr... | #include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <array>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#define ll long long
using namespace std;
int main()
{
// freopen("in.... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H,W,X,Y;
cin >>H>>W>>X>>Y;
vector<vector<char>> s(H, vector<char>(W));
for (int i = 0; i < H; i++) {
// i番目の状態を読む
for (int j = 0; j < W; j++) {
cin >> s.at(i).at(j);
}
}
int count_t = 0;
int count_y =0;
//縦で考える
... |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> ... | /*
* @Author: BilyHurington
* @Date: 2021-06-28 08:39:58
* @LastEditors: BilyHurington
* @LastEditTime: 2021-06-28 08:47:18
*/
#include<bits/stdc++.h>
#ifdef LOCAL_TEST
#include<ctime>
#endif
using namespace std;
int n,w[110],f[110][5010],Fac[110];
const int mod=998244353;
void Add(int &x,int y){x+=y;x-=x>=mod?mod... |
#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 << 60;
int mod = 1000000007;
int dp[3030][10][50];
void init(){
rep(i, 3030) rep(j, 10) rep(k, 50) dp[i][j][k] = 0;
dp[0][0][0] = 1;
}
int main(vo... | #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"
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
long long a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, m = 0, n = 0, p = 0, q = 0, mod = 1000000007, pi = 3.1415926535;
string s1, s2;
char moji;
cin >> a >> b >> c;
cout << 21-a-b-c << endl;
... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <functional>
using namespace std;
int main(int argc, char *argv[]){
int a;
int b;
int c;
std::cin >> a >> b >> c;
int result = 0;
result += (7 - a);
result += (7 - b);
result += (7 - c... |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
string s;
cin>>s;
int q;
cin>>q;
int cnt=0;
while(q--)
{
int t,a,b;
cin>>t>>a>>b;
if(t==2)
{
cnt++;
}
else
{
if(cnt%2==1)
... |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long int N;
cin >> N;
vector<vector<long long int>> vec(N,vector<long long int>(2));
for(int i=0;i<N;i++) cin >> vec[i][0] >> vec[i][1];
long long int M;
cin >> M;
vector<vector<vector<long long int>>> OP(M+1,vector<vector<long long int>>(2,ve... | #include "bits/stdc++.h"
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,mmx,avx,avx2")
using namespace std;
using ll = long long;
void A()
{
string s; cin >> s;
if (s[0] == s[1] && s[1] == s[2]) cout << "Won\n";
else cout << "Lost\n";
}
void B()
{
int... |
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <string>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <ctime>
#include <cassert>
#include <fstream>
#include <stack>
#include <random>
#include <i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
double a = 0.0;
for (int i = 1; i < N; i++) {
a += (1.0 / (double)i);
}
double ans = a * (double)N;
cout << fixed << setprecision(10) << ans << endl;
} |
/*
#pragma GCC optimize("Ofast")
#pragma GCC target("avx", "avx2", "fma")
#pragma GCC optimization("unroll-loops")
*/
#include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define IOS ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
#define fi first
#define se second
#define pf push_front
#define pb pus... | #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>;
using Graph = vector<vector<int>>;
template<class T> void chmax(T& a, T b){
if(a < b){
a = b;
}
}
template<class T> void chmin(T& a, T b){
if(a > b){
a ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s, t;
cin >> n >> s >> t;
vector<int> s0, t0;
for (int i = 0; i < n; i++) {
if (s[i] == '0') {
s0.push_back(i);
}
if (t[i] == '0') {
t0.push_back(i);
}
}
if (s0... | #include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define mp make_pair
#define ll long long
int gcd(int a,int b){
if(b==0)
return a;
int hcf=gcd(b,a%b);
return hcf;
}
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
/* // for getting input from... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.