code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <bits/stdc++.h>
#define err(args...) {}
#ifdef DEBUG
#include "_debug.cpp"
#endif
using namespace std;
using ll = long long;
using ld = long double;
template <typename T> using lim = numeric_limits<T>;
template <typename T> istream& operator>>(istream& is, vector<T>& a) { for(T& x : a) { is >> x; } return is; ... | #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... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
//~ #define endl '\n'
void solve(){
int a[3];
cin>>a[0]>>a[1]>>a[2];
for(int i = 0; i<3; i++){
if(a[i] == a[(i + 1)%3] && a[i] != a[(i + 2)%3]){
cout<<"Yes"<<endl;
return;
}
}
cout<<"No"<<endl;
}
int main(){
ios_base::sync_with_stdio(0... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
using namespace std;
int main()
{
int n, k;
cin >> n >> k;
if (n % k == 0)
{
std::cout << 0 << endl;
return 0;
}
std::cout << 1 << endl;
return 0;
} | 0 |
#include"bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
const long long INF10=1e10+1,ID_MAX=20;
const long mod=(1e9)+7;
const long long INF18=1e18+1;
struct edge{
int to;
long cost;
};
void sort2array(double *a,long *b,long n){
for(int i=0;i<n;i++){
b[i]=i;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long int li;
typedef long double lb;
#define rep(i,j,n) for (ll i = j; i < (n); i++)
#define repr(i,j,n) for(ll i = j; i >= (n); i--)
#define all(x) (x).begin(),(x).end()
#define CLR(mat,f) memset(mat, f, sizeof(mat))
#define IN(a, b, x) (a<=x... | 1 |
#include <cstdio>
#include <iostream>
#include <algorithm>
#define MAX_STATIONS 100+1
#define INF 1<<15
#define reep(i,n,m) for(int i=n;i<m;i++)
#define rep(i,n) reep(i,0,n)
using namespace std;
class Stations{
private:
int time[MAX_STATIONS][MAX_STATIONS];
int cost[MAX_STATIONS][MAX_STATIONS];
public:
... | #include <bits/stdc++.h>
#include "atcoder/all"
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
int main() {
cin.tie(0... | 0 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
... | #include <iostream>
#include <queue>
int main(){
std::priority_queue<int> p;
int n, m;
int price;
while(std::cin >> n >> m){
int sum_price = 0;
if(n == 0 && m == 0) break;
//input
for(int i = 0; i < n; ++i){
std::cin >> price;
p.push(price);
}
//袋詰め
while(!p.empty()){
for(int i = 1; i <= m... | 1 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
int main() {
ll A, B, C, D;
cin >> A >> B >> C >> D;
... | #include <iostream>
#include <string>
int main () {
int a, b, c, d;
std::string ans = "";
std::cin >> a >> b >> c >> d;
int x = a + b - c - d;
if(x > 0) ans = "Left";
else if(x == 0) ans = "Balanced";
else ans = "Right";
std::cout << ans << std::endl;
}
| 1 |
#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 mod=1e9+7;
const int INF=1001001001;
in... | #include "bits/stdc++.h"
#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define DUMP(i, v)for(ll i=0;i<v.size();i++)cerr<<v[i]<<" "
using nam... | 0 |
#include <stdio.h>
int main(){
int menit;
int angkaangka[5];
for(int i=0;i<5; i++){
scanf("%d", &angkaangka[i]);
}
//for(int i=0;i<5; i++){
// printf("%d ", angkaangka[i]);
//}
int jam=angkaangka[2]-angkaangka[0];
//printf("total jam: %d\n", jam);
if(angkaangka[3]>angkaangka[1]){
menit=angkaangka[3]-angkaa... | #include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
#define REP(i,n) for (int i=0; i<(n); i++)
#define SORT(c) sort((c).begin(),(c).end())
typedef vector<int> vi;
int main() {
vi W(10),K(10);
REP(i,10) scanf("%d",&W[i]);
REP(i,10) scanf("%d",&K[i]);
SORT(W); SORT(K);
int w=0,k=0;
REP(i,3... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
int main() {
string a, b, c;
cin >> a >> b >> c;
bool flag = true;
if(a[a.size()-1] != b[0]) flag = false;
if(b[b.size()-1] != c[0]) flag = false;
... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pi 3.14159265358979323846
#define ll long long
#define mp make_pair
#define pf push_front
#define MOD 1000000007
#define MAX 100000000
#define MIN -1000000000
... | 0 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <chrono>
using namespace std;
#define INF 1e18
long long DP[5001][5001];
struct Constraint {
long long H, P;
Constraint(long long H = 0, long long P = 0):H(H), P(P){}
bool operator<(const Constraint& r)const {
return P+H < r.... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M = 1e9 + 7;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<pair<ll, ll>> A(n);
for (int i = 0; i < n; ++i) {
cin >> A[i].first >> A[i].second;
}
auto comp... | 1 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
string S;
cin >> S;
int N = S.size();
int sum = 0;
vector<int> vec(N);
rep(i, N) {
if(S.... | #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 = n-1; i >= 0; 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)
ty... | 1 |
#include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N,sum;
cin >> N;
vector<int> A(N+2,0);
vector<bool> bs(N+1,false);
// 経由地点が間にあるかどうかを判定する
sum = 0;
for(int i=0;i<N;i++) {
cin >> A[i+1];
if(i) {
// 2個前と1個前と現在を見て1個前を確定
if(((A[i+1] >= A... | 1 |
#include<bits/stdc++.h>
#define pb(a) push_back(a)
#define ms(x,y) memset(x,y,sizeof(x))
#define sci(a) scanf("%d",&a)
#define scl(a) scanf("%lld",&a)
#define scd(a) scanf("%lf",&a)
#define ll long long
using namespace std;
/* --------------- fast io --------------- */ // begin
namespace Fread{
const int SIZE=1<<20;... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define yn(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YN(ans) if(ans)printf("YES\n");else printf("NO\n")
#de... | 0 |
#include <bits/stdc++.h>
using namespace std;
int arr[4];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int d;
cin>>d;
if(d==1)
cout<<"Hello World";
else
{
int a,b;
cin>>a>>b;
cout<<a+b;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a) for(int i=0;i<(a);i++)
const ll MOD=1000000007;
//const ll MOD=998244353;
int main(){
int M; cin>>M;
ll sum=0,sumC=0;
rep(i,M){
ll d,c; cin>>d>>c;
sum+=d*c;
sumC+=c;
}
cout<<sumC-1+(sum-1)/9<<endl;
return 0;
} | 0 |
#include <iostream>
using namespace std;
class Dice {
private:
int number[6];
int state[6];
public:
Dice();
~Dice();
void initialize();
void setNumber(int index, int num);
void roll(char d);
void move(string d);
int getNumber(int idx);
int getTop();
int getSide(int t, int f);
bool cmp(Dice dice1);
};
Dic... | #include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
template <typename T> bool chmax(T &u, const T z) { if (u < z) {u = z; return true;} else return false; }
template <typename T> bool chmin(T &u, const T z) { if (u > z) {u = z; return true;} else return false; }
#define re... | 0 |
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include... | #include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;
int main()
{... | 1 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>
#include<cstring>
#include<bitset>
#include<cassert>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#... | #include<iostream>
#include<cmath>
using namespace std;
int main()
{
int r;
cin>>r;
double pi=3.147;
double ans=pi*2*r;
cout<<ans<<endl;
return 0;
}
| 0 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <cmath>
#include <iomanip>
#include <set>
#include <sstream>
#include <queue>
using namespace std;
typedef long long ll;
int main() {
int n;
string s;
cin >> n >> s;
vector<int> west_sum(n);
vector<int> east... | #include<iostream>
#include<string.h>
#include<string>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<bitset>
#include<math.h>
#include<stack>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef long double db;
typedef pair<int,int> pii;
const int N=100000;
co... | 0 |
#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " : " << x << '\n'
using namespace std;
typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair<ll, ll> pll;
const ll Mod = 998244353;
const int N = ... | /*
[arc102] E - Stop. Otherwise...
*/
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef ... | 1 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstring>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <functional>
#include <sstream>
#include <complex>
#include <climits>
using namespace std;
#define REP(i,a,n) for(int i=(a);i<(int)(n);i++)
#define re... | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <stack>
#include <set>
#include <cmath>
#include <algorithm>
using namespace std;
int zeller(int y , int m , int d){
if(m==1 || m==2) {m+=12; y-=1;}
return(y + y/4 - y/100 + y/400 + ((13*m+8)/5) + d )%7;
}
int main(){
int m , d , ... | 1 |
#include <bits/stdc++.h>
using namespace std;
class Dice{
public:
unique_ptr<vector<int>> nums;
Dice(int n){
nums.reset(new vector<int>(6));
}
void rotate(char dir){
int a, b, c, d;
switch(dir){
case 'N':
a = nums->at(0), b = nums->at(1), c = nums->at(5),... | #include <iostream>
#include <sstream>
using namespace std;
class Dice {
public:
static int rollingface[][4];
int face[6];
Dice(string &face_data);
// ~Dice();
void roll(const char &op);
int top();
void print_faces();
};
int Dice::rollingface[][4] = {
{0, 2, 5, 3},
{0, 4, 5, 1},
... | 1 |
// based on http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=2784229#1
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <set>
#include <algorithm>
#include <array>
#include <complex>
#include <utility>
#include <map>
int needleX[4] = { -1,0,1,0 };
int needleY[4] = { 0,1,0,-1 };
bool... | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <functional>
using namespace std;
#define fr first
#define sc second
#define pb push_back
#defi... | 0 |
#include <stdio.h>
#include <algorithm>
using namespace std;
int a[200010];
long long f[200010];
long long g[200010];
long long get(int x) {
if (x <= 0) return 0;
return f[x];
}
int main() {
int n, i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (i) g[i] = g[i-1]... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vect... | 1 |
#include <iostream>
#include <string>
#include <sstream>
int partition(int* arr, int n)
{
const int x = arr[n - 1]; //pivot value
int i = 0; //increment if swaped
int j = 0; //increment every loop
for (; j < n; ++j) { //scan start to end
if (arr[j] <= x) {
std::swap(arr[i], a... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
using namespace std;
int A[100001];
int n;
int partition(){
int i = -1;
for (int j = 0; j < n - 1; ++j) if (A[j] <= A[n-1]) swap(A[++i], A[j]);
swap(A[i + 1], A[n-1]);
return i + 1;
}
int main(){
scanf("%d",&n);
for (int i = 0; i < n; ++i) sca... | 1 |
#include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& op... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define vll vector<ll>
using namespace std;
const ll N = 4e5+100;
const ll MOD = 1e9+7;
string s,t;
ll tree[N];
void build(ll node,ll l,ll r)
{
if(l==r)
{
tree[node] = (... | 1 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
#define a first
#define b second
#def... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
#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 INF 1000000000000 /... | 1 |
#include<bits/stdc++.h>
#define re register
#define inc(i,j,k) for(re int i=j;i<=k;i++)
using namespace std;
const int N=105;
inline int read(){
int x=0;
char ch=getchar();
while(ch<'0'||ch>'9') ch=getchar();
while('0'<=ch&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x;
}
int n,m,a[N],pos[N],cnt;
int main(){
n=re... | #include <iostream>
using std::cin;
using std::cout;
using std::endl;
using ll = long long;
template <typename T>
T min(T a, T b){
return (a < b) ? a : b;
}
template <typename T>
class SegTree{
static const int MAXN = 100010;
T INF;
int n;
T A[MAXN*4];
T time[MAXN*4];
public:
SegTree(int size, T INF):... | 0 |
// I SELL YOU...!
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<chrono>
#include<iomanip>
#include<map>
#include<set>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
void init_io(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << setpreci... | #include <cstdio>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace ... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL);
int n;
cin >> n;
set <int> s;
for(int i=0; i<n; i++)
{
int temp;
cin >> temp;
s.insert(temp);
}
if(s.size() == ... | #include<iostream>
using namespace std;
int main(){
int n, num[10000];
int max = -1000000, min = 1000000;
long long sum = 0;
cin >> n;
for(int i = 0; i < n; i++){
cin >> num[i];
if(min > num[i]) min = num[i];
if(max < num[i]) max = num[i];
sum = sum + num[i];
}
cout << min << " " << max << " " << s... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
#define rep(i,n) for (int i=0; i<(n); i++)
#define reps(i,s,n) for (int i=(s); i<(n); i++)
#define rep1(i,n) for (int i=1; i<=(n); i++)
#define repr(i,s,n) for (int i=(s)-1; i>=(n); i--)
#define print... | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
using n... | 1 |
#include <bits/stdc++.h>
using namespace std;
bool is_squere(long N) {
long r = (long) floor(sqrt(N));
return (r * r) == N;
}
int main() {
int N;
cin >> N;
for(int i = N; i > 0; i--) {
if(is_squere(i)) {
cout << i << endl;
return 0;
}
}
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
int i = 1;
while(1) {
if(i*i>n) break;
i++;
}
cout << (i-1)*(i-1) << endl;
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
int is_prime(int n){
if(n<2) return 0;
else if(n==2) return 1;
else if(n%2==0) return 0;
double sqrtNum = sqrt(n);
for (int i = 3; i <= sqrtNum; i += 2)
{
if (n % i == 0)
{
return 0;
}
}
return 1;
}
int main(){
... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cst... | 0 |
#include<stdio.h>
int max(int a,int b){return a>b?a:b;}
int main(){
int i,j;
int n;
char c;
int jc=0;
int oc=0;
int ic=0;
int lev=0;
int ans=0;
scanf("%d",&n);
while(scanf("%c",&c)!=EOF){
switch(c){
case 'J':
if(jc==0){
oc=0;
ic=0;
lev=0;
}
jc++;
break;
case 'O':
if(oc==0){
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<char,int> P;
signed main(){
string str;
cin>>str;
vector<P> A;
int idx=0;
while(idx<str.size()){
char ch = str[idx];
int cnt=0;
while(str[idx] == ch) idx++,cnt++;
A.push_back(P(ch,cnt));
}
int ans = 0;
for... | 1 |
#pragma region header
#define _GLIBCXX_DEBUG
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repn(i,n) for(int i = 0; i <= (int)(n); i++)
#define srep(i,l,n) for(int i = l; i < (int)(n); i++)
#define srepn(i,l,... | 1 |
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<iostream>
#define N 1100000
using namespace std;
char s[N],t[N];
int p[N],head,tail,n,f[N],ans;
int main()
{
scanf("%d",&n);
scanf("%s",s+1);
scanf("%s",t+1);
bool bo=1;
for(int i=1;i<=n;i++) if(s[i]!=t[i]) {bo=0;break;}
if(bo) {printf(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int dh[4] = {1, 0, -1, 0};
int dw[4] = {0, 1, 0 , -1};
const int INF = 100000;
int main() {
int wcount = 0;
char grid[100][100];
int H, W;
cin >> H >> W;
for (int i = 1; i <= H; i++) {
for (int j = 1; j <= W; j++) {
cin >> grid... | 0 |
#include <iostream>
#include <cstdio>
using namespace std;
#define N 2
void InsertionSort(int* a, int n, int g);
void ShellSort(int* a, int n);
int a[1000005];
int cnt = 0;
int main(void){
int n;
cin >> n;
for(int i=0; i<n; i++){
cin >> a[i];
}
ShellSort(a, n);
cout << cnt ... | #include <iostream>
#include <sstream>
#include <string>
using namespace std;
constexpr int n = 10;
int L[n+2],P[n];
int main(){
string str;
while(getline(cin,str)){
string tmp;
istringstream stream(str);
for(int i=0;getline(stream,tmp,',');++i){
L[i] = stod(tmp);
}
P[0] = L[0];
for(... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int n;
cin >> n;
int a[n];
rep(i, n) cin >> a[i];
deque<int> r;
rep(i, n) {
int idx = lower_bound(r.begin(), r.end(), a[i]) - r.begin();
--idx;
if (idx < 0) {... | #include <bits/stdc++.h>
#define pb push_back
#define Int long long
using namespace std;
const int MAXN=500005;
const int NAX=1005;
const long long MOD=(long long)(998244353);
Int N,M,K;
Int X,Y,Z;
Int H,W;
Int perform(Int x){
return (x*(x+1))/2LL;
}
vector<Int> A;
vector<int> adj[MAXN];
using D=long double;
b... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int bubble(vector<int>::iterator, vector<int>::iterator);
int main() {
int n;
cin >> n;
vector<int> nums;
for(int i = 0; i < n; ++i) {
int num;
cin >> num;
nums.push_back(num);
}
int count = 0;
for(int i = 0; i < ... | #include <iostream>
using namespace std;
int bubblesort(int A[], int N) {
int count = 0;
int flag = 1;
while (flag) {
flag = 0;
for (int i = N-1; i > 0; i--) {
if (A[i] < A[i-1]) {
swap(A[i], A[i-1]);
flag = 1;
count++;
}
}
}
for (int j = 0; j < N; j++) {
if (j != N -1) co... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
vector<P> G[1001][1001];
int dp[1001][1001];
vector<P> tp;
int dfs(int x,int y,int px=1000,int py=1000)
{
if(dp[x][y]!=0)return dp[x][y];
if(G[x][y].empty())return dp[x][y] = 1;
for(auto i:G[x][y])
{
dp[x][y] = max(dp[x... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
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; }
typedef long long ll;
using namespace std;
int main(void){
int n;ci... | 1 |
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#... | #include<cstdio>
#include<utility>
#include<algorithm>
#include<vector>
#include<queue>
#define MAX_N 262144
#define INF 1000000000000000
typedef long long ll;
using namespace std;
int used[MAX_N];
ll n,d,a[MAX_N],ans=0,two[20];
pair<ll,ll> p[MAX_N],t[2*MAX_N][2];
vector<pair<ll,ll> > g[MAX_N];
void init(){
for(ll... | 0 |
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <vector>
#include <map>
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
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 ... | #include <iostream>
#include <limits>
#include <algorithm>
using namespace std;
int c[100][100];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n, t;
int M[101];
cin>>n;
cin>>M[0]>>M[1];
for(int i=2; i<=n; i++) {
cin>>t>>M[i];
}
for(int l=1; l<n; l++) {
f... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int m;
cin >> m;
vector<int> nodes;
vector<pair<int, int>> child;
int n = 0;
for (int i = 0; i < m; i++){
string q;
cin >> q;
if (q == "insert"){
int k;
cin >> k;
if (n != 0){
int v = 0;
while (1){
... | #include <iostream>
#include <cstdlib>
#include <cstdio>
using namespace std;
typedef struct node{
int key;
struct node *parent;
struct node *left;
struct node *right;
} Node, Tree;
void insert(Tree **T, int key)
{
Node *pre = NULL;
Node *curr = *T;
Node *newNode = NULL;
newNode = (Node*)malloc(sizeof(Node... | 1 |
#include<iostream>
using namespace std;
string rep(string s,int a,int b,string p);
string rev(string s,int a,int b);
void pri(string s,int a,int b);
int main(){
string code,k,p;
int n,a,b;
string haki;
getline(cin,code);
cin >> n;
getline(cin, haki);
for(int i =... | #include <iostream>
#include <string>
using namespace std;
int main(){
string str, trans, s;
int q, a, b;
cin>>str;
cin>>q;
for(int i=0;i<q;i++){
cin>>trans>>a>>b;
string left = str.substr(0, a);
string right = str.substr(b+1, str.length()-b-1);
if(trans == "print"){
s = str.substr(a, b-a+1);
co... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
using ld = long double;
const int MOD = 1e9+7;
const ll INF = 1LL << 60;
int main() {
string s; cin >> s;
if(s == "hi" || s == "hihi" || s == "hihihi" || s == "hihihihi" || s... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool ok = true;
if (S.size() % 2 == 1) ok = false;
for (int i = 0; i < S.size() / 2; i += 2) {
if (S.substr(i, 2) != "hi") {
ok = false;
}
}
if(ok) cout << "Yes" << endl;
else co... | 1 |
#include <bits/stdc++.h>
using namespace std;
int val=1,n;
double k;
int main (){
cin>>n>>k;
int z=k;
while(double(k)/2>1){
val++;
k/=2;
}
if(n>=val){
cout<<pow(2,val)+z*(n-val);
}
else{
cout<<pow(2,n);
}
} | #include <bits/stdc++.h>
using namespace std;
int main()
{int N, K, n{1}; cin >> N >> K;
while (N--) n += min(n, K);
cout << n;} | 1 |
#include<stdio.h>
#include<iostream>
using namespace std;
int main(void){
int n,a[4],t[100],i,c,j;
cin>>n;
for(i=0;i!=n;i++){
t[i]=0;
}
for(i=0;i!=n*(n-1)/2;i++){
for(j=0;j!=4;j++)
cin>>a[j];
if(a[2]<a[3])
t[a[1]-1]+=3;
else if(a[2]>a[3])
t[a[0]-1]+=3;
else{
t[a[0]-1]++;
t[a[1]-... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<int,int> > team(N);
for (int i = 0; i < N; i++) {
team[i].second = i + 1;
}
for (int i = 0; i < N * (N - 1) / 2; i++) {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (c < d) te... | 1 |
#include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#include <unistd.h>
#include <cassert>
#include <cctype>
#include <ra... | #pragma GCC optimize ("O3")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) <... | 1 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;
const int N=101;
char s[N];
short g[N][N],f[N][N],v[N][N][N][N];
inline void upd(short &x,short y) {x=max(x,y);}
int main() {
int n,m,x,y,ans=0;
cin>>n>>m;
for(int i=1;i<=n;i++) {
scanf("%s",... | /// {{{ Author: Wang, Yen-Jen
// include
#include <bits/stdc++.h>
// using
using namespace std;
// types
typedef long long ll;
typedef pair<int,int> pii;
// macro
#define SZ(x) ((int)x.size())
#define ALL(x) (x).begin() , (x).end()
#define REP(i , n) for(int i = 0; i < int(n); i++)
#define REP1(i , a , b) for(int i ... | 1 |
#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 fi first
#define se second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef unsign... | #include <algorithm>
#include <cctype>
#include <cstring>
#include <cstdio>
using namespace std;
inline int read(int f = 1, int x = 0, char ch = ' ')
{
while(!isdigit(ch = getchar())) if(ch == '-') f = -1;
while(isdigit(ch)) x = x*10+ch-'0', ch = getchar();
return f*x;
}
const int N = 3e2+5;
int n, m, f[N][... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,d,e,f,g,h,i,j,k,l,m,n,t,prothom,boro;
cin>>n>>k;
cin>>a;
boro=a;
for(int i=1;i<n;i++)
{
cin>>b;
a=__gcd(a,b);
boro=max(boro,b);
}
if(k<=boro && k%a==0)
{
cout<<"POSSIBLE"<<endl;
}
else
{
cout<<"IMPOSSIBLE... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
string s, c, p;
int q, a, b;
cin >> s >> q;
while (q--) {
cin >> c >> a >> b;
int l = b - a + 1;
if (c == "print")
cout << s.substr(a, l) << endl;
else if (c == "reverse")
reverse(s.begin() + a, s.begin() + ... | 0 |
#include<bits/stdc++.h>
using namespace std ;
#define ll long long
#define ld long double
#define ff first
#define ss second
const ll mod = 1e9 +7 ;
ll multiply(ll a, ll b ){ return ((a % mod) * (b % mod)) % mod; }
ll add(ll a, ll b) { return ((a % mod) + (b % mod)) % mod; }
ll sub(ll a, ll b) { return ((a%mod) ... | #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
static char buf[IN_BUF], *ps = buf, *pt = buf;
if... | 0 |
#include <iostream>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <list>
#include <set>
#include <unordered_set>
#include <vector>
#include <utility>
#include <algorithm>
#include <queue>
#include <cstdint>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace s... | #include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <iomanip>
#define ll long long
#define MAX_N 200001
using namespace std;
long long MOD = 1000000007;
long long fact[MAX_N];
void... | 1 |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <unordered_map>
using namespace std;
int main() {
int N; string A, B, C; cin >> N >> A >> B >> C;
string str = "";
vector<int> count(10e3, 0);
for (int i = 0; i < N; ++i) {
int x, y, z; x = y = z = 0;
i... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> pll;
const int INF=1e9;
const ll MOD=1e9+7;
ll gcd(ll x,ll y){
if(y==0) return 0;
re... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, j, k) for(int i=(j); i<=(k); i++)
#define FFOR(i, j, k) for(int i=(j); i<(k); i++)
#define DFOR(i, j, k) for(int i=(j); i>=(k); i--)
#define bug(x) cerr<<#x<<" = "<<(x)<<'\n'
#define pb push_back
#define mp make_pair
#define bit(s, i) (((s)>>(i))&1LL)
#define... | #include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main(){
string X,Y;
int l=0;
int point;
cin>>X>>Y;
int N[X.size()+1][Y.size()+1];
for(int i=0;i<=Y.size();i++){
N[0][i]=i;
}
for(int i=1;i<=X.size();i++){
N[i][0]=i;
}
for(int i=1;i<=X.siz... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string A;
cin >> A;
if(A.at(0) == '7') {
cout << "Yes" << endl;
}
else if(A.at(1) == '7') {
cout << "Yes" << endl;
}
else if(A.at(2) == '7') {
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
string s ;
cin>>s;
bool a[27]={};
for(int i=0;i<s.size();i++)
{
a[s[i]-'a']=true;
}
for(int i=0;i<27;i++)
{
if (i==26)
cout<<"None";
else if(!a[i])
{
char c='a';
... | 0 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <numeric>
#include <cmath>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define all(x) x.begin(),x.end()
const ll mod = 1... | #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;
#define ff first
#define ss second
#define endl "\n"
#define loop(i,s,e) for(int i=s;i<e;i++)
#define int ... | 0 |
#include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long; using pint = pair<int, int>; using pll = pair<ll, ll>;
template<ty... |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <map>
#include <iomanip>
#include <deque>
#include <set>
#include <climits>
#include <memory>
#include <numeric>
#include <utility>
#define rep(i,a,b) for(int i=a;i<b;++i)
#define rrep(i,... | 0 |
#include <bits/stdc++.h>
#define SIZE 300005
#define MOD 1000000007LL
#define INF 1 << 30
#define LLINF 1LL << 60
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define DOWN(i,b,a) for(int i=b;i>=a;i--)
#define SET(a,c) memset(a,c,sizeof a)
#define FORALL(i,c) for(__typeof((c).begin())i=... | #include<iostream>
#include<string>
#define COL 12
#define ROW 12
using namespace std;
int field[COL][ROW];
void mapping(int y, int x){
//cout<<"mapping("<<y<<", "<<x<<")\n";
if(field[y][x]==1){
field[y][x]=0;
if(y+1<COL) mapping(y+1,x);
if(x+1<COL) mapping(y,x+1);
if(y-1>=0) mapping(y-1,x);
if(x-1>=0) ... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int N;
string s, t;
cin >> N;
cin >> s >> t;
int len=s.size() + t.size();
rep(i,s.size()) {
if (t.find(s.substr(i)) != string::npos) {
len -=... | #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int N=2e6+500;
int n;char st[N];
int nxt[N];
int main()
{
scanf("%d",&n);
scanf("%s",st+1);scanf("%s",st+n+1);
for(int i=1;i<=n;i++)swap(st[i],st[i+n]);
int j=0;
for(int i=2;i<=2*n;i++)
{
while(j&&st[j+1]!=s... | 1 |
#include <bits/stdc++.h>
#define FOR(i,bg,ed) for(ll i=(bg);i<(ed);i++)
#define REP(i,n) FOR(i,0,n)
#define MOD 1000000007
//#define int long long
using namespace std;
typedef long long ll;
const int INF = 1e9;
int m, nMin, nMax;
int P[210];
pair<int, int> ans[210];
signed main()
{
while (true) {
cin >> m... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) { cout << #a << " = " << a << endl; }
template<class T1, class T... | 1 |
#include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep(i, n) repd(i, 0, n)
using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
ll mod = 1000000007;
int main() {
ll n, m;
cin >>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll LINF = 1e18;
const int INF = 1e9;
const ll MOD = 1000000007;
int main(){
int r, g;
cin >> r >> g;
cout << 2*g - r << endl;
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
long long r = 0, g = 0, b = 0;
for(int i = 0; i < n; i++) {
if(s.at(i) == 'R') r++;
else if(s.at(i) == 'G') g++;
else b++;
}
long long sum = r * g * b;
for(int i = 0; i < (n - 2); i++) {
for(int j ... | #include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <iomanip>
#include <cmath>
#include <stack>
using namespace std;
using ll = long long int;
template <class T> ostream &operator<<(ostream &os, vect... | 0 |
#include<iostream>
using namespace std;
long N,M,mod=998244353;
long F[1<<25],I[1<<25];
long power(long a,long b){return b?power(a*a%mod,b/2)*(b%2?a:1)%mod:1;}
long C(long a,long b)
{
return a<b||a<0||b<0?0:F[a]*I[b]%mod*I[a-b]%mod;
}
long H(long a,long b){return a<0?0:C(a+b-1,b-1);}
long calc(long n,long m,long s)
{
... | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#define rep(i,a,b) for (int i = (a); i < (b); i++)
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef complex<double> com;
const int mod = 1e9 + 7;
const int MOD = 998244353;
const int inf = 2e9;
ll mpow(ll a, ll b) {
ll res = 1;
a %= mod;... | 0 |
//Radhe Radhe
#include<bits/stdc++.h>
#define ll long long
#define fast_io ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define mod 1000000007
using namespace std;
int main()
{
fast_io
ll i,a,b,c,d,j,k;
cin>>a>>b>>c;
cout<<max(a+b,max(a*b,a-b));
return 0;
}
| #include<bits/stdc++.h>
#define Vsort(a) sort(a.begin(), a.end())
#define rep(i,n) for(int i = 0; i < (n); i++)
#define Srep(i,a,n) for(int i = (a); i < (n); i++)
#define ll long long
#define P pair<int, int>
using namespace std;
int main(){
int x,y,z;
cin >> x >> y >> z;
swap(x,y);
swap(x,z);
cout << x << "... | 0 |
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> graph;
vector<int> parent;
vector<int> visited;
vector<pair<int,int>> depth;
void DFS(int v, int parent_v, int d){
parent[v] = parent_v;
depth[v] = {d, v};
for(int child_v : graph[v]){
DFS(child_v, v, d+1);
}
}
int main(){
... | #include <bits/stdc++.h>
using namespace std;
void solve(int n,int mn,int mx){
int t,st=0,maxx=0,ans=0;
vector<int> v;
cin >> st;
for(int i=0;i<n-1;i++){
cin >> t;
v.push_back(st-t);
st=t;
}
for(int i=mn-1;i<mx;i++){
if(maxx<v[i]){
maxx=v[i];
... | 0 |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <set>
#include <functional>
#include <cmath>
#include <numeric>
#include <iterator>
#include <fs... | #include<iostream>
int main(){
long long a,b;
std::cin >> a >> b;
long long ans = 1e18;
if(std::abs(a) == std::abs(b)){
std::cout << 1 << std::endl;
return 0;
}
if(-a < b){
ans = std::min(ans, a + b + 1);
}
if(a < -b){
ans = std::min(-a - b + 1, ans);
}
... | 0 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>... | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
while (getline(cin, str)) {
int cnt = 0;
for (int i = 0; i < 26; ++i) {
for (int j = 0; j < (int)str.size(); ++j) {
if (str[j] >= 'a' && str[j] <= 'z') {
str[j] = (str[j] - 'a' + 1) % 26 + 'a';
}
}
cnt++;
if (str.fin... | 0 |
#include<bits/stdc++.h>
#include<iomanip>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
vector<float> p(N);
for(int i=0; i<N; i++) cin >> p.at(i);
for(int i=0; i<N; i++) p.at(i) = (p.at(i) + 1) / 2;
vector<double> q(N);
q.at(0) = p.at(0);
for(int i=1; i<N; i++) q.at(i) = q.... | #include <bits/stdc++.h>
using namespace std;
typedef long long lol;
//マクロ
//forループ関係
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
//Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i,n) for(lol i=0;i<lol(n);i++)
#define REPD(i,n) for(lol i=n-1;i>=0;i--)
#define FOR(i,a,b) for(lol i=a;i<=lol(b);i+... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, M;
while (cin >> N >> M, N) {
vector<int> p(N);
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> p[i];
sum += p[i];
}
sort(p.begin(), p.end());
for (int i = N - M; i >= 0;... | #include <iostream>
#include <string>
#include <algorithm>
#include <numeric>
#include <boost/tokenizer.hpp>
#include <boost/lexical_cast.hpp>
#include <vector>
#include <list>
using namespace std;
using namespace boost;
int main(int argc, char* argv[])
{
using sprtr = char_separator<char>;
using tknzr = tokenizer... | 1 |
#ifdef _MSC_VER
#define _CRT_SECURE_NO_WARNINGS
# include <intrin.h>
# define __builtin_popcount __popcnt
#endif
#define _USE_MATH_DEFINES
#include <stdio.h>
#include <iostream>
#include <vector>
#include <unordered_map>
#include <stack>
#include <list>
#include <math.h>
#include <map>
#include <iomanip>
#include <... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
/***********debug tools***********/
template<class T> inline ostream& operator<<(ostream& os,vector<T> arr) {os << "["; for(int i = 0; i < (int)arr.size(); i++)os << arr[i] << (i == (int)arr.size() - 1 ? "]" : ",");os << endl;return os;}
template<type... | 1 |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007;
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
string s;
cin>... | #include<iostream>
using namespace std;
int main() {
int d;
while(cin >> d) {
long long ans = 0;
int y = d;
while (y <= 600 - d) {
ans += (long long)y * y * d;
y += d;
}
cout << ans << endl;
}
}
| 0 |
#include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n;i>=0;i--)
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a ... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int *ary = new int[n];
for (int i = 0; i < n; ++i) {
cin >> ary[i];
}
int _n = n - 1;
for (int j = _n; 0 <= j; --j) {
if (j == 0)
cout << ary[j] << endl;
else
cout << ary... | 0 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
int n; char c; string s;
while(cin >> n)
{
int cd[13]={0},pr[5]={0};
cd[n-1]++;
for(int i=0; i<4; i++)
{
cin >> c >> n;
cd[n-1]++;
}
for(int i=0; i<13; i++)
{
pr[cd[i]]++;
}
bool st=false;
for(int i=0; i<10; i++)... | #include <iostream>
#include <cstdio>
using namespace std;
int main(){
int n[5], num[14], pair[3],i;
while (scanf("%d,%d,%d,%d,%d",&n[0],&n[1],&n[2],&n[3],&n[4]) != EOF){
i = 0;
for (int i = 0; i < 14; i++) num[i] = 0;
for (int i = 0; i < 3; i++) pair[i] = 0;
for (int i = 0; i < 5; i++) num[n[i] - 1]++;
fo... | 1 |
#include<bits/stdc++.h>
#define LL long long
using namespace std;
const int N=1e6+10;
int rd()
{
int x=0,w=1;char ch=0;
while(ch<'0'||ch>'9'){if(ch=='-') w=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+(ch^48);ch=getchar();}
return x*w;
}
int n,q[N<<1],hd,tl,tg;
char cc[N],ss[N];
int main()
{
/... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<int>A(N +1 );
for (int n = 0;n<N;++n) {
cin >> A[n + 1];
}
vector<int>B(N + 1);
for (int n = N;n>=1;--n) {
int sum = 0;
for (int m = n + n;m <= N;m += n) {
sum += B[m];
}
if (A[n] == sum%2) {
B[n] = 0;
}
else... | 0 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <sstream>
#include <string>
#include <utility>
#include <map>
#include <memory>
#include <set>
#include <vector>
#inclu... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
void dfs1(vector<vector<pair<int,int>>> &graph, vector<int> &num, vector<int> &used, int node, int &con){
if(used[node]) return ;
used[node] = true;
for(pair<int,int> next : graph[node]){
... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
#define pb push_back
#define debug(x) cerr << #x... | #include<bits/stdc++.h> //Ithea Myse Valgulious
namespace chtholly{
typedef long long ll;
#define re0 register int
#define rel register ll
#define rec register char
#define gc getchar
//#define gc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<23,stdin),p1==p2)?-1:*p1++)
#define pc putchar
#define p32 pc(' ')
#define pl puts("... | 1 |
#include<iostream>
using namespace std;
int main(){
int n;
while(cin>>n && n){
int a=0,b=0;
for(int i=0;i<n;i++){
int x,y;
cin>>x>>y;
if(x>y)a+=x+y;
else if(x==y){
a+=x;b+=y;
}
else b+=x+y;
}
cout<<a<<" "<<b<<endl;
}
} | #include <bits/stdc++.h>
#define fo(i,a) for(i = 0;i < a;i++)
using namespace std;
int main(void)
{
int n,m,fr=0,i,a[10001],b[10001],flag[10001]={0};
flag[0] = 1;
cin >> n >> m ;
while(n != 0 || m != 0){
fo(i,m){
cin >> a[i] >> b[i] ;
if(a[i] == 1){
fr++ ;
flag[b[i]] = 2 ;
}
}
fo(i,m){
i... | 0 |
#include<bits/stdc++.h>
using namespace std;
long long solve(){
int n;
cin>>n;
long long A[n][n];
long long dp[(1<<n)];
for(int i=0;i<n;i++) for(int j=0;j<n;j++) cin>>A[i][j];
dp[0]=0;
for(int i=1;i<1<<n;i++){
dp[i]=0;
for(int j=0;j<n;j++){
if(i&(1<<j)){
for(int k=j+1;k<n;k++){
if(i&(1<<k)) d... | #include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <deque>
#include <set>
#include <stdlib.h>
#include <string.h>
#incl... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007
#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)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int size;
cin>>size;
int arr[2*size]={};
int ans=0;
for(int i=0;i<2*size;i++){
cin>>arr[i];
}
sort(arr,arr+2*size);
for(int i=0;i<2*size;i++){
if(i%2==0){
ans=ans+arr[i];
}
}
cout<<ans;
return 0;
} | 1 |
#include <stdio.h>
char str[16][16];
/*
void erase(int x, int y)
{
if (x < 0 || x > 11 || y < 0 || y > 11) return;
if (str[y][x] == '0') return;
str[y][x] = '0';
erase(x + 1, y);
erase(x, y + 1);
erase(x - 1, y);
erase(x, y - 1);
}
*/
void is(int i, int j)
{
int n;
int k;
str[i][j] = '0';
k = 1;
... | #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
typedef long long LL;
const int MAXN=400;
LL n, m, ans, cntW, cntB;
bool visited[MAXN][MAXN];
string s[MAXN];
bool avail(int i, int j, char c){
if(i < 0 || i >= n || j < 0 || j >= m) return false;
if(s[i][j] == c) return false;
return tru... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<string> s(0);
vector<int> p(0);
rep(i, n) {
string si;
cin >> si;
bool hit = false;
rep(j, s.size()) {
if (s.at(j) == si) {
p.at(j)++;
... | #include <bits/stdc++.h>
using namespace std;
template <class t>
using vc = vector<t>;
template <class t>
using vvc = vector<vector<t>>;
typedef long long ll;
typedef vc<int> vi;
typedef vvc<int> vvi;
typedef pair<int, int> pi;
#define uset unordered_set
#define umap unordered_map
#define endl "\n"
#define fi first... | 1 |
#include <cstdio>
#include <algorithm>
using i8 = std::int8_t;
using u8 = std::uint8_t;
using i16 = std::int16_t;
using u16 = std::uint16_t;
using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using usize = std::size_t;
i32 a[200000];
auto main() -> i32 {
i32 n,... | #include <iostream>
#include <vector>
using namespace std;
int n, k;
bool alln(vector<int>& v){
for(int i=0;i<n;++i) if(v[i]!=n) return false;
return true;
}
void simulate(vector<int>& v){
int cnt = 0;
vector<int> tmp(n+1, 0);
for(int i=0;i<n;++i) {
tmp[max(0, i-v[i])]++;
tmp[min(n, i+v[i]+1)]--;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9+7;
int main(){
int N;
cin >> N;
vector<long long> A(N);
for(int i = 0; i < N; i++)
cin >> A[i];
long long ans = 0;
long long sum = 0;
long long sum2 = 0;
for(int i = 0; i < N; i++){
sum2 = (sum2 + A[i]*A[i]) % (2*mod);
su... | #include <iostream>
#include <algorithm>
#include <cmath>
const int lens = 2e5 + 1;
const long long mod = 1e9 + 7;
long long a[lens],sum[lens];
int main()
{
int n;
std::ios::sync_with_stdio(false);
std::cin >> n;
for(int i = 1;i <= n;i++)
{
std::cin >> a[i];
sum[i] = sum[i - 1] + a... | 1 |
#include <iostream>
#include <stdlib.h>
using namespace std;
int main()
{
int n = 0;
int q = 0;
cin >> n;
int s[n];
for (int i = 0; i < n; i++) {
scanf("%d",&s[i]);
}
cin >> q;
int t[q];
for (int i = 0; i < q; i++) {
scanf("%d",&t[i]);
}
int sum = 0;
... | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef pair<int,int> P;
#define SORT(a) sort((a).begin(),(a).end())
#define REV(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x... | 0 |
//g++ 7.4.0
#include <iostream>
#include <string>
using namespace std;
int main()
{
int k;
cin >> k;
std::string s;
cin >> s;
if(s.length() <= k){
cout << s << endl;
}else{
cout << s.substr(0, k) << "..." << endl;
}
} | #pragma GCC optimize("O3")
#include<bits/stdc++.h>
#define sp " "
#define endl "\n"
#define MAX 10e9
#define MAXN 100001
#define mod 1000000007
#define inf_int 2e9
#define inf_ll 2e18
#define e 1e-9
#define vi vector<int>
#define vl vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpl vector<pair<l... | 1 |
#define _CRT_SECURE_NO_WARNINGS
#include<fstream>
#include<iostream>
#include<string>
#include<iomanip>
#include<list>
#include<math.h>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<utility>
using namespace std;
short cost[110][110];
short time_data[110][110];
int main(){
short n, ... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
long long member[4000];
bool ached[4000];
vector<int> ach;
int main(void){
int n;
while(true){
cin >> n;
if(n == 0) break;
fill(member, member + 4000, 0);
fill(ached, ached + 4000, false);
ach.clear();
for(int... | 0 |
#include <iostream>
#include <set>
using namespace std;
#define rep(i,a,b) for(int i=(a); i<(b); i++)
int main(){
int m,n;
while(cin >> n >> m, m + n){
int p[10001][2];
set<int> fri1;
set<int> fri2;
rep(i,0,m){
int a,b; cin >> a >> b;
p[i][0] = a;
p[i][1] = b;
if(a == 1 ||... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,a,b,x=0,count=0;
while(1){
cin >> n;
if(n == 0) break;
cin >> m;
int data[n][n];
int str[501]={0};
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
data[i][j]=0;
}
}
for(int i=0;i<m;i++){
cin >> a >> b;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n,m,q;cin>>n>>m>>q;
int a[n+1][n+1]{};
for (int i=0;i<m;i++) {
int b,c;cin>>b>>c;
a[b][c]++;
}
for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
a[i][j]+=a[i][j-1];
for (int i=1;... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii>... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | #include <bits/stdc++.h>
const int MOD = 1e9 + 7, N = 40, L = 17;
int n, x, y, z, f[ N + 1 ][ 1 << L ];
int main( )
{
std::ios::sync_with_stdio( false );
std::cin >> n >> x >> y >> z;
int mx = ( 1 << ( x + y + z ) ) - 1, ans = 1, haiku = ( ( 1 << ( x + y + z ) ) >> 1 ) | ( ( 1 << ( y + z ) ) >> 1 ) | ( ( 1 << z ) >>... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
int n,m;cin>>n>>m;
vector<pair<int,int>> pr(m);
rep(i,m){
int s,c;cin>>s>>c;
s--;
pr[i]=make_pair(s,c);
}
rep(i,1000){
bool ans=true;... | #include <cstdio>
#include <iostream>
#include <array>
#include <algorithm>
using namespace std;
int main() {
array<array<int,10>,2> ar;
for(int i = 0; 2 > i; i++){
for(int j = 0; 10 > j; j++){
scanf("%d\n", &ar[i][j]);
}
sort(ar[i].begin(), ar[i].end(), [](int a, int b){return a > b;});
}
printf("%d %d\n... | 0 |
#include<bits/stdc++.h>
using namespace std;
using p=pair<int,int>;
#define int long long
#define rep(i,N) for(int i=0;i<N;i++)
signed main(){
int N;
cin>>N;
int ans=1;
while(ans*ans<=N)ans+=1;
ans-=1;
cout<<ans*ans<<endl;
return 0;
} | #include <iostream>
int main(){
int n;
std::cin >> n;
std::cout << n * n * n << std::endl;
return 0;
} | 0 |
#include <stdio.h>
#include <string.h>
int main() {
int a, b, c = 0;
char pscode[50];
scanf("%d %d", &a, &b);
scanf("%s", &pscode);
for (int i = 0; i < strlen(pscode); i++) {
if (pscode[a] != '-') {
printf("No");
return 0;
}
if (pscode[i] >= '0' && ps... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <climits>
#include <map>
#include <set>
const int mod = 1e9 + 7;
const int inf = 1 << 20;
const long long INF = 1LL << 60;
using namespace std;
typedef long long ll;
typedef pair<in... | 0 |
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<stack>
#define gc getchar()
#define N 103
#define sint short
#define upd(x,y) (x=max(x,(short)(y)))
#define debug(x) cerr<<#x<<"="<<x
#define sp <<" "
#define ln <<endl
using namespace std;
inline int inn()
{
int x,ch;while((ch=gc)<'0'|... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
int n, k;
ll ans = 10000000000, len;
int main()
{
cin >> n >> k;
vector<ll> x(n);
rep(i, 0, n)
{
cin >> x[i];
}
ll l, r, lr, rl;
for (int i = 0; i <= (n - k); i++)
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define DD long double
#define M 1000000007
#define INF 1e18
void setIO(string s = "") {
cin.sync_with_stdio(0); cin.tie(0);
if (s.size()) s += ".in", freopen(s.c_str(), "r", stdin);
}
int tt = 1;
void solve() {
set<int> nums;
int a;
whil... | #include"bits/stdc++.h"
#include<iostream>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
#define rep(i, c) for(int i = 0; i < (int)c; i++)
const ll inf = 1000000007;
int main() {
int a, b,c;
cin >> a >> b >> c;
if (a != b) {
if (a==c || b==c) {
cout << "Yes" << endl;
return 0;
}
}
e... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int N,Q;
cin >> N >> Q;
vector<int> S(N),T(N),X(N);
vector<int> D(Q);
rep(i,N) cin >> S.at(i) >> T.at(i) >> X.at(i);
rep(i,Q) cin >> D.at(i);
set<P> s;... | #include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<deque>
using namespace std;
const int maxn = 1000000 + 10;
int n, ans = 0;
char a[maxn], b[maxn];
deque <int> q;
int main() {
scanf("%d", &n);
scanf("%s%s", a + 1, b + 1);
q.push_back(n + 1);
for(int i = n, j = n + 1, del = 0... | 0 |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
int n, ans, out;
string str;
bool base[3];
cin >> n;
for(int loop = 0; loop < n; loop++){
base[0] = false;
base[1] = false;
base[2] = false;
ans = 0;
out = 0;
while(true){
cin >> str;
if(str == "HI... | #include <iostream>
using namespace std;
int type(string s){
if(s == "HIT")return 0;
if(s == "OUT")return 1;
if(s == "HOMERUN")return 2;
}
int main(){
int n;
string s;
cin >> n;
while(n--){
int outCount = 0;
int base = 0;
int result = 0;
while(outCount < 3){
cin >> s;
switch(type(s)){
case 0:... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define TEMP_T template<typename T>
TEMP_T void sort(T& v){ sort(v.begin(), v.end()); }
TEMP_T void revs(T& v){ reverse(v.begin(), v.end()); }
TEMP_T void uniq(T& v){ sort(v); v.erase(unique(v.begin(), v.end())); }
TEMP_T void show(T& v, char delim=' ', char end='\n'){ fo... | #include <stdio.h>
#include <math.h>
#include <string.h>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <utility>
#include <stack>
#include <queue>
#include <set>
#include <list>
#include <bitset>
#include <array>
using namespace std;
#define fi first
#define s... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<vector<int>> g(n);
for (int i = 0; i < m; i++) {
int a, b;
... | #include<bits/stdc++.h>
#include<string.h>
typedef long long int ll;
#define all(x) (x).begin(), (x).end()
using namespace std;
int nxt() {
int x;
cin >> x;
return x;
}
ll nxtl(){
ll x;
cin>>x;
return x;
}
void SieveOfEratosthenes(int n,vector <int> &primes)
{
// Create a boole... | 1 |
#include<bits/stdc++.h>
using namespace std;
main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long i,j,k,l,m,n,o,p,q;
while(cin>>m>>n>>o>>p)
{
if(m+n>o+p)
cout<<"Left"<<endl;
else if(m+n<o+p)
cout<<"Right"<<endl;
else
co... | #include <bits/stdc++.h>
#include <iostream>
#include<math.h>
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int main()
{
int A, B, C, D;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define LD long double
#define SC(t,x) static_cast<t>(x)
#define AR(t) vector < t >
#define PII pair < int, int >
#define PLL pair < LL, LL >
#define PIL pair < int, LL >
#define PLI pair < LL, int >
#define MP make_pair
#define PB push_back
#define PF... | #include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int a[N], n, cnt[2];
bool gao() {
for (int i = 1; i <= n; i++)
if (a[i] & 1) a[i]--;
cnt[0] = cnt[1] = 0;
int gcd = a[1];
for (int i = 2; i <= n; i++) gcd = __gcd(a[i], gcd);
for (int i = 1; i <= n; i++) cnt[(a[i] /= gcd) & 1]++;
if ... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.