code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <iostream>
#include <cmath>
using namespace std;
int digsum(long int a,long int b){
int suma=0;
int sumb=0;
int max;
while(a>0){
suma += 1;
a /= 10;
}
while(b>0){
sumb += 1;
b /= 10;
}
if(suma>=sumb){
max = suma;
}
else{
ma... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
using ll = long long;
int main() {
ll n; cin >> n;
ll i = 0;
ll ans = 1e10;
while (i*i < n) {
i++;
ll cost = 1e10;;
if (n % i == 0) {
string a = to_string(i);
string b = to_string(n/i);
if ... | 1 | 65,795,274 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
long long count=0;
cin >> N;
vector<int>vec(N);
for(int i=0;i<N;i++){
cin >> vec.at(i);
}
for(int i=0;i<N;i++){
if(i==N-1){
count+= vec.at(i)/2;
}
else if(vec.at(i)%2==1){
count += vec.at(i)/2;
if(vec.at(i+... | #include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
#include <cassert>
#include <stack>
#include <queue>
#include <deque>
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
#define sz(a) (int)a.size(... | 1 | 96,553,141 |
#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define Rep(i, a, b) for(int i = a; i <= b; i++)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
#define P pair<ll, ll>
using ll = long long;
#define ALL(v) (v).begin(),(v).end()
#define endl ... | #include <bits/stdc++.h>
#include <cmath>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 1e15;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define r... | 1 | 39,949,691 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int H,W,K;
cin >> H >> W >> K;
vector<string> A(H);
for (int i = 0; i < A.size(); i++){
cin >> A[i];
}
int ans=0;
for (int i = 0; i < 1<<H; i++){
for (int j = 0; j < 1<<W; j++){
... | #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 h,w,k;
... | 1 | 92,448,520 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i, n) for (ll i=0; i<n; ++i)
#define all(obj) (obj).begin(),(obj).end()
using namespace std;
typedef long long ll;
long long GCD(long long x, long long y) { return y ? GCD(y, x%y) : x; }
int main(){
ll X, t;
cin >> X >> t;
cout << max(X-t, (ll)0) << ... | #include<bits/stdc++.h>
#define ll long long
#define all(a) a.begin(),a.end()
#define sz(a) a.size()
#define re return
#define MP make_pair
#define pb push_back
#define pii pair<int,int>
#define se second
#define fi first
using namespace std;
signed main(){
ios_base::sync_with_stdio(0);
int x,t;
cin>>x>>t;
cout<<m... | 1 | 14,861,274 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | #include<bits/stdc++.h>
using namespace std;
string S;
int main(){
cin >> S;
long long ans = 0, buf = 0;
for(int i = 0; i < S.size(); ++i){
if(S[i] == 'B') ++buf;
else if(S[i] == 'W') ans += buf;
}
cout << ans << endl;
return 0;
} | 1 | 27,326,982 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
static const int MAX = 100;
bool mat[MAX][MAX];
int col[MAX], row[MAX];
int main(){
int h, w;
cin >> h >> w;
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
char c;
cin >> c;
mat[i][j] = (... | #include<bits/stdc++.h>
using namespace std;
int main(){
int H, W;
cin>> H >>W;
vector<vector<char>> a(H, vector<char>(W));
vector<bool> row(H, false);
vector<bool> col(W, false);
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
cin>>a[i][j];
if(a[i][j]=='#'){
... | 1 | 48,172,333 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
if (100 <= n && n <= 111)
cout << 111 << endl;
else if (112 <= n && n <= 222)
cout << 222 << endl;
else if (223 <= n && n <= 333)
cout << 333 << endl;
else if (334 <= n && n <= 444)
cout <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
for (int i = 1; i <= 9; i++) {
int tmp = 111 * i;
if (tmp < n) {
}
else{
cout << tmp << endl;
break;
}
}
return 0;
} | 1 | 16,917,396 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, x;
cin >> a >> b >> x;
if (a > x) {
cout << "NO" << endl;
} else if (a + b >= x) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main()
{
int a,b,x;
cin>>a;
cin>>b;
cin>>x;
if ((b>=x-a) && (x>=a))
cout<<"YES";
else
cout<<"NO";
} | 1 | 15,938,962 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <string>
#include <cmath>
#include <iomanip>
#include <string>
#include <queue>
#include <list>
#include <stack>
using namespace std;
const int INF = 1 << 30;
const int mod = 1000000007;
typedef long ... | #include <cstdio>
int main() {
int a,b,c;
std::scanf("%d %d %d",&a,&b,&c);
if(a < b && b < c) {
std::printf("Yes");
}
else if(!(a < b && b < c)) {
std::printf("No");
}
std::printf("\n");
return 0;
} | 1 | 40,707,659 |
#include <algorithm>
#include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
void solve(long long N, long long M, long long X, long long Y, std::vector<long long> x, std::vector<long long> y){
sort(x.begin(), x.end(), greater<long long>());
sort(y.begin(), y.en... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | 1 | 43,052,071 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll len[50], pat[50];
ll patties(int n, ll x) {
if (n == 0) {
if (x <= 0) return 0;
else return 1;
} else if (x <= 1 + len[n-1]) {
return patties(n-1, x-1);
} else {
return pat[n-1] + 1 + patties(n-1, x - 2 - len[n-1]);
}
}
int main() {
int... | #include <iostream>
#include <algorithm>
#include <vector>
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
using namespace std;
typedef long long ll;
int main()
{
ll n;cin >> n;
ll x;cin >> x;
vector<ll> b(n+1);
vector<ll> p(n+1);
b[0] = 1;
p[0] = 1;
rep(i,n) {
b[i+1] = b... | 1 | 34,165,882 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(),v.end()
#define ALLR(v) v.rbegin(),v.rend()
typedef long long ll;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
int ma... | 1 | 13,807,440 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <cstring>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <functional>
using namespace std;
template<typename T> void uin(T &a, T b) {if (b < a) a = b;}
template<typename T> void uax(T &a, T... | #include<cstdio>
#include<algorithm>
#include<iostream>
#define maxn 200+1
using namespace std;
int n,a[maxn],ans;
int main(){
scanf("%d",&n);
int md=n<<1;
for(int i=1;i<=md;++i)scanf("%d",&a[i]);
sort(a+1,a+1+md);
for(int i=1;i<=md;i+=2)ans+=a[i];
printf("%d\n",ans);
re... | 1 | 80,425,793 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
if(str.at(0) == str.at(1) && str.at(1) == str.at(2)){
cout << "Yes";
}else if(str.at(3) == str.at(1) && str.at(1) == str.at(2)){
cout << "Yes";
}else{
cout << "No";
}
} | #include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl
#define YORN(f) cout<<((f)?"YES":"NO")<<endl
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define println(x) cout << x << endl
using namespace std;
int main()
{
string n;
cin >> n;
int cnt = 0;
char pr... | 1 | 40,675,660 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
#define int ll
const int INF=(int)2e18;
const int MOD = 1000000007;
const int PEG = 998244353;
long double pie=acos(-1);
typedef vector< int > vi;
typedef vector< vi > vvi;
typedef pair< int, int > pii;
typedef... | #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, M;
cin >> N >> M;
int A;
int ans = N;
rep(i, M) {
cin >> A;
ans -= A;
if (ans < 0) {
cout << -1 << endl;
return 0;
}
}
cout << ans << endl;
re... | 1 | 18,259,479 |
#include<bits/stdc++.h>
using namespace std;
int main (void){
int k,s,ans = 0;
cin >> k >> s;
for(int i = 0;i <= k;i++){
for(int j = 0;j <= k;j++){
if(s-i-j <= k && s-i-j >=0){
ans++;
}
}
}
cout << ans << "\n";
return 0;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;n>i;++i)
using namespace std;
using ll=int64_t;
using vi=vector<int>;
using VI=vector<ll>;
using vis=vector<string>;
using vvi=vector<vi>;
int gcd(int a,int b){
if(a%b==0)
return b;
return gcd(b,a%b);
}
int main(){
int k,s;
cin>>k>>s;
int ans=... | 1 | 85,421,865 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> p;
typedef long long ll;
const int inf = 1000000007;
int main() {
int k, a, b;
cin >> k >> a >> b;
bool ok = false;
for (int i = 0; i < 5000; i++) {
if (ok) break;
if... | #include<iostream>
using namespace std;
int main() {
int want = 0, hi = 0, low = 0;
cin >> want >> low >> hi;
bool ans = false;
while (low <= hi) {
if (low % want == 0) {
ans = true;
break;
}
low++;
}
if (ans) {
cout << "OK" << endl;
}
else {
cout << "NG" << endl;
}
} | 1 | 64,526,894 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define pii pair<int,int>
#define rand rund
#define pb push_back
#define eb emplace_back
using namespace std;
using namespace __gnu_pbds;
typedef long long int ll;
typedef unsigned long long int ull;
int MOD=1000000007;
i... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll k,now,a[100];int n=50;
void work(){
int p=1;
for (int i=1;i<=n;i++) if (a[i]>a[p]) p=i;
a[p]-=(n+1);
for (int i=1;i<=n;i++) a[i]++;
}
int main()
{
scanf("%lld",&k);
now=(k+49)/50*50;
for (int i=1;i<=n;i++) a[i]=(k+49)/50+49;
while (now>k) wor... | 1 | 35,770,251 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
#define endl "\n"
using ll = long long;
using P = pair<int,int>;
using mp = map<string,int>;
const int MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(... | #include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
using ll = int64_t;
using Graph = vector<vector<int> >;
const ll M = 100000000... | 1 | 86,114,789 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <limits>
#include <stack>
#include <queue>
#include <map>
#include <set>
using namespace std;
using ll = long long;
using ui = unsigned int;
const ll MOD = 1000000007;
const ll INF = 922337203685477... | #include <bits/stdc++.h>
using namespace std;
int main(){
double n,m,d;
cin>>n>>m>>d;
int a=1;
if(d>0){
a++;
}
cout<<fixed<<setprecision(15);
cout<<(m-1)*(a*(n-d))/(n*n)<<endl;
} | 1 | 72,513,098 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
string s,t;
cin >> s >> t;
sort(s.begin(), s.end());
sort(t.begin(), t.end());
reverse(t.begin(), t.end());
if (s < t){
cout << "Yes" << "\n";
}
else{
... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
string s,t;
cin>>s>>t;
sort(s.begin(),s.end());
sort(t.begin(),t.end());
bool greater=false;
bool lower=false;
for(int i=0;i<min((int)s.size(),(int)t.size());i++)
{
if(s[i]<t[t.size()-i-1])
{
... | 1 | 83,983,511 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(n) rep(i,n)
const int MAXN = 50, MAXT = 11, INF = (10000);
int d[MAXT][MAXT];
i... | #include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <map>
#include <set>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <stack>
#include <queue>
#include <utility>
#define rep(i,l,n) for(lint i=l;i<n;i++)
#define rer(i,l,n) for(lint i=l;i<=n;i++)
#def... | 1 | 99,598,029 |
#include <iostream>
#include <sstream>
#include <string>
#include <cmath>
#include <array>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <utility>
#include <iomanip>
#include <numeric>
#include <climits>
#include <algorithm>
#include <cstdint>
using namespace... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | 1 | 26,593,835 |
#include <bits/stdc++.h>
#include <vector>
using namespace std;
int main(){
string a,b;
cin>>a>>b;
sort(a.begin(),a.end());
sort(b.begin(),b.end(),greater<>());
if(a<b) cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <deque>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
typedef long long ll;
typedef pair<int,int> P;
int main() {
string s,t;
cin >> s >> t;
sort(s.begin(), s.end());
sort(t.begin()... | 1 | 63,131,003 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e15;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll MOD = 1e9+7;
int main(){
int N, M; cin >> N >> M;
vector<int> A(N), B(N), C(M), D(M), ans(N);
for(int i = 0; i < N; i++) cin >> A[i] >> B[i];
for(... | #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... | 1 | 84,212,834 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(v) (v).begin(), (v).end()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define EPS (1e-7)
#define gearup ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef pair<int, int>P;
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;
#define rep(i,n) for(int i=0;i<n;i++)
#d... | 1 | 48,613,426 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i< (n); i++)
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main(){
char s[2*100000+1]={};
char t[2*100000+1]={};
cin>>s>>t;
int p=strlen(s);
int ans=0;
rep(i,p){
if(s[i]!=t[i]){
ans++;
}
}
cout<<ans<<endl;
} | #pragma GCC target ("avx2")
#pragma GCC optimize "trapv"
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#define input(a,n) for(ll i1=0;i1<n;i1++)cin>>a[i1]
#define ll long long
#define pi 2 * acos(0.0)
#define usll unordered_set<ll>
#define sll set<ll>
#define vll vec... | 1 | 59,205,733 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main() {
char b;
cin >> b;
switch (b) {
case 'A':
b = 'T';
break;
case 'T':
b = 'A';
break;
case 'C':
b = 'G';
break;
case 'G':
b = 'C';
break;
}
cout << b << endl;
} | #include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false);cin.tie(NULL)
using namespace std;
#define int long long
#define MOD 1000000007
typedef vector<int> vi;
typedef pair<int,int> pi;
#define inf 1e18
#define For(i,a,b) for (int i = a; i < b; i++)
#define Rep(i,a,b) for (int i = a; i <= b; i++)
#define ps(x,... | 1 | 77,315,706 |
#include<iostream>
using namespace std;
int main()
{
int H,W;
for(int r=0; ; r++){
cin >> H >> W;
if(H==0 && W==0)
break;
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
cout << '#';
}
cout << endl;
}
cout <<... | #include <bits/stdc++.h>
using namespace std;
int main(){
for (int k = 0; k < 114514; ++k){
int H, W;
cin >> H >> W;
if(H == 0 && W == 0){
break;
}
for (int i = 0; i < H; ++i) {
for (int j = 0; j < W; ++j) {
cout << "#";
}
cout << endl;
}
cout << endl;
}
} | 1 | 36,418,194 |
#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i, n) for(int i=0; i<(n); i++)
using namespace std;
using namespace atcoder;
using ll = long long;
using P = pair<ll, ll>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, q, t, u, v;
cin >> n >> q;
dsu d(n);
rep(i, q) {
... | #include<bits/stdc++.h>
using namespace std;
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/gcd(a,b)
#define ff first
#define ss second
#define int long long
#define float double
#define pb emplace_back
#define mp make_pair
#define pii ... | 1 | 99,884,808 |
#include <bits/stdc++.h>
using namespace std;
void dice_roll( int *dice, char i){
if( i == 'W'){
int tmp = dice[0];
dice[0] = dice[1];
dice[1] = dice[5];
dice[5] = dice[4];
dice[4] = tmp;
}
if( i == 'S'){
int tmp = dice[0];
dice[0] = dice[4];
dice[4] = dice[5];
dice[5] = dice[1];
dice[1] = tmp;
... | #include <iostream>
using namespace std;
class dice{
private:
int me[6];
public:
int set();
int right(int f,int t);
int show(int k);
};
int dice::set(){
int i;
for (i = 0; i < 6; i++)
cin >> me[i];
return 0;
}
int dice::right(int f, int t){
int i,j;
for (i = 0; i < 6; i++){
if (me[i] == f)
break;
}
fo... | 1 | 1,871,882 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)n;++i)
typedef long long ll;
typedef pair<ll, ll> pll;
int main(){
ll H, W;
cin >> H >> W;
vector<pll> roads;
REP(i, H){
ll p;
cin >> p;
roads.push_back({p, 0});
}
REP(i, W){
ll p;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int W, H; cin >> W >> H;
vector<P> a(W + H);
for (int i = 0; i < W + H; i++) {
int x; cin >> x;
a[i] = {x, (i < W)};
}
sort(begin(a), end(a));
ll ans {};
int c[2] { W + 1, H + 1 };
for (aut... | 1 | 71,119,099 |
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<ctype.h>
#include<cmath>
#include<iomanip>
using namespace std;
int main(void){
int a[6],c,q,hokan,ue,mae;
cin>>a[1]>>a[2]>>a[3]>>a[4]>>a[5]>>a[6];
cin>>q;
for(int kibou=0;kibou<q;kibou++){
cin>>ue>>mae;
c=0;
for(int x=0;4>x;x++){
for(int b=0;... | #include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) X.begi... | 1 | 95,938,174 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int now;
int next;
int rate;
cin >> now >> rate;
next = 2 * rate - now;
cout << next << endl;
} | #include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define endl "\n"
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
int main() {
int r, g;
cin >> r >> g;
cout << g*2 - r << endl;
retu... | 1 | 10,359,846 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for(ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina c... | #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>;
#define chmax(x,y) x = max(x,y);
#define chmin(x,y) x = min(x,y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
int n... | 1 | 96,305,507 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
int n, m, p;
string s;
scanf("%d", &n);
scanf("%d", &m);
int prob[n] = {};
bool bprob[n] = {};
for (int i = 0; i < m; i++)
{
cin >> p;
cin >> s;
if (!bprob[p - 1])
{
if (s == "WA")
... | 1 | 75,056,599 |
#define TEMPLATE_USED
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
const ll D4[]={0,1,0,-1,0};
const ll D8[]={0,1,1,0,-1,-1,1,-1,0};
#define _o... | #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 per(i,n) for(int i=n-1;i>=0;i--)
#define per1(i,n) for(int i=n;i>0;i--)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vec;
typedef vector... | 1 | 521,947 |
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<cctype>
#include<cmath>
#include<string>
#include<set>
#include<map>
#include<queue>
#include<vector>
using namespace std;
int main() {
int n;
while (true) {
cin >> n;
if (!n)break;
int s, M, m, sum = 0;
for (int i = 0; i < n; i++) {
cin >> ... | #include<iostream>
#include<algorithm>
using namespace std;
int main(){
long long sum[20];
int j=0;
while(true){
int n;
cin >> n;
if(n==0)break;
int s[n];
sum[j] = 0;
for (int i = 0; i < n; ++i)
{
cin>>s[i];
sum[j]+=s[i];
}
sort(s,s+n);
sum[j] -= s[0]+s[n-1];
sum[j] = sum[j]/(n-2);
j++;... | 1 | 89,952,368 |
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintma... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | 1 | 6,003,275 |
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define ll long long
#define for(i,a,b) for (i=a; i<b; i++)
#define forb(i,a,b) for (i=a; i>b; i--)
#define all(S) S.begin(),S.end()
#define sort(S) sort(all(S))
const int inf = 1e9;
const ll INF = 1... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main(){
int N;
string s;
cin>>N;
cin>>s;
ll count=0;
for(int i=0;i<N;++i){
for(int j=i+1;2*j-i<N;++j){
int k=j+j-i;
if(s[i]==s[j])continue;
if(s[j]==s[k])continue;
if(s... | 1 | 10,822,078 |
#include "algorithm"
#include "bitset"
#include "cmath"
#include "functional"
#include "iomanip"
#include "iostream"
#include "map"
#include "numeric"
#include "queue"
#include "set"
#include "string"
#include "vector"
#define rep(i, to) for (ll i = 0; i < (to); ++i)
#define rep1(i, to) for (ll i = 1; i <= (to); ++i)
#... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Z, W; cin >> N >> Z >> W;
vector<int> a(N); for (auto &x : a) cin >> x;
if (N == 1) cout << abs(W - a[0]) << endl;
else cout << max(abs(W - a[N-1]), abs(a[N-2] - a[N-1])) << endl;
} | 1 | 32,003,338 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int q;
cin>>q;
for(int _=0;_<q;_++){
int64_t a,b;
cin>>a>>b;
if(a==1&&b==1){
cout<<0<<endl;
continue;
}
int64_t l=0;
int64_t r=max(a,b);
int64_t h;
while(r-l>1){
h=(l+r)/2;
if(h*h>=a*b)
r=h;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long i64;
i64 suma;
i64 a, b;
bool ok(i64 st, i64 dr, i64 l, i64 r)
{
if (dr <= l)
return dr * l <= suma;
if (st >= r)
return st * r <= suma;
double q = 1.0 * (st + r) / 2;
i64 x = q;
if (1.0 * x == q) {
if (x * x > s... | 1 | 30,371,778 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
#define Sort(x) sort(all(x))
#define A first
#define B second
#define sep ' '
#define fast_io ios_base::sync_with_stdio(false);cin.tie(0);c... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
#define fi first
#define se second
template <class T>
void cout_vec(const vector<T> &vec){
for(auto itr:ve... | 1 | 47,492,761 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int space, white;
cin >> space >> white;
cout << space * space - white << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<(n); i++)
#define REP2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int main()
{
int N, A;
cin >> N ... | 1 | 67,640,485 |
#include <iostream>
#include <string>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s; cin >> s;
rep(i, s.size()) {
cout << s[i];
if(i == 3) cout << ' ';
}
cout << '\n';
return 0;
} | #include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using lint = long;
using llint = long long;
using namespace std;
int main() {
fastIO;
string s;
cin >> s;
for (size_t... | 1 | 54,597,537 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for(ll i = ll(0); i < ll(n); i++)
#define Rep(i, n) for(ll i = ll(1); i < ll(n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_st... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); rit... | 1 | 33,864,881 |
#include<bits/stdc++.h>
#define ll long long
#define fornum(A,B,C) for(A=B;A<C;++A)
#define pii pair<int,int>
#define pll pair<ll,ll>
using namespace std;
#define INF (ll)1e18
ll N,A[202020];
ll mk[202020];
ll i, j, k,ans;
void no(){
printf("-1\n");
exit(0);
}
pll calc(ll d,ll mx){
if(d==N){
if(mx<A... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
using ll = long long;
using namespace std;
template <typename T> using vec = std::vector<T>;
int main() {
int N;
cin >> N;
vec<ll> A(N + 1), S(N + 2);
rep(i, N + 1) cin >> A[i];
for (int i = N; i >= 0; --i) {
S[i] = S[i ... | 1 | 15,151,336 |
#include <bits/stdc++.h>
int main(){
long long N,K;
std::cin>>N>>K;
std::cout<<(N+K-3)/(K-1);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n,k;
cin>>n>>k;
vector<int> A(n);
rep(i,n)cin>>A[i];
int ans=(n-k+k-2)/(k-1)+1;
cout<<ans<<endl;
} | 1 | 66,453,785 |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 30000000001;
int main(){
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> ax(x), by(y), cz(z);
for(int i=0; i<x; ++i) cin >> ax[i];
for(int i=0; i<y; ++i) cin >> by[i];
for(int i=0; i<z; ++i) cin >> cz[i];
sort(ax.rbegin... | 1 | 26,696,973 |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ALLv(a) (a).begin(),(a).end()
#define ALL(a,n) (a),(a)+n
#define vi vector<long long>
#define vd vector<long double>
#define vs vector<string>
#define INF 1010000000000000017LL
#define MOD 1000000007LL
#define EPS 1e-12
#define PI 3.14159265... | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#i... | 1 | 33,298,226 |
#include<bits/stdc++.h>
#pragma GCC target ("avx2")
#pragma GCC optimization ("Ofast")
#pragma GCC optimization ("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
#define int long long
typedef pair<int,int>pi;
... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdint>
#include <iostream>
#include <iterator>
#include <vector>
#ifndef UTIL_HPP
#define UTIL_HPP
using i64 = ::std::int_fast64_t;
using u64 = ::std::uint_fast64_t;
using i32 = ::std::int_fast32_t;
using u32 = ::std::uint_fast32_t;
namespace tools {
template ... | 1 | 17,730,594 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A , B , M ,S ,H ,J ,I ,count;
cin >> A >> B;
count = 0;
for(int x = A; x < B+1; x++){
M = x;
S = M % 10000;
M = M / 10000;
H = S % 1000;
S = S / 1000;
J = H % 100;
H = H / 100;
I = J % 10;
J = J / 10;
if(M == ... | #include <bits/stdc++.h>
inline bool palindrome(const std::string& s) {
int i = 0;
int j = s.size() - 1;
while (i < j) {
if (s[i++] != s[j--])
return false;
}
return true;
}
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
int a =... | 1 | 21,930,153 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
#define Graph vector<vector<int>>
int main() {
int N, D, X; cin >> N >> D >> X;
vector<int> A(... | 1 | 75,031,124 |
#include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin >> a>>b;
int ans = 0;
if(a%b==0)
ans = 0;
else
{
ans = 1;
}
cout <<ans<<endl;
} | 1 | 64,614,779 |
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <numeric>
#include <cmath>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
template... | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define endl "\n"
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define prt(x) cout << (x)
#define prtl(x) cout << (x) << endl
#define rep(i,a,b) for(ll i=a; i<b; i++)
#define rrep(i,a,b) for(ll i=a; i>b; i--)
#define mp(a, ... | 1 | 11,186,216 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
void lcs(string x,string y){
int m=x.length();
int n=y.length();
int c[m+1][n+1];
for(int i=0;i<=m;i++) c[i][0]=0;
for(int j=1;j<=n;j++) c[0][j]=0;
for(int i=1;i<=m;i++){
for(int j=1;j<=n;j++){
if(x[i-1]==y[j-1]){
... | #include <iostream>
#include <string>
#include <vector>
constexpr int MAXLENGTH = 1000;
int C[MAXLENGTH + 1][MAXLENGTH + 1];
int lcs(std::string lhs, std::string rhs) {
int lnum = lhs.length();
int rnum = rhs.length();
for (int i = 0; i <= lnum; i++) {
C[i][0] = 0;
}
for (int i = 0; i <= rnu... | 1 | 83,747,458 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define reps(i, S, E) for (ll i = (S); i <= (E); i++)
#define rep(i, N) reps(i, 0, N-1)
int main(){
int n;
cin >> n;
vector<int> adj[n+1];
ll result = 0;
for(ll i=1; i<=n; i++)
result += i * (i+1)/2;
for(ll i=1; i<n; i++){
ll a... | #include<iostream>
int main(){
int N;
std::cin>>N;
long long answer=0;
int u,v;
for(int i=0;i<N-1;i++){
answer+=((long long)(i+1))*(N-i);
std::cin>>u>>v;
if(u>v){
answer-=((long long)v)*(N-u+1);
}else{
answer-=((long long)u)*(N-v+1);
}
}
answer+=N;
std::cout<<answer;
return 0;
} | 1 | 41,070,899 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
string o, e;
cin >> o >> e;
int i = 0;
while (o[i] != NULL) {
cout << o[i];
if (e[i] != NULL) cout << e[i];
i++;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
string a,b;
cin >> a >> b;
for(int i=0;i<a.size()+b.size();i++){
if(i%2==0)
cout << a.at(i/2);
else
cout << b.at(i/2);
}
cout << endl;
} | 1 | 61,364,011 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5+5 , M = 998244353, OO = 0x3f3f3f3f;
typedef long long ll;
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);
const double Pii = 3.14159265359;
ll n, m;
int main()
{
FIO
cin >> n >> m;
if(n%2 == 1)
{
ll st = 1, en = (n/2)*2;
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
int n,m;
cin>>n>>m;
int a=1,b=n;
if(n%2==1){
rep(i,m){
cout<<a<<" "<<b<<endl;
a++; b--;
}
}
else{
bool ok=false;
rep(i,m){
... | 1 | 32,767,863 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll r,d,x_2000;
cin>>r>>d>>x_2000;
for(ll i=0;i<10;i++){
x_2000=r*x_2000-d;
cout<<x_2000<<endl;
}
return 0;
} | #include "bits/stdc++.h"
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define mFOR(i, a, b) for (int i = a; i > b; i--)
#define MP make_pair
#define PB push_back
#define ALL(v) v.begin(), v.end()
#define N 100007
#define INF 1000000007
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) { return b == 0 ? ... | 1 | 30,659,464 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int X, A, B;
cin >> X >> A >> B;
if(A >= B) {
cout << "delicious" << endl;
}
else if((X + A) >= B) {
cout << "safe" << endl;
}
else {
cout << "dangerous" << endl;
}
} | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <unordered_map>
#include <set>
#include <map>
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(... | 1 | 19,877,950 |
#include <stdio.h>
#include <ctype.h>
#include <limits.h>
int main(void){
char ch,i;
int n[26] = {0};
int k = 0;
while(scanf("%c",&ch) != EOF){
ch = tolower(ch);
for(i = 'a'; i <= 'z'; i++){
if(ch == i){
n[ch - 'a'] += 1;
break;
}
... | #include "stdio.h"
#define ALP_SIZE 26
int main()
{
int A[ALP_SIZE];
int i;
char ch;
for (i = 0; i < ALP_SIZE; i++) A[i] = 0;
while ((ch = getchar()) != EOF)
{
if (ch >= 0x41 && ch <= 0x5A || ch >= 0x61 && ch <= 0x7A) A[(ch & 0x1F) - 1]++;
}
for (i = 0; i < ALP_SIZE; i++) printf("%c : %d\n",0x61 + i, A[i]);
... | 1 | 87,973,166 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll N=1e5+5;
ll a,b,c,d;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>a>>b>>c>>d;
if(abs(a-c)<=d)
cout<<"Yes";
else if(abs(a-b)<=d&&abs(b-c)<=d)
cout<<"Yes";
else
cout<<"No";
return 0;
} | #include <iostream>
#include <cmath>
using namespace std;
int main()
{
int a,b,c,d;
cin >> a >> b >> c >> d;
bool yes = true;
if(abs(a - c) > d){
if(abs(a-b) > d || abs(b-c) > d){
yes = false;
}
}
if(yes){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
return 0;
} | 1 | 82,293,538 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using P = pair<int, int>;
#define roop(i, n) for(int i = 0;i < n;i++)
int main(void){
string str;
cin >> str;
int al[26] = {0};
roop(i, str.length()) al[str[i]-'a']++;
roop(i, 26){
if(al[i] == 0){
str += (cha... | #include <algorithm>
#include <iostream>
#include <set>
using namespace std;
int main() {
string s;
cin >> s;
set<char> st;
for (const auto c : s)
st.insert(c);
for (char c = 'a'; c <= 'z'; ++c) {
if (!st.count(c)) {
cout << s << c << '\n';
return 0;
}... | 1 | 24,947,912 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string>
#include <map>
#include <queue>
#include <vector>
#include <cstdlib>
#define mp make_pair
#define pb push_back
#define mem(i,a) memset(i,a,sizeof(i))
using namespace std;
typedef long long ll;
typedef unsign... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
ll W[55];
ll P[55];
ll patee(ll l, ll n){
ll whole = W[l];
ll pate = P[l];
if(l == 0){
return 1;
}
if(n == 1){
return 0;
}
if(n > 1 && n < (whole/2) + 1){
... | 1 | 51,531,385 |
#include <bits/stdc++.h>
#define rep0(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<string, int, int> TU;
int main()
{
int N;
cin >> N;
double res=0;
rep0(i,N){
double a;
... | #include<iostream>
#include<vector>
#include<string>
#include<cmath>
using namespace std;
int main() {
int n;
double x[11];
string u[11];
double total = 0.0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x[i] >> u[i];
}
for (int i = 0; i < n; i++) {
if (u[i] == "BTC") {
total += x[i] * 380000.0;
}
e... | 1 | 65,854,429 |
#include <bits/stdc++.h>
using namespace std;
int a[111111];
int dp[111111];
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int n,m; cin>>n>>m;
for(int i=0;i<m;i++) cin>>a[i];
dp[0]=0;
for(int i=1;i<=n;i++)
{
dp[i]=int(1e9);
for(int j=0;j<m;j++)
{
if(i>=a[j])
{
dp[i]=min(dp[i],dp[i-a[j]]+1... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
vector<int> coin(m);
int max = 0;
for(int i = 0; i < m; i++){
cin >> coin[i];
}
sort(coin.begin(), coin.end());
vector<unsigned int> coin_nums(n+1, -1);
coin_... | 1 | 80,664,204 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int n;
cin>>n;
rep(i,999){
int a=n/1... | #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>;
int main() {
int N;
cin >> N;
repe(i, N, 999) {
string s = to_string(i);
bool ok = true;
re... | 1 | 31,543,313 |
#include<stdio.h>
#pragma GCC optimize("O2")
#define swap(a,b) (a+=b,b=a-b,a-=b)
static inline char CH()
{
static char buf[100000],*ptr1=buf,*ptr2=buf;
return ptr1==ptr2&&(ptr2=(ptr1=buf)+fread(buf,1,100000,stdin),ptr1==ptr2)?EOF:*ptr1++;
}
static inline int IN(void)
{
int x=0,f=0,c=CH();while(c<48||c>57){f^=c==4... | #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=(int)(N)-1;i>=0;--i)
#define debug(x) cout<<#x<<"="<<x<<endl;
constexpr int MOD=1000000007;
constexpr ll INF=(1LL<<61)-1;
template<class T> inline bool chmin(T&... | 1 | 5,093,080 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define pb push_back
#define mp make_pair
#define in insert
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define mod 1000000007
#define sz(v) (int)(v.size())
#define all(x) x.begin(), x.end()
#de... | #include <iostream>
using namespace std;
const int MOD = 1000000007;
const int MAX = 1000000;
long long mod(long long a) {
a %= MOD;
return a >= 0 ? a : a+MOD;
}
long long inverse[MAX+1];
long long factorial[MAX+1];
long long factorial_inverse[MAX+1];
void calc(int n) {
inverse[1] = 1;
factorial[0] = factorial[1] =... | 1 | 2,706,984 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int h,w;
cin >> h >> w;
vector<vector<char>> s(h+2,vector<char>(w+2));
for(int i=1; i<h+1; i++){
for(int j=1; j<w+1; j++){
cin >> s.at(i).at(j);
}
}
string ans="Yes";
for(int i=1; i<h+1; i++){
for(i... | #include "bits/stdc++.h"
#define PRECISION(x) cout << fixed << setprecision(x)
#define FAST_IO ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define ALLR(X) (X).rbegin(), (X).rend()
#define MP make_pair
#define PB push_back
#define EB e... | 1 | 89,314,253 |
#include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
void solve(long long N, std::vector<long double> x, std::vector<std::string> u){
long double ans = 0.0;
REP(i, N) {
if (u[i] == "JPY") ans += x[i];
else ans += x[i] * 380000.0;
}
pr... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define reps(i,a,b) for(int i= a; i < b; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main()
{
int n;
cin >> n;
double ans = 0;
rep(i, n) ... | 1 | 23,399,000 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << ' ' << ... | #include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include <bitset>
#include... | 1 | 78,596,406 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int r,g;
cin>>r>>g;
cout<<g-r+g<<'\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int rate_from, rate_to;
cin >> rate_from >> rate_to;
cout << rate_to*2 - rate_from << endl;
} | 1 | 35,930,416 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll ;
#define pb push_back
#define mp make_pair
#define all(v) v.begin() , v.end()
#define allr(v) v.rbegin(), v.rend()
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int inf = 0x3f3f3f3f;
const int MOD = 1e9+7;
const int MAX = 12e5+5;
string s;
int ... | #include<iostream>
#include<cstdio>
#include<vector>
#include<map>
#include<string>
#include<sstream>
#include<cmath>
#include<climits>
#include<algorithm>
#include<bitset>
#include<set>
#include<stack>
#include<queue>
#include<iomanip>
#include<memory.h>
#include<complex>
using namespace std;
typedef long long ll;
t... | 1 | 18,665,496 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
using namespace std;
#define ll long long
#define PI acos(-1.0)
#defin... | #include <iostream>
using namespace std;
int main() {
while(true) {
string s;
cin >> s;
if (s == "-")
break;
int count;
cin >> count;
for (int i = 0; i < count; i++) {
unsigned long h;
cin >> h;
s = s.substr(h) + s.subst... | 1 | 42,175,431 |
#include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<functional>
#include<string>
#include<iomanip>
#include<utility>
#include<string>
#include<map>
#include<unordered_map>
#include<queue>
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
tem... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, c, k;
cin >> n >> c >> k;
int a[n];
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
sort(a, a + n);
int i = 0, bus = 0;
while (i < n)
{
int ptr = i + 1;
while (ptr < (i + c) && ptr < n)
... | 1 | 45,623,886 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define PI 3.141592653L
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
const ll INF = (ll)1e18;
const int N = 2e5 + 5;
const ll MOD = 1e9+7;
int parent[N];
int gcd(int a, int b) {
if (a == 0)
return b;... | #pragma GCC optimize("O3","unroll-loops","omit-frame-pointer","inline")
#pragma GCC option("arch=native","tune=native","no-zeroupper")
#pragma GCC target("avx","popcnt")
#include <x86intrin.h>
#include <bits/stdc++.h>
using namespace std;
#define eb emplace_back
#define mp make_pair
#define hello cout<<"hello"<<"... | 1 | 97,532,812 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define INF ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 2000000000000000000ll
#define fi first
#define sec second
#define... | 1 | 23,585,311 |
#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;
const long long MOD = 1e9+7;
#define rep(i,n) for(int i=0;i<n;++i)
typedef long long int ll;
typedef unsigned long long ull;
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 < ... | 1 | 15,087,217 |
#include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
using P = pair<ll,ll>;
using grid = vector<vector<int>>;
const int dx[2] = {... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdint>
#include <limits>
#include <bits/stdc++.h>
#include<string>
using namespace std;
int main(void)
{
uint64_t n;
int k,ans;
char s[334];
cin >> s;
if((s[0]=='A' && s[1]=='A' && s[2]=='A') || (s[0]=='B' && s[2]=='B' && s[1]=... | 1 | 65,628,434 |
#include<bits/stdc++.h>
using namespace std;
long long n,a[101010],s[101010],ans,nw;
int main()
{
cin>>n;
for(int i=0;i<=n;i++)
{
cin>>a[i];
}
for(int i=n;i>=0;i--)
{
s[i]=s[i+1]+a[i];
}
for(int i=0;i<=n;i++)
{
if(i!=0)
{
nw=min(nw*2,s[i]);
}
else
{
nw=1;
}
ans+=nw;
if(nw<a[i])
{
... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using VL = vector<LL>;
#define REP(i, n) for (LL i = 0, i##_size = n; i < i##_size; ++i)
#define RREP(i, n) for (LL i = LL(n) - 1; i >= 0; --i)
template <class T> void chmin(T& a, T b) { if (b < a) { a = b; } }
template <class T> void chmax(T& a, T b) ... | 1 | 91,198,488 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typede... | 1 | 83,172,562 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
int n, c[maxn];
set<int> s;
int main(void) {
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n;
s.insert(0); s.insert(n + 1);
for(int i = 1; i <= n; ++i) {
int p; cin >> p;
c[p] = i;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
typedef vector<int> vi;
const ll M = 1e9 + 7;
int main(void){
int n;
scanf("%d", &n);
vi rp(n);
rep(i, n){
int p;
scan... | 1 | 18,037,331 |
#include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
using P = pair<ll,ll>;
using graph = vector<vector<int>>;
const int dx[4] = ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007
ull modpow(ll n,ll r){
ll res = 1;
while(r){
if(r & 1)res = res*n%MOD;
n = n*n ... | 1 | 31,254,804 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll A,B,K;
cin>>A>>B>>K;
ll C=min(A,B);
while(K>0) {
if(A%C==0&&B%C==0) {
K--;
}
C--;
}
cout<<C+1<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, e) for (int i = (int)(s); i < (int)(e); i++)
#define _rep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define _REP(i, e, s) for (int i = (int)(e - 1); i >= (int)(s); i--)
#define yes cout << "yes" << e... | 1 | 13,207,133 |
#include <algorithm>
#include <iostream>
using namespace std;
void solve(long long A, long long B, long long C){
cout << max(C - (A - B), (long long)0) << '\n';
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
long long A;
scanf("%lld",&A);
long long B;
scanf("%lld",&B);
long long ... | #include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | 1 | 31,908,142 |
#include <iostream>
#include <string>
#include <vector>
#include <unordered_map>
using namespace std;
string makeString(long long x, long long y) {
return to_string(x) + " " + to_string(y);
}
int main() {
long long h,w,n;
cin >> h >> w >> n;
long long x,y;
unordered_map<string, long long> m;
for... | #include <iostream>
#include <cassert>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
using namespace std;
typedef lo... | 1 | 33,413,967 |
#include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <cmath>
using namespace std;
int main()
{
string s;
int a=0, b=0;
cin >> s;
for(int i=0; i<3; i++)
{
if(s[i] == 'R')
{
a++;
b=a;
}
else if(s[i] != 'R')
{
a=0;
}
}
cout << b;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define st first
#define nd second
#define endl '\n'
#define what_is(x) cerr << #x << " is " << x << endl;
#define what_is_v(x) cerr << #x << " is "; for(auto&e: (x)) cerr << e << ' '; cerr << '\n';
#define what_is_a(x,... | 1 | 58,676,737 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <numeric>
#include <array>
#include <cmath>
#include <memory>
using namespace std;
#define DEB(variable) cout << #variable << '=' << variable << endl
#define FOR(LoopVariable,numberOFbegin,numberOFend) for (long lon... | #include <iostream>
using namespace std;
int n, m, k;
int main()
{
cin >> m >> k;
n = (1 << m) - 1;
if (m == 1 && k == 0)
{
cout << "0 0 1 1";
return 0;
}
if (k > n)
{
cout << -1;
return 0;
}
int r = 0, t = 0;
for (int i = 0; i <= n; i++)
{
... | 1 | 87,577,485 |
#include <iostream>
#include <algorithm>
using namespace std;
int d[11][11];
void init(){
for(int i = 0; i < 11; i++){
for(int j = 0; j < 11; j++){
if(i == j) d[i][j] = 0;
else d[i][j] = 1e9;
}
}
}
int main(void){
int n;
while(true){
cin >> n;
if(!n) break;
int a, b, c, m = 0;
... | #include <iostream>
#include <limits.h>
using namespace std;
#define REP(i,N) for(int i=0;i<N;i++)
int main(){
int n,a,b,c;
int mi,mx,t_num,now;
int t[10][10];
while(cin >> n && n){
REP(i,10)
REP(j,10)
if(i!=j)t[j][i] = INT_MAX/2;
else t[i][j]=0;
mx=0;mi=INT_MAX;
REP(i,n){
cin >> a >> b >> c;
... | 1 | 77,368,995 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N, K;
cin >> N >> K;
vector<int> cand(N, 1);
rep(i,... | #include <string>
#include <bits/stdc++.h>
#define For(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int N,K,d,A;
cin>>N>>K;
vector<int>sunuke(N);
for(int i=0;i<K;i++){
cin>>d;
for(int j=0;j<d;j++){
cin>>A;
sunuke.at(A-1)++;
}
}
int cou=0;
for(int l=0;... | 1 | 20,219,890 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define irep(i,a) for(auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a) vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define gcd(a,b) __gcd(a,b)
#de... | #include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
const double PI=acos(-1);
vector<bool> visited;
bool can = false;
bool dfs(const vector<vector<ll>> &g, ll v, ll goal){
visited[v] = true;
for(auto next_v: g[v]){
if(next_v == goal) can = tr... | 1 | 75,679,728 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define LOL cout << '\n';
#define sz(x) ((int)x.size())
#define INF LONG_LONG_MAX
#define NINF LONG_LONG_MIN
#define deb(... | #include<bits/stdc++.h>
using namespace std;
int main(){
map<int,int>mp;
int n,k;
cin>>n>>k;
while(k--){
int d;
cin>>d;
for(int i=0;i<d;i++)
{
int a;
cin>>a;
mp[a]=d;
}
}
int ans=0;
for(int i=1;i<=n;i++)
if(m... | 1 | 19,619,236 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
int a[n];
for(int i=0;i<n;i++)cin >> a[i];
sort(a,a+n);
int d=0;
for(int i=0;i<k;i++){
d+=a[n-i-1];
}
cout << d;
} | #include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
int main(){
ll n,k,sum=0,ar[100];
cin>>n>>k;
for(ll i=0;i<n;i++){
cin>>ar[i];
}
ll dif=n-k;
sort(ar,ar+n);
for(ll i=dif;i<n;i++) sum+=ar[i];
cout<<sum<<endl;
return 0;
} | 1 | 13,033,007 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(),v.end()
#define _GLIBCXX_DEBUG
#define fi first
#define se second
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vd = vector<double>;
using vvi = vector<vi>;
using vvl... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x) (x).begin(),(x).end()... | 1 | 92,302,154 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <utility>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <string.h>
#include <deque>
#define REP(i,j,n) for(int i=j;i<n;i++)
#define SORT(x) sort(x.begin(),x.end())
using namespace std;
int main() {
int vv[4][3][10];... | #include<iostream>
#include<cmath>
#include<string>
#include<cctype>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int room[4][3][10];
for(int i=0;i<4;i++){
for(int j=0;j<3;j++){
for(int k=0;k<10;k++){
room[i... | 1 | 20,103,878 |
#include <bits/stdc++.h>
#define rep(i, s, n) for (int i = s; i < n; i++)
#define rp(i,n) for (int i=0;i<n;i++)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define all_acc(x) (x).begin(), (x).end(), 0LL
#define int long long
#define absSort(v) sort(a.begin(), a.end(), [](int i, int j... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define repr(e,x) for(auto& e:x)
usi... | 1 | 53,232,913 |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#in... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <set>
#include <string.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define REP3(i,st,en) for(ll (i)=(... | 1 | 86,006,644 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.