code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostr... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forin(in, n) for(int i=0; i<n; i++) cin>>in[i]
#define forout(out, n) for(int i=0; i<n; i++) cout<<out[i]<<endl
int main(){
int K, S; cin>>K>>S;
int cnt=0;
for(int x=0; x<=K; x++){
for(int y=0; y<=K; y++){
if(x+ y... | 0 | 97,398,159 |
#include <bits/stdc++.h>
using namespace std;
const int Nmax = 1e5 + 5;
int n, i, x, y;
bitset<Nmax> erased, used;
vector<int> v[Nmax];
bool dfs(int node, int dad)
{
used[node] = 1;
for(auto it : v[node])
if(!used[it] && !dfs(it, node)) return 0;
if(!erased[node])
{
if(erased[dad] || !da... | #include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define lli long long int
#define rep(i,n,z) for(int i=z;i<n;i++)
#define rrep(i,z) for(int i=z;i>=0;i--)
#define nl cout<<endl
#define vi vector<int>
#define vlli vector<long long int>
#define umap un... | 0 | 76,665,751 |
#include<stdio.h>
#include<iostream>
using namespace std;
int main(){
long long int a[10],temp,i,j;
for(i=0;i<10;i++){
cin>>a[i];
}
for(i=0;i<10;i++){
for(j=0;j<10-i-1;j++){
if(a[j]>a[j+1]){
temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <iostream>
using namespace std;
#define rp(i,t) for(int i=0;i<(t);i++)
#define rep(i,s,t) for(int i=(s);i<=(t);i++)
#define rsp(i,s,t) for(int i=(s);i<(t);i++)
#define rrp(i,t,s) for(int i=(t);i>=(s);i--)
#define rcp(i,s,b,d) for(int i=... | 0 | 18,178,759 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll a,b,c,k;
cin >> a >> b >> c >> k;
cout << k - (k > a ? k - a : 0 ) - (k > a + b ? k - (a + b) : 0) << endl;
} | #include <iostream>
using namespace std;
#define REP(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define M 1000003
int T[M] = {0};
int h1(int key)
{
return key % M;
}
int h2(int key)
{
return 1 + (key % (M - 1));
}
int h(int key, int i)
{
return (h1(key) + i * h2(key)) % M;
}
void insert(int key)
{
int j, i = 0;
... | 0 | 30,786,879 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
vector<int> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
sort(v.begin(), v.end());
double ans;
double prev = (double)v[0];
for (int i = 1; i < n; i++) {
ans = (double)(prev + v[i]) / 2;
prev = ans;
}
... | #include<bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for(ll i = 0; i < n; i++)
const ll INF = 1LL << 60;
int main(){
int N; cin >> N;
map<string, int> m;
rep(i, N){
string str;
cin >> str;
... | 0 | 83,584,952 |
#include<bits/stdc++.h>
#define int long long
using namespace std ;
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL) ;
int k ;
string s ;
cin >> k >> s ;
if(s.size() <=k)
cout << s ;
else
cout << s.substr(0, k ) << "..." ;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
#define INF __INT32_MAX__
int main() {
int A, B;
cin >> A >> B;
vector<vector<char>> G(100, vector<char>(100));
for (int i = 0; i... | 0 | 68,198,075 |
#include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#in... | #include<iostream>
#include<vector>
using namespace std;
class DisjointSet{
public:
vector<int> r, p;
DisjointSet(){}
DisjointSet(int num){
r.resize(num, 0);
p.resize(num, 0);
for(int i=0 ; i<num ; ++i) makeSet(i);
}
~DisjointSet(){}
void makeSet(int x){
p[x] = x;
... | 0 | 62,211,956 |
#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define int long long
#define puts(x) cout<<x<<endl
#define inf 243000000000000001
#define minf -243000000000000001
signed main(){
int n;
cin>>n;
vector<int>v(n);
vector<int>ans(n);
for(int i=0;i<n;i++){
cin>>v[i];
}
an... | #include<iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main(){
int flag = 0;
string s, p, ring;
getline(cin, s);
getline(cin, p);
ring = s + s;
for(int i = 0; i < 100; i++ ){
if(ring[i] == '\0' || flag == 1) break;
if(ring[i] == p[0]){
flag = 1;
for(int j = 1; ... | 0 | 58,418,753 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if(a*b==15) cout<<"*";
if(a+b==15) cout<<"+";
if(a+b!=15&&a*b!=15) cout<<"x";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v... | 0 | 97,628,575 |
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#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 repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pu... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool lamp_check(bitset<10> s,int n,int m,vector<vector<int>> &array,vector<int> &p){
for(int i=0;i<m;i++){
int count = 0;
for(int j=0;j<(int)array.at(i).size();j++){
int num = array.at(i).at(j);
if(s.test(num... | 0 | 40,054,020 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b>> c;
cout<< min(min(a+b,b+c), min(a+b,a+c));
return 0 ;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
const int N = 2e5 + 10, OO = 0x3f3f3f3f, mod = 1e9 + 7;
#define PI acos(-1)
#define clr(arr, val) memset(arr, val, sizeof(arr))
#define loop(i, n) for (int i = 0; i < int(n); i++)
#de... | 0 | 41,911,549 |
#include<map>
#include<set>
#include<cmath>
#include<stack>
#include<queue>
#include<deque>
#include<ctime>
#include<vector>
#include<bitset>
#include<string>
#include<cstdio>
#include<numeric>
#include<utility>
#include<sstream>
#include<cstdlib>
#include<iomanip>
#include<cstring>
#include<iostream>
#include<algorith... | #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... | 0 | 33,137,303 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int ans=0;
for(int i=1;i<=n;i++){
if(1<=i && i<=9) ans++;
else if(100<=i && i<=999) ans++;
else if(10000<=i && i<=99999) ans++;
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) {
re... | 0 | 62,684,133 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int A;
cin >> A;
cout << (A * 800) - ((A / 15) * 200) << endl;
} | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <vector>
#include <sstream>
#include <string>
#include <cstdio>
#include <stack>
#include <queue>
#include <list>
#include <numeric>
#include <fstream>
#define NDEBUG
#include <cassert>
using namespace std;
#define TEST
#ifdef T... | 0 | 6,121,187 |
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ll long long
#define ld long double
#define fi first
#define se second
#define all(arr) arr.begin(), arr.end()
#define rep(i, n) for (int i = ... | #include <numeric>
#include<iostream>
#include<set>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#include<algorithm>
#include <sstream>
#include<string>
#include <cmath>
#include <iomanip>
#include <string>
#include<list>
#include<string.h>
#include<memory.h>
using namespace std;
#define inf 100000000... | 0 | 12,220,045 |
#include <iostream>
#include <string>
#include <cctype>
using namespace std;
string sort1(string str)
{
int i = 0, j;
while (i < str.size() - 1)
{
j = i + 1;
while (j < str.size())
{
if (str[i] > str[j])
{
char temp;
temp = str[i];
str[i] = str[j];
str[j] = temp;
}
j++;
}
i++;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define debug(x) cerr << #x << " = " << x << endl
int main(int qtd, char* nome[])
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
double l = n/3.0;
cout << fixed << setprecision(12) << l*l*l << endl;
return 0;
} | 0 | 39,202,900 |
#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <ios>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <map>
using namespace std;
typedef long long ll;
int main() {
int N[4];
for(int i=0; i<4; i++){
cin >> N[i];
}
int count[4]={};
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
int n;
int a[1000001];
int inp[200001];
void solve(){
cin >> n;
for (int i = 0; i < 1000001; i++)
{
a[i] = 0;
}
int tmp;
for (int i = 0; i < n; i++)
{
cin >> inp[i];
}
sort(inp, inp+n)... | 0 | 87,065,781 |
#include <iostream>
#include <vector>
#include <algorithm>
#define vi vector<int>
#define REP(n) for(int i=0;i<n;i++)
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
vi v;
v.push_back(a);
v.push_back(b);
v.push_back(c);
sort(v.begin(),v.end());
REP(v.size()){
if(i) cout<<" "<<v... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>... | 0 | 11,345,866 |
#include <bits/stdc++.h>
using namespace std;
using VS = vector<string>; using LL = long long;
using VI = vector<int>; using VVI = vector<VI>;
using PII = pair<int, int>; using PLL = pair<LL, LL>;
using VL = vector<LL>; using VVL = vector<VL>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).rb... | #include <iostream>
#include <cmath>
#include <iomanip>
#include <string>
#include <vector>
using namespace std;
float calc_crossZ(vector<float> v1, vector<float>v2){
float result = v1[0]*v2[1] - v1[1]*v2[0];
return result;
}
bool same_sign(float a, float b){
if(a<0 && b<0){
return true;
}else if(a>0 && b>0... | 0 | 66,490,236 |
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int a,b,c;
cin >> a >> b >> c;
if (c >= a && c <= b) {
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
} | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<deque>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#include<functional>
#include<unordered_set>
#include<iomanip>
#include<cassert>
#inc... | 0 | 39,511,696 |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(long long i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,N-1,0)
#define RREPS(i,n) RFOR(i,N,1)
#define int long long
#define mp make_pair
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i, n) for (int i = 0; i < n; i++)
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = { 1, 0, -1, 0 }, dy[4]... | 0 | 90,942,614 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
const int mod=1e9+7;
int ... | #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 | 47,898,236 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int A, B, C;
cin >> A >> B >> C;
int D = A + B;
if (D > C || D == C) {
cout << "Yes" << endl;
}
else if (D < C) {
cout << "No" << endl;
}
} | #include<iostream>
#include<algorithm>
int main(){
long long N,M,m;
std::cin >> N >> m >> M;
if(m>M || (N==1 && m!=M)){
std::cout << "0\n";
return 0;
}
std::cout << 1ll+std::max((M-m)*(N-2),0ll) << "\n";
return 0;
} | 0 | 43,564,327 |
#include <iostream>
#include <string>
using namespace std;
int main(){
int n,tc=0,hc=0;
string taro,hanako;
cin >> n ;
for (int i=0;i<n;i++){
cin >> taro >> hanako ;
if(taro>hanako)tc+=3;
else if(taro<hanako)hc+=3;
else {
tc++;
hc++;
}
}
cout << tc << " " << hc << endl;
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;... | 0 | 42,317,990 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long A,B;
cin>>A>>B;
cout<<lcm(A,B)<<endl;
} | #include <algorithm>
#include <cstring>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <map>
#define FOR(i,k,n) for(int (i) = (k); (i) < (n); ++(i))
#define rep(i,n) FOR(i,0,n)
using namespace std;
typedef pair<int, int> i_i;
int a,w,h;
bool t[22][22],s[22][22];
void dfs(i_i p) {
s[p.first][p.second... | 0 | 57,268,058 |
#include <bits/stdc++.h>
#define rep(i,s,n) for (int i = s; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i,0,n) cin >> a[i];
vector<int> b = a;
sort(b.rbegin(), b.rend());
int f = b[0], s = b[1];
rep(i,0,n) {
if... | #include <iostream>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
while (H > 0 && W > 0) {
for (int i=1; i<=H; i=i+1) {
for (int j=1; j<=W; j=j+1) {
if (i == 1 || i == H || j == 1 || j == W)
cout << '#';
else
cout << '.';
}
cout << endl;
}
cout << endl;
cin >> H >> W;
... | 0 | 34,191,163 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int n=s.size();
for(int i=0; i<n; i++){
if(i==3){
cout << s[i] << " ";
continue;
}
cout << s[i];
}
cout << endl;
} | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define pb push_back
#define INF 9223372036854775807
#define endl '\n'
#define pii pair<ll int,ll int>
#define vi vector<ll int>
#define all(a... | 0 | 7,087,325 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <array>
#include <iomanip>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define SORT(s) sort((s).begin(),(s).end())
int main... | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
#define MAX_N 50
int v[MAX_N];
int n;
int k;
int favour_left[MAX_N][MAX_N + 1];
int favour_right[MAX_N][MAX_N + 1];
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
int i;
for(i = 0; i < n; ++i){
... | 0 | 56,451,899 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
string alp = "abcdefghijklmnopqrstuvwxyz";
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}
void YES() {cout << "YES" << endl;}
void... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iomanip>
#define rep(i,n) for(int i=0; i<(n); ++i)
using namespace std;
typede... | 0 | 5,141,311 |
#include <iostream>
using namespace std;
int main(){
int N, A;
cin >> N >> A;
while(N >= 500){
N = N - 500;
}
if(N <= A){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
#include <string.h>
#include <vector>
#define MAX 10000
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(),(a).end()
#define rep(i,a,n) for(int i=a; i<n; i++)
#define r0 return 0
#define INF (int)1e15
#define MOD 1000000007
int gcd(in... | 0 | 3,967,968 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll INF = 3000000000000000000;
const int inINF = 1000000000;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
int main(){
int... | #include <iostream>
#include <string>
using namespace std;
int main(){
string S;
cin >> S;
int N=S.length();
int i=0,j;
int check=0;
while(check==0){
j=0;
i++;
while(1){
if(S[j]!=S[(N/2-i+j)])break;
j++;
if(j==N/2-i){
ch... | 0 | 94,530,283 |
#include <bits/stdc++.h>
using namespace std;
const int INF=100000000;
int main(){
int n;
cin>>n;
vector<int> x(n);
for(int i=0;i<n;i++)cin>>x[i];
long long ans=INF;
for(int p=1;p<=100;p++){
long long res=0;
for(int i=0;i<n;i++){
int a=x[i]-p;
res+=a*a;
}
ans=min(ans,res);
}
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int (i) = 0; (i) < (n); (i)++)
#define repp(i, n, m) for(int (i) = (n); (i) < (m); (i)++)
#define repn(i, n) for(int (i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for(int (i) = (n-1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define lint ... | 0 | 81,575,277 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<deque>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#include<functional>
#include<unordered_set>
#include<iomanip>
#include<cassert>
#inc... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,ll> PLL;
typedef pair<P,P> PP;
typedef vector<ll> VECLL;
typedef vector<P> VECP;
typedef priority_queue<P,VECP,greater<P> > PQP;
typedef priority_queue<ll, VECLL, greater<ll> > PQll;
#define rep(i,a,n) for(ll i = a... | 0 | 98,771,283 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
string op;
cin >> a >> op >> b;
if(op == "-"){
cout << a-b<<endl;
}
else
{
cout<<a+b<<endl;}
} | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
#define pb push_back
#define mp make_pair
#define Debug(x) cout << #x " = " << (x) << endl
#define SORT(a) sort(a.begin(), a.end())
#define SORTR(... | 0 | 81,814,317 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<math.h>
using namespace std;
int main(){
int f=1,i;
int foot[2];
foot[0]=0;
foot[1]=0;
int ans=0,N;
string x;
while (1){
cin >>N;
ans=0;
f=1;
foot[0]=0;
foot[1]=0;
if(N==0)break;
for(i=0;i<N;i++){
cin >> x;
if(x... | #include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define pb push_back
#define ff first
... | 0 | 78,702,376 |
#include <bits/stdc++.h>
using namespace std;
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(0), cout << fixed << setprecision(20);
#define int long long
#define double long double
const int INF = 1e18, MOD = 1e9 + 7;
int modpow(int x, int n) {
int ret = 1;
while (n > 0) {
if (n & 1) ret =... | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#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 srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begi... | 0 | 87,750,519 |
#include <bits/stdc++.h>
using namespace std;
long ans=1,aaa,mod=1000000007,invele;
string l;
long modpow(long modpow_x,long modpow_y) {
long modpow_return=1;
for(long i=1;i<=modpow_y;i*=2) {
if(modpow_y/i%2==1) modpow_return=modpow_return*modpow_x%mod;
modpow_x=modpow_x*modpow_x%mod;
}
return modpow_re... | #include <iostream>
#include <string>
#include <stdlib.h>
using namespace std;
int main(void){
int n;
string m;
while(1) {
n = 0;
cin >> m;
if(m == "0")
break;
for(int i=0;i<m.size();i++) {
int k = m[i] - '0';
n = n + k;
}
c... | 0 | 31,982,129 |
#include <bits/stdc++.h>
#define ll long long int
#define dbg(x) cout<<"( "<<#x<<" -> "<<x<<" )"<<endl;
using namespace std;
int main()
{
ll a,b,k;
scanf("%lld%lld%lld",&a,&b,&k);
if (a>=k)
printf("%lld %lld\n",(a-k),b);
else if ((a+b)>=k)
printf("0 %lld\n",(b-(k-a)));
else
printf("0 0\n... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
bool check_small(char& a) {
if ('a' <= a && a <= 'z')
return true;
return false;
}
int main(){
std::string s; std::cin >> s;
if (s[0] != 'A') {
std::cout << "WA" << std::endl;
ret... | 0 | 79,986,773 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long li;
typedef pair<li, li> pii;
pii make_set(li x, li y) {
if (x < y) {
return make_pair(y, x);
} else {
return make_pair(x, y);
}
}
pii max_of(pii x, pii y) {
vector<li> vs = {x.first, x.second, y.first, y.second};
... | #include <bits/stdc++.h>
#include <algorithm>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
long long mod = 1000000007;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i, n) for (long long i = 0... | 0 | 23,496,024 |
#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+1; i++)
#define sort(A) sort(A.begin(),A.end())
#define reverse(A) reverse(A.begin(),A.end());
#define vecmin(A) *min_element(A.begin(),A.end());
#define vecmax(A) *max_element(A.begin(),A.... | #include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | 0 | 7,394,793 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i,... | #include <bits/stdc++.h>
using namespace std;
#define ordered_set tree<pair<int,int>, null_type,less<pair<int,int> >, rb_tree_tag,tree_order_statistics_node_update>
#define standardVar ll n,m,k,num,num1,num2,flag=0
#define nn <<"\n"
#define __ <<" "<<
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define ff... | 0 | 79,340,590 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void bfs(int x) {
int cnt = 1;
queue<ll>Q;
for(int i = 1; i <= 9; i++) {
Q.push(i);
}
while(1) {
ll t = Q.front();Q.pop();
if(cnt == x) {
printf("%lld\n", t);
return ;
}
if(t % 10 == 9) {
Q.push(t * 10 + 8);
Q.push(t * 10 + ... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
using namespace std; using ll = long long; using ld = long double; using pll = pair<ll... | 0 | 41,903,331 |
#include<iostream>
#include<vector>
#include<utility>
#include<algorithm>
using namespace std ;
int main()
{
int N,A,B ;
cin>>N>>A>>B ;
vector<int>P(N) ;
for(int i=0;i<N;i++) cin>>P.at(i) ;
sort(P.begin(),P.end()) ;
int num_1=0,num_2=0,num_3=0 ;
for(int i=0;i<N;i++){
if(P.at(i)<=A) num_1++ ;
else ... | #include <iostream>
using namespace std;
int main() {
string stra;
int x;
bool r=true;
cin >> stra;
x= stra.length();
for(int i=0;i<x;i++){
for(int j=i+1;j<x;j++){
if(stra[i]==stra[j]){
r=false;
break;
}
}
}
if(r==fa... | 0 | 43,922,156 |
#include <iostream>
using namespace std;
int main() {
int K, A, B;
cin >> K >> A >> B;
if (B/K - (A-1)/K >= 1) cout << "OK" << endl;
else cout << "NG" << endl;
} | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <unordered_set>
#include <stack>
#include <queue>
#include <math.h>
#include <string>
#include <numeric>
#include <algorithm>
#include <utility>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int gcd(int a, int b) {... | 0 | 89,921,517 |
#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long int> H(N);
for(int i = 0; i < N; i++) {
cin >> H[i];
}
int ans = 0;
if(N > 1) {
for(int i = 0; i < N - 1; i++) {
int count = 0;
for(int j = 0; j < N - i - 1; j++) {
if(H[i + j] >= H[i +... | 0 | 73,869,186 |
#include<iostream>
#include<stdio.h>
#include<cstring>
#include<cmath>
#include<vector>
#include<set>
#include<map>
#include<algorithm>
#include<unordered_map>
#include<bits/stdc++.h>
#define ll long long
#define d double
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int r;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long int> a(N);
long long int y = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
y += a[i];
}
long long int x = 0;
long long int min = LLONG_MAX;
for (int i = 0; i < N - 1; i++) {
... | 0 | 68,935,369 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int,int>;
using PP = pair<int,pair<int,int>>;
using T = tuple<string,int,int>;
const ll INF = 1LL<<60;
const int ny[4] = {-1,1,0,0}, nx[4] = {0,0,-1,1};
int sy,sx,gy,gx;
int main(){
int n,m... | #include <bits/stdc++.h>
#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typ... | 0 | 54,817,720 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main()
{
int a,b,c;
cin>>a>>b>>c;
cout<<max(a,max(b,c))*9+a+b+c<<endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;typedef long long lint;typedef vector<lint> liv;
#define all(v) v.begin(),v.end()
#define linf 1152921504606846976
#define MAXN 100010
#define md 1000000007
#define pb push_back
#define _vcppunko4(tuple) _getname4 tuple
#define _getname4(_1,_2,_3,_4,name,...) name
#define _g... | 0 | 18,601,878 |
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <iomanip>
using namespace std;
float min(float a, float b){
if (a<b){
return a;
}else{
return b;
}
}
int main(){
in... | #include "bits/stdc++.h"
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define revrep(i,a,b) for(int i = a; i > b; i--)
#define int long long
#define exist(s,e) ((s).find(e)!=(s).end())
#define all(v) (v).begin(), (v).end()
#define each(s,itr) for(auto (itr) = s.begin(); (itr) != s.end(); (itr)++)
#defin... | 0 | 74,535,487 |
#include <bits/stdc++.h>
using namespace std;
# define REP(i,n) for (int i=0;i<(n);++i)
# define rep(i,a,b) for(int i=a;i<(b);++i)
# define p(s) std::cout << s ;
# define pl(s) std::cout << s << endl;
# define printIf(j,s1,s2) cout << (j ? s1 : s2) << endl;
# define YES(j) cout << (j ? "YES" : "NO") << endl;
# define ... | #include <bits/stdc++.h>
#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 FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN... | 0 | 97,093,697 |
#include <bits/stdc++.h>
#include<iostream>
#include<vector>
#include<map>
#include<math.h>
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define irrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define irrep2(i,n,a) for(int i = (int)(n); i >= (int)(a)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | 0 | 14,574,951 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for(int i = 0; i < (n); ++i)
int mod = 1e9+7;
int main()
{
int n;
cin >> n;
int dp[n+1] = {0};
dp[0] = 1;
for (int i=1; i<=n; i++) {
for (int j=0; j<=i-3; j++) {
dp[i] ... | #include<bits/stdc++.h>
#define lln long long int
#define llu unsigned lln
#define sc(n) scanf("%d",&n);
#define scl(n) scanf("%lld",&n);
#define scd(n) scanf("%lf",&n);
#define pf(res) printf("%d\n",res);
#define pfl(res) printf("%lld\n",res);
#define pfd(res) printf("%lf\n",res);
#define maxii 100005
using namespace ... | 0 | 36,465,018 |
#include <cstdio>
#define ll long long
int main() {
ll a, b, c, k;
scanf("%lld %lld %lld %lld", &a, &b, &c, &k);
if(a - b < -1000000000000000000 || 1000000000000000000 < a - b)
printf("Unfair\n");
else
printf("%lld\n", (a - b) * (1 - k % 2 * 2));
} | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>... | 0 | 20,847,460 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define until(x) while(!(x))
#define unless(x) if(!(x))
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
#define pc __builtin_popcount
string s;
map<char,int> mp;
int32_t main(){
cin>>s;
int n = s.length();
for(int i=0;i<n;i+... | #include <iostream>
#include <iomanip>
using namespace std;
int main(){
int n;
cin >> n;
long *data = new long[n];
long min,max,sum=0;
for(int i=0; i<n; i++){
cin >> data[i];
if(i==0){
min=max=sum=data[0];
}else{
if(min>data[i]){
min=data[i];
}
if(max<data[i]){
... | 0 | 54,842,884 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>... | #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 a, b, c, d;
cin >> a >> b >> c >> d;
string ans;
if (a + b > c + d) {
ans = "Left";
}
else if (a + b == c + d) {
ans = "Balanced";
}
else{
ans = "Rig... | 0 | 84,131,443 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int N, K;
int L[60];
int su = 0;
cin >> N >> K;
for (int i = 0; i < N; ++i) cin >> L[i];
sort(L, L+N, greater<int>());
for (int k = 0; k < K; ++k) su += L[k];
cout << su << endl;
} | #include <iostream>
#include <string>
#include <map>
using namespace std;
map<string,int> table;
int main(){
string word, frequent, longest;
int frequent_length = 0;
while (cin >> word){
table[word] += 1;
if (table[word] > frequent_length){
frequent_length = table[word];
frequent = word;
}
longest = (w... | 0 | 72,533,906 |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int n;
vector<int> r;
while (scanf("%d",&n) != EOF)
{
int sum=0;
for (int i=n; i<600; i+=n)
{
sum+=i*i*n;
}
r.push_back(sum);
}
for (int i=0; i<r.size(); i++)
{
cout << r[i] << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
using namespace std;
#define INF 1e18LL
const ll MAX = 1000000000000000000;
int main(){
string s;
cin >> s;
bool exist = true;
int cnt = 0;
... | 0 | 2,649,321 |
#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 ;
void solve(){
int x,y,a,b,t ;
cin>>x>>y>>a>>b>>t ;
int temp1=x*60+y ;
int temp2=a*60+b ;
int c=temp2-temp1 ;
cout<<c-t ;
}
int main(){
int y ;
y=1 ;
while(y--){
... | #include<bits/stdc++.h>
using namespace std;
#define N 250
#define ll long long
#define pb push_back
#define pi pair<ll , ll>
#define mp make_pair
bool check(string v , string& str){
int j = 0 ;
for(int i = 0 ; i <(int)str.length() && j < (int)v.length() ; i++){
if(v[j] == str[i]){
j++;
if(j == (int)v.length... | 0 | 59,719,654 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);i++)
typedef long long ll;
using namespace std;
int main(){
ll x,y;
cin >> x >> y;
int ans = 0;
while(y >= x){
x *= 2;
ans += 1;
}
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int n,s[5000+10];
int biggest(int n){
int M=-200000-10;
for(int p=0;p<n;p++){
if(s[p]>M) M=s[p];
for(int q=0;q<p;q++){
if(s[p]-s[q]>M) M=s[p]-s[q];
}
}
return M;
}
int main(){
int n;
while(cin){
... | 0 | 44,532,294 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int now;
int goal;
cin >> now;
cin >> goal;
cout << 2 * goal - now << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n,i,c=1;
cin>>n;
int s[n];
for(i=0;i<n;i++)
{
cin>>s[i];
}
for(i=0;i<n-1;i++)
{
if(s[i]>s[i+1])
{
c++;
}
... | 0 | 96,080,296 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
#define dbg(x) cerr << __LINE__ << " > " << #x << " = " << (x) << endl
void MAIN() {
int a, b;
cin >> a >> b;
cout << (a + b + 1) / 2 << '\n';
}
sign... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
signed main(void)
{
int h, w, a, b;
cin >> h >> w >> a >> b;
int s[h][w];
rep(i, h)
{
rep(j, w)
{
if (i < b && j < a)
s[i][j] = 0;
else if (i < b)
s[i][j] = 1;
else if (j < a)
s[i][j] = 1;
else
... | 0 | 57,198,502 |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 2005
ll N,M;
ll S[SIZE],T[SIZE];
ll dp[SIZE][SIZE];
vector<int> G[SIZE];
int main(){
sca... | #include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)... | 0 | 28,250,414 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,n) for (int64_t 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()
#define chmax(x,y) x=max(x... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define int long long
#define pb push_back... | 0 | 20,687,952 |
#include<bits/stdc++.h>
#define int long long
#define fi first
#define si second
#define mp make_pair
#define ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long int n,m=0,s,l=0,c=0,i,k,b;
cin>>n;
m=n-1;
for(i=1;i<=sqrt(n);i++){
if(!(n % i)){
k=i;
s=n/k;
m=min(m,(k-1)+(s-1));
l=1;
}
}
if(l)
cout<<m;
else
... | 0 | 36,223,328 |
#include <bits/stdc++.h>
using namespace std;
class UnionFind{
private:
vector<int> parent,rank,tree_w;
int tree_num;
public:
UnionFind(int size){
tree_num=size;
for (int i=0; i<size; i++){
parent.push_back(i);
rank.push_back(0);
... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
int n, m;
cin >> n >> m;
vector<vector<int>> d(n, vector<int>(n, -1)), next(n, vector<int>(n, -1)),
indeces(n, vector<int>(n, -1));
for (int i = 0; i < m; ++i) {
int a, b, c;
cin >> a >> b >> c;
a--;
b--... | 0 | 13,604,992 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T...... | #include <iostream>
#include <string>
#include <array>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <cctype>
#include <map>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <ctype.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-l... | 0 | 55,451,377 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int n,k,res=0; cin>>n>>k;
int arr[n];
for(int i=0;i<n;i++)cin>>arr[i];
sort(arr,arr+n);
for(int i=0;i<n;i++){
while(i<n-1 && arr[i]==arr[i+1])++i; res++;
}
if(res<=k)cout<<0;
else{ int M=200005,m=arr[n-1]; long c=0;
i... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b... | 0 | 97,031,391 |
#include <bits/stdc++.h>
using namespace std;
int count_2(int x) {
int ans = 0;
while(x % 2 == 0) {
ans++;
x /= 2;
}
return ans;
}
int power_2(int x) {
if(x == 0) {
return 1;
}
else {
int ans = 1;
for(int i = 0; i < x; i++) {
ans *= 2;
}
return ans;
}
}
int main() {
int... | #include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#de... | 0 | 74,436,988 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
int p = min(min(a,b),c);
int q = max(max(a,b),c);
int r = a+b+c-p-q;
a=p;b=r;c=q;
p = c - b;
q = c - a;
r = b - a;
if(p%2==0&&q%2==0) {
cout << p/2 + q/2 << endl;
return 0;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
ll man(ll x1, ll y1, ll x2, ll y2)
{
return abs(x1 - x2) + abs(y1 - y2);
}
int main()
{
int N, M;
cin >> N >> M;
vector<ll> a(N), b(N), c(M), d(M);
rep(i, N)
{
cin >> a[i] >> b[i];
}
r... | 0 | 86,254,896 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, p;
cin >> n >> p;
vector<int> a(n);
for (int& i : a) cin >> i;
ll c0 = 0, c1 = 0;
for (int i : a) ++(i & 1 ? c1 : c0);
c0 = 1ll <<... | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
ll N, D, A, ans=0;
vector<pair<ll, ll>> XH;
vector<ll> C;
signed main(){
cin >> N >> D >> A;
for(int i=0;i<N;i++) {
ll X, H;
cin >> X >> H;
XH.push_back(make_pair(X, H));
C.push_back(0);
... | 0 | 88,211,146 |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define ... | 0 | 71,532,903 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <utility>
#include <functional>
#include <cstdlib>
using namespace std;
using vl = vector <long long>;
using vs = vector <string>;
using vc = vector <char>;
using ll= long long;
u... | #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();}
template<class T> inline T sqr(T x) {return x*x;}
typedef long long LL;
typedef pair<int, int> PII;
typede... | 0 | 5,840,524 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int q;
cin >> q;
for (; q > 0; q--) {
ll a, b;
cin >> a >> b;
if (a * b <= 2) {
cout << 0 << endl;
continue;
}
if (a > b) {
ll t = a;
a = b;
b = t;
}
ll r = sqrt(a * b);
ll x = r + (r == a), y = r + 1 + (r... | #include <iostream>
using namespace std;
int isprime[1000000];
void hurui() {
isprime[0] = isprime[1] = 0;
for (int i = 2; i < 1000000; i++) {
isprime[i] = 1;
}
for (int i = 0; i < 1000000; i++) {
if (isprime[i]) {
for(int j = i * 2; j < 1000000; j+=i) {
ispri... | 0 | 100,201,790 |
#include <bits/stdc++.h>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch: s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.clear... | #include <iostream>
#include <vector>
using namespace std;
void print(vector<vector<int>> &A, int n)
{
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (j > 0) cout << " ";
cout << A[i][j];
}
cout << endl;
}
}
int main()
{
int n;
cin >> n;
... | 0 | 32,894,091 |
#include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#include <sstream>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair< int, int > pii;
typedef pair< pii, int > ppi;
#define fill(a,b) memset(a,b,sizeof(a))
#define all(v) (v).begin(),(v).end()
#define sp(k) cout<<setprecision(k)<<fixed;
#define rep(i,a) for(in... | 0 | 14,214,075 |
#include<iostream>
#include<queue>
#include<utility>
using namespace std;
int main(){
int n,m;
while(cin>>n>>m,n){
int a,b,ans=0;
priority_queue< pair<int,int> > c;
for(int i=0;i<n;i++){
cin>>a>>b;
c.push(make_pair(b,a));
}
while(!c.empty()){
if(c.top().second>m){
c.pus... | #include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
#define mod 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI acos(... | 0 | 30,459,130 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
typedef long long ll;
int main(){
int N ,Q;
cin >> N >> Q;
vector<int> w(N+1,0);
vector<int> v[N+1];
rep(i,N-1){
int a,b;
cin >> a >> b;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, N, a;
int u, l;
cin >> X >> N;
vector<int> vec(102);
for (int i = 0; i < 102; i++) {
vec.at(i)=0;
}
for (int i = 1; i < N+1; i++) {
cin >> a;
vec.at(a)=1;
}
if (vec.at(X)==0){
cout << X << endl;
}
else{
for (int ... | 0 | 56,543,450 |
#include <stdio.h>
#include <string.h>
char s3[8];
char sub4(int d)
{
if(d==2)return '2';
if(d==3)return '3';
if(d==4)return '4';
if(d==5)return '5';
if(d==6)return '6';
if(d==7)return '7';
if(d==8)return '8';
if(d==9)return '9';
}
void sub3(int c)
{
int cnt=0;
memset(s3,'\0',sizeof(s3));
if(c>=1000){
if(c... | #include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define allr(a) a.rbegin(), a.rend()
#define rev(v) reverse(v.begin(), v.end());
#define io() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); srand(time(NULL));
#define check cout<<"?\n";
using namespace std;
typedef long long ll;
typedef long double... | 0 | 23,479,702 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <utility>
#include <set>
#include <stack>
#include <climits>
#include <cmath>
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define rep1(i,n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long res = 0;
for (int l = 0, r = 0, s = a[0]; l < n; l++) {
while (r + 1 < n && (s & a[r + 1]) == 0) {
s +... | 0 | 28,122,942 |
#include<iostream>
#include<cmath>
#include<vector>
#include<algorithm>
#include <string.h>
#include <iomanip>
using namespace std;
#define PI 3.14159265358979323846264338327950L
int main() {
string S, T;
cin >> S >> T;
if (!(S.length() >= 1 && S.length() <= 10) ||
T.length() != S.length() + 1) {
goto NO;
}
fo... | #include<iostream>
#include<string>
using namespace std;
int main(){
int taro=0,hanako=0;
int n; cin>>n;
string tc,hc;
for(int i=0;i<n;i++){
int longSize;
cin>>tc>>hc;
if(tc.size()>hc.size())longSize = tc.size();
else longSize = hc.size();
if(tc==hc){
... | 0 | 100,708,024 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
char c;
cin >> c;
char res;
if(c == 'A')res = 'T';
if(c == 'T')res = 'A';
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
#define REP(i, n) for(ll i=0; i<(ll)(n); i++)
#define REPD(i, n) for(ll i=n-1; 0<=i; i--)
#define FOR(i, a, b) for(ll i=a; i<(ll)(b); i++)
#define... | 0 | 60,782,632 |
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <iomanip>
namespace {
double area(double a, double b, double deg) {
return a * b * std::sin(deg * M_PI / 180.0) / 2.0;
}
double length(double a, double b, double deg) {
return a + b + std::sqrt(a * a + b * b - 2 * a * b * std::cos(deg * M_PI / 180... | #include <cstdio>
#include <string>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
using namespace std;
struct point{
double x,y;
point(double _x , double _y){
x = _x , y = _y;
}
};
bool insidePoly( point p,vector<point>P ) {
bool inside = false;
int n = P.size();
fo... | 0 | 56,844,810 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin>>n,n!=0){
vector<pair<string,string> >pcc;
vector<string> vc;
for(int i=0;i<n;i++){
string a,b;
cin>>a>>b;
pcc.push_back(make_pair(a,b));
}
int m;
cin>>m;
for(int i=0;i<m;i++){
string a;
... | #define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
using ll = long long;... | 0 | 13,387,700 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | 0 | 88,538,084 |
#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>;
... | #include <bits/stdc++.h>
using namespace std ;
#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(),(r).end()
#define gsort(st,en) sort((st),(en),greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<endl... | 0 | 49,082,297 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
ll a[200009], sum = 0;
for(int i=0; i<n; i++) {
cin >> a[i];
sum += a[i];
}
ll res = 500000000000000LL;
ll ps = a[0];
for(int i=1; i<n; i++) {
res = min(res, abs(sum ... | #include <cstdio>
#include <iostream>
using namespace std;
int main(){
char str[21];
int count=0;
scanf("%s", str);
while( str[count] != '\0' ) ++count;
for(int i=count-1; i>=0; --i)
printf("%c", str[i]);
printf("\n");
return 0;
} | 0 | 45,848,006 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define ts to_... | #include <iostream>
#include <string>
using namespace std;
int main() {
int red, green, blue;
cin >> red >> green >> blue;
int k;
cin >> k;
while (true) {
if (red < green) {
break;
}
green *= 2;
k--;
}
while (true) {
if (green < blue) {
... | 0 | 47,775,628 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
int main() {
int A,B;
cin >> A >> B;
bool OK = false;
if (A < B) swap(A,B);
if (A == B) {
OK = true;
} else {
int d = abs(A-B);
... | #include<cstdio>
int main()
{
int n,a[5000];
while(scanf("%d",&n),n)
{
for(int i=0;i<n;i++)scanf("%d",&a[i]);
for(int i=0;i<n-1;i++)a[i+1]+=a[i];
int ma=-100000000;
for(int l=0;l<n;l++){
for(int r=l;r<n;r++){
int sum;
if(l==0)sum=a[... | 0 | 1,744,386 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int n,m; cin>>n>>m;
vector<int> a(n);
for(int i=0; i<n; ++i) cin>>a[i];
long double sum=0,res=0;
for(int i=0; i<n; ++i) sum+=a[i];
sum/=4*m;
for(int i=0; i<n; ++i) if(a[i]>=sum) ++res;
if(res>=m) cout<<"Yes"; else cout<<"No";
return 0;
} | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long lon... | 0 | 71,922,724 |
#include <bits/stdc++.h>
#define ll long long int
#define FASTIO std::ios::sync_with_stdio(false);
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define inf 1e18
#define g(x) cout<<x<<" "<<endl;
#define gg(x,y) cout<<x<<" & "<<y<<" "<<endl
#define jam(t) cout<<"Case #"<<t<<": "
#define ggg(... | #include <iostream>
#include <cstdio>
#include <iomanip>
#include <algorithm>
#include <string>
#include <cstring>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <cctype>
typedef long long int ll ;
typedef unsigned long long int ull ;
using namespace std ;
int main(void)
{
ios_base::sync_with_stdio... | 0 | 5,937,743 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> a(n);
vector<int> ans(10000000,0);
for(int i=0;i<n;i++)cin>>a[i];
sort(a.begin(),a.end());
for(int i=0;i<n;i++){
for(int j=a[i];j<=a[n-1];j+=a[i]){
ans[j]++;
}
}
long long cnt=0;
for(int i=0;i<n;i++){
... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
using namespace std;
#define INF INT_MAX / 2
int main() {
int n, m;
int c[20];
c... | 0 | 69,983,189 |
#include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define allr(a) a.rbegin(), a.rend()
#define rev(v) reverse(v.begin(), v.end());
#define io() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); srand(time(NULL));
#define check cout<<"?\n";
using namespace std;
typedef long long ll;
typedef long double... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < (int)(b); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int n;
cin >> n;
ll sum[n + 1] = {};
rep(i, 0, n) {
int a;
cin >> a;
... | 0 | 11,029,980 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7, mxN = 1e5 + 5, mxC = 2;
int N;
vector<int> adj[mxN];
ll dp[mxN][mxC];
ll rec(int v, int p, int pcol) {
if (dp[v][pcol] != -1)
return dp[v][pcol];
ll tot = 0, ways = 1;
if (pcol == 0) {
for (auto it : adj[v]) {
if (it ... | #include<bits/stdc++.h>
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vpii vector<pair<int,int>>
#define gph map<int, vector<int>>
#define mp make_pair
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR1(i, n) for (in... | 0 | 99,214,020 |
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<bitset>
#include<cctype>
#include<climits>
#include<cmath>
#include<cstdio>
#include<deque>
#include<list>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<queue>
#include<vector>
using namespace std;
int main() {
... | constexpr bool isDebugMode = false;
int testcase = 1;
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge{long long to,cost;};
const int inf = 1 << 27;
const ... | 0 | 39,220,610 |
#include <iostream>
#include <string>
int main() {
using namespace std;
int n, total;
total = 0;
cin >> n;
for (int i=1; i<=n; i++) {
string x = to_string(i);
if (x.size() % 2 == 1) total++;
}
cout << total;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,k,turn;
scanf("%d%d%d%d",&a,&b,&c,&k);
for(;;)
{
if(b<=a)
{
b*=2;
turn++;
}
else
{
break;
}
}
for(;;)
{
if(c<=b)
{
c*=2;
turn++;
}
else
{
break;
}
}
if(turn<=k)
{
printf("Yes");
}
else
{
printf... | 0 | 19,103,703 |
#include <bits/stdc++.h>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
using namespace std;
int main() {
int X;
cin >> X;
bool ans = 0;
rep(i,1,X) {
int l = 100 * i, r = 105 * i;
if (l <= X && X <= r) ans = 1;
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define pi 3.141592653589793238
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
int dpp[5005][5005];... | 0 | 3,775,227 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
bool check=false;
for(int i=2; i<s.size()-1; i++){
if('a'<=s.at(i) && s.at(i)<='z'){
}
else if(s.at(i)=='C'){
if(check==false){
check=true;
}
else if(... | #include <iostream>
#include <algorithm>
int main(){
int x1, y1, x2, y2;
std::cin >> x1 >> y1 >> x2 >> y2;
int x3, y3, x4, y4;
int dx, dy;
if ((x2 >= x1) && (y2 >= y1)){
x3 = x2 - (y2 - y1);
y3 = y2 + (x2 - x1);
x4 = x3 - (x2 - x1);
y4 = y3 - (y2 - y1);
} else if ((x1 > x2) && ... | 0 | 54,456,833 |
#include <bits/stdc++.h>
using namespace std;
long long gcm(long long a, long long b){
if(a % b == 0) return b;
a = a % b;
return gcm(b, a);
}
long long lcm(long long a, long long b){
return a / gcm(a, b) * b;
}
int main() {
int n;
cin >> n;
long long ans = 1;
for(int i = 0; i < n; i++){
long long k... | #include<bits/stdc++.h>
using namespace std;
#define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define test() ll t; cin>>t; while(t--)
#define lp0(i,begin,end) for(ll i=begin;i<end;i++)
#define lp1(i,begin,end) ... | 0 | 58,873,380 |
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#inc... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define FORD(i,a,b) for(int i=a;i>=b;i--)
#define FORL(i,x) for(int i=head[x];i;i=nxt[i])
#define ALL(a) (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin... | 0 | 83,168,339 |
#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;
vector<int> a;
rep(i,2*n) {
int x;
cin >> x;
a.push_back(x);
}
sort(a.begin(), a.end());
int ans =... | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
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; }
vector<lli> divisor(lli x){
vector... | 0 | 76,729,601 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.