code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 44 101M |
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
#define debug(x) cout<<#x<<" :"<<x<<endl;
#define ff first
#define ss second
#define ar array
#define int long long
#define ld long double
#define pb push_back
#define mp make_pa... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif
#include <limits.h>
#include <math.h>
#include <time.h>
#include <al... | 0 | 57,741,713 |
#include <stdio.h>
#include <string.h>
int main(){
char A[11], B[11], C[11];
scanf("%s %s %s", A, B, C);
int lenA=0, lenB=0, lenC=0;
lenA = strlen(A);
lenB = strlen(B);
lenC = strlen(C);
if(A[lenA-1] == B[0] && B[lenB-1] == C[0] ){
printf("YES");
} else {
printf("NO");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
ll MOD = 1000000007;
int main() {
ll N,Y;
cin >> N >> Y;
Y /= 1000;
bool flag = false;
for(ll yukiti = 0;yukiti<=N;yukiti++){
for(ll itiyou = 0;itiyou <= N-yukiti;itiyou++){
ll hi... | 0 | 58,325,213 |
#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 int long long int
#define ull unsigned int
#define ld long double
#define pb push_back
#define pa pai... | #include <bits/stdc++.h>
using namespace std;
#define fast_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define show(x) cout << #x << " = " << x << '\n'
#define ll long long
#define ull unsigned long long
#define PI 3.1415926535897932384626433832795
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("-ffloat-... | 0 | 41,528,728 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
using ll = long long;
const int INF = 2147483647;
int main(){
string s;
cin >> s;
vector<ll> a(s.size()+1);
ll cnt=0;
for(int i=1;i<=s.size();i++){
if(s.at(i-1)=='<')
cnt++;
if(s.at(i-1)=='>')
cnt=0;
a[i]=cnt;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | 0 | 95,840,030 |
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vec_input(v) for(auto it=v.begin();it!=v.end();it++){cin>>*it;}
#define vec_debug(v) for(auto it=v.begin();it!=v.end();it++){cerr<<*it<<" ";}cerr<<endl;
#define yn(ans) cout<<(ans?"Yes":"No")<<endl
#d... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<bool> snuke(n,false);
int d, a;
for (int i = 0; i < k; i++) {
cin >> d;
for (int j = 0; j < d; j++) {
cin >> a;
snuke[a-1] =... | 0 | 96,855,851 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
... | #include <bits/stdc++.h>
using namespace std;
#define mp(a,b) make_pair(a,b)
#define ff first
#define setp(a) setprecision(a)<<fixed
#define ss second
#define fori(v) for(ll i=0; i<v; i++)
#define forj(v) for(ll j=0; j<v; j++)
#define fork(v) for(ll k=0; k<v; k++)
#define forl(v) for(ll l=0; l<v; l++)
#define fort(v) f... | 0 | 34,288,248 |
#include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define dump(v) \
cerr << #v ":[ "; ... | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 100005
char L[SIZE];
ll dp[2][SIZE];
int main(){
scanf("%s",L);
int len;
for(len = 0; ... | 0 | 9,570,978 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef pair<int,int> PII;
#define SORT(a) sort((a).begin(),(a).end())
#define rSORT(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i... | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
double pi=acos(-1);
#define ll long long
#d... | 0 | 20,114,681 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0,i##_len=(int)(n);i<i##_len;i++)
#define rep1(i,n)for(int i=1,i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=(int)(n)-1;0<=i;i--)
#define rrep1(i,n) for(int i=(int)(n);1<=i;i--)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it... | #include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<cmath>
#include<vector>
#include<stack>
#include<climits>
#include<cstring>
#include<queue>
#include<complex>
using namespace std;
void grading(int m, int f, int r){
if(m == -1 || f == -1) {cout << "F" <<endl;return;}
if(m+f >= 80... | 0 | 59,268,248 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = ll(1e12);
const ll mod = ll(1e9+7);
const double pi = acos(-1);
#define rep0(i,n) for(ll (i) = 0; (i) < (n); ++(i))
#define rrep0(i,n) for(ll (i) = (n) - 1; (i) >= 0; --(i))
#define rep1(i,n) for(ll (i) = 1; (i) <= (n); ++(i))
#define rr... | #include <queue>
#include <iostream>
#include <stdio.h>
#include <algorithm>
using namespace std;
int map_max;
int map[110][110];
int rows;
int cols[110];
int howfar[110];
int far;
int visited[110];
void get_map();
void print_map();
int search(int node);
void print_result();
void check_result();
int main()
{
get_map(... | 0 | 20,451,390 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-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(){
string s;
cin >> s;
ll l;
l=s.size();
ll t;
vector <ll> al(26,0);
rep(i,l){
t=s[i];
++al[t-97];
}
ll ans=0;
rep(i,26){... | 0 | 34,615,819 |
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define LL_INF 9000000000000000000
#define LL_MINF -9000000000000000000
#define INT_INF 2000000000
#define INT_MINF -2000000000
#define all(a) (a).begin(), (a).end()
#def... | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define sz(x) ll(x.size())
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 10e15;
const ll MINF = -10e10;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
typedef priority_queue<... | 0 | 40,425,425 |
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<queue>
#include<vector>
#include <bitset>
#include <cmath>
#include <limits>
#include <iostream>
#include<map>
#include<tuple>
using namespace std;
#define INF 21000000000
#define MAX 210000
#define MOD 998244353
typedef long long ll;
ty... | #include <iostream>
using namespace std;
int main(){
int n,i,ans=1;
char s,spre;
cin >> n;
cin >> spre;
for(i=1;i<n;++i){
cin >> s;
if(s==spre) continue;
else{
++ans;
spre = s;
... | 0 | 52,785,770 |
#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>
#incl... | #include<bits/stdc++.h>
using namespace std;
int parent(int i){ return i/2; }
int left(int i){ return i*2; }
int right(int i){ return i*2+1; }
int main(){
int H, tree[100001];
scanf("%d",&H);
for( int i = 1; i <= H; ++i){
scanf("%d",&tree[i]);
}
for( int i = 1; i <= H; ++i){
printf("... | 0 | 33,394,509 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
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 NIL = -1;
const int INF = (1<<21);
const lo... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair... | 0 | 47,860,182 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
if (n==1)
{
cout<<"1";
}
if (n==2)
{
cout<<"1";
}
if (n==3)
{
cout<<"1";
}
if (n==4)
{
cout<<"2";
}
if (n==5)
{
cout<<"1";
}
if (n==6)
{
cout<<"2";
}
if (n==7)
... | #include <bits/stdc++.h>
using namespace std;
#define uint unsigned int
#define ull unsigned long long
typedef string str;
typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
typedef map<int, int> mii;
typedef vector<int> vi;
typedef vector<bool> vb;
#define pb push_back
#define fi first
#define se se... | 0 | 20,416,476 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b;
cin >> a >> b;
int c = (a + b)/2*2;
int d = (a + b) - c;
cout << (a + b )/2 + d << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
int main(){
string s;
cin >> s;
ll ans = 0;
ll hd = 0, bk = s.size()-1;
while(bk - hd > 0){
if(s[hd] == s[bk]){
hd++;
bk--... | 0 | 52,405,923 |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#define MAXN 200000
using namespace std;
int X[MAXN+5],W[MAXN+5];
int sum[2][MAXN+5],pos[MAXN+5];
int ans[MAXN+5];
int N,L,T;
int main()
{
scanf("%d %d %d",&N,&L,&T);
int T1=T;
for(int i=0;i<N;i++)
{
scanf("%d %d",&X[i],&W[i])... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | 0 | 7,885,468 |
#include<cstdio>
#include<vector>
#include<algorithm>
#include<utility>
#include<numeric>
#include<iostream>
#include<array>
#include<string>
#include<sstream>
#include<stack>
#include<queue>
#include<list>
#include<functional>
#define _USE_MATH_DEFINES
#include<math.h>
#include<map>
#define SENTINEL 1000000001
#define... | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
bool used[100000] = {};
vector<int> G[100000];
int nxt(int v){
for(int to : G[v]){
if(!used[to]) return to;
}
return -1;
}
int main(){
int n,d[100000] = {};
bool flag = false;
cin >> n;
for(int i = 0;i < n - 1;i++){
int a,b;
cin >>... | 0 | 79,774,243 |
#include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REPD(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = a; i < int(b); i++)
#define FORD(i, a, b) for (int i = b - 1; i >= in... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
struct Card {
char suite;
int num;
};
vector<Card> selectionSort(vector<Card> A) {
for (size_t i = 0; i < A.size() - 1; i++) {
size_t minj = i;
for (size_t k = i + 1; k < A.size(); k++) {
if (A[k].num < A[minj].num) {
... | 0 | 9,360,071 |
#include <cstdio>
int main(){
int n, m;
static int dict[256];
char k, v, x;
while (scanf("%d\n", &n)){
if (!n) return 0;
for (int i = 0; i<256; i++) dict[i] = i;
for (int i = 0; i<n; i++){
scanf("%c %c\n", &k, &v);
dict[(int)k] = (int)v;
}
scanf("%d\n", &m);
for (int i = 0; i<m; i++){
scanf("%c... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll N,minimum=1000000000;
cin>>N;
vector<ll> A(N);
for(ll i=0;i<N;i++){
cin>>A.at(i);
minimum=min(minimum,A.at(i));
}
while(true){
ll x=minimum,check=0,count=0;
for(ll i=0;i<N;i++){
if(A.at(i)!=x || check>0){... | 0 | 35,316,573 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 100005;
const int MOD = 1000000007;
int fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++){
fac[i] = fac[i - 1] * i % MOD;
... | #include <iostream>
#include<iomanip>
#include <string>
#include<vector>
#include<algorithm>
#include<utility>
#include<queue>
#include<math.h>
#include<stack>
#include<set>
#include<map>
#define INF int(1e6+1)
#define rep(i,n,m) for(int i=n;i<m;i++)
using namespace std;
int main()
{
long long int a, b,t;
cin >> a >... | 0 | 95,453,291 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
int main(){
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int dx = x2 - x1;
int dy = y2 - y1;
int x3 = x2 - dy;
int y3 = y2 + dx;
int x4 = x3 - dx;
int y4... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rng(i,l,r) for(int i=int(l);i<int(r);i++)
#define rep(i,r) rng(i,0,r)
#define rrng(i,l,r) for(int i=int(r)-1;i>=int(l);i--)
#define rrep(i,r) rrng(i,0,r)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#def... | 0 | 18,500,861 |
#include<bits/stdc++.h>
using namespace std;
#define AC ios::sync_with_stdio(0),cin.tie(0);
#define ll long long int
int main(){
AC
string a,b;
cin>>a>>b;
int ans=100000;
for(int i=b.size()-1;i<a.size();i++){
int j=i;
int k=b.size()-1;
int countt=0;
if(a[j]!=b[k])countt++;
while(k-- && j--){
if(a[j]!=... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cmath>
#include<cstdio>
#include<tuple>
#include<bitset>
#include<map>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define ALL(x) x.begin(),x.end... | 0 | 1,873,714 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REPR(i,n) for(int i=n; i>-1; --i)
#define ALL(a) (a).begin(),(a).end()
#define FILL(a,x); REP(i,sizeof(a)){ (a)[i]=(x); }
#define CINA(a,n); REP(i,(n)){ cin >> (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define UNIQUE(v) v.erase(unique(all... | 0 | 92,284,437 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
int main(){
int X, A, B;
cin >> X >> A >> B;
if (B - A > X) cout << "dangerous" << endl;
else if (B - A > 0) cout << "safe" << endl;
else cout << "delicious" << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end... | 0 | 34,160,942 |
#include <bits/stdc++.h>
#define rep(i , n) for (int i = 0; i < (int)(n); i++)
const int INF = 1<<29;
using namespace std;
using ll = long long;
int main(){
int N;
cin >> N;
vector <string> S(N);
vector <int> A(N , 0);
for(int i = 0; i < N; i++){
string s;
cin >> s;
sort(s.be... | #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 | 2,808,745 |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
map<int, int> init;
map<int, int> fin;
for (int i = 0; i < n; i++){
cin >> a[i];
init[a[i]] = i;
}
sort(a.begin(), a.end());
for (int i =0 ; i < n; i++){
... | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define fs first
#define sc second
#define task "tst"
using namespace std;
const ll N = 3e5 + 9;
const ll inf = 1e9 + 7;
typedef pair<ll,ll> LL;
ll x,y,a,b,c,R[N],G[N],C[N],i,j;
vector<ll> res;
bool lf(ll x,ll y){
return x > y;
}
int main(){
io... | 0 | 52,497,481 |
#include<bits/stdc++.h>
#define ll long long int
#define vec vector<ll>
#define mat vector<vec>
using namespace std;
const ll mod=1000000007;
const ll inf=LONG_LONG_MAX;
ll dx4[4]={1,0,-1,0};
ll dy4[4]={0,-1,0,1};
ll dx8[8]={1,0,-1,1,-1,1,0,-1};
ll dy8[8]={1,1,1,0,0,-1,-1,-1};
string zero(ll a){
string t=to_string(a)... | #include <bits/stdc++.h>
#define ll long long
#define pi (acos(-1))
#define rep(i, n) for (unsigned long long i = 0; i < (unsigned long long)(n); ++i)
using namespace std;
std::vector<unsigned ll> genprimevec(const unsigned ll N);
int main()
{
int n;
cin>>n;string s,t;
cin>>s>>t;
string ans;
rep(i,n){
... | 0 | 94,914,562 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using P = pair<int, int>;
c... | #include<iostream>
#include<unordered_map>
#include<bitset>
#include<math.h>
#include<vector>
#include<set>
#include<algorithm>
#include<ctype.h>
#include<unordered_set>
#include<string>
#include<iomanip>
#include<queue>
#include<limits>
#include<map>
#include<stack>
#include<iterator>
#include<cstring>
#include<deque>... | 0 | 95,216,709 |
#include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define test int t;cin>>t;while(t--)
#define REP(i,n) for (int i = 1; i <= n; i++)
#define MOD 1000000007
#define ll long long
#define int ll
#define pb push_back
#define ii pair<int,int>
#define llll pai... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int i, j;
int h, w; cin >> h >> w;
bool consecutive = true;
vector<int> row_index(1, -1);
vector<vector<char>> board(h, vector<char>(w));
for (i=0; i<h; i++)
{
for (j=0; j<w; j++)
{
cin >> board.at(i).at(... | 0 | 40,766,197 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
long long dp[100010];
long long h[100010];
template<class T> void chmin(T &a, T b) {
if (a>b) {
a = b;
}
}
template<class T> inline void chmax(T &a, T b) {
if (a<b) {
a = b;
}
}
int main() {
int n; cin >> n;
int m; cin >... | #include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define IOS ios :: sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define AfterDecimal(n) cout << fixed << setprecision(n);
#define ll long long int
#define ld long double
#define all(a) a.begin(), a.end()
#define pii ... | 0 | 74,360,630 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b, a % b);
}
using Graph = vector<vector<int>>;
ll calc(ll a, ll b, ll p){
if(b == 0) return 1;
else if(b%2 == 0){
ll d = calc(a,b/2,p);... | #include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
typedef long long LL;
const LL MOD = 1e9 + 7;
const int N = 1e5 + 7, M = 1e7, OO = 0x3f3f3f3f;
#define AC ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin.sync_with_stdio(0);
int main()
{
LL n,array1[2*N],i,T,counter=0,flag=0;
cin>>n>>T;
for(i=0;i<n;++... | 0 | 58,609,838 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
int a = vec.at(0);
int b = vec.at(N-1);
vector<int> P(b-a+1,0);
int y = 0;
for (int i = a; i < b+1; i++) {
in... | #include <bits/stdc++.h>
using namespace std;
bool cmp(long long a, long long b)
{
return a>b;
}
int main()
{
int n,m;
cin>>n>>m;
long long mx = -(99999999);
long long arr[9999][3];
for(int i=1; i<=n; i++){
for(int j=0; j<3; j++)cin>>arr[i][j];
}
for(int i=0; i<8; i++){
v... | 0 | 977,187 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
vector<int> same;
string S, T;
cin >> S >> T;
int end = S.length() - T.length();
for (int i = 0; i <= end; ++i) {
int counter = 0;
for (int j = 0; j < T.length(); ++j) {
if (S[i + j] =... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <unordered_map>
#include <vector>
#include <string.h>
#include <set>
using namespace std;
#define COUT(x) cout << #x << " = " << (x) << " (L" <... | 0 | 13,755,137 |
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(... | #include <bits/stdc++.h>
using namespace std;
long long INF = 1000000000000000000;
int main(){
int N;
cin >> N;
vector<long long> a(N);
for (int i = 0; i < N; i++){
cin >> a[i];
}
long long tv = -100;
long long fv = INF;
while (fv - tv > 1){
long long mid = (tv + fv) / 2;
vector<long long> b... | 0 | 87,877,277 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll N,M;cin >> N >> M;
vector<ll> A(N,0);
vector<ll> B(N+1,0);
for(int i=0;i<N;i++){
cin >> A[i];
B[i+1] = (A[i]+B[i])%M;
}
sort(B.begin(),B.end());
ll sum = 0;
ll i = 0;
for(int j=0;j<=N;j++){
if(j==N){
l... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <queue>
#include <utility>
#include <map>
#include <bitset>
#include <numeric>
#define ll long long
using namespace std;
using p = pair<ll, ll>;
ll dx[8]={ 0, 1, 0,-1, 1, 1,-1,-1};
ll dy[8]={ 1, 0,-1, 0, 1,-1, 1,-1};... | 0 | 26,574,719 |
#include <iostream>
int s,e;int main(){while((s+=(e=e%9+1)<2)<10)std::cout<<s<<'x'<<e<<'='<<s*e<<'\n';0;} | #include <bits/stdc++.h>
using namespace std;
const string YES = "POSSIBLE";
const string NO = "IMPOSSIBLE";
int gcd(int a, int b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
void solve(long long N, long long K, std::vector<long long> A)
{
long long gc = 0, ma = 0;
for (int i = 0; i < N; i++... | 0 | 43,452,400 |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T...... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N ;
cin >> N ;
string b[N];
for ( int i=0 ; i<N ; i++){
cin >> b[i] ;
}
int M ;
cin >> M ;
string r[M];
for ( int i=0 ; i<M ; i++){
cin >> r[i] ;
}
int ben[N] ;
int mx=0 ;
for (int i=0 ; i <N ; i++){
ben[i]=0;
}... | 0 | 46,492,419 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define LL long long
#define pii pair <LL,LL>
#define fi first
#define se second
#define pb push_back
#define mpr make_pair
using namespace std;
const LL MOD=1e9+7;
LL n,x,y,ans=0;
int main()
{
cin>>n;
repn(i,n) ans... | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define mem(x, val) memset(x, val, sizeof(x))
#define mk make_pair
#define f(i,n) for(i = 0; i < n; i++)
#define f1(i,n) for(i = 1; i <= n; i++)
#define all(a) a.begin(),a.end()
#define upp(v,val) upper_bound(v.begin(), v.end(), val)
#define lower(v,val... | 0 | 49,068,676 |
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using P = pair<int, int>;
using vec = vector<lint>;
using mat = vector<vector<int>>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
int ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define pii pair<int, int>
#define pll pair<long long, long long>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define DEBUG 1
#define cerr if (DEBUG) cerr
#define test cerr << "hi\n";
mt19937_64 rng(c... | 0 | 50,205,674 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
int h[100005];
int dp[100005] = {};
cin>>n;
for(int i=0;i<n;i++){
cin>>h[i];
}
for(int i=1;i<n;i++){
if(i==1){
dp[i] = abs(h[i]-h[i-1]);
}
else{
dp[i] = min(abs(h[i]-h[i-1])+dp[i-1],abs(h[i]-h[i-2])+dp[i-2]); ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> C(N - 1);
vector<int> S(N - 1);
vector<int> F(N - 1);
for (int i = 0; i < N - 1; i++) {
cin >> C[i] >> S[i] >> F[i];
}
for (int i = 0; i < N - 1; i++) {
int time ... | 0 | 14,050,251 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
double w , h, x, y;
cin>>w>>h>>x>>y;
double ans =( w * h )/2;
cout.precision(15);
cout<<ans<<" ";
if( w/2 == x && h/2 == y )
{
cout<<1;
}
else cout<<0;
} | #include<bits/stdc++.h>
#define godspeed ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define limit 1000000000000000000
#define mod 1000000007
#define llu long long unsigned
#define ll long long
#define ld long double
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define... | 0 | 51,161,000 |
#include <bits/stdc++.h>
using namespace std;
long long A[100005];
int K;
bool doesItWork(long long num){
long long temp = num;
for(int i = 0; i < K; i ++){
temp = temp/A[i]*A[i];
}
return temp == 2;
}
int main(){
scanf("%d", &K);
for(int i = 0; i < K; i ++){
scanf("%lld", &A[i])... | #include <algorithm>
#include <cstdio>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<double, double> P;
int n;
double cos60 = cos(60.0 / 180.0 * M_PI);
double sin60 = sin(60.0 / 180.0 * M_PI);
void koch(in... | 0 | 34,829,152 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using pll = pair < ll, ll >;
#ifndef ONLINE_JUDGE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template < typename Arg1 >
void __f(const char* name, Arg1&& arg1) {
cerr << name << " : " << arg1 << std :: endl;
}
template < t... | #include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <iostream>
#include <iterator>
#include <numeric>
#include <sstream>
#include <fstream>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cstdio>
#include <vector>
#include <bitset>
#inc... | 0 | 19,418,872 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll, vl> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
typedef vector<vl> vvl... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
int main() {
int n;
scanf("%d", &n);
vector<int> a(n);
rep(i, n) scanf("%d", &a[i]);
a.insert(a.begin(), 0);
a.insert(a.end(), 0);
int cost = 0;
rep(i, n + 1) {
cost += abs(a[i] - a[i... | 0 | 17,817,939 |
#include <algorithm>
#include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
using namespace std;
using ll = long long;
int main() {
ll N, SA{}, SB{}, SD, ans{};
cin >> N;
vector<ll> A(N), B(N), D(N);
for(ll &a: A) cin >> a, SA += a;
for(ll &b: B) cin >> b, SB += b;
for (int i = 0; i !... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, n) for(int i = 1; i <= n; i++... | 0 | 3,156,526 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c,d,e,f,g,h,i;
cin>>a>>b>>c>>d>>e>>f>>g>>h>>i;
int N;
cin>>N;
vector<int> aa(N);
for(int j=0;j<N;j++){
cin>>aa.at(j);
}
for(int j=0;j<N;j++){
if(aa.at(j)==a){
a=0;
}
if(aa.at(j)==b){
b=0;
}
if(aa.at(j)... | #ifdef __GNUC__
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include <set>
#include <qu... | 0 | 52,200,423 |
#include <bits/stdc++.h>
const int N = 100005;
int n, l, q, x[N], p[N][17];
int main() {
std::ios::sync_with_stdio(0), std::cin.tie(0);
std::cin >> n;
for (int i = 0; i < n; ++i) std::cin >> x[i];
std::cin >> l >> q;
for (int i = 0, j = 0; i < n; p[i++][0] = j)
while (j + 1 < n && x[j + 1] - x[i] <= l) ++j;
for... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr ll ZERO = 0;
constexpr int Inf = 1000000000;
constexpr ll INF= 1e18;
constexpr ll MOD = 1000000007;
const double PI = 3.1415926535897;
typedef pair<ll,ll> P;
int N;
string S;
string k(int a,int b) {
vector<int> ret(N + 2);
ret.at(0) = ... | 0 | 90,520,874 |
#include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, i;
cin >> n;
int f[n];
f[0] = 1, f[1] = 1;
for (i = 2; i <= n; ++i) {
f[i] = f[i - 1] + f[i - 2];
}
cout << f[n] << '\n';
return 0;
} | #include <stdio.h>
int main(){
int array[10][10];
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
scanf("%d", &array[i][j]);
}
}
int brpKali;
scanf("%d", &brpKali);
int percobaan[100];
for(int k=0;k<brpKali;k++){
scanf("%d", &percobaan[k]);
}
for(int l... | 0 | 65,749,668 |
#include <bits/stdc++.h>
using namespace std;
struct D{
int size;
vector<int> num;
D(){
size = 6;
num = vector<int>{1,2,3,4,5,6};
}
D(vector<int> _num){
size = _num.size();
num = _num;
}
void change(vector<int> idx){
auto ret(num);
for(int i = 0; i < size; i++){
ret[i] = num[idx[i]];
}
swap(re... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll... | 0 | 11,989,773 |
#include<iostream>
#include<string>
using namespace std;
int main()
{
string s,t;
cin>>s>>t;
string ans=t+s;
cout<<ans;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
int main(void) {
int64_t N, D, A;
cin >> N >> D >> A;
vector< pair<int64_t,int64_t> > monster(N);
for(int i=0; i<N; i++) {
cin >> monster[i].first >> monster[i].second;
}
sort(monster.begin()... | 0 | 29,776,343 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fi first
#define se second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define debug(a) cout << #a << " = " << a << " ";
#define endl "\n"
#define MOD (int) 1e9+7
#define inf (int) (1e18)
void solve(){
ll n;
cin>>n;
... | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | 0 | 33,771,378 |
#include <bits/stdc++.h>
#define rep(i, a) for(int i = 0; i < a; i++)
#define all(v) v.begin(), v.end()
#define int long long
using namespace std;
signed main() {
string s;
cin >> s;
rep(i, s.size()) {
cout << s[i];
if(i == 3) cout << " ";
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
ll N, P;
string S;
ll pow_mod(ll n, ll k, ll mod) {
if (k == 0) return 1;
else if (k % 2 == 1) {
return pow_mod(n, k-1, mod) * n % mod;
}
else {
ll tmp = pow_mod(n, k/2, mod);
return t... | 0 | 9,973,137 |
#include <iostream>
#include <cstring>
#include <map>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <set>
#include <vector>
#include <queue>
#include <list>
#include <numeric>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <math.h>
#include <stack>
#include <climits>
#include <bits... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[20];
int main() {
int n,k;
cin >> n >> k;
ll ans = 1e18;
for (int i = 0; i < n; i++) cin >> a[i];
for (int i = 0; i < (1 << n); i++) {
int cnt = 0;
for (int j = 0; j < n; j++) {
if ((i >> j) & 1) cnt... | 0 | 70,206,801 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
int result = (n - 2) * 180;
cout << result << "\n";
return 0;
} | #include<bits/stdc++.h>
#define ALL(c) (c).begin(),(c).end()
#define EACH(i,c) for(auto i=(c).begin();i!=(c).end();++i)
using namespace std;
#define int long long
void solve(long long W, long long H, std::vector<long long> p, std::vector<long long> q){
vector<pair<int,int>> v;
for(int i = 0; i < W; ++i) {
... | 0 | 45,215,449 |
#include <iostream>
#include <vector>
using namespace std;
const long long INF = 1e18;
vector<pair<long long, long long>> divisor_pair(long long n) {
vector<pair<long long, long long>> v;
for (long long i = 1; i * i <= n; ++i) {
if (n % i == 0) v.emplace_back(i, n/i);
}
return v;
}
int digit(long long x) {
int r... | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
vector<int> v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
vector<int> dp(n, -1);
function<int(int)> calc_dp = [&] (int i) {
if (dp[i] != -1) {
return dp[i];
}
... | 0 | 9,261,638 |
#include <stdio.h>
#include <string.h>
int main(){
char S [30]; char T [30]; char N [30];
int a, b;
scanf("%s %s", &S, &T);
scanf("%d %d", &a, &b);
scanf("%s", &N);
if (strcmp(S, N)==0) {
printf("%d %d", a-1,b);
}
else if (strcmp(T,N)==0) {
printf("%d %d", a,b-1);
}
return 0;
} | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <string>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#define INF (int)1e09
using std::cin;
using std::cout;
using std::endl;... | 0 | 55,666,316 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0;i<n;i++)
int main(){
int n, k;
cin >> n >> k;
vector<int> a(n);
vector<int> c(n,n);
rep(i,n){
cin >> a[i];
}
rep(j,k){
vector<int> d(n+1);
rep(i,n){
d[max(i-a[i],0)]++;
... | #include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using li = long long int;
using uli = unsigned long long int;
using namespace std;
int main() {
fastIO;
string s;
cin >> ... | 0 | 63,532,113 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define clr(a,b) memset(a,b,sizeof(a))
ll n,m,k,ans;
char c[10005];
ll p,q,r;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n;
for(int i=1;i<=n;i++){
cin>>c[i];
if(c[i]=='R')p++;
if(c[i]=='G')q++;
if(c[i]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll N,M,tmp,ans;
cin>>N>>M;
tmp = M;
tmp -= (N*2);
if(tmp < 0){
ll kake = M/2;
ans = kake;
}
else{
ans = N;
ans += (tmp/4);
}
cout<<ans<<endl;
return 0;
} | 0 | 9,286,902 |
#include <bits/stdc++.h>
using namespace std;
bool solve(string S) {
if (S[0] != 'A') return false;
int N = S.size();
int con = 0;
for (int i = 0; i < N; ++i) if (S[i] >= 'A' && S[i] <= 'Z') ++con;
if (con != 2) return false;
bool exist = false;
for (int i = 2; i+1 < N; ++i) if (S[i] == 'C') exist = true;... | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using p = pair<int, int>;
typedef vector<int> vi;
string divide[4] = {"dream", "dreamer", "erase", "eraser"};
int main() {
string S;
cin >> S;
reverse(S.begin(), S.end());
for (int i = 0; i < ... | 0 | 59,724,690 |
#include <bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
const bool debug=false;
#define DEBUG if(debug==true)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1000000007;
int main(void) {
ll n;
cin>>n;
ll val[n];
rep(i,n){
ll tmp; cin>>tmp;... | #include<iostream>
#include<algorithm>
#include<string>
#include<cstdlib>
#include<map>
#include<iomanip>
#include<sstream>
#include<vector>
#include<stack>
#include<math.h>
#include<queue>
#include<complex>
#include<random>
#include<ctime>
#include<set>
using namespace std;
#define SAY_YES cout<<"YES"<<endl;
#define S... | 0 | 87,322,611 |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
constexpr int MOD=998244353;
#define INF (1<<30)
#define LINF (lint)(1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(long... | 0 | 13,933,853 |
#include <iostream>
#include <queue>
using namespace std;
int main(){
int n,i;
float tmp,v1,v2;
cin >> n;
priority_queue<float,vector<float>,greater<float>> v;
for(i=0;i<n;++i){
cin >> tmp;
v.push(tmp);
}
while(1){
v... | #include<bits/stdc++.h>
#define pi acose(-1)
typedef long long int ll;
typedef double dl;
using namespace std;
const int mx = 1e2+5;
int main()
{
int n, h1;
cin>>n;
if(n%2==1)
{
cout<<"No"<<endl;
return 0;
}
char str[n+5];
for(i... | 0 | 33,835,615 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
typedef vector<pii> vpii;
typedef vector<pil> vpil;
typedef vector<pli> vpli;
typedef set<i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | 0 | 6,690,914 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <string>
#include <list>
#include <bitset>
using namespace std;
typedef long long LL;
typedef un... | #include <iostream>
#include <cmath>
using namespace std;
int test(double x1, double y1, double x2, double y2, double x3, double y3, double xp, double yp)
{
double xa = (x2 - x1);
double ya = (y2 - y1);
double xb = (x3 - x1);
double yb = (y3 - y1);
double xc = (xp - x1);
double yc = (yp - y1);
... | 0 | 98,700,477 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int N,K,a,ans = 0;
cin >> N >> K;
map<int64_t,int> mp;
for(int i=0;i<N;i++) {
cin >> a;
mp[a]++;
}
vector<int> ball(mp.size());
a = 0;
for(auto m:mp) {
ball[a] =m.second;
a++;
}
sort(ba... | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define initdp(a, b) for (int i = 0; i <= a; i++) for (int j = 0; j <= b; j++) dp[i][j] = -1;
#define pb push_back
#define pii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define all(arr) arr.begin(), arr.end()
#define rep(i,... | 0 | 53,188,523 |
#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | #include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<string>
#include<stdio.h>
#include<stdlib.h>
#include<float.h>
#include<tuple>
#include<string.h>
#include<iomanip>
#include<stack>
#include<queue>
#include<map>
#include<deque>
using namespace std;
#define ll long long
#define rep(i,n) f... | 0 | 3,819,168 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
cout << ( (a[0]==a[1] &&a[1]==a[2])||
(a[1]==a[2] && a[2]==a[3]) ? "Yes" : "No" )
<<endl;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long int x,y,z;
long long int count=0;
int arr[1000];
cin>>x;
for(int i=0;i<x;i++){
cin>>arr[i];
}
for(int i=0;i<x;i++){
int ck=i;
for(int j=i;j<x;j++){
if(arr[j]<arr[ck]){
ck=j;
... | 0 | 25,544,393 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
int main() {
std::string str;
while(std::cin >> str) {
if(str == "0") break;
int sum = 0;
for(int i = 0; str[i] != '\0'; ++i) {
sum += str[i] - '0';
}
std::cout << sum << std::endl;
}
return 0;
} | #include <map>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
const int inf = 1012345678;
int solve(string S) {
int N = S.size();
map<int, int> dp;
dp[0] = 0;
int bit = 0;
for (int i = 0; i < N; ++i) {
bit ^= 1 << (S[i] - 'a');
int opt = (dp.find(bit) != dp.end() ? dp[bit] : in... | 0 | 69,393,658 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (int i = j; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
template<... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#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 rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i... | 0 | 48,831,789 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
ll mypow(ll x,ll n){
ll ret=1;
while(n>0){
if(n&1==1){
ret *=x;
}
x *=x;
n >>=1;
}
return ret;
}
int main() {
ll N,M;
cin >> N >>M;
vector<ll> x(N),y(N),z(N);
for(int i=0;i<N;i++... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
static const int MAX = 500;
int c[MAX], s[MAX], f[MAX];
int main(){
int n;
cin >> n;
for(int i = 0; i < n-1; i++){
cin >> c[i] >> s[i] >> f[i];
}
for(int i = 0; i < n-1; i++){
int t = s[i] + c[i];
for(int j =... | 0 | 27,922,467 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
string s;
cin>>s;
ll ans=15-s.size();
for(ll i=0;i<s.size();i++){
if(s[i]=='o'){
ans++;
}
}
cout << (ans>=8?"YES":"NO");
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vout(x) rep(i,x.size()) cout << x[i] << " "
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return... | 0 | 981,245 |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int maxx=2000000000;
int n;
int p[110],dp[110][110];
int main (){
cin>>n;
for(int i=1;i<=n;i++){
dp[i][i]=0;
cin>>p[i-1]>>p[i];
}
for(int len=2;len<=n;len++){
for(int i=1;i<=n-len+1;i++){
int j=i+len-1;... | #include <stdio.h>
#include <string.h>
int main(){
char s1[101], s2[101];
int taro=0,hana=0;
int i,n;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %s", s1, s2);
if ( strcmp(s1, s2) == 0 ) {
taro+=1;
hana+=1;
}
else if ( strcmp(s1, s2) > 0 ) {
taro+=3;
}
else if ( strcmp(s1, s... | 0 | 30,803,200 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int M;
cin >> M;
int g = M;
for (int i=1; i<n; i++) {
int num; cin >> num;
M = max(M, num);
g = __gcd(g, num);
}
if (k % g == 0 && k <= M) {
cout << "POSSIBLE" << endl;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int ans=1;
int x;
for(int i=0;i<n;i++)
{
cin>>x;
if(x==ans)
ans++;
}
if(ans==1)
cout<<-1<<endl;
else
cout<<n-ans+1<<endl;
} | 0 | 9,888,541 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const int MAX =3001;
const int MOD =998244353;
signed main(){
int n... | #include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <algorithm>
#include <sstream>
#include <string>
#include <math.h>
#include <set>
#include <deque>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
in... | 0 | 80,927,912 |
#include "bits/stdc++.h"
#define _overload(_1, _2, _3, _4, name, ...) name
#define _rep1(Itr, N) _rep3(Itr, 0, N, 1)
#define _rep2(Itr, a, b) _rep3(Itr, a, b, 1)
#define _rep3(Itr, a, b, step) for (i64 (Itr) = a; (Itr) < b; (Itr) += step)
#define repeat(...) _overload(__VA_ARGS__, _rep3, _rep2, _rep1)(__VA_ARGS)
using ... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int walking(vector<vector<char> > &walk, int a, int b, int &count){
walk[a][b] = '#';
if(walk[a-1][b] == '.'){
count++;
walking(walk, a-1, b, count);
}
if(walk[a][b-1] == '.'){
count++;
walking(walk, a, b-1, count);
}
if(walk[a+1... | 0 | 99,919,250 |
#include<iostream>
#include<vector>
using namespace std;
int main()
{
int n,a;
vector<int>number;
int c[101] = { 0 };
for (int i = 0; i<100; i++){
cin >> a;
c[a]++;
}
int max = 1;
for (int i = 1; i <= 100; i++){
if (max == c[i]){
number.push_back(i);
}
else if (max<c[i]){
max = c[i... | #include <iostream>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <cstring>
#include <climits>
using namespace std;
#define ll long long
#define FOR(i,n) for(int i=0;i<n;i++)
#define sz... | 0 | 41,482,356 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
const int N = 1e5;
const ll INF = 1e18;
ll vt[N];
void solve() {
int n; cin >> n;
for (int i = 0; i < n; i++) {
cin >> vt[i];
}
ll pref = 2;
ll ans = vt[0] - 1;
for (int pos = 1; pos < n; pos++) {
... | #ifndef DEBUG
#pragma GCC optimize("O3,unroll-loops")
#pragma loop_opt(on)
#endif
#include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#define FAST ;
#else
#define FAST ios::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define cerr
#endif
#define _ <<' '<<
#define Fr(i, s, e) for(auto i = s; i < e; ++i)
#defi... | 0 | 91,690,420 |
#include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b... | 0 | 55,357,082 |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n;
while(cin>>n,n){
int a[10000];
for(int i = 0;i < n;i++){
cin>>a[i];
}
sort(a,a+n);
int sum = 0;
for(int i = 1;i < n-1;i++){
sum += a[i];
}
sum /=... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <climits>
#include <fstream>
#include <ra... | 0 | 18,902,278 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
vector<int> abc(3);
cin >> abc[0] >> abc[1] >> abc[2];
sort(abc.begin(), abc.end());
abc.erase(unique(abc.begin(), abc.end()), abc.end());
cout << abc.size() << endl;
return 0;
} | #include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
void read(){
}
t... | 0 | 10,666,893 |
#include<iostream>
using namespace std;
int main(){
int n,u,m,c;
int b[1000][1000] = {};
int a[1000][1000] = {};
cin >> n;
for(int i = 1;i <=n ;i++){
cin >> u >> m;
for(int j = 1;j <= m;j++){
cin >> b[u][j];
}
}
for(int i = 1;i <= n;i++){
for(int j = 1;j <= n;j++){
if(b[i][j] !... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll solve(ll n, vector<ll> a) {
ll res = 0;
ll sum = 0;
ll right = 0;
for(ll left = 0;left<n; left++) {
while(right < n && (sum ^ a[right]) == (sum + a[right])) {
sum += a[right];
right++;
}
if(left == right) {
res++... | 0 | 39,122,180 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int a,b;
cin>>a>>b;
cout<<a-b+1;
return 0;
} | #include <iostream>
#include<bits/stdc++.h>
using namespace std;
using ll =unsigned long long;
using dl = long double;
const ll m=1000000007;
ll fac[1000001];
void pre(){
fac[0]=fac[1]=1;
for(int i=2;i<=1000001;i++)
{
fac[i]=(fac[i-1]*1LL*i)%m;
}
}
ll power(ll a,ll n){
ll res=1;
while(n){
if(n%2... | 0 | 37,802,326 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
ios::sync_with_stdio(false);
int a1,a2,a3;
cin>>a1>>a2>>a3;
int part1 = abs(a1-a2);
int part2 = abs(a1-a3);
int part3 = abs(a2-a3);
int maxi = part1>part2?(part1>part3?part1:part3):(part2>part3?part2:par... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PRINT(s) cout << s << endl;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR((i), 0, (n))
int main() {
int k, s;
cin >> k >> s;
int limit = min(k, s) + 1;
int count = 0;
REP(x, limit) {
if (2 ... | 0 | 31,558,265 |
#include <bits/stdc++.h>
using namespace std;
#define sci1(a) scanf("%d",&a)
#define sci2(a,b) scanf("%d %d",&a,&b)
#define sci3(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define scs(s) scanf("%s",s)
#ifndef GET_MACRO
#define GET_MACRO(__1,__2,__3,NAME,...) NAME
#endif
#define sci(...) GET_MACRO(__VA_ARGS__,sci3,sci2,sci1)(__... | #include <bits/stdc++.h>
using namespace std;
int main () {
int N, M;
cin >> N >> M;
vector<int> memo(N);
vector<int> A(M), B(M);
for (int i = 0; i < M; i++) {
cin >> A.at(i) >> B.at(i);
if (A.at(i) == 1) {
memo.at(B.at(i) - 1)++;
}
if (B.at(i) == 1) {
memo.at(A.at(i) - 1)++;
}... | 0 | 98,625,002 |
#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 <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (char c = 'a'; c <= 'z'; c++) {
int left[s.length()], right[s.length()], x, a = 1, b = s.length();
left[0] = INT_MIN;
right[s.length()-1] = INT_MIN;
for (int i = 1; i < s.length(); i++) {
if (s[i-1] == c) {
... | 0 | 71,342,877 |
#include <bits/stdc++.h>
#include <vector>
#include <string.h>
typedef long long ll;
typedef long double lg;
using namespace std;
int main(){
ll n,k,x;
cin>>n>>k;
vector<ll>a;
for(int i=0;i<n;i++){
cin>>x;
a.push_back(x);
}
sort(a.begin(),a.end());
if(k>= n){
cout<<"0"<<endl;
return 0;
... | #include<cstdio>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<string>
#include<cmath>
#include<cassert>
#include<map>
#include<sstream>
using namespace std;
typedef long long ll;
typedef ll int__;
#define rep(i,j) for(int__ (i)=0;(i)<... | 0 | 87,104,797 |
#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 equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0) , cin.tie(0) , cout.tie(0);
int n , m;
cin >> n >> m;
vector<int> adj[n];
for (int i = 0 ;i < m ;i++) {
int k;
cin >> k;
while (k--) {
int s;
cin >> s;
adj[s... | 0 | 92,804,305 |
#include <bits/stdc++.h>
using namespace std;
#define INF 1000007
#define MOD 1000000007
#define maxn 10001
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
const double PI = acos(-1);
typedef pair<int, int> P;
int gcd(int a, int b)
{
return b ? gcd(b, a % b) : a;
}
int lcm(int a,... | #include <cstdint>
#include <iostream>
#include <string>
#include <algorithm>
constexpr int32_t kMaxNumberOfMatrices = 100;
constexpr int32_t kMaxNumberOfRowsAndCols = 100;
void CallMatrixChainMultiplication(std::istream &input_stream);
struct Matrix {
int32_t number_of_rows{0};
int32_t number_of_columns{0};
};
str... | 0 | 64,151,515 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); ++i)
double const PI = 3.1415926535897932384626433;
int main() {
int a, b;
cin >> a >> b;
cout << (a - 1) * (b - 1) << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define all(c) (c).begin(), (c).end()
#define rep(i, n) for (... | 0 | 55,784,453 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 10000000000 + 7;
int main(){
int N,M; cin >> N >> M;
vector<ll> h(N);
map<int,bool> m;
for(int i = 0; i < N; i++){
cin >> h[i];
m[i] = true;
}
for(int i = 0; i < M; i++){
int tmp1, tmp2;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int dice[6];
for (int i=0; i<6; i++) cin >> dice[i];
int q;
cin >> q;
for (int i=0; i<q; i++) {
int x, y;
cin >> x >> y;
int ans;
if (x == dice[0]) {
if (y == dice[1])
ans = dice[2];
else if (y == dice[2])
a... | 0 | 84,067,980 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,total=0;
cin >> N;
while(N){
int l,r;
cin >> l >> r;
total += r-l+1;
N--;
}
cout << total << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<V... | 0 | 54,633,754 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 4e3;
int vis[N+10];
char str[N+10];
int main()
{
int n;
scanf("%d",&n);
scanf("%s",str+1);
ll ans = 0;
for(int i=2;i<n;i++){
if(str[i]=='R'){
memset(vis,0,sizeof vis);
int cnt1 = 0,cnt2 = 0,minus = 0;
for(int j=i+1;j<=n;j+... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, K;
cin >> N >> K;
vector<int64_t> X(N), Y(N);
vector<int64_t> XA, YA;
for (int i = 0; i < N; i++) {
cin >> X[i] >> Y[i];
XA.emplace_back(X[i]);
YA.emplace_back(Y[i]);
}
sort(XA.begin(... | 0 | 1,374,102 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pq priority_queue
#define debug(x) cerr << #x << ": " << x << endl;
#define line() cerr << "---------------" << endl;
int main() {
int n;
while (cin >> n, n) {
int o = 1000 - n;
int cnt = 0;
while (o != 0) {
if ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S,T;
cin >> S >> T;
if( S.size() < T.size() ){
cout << "UNRESTORABLE" << endl;
return 0;
}
bool same = true;
string ans = "UNRESTORABLE";
for(int i=0;i<=S.size()-T.size();i++){
for(int j=0;j<T.size();j++){
if( S.at(i+j) !=... | 0 | 9,364,235 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i,... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define Rep(i, N) for(int i = 0; i < N; i++)
typedef pair<int, int> Pi;
#define fi first
#define se second
int mx[] = {1, 0, -1, 0};
int my[] = {0, 1, 0, -1};
signed main()
{
int W, H;
char mas[25][25];
while(cin >> W >> H, W || H) {
queue < ... | 0 | 30,910,110 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> sequence;
vector<int> LIS;
int initial;
cin >> initial;
LIS.emplace_back(initial);
for (int i = 1; i < n; ++i) {
int a;
cin >> a;
auto it = lo... | #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 | 98,249,816 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int input1, input2;
cin >> input1 >> input2;
if((input1 /2)*2 == input1 || (input2 /2)*2 == input2) {
cout << "Even" << endl;
} else {
cout << "Odd" << endl;
}
return 0;
} | #include <iostream>
#include <vector>
#include <string>
using namespace std;
void fnInput(vector<string> &rvsSortBbl, vector<string> &rvsSortSel)
{
int nMaxSiz;
cin >> nMaxSiz;
rvsSortBbl.resize(nMaxSiz);
rvsSortSel.resize(nMaxSiz);
for (int i = 0; i < nMaxSiz; i++)
{
cin >> rvsSortBbl[i];
rvsSortS... | 0 | 38,399,757 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
int main() {
int n, a, b;
cin >> n >> a >> b;
int x = 0, y = 0, z = 0;
rep(i, n) {
int p;
cin >> p;
if (p <= a)
x++;
else if (p <= b)
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
bool compare_by_b(pair<int, int> a, pair<int, int> b) {
if(a.second != b.second){
return a.second > b.second;
}else{
return a.first < b.first;
}
}
int main(){
int n, m;
cin >> n >> m;
priority_queue<int> q;
pa... | 0 | 58,188,807 |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <iomanip>
#include <algorithm>
using namespace std;
using ll = long long;
using pint = pair<int, int>;
int main() {
int N, K, d;
cin >> N >> K;
vector<int> s(N, 0);
for (int i = 0; i < K; ++i) {
int d;
cin >> d;
for (int j = 0; ... | #include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#in... | 0 | 64,043,921 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.