code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include<bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x...) do{cout << "\033[32;1m" << #x << "->" ; err(x);} while(0)
void err(){cout << "\033[39;0m" << endl;}
template<template<typename...> class T,typename t,typename... A>
void err(T<t> a,A... x){for (auto v:a) cout << v << ' '; err(x...);}
te... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
string s;
cin >> n >> s;
int a[100009];
for(int b: {0, 1}){
for(int c: {0, 1}){
a[1] = b;
a[2] = c;
a[0] = (s[1]=='o'?1:0)^b^c;
for(int i=3;i<n;i++){
a[i] = (s[i-1]=='o'?1:0)^a[i-1]^a[i-2];
}
if(... | 1 |
//by rng_59
#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <memory.h>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdli... | #include "bits/stdc++.h"
#define REP(i,num) for(int i=0;i<(num);++i)
#define LOOP(i) while(i--)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl ;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
#define rep(i,N) for(int i=0; i < (int)N; i++)
#define all(v) (v).begin(),(v).end()
#define chor(x,y) x = (x||y);
const int INF = 1001001001;
int mai... | #include <cassert>
#include <cctype>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#include <queue>
#include <set>
#include <bitset>
#include <unordered_set>
#include <algorithm>
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long ll;
using namespace... | 1 |
//32
#include<iostream>
#include<algorithm>
#include<numeric>
#include<functional>
using namespace std;
int main(){
int p[2][10];
for(int i=0;i<2;i++){
for(int j=0;j<10;j++){
cin>>p[i][j];
}
}
for(int i=0;i<2;i++){
sort(p[i],p[i+1],greater<int>());
cout<<accumulate(p[i],p[i]+3,0)<<((i==0... | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <sstream>
#include <functional>
#include <numeric>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <queue>
#include <stack>
#include <set>
using namespace std;
#define ALL(co) co.begin(), co.end()
#defi... | 1 |
#include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <func... | #include <iostream>
#include <string>
using namespace std;
int main()
{
string stro, str;
while(getline(cin, stro)){
for(int i = 0; i < 26; i++){
str = stro;
for(int j = 0; j < stro.length(); j++){
if(str[j] >= 'a' && str[j] <= 'z')
if(str[j] + i > 'z')
str[j] += i - 26;
else
str[... | 1 |
#include <bits/stdc++.h>
using namespace std;
bool isOK(vector<int> v) {
for (int i = 0; i < 8; i++) {
for (int j = i + 1; j < 8; j++) {
if (abs(v[j] - v[i]) == j - i) {
return false;
}
}
}
return true;
}
int main()
{
int k;
cin >> k;
vector<int> x(k), y(k);
for (int i = 0; i < k; i++) {
cin >>... | #include <bits/stdc++.h>
#define FOR(i,a,b) for(int i= (a); i<(b); i++)
#define REP(i,n) for(int i=0;i < (n);i++)
#define ALL(obj) (obj).begin(), (obj).end()
using namespace std;
const long long INF = 1LL << 60;
const int MOD = (int)1e9 + 7;
typedef long long ll;
//約数列挙
vector<long long> divisor(long long n) {
vec... | 1 |
//ヘッダー
#include<bits/stdc++.h>
using namespace std;
//型定義
typedef long long ll;
//定数
const int INF=1e+9;
const int MOD=1e+9+7;
//REPマクロ
#define REP(i,n) for(int i=0;i<(ll)(n);i++)
#define REPD(i,n) for(int i=n-1;i>=0;i--)
#define REP2(i,a,b) for(int i=a;i<(ll)(b);i++)
#define REPD2(i,a,b) for(int i=a;i>(ll)(b);i--)
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n, k; cin >> n >> k;
vector<double> p(200000);
for(int i=0; i<n; i++) cin >> p[i];
vector<int> sigma(1000);
sigma[0] = 1;
for(int i=1; i<1000; i++){
sigma[i] = sigma[i-1]+(i+1);
}
for(int i=0; i<n; i++){
p[i] ... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define fo(i,a,b) for (int i=a;i<=b;i++)
#define fd(i,a,b) for (int i=a;i>=b;i--)
#define fi first
#define se second
#define mkp make_pair
typedef long long ll;
const int N=1100000;
int n,ans,flag,s[N],t[N],pos[N],a[N],b[N];
int read()
{
int ret=0,sig=1;
char c;
wh... | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
#define N 110
#define INF 0x3f3f3f3f
using namespace std;
typedef struct {
int w;
int s;
int e;
}Edge;
Edge edge[N*N];
int m[N][N];
int father[N];
int n;
int k = 0; //edge的下标
int result = 0;
int findfather(i... | 0 |
/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
*/
#include <bits/stdc++.h>
#define LL long long
#define ll long long
#define SL(n) scanf("%lld",&n)
#define LF double
#define SF(n) scanf("%lf",&n)
#define pb push_... | #include<iostream>
#include<vector>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
using ll = long long;
using P = pair<int, int>;
#include<algorithm>
#include<math.h>
#include<map>
#include<queue>
#include<set>
const int mod = 2019;
const int INF = 1e16;
int main() {
ll l, r;
cin >>l >>r;
ll ans(INF)... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
constexpr ll mod = 1e9+7;
int main(){
ll N;
cin >> N;
vector<ll> A(N), num(N+1, 0);
rep(i, 0, N) cin >> A[i];
ll ans = 1;
num[0] = 3;
rep(i, 0, N)... | #include <bits/stdc++.h>
typedef long long ll;
#define pb push_back
using namespace std;
ll n;
ll a[350];
ll dp[350][302*302 + 2];
ll dp1[350][302*302];
const ll mod = 998244353;
ll ME(ll x,ll nn,ll M)
{
ll result=1;
while(nn>0)
{
if(nn % 2 ==1)
result=(result * x)%M;
x=(x*x)%... | 0 |
#include <bits/stdc++.h>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
int main()
{
int n, m, x, y;
cin >> n >> m >> x >> y;
int mx = -101;
int my = 101;
rep(i, n... | #include <iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstring>
#include<map>
#include<set>
//#include<bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define I(a) scanf("%d",&a)
#define I2(a,b) scanf("%d%d",&a,&b)
#define I... | 1 |
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
struct edge{
int to;
int cap;
int rev;
};
struct Dinic{
int V;
vector<int> level, used;
vector<vector<edge>> G;
Dinic(int N){
V = N;
used.resize(V, 0);
level.resize(V, -1);
G.resize(V)... | #include<bits/stdc++.h>
using namespace std;
using P=pair<int,int>;
int main(void){
int n;
cin>>n;
vector<P> red,blue;
for(int i=0;i<n;i++){
int a,b;
cin>>a>>b;
red.push_back({a,b});
}
for(int i=0;i<n;i++){
int c,d;
cin>>c>>d;
blue.push_back({c,d});
}
sort(blue.begin(),blue.end()... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define FORD(i,a,b) for(int i=a;i>=b;i--)
#define REP(i,n) FOR(i,0,n)
#define pb push_back
#define en "\n"
#define ITER(i,a) for( typeof(a.begin()) i=a.begin();i!=a.end();i++)
#define mod 1000000007
#define mpp make_pair
#define mes(a... | #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 ... | 1 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0... | #define LOCAL
#undef _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false);cin.tie(0)
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define LLINF 1e18
#define INF (int)1e9+1
// Copied from Gennady-Korotkevich's template
template <typename A, typ... | 0 |
#include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
static char buf[IN_BUF], *ps = buf, *pt = buf;
if... | #include<bits/stdc++.h>
using namespace std;
int main(void){
long long A,B,K;
cin>>A>>B>>K;
for(int i=0;i<K;i++){
if(i%2==0){
if(A%2!=0){
A-=1;
}
B+=A/2;
A/=2;
}else{
if(B%2!=0){
B-=1;
}
A+=B/2;
B/=2;
... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int x,y,i,j,n;
deque<int >v;
cin >> n;
for(i = 0 ;i<n ;i++)
{
cin >> x;
deque<int >:: iterator it;
it = upper_bound(v.begin(),v.end(),x);
if(v.begin()== it)
v.push_front(x);
else... | #include <algorithm>
// #include <cstdlib>
#include <cstring>
#include <cstdio>
#include <string>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#include <bitset>
using namespace std;
typedef long long LL;
typedef double db;
const int oo=2139063143;
const int N=610;
const int P=1000000007;
const db eps... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll=long long;
int main(){
int n,h,w;
cin>>n>>h>>w;
cout<<max(0,(n-h+1)*(n-w+1))<<endl;
return 0;
} | // https://atcoder.jp/contests/ddcc2020-qual/tasks/ddcc2020_qual_a
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin()... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define RI register int
int read() {
int q=0;char ch=' ';
while(ch<'0'||ch>'9') ch=getchar();
while(ch>='0'&&ch<='9') q=q*10+ch-'0',ch=getchar();
return q;
}
const int N=100005;
int n,a[4][N],b[N],ans[2];
void NO() {puts("No");exit(0);}
int main()
{
n=read();
for(RI i=... | #include<bits/stdc++.h>
using namespace std;
int n, x[1<<18], y[1<<18];
char d[1<<18];
void Rotate(){
for(int i = 1; i <= n; i++){
int cx = y[i],cy = 200000-x[i],cz;
if(d[i] == 'U') cz = 'R';
if(d[i] == 'R') cz = 'D';
if(d[i] == 'D') cz = 'L';
if(d[i] == 'L') cz = 'U';
x[i] = cx; y[i] = cy; ... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define ld long double
#define ff first
#... | #include <iostream>
using namespace std;
void ask(int left, int right, bool male) {
int mid = (left + right) / 2;
cout << mid << endl;
string s;
cin >> s;
if (s == "Vacant") return;
if (((mid - left) % 2 == 0) == (male == (s == "Male"))) ask(left, mid - 1, male);
else ask(mid + 1, right, s == "Male");
}
int ma... | 0 |
#include<bits/stdc++.h>
using namespace std;
queue<char>a,b,c;
int main(){
string al , bo ,chr ;
cin >> al ;
cin >> bo ;
cin >> chr ;
for(int i=0;i<al.size();i++){
a.push(al[i]);
}
for(int i=0;i<bo.size();i++){
b.push(bo[i]);
}
for(int i=0;i<chr.size();i++){
c.push(chr[i]);
}
char curr = a.front(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
string s[3];
rep(i, 3) cin >> s[i];
int t = 0;
vector<int> idx(3);
while (true) {
if (s[t].size() == idx[t]) {
cout << char('A' + t) << endl;
... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
vector<ll> num(1010,0);
vector<bool> prime(1010,true);//iが素数ならtrue(エラトステネスの篩)
void isprime(){
prime[0]=false;
prime[1]=false;
for(ll i=2;i*i<=1010;i++){
if(!prime[i]){continue;}
for(ll j=i*i;j<=1010;j+... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define pb push_back
using namespace std;
typedef long long ll;
const double pi=3.14159265;
int main(){
int n;
cin>>n;
if(n==0){
cout<<0<<endl;
return 0;
}
string s;
int p=n;
int q;
while(p!=1){
q=abs(p%(-2));
if(p<0) p... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
string a,b,c;
cin >> a >> b >> c;
int n=a.size();
int m=b.size();
int l=c.size();
if(a[n-1]==b[0] && b[m... | #include<stdio.h>
int d,t,s;
int main()
{
scanf("%d %d %d", &d, &t, &s);
d=d+s-1;
if(t>=(d/s))printf("Yes");
else printf("No");
} | 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll,ll>
#define left 2*node+1
#define right left+1
#define mid (s+e>>1)
const ll N=5e5+5;
vector<ll> T[4*N];
void build(ll A[], ll node, ll s, ll e){
if(s==e){
T[node].push_back(A[s]);
return;
}
build(A, left, s, mid);
build(... | #include<cmath>
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
stack<int> st;
queue<int> qu;
queue<pair<int,int> > qu2;
priority_queue<int> pq;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define rep2(i,n) for(int i=1; i<=(int)(n); i++)
#define mins(x,y) x=min(x,y)
#define maxs(x,y) x=max(x,y)
#... | 1 |
#include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i,a,b) for(int64_t i=(a);i<(b);++i) // a ≦ i < b
#define Rrep(i,a,b) for(int64_t i=(a);i>=(b);--i) // reverse repeat. a から b まで減少．
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend() //逆イテレータ
#define... | #pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <bitset>
using namespace std;
typedef ... | 0 |
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
ll modpow(ll x, ll n){
ll res = 1;
ll mul = x;
while(n){
if(n % 2) res = res * mul % MOD;
mul = mul * mul % MOD;
n /= 2;
}
return res;
}
struct Combination
{
int... | #include <bits/stdc++.h>
using namespace std;
const int N=2e5+5,MOD=1e9+7;
long long fac[N],infac[N];
long long poww(long long x,long long y)
{
if(y==0) return 1;
if(y&1) return (x*poww(x,y-1))%MOD;
return poww((x*x)%MOD,y/2);
}
long long nck(int n,int k)
{
return (((fac[n]*infac[k])%MOD)*infac[n-k])%MOD;
}
l... | 0 |
#include <iostream>
#include <vector>
#include <map>
#include <cmath>
using namespace std;
const long long MAX = 10000000;
const long long MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (long long i =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int s,t;
cin>>s>>t;
cout<<2*t-s<<endl;
} | 0 |
#include<algorithm>
#include<iostream>
#include<string>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
int main(){
int i,j;
int a[100][100],b[100],c[100],m,n;
int mn;
while(cin>>n>>m&&n+m){
for(i=0;i<n;i++)
for(j=0;j<n;j++)
a[i][j]=200000000;
for(i=0;i<m;i++){
int ... | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int cost[101][101];
int d[101];
bool used[101]={};
int n,k;
#define INF 10000000
int V;
void dijkstra(int s){
fill(d,d+101,INF);
fill(used,used+101,false);
d[s]=0;
while(1){
int c=-1;
for(int u=0;u<V;u++){
if(!used[u] && (c==-1 ||... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define maxn 1005
int n;
char ans[maxn][maxn];
char s3[5][5] = {"aa.", "..b", "..b"};
char s4[5][5] = {"aabd", "ccbd", "deff", "degg"};
char s5[6][6] = {"aaeff", "b.e.g", "b.jjg", ".ccih", "dd.ih"};
char s6[8][8] = {"aabcc.", "b.b..d", "baa..d", "cc.a... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T>
ostream& operator<<(ostream &os, vector<T> &v){
string sep = " ";
if(v.size()) os << v[0];
for(int i=1; i<v.size(); i++) os << sep << v[i];
return os;
}
template<typename T>
istream& operator>>(istream &is, vector<T> &v){
for... | 1 |
#include<iostream>
int n,m[3],i;main(){for(std::cin>>n;i<n;)std::cin>>m[i++];for(i=0;i++<*m;)*m%i+m[1]%i+m[2]%i||std::cout<<i<<"\n";} | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <bitset>
#include <set>
#include <stack>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define RREP(i,n) for... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
map<int64_t,int64_t>M;
for(int i=0;i<N;i++){
int64_t a; cin>>a;a*=-1;
if(M.count(a))
M.at(a)++;
else
M[a]=1;
}int64_t ans=0;
for(auto p:M){
auto k=p.first;
auto v=p.second;
k*=-1;int64_t a=1;
for(i... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m); i<(int)(n); i++)
#define RREP(i,m,n) for(int i=(int)((n)-1); i>=m; i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define fi first
#define se seco... | 1 |
#include<iostream>
#include<string>
using namespace std;
int main(){
char x[200];
char Roma[7]={'I','V','X','L','C','D','M'};
int Arabia[7]={1,5,10,50,100,500,1000};
int a=0,b,ans=0,ls;
string s;
while(cin>>s){
ans=0;
a=0;
ls=s.size();
for(int i=ls-1;i>-1;i--){
for(int j=0;j<7;j++){
if(s[i]==Roma[j])b=Arabia[j];}
if(b... | #include<bits/stdc++.h>
using namespace std;
#define ft ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
string s,p;
int main()
{
ft
ll t,i,j,n,m=0,l,r;
cin>>s;
n=s.size();
for(i=0;i<n;i++)
{
if((i+1)<n && s[i]==s[i+1])
{
cout<<(i+1)<<" "<... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using lint=long long;
template<class G>
class Fenwick_tree{
vector<G> a;
public:
Fenwick_tree(){}
Fenwick_tree(int n){ build(n); }
Fenwick_tree(const vector<G>& a){ build(a); }
void build(int n){
a.assign(n,G{});
}
void bu... | #include <bits/stdc++.h>
#include <atcoder/fenwicktree>
using namespace std;
using namespace atcoder;
int main(){
int N, Q;
cin >> N >> Q;
fenwick_tree<long long> a(N);
for (int i = 0; i < N; i++){
int x;
cin >> x;
a.add(i, x);
}
for (int i = 0; i < Q; i++){
int t;
cin >> t;
if (t ==... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
int main() {
int n, m;
std::cin >> n >> m;
while (n != 0 && m != 0) {
int whole_price = 0;
std::vector<int> vegi(n);
for (auto &v : vegi) std::cin >> v;
std::sort(vegi.begin(), vegi.end());
for (auto i = 1; i <= n; ++i) {
whole_price += (i % m =... | #include <iostream>
#include <algorithm>
using namespace std;
const int N_MAX = 1000;
int n, m;
int p[N_MAX];
int main () {
while (cin >> n >> m, n || m) {
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
sum += p[i];
}
sort(p, p + n, greater<int>());
for (int i = m - 1; i < n; i += m) {
s... | 1 |
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <limits>
#include <random>
#include <complex>... | #include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <string>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <set>
#include <climits>
using namespace std;
using ll = long long int;
using dd = long double;
const ll MOD = 1e9 + 7;
const dd PI = 3.1415926535;
class UnionFind {... | 1 |
#include<bits/stdc++.h>
using namespace std;
long long dp[2][3003];
int main()
{
long long n,m,a,b,c,d,e,f,g,h,p,q,r,fr,sc,tr,sz,tz,i,j,k,mx=LLONG_MIN,mn=LLONG_MAX;
long long x=0,y=0,cnt=0,res=0,ttl=0,ans=0,sum=0; long long flg=0,flag=1,na=0,as=1;
vector<long long>u,v,w; vector< pair<long lon... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define REP(i,n) for(int _n=n, i=0;i<_n;++i)
#define FOR(i,a,b) for(int i=(a),_b=(b);i<=_b;++i)
#define FORD(i,a,b) for(int i=(a),_b=(b);i>=_b;--i)
using ull = uint64_t;
using ll = in... | 1 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <stack>
#include <set>
#include <cmath>
#include <algorithm>
using namespace std;
void b_sort(int* a , int n, int* count){
for(int i=n;i>=0;--i){
for(int j=0;j<i-1;++j){
if(a[j]>a[j+1]){
swap(a[j],a[j+1]);
(*count)++;
... | #include <iostream>
#include <algorithm>
using namespace std;
int N;
int A[100];
void disp(void)
{
for (int i=0; i<N; ++i) {
cout << A[i];
if (i != (N-1)) {
cout << " ";
} else {
cout << "\n";
}
}
}
int main(void)
{
cin >> N;
for (int i=0; i<N; ++i) {
cin >> A[i];
}
int co... | 1 |
#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>;
string alp = "zabcdefghijklmnopqrstuvwxy";
int main()
{
ll n;
cin >> n;
string ans;
while (n > 0) {
int amari = n % 26;
ans += alp[amari];
... | #include<stdio.h>
int main(){
long long input;
scanf("%lld",&input);
int i = 0;
char ans[100];
while(input > 0){
int temp = input % 26;
if(temp == 0){
ans[i++] = 'z';
input = (input/26) - 1;
}
else{
ans[i++] = (temp - 1) + 'a';
... | 1 |
#include "bits/stdc++.h"
#define ll long long
#define lld long double
#define MOD 998244353
#define inf 1000000000000000000ll
#define pii pair<int,int>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL)... | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vi;
#define forn(i, n) for (int (i) = 0; (i) ... | 0 |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
//FILE *fi = freopen("1.txt", "r", stdin);
//FILE *fo = freopen("1", "w", stdout);
//FILE *fi = freopen("P.inp", "r", stdin);
//FILE *fo = freopen("P.out", "w", stdout);
int n, Q;
int c[500001];
typedef pair<int, int> ii;
vector<ii> q[500001];
int bit[50... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
#define MAX 500005
//#define INF 1001001001
template <typename T>
struct RMQ {
const T INF = numeric_limits<T>::max();
int n;
vector<T> dat, lazy... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using ll = long long;
const int INF = 2147483647;
// const ll INF = 1000000000000000000LL;
int main() {
string s;
cin >> s;
int w;
cin >> w;
rep(i,s.size()){
cout << s[i];
i+=w-1;
}
cout << endl;
return 0;
}
| #include <iostream>
#include <cstdio>
using namespace std;
string s;
int w;
int main() {
cin >> s >> w;
for(int i=0; s[i]; i++) {
if(i%w==0) putchar(s[i]);
}
return 0;
} | 1 |
#include<iostream>
#include<algorithm>
using namespace std;
int a[210] = { 0 }, n;
int main() {
cin >> n;
int len = 2 * n, ans = 0;
for (int i = 0; i < len; i++) cin >> a[i];
sort(a, a + len);
for (int i = 0; i < len; i += 2) ans += a[i];
cout << ans << endl;
return 0;
} | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int n;
cin>>n;
vector<int>v;
int answer=0;
for(int i = 0 ; i< 2*n ;i++){
int k;
cin>>k;
v.push_back(k);
}
sort(v.begin(),v.end());
for(int i = 0 ; i < 2*n ; i+=2){
answer+=min(v.at(i),v.at(i+1));
... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
// #define MOD 998244353
#define MEM_SIZE 100010
#define DEBUG_OUT true
#define ALL(x) (x... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; retur... | 1 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main () {
// input
string str;
cin >> str;
int q;
cin >> q;
string result = str;
int res_len = result.length();
for (int i=0; i<q; i++) {
string order;
int a, b;
cin >> order >... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
string str1,str2,p;
char x;
int q,a,b;
getline(cin, str1);
cin >> q;
for (int i = 0; i < q; i++){
cin >> str2;
if (str2 == "replace"){
//replace?????????
cin >> a >> b >> p;
for (int j = 0; j < p.length... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
string ans;
if(n < 1200) ans = "ABC";
else if(n < 2800) ans = "ARC";
else ans = "AGC";
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
const int N = 2e5+5 ;
//😁😁😁😁😁😁😁😁😁😁😁
void Never_give_up()
{
int k; cin>>k;
string s; cin>>s;
if(s.size()<=k) cout<<s;
else
{
for(int i=0;i<k;++i) cout... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define INF 2e9
... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
typedef long long ll;
vector<int> vec(4);
string judge(int su, int num, string op) {
if (num == 4) {
if (su == 7 - vec[0]) {
return op;
}
else return "";
}
if (judge(su + vec[num], num + 1, op + "+") !... | 1 |
#include <iostream>
#include <string>
using namespace std;
int main( void )
{
string s;
while( 1 ){
getline( cin, s );
if( cin.eof() ) break;
while( 1 ){
for( int i=0; i<s.size(); i++ ){
if( s[i] == 'z' ) s[i] = 'a';
else if( 'a' <= s[i] && s[i] < 'z' ) s[i]++;
}
if( s.... |
#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>
using namespace std;
int main()
{
string a,b;
while(getline(cin,a))... | 1 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main(){
string s;
cin>>s;
unordered_map<char,int>mp;
unordered_map<char,vector<pair<int,int>>>store;
int n=s.size();
int st,ed,flag=0;
for(int i=0;i<n;i++){
mp[s[i]]++;
store[s[i]].push_back({i,mp[s[i]]});
}
for(auto x:store){
... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 100010;
int64_t al[MAXN][26];
int main()
{
string S;
cin >> S;
for (int i = 1; i < S.size(); i++)
{
if (S[i - 1] == S[i])
{
cout << i << ' ' << i + 1 << endl;
return 0;
}
if (i != 1 && S[i - 2] == S[i])
{
cout ... | 1 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
int now = 1;
for (int i = 1; i < n; i++) {
if (i * i > n) {
break;
}
now = i * i;
}
cout << now << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
void solve()
{
string s;
cin >> s;
int k = s.size();
while (s[k - 1] != 'F')
k--;
cout << s.substr(0, k - 1) << endl;
}
int main()
{
solve();
return 0;
}
| 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
int a,b; cin >> a >> b;
int ans = -INF;
ans = max(ans,a+b);
ans = max(ans,a-b);
ans = max(ans,a*b);
cout <... | #include<iostream>
#include<math.h>
#include<algorithm>
#include<stdint.h>
#include<vector>
#include<deque>
#include<stack>
#include<string>
#include<cstring>
#include<time.h>
#include<array>
#include<iomanip>
#include<list>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<random>
#include<bitset>... | 0 |
#include<bits/stdc++.h>
using namespace std;
const int N = 1003;
int n, m, dis[N], par[N];
vector<int> adj[N], ans;
int main(int argc, char const *argv[])
{
scanf("%d %d\n", &n, &m);
for (int i = 0; i < m; ++i)
{
int u, v;
scanf("%d %d\n", &u, &v);
adj[u].push_back(v);
}
for (int s = 1; s <= n; ++s)
{
que... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, m, a[300][300], c[300], ans;
bool removed[300];
int main() {
cin >> n >> m;
ans = n;
for (int i = 0; i < n; ++i)
for (int j = 0; j < m; ++j) {
cin >> a[i][j];
--a[i][j];
}
for (int i = 0; i < m; ++i) { //iコ除外
fill(c, c + m, 0)... | 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>;
const long long INF = 1ll << 60;
int main() {
int A, B, M; cin >> A >> B >> M;
vector<int> a(A);
vector<int> b(B);
int minA = 100001;
int minB = 100001;
rep... | #include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<pi> vpi;
typedef vector<vi> vii;
typedef map<int, int> mp;
typedef multiset<int> mset;
typedef long int int32;
typedef unsigned long int uint32;
typedef long long int int64;
typedef ... | 0 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <numeric>
#include <string>
#include <string.h>
#include <map>
#include <set>
#include <functional>
#include <complex>
using namespace std;
const int INF = (1<<30) - 1;
int main(){
//ios::sync_with_stdio(fals... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> duo;
#define TT template<typename T>
TT T sq(T x){ return x*x; }
TT int ubnd(vector<T>& v,T x){ return upper_bound(v.begin(), v.end(), x) - v.begin(); }
TT int lbnd(vector<T>& v,T x){ return lower_bound(v.begin(), v.end()... | 1 |
#include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
static char buf[IN_BUF], *ps = buf, *pt = buf;
if... | #include <bits/stdc++.h>
using namespace std;
int main(){
//入力
int A,B,M; cin>>A>>B>>M;
vector<int> a(A); for(int i=0;i<A;i++) cin>>a.at(i);
vector<int> b(B); for(int i=0;i<B;i++) cin>>b.at(i);
//まずは(冷蔵庫の最安値)+(レンジの最安値を求める)
int mina=100000,minb=100000;//まずはどちらも絶対にどのai,biよりも高くなるように設定する
for(int i=0;i<A... | 1 |
#include <bits/stdc++.h>
#define ri register
#define int long long
#define E (n+1)
using namespace std; const int N=200010;
inline int read()
{
int s=0, w=1; ri char ch=getchar();
while(ch<'0'||ch>'9') { if(ch=='-') w=-1; ch=getchar(); }
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48), ch=getchar();
ret... | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
for (int i = a; i <= b; i++) {
string s = to_string(i);
if (s[0] == s[4] && s[1] == s[3]) {
ans++;
}
}
cout << ans << endl;
return 0;
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
// memo fixed setprecision(20);
using vvll = vector<vector<ll>>;
ll mod =1e9+7;
/*"itob" int to "N"base */ template<typename TypeInt> string itob(const TypeInt v, int base){static const char table[] = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ";s... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void){
int a, b;
cin>>a>>b;
int ans=a*b;
cout<<ans<<endl;
} | 1 |
#include <bits/stdc++.h>
#include <iostream>
#include<math.h>
using namespace std;
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; }
int main()
{
int N;
cin >> N;... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pi pair<int,int>
#define ff first
#define ss second
#define boost ios::sync_with_stdio(false);cin.tie(nullptr)
#define endl "\n"
#include "string"
int maxSubSetXor(int *a,int n) {
int ans = 0;
int id = 0;
for(int i = 61; i >= 0; i--) {
in... | 0 |
#include<iostream>
#include<stdio.h>
#include<string>
#include<vector>
#include<queue>
#include <cmath>
#include<algorithm>
#include<stack>
#include<map>
#include<ctime>
#define rep(i,n) for (int i=0;i<n;i++)
//#include <bits/stdc++.h>
using namespace std;
int main(){
int H,W,N,ans=0;
cin>>H>>W>>N;
if (H>W... | #include <bits/stdc++.h>
using namespace std;
bool f(int a, int b, int c) {
return ( a == b && a != c ?
true : false);
}
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (f(a, b, c) || f(c, a, b) || f(b, c, a) ?
"Yes" : "No");
}
| 0 |
#include<bits/stdc++.h>
using namespace std;
string t;
string ans;
void dfs(int i,string s,int n);
void solve();
int main(void){
cin >> t;
solve();
return 0;
}
void dfs(int i, string s, int n){
if(i==3){
if(n==7){
ans=s+"=7";
}
return ;
}... | #include <iostream>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <functional> // std::function<void(int)>
using n... | 0 |
#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 repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(n);i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define Eunique(v) v.erase... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n, m; cin >> n >> m;
vector<ll> p(n, 0);
ll xmin = 1, xmax = n;
for(ll i=0; i<m; ++i){
ll l, r; cin >> l >> r;
xmin = max(xmin, l);
xmax = min(xmax, r);
}
ll res = max((ll)0, xmax-xmin+1);... | 0 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
using namespace std;
using ll = long long;
using P = pair<in... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main () {
ll x; cin >> x; ll ans = (x / 11) * 2, b = x % 11;
if (b > 6) ans += 2;
else if (b > 0) ans++;
cout << ans << endl;
} | 0 |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ull unsigned long long
#define poly vector<ll>
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
#define For(i,l,r) for(int i=(int)(l);i<=(int)(r);i++)
#define Rep(i,r,l)... | 0 |
//
// main.cpp
// usaco
//
// Created by 김현수 on 2020/08/30.
// Copyright © 2020 김현수. All rights reserved.
//
#include <iostream>
#include <algorithm>
#include <string>
int main()
{
int a, b, c, d, e, k;
scanf("%d %d %d %d %d %d", &a, &b, &c, &d, &e, &k);
if(e-a<=k)
{
printf("Yay!");
}
... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n';
int main()
{
int a, b, c;
cin >> a >> b >> c;
cout << c << " " << a << " " << b << endl;
}
| 0 |
#include<iostream>
using namespace std;
int InsertionSort(int* a, int n, int g)
{
int tmp, j, count = 0;
for (int i = g; i < n; i++)
{
tmp = a[i];
for (j = i - g; j >= 0 && a[j] > tmp; j -= g)
{
a[j + g] = a[j];
count++;
}
a[j + g] = tmp;
}
return count;
}
int ShellSort(int* a, int n)
{
int m,... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
namespace util {
template<typename T >
void print_vector(vector<T> &v) {
for (auto it = v.begin(); it != v.end(); it++) {
cout << *it;
if (it + 1 != v.end())
cout << " ";
}
... | 1 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000000LL;
#define all(x) (x).begin(),(x).end()
vector<... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define all(x) (x).begin(),(x).end()
#define V vector
typedef V<int> vi;
typedef V<vi> vvi;
typedef long long ll;
typedef pair<int, int> P;
constexpr auto INF = INT_MAX/2;
constexpr auto LINF ... | 1 |
//
// main.c
// ITP1_6_A
//
// Created by ??±??°?????? on 2015/10/11.
// Copyright ?? 2015??´ HamadaShogo. All rights reserved.
//
#include <stdio.h>
void reverseNum(int *num, int size);
int main(int argc, const char * argv[]) {
int size;
int num[100];
int i;
scanf("%d", &size);
for (i=0... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> a(n);
for (auto &x : a) cin >> x;
reverse(a.begin(), a.end());
for (int i = 0; i < n; i++) cout << a[i] << (i == n - 1 ? '\n' : ' ');
}
| 1 |
#include<bits/stdc++.h>
#define rep(i,f,n) for(ll i=(f); (i) < (n); i++)
#define repe(i,f,n) for(ll i=(f); (i) <= (n); i++)
using namespace std;
using ll = long long;
template<class T> inline bool chmax(T& a, T b){if (a < b) { a = b; return true; } return false;}
template<class T> inline bool chmin(T& a, T b){if (a > b... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,s,e) for((i)=(s);(i)<(int)(e);(i)++)
#define REP(i,e) FOR(i,0,e)
#define all(o) (o).begin(), (o).end()
#define psb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
typedef long long ll;
typedef pair<int, int> PII;
const double EPS = 1e-10;
const int IN... | 0 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<iomanip>
#define pi 3.14159265358979323846
#define ll long long
#define rep(i, a, n) for(int i = a; i < n; i++)
using namespace std;
int main(){
int n, sm = 0;
cin >> n;
if(n >= 500){
sm += n / 500 * 1000;
n = ... | #include <iostream>
int main()
{
int d;
while (std::cin >> d) {
int n = 0, s = 0;
while (n < 600) {
s += n * n * d;
n += d;
}
std::cout << s << std::endl;
}
return 0;
} | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(){
int N, M;
cin >> N;
string s[N];
rep(i,N) cin >> s[i];
cin >> M;
string t[M];
rep(i,M) cin >> t[i];
sort(s,s+N);
int ans = 0;
int u = 1;
string c = s[0];
for (int i=1; i<N; i++){
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string s;
map<string, int> S;
for (int i=0; i<N; i++) {
cin >> s;
if (S.count(s)) S.at(s) += 1;
else S[s] = 1;
}
int M;
cin >> M;
for (int i=0; i<M; i++) {
cin >> s;
if (S.count(s)) S.at(s) -= 1;
... | 1 |
#include<bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define rep(i,begin,end) for(__typeof(end)i=(begin)-((begin)>(end));i!=(end)-((begin)>(end));i+=1-2*((begin)>(end)))
#define F first
#define S second
#define sz(x) ((int)x.size())
#define... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
int b;
int c;
bool poor = false;
cin >> a;
cin >> b;
cin >> c;
if (a == b == c) {
poor = false;
} else {
if (a == b && a != c) {
poor = true;
} else {
if (a == c && a != b) {
poor = true;
} else {
if (b == c ... | 1 |
#include<bits/stdc++.h>
using namespace std;
bool g[101][101];
int main(){
int m,n;
cin>>m>>n;
cout<<"100 100"<<endl;
for(int i=0;i<50;i++)
for(int j=0;j<100;j++)
g[i][j]=1;
m--;
for(int i=0;i<50;i+=2)
for(int j=0;j<100;j+=2){
if(m==0)
break;
g[i][j]=0;
m--;
}
n--;
for(int i=99;i>=50;i-=2)
for(int ... | /**
* created: 28.06.2020 02:21:50
**/
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pcnt(bit) __builtin_popcountll(bit)
using namespace... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
//---------------------------------------------------------------------------------------------------
ll MOD = 998244353;
ll f[101010], rf[101010];
ll inv(ll x) {
ll res = 1;
ll k = MOD - 2;
ll y = x;
while (k) {
if (k & 1) res ... | ////sfef
#include<stdio.h>
int main(){
int k,x,i,p,q,r;
scanf("%d %d",&k,&x);
p=(x-(k-1));
q=(x+(k-2));
r=(x+(k-1));
if(k==1)
{
printf("%d",x);
}
else{
for(i=p;i<=q;i++)
{
printf("%d ",i);
}
printf("%d",r);
}
return 0;
}
| 0 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int MOD=(int)1e9+7;
const int INF=(int)1e9;
const ll LINF=(ll)1e18;
struct Combination{
vector<ll> fac,finv,inv;
Combination(int mx){init(mx);}
void init(int mx){
fac.resize(mx+1);
finv.resize(mx+1);
inv.resize(m... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
#define poly vector<ll>
#define For(i,l,r) for(int i=(int)(l);i<=(int)(r);i++)
#define Rep(i,r,l) for(int i=(int)(r... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fr first
#define sc second
typedef vector<int> Vi;
typedef pair<int,int> Pii;
typedef pair<int,Pii> Pip;
const int INF = (1<<30);
const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
int main(){
int n;
int p[100] = {0};
int rank[100] = {0};
cin ... | 0 |
#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 n;
cin >> n;
long long ans = 0;
for(int i = 1; i <= n; i++) {
if(i % 3 ... | #include <iostream>
#include <string>
using namespace std;
int main()
{
long long N;
cin >> N;
long long c = N*(N+1)/2;
long long j = N / 3;
long long k = N / 5;
long long l = N / 15;
c = c - 3*j*(j+1)/2 - 5*k*(k+1)/2 + 15*l*(l+1)/2;
cout << c;
}
| 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
using ll = long long;
int main(void){
int A,B;
cin>>A>>B;
if(A<9&&B<9){
cout<<"Yay!"<<endl;
}
else{
cout<<":("<<endl;
}
} | //#include "stdafx.h"
#include<bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int a,b,ans,q;
int main()
{
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>a>>b;
q=abs(a-b);
ans=16-(a+b);
if(q>ans/2)
cout<<":(\n";
else
cout<<"Yay!\n";
return 0;
}
| 1 |
#include <utility>
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <queue>
#include <climits>
using namespace std;
typedef pair<int,int> p;
int d[100003];
vector<p>edge[100002];
int main()
{
priority_queue<p,vector<p>,greater<p> > que;
int v,e,r;
int s,t,d0;
cin>>v>... | #include<stdio.h>
#include<string.h>
#include<math.h>
#include<vector>
using namespace std;
struct graph{
int h[360010],nex[27000010],to[27000010],col[360010],M;
bool v[360010];
graph(){
M=0;
memset(h,0,sizeof(h));
memset(v,0,sizeof(v));
memset(col,0,sizeof(col));
}
void ins(int a,int b){
M++;
to[M]=b;... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
bool flag = (s.size()%2 == 0);
while(s.size()>0 && flag){
if(s.substr(0,2) == "hi"){
s = s.substr(2,s.size()-2);
}
else flag = 0;
}
cout << (flag?"Yes":"No") << endl;
} | #include <bits/stdc++.h>
int main()
{std::string S, t; std::cin >> S;
int i{5}; while(i--) {t += "hi"; if (t == S) {puts("Yes"); return 0;}}
puts("No");} | 1 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<numeric>
#include<algorithm>
#include<bitset>
#include<complex>
#include<stack>
using name... | #include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <string>
#include <algorithm>
using namespace std;
int main (int argc, char *argv[]) {
string str;
int ans = 0;
int n1, n2, n3;
cin>>str;
for (int i = 0; i < str.length(); ++i) {
... | 1 |
#include<iostream>
#include<math.h>
#include<algorithm>
#include<stdio.h>
#include<string.h>
using namespace std;
typedef long long ll;
int main()
{
long long a,b=0;
cin>>a;
for(int i=1;i<=a;i++)
{
if(i%3==0||i%5==0);
else b=b+i;
}
cout<<b;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 1000000000;
constexpr ll INF= 1e18;
constexpr ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<int,int> P;
template<typename T>
T Pow(T a,T b) {
T ret = 1;
for(int i = 0;i < b;i++) {
ret *= a;
... | 0 |
#include "bits/stdc++.h"
using namespace std;
int main() {
long long N, M, bx, x, by, y, XCount = 0, YCount = 0;
const long long MOD = 1e9 + 7;
cin >> N >> M >> bx;
for (int i = 1; i < N; i++) {
cin >> x;
XCount += i * (N - i) * (x - bx);
XCount = XCount % MOD;
bx = x;
}
cin >> by;
for (int i = 1; i < M;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<long long,long long> pll;
#define ep emplace_back
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);++i)
constexpr int mod=1000000007;
constexpr int mod1=998244353;
vector<int> dx={0,1,... | 1 |
#include<iostream>
using namespace std;
int main(){
int a,b=0;
cin>>a;
if(a%3==0 && a>0){
b=(a/3)+b;
}
else if(a%3==1 && a>1){
a-=4;
b++;
b=(a/3)+b;
}
else if(a%3==2 && a>2){
a-=5;
b++;
b=(a/3)+b;
}
else{
system("pause");
}
cout<<b;
} | #include <iostream>
#include <bits/c++io.h>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <vector>
using namespace std;
int main()
{
int x;
cin>>x;
cout<<x/3<<endl;
}
| 1 |
#include <algorithm>
#include <iostream>
#include <string>
#include <random>
#include <cassert>
#include <cstring>
#include <chrono>
using namespace std;
typedef long long ll;
int main()
{
int n;
cin >> n;
vector<pair<ll, ll>> p(n);
for (int i = 0; i < n; ++i) {
ll a, b;
cin >> a >> b;
p[i] = {a,... |
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
typedef unsigned long long ULLONG;
typedef long long LLONG;
static const LLONG MOD_NUM = 1000000007;
template<class _... | 1 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int n,k;
... | #include <bits/stdc++.h>
#define mp make_pair
using namespace std;
typedef int32_t i32;
typedef uint32_t u32;
typedef int64_t i64;
typedef uint64_t u64;
typedef pair<int,int> pii;
typedef pair<i64,int> pli;
typedef pair<int,i64> pil;
typedef pair<i64,i64> pll;
typedef vector<int> vi;
typedef vector<i64> vl;
templat... | 0 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
cout << min(A, B) + min(C, D) << endl;
} | #include <bits/stdc++.h>
const int N = 100054;
int n, K, ans;
int p[N], fc[N], nc[N], f[N];
inline void up(int &x, const int y) {x < y ? x = y : 0;}
inline void link(int x, int px) {nc[x] = fc[px], fc[px] = x;}
void dfs(int x, int dep = 0) {
for (int y = fc[x]; y; y = nc[y]) dfs(y, dep + 1), up(f[x], f[y] + 1);
i... | 0 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string s;
cin >> s;
if(s == "SUN"){
cout << "7\n";
return 0;
}
if(s == "MON"){
cout << "6\n";
return 0;
}
if(s == "TUE"){
cout << "5\n";
return 0;
}
if(s == "WED"){
cout << "4\n";
return 0;
}
if(s ... | #include<iostream>
using namespace std;
class dice {
private:
int n[7];
public:
dice(int, int, int, int, int, int);
int getcur() { return n[1]; }
void rotate(char);
};
dice::dice(int n1, int n2, int n3, int n4, int n5, int n6) {
n[1] = n1;
n[2] = n2;
n[3] = n3;
n[4] = n4;
n[5] = n5;
n[6] = n6;
}
void dice... | 0 |
#include <iostream>
#include <deque>
#include <utility>
#include <algorithm>
#include <map>
#include <vector>
#define llint long long
#define mod 998244353
#define inf 1e18
using namespace std;
typedef pair<llint, llint> P;
typedef pair<llint, P> E;
struct SegTree{
int size;
vector<P> seg;
SegTree(){}
SegTree(i... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N,T;
cin >> N >> T;
vector<int> time(N);
for(int i = 0; i < N; i++){
cin >> time.at(i);
}
long long ans, sum = T;
for(int i = 0; i < N-1; i++){
ans = min(T,time.at(i+1)-time.at(i));
sum += ans;
}
cout << sum << endl;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
short N;
ll ans = 0;
string L, R, b, r;
map<pair<string, string>, int> M;
void aff(vector<bool>&vec, short i) {
if (i == N) {
for (short j = 0;j < N;j++) {
if (vec[j])b.push_back(L[j]);
else r.push_back(L[j]);
}
b +... | #include "bits/stdc++.h"
using namespace std;
//template <typename... T> void read(T& ... t){ ((cin >> t), ...); }
//template <typename... T> void write(T ... t){ ((cout << t), ...); }
//#define int long long
#define FAST ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define size(x) (int)x.size()
#define all(x) x.begi... | 0 |
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = (n-1); i >= 0; i--)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL<<62;
const int IINF = 1000000000;
template<class T> inline bool chmax(T& a, T b) { if (a ... | #include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include <climits>
#include <assert.h>
#include <cstring>
#include <set>
using namespace std;
typedef long long ll;
int arr[200001];
int main()
{
int N;
cin >> N;
int temp;
int i;
int ... | 0 |
#include<iostream>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
if (a > 8 || b > 8) cout << ":(";
else cout << "Yay!";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
string S;
int W;
cin >> S >> W;
for(int i=0;i<S.size();i+=W){
cout << S.at(i);
}
cout << endl;
} | 0 |
#include<iostream>
#define INF 2 << 23
using namespace std;
int main(){
int n,m;
while(cin >> n >> m){
if(n==0&&m==0) break;
int cost[m+1][m+1];
int time[m+1][m+1];
for(int i=0;i<=m;i++)
for(int j=0;j<=m;j++){
if(i==j)
cost[i][j] = time[i][j] = 0;
else
cost... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n); (i)++)
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
#define rev(i, n) for(int (i)=(n)-1; (i)>=0; ... | 0 |
#include <bits/stdc++.h>
#define simplify ios_base::sync_with_stdio(0);cin.tie(0);
#define int long long
#define endl "\n"
using namespace std;
const int mod=998244353;
const int N=2e5+5;
int fact[N];
int invFact[N];
int inverseMod(int x,int mod);
void precompute(){
fact[0]=fact[1]=1;
for(int i=2;i<N;i++){
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (ll i=0;i<(n);i++)
typedef long long ll;
ll modpow(ll a, ll n, ll mod){
ll res=1;
while(n>0){
if(n&1) res = res*a%mod;
a=a*a%mod;
n>>=1;
}
return res;
}
ll modinv(ll a, ll mod){
return modpow(a, mod-2, mod)... | 1 |
#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() {
ll N, x;
cin >> N >> x;
vector<ll> a(N);
rep(i,N) cin >> a.at(i);
ll ans = 0;
rep(i,N) {
if (i == 0) continue;
if(a.at(i) + a... | #include<iostream>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
int main(){
int n,x,a;
while(~scanf("%d%d%d",&n,&x,&a)){
ll ans=0;
if(a>x)
ans+=a-x,a=x;
... | 1 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<stack>
#include<cstring>
#include<utility>
#include<cmath>
#include<assert.h>
#include<set>
#include<map>
#define int long long
using namespace std;
#define rep(i, n) for(int i=0;i<(n);++i)
typedef pair<int, int> pii;
const int INF = 1l <... | #include<cstdio>
#include<iostream>
#include<queue>
#include<algorithm>
#define INF 1<<30-1
using namespace std;
int n;
int c[101][101];
int t[101][101];
int flg;
int washa(int st,int en,int va){
if(flg==1){
for(int k=1;k<=n;k++){
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(c[i][j]>c[i][k]+c[k][... | 0 |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool... | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int f(int x,int y){
if(y<10)return x*10+y;
return x*100+y;
}
int main(){
while(1){
int n,k,c[100],ans=1;
vector<int> sum;
scanf("%d%d",&n,&k);
if(n==0&&k==0)break;
for(int i=0;i<n;i++)scanf("%d",&c[i]);
int a=0;
for(int i=0;i<n;i++)... | 0 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#define inf 0x3f3f3f3f
#define MOD 1000000007
using namespace std;
typedef long long ll;
template <typename Tp> inline void getint(Tp &num){
register int ch, neg = 0;
while(!isdigit(ch = getchar())) if(c... | #include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long LL;
typedef pair<LL,LL> P;
const LL mod=1000000007;
const LL LINF=1LL<<60;
const int IN... | 1 |
#include <bits/stdc++.h>
using namespace std;
int p[1000005];
int getSum(int* BIT,int idx){
int sum=0;
while(idx>0){
sum+=BIT[idx];
idx-=(idx&-idx);
}
return sum;
}
void update(int* BIT,int N,int idx,int val){
while(idx<=N){
BIT[idx]+=val;
idx+=(idx&-idx);
}
return;
}
int main() {
memset(p,0,sizeo... | #include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#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 F... | 0 |
#include <bits/stdc++.h>
using namespace std;
int N, M;
vector<vector<int>> G;
vector<int> indeg; // 入次数
vector<bool> visited;
vector<int> ans; // トポロジカルソートの結果
void bfs(int s) {
queue<int> q;
q.push(s);
visited.at(s) = true;
while (!q.empty()) {
int cur = q.front();
q.pop();
for (int nx : G.at(c... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
void... | 1 |
#include<stdio.h>
int num[4];
int main()
{
int n,d1,d2;
scanf("%d%d%d",&n,&d1,&d2);
int num1=0,num2=0;
while((d1&1)==0)
{
num1++;
d1>>=1;
}
while((d2&1)==0)
{
num2++;
d2>>=1;
}
for(int i=0;i<(n<<1);i++)
{
for(int j=0;j<(n<<1);j++)
{
int tp1,tp2;
if(num1&1)
{
tp1=((i>>(num1>>1))&1);
... | #include <bits/stdc++.h>
#define reg register
#define pr std::pair<int, int>
#define fi first
#define se second
#define FIN(s) freopen(s, "r", stdin)
#define FOUT(s) freopen(s, "w", stdout)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define rep(i, l, r) for (int i = l; i <= r; ++i)
#define lep(i, l, r) for (int i... | 1 |
#include <bits/stdc++.h>
using i64 = long long;
int main() {
int n, m;
scanf("%d%d", &n, &m);
std::vector<std::tuple<int, int, int>> es;
std::vector<std::pair<int, int>> w;
for (int i = 0; i < m; i++) {
int p, q, c;
scanf("%d%d%d", &p, &q, &c);
--p; --q;
es.emplace_b... | #include<iostream>
#include<map>
#include<string>
#include<vector>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<queue>
using namespace std;
long long int inf = 10000000000;
int dx[4] = {0,0,1,-1};
int dy[4] = {1,-1,0,0};
int main(){
long long int n, m;
cin >> n >> m;
vector< vector<long long ... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef map<ll,ll>::iterator itll;
typedef long double ld;
typedef map<ll,ll> mapll;
#define con continue
#define pb push_back
#define fi first
#define se second
#define fr front()
#define INF 1000000000000000000
#define all(vl)... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define PI 3.... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.