code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <math.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
using namespace std;
usi... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout... | 0 | 100,530,821 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
vector<int64_t> L(86+1);
L[0] = 2;
L[1] = 1;
for (int i=2; i<86+1; i++) L[i] = L[i-1] + L[i-2];
cout << L[n] << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(void){
int N;
string s, t;
cin >> N >> s >> t;
int ans = 2*N;
rep(i,N) {
if (s.substr(i,N-i) == t.substr(0,N-i) ){ ans = N+i; break;}
... | 0 | 71,372,129 |
#include <bits/stdc++.h>
using namespace std;
int n, m, ct, val[40];
bool s;
char ans[40000];
long long get_dis(pair <int, int> x, pair <int, int> y)
{
return (long long) abs(x.first - y.first) + abs(x.second - y.second);
}
int main()
{
m = 32;
val[1] = 1;
for (int i = 2; i <= m; i++)
val[i] = 1 << (i - 2);
scan... | #include<stdio.h>
int main(void)
{
long long int s;
int n,i;
scanf("%d",&n);
s=1;
for(i=2;i<=n;i++){
s=s*i;
}
printf("%lld\n",s);
return 0;
} | 0 | 61,569,991 |
#include <iostream>
#define rep(S, L) for (int i = S; i < L; ++i)
using namespace std;
int main() {
string s;
cin >> s;
if (s <= "2019/04/30") {
cout << "Heisei" << endl;
} else {
cout << "TBD" << endl;
}
return 0;
} | #include <stdio.h>
long long n, k, s, x, z, y, m, b, l;
long long p[5000];
long long c[5000];
int main() {
scanf("%lld%lld", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%lld", p + i);
p[i]--;
}
for (int i = 0; i < n; i++) {
scanf("%lld", c + i);
}
m = -1000000000;
for (int i = 0; i < n; i++) {
s = i;
... | 0 | 87,308,079 |
#include <iostream>
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
using namespace std;
#define REP(i,n) FOR(i,0,n)
#define FOR(i,a,b) for(long long i=(a),i##Len_=(b);i<i##Len_;i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 1000000000000000000LL;
int main()
{
ll ... | #include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
void b(int a,int count){
if(a == 1){
if(count%5==1) cout <<".";
else if(count%5==2) cout <<",";
else if(count%5==3) cout <<"!";
else if(count%5==4) cout <<"?";
e... | 0 | 17,688,562 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
using namesp... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h,w;
cin>>h>>w;
char a[h][w];
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>>a[i][j];
}
}
int l[h][w],r[h][w],u[h][w],d[h][w];
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
if(a[i][j]=='#') l[i][j]=0;
else if(j==0... | 0 | 53,329,579 |
#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | #include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define ll long long
#define rep(i,n) for (ll i = 0; i < (n); i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORR(i,a,b)for(ll i=(a);i<=(b);i... | 0 | 38,997,931 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#d... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)((x).size()))
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef long long int64;
typedef unsigned int uint;
typedef unsigned long... | 0 | 48,020,614 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <math.h>
#define MAX_N 100
#define MIL_DAYS 196470
int main()
{
int i, N;
int y, m, d;
int days = 0;
scanf("%d", &N);
for (i = 0; i < N; i++)
{
scanf("%d %d %d", &y, &m, &d);
if(y % 3 == 0){
days += (d-1);
days += 20*... | #include <map>
#include <set>
#include <list>
#include <cstdio>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <cctype>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <sstream>
#include <iostream>
#include <algorithm>... | 0 | 9,790,285 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | #include <iostream>
using namespace std;
int main (void) {
int m, f, r; ... | 0 | 56,167,892 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
cin >> n;
map<int,int> m;
rep(i,n){
int a;
cin >> a;
m[a]++;
}
for(auto p : m){
if(p.second > 1){
... | #include<stdio.h>
int selectionSort(int A[], int N) {
int minj, i, j, v;
int count = 0;
for (i=0; i<N; i++) {
minj = i;
for (j=i+1; j<N; j++) {
if (A[minj]>A[j]) minj = j;
}
if (minj != i) {
v = A[i];
A[i] = A[minj];
A[minj] = v... | 0 | 65,911,786 |
#include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#i... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | 0 | 59,904,301 |
#include<bits/stdc++.h>
#include<algorithm>
#include<math.h>
#include<iostream>
using namespace std;
long long int lcm(long long int a,long long int b){
long long int n;
n=a*b/__gcd(a,b);
return n;
}
using ll =long long int;
#define ci(a) cin>>a
#define co(a) cout<<a<<endl
#define gcd(a,b) __gcd(a,b)
#define vec ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
scanf("%d",&n);
vector <long long> a(n);
for(auto&i : a)
scanf("%d",&i);
sort(a.begin() ,a.end());
for(int i=1; i<n; i++)
a[i] += a[i-1];
for(int i=n-2; ~i; i--)
if(2*a[i] < a[i+1]-a[i]){
co... | 0 | 94,765,233 |
#include<bits/stdc++.h>
using namespace std;
#define siii(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define si(a) scanf("%d",&a)
#define sii(a,b) scanf("%d%d",&a,&b)
#define sl(a) scanf("%lld",&a);
#define sll(a,b) scanf("%lld%lld",&a,&b);
#define slll(a,b,c... | #include <iostream>
#include <vector>
#include <map>
using namespace std;
typedef long long ll;
int main() {
ll n; cin >> n;
vector<ll> c(101);
for (int i = 0; i <= 100; i++)
c[i] = i;
for (ll i = 2; i * i <= 100; i++) {
if (c[i] != i)
continue;
for (ll j = i; j * i... | 0 | 28,006,369 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
int main(void){
int a, b, c, k;
cin >> a >> b >> c >> k;
int ans=0;
if(k <= a){
ans = k;
} else {
k -= a;
ans += a;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return fa... | 0 | 13,227,164 |
#include<iostream>
using namespace std;
int main(){
int a,b,c,i,x,n;
cin >>a>>b>>c;
for(i=a; i<=b; i++){
x=c%i;
if (x==0) n++;
}
cout << n<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
vector<long long> a(N), b(N), c(M), d(M), checkpoint(N, 0);
for (int i = 0; i < N; ++i) {
cin >> a.at(i) >> b.at(i);
}
for (int i = 0; i < M; ++i) {
cin >> c.at(i) >> d.at... | 0 | 26,425,576 |
#include <iostream>
using namespace std;
int main(int argc, char const *argv[])
{
string S;
cin >> S;
long long answer = 0;
int countW = 0;
for(auto it = S.rbegin() ; it != S.rend() ; ++it){
if(*it == 'W'){
++countW;
} else{
answer += countW;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
for(int i=N;i<1000;i++){
if(i/100==i%100/10&&i%100/10==i%100%10){
cout << i << endl;
break;
}
}
} | 0 | 84,974,602 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
int n;
cin >> n;
vector<ll>a(n);
ll sum=0;
for(int i=0;i<n;++i) cin >> a[i];
for(int i=0;i<n-1;++i) {
if(a[i]>a[i+1]){
sum+=a[i]-a[i+1];
a[i+1]=a[i];
}
}
cout << sum << endl;
return 0;
} | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <bitset>
#include <numeric>
#include <complex>
#include <iomanip>
#include <cassert>
#include <random>
int main() {
int... | 0 | 36,622,026 |
#include <iostream>
#include <unordered_map>
using namespace std;
int is_prime_f(int n) {
int i;
if(n < 2)
return -1;
else if(n == 2)
return 1;
if(n % 2 == 0)
return -1;
for(i = 3; i <= n / i; i += 2)
if(n % i == 0)
return -1;
return 1;
}
unordered_map... | #include<iostream>
using namespace std;
#include<string>
int main()
{
string a;
getline(cin, a);
for (unsigned i = 0; i < a.length(); i++) {
if (islower(a[i]))
a[i] = toupper(a[i]);
else
a[i] = tolower(a[i]);
}
cout << a << endl;
return 0;
} | 0 | 18,851,037 |
#include <algorithm>
#include <cassert>
#include <climits>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
const int INF = 1e9;
const long long LINF = 1e18;
template... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e+18 + 10;
const int MAX_N = 100;
ll dp[MAX_N][MAX_N];
int main()
{
int n;
cin >> n;
vector<int> r;
for (int i = 0; i < n; i++)
{
int row, col;
cin >> row >> col;
if (i == 0)
{
... | 0 | 21,600,666 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int digit(ll n)
{
int res = 0;
while (n > 0)
{
res++;
n /= 10;
}
return res;
}
int main()
{
ll N;
cin >> N;
ll a = sqrt(N);
while (N % a != 0)
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int inf = 10e17;
#define mod 1000000007
int findLowerBound(
vector<pair<int, int>> &arr,
pair<int, int> &p)
{
auto low = lower_bound(arr.begin(),
arr.end(), p);
return low - arr.begin();
}
int findUpperBound(
... | 0 | 51,666,440 |
#include <vector>
#include <string>
#include <iostream>
#include <queue>
#include <algorithm>
#include <functional>
#include <map>
#include <array>
#include <cmath>
long long PRIME = 1e9 + 7;
using namespace std;
vector<vector<int>> E;
int main(){
int A, B;
cin >> A >> B;
A = (A + 12) % 14;
B = (B + 12... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<long long>lve;
typedef vector<pair<ll,ll> > lvp;
typedef vector<vector<int> > ivve;
#define sp ' '
#define endl '\n'
#define F first
#define S second
#define pb push_back
#define mp make... | 0 | 96,315,596 |
#include<iostream>
using namespace std;
int main(){
int a,sum[2]={0};
for(int i=0;i<4;i++){
cin>>a;
sum[0]+=a;
}
for(int i=0;i<4;i++){
cin>>a;
sum[1]+=a;
}
cout<<(sum[0]<sum[1]?sum[1]:sum[0])<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
vector<ll>multiple;
void prime(int v){
multiple[0]=-1;
multiple[1]=-1;
for(int i=2; i<=v; i++){
if(multiple[i]!=0)continue;
for(int j=i*2; j<=v; j+=i){
multiple[j]=i;
}
}
}
int main(){
ll n;
cin >... | 0 | 47,482,044 |
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <algorithm>
#include <utility>
#include <functional>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const double EPS = 1e-9;
i... | #include<bits/stdc++.h>
using namespace std;
int main() {
int n,m,a,b,i,ans=0;
multiset<int> s;
map<int,multiset<int>> mp;
cin>>n>>m;
for(i=0;i<n;i++){
cin>>a>>b;
if(a<=m){
if(mp.count(a)) mp.at(a).insert(b);
else mp[a].insert(b);
}
}
for(i=1;i<=m;i++){
if(mp.count(i)) for(auto... | 0 | 528,088 |
#define _USE_MATH_DEFINES
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll LINF = 1e18;
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
#define prev asdprev
#define MP m... | #include<bits/stdc++.h>
using namespace std;
using Graph=vector<vector<int>>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
typedef long long ll;
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) ... | 0 | 57,149,789 |
#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>;
typedef vector<int> vi;
int main() {
int a, b;
cin >> a >> b;
int ans = 0;
for (int i = a; i <= b; i++) {
int first = i % 10;
int fifth = i / 10000 % 10;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9+7;
int main(){
string s;
cin >> s;
ll k;
cin >> k;
ll n = s.size()-1;
ll ans = 0;
bool same = true;
ll now = 1;
vector<ll> can;
bool all = true;
for(ll i = 0; i < n; i++){
if(s[... | 0 | 57,771,458 |
#include <iostream>
using namespace std;
int main()
{
unsigned n, money = 100000;
for (cin >> n; n; n--) {
money *= 1.05;
if (money % 1000) {
money = money - money % 1000 + 1000;
}
}
cout << money << endl;
return 0;
} | #include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
const int M = 39;
int main() {
int N;
cin >> N;
i64 S = (1ll << M) - 1;
i64 mod = -1;
vector<string> ans;
for(int i = 0; i < N; i++) {
... | 0 | 83,407,742 |
#include<bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define lli long long int
#define rep(i,n) for(lli i=0; i<n; i++)
#define loop(i, j, n) for(lli i=j; i<n; i++)
#define Max(a, b) ((a) > (b) ? (a) : (b))
#define Min(a, b) ((a) < (b) ? (a) : (b))
constexpr int INF = 0x3f3f3f3f;
const long long mod=1e9+7;
con... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using ll = long long;
#define rep(inc, bgn, end) for (int inc = bgn; inc < end; ++inc)
#define repe(inc, bgn, end) for (int inc = bgn; inc <= end; ++inc)
using namespace std;
int gcd(int a, int b) {
if (b == 0)
retur... | 0 | 38,842,280 |
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
typedef pair<int, int> pint;
int main() {
cin.tie(0);
... | #include <bits/stdc++.h>
#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(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9... | 0 | 19,878,139 |
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
using namespace __gnu_pbds;
using namespace std;
#define double long double
#define int long long
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#defi... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return 0;}
using namespace std;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const l... | 0 | 81,044,648 |
#include <iostream>
#include <algorithm>
#include <stack>
#include <string>
#include <queue>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <list>
#include <string.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <map>
#define INFTY (1<<30)
using namespace std;
int h = 0, a[2000000+1];
void maxH... | #include<bits/stdc++.h>
using namespace std;
string s, t;
int main(void){
cin >> s >> t;
if(s.size() < t.size()){
cout << "UNRESTORABLE" << endl;
return 0;
}
vector<string> r;
for(int i = 0; i < s.size()-t.size()+1; i++){
string p = s.substr(i, t.size());
for(int j = ... | 0 | 22,847,547 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define ff first
#define Shazam ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ss second
#define all(c) c.begin(),c.end()
#define endl "\n"
#define test() int t; cin>>t; while(t--)
#define fl(i,a,b) for(int i = a ; i <b ;... | #include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iostream>
#include <iostream>
#include <fstream>
#include <numeric>
#include <cstring>
#include <cassert>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <cmath>
#include <set>
#include <map>
#include <functi... | 0 | 1,064,740 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
vector<int> vec(n);
for (int i = 0; i < n; i++){
int p;
cin >> p;
vec.at(i) = p;
}
sort(vec.begin(),vec.end());
int ans = 0;
for (int i = 0; i < k; i++){
ans += vec.at(i);
}
cout << ans << endl;
} | #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <assert.h>
#include <numeric>
#include <time.h>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
using namespace std;
typedef long long ll;
#define rep(i,... | 0 | 39,052,882 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
typedef long long ll;
int main(){
string S;
cin >> S;
int N = S.length();
int sum0=0;
int sum1=0;
for (int i=0;i<N;i++){
if(i%2==0){
if(S[i]=='0') ++sum0;
else ++sum1;
}el... | #include <iostream>
using namespace std;
int main(){
while(1){
int a,b;
cin >> a >> b;
if(a==0 && b==0)break;
for(int i=0; i<a; i++) {
for(int j=0; j<b; j++) {
cout << "#";
}
cout << endl;
}
cout << endl;
}
} | 0 | 34,421,371 |
#include <iostream>
#include <cmath>
#include <cstdio>
using namespace std;
int main(){
ios::sync_with_stdio(false);
double x1, y1, x2, y2, dist;
cin >> x1; cin >> y1; cin >> x2; cin >> y2;
dist = sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
printf("%1.5f\n" , dist);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, init, n) for(int i = (int)(init); i < (int)(n); i++)
#define vi vector<int>
#define vl vector<long>
#define vvi vector<vector<int>>
#define vvl vector<vector<long>>
#define pint pair<int, int>
#define plong pair<long, long>
long INF = (1LL << 60);
int main() ... | 0 | 49,039,933 |
#include <bits/stdc++.h>
using namespace std;
using ll = uint64_t;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
ll n,tot1 = 0;
cin >> n;
vector<ll> a(n);
for(ll i = 0; i < n; ++i){
cin >> a[i];
tot1 ^= a[i];
}
for(ll i = 0; i < n; ++i) a[i] &= ~tot1;
ll rank = 0;
for(int i = 59; i >= 0; ... | #include<stdio.h>
int main()
{
int n, count=0;
scanf("%d", &n);
while(n != 0)
{
if(n % 10 == 7)
{
count++;
break;
}
n = n/10;
}
if(count == 1)
printf("Yes\n");
else
printf("No\n");
return 0;
} | 0 | 14,897,491 |
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> p(n), c(n);
for (int i = 0; i < n; ++i)
cin >> p[i];
for (int i = 0; i < n; ++i)
cin >> c[i];
ll ans = LLONG_MIN;
for (int i = 0; i < n; ++i) {
... | #include <iostream>
#include <string>
using namespace std;
int main(void){
int H, W;
string hori;
int i;
while(!cin.eof()){
cin >> H >> W;
if(!H && !W) return 0;
hori = string(W, '#');
cout << hori << endl;
hori = "#" + string(W - 2, '.') + "#";
for(i = 1;... | 0 | 28,427,953 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define get_unique(x) x.erase(unique(all(x)), x.end());
typedef long long ll;
typedef complex<do... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#includ... | 0 | 3,457,096 |
#include <iostream>
#include<iomanip>
#include <string>
#include<vector>
#include<algorithm>
#include<utility>
#include<queue>
#include<math.h>
#include<stack>
#include<set>
#include<map>
#include<ctime>
#include<cstdlib>
#define INF 1001001001001001001
#define rep(i,n,m) for(int i=n;i<m;i++)
using namespace std;
int m... | #include <bits/stdc++.h>
#define rep(i,m,n) for(int i=m;i<n;i++)
#define co(n) cout<<n<<endl
#define all(n) (n).begin(),(n).end()
#define pb(n,m) n.push_back(m)
#define pi(n,m) n.insert(n.begin(),m);
#define ee(n) n.erase(n.end()-1)
#define eb(n) n.erase(n.begin())
using namespace std;
typedef long long ll;
typedef uns... | 0 | 99,144,761 |
#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... | #include <iostream>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
using namespace std;
int main(){
int a;
int b;
int c;
int d;
cin >> d;
for (int i = 0; i < d; i++){
cin >> a >> b >> c;
int e = a*a;
int f = b*b;
int g = c*c;
if ( e + f== g || e + g == f || f + g... | 0 | 46,512,696 |
#include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<functional>
#include<vector>
#include<math.h>
using namespace std;
typedef long long int lli;
int main()
{
double x1, x2, x3, xp;
double y1, y2, y3, yp;
double abc[3];
while (cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> xp >> yp) {
a... | #include<iostream>
using namespace std;
int main() {
int sum = 0;
char number[1001];
while (1) {
cin >> number;
sum = 0;
for (int i = 0; i < 1000; i++) {
if (number[i] == 0)
break;
sum += number[i] - '0';
}
if (sum == 0)
break;
else
cout << sum << endl;
}
return 0;
} | 0 | 17,046,462 |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a; i< (int)(b); ++i)
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
typedef long double ld;
using ll=long long;
using namespace std;
const int mod=1e9+7;
const ll inf = 1LL << 60;
const ld pi = (acos(-1));
template<class T>bool chmax(T ... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long int;
const ll INF = 1001001001001001001;
int main(){
int n, k;
cin >> n >> k;
vector<int> p(n+1);
for(int i = 1; i <= n; i++) cin >> p[i];
vector<int> c(n+1);
for(int i = 1; i <= n; i++) cin >> c... | 0 | 2,204,912 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define x first
#define y second
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tr... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define rep(i,n) for(int i = 0;i < (n); i++)
#define LM 1000000000000000000
int main() {
int n;
ll ans = 1;
int chk = 0;
ll buf;
cin >> n;
vector<ll> a(n);
rep(i, n) {
cin >> a[i];
if (a[i] == 0)chk = 1;
}
if (chk == 0) {
rep(i, n) {
i... | 0 | 13,350,467 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
string s;
cin >> s;
string t0, t1;
for(long long i = 0; i < s.size(); i++){
if(i % 2 == 0){
t0.push_back('0');
t1.push_back('1');
}
else{
t0.push_back('1');
t1.p... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef long double ld;
const double pi=acos(-1.0);
const ll mod=pow(10,9)+7;
const ll INF=pow(2,31)-1;
typedef pair<int,int> P;
typedef vector<int> vi;
ll gcd(ll a,ll b){
ll v0=a,v1=b,v2=a%b;
while(v2!=0)... | 0 | 23,032,991 |
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main(){
int n;
cin >> n;
int hanako = 0;
int taro = 0;
for(int i=0;i<n;i++) {
string str1, str2;
cin >> str1 >> str2;
if(str1.compare(str2) == 0){
hanako++;
taro++;
}
else... | #include <bits/stdc++.h>
using namespace std;
long long int w[51];
long long int b[51];
long long int p[51];
void burg(int n){
w[0]=1; b[0]=0; p[0]=1;
for(int i=0;i<n;i++){
b[i+1]=2+2*b[i];
p[i+1]=1+2*p[i];
w[i+1]=b[i+1]+p[i+1];
}
}
long long int answer(long long int y,int level){
... | 0 | 21,592,314 |
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<deque>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
const double PI = 3.14159265... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | 0 | 69,321,408 |
#include<bits/stdc++.h>
using namespace std;
const int MaxN = 2e5 + 25;
const int MOD = 1e9 + 7;
void make(vector <long long> & v)
{
map<long long, int> mp;
for(long long x : v)
mp[x];
int cur = 0;
for(map<long long, int>:: iterator it = mp.begin(); it != mp.end(); ++it)
it -> second = +... | #include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
size_t ldistance(string s, string t) {
size_t slen=s.length(), tlen=t.length();
vector<vector<size_t>> dp(slen+1, vector<size_t>(tlen+1));
for (size_t i=0; i<=slen; ++i)
dp[i][0] = i;
for (size_t j=0;... | 0 | 22,023,354 |
#include <bits/stdc++.h>
#define For( i, j, k ) for( int i = j; i <= k; ++i )
using std::vector;
using std::pair;
using std::cin;
using std::cout;
typedef long long LONG;
typedef int INT;
const INT N = 100100;
char c[ N ];
INT n, ans[ N ];
void Print( )
{
For( i, 1, n )
cout << ( ans[ i ] ? 'W' : 'S' );
return;
}
v... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#define int long long
#define MOD7 1000000007
#define ... | 0 | 7,342,607 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n, d;
cin >> n >> d;
vector<vector<int>> x(n, vector<int>(d));
rep(i, n)rep(j, d) cin >> x[i][j];
vector<int> check(200);
for (int i = 1;... | #include <iostream>
#include <string>
int main(int argc, char const *argv[])
{
int a, b, c;
std::string answer = "No";
std::cin >> a >> b >> c;
if (a<b&&b<c) {
answer = "Yes";
}
std::cout << answer << std::endl;
return 0;
} | 0 | 37,449,140 |
#include <iostream>
#include <math.h>
using namespace std;
int main(){
int n, m, p;
while (1){
cin >> n >> m >> p;
if (n == 0 && m == 0 && p == 0) break;
int sum = 0;
int winner;
for (int i = 1; i <= n; i++){
int c;
cin >> c;
if (i == m){
winner = c;
}
sum += c;
}
if (winner == 0){
... | #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... | 0 | 52,785,546 |
#include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
using namespace std;
int main() {
int N;
string* W;
bool key = true;
cin >> N;
W = new string[N];
for (int i = 0; i < N; i++) {
cin >> W[i];
}
for (int i = 0; i < N... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p_ll;
typedef vector<pair<ll, ll>> vec_p;
#define ture ture
#define flase false
#define falg flag
#define REP(i, x) for (ll i = 0; i < (ll)(x); i++)
#define REPS(i, x) for (ll i = 1; i <= (ll)(x); i++)
#define RREP(i, x) for (... | 0 | 59,487,583 |
#include<iostream>
#include<vector>
using namespace std;
typedef long long li;
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) { cout << t; if (sizeof...(ts)) cout << " "; print(ts.... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int (i)=0;i<(n);i++)
#define REP(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define MOD 1000000007
#d... | 0 | 42,298,297 |
#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... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <queue>
#include <map>
#include <numeric>
#include <unordered_map>
#include <iomanip>
#include <functional>
#include <bitset>
#include <complex>
#define rep(i, n) for(int i = 0; i < (i... | 0 | 8,911,289 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | #include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
int main(){
long long n, m;
cin >> n >> m;
vector<vector<long long> > s(m);
for(long long i = 0; i < m; i++){
long long k;
cin >> k;
for(long long j = 0; j < k; j++){
long long a;
... | 0 | 65,674,958 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int ans = B - A + 1;
for (int i = A; i <= B; i++) {
string s = to_string(i);
int j = 0, k = s.size() - 1;
while (j <= k) {
if (s.at(j) == s.at(k)) {
j++;
k--;
} else {
ans--;
... | #include <iostream>
using namespace std;
#define DEBUG
long long seriesXor(long long m, long long n)
{
long long ans = m;
for (long long i = m + 1; i <= n; i++) {
ans ^= i;
}
return ans;
}
long long calculate(long long x)
{
if (x % 4 == 0) {
return x;
} else if (x % 4 == 1) {
... | 0 | 88,523,129 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... | #include<bits/stdc++.h>
using namespace std;
int main() {
string s; cin >> s;
for (int i = 0; i < 7; i++)
{
if(s.substr(0, i)+s.substr(s.size() - 7 + i) == "keyence") {
cout << "YES" << endl;
return 0;
}
}
if(s.substr(0, 7) == "keyence") cout << "YES" << endl;... | 0 | 46,104,151 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using LL = long long;
using P = pair<int,int>;
int main(){
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int x3, y3, x4, y4;
x3 = x2 - (y2 - y1);
y3 = y2 + (x2 - x1);
x4 = x1 - (y2 - y1);
y4 = y1 + (x2 - x1);
co... | #include<bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define RREP(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 FORD(i, m, n) for(int (i) = (m); (i) >= (n); (... | 0 | 6,597,629 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using ld = long double;
long double const pi = std::acos(-1.0L);
typedef pair<int,int> P;
const int INF = 1001001001;
bool G[10][10];
int dfs(int v,int n, bool visited[10]){
bool ok = true;
rep(i,n){
... | #include <iostream>
#include <map>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
int W,H;
bool box_is_in_range(int p, int q){
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
if(p+i < 1 || q+j < 1 || p+i > W || q+j > H) return false;
}
}
return true;... | 0 | 73,303,484 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y... | #include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
typedef long long ll;
typedef pair<bool, int> P;
int W, H;
ll costw[100000 + 10], costh[100000 + 10];
pair<ll, P> sortlist[100000 * 2 + 10];
int main() {
cin >> W >> H;
for (int i = 0; i < W; i++) {
cin >> costw[i];
sortlist[i] = mak... | 0 | 5,866,846 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
map<int,int> m;
for(int i=0; i<n; i++){
int a;
cin >> a;
m[a]++;
}
vector<int> use;
for(auto p:m){
if(p.second>=4){
use.push_back(p.first);
... | #include<bits/stdc++.h>
#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,a,b) for(int i=a;i>=b;--i)
#define mem0(x) memset(x,0,sizeof(x))
#define meminf(x) memset(x,0x3f,sizeof(x))
#define VI vector<int>
#define VL vector<ll>
using namespace ... | 0 | 13,620,435 |
#include<bits/stdc++.h>
using namespace std;
bool visited[3][3];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int arr[3][3];
memset(visited,sizeof(visited),false);
map<int,int>track;
map<int,int>row;
map<int,int>column;
for(int i=0;i<3;i++)
{
for(int j=0;j<3;... | #line 2 "/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp"
#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx2")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>... | 0 | 27,879,062 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int i,j,cnt=0;
int n,k;
cin>>n>>k;
cout<<n-k+1;
} | #include<iostream>
#include<cstdio>
#include<vector>
#define INF 99999999999999999
#define ll long long
using namespace std;
struct edge
{
int from;
int to;
int cost;
};
const int MAX_N = 100;
const int MAX_M = 10000;
ll d[MAX_N][MAX_N];
edge es[MAX_M];
bool flag;
void shortest_path(int n,int m,int s)
{
in... | 0 | 34,506,565 |
#include <iostream>
#include <algorithm>
#include <stack>
#include <string>
#include <queue>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <string.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <map>
#define INFTY (1<<30)
#define MAX 100000000
using namespace ... | #include<iostream>
#include<iomanip>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<set>
#include<map>
#include<queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define exf(x) for(auto&& tmp : x) { cout << tmp << endl; }
#define PI 3.14159265358979323846264338327950288
const int MOD{ int(1... | 0 | 55,850,473 |
#include<bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pb push_back
#define mod 1000000007
#define mod1 1000000009
#define hell 998244353
... | #include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()... | 0 | 87,595,771 |
#include <bits/stdc++.h>
using namespace std;
#define DEBUG_MODE
#define endl '\n'
#ifdef DEBUG_MODE
#define DEBUG(X) debug_func(X, #X)
#define DEBUG_ENDL endl << flush
#define DEBUG_SEPARATOR_LINE cout<<"=================\n"
#else
#define DEBUG(X) 0
#define DEBUG_ENDL 0
#define DEBUG_SEPARATOR_LINE 0
#endif
#define AL... | #include <iostream>
using namespace std;
int main() {
int row = 9;
int col = 9;
for (size_t i = 1; i <= row; i++)
{
for (size_t j = 1; j <= col; j++)
{
cout << i << "x" << j << "=" << i*j << endl;
}
}
return 0;
} | 0 | 89,468,622 |
#include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358
typedef long long ll;
typedef long double ld;
int main() {
int n, m, x, ans = 1000000000, i, j;
cin >> n >> m >> x;
vector<vector<int>> set(n, vector<int>(m));
vector<int> skills(m), cost(m);
for(i = 0; i < n; i++) {
cin >> cost[i];
for(j... | #include <bits/stdc++.h>
int main(){
int N;
std::cin >> N;
std::vector< int > A(N);
for(int i=0; i<N; i++){
std::cin >> A[i];
}
std::vector< bool > b(N, false);
std::vector< bool > s(N, false);
int best = 1e9;
bool up = false;
for(int i=0; i<N; i++){
if(!up && bes... | 0 | 76,002,474 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int64_t a, b, c, k, sum = 0;
cin >> a >> b >> c >> k;
if (a >= k )sum = k;
else if (a + b >= k)sum = a;
else{
sum = a - (k - a - b);
}
cout << sum << '\n';
return 0;
} | #include <iostream>
#include <cstdio>
#include <vector>
#include <list>
#include <algorithm>
#include <cmath>
#include <stack>
#include <set>
using namespace std;
#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
#define FOR(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
#define PUSH(n,v) for(int i=0; i<(n); i++) {int j; cin >>... | 0 | 30,416,119 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++) cin >> A.at(i);
vector<int> B(N + 10, 0);
for (int i = 0; i < N; i++) B.at(A.at(i))++;
sort(B.begin(), B.end());
reverse(B.begin(), B.end());
int ans = 0;
for (int i = 0;... | #include <bits/stdc++.h>
using namespace std;
#define int long long
struct Combination {
int mod;
vector<int> fact;
vector<int> invf;
vector<vector<int> > part;
Combination(int sz, int mod) : fact(sz+1), invf(sz+1), mod(mod) {
fact[0] = 1;
for ( int i = 1; i < (int)fact.size(); i++ ) {
fact[... | 0 | 7,427,530 |
#include<iostream>
#include<fstream>
#include<cstdio>
#include<string>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
#include<deque>
#include<sstream>
#include<cmath>
#include<algorithm>
#include<iomanip>
#include<functional>
#include<array>
#include<set>
#include<map>
#include<climits>
#include<nu... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
typedef pair<pii, pii> piipii;
#define mp make_pair
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define eb emplace_back
string s[55];
i... | 0 | 79,861,272 |
#include <bits/stdc++.h>
#define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,NAME,...) NAME
#define pr(...) cerr<< GET_MACRO(__VA_ARGS__,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__) <<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n, h, maxA = 1;
cin >> n >> h;
int b[n];
for (int a, i = 0; cin >> a >> b[i]; ++i) {
maxA = max(maxA, a);
}
sort(b, b + n);
for (int i = 0; i < n; ++i) {
if (b[i] >= maxA) {
int result = 0;
for (int j = n - ... | 0 | 69,014,737 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i,n) for(ll i=0;i<n;i++)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool chmax(T &a, T b){i... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
vector <int> n;
int t;
for(int i=0;i<4;i++){
cin>>t;
n.push_back(t);
}
sort(n.begin(),n.end());
if(n[0]==1&&n[1]==4&&n[2]==7&&n[3]==9){
cout<<"YES"<<endl;
}else{
cout<<"NO"<<endl;
}
return 0;
} | 0 | 2,831,061 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int>vec(N),dp(N);
for(int i=0; i<N; i++){
cin >> vec[i];
}
dp[0] = 0,dp[1] = abs(vec[1]-vec[0]);
for(int i=2; i<N; i++){
dp[i] = min(dp[i-2]+abs(vec[i]-vec[i-2]),dp[i-1]+abs(vec[i]-vec[i-1]));
}
cout << dp[N-1] ... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#i... | 0 | 26,834,758 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
const int MAX_N = 1e5;
int N;
int A[MAX_N];
void solve() {
int idx[MAX_N];
for (int i = 0; i < N; i++) {
idx[i] = i;
}
sort(idx, idx + N, [](in... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const long long INF = 1e18;
# define len(x) ((int)(x).size())
# define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i, n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(int i=((int)(n)-1)... | 0 | 28,879,536 |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <list>
#include <numeric>
#define rep(i,n) for(int i=0;i<n;i++)
#define all(x) (x).begin(),(x).end()
using namespace std;
int a, b, c, n;
string s;
int main()
{
cin>>n;
cout<<180*(n-2)<<en... | #include <algorithm>
#include <deque>
#include <iostream>
#include <list>
#include <string>
int main(int argc, char const *argv[])
{
int n;
std::cin >> n;
std::string command;
int key;
std::deque<int> l;
for (int i = 0; i < n; i++) {
std::cin >> command;
if (command[0] == 'i') {
... | 0 | 90,738,108 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
for (int i=0; i<(int)S.size(); i++) {
if (S[i]=='1') {
cout << '9';
}
else {
cout << '1';
}
}
cout << endl;
} | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 0 | 20,915,502 |
#include <iostream>
#include <cstdlib>
#include <string>
#include <algorithm>
#include <stdio.h>
using namespace std;
int main(){
char s;
while(1){
scanf("%c", &s);
if(islower(s) != 0){
s = toupper(s);
}else if(isupper(s) != 0){
s = tolower(s);
}
printf("%c", s);
if(s == '\n')break;
}
return 0;
} | #include "bits/stdc++.h"
using namespace std;
struct UF {
vector<int> data;
UF(int size) : data(size, -1) { }
bool unite(int x, int y) {
x = root(x); y = root(y);
if (x != y) {
if (data[y] < data[x]) swap(x, y);
data[x] += data[y]; data[y] = x;
}
return x != y;
}
bool find(int x, int y) {
return ro... | 0 | 7,550,674 |
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
using namespace std;
int main()
{
int n;
double ax, ay, bx, by,... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll n, k;
cin >> n >> k;
cout << k * (ll)pow(k - 1, n - 1);
} | 0 | 14,943,412 |
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
t... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b){
return a/gcd(a,b) * b;
}
ll func2(ll n){
ll res = 0;
while(n%2 == 0){
n /= 2;
res++;
}
return... | 0 | 100,479,113 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define rer(i, a, b) for (int i = (int)a; i <= (int)b; ++i)
#define each(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define all(v) v.begin(), v.end()
#define mset(... | #include "bits/stdc++.h"
#define all(v) v.begin(),v.end()
#define SZ(x) (int)x.size()
#define endl "\n"
#define thunder ios::sync_with_stdio(false);cin.tie(0);cout<<fixed<<setprecision(15);
using namespace std;
typedef long long int ll;
#ifdef ONLINE_JUDGE
#define debug(...)
#else
#define debug(...) cerr << "[" << #__V... | 0 | 91,742,116 |
#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 mt make_tuple... | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
... | 0 | 23,702,548 |
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
using namespace std;
template<class t> inline t read(t &x){
char c=getchar();bool f=0;x=0;
while(!isdigit(c)) f|=c=='-',c=getchar();
while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
if(f) x=-x;return x;
}
template<... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
typedef long long ll;
const ll mod = 1e9+7;
int main(){
ll n,k;
cin>>n>>k;
ll st = 0;
ll en = n;
ll sts = 0;
ll sen = 0;
ll ans = 1;
for(int i=1;i<=n;i++){
sts+=st;
sen+=e... | 0 | 21,299,805 |
#include <bits/stdc++.h>
using namespace std;
signed main()
{
int a,b,c,d;
cin>>a>>b>>c>>d;
printf(abs(c-a)<=d || abs(c-b)<=d && abs(b-a)<=d?"Yes":"No");
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <functional>
using namespace std;
#de... | 0 | 89,000,946 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define frw(i, a, b) for(int i = a; i < b; i++)
#define fi first
#define se second
#define pb push_back
#define in insert
#defin... | #include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#define rep(i, n) for(i=0; i<n; i++)
using namespace std;
int main() {
int i, n;
cin >> n;
vector<int> b;
rep(i, n-1){
int x;
cin >> x;
b.push_back(x);
}
int sum = b[0];
for(i=1; i<n-1; i++){
... | 0 | 7,148,732 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll N;
cin >> N;
ll ans =0;
for(int i=0;i<N;i++){
ans += i;
}
cout << ans << endl;
return 0;
} | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<mem... | 0 | 95,537,803 |
#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i = (s); i < (n); i++)
#define ... | #include <bits/stdc++.h>
#define REP( i , nn ) for(int i = 0 ; i < (int) nn; i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
template <class T>
void print_vect(std::vector<T> v){
for(int i = 0 ; i < v .size(); i++) cout << v[i] << " ";
cout << endl;
}
void solve(){... | 0 | 17,522,659 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int n,a,b;
cin>>n>>a>>b;
vector<int> v(3);
for(int i=0;i<n;i++){
int p;
cin>>p;
v[(p<=a)+(p<=b)]++;
}
cout<<*min_element(v.begin(),v.end())<<"\n";
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N, H;
cin >> N >> H;
vector<int> a(N), b(N);
for (int i = 0; i < N; i++)
{
cin >> a.at(i) >> b.at(i);
}
sort(a.rbegin(), a.rend());
sort(b.rbegin(), b.rend());
int res = 0;
int i = 0;
while (i < N && a.at(... | 0 | 66,151,645 |
#include <iostream>
using namespace std;
int main(){
int x,y;
while (true) {
cin >> x >> y;
if(x==0 && y==0){
break;
}
for(int i=0;i<x;i++){
for(int j=0;j<y;j++){
cout << "#";
}
cout << endl;
}
cout <... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int,int>;
const long long inf = 1000000001;
const double PI = 3.14159265358979323846;
int keta(int a){
int count = 0;
while(a>0){
a /=10;
count++;
}
return... | 0 | 13,080,583 |
#include <bits/stdc++.h>
using namespace std;
#define sz size
#define pb push_back
const int N = 1e5 + 123;
int n, m, sum, cnt[N];
int main() {
cin >> n >> m;
for(int i = 1; i <= m; ++i) {
int l, r;
cin >> l >> r;
cnt[l]++;
cnt[r]--;
}
for(int i = 1; i < n; ++i) {
sum += cnt[i];
if(sum % 2 != 0) {
co... | #include <bits/stdc++.h>
using namespace std;
typedef vector< vector<int> > vvi;
typedef vector< vector<bool> > vvb;
typedef vector< vector<char> > vvc;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef long long ll;
int main(){
int a,b;
cin >> a >> b;
int m,n;
for(int i=... | 0 | 3,873,089 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
signed main() {
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typ... | 0 | 33,106,705 |
#include <iostream>
using namespace std;
int main (){
int len;
int wh;
int area;
int output;
cin >> len;
cin >> wh;
area = len*len;
output = area - wh;
cout << output;
return 0;
} | #include <iostream>
using namespace std;
char dic[64][2]={""};
int main(){
int n,i,tail;
char s;
while(1){
tail=0;
cin>>n;
if(!n) return 0;
while(n--){
cin>>dic[tail][0];
cin>>dic[tail++][1];
}
cin>>n;
while(n--){
for(cin>>s,i=0;i<tail;i++) if(s == dic[i][0]){ cout<<dic[i][1]; break;}
if... | 0 | 54,193,996 |
#include <vector>
#include <list>
#include <map>
#include <climits>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <c... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
const int INF = 100000000... | 0 | 87,096,090 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k, r, s, p; cin >> n >> k >> r >> s >> p;
string t; cin >> t;
vector<char> result(n, 'e');
int ans = 0;
for (int i = 0; i < t.size(); i++) {
if (i <= k - 1) {
if (t[i] == 'r') {
ans += p;
result[i] = 'p';
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
using namespace std;
using ll = int64_t;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int n, m, R;
cin >> n >> m >> R;
vi r(R);
rep(i, R) {
cin >> r[i];
--r[i];
}
sort(r.begin... | 0 | 78,720,639 |
#include <bits/stdc++.h>
#define rep(i,a,b) for (int i = (a); i < (b); i++)
#define REP(i,n) rep(i,0,n)
using namespace std;
int main()
{
int h,w;
while(cin>>h>>w)
{
if(w==0)return 0;
REP(i,h)
{
REP(j,w)cout<<"#";
cout<<endl;
}
cout<<endl;
... | #include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
int mod=1e9+7;
int po(int x,int y,int m) { if (y==0) return 1; int t=po(x,y/2,m)%m; t=(t*t)%m; if (y&1) return (t*x)%m; return t%m; }
const int mx=1000001;
vector<bool> prim(mx,true);
void seive(){
for (int p = 2;p*p<=1000001;... | 0 | 38,186,500 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int x = n;
int sum = 0;
for (int i = 0; i < 9; i++){
sum += x % 10;
x /= 10;
}
if (n % sum == 0){
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main()
{
ll n,a,t[100005]={},ans[2]={},r=0,k;
cin>>n;
map<ll,ll>m;
for(ll i=0;i<n;i++)
{
cin>>a;
m[a]++;
}
vector<ll>v;
for(auto i=m.begin();i!=m.end();i++)
{
ll s=i->second;
if(s>=4)r=i->first;
if(s>... | 0 | 86,442,885 |
#include <iostream>
#include <stdio.h>
#include <string>
#include <cctype>
using namespace std;
int main() {
char c;
int numbers[26] = {0};
int num;
while (cin >> c) {
if (isupper(c)) c = tolower(c);
num = c - 'a';
numbers[num]++;
}
for (int i = 0; i < 26; i++) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
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 (a>b) { a=b; return 1; } return 0; }
#define rep(i, n) REP(i, 0, n)
#define rep... | 0 | 72,580,176 |
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <queue>
#include <bitset>
#include <cassert>
#include <iomanip>
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF=1e+18;
const int MOD=1e+9+7;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define REP2(i,a,b) for(ll i=a;i<(ll)(b);i++)
#define REPD2(i,a,b) for(ll i=a;i>(ll)(b);i--)
template<class T>
vector<T> make_v... | 0 | 77,128,166 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define forn(i, a, b) for (int i = a; i < b; ++i)
#define SZ(x) int(x.size())
#define pb push_back
#define F first
#define S second
void dbg_out() { cerr << endl; }
template <typename Head, typename... Tail>
void dbg_out(Hea... | #include <iostream>
#include <string>
using namespace std;
constexpr int MAX=2000000;
constexpr int INFTY=(1<<30);
int H, A[MAX+1];
int left(int i){ return i*2; }
int right(int i){ return i*2+1; }
int parent(int i){ return i/2; }
void maxHeapify(int i){
int l=left(i);
int r=right(i);
int largest;
if(l<=H &&... | 0 | 29,255,337 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int ratea,rateb;
int p=0;
cin >> ratea ;
cin >> p ;
rateb = (p*2)-ratea;
cout << rateb << endl;
} | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#include <i... | 0 | 6,363,181 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
int cnt[100100] = {};
for(int i = 0; i < n; i++) {
int a; cin >> a;
if(a > 0) cnt[a-1]++;
cnt[a]++;
cnt[a+1]++;
}
cout << *max_element(cnt, cnt + 100100) << endl;;
cout << endl;
} | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
long mod = (long) 1e9 + 7;
long factorials[500001];
int pre_factorials(int n){
factorials[0] = 1;
for (int i = 0; i... | 0 | 70,928,270 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<int> a(n);
for (int i = 0; i < n; i++) {
scanf("%d",&a[i]);
}
int j = -1;
long long xor_sum = 0, sum = 0;
long long ret = 0;
for (int i = 0; i < n; i++) {
while (j + 1 < n && (xor_sum^a[j + 1]) == sum + a[j + 1]) {
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <csignal>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using Graph = std::vector<std::vector<int>>;
u... | 0 | 25,750,603 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.