code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 32 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){cin.tie(0);ios::sync_with_stdio(0);}} fast;
using intpair = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj... | #include <bits/stdc++.h>
using namespace std;
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; }
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++... | 0 | 70,601,734 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
bool chk=false;
int A;
cin >> A;
vector<int> B(1000000);
B.at(0)=A;
int count=0;
for(int i=1; i<10000001; i++)
{
if(A%2==0)
{
A=A/2;
B.at(i)=A;
count++;
}
else
{
A=3*A+1;
... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main(){
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n-1);
rep(i, n-1) cin >> b[i];
a[0] = b[0];
for(int i = 1; i < n; i++){
if(i == n-1){
... | 0 | 28,323,601 |
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int n, k;
int ans = 0, r = 0;
cin >> n >> k;
for(int i = 0; i < n; i++){
if(pow(2,i) > k){
ans += k;
r++;
}
}
cout << ans + pow(2,n-r) << endl;
} | #include <iostream>
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#include <algorithm>
#include <bits/stdc++.h>
#define MOD 1000000000000000000
#define ll long long
#define mm(arr) memset(arr, 1, sizeof(arr))
#define scanArray(a,n) for(ll i = 0; i < n; i++){cin >> a[i];}
using namespace std;
i... | 0 | 45,546,635 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> V(3);
for (int i = 0; i < 3; i++) cin >> V.at(i);
sort(V.rbegin(), V.rend());
if (V.at(0) == V.at(1) && V.at(1) == V.at(2)) return cout << 0 << "\n", 0;
int ans = 0;
int tmp = V.at(0) - V.at(1);
ans += tmp;
V.at(2) += tmp;
tmp = V.... | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
int pre=0, cnt=0,... | 0 | 13,658,066 |
#include <bits/stdc++.h>
using namespace std;
typedef int q;
typedef double w;
typedef string s;
typedef long long ll;
int main(){
q a,b;
cin>>a>>b;
cout<<a-b+1;
return 0;} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
using ll = long long;
using ld = long double;
ll INF = LLONG_MAX;
using vb = vector<bool>;
using vi = vector<int>... | 0 | 95,601,506 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <numeric>
#define ll long long int... | #include<bits/stdc++.h>
#define all(v) v.begin(),v.end()
using namespace std;
using ll=long long;
#ifdef ONLINE_JUDGE
#define D(...)
#else
#define D(...)cerr<<__LINE__<<":"<<"["<<#__VA_ARGS__<<"]->",P(__VA_ARGS__)
#endif
void P(){cerr<<endl;}
template<typename H,typename...T>void P(H h,T...t){cerr<<h<<" ";P(t...);}
in... | 0 | 48,098,567 |
#include<iostream>
#include<queue>
using namespace std;
int main()
{
int N,M;
cin>>N>>M;
priority_queue<int>L;
priority_queue<int,vector<int>,greater<int>>R;
for (size_t i = 0; i < M; i++)
{
int l,r;
cin>>l>>r;
L.push(l);
R.push(r);
}
int ans=0;
for (... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define vc vector<char>
#define ii pair<int,int>
#define fi first
#define sc second
#define stoi stoll
#define all(x) (x).begin(),(x).end()
#define get_bit(x, k) ((x >> k) & 1)
void MAIN() {
string s;
cin >> s;
set<char> d;... | 0 | 93,854,223 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
if (S.size() < T.size()) {
cout << "UNRESTORABLE" << endl;
}
else {
int F = S.size();
int D = T.size();
vector<char> ans(F);
for (int j = 0; j < F; j++) {
ans.at(j) = 'z';
}
bool ok = f... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define mod 1000000007
#define inf 1000000000000000
#define infty 1000000000000000000LL
#define md 998244353
#define PI acos(-1.0)
#define endl "\n"
#define rr return
#define br cout<<"\n";
long... | 0 | 98,196,808 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main(){
IOS;
string A,B;
cin >> A >> B;
if(A.size()>B.size()){
cout << "GREATER" <<endl;
}else if(A.size()<B.size()){
cout <<"LESS"<<endl;
}else{
if((int)A[0] >... | #include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#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)
#... | 0 | 29,161,007 |
#include<bits/stdc++.h>
#define rep(i, n) for (int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
int main(void){
int n, k;
cin>>n>>k;
vector<int> v(n);
rep(i, n) cin>>v[i];
vector<int> imo(n+1);
rep(j, min(k, (int)log2(n)+100)){
imo = vector<int>(n+1);
rep(i, n){
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_(i, n, m) for (int i = n; i < (int)(m); i++)
#define all(v) v.begin(), v.end()
#define int long long
#define stoi stoll
signed main() {
int H, W; cin >> H >> W;
vector<string> s(H);
rep(i, H) cin >> s[i]... | 0 | 59,741,886 |
#include<bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("unroll-loops")
#pragma GCC optimize("O2")
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(v) v.begin(),v.end()
#define prec(n) fixed<<setprecision(n)
#define n_l '\n'
#define gcd... | #include <cstdio>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <cmath>
#include <climits>
#define ll long long int
#define pb push_back
#define mk make_... | 0 | 96,730,247 |
#include<bits/stdc++.h>
using namespace std;
int main (){
int x,a,b;
cin>>a>>b>>x;
if( a<= x ){
if(a+b>=x)cout<<"YES";
else cout<<"NO";
}
else cout<<"NO";
return 0;
} | #include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
vector<int> G[102];
int d[102];
int main()
{
int n,u,k,v;
cin >> n;
for(int i = 0; i < n; ++i){
cin >> u >> k;
for(int j = 0; j < k; ++j){
cin >> v;
G[u].push_back(v);
... | 0 | 10,647,454 |
#include <iostream>
#include <sstream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <memory>
#include <complex>
#include <numeric>
#include <cstdio>
#include <iomanip>
#define REP(i,m,n) for(int i=int(m);i<int(n);i++)
... | #include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
#define endl "\n"
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
int main() {
ll x, y;
cin >> x >> y;
if (x % y == 0) {
cout << ... | 0 | 39,853,961 |
#include <bits/stdc++.h>
using namespace std;
std::vector<int> v;
int main() {
int N,A,B;
cin >> N >> A >> B;
int ans = B-A;
if(ans%2==0){
cout << "Alice";
}else{
cout<<"Borys";
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int t; cin>>t; while(t--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a, b... | 0 | 55,109,402 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
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> vii;
typedef vector<pll> vll;
typedef double dl;
#d... | #include<iostream>
#define rep(i,n) for(int i=0;i<n;++i)
using namespace std;
int main() {
int64_t N, sum = 0;
cin >> N;
int A[N];
rep(i, N) {
cin >> A[i];
sum += A[i];
}
int64_t oneMove = N * (N + 1) / 2;
if (sum % oneMove) {
puts("NO");
return 0;
}
i... | 0 | 98,460,499 |
#include <iostream>
#include <utility>
#include <string>
using namespace std;
struct Card{char suit; int value;};
void bubbleSort(struct Card C[],int n){
for(int i=0;i<n;i++){
for(int j=n-1;j>i;j--){
if(C[j].value<C[j-1].value) swap(C[j],C[j-1]);
}
}
}
void selectionSort(struct Card C[],int n){
for(... | #include <bits/stdc++.h>
using namespace std;
#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 all(a) (a).begin(),(a).end()
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
#define printpair(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<... | 0 | 68,926,549 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | #include <iostream>
using namespace std;
bool check( char c )
{
char C[5+4+2+1] = "yuiophjklnm";
for ( int i = 0; i < 5+4+2+1; i++ ) {
if ( c == C[i] ) return true;
}
return false;
}
int main( void )
{
string input;
while ( cin >> input && input != "#" ) {
int answer = 0;
... | 0 | 27,907,382 |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main() {
int n;
int a,c;
cin >> n;
for (int i = 1;; ++i) {
if (n <= i*(i + 1) / 2) {
a = i;
break;
}
}
c = a*(a + 1) / 2 - n;
for (int i = 1; i <= a; ++i) {
if (i !=c) {
cout << i << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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 ll INF = 1LL << 60;
int main() {
int n, d, x; cin >> n >... | 0 | 414,363 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i,l,r) for (ll i = (ll)l; i < (ll)(r); i++)
const ll mod = 998244353;
ll N;
vector<ll> D;
int main(){
cin >> N;
map<int,int> m;
D.assign(N,0);
rep(i,0,N){
cin >> D[i];
m[D[i]]++;
}
if(D[0]!=0 || m... | #include <bits/stdc++.h>
using namespace std;
char neighbor(char me, char other, char answer) {
if (answer == 'o') {
if (me == 'S') {
if (other == 'S') {
return 'S';
} else {
return 'W';
}
} else {
if (other == 'S') {
... | 0 | 69,986,526 |
#include<iostream>
#include<string>
using namespace std;
class dice{
public:
int d[6];
void rolls(string str){
for(int i = 0; str[i] != '\0'; i++)
roll(str[i]);
}
void roll(char in){
int direc[4][6]={
{1,5,2,3,0,4},
{3,1,0,5,4,2},
{4,0,2,3,5,1},
{2,1,5,0,4,3}
};
int news;
int temp_d[6];
... | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main(){
string s;
cin >> s;
int k;
cin >> k;
int n = s.size();
vector<vector<ll>> dp1(n+1,vector<ll>(k+1)), dp2(n+1,vector<ll>(k+1));
dp1.at(0).at(0) = 1;
rep(i,n) ... | 0 | 36,710,720 |
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <set>
using namespace std;
long long H,W,N;
bool in_area(long long x, long long y){
return x >=1 && y >= 1 && x+2 <= H && y+2 <= W;
}
int main(){
while(cin >> H >> W >> N){
vector< pair<long long,long long> > v(N+10);
vector< p... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define PI 3.1415926535897932
#define MOD 1000000007;
using namespace std;
long long GCD(long long A,long long B){
if(B==0){
return A;
}
else{
return GCD(B,A%B);
}
}
long long LCM(long long A,long long B){
long long g=GCD(A,B);
return A/g*B;
}
long lon... | 0 | 43,706,007 |
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int LCS(string X, string Y) {
int m, n;
m = X.size();
n = Y.size();
int c[m + 1][n + 1];
for (int i = 0; i <= m; ++i) {
c[i][0] = 0;
}
for (int i = 0; i <= n; ++i) {
c[0][i] = 0;
}
X = ' ' + X;
Y = ' ' + Y;
... | #include<iostream>
using namespace std;
int main()
{
int m[51], f[51], r[51];
int total;
int i = 0;
while (cin >> m[i] >> f[i] >> r[i], m[i] + f[i] + r[i] != -3) { i++; }
i = 0;
while (1)
{
if (m[i] == -1 && f[i] == -1 && r[i] == -1) break;
total = m[i] + f[i];
if (m[i] == -1 || f[i] == -1)
{
cout << ... | 0 | 42,586,244 |
#include <bits/stdc++.h>
using namespace std;
int main() {unsigned long long int Q,H,S,D,N;
cin >> Q >> H >> S >> D >>N;
unsigned long long int ans;
if(8*Q<=4*H && 8*Q<=2*S && 8*Q <=D)
{ans=4*Q*N;}
else if (4*H<=2*S && 4*H<=D)
{ans=2*H*N;}
else if (2*S<=D)
{ans=S*N;}
else{
if(N%2==0)
{ans=N*D/2... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0,i##_max=(N);i<i##_max;++i)
#define repp(i,l,r) for(int i=(l),i##_max=(r);i<i##_max;++i)
#define per(i,N) for(int i=(N)-1;i>=0;--i)
#define perr(i,l,r) for(int i=r-1,i##_min(l);i>=i##_min;--i)
#define all(arr) (arr).begin(), (arr).end()
#define S... | 0 | 89,827,258 |
#include<iostream>
#include<vector>
using namespace std;
struct UnionFind {
vector<int> r;
UnionFind(int N) {
r = vector<int>(N, -1);
}
int getRoot(int x) {
if (r[x] < 0) return x;
return r[x] = getRoot(r[x]);
}
bool belongTo(int x, int y) {
int rx = getRoot(x);
int ry = getRoot(y);
... | #include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int N;
cin>>N;
vector<int> A(100,0);
for(int i=2;i<=N;i++){
int j=i;
for(int k=2;k<=j/k;k++)
for(;j%k==0;j/=k)
A[k]++;
if(j!=1)
A[j]++;
}
vector<int> B(0);
for(int i=0;i<50;i++)
if(A[i])
... | 0 | 51,146,319 |
#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 <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
vector<string> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
vector<int> alpha(26,51);
for (int i = 0; i < n; i++) {
vector<int> tmp(26);
for (char c : s[i]) {
tmp[c - '0' - 49]++;
}
for(int j = 0;... | 0 | 52,132,227 |
#include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
int N; cin >> N;
vector<int> A(N); unordered_map<int, int> mp;
REP(i, 0, N) {
cin >> A[i]; mp[A[i]] = i;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<vector<int64_t>> c(n,vector<int64_t>(8));
int64_t b=0;
for(int i=0;i<n;i++){
vector<int64_t> xyz(3);
cin>>xyz.at(0)>>xyz.at(1)>>xyz.at(2);
b+=abs(xyz.at(0))+abs(xyz.at(1))+abs(xyz.at(2));
for(int j=0;j<8;j++){
... | 0 | 26,934,688 |
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int main(int argc, char **argv)
{
int V, E;
cin >> V >> E;
vector<vector<int>> A(V);
vector<int> B(V);
for (int i = 0; i < E; i++) {
int s, t;
cin >> s >> t;
... | #include<bits/stdc++.h>
using namespace std;
#define inf 1000000000
#define INF 1000000000000000
#define ll long long
#define ull unsigned long long
#define M 1000000007
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=(int)m;i<(int)n;i++)
#define RFOR(i,m,n) for(int i=(int)m;i>=(int)n;i--)
... | 0 | 26,284,205 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int N;
vector<int> h;
queue<P> que;
void nextPair(int l, int r) {
int nl = l;
for (int nr = nl; nr <= r; ++nr) {
if (h.at(nr) == 0) {
if (nr != nl) {
que.push(make_pair(nl, nr - 1));... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define MIN(a,b) ((a)>(b)? (b): (a))
#define MAX(a,b) ((a)<(b)? (b): (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
int main(){
int n,m;
cin >> n >> m;
... | 0 | 72,711,444 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <iostream>
#include <ctype.h>
#include <string>
typedef long long ll;
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector <pair<int, int >> pair(n);
rep(i,n){
cin>>pair[i].first>>pair[i].second;
}
sort(pair.be... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | 0 | 88,360,090 |
#include <bits/stdc++.h>
using namespace std;
#define repr(i,a,b) for (int i=a; i<b; i++)
#define rep(i,n) for (int i=0; i< n; i++)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } ret... | #include<bits/stdc++.h>
#define ll long long int
#define db long double
#define mp make_pair
#define F first
#define S second
#define pb push_back
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define all(a) a.begin(),a.end()
#define Nmax 1000005
#define INF 1000000000
#define MOD 1000000007
#define MAXN 1000005
using names... | 0 | 2,774,641 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(n);++i)
const int mod=1000000007;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll x,y;cin >> x >> y;
if(abs(x-y)<=1) cout << "Brown" << end... | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (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 rep_one(i,n) FOR(i,1,n+1)
#define rrep(i,n) for(int i=n-1;i<=0;--i)
#define loop while(true)
#define sl(n) scanf("%lld", &n)
#define si(n) s... | 0 | 99,955,661 |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
long n, a[100010];
int main() {
cin.tie(0); ios_base::sync_with_stdio(false);
cin >> n;
for(int i = 0; i < n; ++i) cin >> a[i];
sort(a, a + n);
int idx = 0;
vector<pair<int, int>> ans;
while(a[idx] < 0) idx++;
if(idx == 0) {... | #include <bits/stdc++.h>
#define INF 1e18
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) Rep(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define MAX 1000
#define ll long long
#define P pair<int,int>
#define cout_set(n) cout << setprecision(10) << (n) << endl;
const double PI=3.14159265358979... | 0 | 33,965,400 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(t)
#define len(x) (ll)(x.size())
#define ub(a,x) (upper_bound(ALL(a),x)-a.begin())
#define lb(a,x) (lower_bound(ALL(a),x)-a.begin())
typedef long long ll;
typedef pair<int,int> pii;
typede... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#i... | 0 | 72,807,228 |
#include <bits/stdc++.h>
using namespace std;
long long dp[90];
int main()
{
char X, Y;
cin >> X >> Y;
if (X < Y)
cout << "<" << endl;
else if (X == Y)
cout << "=" << endl;
else
cout << '>' << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int A, B, C, D;
A = s.at(0) - '0';
B = s.at(1) - '0';
C = s.at(2) - '0';
D = s.at(3) - '0';
for (int tmp; tmp < (1 << 3); tmp++){
bitset<3> bit(tmp);
int sum = A;
char op1 = '-';
char op2 = '-';
char op3 =... | 0 | 82,034,384 |
#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>
#include <cassert>
using namespace std;
#define TEST
#ifdef TEST
#define dout... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int> a(n+1);
int sum = 0;
for(int i=1; i<=n; i++){
cin >> a[i];
sum+=a[i];
}
vector<int> b(n+1);
for(int i=1; i<=n; i++){
... | 0 | 46,776,054 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
int main() {
int n;
cin >> n;
int ans = n / 2 - (n % 2... | #include <bits/stdc++.h>
using namespace std;
vector<int> levelup(vector<int> v, int N){
v[N-1]+=1;
int ind = N-1;
int j=N-1;
for(j=N-1;j>=1;j--){
if(v[j]>1){
v[j-1]+=1;
v[j]=0;
}
}
return v;
}
int main() {
int N,M;
cin >> N >> M;
vector<int> k... | 0 | 64,964,494 |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define Br cout<<endl
#define int long long
#define fe first
#define se second
#define double long double
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define PT(x) cout << (x) << endl
#define last(x) prev(x.end())
#define PTT(x) c... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long N;
cin >> N;
vector<long long> P(N + 1, 0);
for (long long i = 1; i <= N; i++)
{
long long p;
cin >> p;
P[p] = i;
}
multiset<long long> s;
s.insert(0);
s.insert(0);
s.insert(N + 1);
s... | 0 | 23,415,032 |
#include<iostream>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<cstring>
#define ll long long
using namespace std;
const ll mod=1e9+7;
ll ksm(ll b,ll p)
{
ll ans=1;
while(p>0)
{
if(p%2==1)
ans=(ans*b)%mod;
b=(b*b)%mod;
p/=2;
}
return ans... | #include<bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define int long long
#define swap(x,y) (x^=y^=x^=y)
#define debug1(a) cerr<<#a<<" = "<<(a)<<endl;
#define debug2(a,b) cerr<<#a<<" = "<<(a)<<", "<<#b<<" = "<<(b)<<endl;
#define debug3(a,b,c) cerr<<#a<<" = ... | 0 | 33,662,037 |
#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 n;
vector<int> rec(int i, vector<int> b) {
if (b.size() == n) return b;
b.insert(b.end(), i + 1);
b.insert(b.begin(), i + 2);
return rec(i + 2, b);
}
int main() {
int... | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | 0 | 4,022,458 |
#include <stdio.h>
typedef long long ll;
int main() {
int k;
scanf("%d", &k);
ll a[100005];
for (int i = 0; i < k; i++) {
scanf("%lld", &a[i]);
}
ll mn = 2;
ll mx = 2;
for (int i = k - 1; i >= 0; i--) {
if (mn % a[i]) {
mn += a[i] - mn % a[i];
}
mx = mx - mx % a[i] + a[i] - 1;
... | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v(v(T))
#define fi first
#define se second
using namespace std;
typedef long long ll;
typede... | 0 | 32,346,213 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, k, d, a;
cin >> n >> k;
vector<bool> A(n, false);
for(int i = 0; i < k; i++){
cin >> d;
for(int j = 0; j < d; j++){
cin >> a;
A.at(a - 1) = true;
}
}
int count = 0;
for(int i = 0; i < n; i++){
if(!A.at(i)) count++... | #include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <set>
using namespace std;
#define INF (1ll<<60)
int main(int argc, char const *argv[]) {
int n;cin>>n;
vect... | 0 | 93,619,261 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define cans cout << ans << endl
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
typedef long long ll;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i=0; i<n; i++){
cin >> a[i];
... | #include "bits/stdc++.h"
#define REP(i,n) for(int i=0;i< (n);i++)
#define REPR(i, n) for(int i = (n);i >= 0;i--)
#define FOR(i, m, n) for(int i = (m);i < (n);i++)
#define FORR(i, m, n) for(int i = (m);i >= (n);i--)
#define SORT(v, n) std::sort(v, v+n);
#define VSORT(v) std::sort(v.begin(), v.end());
#define VRSORT(v) s... | 0 | 5,636,218 |
#include<bits/stdc++.h>
using namespace std;
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
int a[32]={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int k;
cin>>k;
cout<<a[k-1];
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
using P = pair<int,int>;
typedef long long ll;
int main()
{
int n; cin >> n;
string s[n];
rep(i, n)
cin >> s[i];
set<string> st;
char e = s[0].back();
st.inse... | 0 | 82,536,771 |
#include <iostream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
string hantei(string line);
int main(void){
string line;
vector<string> result;
while (getline(cin, line)){
if (line == "."){
return 0;
}
cout << hantei(line) << endl;
}
return 0;
}
string hantei(string line){
s... | #include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
int main()
{
int i,c=0;
string s,a;
cin>>s>>a;
for(i=0;i<3;i++)
{
if(s[i]==a[i])
c++;
}
cout<<c<<endl;
return 0;
} | 0 | 41,681,272 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define ALL(a) (a).begin(), (a).end()
const ll mod = 998244353;
int main() {
int count[4] = {};
rep(i, 3) {
int a, b;
cin >> a >>... | #include<iostream>
#include<vector>
#include<string>
using namespace std;
int main(void){
vector<string> s;
vector<int> cnt;
string ss,str;
getline(cin,str);
string longest="";
string max;
int maxv=-1;
str+=" ";
for(int i = 0; i < str.size() ; i ++ ){
if(str[i] == ' '){
bool used=true;
... | 0 | 70,515,216 |
#include <iostream>
#include <vector>
using namespace std;
void solve()
{
int n, k;
while(cin >> n >> k, n || k)
{
int max = 0;
int sum = 0;
vector<int> Vec(n);
for(int i = 0; i < n; ++i)
{
cin >> Vec[i];
}
for(int i = 0; i < k; ++i)
{
sum += Vec[i];
}
if(max < sum)
{
max = sum;
}
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (n); i++)
#define irep(i, n) for (int64_t i = 0; i <= (n); i++)
#define rrep(i, ... | 0 | 86,845,960 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
string S; cin >> S;
int ans = I... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL (1LL<<62)
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | 0 | 2,413,958 |
#include <iostream>
#include <cstdio>
using namespace std;
void print_array(int *x, int n)
{
for (int k = 0; k < n; ++k)
{
if (k == n- 1)
{
printf("%d\n", x[k]);
}
else
{
printf("%d ", x[k]);
}
}
}
int main(int argc, char const *argv[])
{
int input_size, min, count = 0;
cin >> input_size;
int ar... | #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout <... | 0 | 55,972,030 |
#include <cstring>
#include <map>
#include <unordered_map>
#include <string>
#include <list>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <cstdio>
#include <iostream>
#include <set>
#include <unordered_set>
using namespace std;
#define MAX(a,b) (a>b?a:b)
#define MIN(a,b) (a<b?a:b)
t... | #include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int INF = 1e9;
int MOD = 1e9+7;
main(){
int dp[20][20];
int W,H,N;
cin >> W >> H;
while(W){
cin >> N;
fill(dp[0],dp[20],0);
for(int i = 0;i < N;i++){
int a,b;
cin >> a >> b;
dp[... | 0 | 63,188,222 |
#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(... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#... | 0 | 39,487,780 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define all(x) (x).begin(), (x).end()
#define endl '\n'
const ll inf = LLONG_MAX;
const long double pi = M_PI;
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}
void YES() {cout << "YES" << endl;}
void NO() {... | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
long long n;
cin >> n;
vector<long long> a(n);
vector<long long> b(n);
long long sum_a = 0, sum_b = 0;
for(long long i = 0; i < n; i++){
cin >> a[i];
sum_a += a[i];
}... | 0 | 27,090,860 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int64_t N, A, B;
cin >> N >> A >> B;
if(N==1 && A!=B){
cout << 0 << endl;
}
else if(N==1 && A==B){
cout << 1 << endl;
}
else if(B<A){
cout << 0 << endl;
}
else{
cout << (B*(N-1)+A)-(B+A*(N-1))+1 << endl;
}
} | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> ... | 0 | 80,144,048 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0;... | #include <iostream>
using namespace std;
int main(){
while(1){
int n ; cin >> n ; if(!n) break;
int* a=new int[n];
for(int i=0;i<n;i++) cin >> a[i];
int MAX=a[0];
for(int i=0;i<n;i++){
int temp=0;
for(int j=i;j<n;j++){
temp+=a[j];
if(temp>MAX) MAX=temp;
};
};
cout << MAX << '\n' ;
dele... | 0 | 23,543,567 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
int32_t main(){
IOS
int n,k;
cin>>n>>k;
int h[n];
for(int i=0;i<n;i++) cin>>h[i];
int t =0;
int ans = 0;
int dp[n+1];
for(int i=0;i<=n;i++) dp[i]= INT_MAX;
dp[1]=0;
for(... | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
double equal(double a, do... | 0 | 1,649,084 |
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
set<int> p, q;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
if (a == 1)p.insert(b);
if (b == n)q.insert(a);
}
bool ret = ... | #include <bits/stdc++.h>
using namespace std;
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;
}
void debug() { cerr << "\n"; }
t... | 0 | 81,832,943 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include <iomanip>
using namespace std;
int main(){
int n;
vector<int>a(1000000);
vector<int>b(1000000);
for(int i=0;i<3;i++){
cin>>a[i];
}
sort(a.begin(),a.end(),std::greater<>());
cout<<10*a[0]+a[1]+a[2]<<endl;... | #include<bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, start, end) for(int i = start; i < (int)(end); ++i)
int main(){
int n, m;
cin >> n >> m;
vector<vector<int>> jobs(m);
rep(i,0,n){
int a, b;
... | 0 | 30,641,957 |
#include <iostream>
#include <algorithm>
#include <sstream>
using namespace std;
string itos(int n){
stringstream ss;
ss << n;
return ss.str();
}
string table = "mcxi";
int value[] = {1000,100,10,1};
int from(string s){
int num = 0;
int ans = 0;
for(int i = 0 ; i < s.size() ; i++){
if(~table.find(s[i])){
int... | #include<iostream>
using namespace std;
int main () {
int H,W;
cin >> H >> W;
while (H || W) {
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
if (!i || i == H - 1 || !j || j == W - 1) {
... | 0 | 1,967,586 |
#include <iostream>
using namespace std;
void solve() {
int a, b, c;
cin >> a >> b >> c;
printf("%s\n", (a == b && b == c) ? "Yes" : "No");
}
int main() {
solve();
return 0;
}; | #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>
#include <numeric>
using namespace std; using ll = long long; using ld = long double; ... | 0 | 27,256,243 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
int N;
vector<ll> T;
void input() {
cin >> N;
T = vector<ll>(N);
rep(i, N) cin >> T[i];
}
ll gcd(ll a, ll b) {
while (b) {
ll tmp = a % b;
a ... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin(... | 0 | 47,432,158 |
#define _GLIBCXX_DEBUG
#include <iostream>
#include <vector>
using namespace std;
using vi = vector<int>;
int main(void){
int n, k;
cin >> n >> k;
vi s(n, 1);
for(int i=0; i<k; i++){
int d;
cin >> d;
for(int j=0; j<d; j++){
int a;
cin >> a;
s[a... | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i,n) for (int i = 0; i < n; i++)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define MOD (1000000007)
#define vi vector<int>
#define vl vector<ll>
#define vb vector<bool>
... | 0 | 10,134,123 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define mp make_pair
#define in insert
#define pi 2*acos(0.0)1
#define srt(s) sort(s.begin(),s.end())
#define rsrt(s) sort(s.rbegin(),s.rend())
#define all(x) x.begin(),x... | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
int main(){
int n;
vector<int> mat[100];
cin >> n;
for(int i=0;i<n;i++){
int u,k;
cin >> u >> k;
for(int j=0;j<k;j++){
int v;
cin >> v;
mat[i].push_back(v-1);
}
}
int d[100];
for(int i=0;i<n;i++) ... | 0 | 99,796,802 |
#include <bits/stdc++.h>
using namespace std;
int gcd(int m, int n) {
int a, b, c;
a = max(m, n);
b = min(m, n);
c = a%b;
while (c > 1) {
a = b;
b = c;
c = a%b;
}
if (c == 1) return 1;
else return b;
}
int main() {
int a, b, c;
cin >> a >> b >> c;
if (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = 1; i < (int)(n + 1); i++)
int main() {
int A,B;
cin>>A>>B;
string S;
cin>>S;
bo... | 0 | 5,134,620 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int N;
cin>>N;
int digit[3];
for(int i=N;i<=999;i++){
bool flag=false;
string num=to_string(i);
if(num[0]==num[1]&&num[1]==num[2]) flag=true;
if(flag){
cout<<i<<endl;
break;
}
... | #include<bits/stdc++.h>
using namespace std;
const int N=2e5;
#define endl "\n"
struct dsu{
int g[N];
void init(){for(int i=0;i<=N;i++)g[i]=i;}
int find(int x){return x==g[x]?x:g[x]=find(g[x]);}
void uni(int u,int v){
int pu=find(u),pv=find(v);
if(pu!=pv)g[pu]=pv;
}
}dis;
int main(){... | 0 | 89,675,143 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(it) it.begin(), it.end()
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPU(i, a, b, s) for(int i = a; i < b; i += s)
#define REPD(i, a, b, s) for(int i = a; i > b; i -= s)
#define endl "\n"
ll INF = 2e18;
ll MOD = 1e9 + 7;
int i, j, ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m); i<(int)(n); i++)
#define RREP(i,m,n) for(int i=(int)(n-1); i>=m; i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define fi first
#define se second
... | 0 | 81,107,026 |
#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=1000000007;
const int INF=1001001001;... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | 0 | 5,097,004 |
#include<bits/stdc++.h>
using namespace std;
void solve()
{
int dp[3][3];
for(int i=0;i<3;i++)
{
for(int j=0;j<3;j++)
{
cin>>dp[i][j];
}
}
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
cin>>arr[i];
for(int i=0;i<n;i++)
{
for(i... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
#define NIL -1
struct Matrix {
Matrix(int r, int c)
: r(r), c(c){
}
int r;
int c;
};
int costs[101][101];
void init_costs() {
for(int i=0; i<101; i++) {
for(int j=0; j<101; j++) {
costs[i][j] = NIL;
}
}
}
int cost... | 0 | 55,656,156 |
#include<iostream>
int main(){
int n,a[10000];
int na = -1000001,nb = 1000001;
long long sum = 0;
std::cin>>n;
for(int i = 0; i < n; ++i){
std::cin>>a[i];
if(na < a[i])
na = a[i];
if(nb > a[i])
nb = a[i];
sum += a[i];
}
std::cout<<nb<<" "<<na<<" "<<sum<<std::endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int dp[2050];
const int mod=1e9+7;
int main(){
int n;
cin>>n;
dp[0]=1;
for(int i=3;i<=n;++i)
for(int j=3;j<=i;++j){
dp[i]+=dp[i-j];
if(dp[i]>=mod)dp[i]-=mod;
}
cout<<dp[n]<<endl;
return 0;
} | 0 | 86,031,785 |
#include <iostream>
using namespace std;
int main()
{
int top, stop, sstop, obj;
top = stop = sstop = 0;
for (int i = 0; i < 10; i++){
cin >> obj;
if (obj > top){
sstop = stop;
stop = top;
top = obj;
}else if (obj > stop){
sstop = stop;
stop = obj;
}else if (obj > sstop){
sstop = obj;
}
... | #include <cstdio>
#include <iostream>
#include <stdlib.h>
using namespace std;
namespace {
struct Node {
char suit;
int value;
};
int SelectionSort(Node* a, int n) {
int nswap = 0;
for (int i = 0; i < n; ++i) {
int minj = i;
for (int j = i + 1; j < n; ++j) {
if (a[j].value < a[minj].value) {
... | 0 | 57,858,497 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll=long long;
int main(){
int K;
string S;
cin >> K >> S;
if(S.size()<=K) {
cout << S << endl;
return 0;
}
else{
rep(i,K){
cout << S.at(i);
}
cout << "..."<< endl;
return 0;
}
} | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
string s;
cin>>s;
string g;
rep(i,s.length()){
if(s[i]=='B') {
if(g.length()>0) g.pop_back();
... | 0 | 12,330,515 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
const int MOD=1e9+7;
const long double Pi=acos(-1);
using P=pair<ll,ll>;
ll gcd(ll a,ll b){
if(a%b==0){return b;}
else{return gcd(b,a%b);}
}
ll lcm(ll a,ll b){
return a*b/gcd(a,b);
}
ll pow(ll x,ll y){
ll tmp=x,res=1;
w... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
int n,k;
cin>>n>>k;
long double ans=0;
for(int i=1;i<=n;i++){
int x=0;
int tmp=... | 0 | 27,616,022 |
#include<iostream>
using namespace std;
bool Eratosthenes[999999+30];
int main()
{
int n,pos;
int c;
while(cin>>n)
{
c=0;
Eratosthenes[1]=false;
for(int i=2; i<=n; i++) Eratosthenes[i]=true;
for(int i=2; i<=n; i++)
{
if(Eratosthenes[i]==true)
... | #include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
using namespace std;
vector< vector<int> > G(10001);
queue<int> que;
int n_v, n_e, u, v;
int in_degree[10001], ans[10001], idx;
int main(){
memset(in_degree, 0, sizeof(in_degree));
scanf("%d %d", &n_v, &n_e);
for(int i=0; i<n_e; i++){
... | 0 | 70,543,413 |
#include<bits/stdc++.h>
#define lld long long
#define pb push_back
#define mk make_pair
#define MAX (lld)1e18+7
#define lim (lld)1e9+7
#define MAX2 (lld)2e5+9
#define ff first
#define ss second
#define fastio ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const lld mod=lim;
lld power(lld x, lld y,... | #include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define ll long long
#define pii pair<int,int>
#define all(x) begin(x), end(x)
#define loop(i,n) for(int i=0; i<n; i++)
#define rep(i,a,b,c) for(int i=a; i<b; i+=c)
#define brep(i,a,b,c) for(int i=a; i>b; i-=c)
#defi... | 0 | 8,437,775 |
#include <bits/stdc++.h>
using namespace std;
#define DBG(x) \
(void)(cout << "L" << __LINE__ \
<< ": " << #x << " = " \
<< (x) << '\n')
typedef long long ll;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int INF = ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using ll = long long;
using namespace std;
int main() {
ll n;
cin >> n;
ll a[n + 1];
ll b[n];
for(ll i = ... | 0 | 24,830,101 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <cmath>
using namespace std;
#define PI 3.1415926535897932384626433832795
#define MOD (1000000007)
#define rep(i, n) for (int i = 0; i <... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>;
#define vvec(s) vector<vector<s>> ;
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++... | 0 | 53,017,938 |
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#define DIV 1000000007
using namespace std;
using ll = long long;
using ldb = long double;
typedef struct {
ll x, y, z;
}cake_t;
int main() {
ll N, M; cin ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int K,S;
int count = 0;
cin >> K >> S;
for(int i=0; i<=K; i++)
{
for(int j=0; j<=K; j++)
{
if(0 <= S-i-j && S-i-j <= K)
{
count += 1;
}
}
}
cout << count << ... | 0 | 87,347,191 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long LL;
typedef long double ld;
typedef vector<ll>VI;
typedef pair<int,int>P;
#define VV(T) vector<vector<T>>
#define sz(x) int(x.size())
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i++... | #include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#include<queue>
#include <sstream>
#include <set>
#include<stack>
const long long MOD = 1000000007;
using namespace std;
typedef long long llong;
int main(){
llong N;
... | 0 | 69,426,438 |
#include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef unsigned long long ll;
int main()
{
int n... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
ll gcd(ll a, ll b){
if (a%b == 0){
return(b);
}
else{
return(gcd(b, a%b));
}
}
ll lcm(ll a, ll b){
return a / gcd(a, b)* b;
}
int kan_hyaku(int n){
... | 0 | 94,902,983 |
#include<bits/stdc++.h>
#ifdef LOCAL
#include "../dump.hpp"
#else
#define dump(...)
#endif
using namespace std;
#define rep(i,n) for(int i=0,i##_len=(n);i<i##_len;i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define ROF(i,a,b) for(int i=(a)-1;i>=(b);i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbeg... | #include<bits/stdc++.h>
using namespace std;
#define int long long
main(){
int n,x;
cin>>n>>x;
int ans=0;
ans+=n;
int res=n-x;
while(res){
if(res%x==0){
ans+=(2*res/x-1)*x;
break;
}
else {
ans+=(2*(res/x))*x;
int tmp=res;
... | 0 | 18,617,144 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int64_t> x(n);
vector<int64_t> y(n);
int p;
int64_t f=0;
for(int i=0;i<n;i++){
cin>>x.at(i)>>y.at(i);
if(i==0)
p=abs(x.at(0)+y.at(0))%2;
else if(p!=abs(x.at(i)+y.at(i))%2){
cout<<-1<<endl;
return 0... | #include <iostream>
#include <string>
using namespace std;
int main(){
int n;
while(cin >> n, n){
int res = 0;
int target = 2;
int state = 0;
for(int i=0;i<n;i++){
string s; cin >> s;
if(s[1] == 'u') state++;
else state--;
if(state == target){
res++;
target = 2-target;
}
}
... | 0 | 91,696,316 |
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#inc... | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(vec) (vec).begin(), (vec).end()
#define SUM(...) accumulate(ALL(__VA_ARGS__),0LL)
#define DSUM(...) accumulate(ALL(__VA_ARGS__),0.0)
using namespace std... | 0 | 72,926,989 |
#define dbg(...) fprintf(stderr,__VA_ARGS__)
#define dpr(x) cerr<<#x<<": "<<x<<endl;
#define dprc(c) do{cerr<<#c<<":";for(auto&_i:(c)){cerr<<" "<<_i;}cerr<<endl;}while(0)
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
int INF = 1e9+7;
#define al... | #include <iostream>
#include <string>
using namespace std;
int main(void){
string S;
cin >> S;
char a,b;
int count[2] = {0};
for(int i=0;i<S.size();i++){
if(i == 0){
a = S[i];
count[0]++;
continue;
}
if(S[i] == a){
count[0]++;
... | 0 | 97,747,903 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main(){
int N;
cin >> N;
cout << 0 << endl;
string S;
cin >> S;
string S0 = S;
if(S == "Vacant") return 0;
int l=1,r=N;
while(true){
int mid = (l+r) / 2;
cout << mid << en... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef vector<int> vi;;
typedef vector<ll> vll;
#define l() length()
#define sz() size()
#define b() begin()
#define e() end()
#define all(x) x.begin(), x.... | 0 | 76,997,785 |
#include <atcoder/all>
#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;
const ul mod = 1000000007;
int main() ... | #ifdef __LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
template<typename T> bool chmax(T &a,T b) {if(a<b) {a=b; return true;} return false;}
template<typename T> bool chmin(T &a,T b) {if(a>b) {a=b; return true;} return false;}
#define itn int
#define fi first
#define se second
#def... | 0 | 32,196,608 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
string str_t, str_h;
int T = 0, H = 0;
for(int i=0; i< n; i++){
cin >> str_t >> str_h;
if(str_t > str_h) T += 3;
else if (str_t < str_h) H += 3;
else {T++; H++;}
}
cout << T << ' ' << H << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)(a).size()
#define mp(a, b) make_pair((a), (b))
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
usi... | 0 | 82,395,707 |
#include <iostream>
int main(int argc, char const *argv[])
{
int a, b, c, answer;
answer = 0;
std::cin >> a >> b >> c;
for (int i = a;i <= b;i++) {
if ((c % i) == 0) {
answer++;
}
}
std::cout << answer << std::endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef unsigned long long ll;
int main(){
int n, c, k;
cin >> n >> c >> k;
... | 0 | 3,974,146 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i... | #include "bits/stdc++.h"
#define ll long long
#define rep2(i,a,b) for(int i=a;i<=b;++i)
#define rep(i,n) for(int i=0;i<n;i++)
#define pii pair<int,int>
#define tii tuple<int,int,int>
#define pq priority_queue<int>
#define pqg priority_queue<int,vector<int>,greater<int>>
#define pb push_back
ll int MOD=998244353;
#defin... | 0 | 8,017,350 |
#include <iostream>
int main(){
int a,b;
while(std::cin >> a >> b, (a|b)){
[&a,&b] () -> void { if(a > b){ std::swap(a,b); } } ();
std::cout << a << " " << b << std::endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-9;
struct mint {
int n;
m... | 0 | 5,352,112 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef vector<double> dvec;
typedef p... | #include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define P(x) cout << (x) << "\n"
#define p(x) cout << (x)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i)... | 0 | 83,511,835 |
#include <iostream>
int main()
{
int N, A, B;
std::cin >> N >> A >> B;
int cnt=0;
for(int i=0; i<N+1; i++)
{
int fig_sum = i/10000 + (i-(i/10000)*10000)/1000 + (i-(i/1000)*1000)/100 + (i-(i/100)*100)/10 + (i-(i/10)*10);
if(A <= fig_sum && fig_sum <= B)
cnt+=i;
}
s... | #include <bits/stdc++.h>
#include <limits.h>
using namespace std;
#define INF 20000000
int N, M, R, d[200][200], r[8], ans = INT_MAX;
bool used[8];
void dfs(int cnt, int las, int dis) {
if (cnt >= R) {
if (ans > dis) ans = dis;
return;
}
for (int i=0; i<R; i++) {
if (!used[i]) {
used[i] = true;
... | 0 | 73,545,224 |
#include<iostream>
using namespace std;
int main(void){
int i;
int j;
for(i = 1;i < 10;i++){
for(j = 1;j < 10;j++){
cout << i << "x" << j << "=" << i*j << endl;
}
}
} | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
while(true){
int n,k,max=-1e9,sum=0;
cin >> n >> k;
if(n==0) break;
int ar[n];
for(int i = 0;i<n;i++){
int a;
cin >> a;
ar[i]=a;
}
for(int i=0;i<k;i++){
sum += ar[i];
}
... | 0 | 54,248,732 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const int MOD = 1000000009;
const long long INF = 1LL << 60;
int main() {
int N , K;
cin >> N >> K;
vector<ll> P(N), C(N);... | #include "algorithm"
#include "bitset"
#include "cmath"
#include "functional"
#include "iomanip"
#include "iostream"
#include "map"
#include "numeric"
#include "queue"
#include "set"
#include "string"
#include "vector"
#define rep(i, to) for (ll i = 0; i < (to); ++i)
#define rep1(i, to) for (ll i = 1; i <= (to); ++i)
#... | 0 | 44,266,661 |
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
int start = max(A, C);
int end = min(B, D);
int ans = end - start;
if (ans > 0) {
cout << ans << endl;
} else {
cout << 0 << endl;
}
... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
ty... | 0 | 17,728,947 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n>> m;
if(n>=2&&m>=2){
cout << n*(n-1)/2 + m*(m-1)/2;
}
else if(n==1 && m==1){
cout << 0;
}
else{
cout << max(n,m)*(max(n,m)-1)/2;
}
} | #include <bits/stdc++.h>
#define INF 5000000000000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
int main()
{
ll N;
cin >> N;
vector<ll> A(N);
vector<ll> B(N);
ll a_sum = 0, b_sum = 0;
for (ll i = 0; i < N; ++i) {
cin >> A.at(i);
a_sum += A.at(i);
}
for (ll i = 0; i < ... | 0 | 44,404,702 |
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>... | #include<iostream>
#include<map>
using namespace std;
int main() {
int n, m;
while(cin>>n>>m &&!(n==0 && m==0)) {
map<int, int, greater<int> > myMap;
for(int i=0; i<n; i++) {
int d, p;
cin>>d>>p;
map<int, int>::iterator tmpItr;
tmpItr = myMap.find(p);
if(tmpItr == myMap.end()) ... | 0 | 23,449,019 |
#include<bits/stdc++.h>
using namespace std;
const long long int modu=1e9+7;
#define endl '\n'
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define inp(x) for(auto &t:x) cin>>t;
#define itr vector<int>::iterator
#define debug(a) cout << #a << "=" << a << ' '<<endl;
#define out(x) for(aut... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll H,N;cin >> H >> N;
vector<ll> A(N);
vector<ll> B(N);
ll Amax = 0;
for(int i=0;i<N;i++){
cin >> A[i] >> B[i];
Amax = max(Amax,A[i]);
}
ll Ha = H + Amax + 1;
vector<vector<ll>> DP(N+1,vector<ll>(Ha,-1));
DP[0][0] ... | 0 | 77,767,651 |
#include <iostream>
#include <cstdio>
using namespace std;
const int N = 200010;
int a[N];
int n, s;
int main()
{
int n;
long long res = 0;
scanf("%d", &n);
for(int i = 1; i <= n; i++)
scanf("%d",&a[i]);
int j = 0;
long long tmp = 0, sum = 0;
for(int i = 1; i <= n; i++)
{
while(j + 1 <= n && (tmp ^ a[j + 1]... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <map>
#include <queue>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(a) (a).begin(), (a).end()
#define rALL(a) (a).rbegin(), (a).rend()
using namespace std;
using ll = long long;
usin... | 0 | 19,872,928 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <cmath>
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;
vector<pair<int64_t,int64_t... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>(b);i--)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll; const int inf = 0x3fffffff; const ll INF = 0x3fffffffffffffff;
template<class T> inline bool chm... | 0 | 57,866,046 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <cmath>
#include <stdio.h>
#include <list>
#include <numeric>
#include <stack>
#include <queue>
#include <tuple>
#include <bitset>
#include <map>
#include <math.h>
using namespace std;
#define rep(i,n) for(int i = 0; i ... | #include <iostream>
#include <vector>
using namespace std;
using int64 = long;
int64 nCr(int64 n, int64 r) {
if (n <= r) return 1;
__int128 nn = 1;
__int128 rr = 1;
for (__int128 i=0; i<r; i++) {
nn *= n - i;
rr *= i+1;
}
return nn / rr;
}
void power_solve(const int& n, const int... | 0 | 54,988,431 |
#include<stdio.h>
int main(){
int i,h,data[250];
scanf("%d",&h);
for(i=0;i<h;++i) scanf("%d",&data[i]);
for(i=0;i<h;++i){
printf("node %d:",i+1);
printf(" key = %d, ",data[i]);
if(i!=0) printf("parent key = %d, ",data[(i-1)/2]);
if(i*2+1<h) printf("left key = %d, ",data[i*2+1]);
if(i*2+2<h) ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(a) begin(a),end(a)
#define FOR(x,val,to) for(int x=(val);x<int((to));++x)
#define FORE(x,val,to) for(auto x=(val);x<=(to);++x)
#define FORR(x,arr) for(auto &x: arr... | 0 | 3,620,771 |
#include <stdio.h>
int main(){
int n,i;
char s[100];
scanf("%d %s", &n,&s);
if(n % 2 != 0){
printf("No");
return 0;
}
for(i = 0; i < n/2; i++){
if(s[i] != s[n/2 + i]){
printf("No");
return 0;
}
}
printf("Yes");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
vector<int> v[100010];
bool win = false;
int search(int curr, int prev) {
if (win) return -1;
int c = 0;
for (auto &next: v[curr]) {
if (next == prev) continue;
c += search(next, curr);
}
if (c >= 2) win = true;
return (c + 1) % 2;
}
... | 0 | 84,015,236 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.