code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
#include <ctim... | // Have a nice day
// ∠( ᐛ 」∠)
#include<bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define x first
#define y second
using namespace std;
typedef long long LL;
typedef pair<int,int> pii;
template <typename T> inline T read()
{
T sum=0, fl=1; char ch=getchar();
for(; !isdigit(ch); ch=getchar())... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define dump(v) \
cerr << #v ":[ "; ... | #include <vector>
#include <queue>
#include <iostream>
#include <set>
#include <algorithm>
#define ii pair<int, int>
#define iii pair<ii, int>
#define pq priority_queue
using namespace std;
int bfs(vector<vector<char>> graph, ii start, ii goal, int h, int w) {
queue<iii> possible;
set<ii> visited;
possibl... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define INF 1LL<<60
#define pi 3.14159265358979323846
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return true;} return false;}
template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return true;} return false;}
in... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int k, x;
cin >> k >> x;
int left = x - k + 1, right = x + k - 1;
for(int i = left; i < right; i++)
cout << i << " ";
cout << right << endl... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
rep(ki, k) {
vector<int> b(n + 1);
rep(i, n) {
int l = max(0, i - a[... | #include <bits/stdc++.h>
#define sz(arr) (int)(arr).size()
#define rng(arr) arr.begin(), arr.end()
#define show(x) cout << #x << " = " << x << endl;
using namespace std;
typedef long long int ll;
void _cin() {}
template <class Head, class... Tail>
void _cin(Head&& head, Tail&&... tail) {
cin >> head;
_cin(forward... | 0 |
/*
{
AuThOr Gwj
*/
#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define rb(a,b,c) for(int a=b;a<=c;++a)
#define rl(a,b,c) for(int a=b;a>=c;--a)
#define LL long long
#define IT iterator
#define PB push_back
#define II(a,b) make_pair(a,b)
#define FIR first
#define SEC second
#define FREO freopen("check.out","w",stdou... | #include <bits/stdc++.h>
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 (a > b) {
a = b;
return true;
}
return... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
//#define int long long
//signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int h,w;
cin >> h >> w;
vector<bool> a(h*w,false);
queue<int> que;
for(int i = 0; i < h; i++) ... | //高知能系Vtuberの高井茅乃です。
//Twitter: https://twitter.com/takaichino
//YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INTINF 1999999999
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 10... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define invrep(i,n) for(int i = (int)(n); i > 0; i++)
using ll = long long;
int main() {
int k;
cin >> k;
string n;
cin >> n;
if (n.size() > k) {
... | #include <iostream>
#include <string>
int main(){
std::string s;
int n;
std::cin>>n,std::cin.get();
for(;n;n--){
getline(std::cin,s);
int pos=0;
while(pos=s.find("Hoshino",pos),pos!=std::string::npos){
s.replace(pos,7,"Hoshina");
pos+=7;
}
std::cout<<s<<std::endl;
}
return 0;... | 0 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int INFint = 2e9+1;
const ll INFll = 2e18+1;
ll MOD=1e9+7;
int H,W,T;
string s[10];
int main(){
int N,M;
cin>>N>>M;
vector<int> A(M);
for(int i(0);i<M;i++){
cin>>A[i];
}
sort(A.rbegin(),A.rend());
int num[10] = {0,2,5,5,4,5,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 3000000000000000000; //10^18
const int inINF = 1000000000; //10^9
const ll MOD = 1000000007; //10^9+7
const ll MOD2 = 998244353... | 0 |
#include<bits/stdc++.h>
using namespace std ;
int main() {
int N , M ;
cin >> N >> M ;
int max_L = 0 ;
int min_R = 5+ 10e5 ;
for(int i = 0 ; i < M ; i++ ){
int L , R ;
cin >> L >> R ;
max_L = max(max_L , L);
min_R = min(min_R , R);
}
min_R++ ;
if(min_R > max_L){
cout << mi... | #include <vector>
#include <iostream>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> L(M), R(M);
for(int i = 0; i < M; ++i) {
cin >> L[i] >> R[i];
}
vector<int> p(N + 1);
for(int i = 0; i < M; ++i) {
++p[L[i] - 1];
--p[R[i]];
}
int sum = 0, ans = 0;
for(int i = 0; i < N; ++i) {
... | 1 |
#include<bits/stdc++.h>
using namespace std;
main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long i,j,k,l,m,n,o,p,q;
while(cin>>m>>n>>o>>p)
{
if(m+n>o+p)
cout<<"Left"<<endl;
else if(m+n<o+p)
cout<<"Right"<<endl;
else
co... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c,d;
cin >> a >> b >> c >> d;
int L=a+b;
int R=c+d;
if(L>R){
cout << "Left" << endl;
}
if(L<R){
cout << "Right" << endl;
}
if(L==R){
cout << "Balanced" << endl;
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, y;
cin >> n >> y;
int ans10 = -1, ans5 = -1, ans1 = -1;
for(int i=0; i<=n; i++){
for(int j=0; j<=n-i; j++){
int total = 10000*i + 5000*j + 1000*(n-i-j);
if(total == y){
ans10 = i;
... | #include<iostream>
using namespace std;
int main() {
int n, Y, x = 0, y, z;
cin >> n >> Y;
bool can = false;
int t = Y / 1000 - n;
while (t >= 0) {
y = t / 4; // >= 0
z = n - x - y;
if (t % 4 == 0 && z >= 0) {
can = true;
break;
}
t -... | 1 |
//This Code was made by Chinese_zjc_.
#include <iostream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <bitset>
#include <cmath>
#include <queue>
#include <stack>
#include <string>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <map>
#include <set>
#include <ct... | #include <bits/stdc++.h>
using namespace std;
int main() {
string a,b;
cin>>a>>b;
cout<<b<<a;
} | 0 |
#include<cstdio>
#include<algorithm>
#define int long long
using namespace std;
int n,a[1100][1100];
int tot,p[110000]; bool vis[110000];
void init(){
vis[1]=true;
for (int i=2;i<=10000;i++){
if (!vis[i]) p[++tot]=i;
if (tot==1000) break;
for (int j=1;j<=tot&&(i*p[j]<=10000);j++){
vis[i*p[j]]=true;
if (i%... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <math.h>
using namespace std;
const int MAXN = 1e5 + 10;
int N;
int p[MAXN], pn;
bool np[MAXN];
inline void init(int n) {
register int i, j;
np[1] = 1; p[0] = p[n] = 1;
for(i = 2; i <= n; ++i) {
if(!np[i])
p[++pn] = i;
for... | 1 |
/*
Contest 104
B - AcCepted
Rakesh Kumar --> 27/09/2020
*/
#include <bits/stdc++.h>
bool check_lower(const std::string& s, std::size_t pos) {
for (std::size_t i = 1; i < s.size(); ++i) {
if (i != pos && !(s[i] >= 'a' && s[i] <= 'z'))
return false;
}
return true;
}
int main() {
... | //include
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <utility>
#include <functional>
#include <cstdlib>
//using
using namespace std;
using vl = vector <long long>;
using vs = vector <string>;
using vc = vector <char>;
usin... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define fsp(x) cout << fixed << setprecision(x)
const ll inf = LLONG_MAX;
const long double pi = M_PI;
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, H, W;
cin >> N >> H >> W;
int cnt = 0;
for (int i = H; i <= N; i++) {
for (int j = W; j <= N; j++) {
if (N >= i && N >= j) cnt++;
}
}
cout << cnt << endl;
} | 1 |
#include<bits/stdc++.h>
#define ll long long
#define rep(i, n) for(int i=0;i<(n);++i)
#define per(i, n) for(int i=(n)-1;i>=0;--i)
#define repa(i, n) for(int i=1;i<(n);++i)
#define foreach(i, n) for(auto &i:(n))
#define pii pair<int, int>
#define pll pair<long long, long long>
#define all(x) (x).begin(), (x).end()
#defi... | #include <bits/stdc++.h>
#define All(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
ll prim(int n, vector<vector<pll>> &edge)
{
priority_queue<pll, vector<pll>, greater<pll>> pq;
vector<bool> used(n, false);
// 点0からスタート
pq.push(pll(0, 0));
ll all_len = 0;
while (!p... | 1 |
#include<bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define io std::ios::sync_with_stdio(false)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pii;
const double pi=acos(-1);
const ll P = 998244353, INF = 0x3f3f3f3f;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll qpow(ll a,ll n)... | #include<iostream>
#include<algorithm>
using namespace std;
const int N = 100000;
int partition(int l, int r, int A[]) {
int i, j, x;
x = A[r];
i = l - 1;
for (j = l; j < r; j++) {
if (A[j] <= x) {
i++;
swap(A[i], A[j]);
}
}
swap(A[i+1], A[r]);
return i + 1;
} ... | 0 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int a,b,c,d;
cin>>a>>b>>c>>d;
int x=c-a,y=d-b;
for(int i=0;i<x;i++)cout<<'R';
for(int i=0;i<y;i++)cout<<'U';
for(int i=0;i<x;i++)cout<<'L';
for(int i=0;i<y;i++)cout<<'D';
cout<<'D';
for(int i=0;i<x+1;i++)cout<<'R';
for... | #include <bits/stdc++.h>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define dump_1(x1) cerr << #x1 << ": " << x1 << endl
#define dump_2(x1, x2) \
cerr << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define dump_3(x1, x2, x3) \
ce... | 1 |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
bool isprime(ll x){
for(int i=2;i*i<=x;i++){
if(x%i==0)return false;
}
return true;
}
int main()
{
vector<ll>common;
ll a,b;
cin>>a>>b;
set<ll>f,g;
bool ok=false;
while (a % 2 == 0)
{
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
ll gcd(ll x,ll y) {return y ? gcd(y,x%y) : x;}
ll lcm(ll x, ll y) {return x/gcd(x,y)*y;}
// 素因数分解 O(√n)
// たとえば 60 = 2^2 ... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main () {
int K, T;
cin >> K >> T;
int ma = 0;
for (int i = 0; i < T; i ++) {
int a;
cin >> a;
ma = max(ma, a);
}
int kj = K - ma;
cout << max(ma - kj - 1, 0) << endl;
} | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <stack>
#include <queue>
#include <functional>
#include <limits.h>
#include <set>
#include <map>
#include <tuple>
using namespace std;
#define ll long long
#define ull unsigned l... | 0 |
#include <cstdio>
#include <algorithm>
int N, M, g[15][15], f[32768][15];
int main()
{
scanf("%d%d", &N, &M);
for (int i = 0, u, v, w; i < M; i++)
{
scanf("%d%d%d", &u, &v, &w);
u--, v--;
g[u][v] = g[v][u] = w;
}
for (int i = 0; i < 1 << N; i++)
for (int j = 0; j < N; j++)
f[i][j] = 2000000000;
for (in... | #include<bits/stdc++.h>
#define int long long
using namespace std;
int n, q, a, b, l, val[800007][3], tag[800007];
int read()
{
int num = 0;
char c = getchar();
while (c<'0' || c>'9')c = getchar();
while (c >= '0' && c <= '9')num = num * 10 + c - '0', c = getchar();
return num;
}
int add(int w, int v)
{
for (int ... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1e9+7,INF=mod*mod*3;//M_PI
#define rep(i,N) for(ll i=0; i<(N); i++)
#define rep1(i,N) for(ll i=1; i<(N); i++)
#define f first
#define s second
#define pb push_back
#define mp make_pair
ll N;
ll p[200005];
ll ans;
i... | #include<cstdio>
#include<iostream>
#include<map>
#include<set>
#include<vector>
#include<cstring>
#include<cassert>
#include<sstream>
#include<cmath>
#include<algorithm>
#include<queue>
#include<limits>
#include<ctime>
#include<stack>
#include<bits/stdc++.h>
#include<string>
#include<stdlib.h>
#include<stdio.h>
typed... | 1 |
#include <iostream>
#include <stdio.h>
char judge(int, int, int);
int main()
{
int pm, pe, pj;
int number;
while (true) {
std::cin >> number;
if (number == 0) {
break;
}
for (int i = 0; i < number; i++) {
std::cin >> pm >> pe >> pj;
std::cout << judge(pm, pe, pj) <<std::endl;
}
}
retu... | #include <iostream>
#include <vector>
//#include <fstream>
using namespace std;
int main()
{
// cut here before submit
// freopen ("testcase.divstudent", "r", stdin );
const char rank[] = { 'A', 'B', 'C' };
int n;
while (cin >> n && n ){
vector <vector <int> > s(n, vector <int> (3, 0 ) );
for (int i = 0; i ... | 1 |
#include <bits/stdc++.h>
#define INF 1000000000
#define LINF 1000000000000000000
#define MOD 1000000007
#define mod 1000007
#define INF63 1061109567
#define INF127 9187201950435737471
#define UINF 18446744073709551615
#define F first
#define S second
#define ll long long
#define N 200010
using namespace std;
int n,a[N]... | #include<bits/stdc++.h>
#define N 105
using namespace std;
typedef pair<int,int> P;
int n,a,b,c,d,ans[N],cnt,prevx;
P x[N];
int main(){
cin>>n;
for(int i=0;i<n;i++)x[i].second=i+1;
for(int i=0;i<n*(n-1)/2;i++){
cin>>a>>b>>c>>d;
if(c==d)x[a-1].first++,x[b-1].first++;
else if(c<d)x[b-1].first+=3;
e... | 0 |
#include<stdio.h>
int main(){
char input1[102];
char input2[102];
scanf("%s %s", input1, input2);
printf("%s%s\n", input2, input1);
return 0;
} | #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 all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
... | 1 |
#include<bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
const int MAX_V=102;
int vote[MAX_V];
int main(){ _;
int n,q,m,tmp,result,resultCount;
while(cin>>n>>q,(n|q)!=0){
REP(i,MAX_V) vote[i]=0;
REP(i,n){
cin>>m;
... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
#define dump(x) cerr << #x << " = " << (x) << endl
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb push_back
int main(){
int n,m;
int cost[600][... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;cin>>S;int i;
for(i=1;i<S.size();i++)if(S.at(i-1)=='A'&&S.at(i)=='C')break;
if(i==S.size())cout<<"No"<<endl;
else cout<<"Yes"<<endl;
} | #include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
int main() {
int64_t n;
cin >> n;
vector<int64_t> ans;
for (auto i : irange(2L, 55556L)) {
if (i % 5 != 1) {
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) scanf("%d", &A[i]);
vector<vector<int>> accum(1<<20);
int now = 0;
vector<ll> zero(N+1, 0);
for (int i = 0; i < N; i++) {
now ^= A[... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 5000500;
const int mod = 1e9 + 7;
int a[maxn], pref[maxn], cntzer[maxn];
long long dp[maxn];
vector < int > v[maxn];
long long add(long long a, long long b){
a += b;
if(a >= mod) a -= mod;
return a;
}
long long mul(long long a, long long b){
... | 1 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ll n,i,j,sum=0,x,mn=INT_MAX;
cin>>n;
ll ar[n+1],cnt=0;
for(i=0;i<n;i++)
{
cin>>ar[i];
sum=sum+abs(ar[i]);
if(ar[i]<0)
{
cnt++;
x=abs(ar[i]);
if(x<mn)
mn=x;
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 25;
const int MOD = 1e9+7;
int a[int(1e5+10)];
ll dp[100010][2];
int main() {
int n;
cin >> n;
rep(i,n)... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define _for(i,j,N) for(int i = (j);i < (N);i++)
#define _rep(i,j,N) for(int i = (j);i <= (N);i++)
#define ALL(x) x.begin(),x.end()
int get_int(){int x;scanf("%d",&x);return x;}
typedef long long ll;
const int mod = 998244353;
inline int mul(int x,int y){return 1ll*x*y%... | #include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef priority_queue<int> PQ;
#define fore(i,a) fo... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double r, a;
cin >> r;
a = 2 * r * 3.1415;
cout << a << endl;
} | #include<bits/stdc++.h>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<algorithm>
using namespace std;
int main(){
int n;
while(scanf("%d",&n)!=EOF){
long ans=0;
//printf("%d\n",n);
for(int i=0;i<600;i+=n){
ans+=i*i*n;
}
printf("%l... | 0 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string a, b, c;
cin >> a >> b >> c;
if (a[a.length() - 1] == b[0] && b[b.length() - 1] == c[0])
cout << "YES";
else
cout << "NO";
} | #include<bits/stdc++.h>
using namespace std;
int main() {
bool A=0;
char ch,ch_;
cin>>ch;
ch_=ch;
while((cin>>ch)!=0) {
if(ch_=='A'&&ch=='C') {
cout<<"Yes";
return 0;
}
ch_=ch;
}
cout<<"No";
return 0;
} | 0 |
#include <bits/stdc++.h>
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define reprrev(i,a,b) for(int i=b-1;i>=a;i--) // [a, b)
#define reprev(i,n) reprrev(i,0,n)
#define _GLIBCXX_DEBUG
using ll = long long;
using ull = unsigned long long;
template<class T> inline bool chmax(T& a, T b)... | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int k, x;
cin >> k >> x;
for(int i = x - k + 1; i < x + k; i++) {
cout << i <<... | 1 |
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int N, x;
cin >> N >> x;
int a[N];
for(int i = 0; i < N; i++)
cin >> a[i];
sort(a, a + N);
int cnt = 0, i = 0;
while(x >= a[i] && i < N){
cnt++;
x -= a[i++];
}
if(i == N && x > 0)
... | #include <bits/stdc++.h>
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define pb push_back
#define all(v) v.begin(), v.end()
#define rip return;
#define fo(i,a,b) for(int i = a ; a < b ? i <= b : i >= b ; i += (a < b ? 1 : -1))
#define F first
#define S second
#define sz(x) int(x.size())
using nam... | 0 |
#include <iostream>
#include <string>
#include <math.h>
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int N,M;
cin>>N>>M;
int freq[N+1];
memset(freq,0,sizeof(freq));
int i,j,k;
b... | #include<bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 62)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64,i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
t... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool nul[200];
bool nul1[200];
int main() {
ios_base::sync_with_stdio(false);
cout.precision(15);
double pog =1/10e10;
int n;
cin>>n;
double x[200], y[200];
for(int i=0;i<n;i++){
cin>>x[i]>>y[i];
}
if(n==2){
cout<<"0.5"<<endl<<"0.5";
ret... | #include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<complex>
#define rep(i, a, n) for(int i=a;i<n;i++)
#define REP(i, n) rep(i, 0, n)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
#define R long double
#define P ... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s; cin >> s;
int ans = 2147483647;
for (int i = 0; i < s.size()-2; i++) {
string tmp = s.substr(i, 3);
ans = min(ans, abs(stoi(tmp) - 753));
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <stdio.h>
#include <string>
#include <algorithm>
#include <vector>
#include <math.h>
#include <numeric>
#include <queue>
#include <numeric>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <map>
#include <functional>
#include <limits>
#include <set>
#include <stack>
#include ... | 1 |
#include<iostream>
using namespace std;
int main(){
int n,p;
while(cin>>n>>p){
bool f=true;
int d[55]={};
int cn=p;
if(n==0)break;
while(f){
for(int i=0;i<n;i++){
if(cn>0){
d[i]++;
cn--;
}
else if(cn==0){
cn=d[i];
d[i]=0;
}
if(d[i]==p){
cout<<i<<endl;
f... | #include <iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
cout << a*b;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
//#define int long long
//signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
double r;
cin >> r;
cout << fixed << setprecision(10) << 2*M_PI*r << "\n";
return 0;
} | #include <iostream>
#include <math.h>
using namespace std;
void Solve(int a)
{
const double pi = 3.14;
float ans;
ans = 2 * pi * a;
cout << ans;
}
int main()
{
int x;
cin >> x;
Solve(x);
return 0;
} | 1 |
#include <stdio.h>
#include <string.h>
int main(){
char A[11], B[11], C[11];
scanf("%s %s %s", A, B, C);
int lenA=0, lenB=0, lenC=0;
lenA = strlen(A);
lenB = strlen(B);
lenC = strlen(C);
if(A[lenA-1] == B[0] && B[lenB-1] == C[0] ){
printf("YES");
} else {
printf("NO");
}
return 0;
} | #include <bits/stdc++.h>
#include <fstream>
using namespace std;
int n;
bool bad = false;
int check(vector<pair<int, int>> p){
sort(p.begin(), p.end());
int sum = 0;
for (int i = 0; i < n; i++) {
auto x = p[i];
int hituyo = x.first;
int yojo = x.second;
if (yojo >= 0) {
if (hituyo <= sum)... | 0 |
#include <bits/stdc++.h>
using namespace std;
struct base{
#define type long long
#define log 60
type d[log+1] = {};
bool insert(type x){
for(int i=log; ~i; i--) if((x>>i)&1){
if(!d[i]){
d[i] = x;
break;
}
x ^= d[i];
}
... | #include <bits/stdc++.h>
#define MIN_INT -2147483648
#define MAX_INT 2147483647
#define MIN_LONG -9223372036854775808L
#define MAX_LONG 9223372036854775807L
#define long long long int
using namespace std;
// @author: pashka
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<long> a(... | 1 |
#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<utility>
#include<set>
#include<complex>
#define vi vector<int>
#define vvi vector<vector<int> >
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>... | #include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#define ll long long
#define maxn 200010
inline ll read()
{
ll x=0; char c=getchar(),f=1;
for(;c<'0'||'9'<c;c=getchar())if(c=='-')f=-1;
for(;'0'<=c&&c<='9';c=getchar())x=x*10+c-'0';
return x*f;
}
inline void write(ll x)
{
stat... | 0 |
#include <iostream>
using namespace std;
int main(void){
int one;
int two;
int three;
cin>>one>>two>>three;
if(one==two){
if(one!=three||two!=three){
cout<<"Yes";
}
else{
cout<<"No";
}
}
else if(one ==three){
if(one!=two||three!=two){
cout<<"Yes";
}
else{
... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
using ll = long long;
using ull = unsigned long long;
using namespace std;
int main() {
string S;
cin >> S;
REP(i, S.size... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, x, y;
cin >> n >> m >> x >> y;
int xmax = x;
int ymin = y;
int a, b;
for (int i = 0; i < n; i++) {
cin >> a;
xmax = max(a, xmax);
}
for (int i = 0; i < m; i++) {
cin >> b;
ymin = min(b, ymin);
}
if (xmax < ymin) {
... | #include <bits/stdc++.h>
#define rep(i, f, n) for (ll i = (f); i < (ll)(n); i++)
#define repe(i, f, n) for (ll i = (f); i <= (ll)(n); i++)
using namespace std;
using ll = long long;
using pint = pair<int, int>;
bool is_war(const vector<int>& x, const vector<int>& y) {
return *max_element(x.begin(), x.end()) >= *min_... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int x, y;
cin >> x >> y;
int add = x + y;
int sub = x - y;
int into = x * y;
if (add >= sub && add >= into) {
cout << add << "\n";... | #include <bits/stdc++.h>
#include <set>
#include <numeric>
#define rep(i,n) for (int i=0; i < (n); ++i)
#define all(a) a.begin(), a.end()
using ll = long long;
using namespace std;
// ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
// const double PI = acos(-1);
// int gcd(int x, int y) { return (x % y)? gcd(y... | 1 |
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
using namespace std;
#define MAX_V 100000
int V, E;
vector<int> G[MAX_V];
bool visited[MAX_V];
int prenum[MAX_V];
int parent[MAX_V];
int lowest[MAX_V];
int timer, root;
void add_edge(int from, int to) {
G[from].push_back(to);
G[to].push_ba... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli, lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N;
string S; cin >> S;
int sumE = 0, sumW = 0, ans = N, leftE = 0, leftW = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'E') sumE++;
if (S.at(i) == 'W') sumW++;
}
for (int i = 0; i < N; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, k;
cin >> n >> k;
vector<int> l(n);
for (int i = 0; i < n; i++)
{
cin >> l[i];
}
sort(l.begin(), l.end());
reverse(l.begin(), l.end());
int total = 0;
for (int i = 0; i < k; i++)
{
total += l[i... | 0 |
#include <bits/stdc++.h>
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <cmath>
#include <iomanip>
#include <time.h>
#define dibs reserv... | #pragma region
#include "bits/stdc++.h"
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define _rep3(i, begin, end) for (register int i = (begin); i < (end); i++)
#define _irep3(i, begin, end) for (register int i = (end)-1; i >= (begin); i--)
#define _rep2(i, n) _re... | 1 |
#include <iostream>
#include <map>
#include <vector>
typedef long long ll;
using namespace std;
int main (int argc, char const* argv[]) {
int N, id, price, num;
const ll LIMIT = 1000000LL;
while (true) {
cin >> N;
if (N == 0) break;
map<int,pair<bool,ll> > dict;
vector<int> id_list;
for (int i... | #include <iostream>
using namespace std;
int order[4000];
bool search(int);
class Member {
public:
Member() {sum = 0;}
void add(long price, long num) {
sum += (long long int)price*num;
}
bool milion()
{
if (sum >= 1000000) return true;
else return false;
}
private:
long long int sum;
int id;
};
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define fcout(d) cout << fixed << setprecision(d)
#define rep(i,n) for(int (i) = 0; (i) < (n); ++(i))
#define rep1(i,n) for(int (i) = 1; (i) <= (n); ++(i))
#define repU(i,bottom,ceiling) for(auto (i) = (bottom); (i) <= (ceiling); ++(i))
#define repD(i,ceiling,bottom) for... | #include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;
#define chmin(a,b) a=min(a,b)
#define rep(i,x) for(ll i=0;i<(x);++i)
const ll linf = 3e18;
ll cost[100][100];
ll d[100];
bool used[100];
ll N, K;
void dijkstra(ll s)
{
fill_n(d, N, linf);
fill_n(used, N, false);
d[s] = ... | 0 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int scores[2] = {0, 0};
int points[2][10];
for (int i = 0; i < 2; ++i) {
for (int j = 0; j < 10; ++j) {
cin >> points[i][j];
}
sort(points[i], points[i]+10);
for (int j = 0; j < 3; ++j) {... | #include <iostream>
int main()
{
int a, b, c;
std::cin >> a >> b >> c;
if (a==b) {
if (a!=c) std::cout << "Yes" << std::endl;
else std::cout << "No" << std::endl;
}
else {
if (a==c || b==c) std::cout << "Yes" << std::endl;
else std::cout << "No" << std::endl;
}
return 0;
} | 0 |
#include <iostream>
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int d;
while(cin >> d){
int sum = 0;
for(int i = d; i < 600; i += d){
sum += d * i * i;
}
cout << sum << endl;
}
return 0;
} | #include<stdio.h>
main(){
int n;
int i,j;
scanf("%d",&n);
for(i=1;i<=n;i++){
if(i%3==0){
printf(" %d",i);
}else{
j = i;
while(j>0){
if(j%10==3){
printf(" %d",i);
break;
}
j /= 10;
}
}
}
printf("\n");
} | 0 |
#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
int n,sum=0,sumy=0;
while (1){
sum = 0;
sumy = 0;
cin >> n;
if (n == 0)break;
int ma[101][101] = { 0 };
for (int i = 0; i < n; i++){
sum = 0;
for (int i2 = 0; i2 < n; i2++){
cin >> ma[i][i2];
sum += ma[i][i2];
}
su... | #include <iostream>
using namespace std;
int main() {
int a,b,c;
while(1) {
cin >> a >> b >> c;
if(a == 0 && b == 0 && c == 0) break;
int n;
cin >> n;
int flg[301];
for(int i=0;i<301;i++) flg[i] = 2;
int d[1001],m[1001],k[1001],r;
for(int i=0;i<n;i++) {
cin >> d[i]>> m[i] >> k[... | 0 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string S;
cin>>S;
char check='a';
bool flag=0;
for(check='a';check<='z';check++){
flag=1;
for(size_t i=0;i<=S.length()-1;i++){
if(S[i]==check){
flag=0;
break;
}
}
if(flag==1){
... | /*
ID: anonymo14
TASK: wormhole
LANG: C++
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main(){
int N, K;
cin >> N >> K;
vector<int> D(10, 0);
for(int i=0; i<K; i++) {
int a;
cin >> a;
D[a] = 1;
}
for(int i=N; i<=100000; i++) {
int num = i;
... | #include<iostream>
#include<unordered_map>
#include<bitset>
#include<math.h>
#include<vector>
#include<set>
#include<algorithm>
#include<ctype.h>
#include<unordered_set>
#include<string>
#include<iomanip>
#include<queue>
#include<limits>
#include<map>
#include<stack>
#include<iterator>
#include<cstring>
#include<deque>... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
vector<vector<char>> s(H, vector<char>(W));
int memo = 0;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> s.at(i).at(j);
if (s.at(i).at(j) == '.') {
memo++;
}
}
}
vect... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) REP(i, 0, n)
using namespace std;
// info
int board[8][8];
int res[8];
void fillBoard(int row, int col, int cnt);
void printBoard();
void recur(int row);
int main()
{
fill(res, res+8, -1);
// rep(i, 8){
// fi... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
struct Graph{
Graph(int n):E(n),d(n){}
vector<vector<tuple<int,int,int>>>E;
vector<int>d;
void add_edge(int a,int b,int c,int d){
E[a].push_back(make_tuple(b,c,d));
}
void dijkstra(int s,int f){
priority_queue<P,vector<P>,greater<... | #include<iostream>
#include<queue>
#include<vector>
#include<limits>
using namespace std;
struct RequestObj {
int begin, end, type;
};
int n, m;//???,???????????°
int k;//????????¨????????°
int time_table[100][100];
int cheap_table[100][100];
RequestObj request[200];
const int INF = 10000000;
int main() {
while... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb push_back
#define all(x) (x).be... | #include <iostream>
#include <string>
#include <algorithm>
#include <cstring>
using namespace std;
void solve(string, string);
int main(){
string s, t;
cin >> s >> t;
solve(s, t);
return 0;
}
void solve(string s, string t){
int m=s.length(), n=t.length();
s = " "+s; t = " "+t;
int dp[m+1][n+1];
for... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long n,ans;
cin >> n;
ans=n/11*2;
n=n%11;
if(n>0) ans++;
if(n>6) ans++;
cout << ans << endl;
} | #include <iostream>
int main()
{
std::string s; std::cin >> s;
for (size_t i = 0; i < s.size() - 8; i++) {
std::cout << s[i];
}
std::cout << std::endl;
return 0;
}
| 0 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
vector<long long> divisor(long long n) {
vector<long long> ret;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) ret.push_back(n / i);
... | #include <iostream>
#include <algorithm>
#include <vector>
#include <array>
#include <iomanip>
#include <set>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define SORT(s) sort((s).begin(),(s)... | 0 |
// -*- mode:c++; coding:utf-8; c-basic-offset:2; -*-
// ALDS1_10_B: Matrix Chain Multiplication
#include <algorithm>
#include <climits>
#include <cstdio>
using uint = unsigned int;
static uint matrix_chain_multiplication(const uint p[], const uint n)
{
uint m[n][n];
for (auto i = 0u; i < n; ++i) m[i][i] = 0u;
... | #include <stdio.h>
int main() {
int n, i, j, k, l, p[101], m[101][101];
scanf("%d", &n);
for ( i = 1; i <= n; i++) {
scanf("%d", &p[i - 1]);
scanf("%d", &p[i]);
}
for ( i = 1; i <= n; i++) {
m[i][i] = 0;
}
for ( l = 2; l <= n; l++) {
for ( i = 1; i <= n - l + 1; i++) {
int j = i + l - 1;
m[i][... | 1 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int N,X,a=0;
cin>>N>>X;
int l[N];
for(int i=0;i<N;++i)cin>>l[i];
sort(l,l+N);
for(int i=0;i<N;++i){
X-=l[i];
if(X>=0)a++;
else break;
}
if(X>0)cout<<a-1;
else cout<<a;
}
| #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 62;
const int INF = 1e9 + 7;
... | 0 |
#include<bits/stdc++.h>
using namespace std;
void solveA()
{
long long a,b,tem;
cin>>a>>b;
tem=(a+b);
if(tem%2==0)
{
cout<<tem/2<<endl;
}
else
{
cout<<"IMPOSSIBLE"<<endl;
}
}
void solveB()
{
int n,i,j,count;
cin>>n;
int ar[n];
for(i=0;i<n;i++)
{
cin>>ar[i];
}
j=1;
count=0;
... | #include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;
int main()
{... | 0 |
#include <iostream>
#include <stdio.h>
#include <fstream>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <limits.h>
#include <math.h>
#include <functional>
#include <bitset>
#define repeat(i,n) for (long long i = 0; (i) < (n); ++ (i))
#... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
array<Int, 18> POW10;
int main()
{
POW10[0] = 1;
for (int i = 1; i < POW10.size(); i++) POW10[i] = POW10[i-1] * 10;
int D; cin >> D;
int digits = 0;
for (int val = 1; val <= D; val *= 10, digits++) {}
Int ans = 0;
for (int ... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,t;
cin>>n>>t;
vector<int>vec(n);
for(int i=0;i<n;i++)
cin>>vec[i];
int sum=0;
for(int i=0;i<n-1;i++)
sum+=min(t,vec[i+1]-vec[i]);
sum+=t;
cout<<sum<<endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
ll x, y;
cin >> x >> y;
if(x == y)cout << 0 << endl;
else if(x... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using stkll = vector<pll>;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (ll i = 0; i < (n); i++)
tem... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 10e17
#define rep(i,n) for(long long i=0; i<n; i++)
#define repr(i,n,m) for(long long i=m; i<n; i++)
#define mod 1000000007
#define sorti(x) sort(x.begin(), x.end())
#define sortd(x) sort(x.begin(), x.end(), std::greater<long long>())
#defi... | 0 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<int(n); i++)
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
vector<int> G[1048576];
int main(){
int N; cin >> N;
int A[N];
rep(i, N) cin >> A[i];
int rui[N];
rui[0] = A[0];
rep(i, N-1){
rui[i+1] = rui[i] ^ A[i+1];
}
int sum[N];
r... | //高知能系Vtuberの高井茅乃です。
//Twitter: https://twitter.com/takaichino
//YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INTINF 1999999999
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 10... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
cout<<n+(n*n)+(n*n*n)<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair <int, int>;
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define each(i, mp) for (auto &i : mp)
const int INF = 1001001001;
int main()
{
int a;
cin >> a;
ll ans =... | 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.at(i);
}
sort(A.begin(), A.end());
long long temp = 0, ans = 0;;
long long i = 0, num;
while(i < N){
temp = 0;
num = A.at(i);
... | #include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
#define MAX_N 100
#define MAX_EDGE_COST 20000
int Graph[MAX_N+1][MAX_N+1];
int n;
int prim(int initial_vertex) {
bool visited[n+1];
for(int i=1;i<=n;i++) visited[i] = false;
vector<int> vertexes;
... | 0 |
#include<bits/stdc++.h>
#define tmp(x) std::cout<<"& "<<(x)<<" &\n"
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define sz(x) ((int)x.size())
#define all(x) x.begin(),x.end()
typedef long long ll;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,char> Q;
ll N;
vector<Q> v;
vector<vector<P>> V,H;
set<P> S;
vector<vector<ll>> LU,LD,RU,RD;
int main(){
cin >> N;
V.resize(200010);
H.resize(200010);
LU.resize(400010);
LD.resize(400010);
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, e) for (int i = (int)(s); i <= (int)(e); i++)
#define printYesNo(is_ok) puts(is_ok ? "Yes" : "No");
#define SORT(v) sort(v.begin(), v.end());
#define RSORT(v) sort(v.rbegin(), v.rend());
#define REVERSE(... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
constexpr ll mod = ll(1e9 + 7);
int main () {
ios::sync_with_stdio(0); cin.tie(0);
int TT = 1;
// cin >> TT;
while (TT--) {
ll n,h,w;
cin >> n >> h >> w;
--h;
--w;
cout << max(ll(0), ((n-h)*(n-w))) << endl;
}
}
| 1 |
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <map>
#include <unordered_set>
#include <queue>
#include <set>
#include <iomanip>
#include <stack>
#define int long long
#define ld long double
#define dbg(x) cout <<#x<<":"<<x<<'\n';
#define dbg2(x,y) cout<<#x<<":"<<x<<' '<<#y<<":"... | #include <bits/stdc++.h>
using namespace std;
int main () {
ios_base::sync_with_stdio(false);
cin.tie(0);
int d, t, s; cin >> d >> t >> s;
cout << (t * s >= d ? "Yes" : "No") << endl;
return 0;
}
| 1 |
// clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
// #define main int main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecis... | #include "bits/stdc++.h"
#include <unordered_set>
#define REP(i, n) for(decltype(n) i = 0; i < (n); i++)
#define REP2(i, x, n) for(decltype(x) i = (x); i < (n); i++)
#define REP3(i, x, n) for(decltype(x) i = (x); i <= (n); i++)
#define RREP(i, n) for (decltype(n) i = (n) - 1; i >= 0; i--)
#define ALL(a) (a).begin(),(... | 0 |
#include <bits/stdc++.h>
using namespace std;
char s[100];
int main(){
scanf("%s", s+1);
if(strlen(s+1) == 3) reverse(s+1, s+1+strlen(s+1));
printf("%s", s+1);
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n+1); i++)
const long long INF = 1LL << 60;
int main(){
string S;
cin>>S;
int a=S.size();
if(a==2){
cout<<S<... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int N, M;
cin >> N >> M;
vector<int> L(M), R(M);
for (int i = 0; i < M; i++) {
cin >> L[i] >> R[i];
}
int lmax = *max_element(L.begin(), L.end());
int rmin = *min_element(R.begin(), R.end());
int d = rmin - lmax + ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long lli;
lli rec(int l, int r, vector<int> &A) {
if(r-l <= 1) return 0;
int m = (l+r)/2;
lli res = rec(l, m, A) + rec(m, r, A);
queue<int> a, b;
for(int i = l; i < m; ++i) a.push(A[i]);
for(int i = m; i < r; ++i) b.push(A[i]);
int k = l;
whil... | #include <stdio.h>
void merge(int *,int,int,int);
void mergesort(int*,int,int);
long long cnt=0;
int L[100002],R[100002];
int main(){
int A[200000],i,n;
scanf("%d",&n);
for(i=0;i<n;i++)scanf("%d",&A[i]);
mergesort(A,0,n);
printf("%ld\n",cnt);
return 0;
}
void merge(int *a,int left,int mid,int right){
int ... | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <functional>
#include <numeric>
#include <iomanip>
#define fi first
#define se second
#define fcout(n) cout<<fixed<<setprecision((n))
#... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define erep(i,a,b) for(int i=a;i<=(int)(b);++i)
#define per(i,a,b) for(int i=(b);i>(a);--i)
#define eper(i,a,b) for(int i=((int)(a));i>=b;--i)
#define pb push_back
#define mp make_pair
#define INF (1<<28)-1
#define MOD 1000000007
#define all(x) (x).beg... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define precise(n,k) fixed << setprecision(k) << n
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
const int M... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll dp[5009];
ll a[5000];
int main()
{
ll n;ll ans=0;
multiset<ll>s;cin>>n;
for(int i=0;i<n;i++){
ll x;cin>>x;
if(s.size()==0){
s.insert(x);
ans++;
}
else
{
auto z=s.... | 1 |
#include <iostream>
#include <string>
using namespace std;
int next_turn(char c) {
return int(c) - int('a');
}
int main()
{
string S[3];
cin >> S[0] >> S[1] >> S[2];
int pos[3] = {0};
int turn = 0;
for (;;) {
if (pos[turn] >= S[turn].length()) {
cout << char(int('A')+turn) << endl;
break;
... | #include <bits/stdc++.h>
using namespace std;
int main(){
vector<queue<char>> s(3);
for(int ix=0;ix<3;ix++){
string tmp;
cin >> tmp;
for(int ixx=0;ixx<tmp.size();ixx++) s.at(ix).push(tmp.at(ixx));
}
char card;
int turnplayer = 0;
while(!s.at(turnplayer).empty()){
... | 1 |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define MP make_pair
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define PLI pair<ll, int>
#define PIL pair<int, ll>
#define STR string
#define Fst first
#define Snd second
#define SHN 1e9
#define LSHN 1e18
using namespace std;
ll md=2... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
const ll MOD = 998244353;
const ll INF = 1e18;
using namespace std;
ll dp[1 << 20], pre[1 << 20];
main(){
#ifdef XOX
freopen("D:\\V S Code\\cpp\\competitiveProgramming\\Input.txt", "r", stdin);
freopen("D:\\V S Code\\cpp\... | 0 |
#include <bits/stdc++.h>
#include<unordered_map>
using namespace std;
using VS = vector<string>; using LL = long long;
using VI = vector<int>; using VVI = vector<VI>;
using PII = pair<int, int>; using PLL = pair<LL, LL>;
using VL = vector<LL>; using VVL = vector<VL>;
#define ALL(a) begin((a)),end((... | #include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#include <unistd.h>
#include <cassert>
#include <cctype>
#include <ra... | 1 |
#include<iostream>
#include<string>
using namespace std;
int main(){
int n, k[100], x, i, j;
string sta="abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ", s;
while(cin>>n, n){
for(i=0;i<n;i++) cin>>k[i];
cin>>s;
for(i=0;i<s.size();i++){
for(j=0;j<56;j++){
if(s[i]==sta[j]){
... | // King's Inspection
#include <iostream>
#include <cstring>
#include <vector>
#include <cstdio>
using namespace std;
int main() {
int n;
int now=0;
int k[102];
string station;
string ans;
string alpha = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ";
while(1) {
// Input... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, q, a, b;
scanf("%d%d%d%d", &n, &q, &a, &b);
a--, b--;
vector<int> x(q);
for (int i = 0; i < q; ++i) {
scanf("%d", &x[i]);
x[i]--;
}
constexpr int64_t kInf = 1'000'000'000'000'000'000;
vector<int64_t> dp(n... | #include<iostream>
#include<vector>
using namespace std;
using ll = long long;
int main(){
int n,k;
cin>>n>>k;
vector<int> x(n);
for(int i=0;i<n;i++) cin>>x[i];
ll ans=1e10;
for(int i=0;i+k<=n;i++){
ll l=abs(x[i])+abs(x[i+k-1]-x[i]);
ll r=abs(x[i+k-1])+abs(x[i+k-1]-x[i]);
... | 0 |
#include<stdio.h>
int main(){
int N;
long long int result = 0;
scanf("%d", &N);
for(int i = 1 ; i <= N ; i++){
if(i % 3!=0 && i % 5 !=0){
result += i;
}
}
if(result > 266666333332){
printf("266666333332");
}else{
printf("%lld", result);
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n;
cin >> n;
vector<ll> a(n);
ll minus=0;
bool allplus=false;
ll abs_tot=0;
ll abs_min = pow(10,9);
for(int i=0; i<n; i++){
cin >> a.at(i);
if(a.at(i)==0)allplus=true;
if(a.at(i)<0)... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int p, q, r; cin >> p >> q >> r;
int m = max(p, max(q, r));
int ans = p + q + r - m;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
//#define LOCAL
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define endl '\n'
#define forn(i,a,b) for(ll i=a;i<b;i++)
#define ft first
#define sd second
#define sz size()
#define pb push_back
#define pob pop_back()
#define pf push_front
#define pof pop_front()
#defin... | 1 |
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define r... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define int long long
int hmt() {int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';if(n) x=-x;return x;}
#define in hmt()
#define ins ({string x;char c=getchar(... | 0 |
#include <bits/stdc++.h>
#include <iostream>
#include <ctime>
using namespace std;
#define _LL long long
#define rep(i, n) for (_LL i = 0; i < (_LL)(n); i++)
#define vecrep(itr, v) for (auto itr = (v).begin(); itr != (v).end(); itr++)
#define SEARCHED_NODE 2
#define START_NODE 1
#define ROUTE_NODE 1
#define INIT_NODE ... | #include <stdio.h>
#include <algorithm>
#include <tuple>
#include <vector>
#include <queue>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int n, m;
vector<int> e[1010];
int v[1010], last[1010];
vector<int> r(2000, 0);
void bfs(int node) {
queue<int> q;
for (int x : e[node])
q.emplace(x), ... | 1 |
#include<iostream>
#include<stdio.h>
#include<string>
#include<math.h>
#include<iomanip>
#include<algorithm>
#include<string.h>
#include<cctype>
#include<map>
#include<set>
#include<vector>
#include<sstream>
#include<stack>
#include<queue>
#include<deque>
#include<functional>
#include<utility>
using... | #include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int n,m;
for(;;){
scanf("%d%d",&n,&m);
if(n==0&&m==0)break;
vector<int> ns(n+1);
for(int i=0;i<n;i++){
scanf("%d",&ns[i]);
}
ns[n]=0;
vector<int> ntwos;
... | 0 |
#define _CRT_SECURE_NO_WARNINGS
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define all(c) begin(c), end(c)
#define range(i,a,b) for(int i = a; i < (int)(b); i++)
#define rep(i,b) range(i,0,b)
#define eb emplace_back
typedef long long ll;
auto const inf = numeric_limits<ll>::max()/4;
using ... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,x) for(int i = 0;i < x;++i)
#define FOR(i,x,y) for(int i = x;i < y;++i)
#define ALL(a) a.begin(),a.end()
using ll = long long;
int v,e,r;
struct edge
{
int to,cost;
};
vector<edge>graph[114514];
using P = pair<int,int>;
const int INF = 1234567890;
int d... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef int64_t Int;
#define all(x) (x).begin(), (x).end()
const double EPS = 1e-10;
const Int INF = 1e18;
const int inf = 1e9;
const Int mod = 1e9+7;
bool print_space_enable = false;
void print() {
cout << '\n';
print_space_enable = false;
}
template <class ... | #include <bits/stdc++.h>
using namespace std;
template<typename T>
struct Dijkstra {
explicit Dijkstra(size_t size) : size(size), G(size) {}
struct edge {
edge(int to, T cost) : to(to), cost(cost) {}
int to;
T cost;
};
using P = pair<T, int>;
const T inf = numeric_limits... | 0 |
#include <iostream>
#include <stdio.h>
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <algorithm>
#include <set>
#include <math.h>
#include <utility>
#include <stack>
#include <string.h>
using namespace std;
typedef pair<int,int> P;
const int INF = ~(1<<31) / 2;
int c[1... | #include <iostream>
#define MX 1000000000
using namespace std;
int M[100][100],N; //M[i][j]:i©çjÜÅÌRXg
int dijkstra(int s , int g){
bool visited[100];
int d[100];
for(int i=0;i < N;i++) d[i] = MX , visited[i] = false;
d[s] = 0;
while(1){
int u;
int mincost = MX;
for(int i=0;i<N;i++)... | 0 |
#include <iostream>
#include <fstream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <cstdlib>
#include <cstdio>
#include <string>
#include <cstring>
#include <cassert>
#include <utility>
#include <iomanip>
#include <chrono>
#include <ra... | #include <bits/stdc++.h>
using namespace std;
multiset<int> se;
int main()
{
// freopen("powers.in", "r", stdin);
// freopen("powers.out", "w", stdout);
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
int x;
scanf("%d", &x);
se.insert(x);
}
int answer = 0;... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
// template {{{ 0
// using {{{ 1
using ll = long long int;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<pii>;
using vll = vector<pll>;
// }}} 1
// definition {{{ 1
// scanin... | /*** author: yuji9511 ***/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1... | 1 |
#include <iostream>
#include <map>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <math.h>
#include <string>
#include <set>
#include <queue>
#include <utility>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0... | #include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <cstring>
using namespace std;
typedef long long ll;
const ll maxn = 1e6+10;
const ll inf = 1e16;
int N,K;
int main(){
// freopen("in.txt", "r", stdin);
cin>>N>>K;
cout<<N-K+1<<endl;
return ... | 0 |
#include <bits/stdc++.h>
//#include "atcoder/all"
typedef long long int ll;
using namespace std;
// using namespace atcoder;
#define MAXN 300001
#define mod 1000000007
ll a[MAXN];
int main() {
int n;
cin >> n;
ll co[60];
for (int i = 0; i < 60; i++) co[i] = 0;
for (int i = 1; i <= n; i++) {
... | #include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;
const int N = 5050;
const ll INF = 0x3f3f3f3f;
ll dp[N][N];
int n, w[N], h[N], a[N], ans;
bool cmp(int A,int B){
return w[A] + h[A] < w[B] + h[B];
}
int main(){
scanf("%d", &n);
for(int i = 0;i<n;i++){
scanf("%d%... | 0 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include<numeric>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespa... | #include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cassert>
#define ll long long
using namespace std;
inline ll read(){
ll re=0,flag=1;char ch=getchar();
while(ch>'9'||ch<'0'){
if(ch=='-') flag=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9') re=(re<<1)+(re<<3)+ch-'0',... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef vector<ld> vd;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
typedef vector<pair<ll, ll>> vpll;
typedef priority_queue<ll, vector<ll... | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
const i64 MOD = 1e9 + 7;
struct LowLink{
vector<vector<int>>& edges;
// 関節点
vector<int> art;
vector<pair<int,int>> bridge;
vector<int> used, ord, low;
int k;
void dfs(int idx, int par){
ord[idx] = k++;
... | 1 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = int64_t;
#define rep(i, j, n) for (int i = j; i < (int)n; ++i)
constexpr ll MOD = 1000000007;
int main() {
ll n;
cin >> n;
ll a;
vector<ll> one(60);
rep(i, 0, n) {
cin >> a;
rep(j, 0, 60) if (a >> j & 1) one[... | #include <iostream>
#include<time.h>
#include<string>
#include<cstring>
#include <cstdio>
#include<utility>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<bitset>
#include<queue>
#include<stack>
#include<set>
#include <limits>
#include <climits>
#include <numeric>
#include<cassert>
#include... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cstring>
#include <sstream>
#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <stack>
#include <list>
#include <numeric>
#include <bitset>
#include <ext/algorithm>
#include <ext/numeric>
#define ffor(_a,_f,_t) ... | #include<set>
#include<map>
#include<stack>
#include<ctime>
#include<cstdio>
#include<queue>
#include<cmath>
#include<vector>
#include<cstring>
#include<climits>
#include<iostream>
#include<algorithm>
using namespace std;
#define LL long long
int read(){
int f=1,x=0;char c=... | 1 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size()... | #include <bits/stdc++.h>
using namespace std;
typedef long long lol;
//マクロ
//forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
//Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i,n) for(lol i=0;i<lol(n);i++)
#define REPD(i,n) for(lol i=n-1;i>=0;i--)
#define FOR(i,a,b) for(lol i=a;i<=lol(b);i+... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.