code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
int ara[20000];
int main()
{
int n ;
cin >> n;
for(int i = 0; i<n; i++)
{
int a;
cin >> a;
ara[a]++;
}
int f = 0;
for(int i = 0; i<10007; i++)
while(ara[i]--){
if(f) printf(" ");
cout << i ;
... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) # VariableName
#def... | 0 | 3,154,899 |
#include <stdio.h>
int main(){
int w,h;
while(1){
scanf("%d", &h);
scanf("%d", &w);
if(w == 0 && h == 0)
return 0;
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
if( i == 0 || j == 0 || i == (h-1) || j == (w-1))
printf("#");
else
printf(".");
}
printf("\n");
}
printf... | #include <bits/stdc++.h>
using namespace std;
struct node{
int key;
node *next, *prev;
};
node *nil;
void insert_node(int key){
node *x = (node *)malloc(sizeof(node));
x->key = key;
x->next = nil->next;
nil->next->prev = x;
nil->next = x;
x->prev = nil;
}
void delete_node(node *t){
if(t == nil) return... | 0 | 68,843,483 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
int min = a[0], max = a[0];
for(int i = 0; i < n; i++){
if(min > a[i]){
min = a[i];
}
if(max < a[i]){
max = a[i];
}
}
cout << max - min << endl;... | #include <iostream>
#include <vector>
#include <limits.h>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <queue>
#include <map>
#include <set>
#include <iomanip>
#include <bitset>
#include <cassert>
#include <random>
#include <functional>
#include <stack>
#include <iomanip>
#inclu... | 0 | 19,069,890 |
#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 a,b,c,d;
cin >>a >>b >>c >>d;
int L = a+b;
int R = c+d;
if(L>R) cout << "Left" << endl;
if(L==R) cout << "Balanced" << endl;
if(L<R) cout << "Right" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define INF INT_MAX/3
#define LLINF LLONG_MAX/3
#define MOD (1000000007LL)
#define MODA(a, b) a=((a)+(b))%MOD
#define MODP(a, b) a=((a)*(b))%MOD
#define inc(i, l, r) for(int i=(l);i<(r);i++)
#define dec(i, l, r) for(int i=(r)-1;i>=(l);i--)
#defin... | 0 | 75,034,460 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
const ll INF=1LL << 60;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
ll n,k; cin >> n >> k;
ll dp[n];
ll a[n];
for (int 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 | 27,391,284 |
#include<iostream>
using namespace std;
int main(){
int a;int b;
int i = 1;
int s;int d;int j;int k;
cin >> s >> d >> j >> k;
a = s+d+j+k;
int w;int ww;int www;int wwww;
cin >>w >> ww >> www >> wwww;
b = w + ww + www + wwww;
if(a >= b){
cout << a << endl;
}
else{
cout << b << endl;
}
return 0;
} | #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 | 5,598,339 |
#include<stdio.h>
int main()
{
int x,y;
for(;;)
{
scanf("%d %d",&x,&y);
if(x<y)
{
printf("%d %d\n",x,y);
}
else if(y<x)
{
printf("%d %d\n",y,x);
}
else if(x==y&&x!=0&&y!=0)
{
printf("%d %d\n",x,y);
}
else if(x==0&&y==0)
{
break;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v)
#define ALL(x) (x).begi... | 0 | 17,934,044 |
#include<bits/stdc++.h>
using namespace std;
long long n,a,b;
inline int read()
{
int sum=0,x=1;
char ch=getchar();
while (ch<'0'||ch>'9')
{
if (ch=='-')
x=-1;
ch=getchar();
}
while (ch>='0'&&ch<='9')
{
sum=sum*10+ch-'0';
ch=getchar();
}
return sum*x;
}
inline void... | #include<bits/stdc++.h>
using namespace std;
#define INFTY 1<<20
typedef long long int ll;
const int MOD=1000000007;
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main(){
int n,k;cin>>n>>k;
vector<int> cl(n,0);
int l=0,cnt=0;
rep(i,n){
int a;cin>>a;a--;
cl[a]++;
}
sort(cl.begin(),cl.end());
r... | 0 | 17,684,203 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define file_se_input freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define pp long long int
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __bui... | #include <iostream>
using namespace std;
int main(void){
int A, B, C, K;
cin >> A >> B >> C >> K;
while (A >= B) {
B *= 2;
K--;
}
while (B >= C) {
C *= 2;
K--;
}
if (K >= 0) cout << "Yes" << endl;
else cout << "No" << endl;
} | 0 | 100,875,349 |
#include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
int main(){
ll q, h, s, d;
cin >> q >> h >> s >> d;
ll N;
cin >> N;
ll sum = 0;
ll ... | #include <iostream>
#include <map>
using namespace std;
int main(int argc, char const *argv[])
{
int N, M;
cin >> N >> M;
map<int, int> drink;
int inA, inB;
for (int i = 0; i < N; i++)
{
cin >> inA >> inB;
drink[inA] += inB;
}
long long ans = 0;
for (auto itr = drink.... | 0 | 60,445,987 |
#include <iostream>
#include <cmath>
using namespace std;
typedef long long ll;
int main()
{
ll N, K;
cin >> N >> K;
ll ans = 0;
if (K % 2 == 1)
{
ll q = floor(N / K);
ans += pow(q, 3);
}
else if (K % 2 == 0)
{
ll q = floor(N / K);
ll q2 = floor(N / (K / 2));
if (q * 2 == q2)
{
... | #include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts.... | 0 | 85,242,121 |
#include <iostream>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
if(a==b)cout << c;
else if(b==c)cout << a;
else cout << b;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int k;
cin >> k;
string s;
cin >> s;
int n = s.length();
if (n <= k)
{
cout << s;
}
else
{
s = s.substr(0, k) + "...";
cout << s;
}
} | 0 | 34,186,031 |
#include<bits/stdc++.h>
#define ll long long
#define inf 9999999999999999
#define F first
#define S second
#define eb emplace_back
#define mpp make_pair
#define P(x) cout<<__LINE__ <<": "<<#x<<' '<<(x)<<'\n'
#define dbg cout<<__LINE__ <<": 0manush\n"
#define read(x) freopen("input.txt","r",stdin)
#define fast ios_base:... | #include<iostream>
using namespace std;
int main(){
int x;
int a,b,c;
cin >> a >> b >>c;
if(b < a){
x = a;
a = b;
b = x;
}
if(c < a){
x = a;
a = c;
c = x;
x = b;
b = c;
c = x;
cout << a << " " << b << " " << c << e... | 0 | 38,276,083 |
#include<bits/stdc++.h>
using namespace std;
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG false
typedef long long ll;
typedef pair<int, int> ii;
int main() {
vector<string> v(10);
v[1] = ".,!?... | #include<bits/stdc++.h>
using namespace std;
using ll = long long int;
int main(void) {
constexpr ll MOD = 1e9 + 7;
cout << fixed << setprecision(16);
ll n, k;
cin >> n >> k;
vector<pair<ll,ll>> v(n);
for(auto &e: v)
cin >> e.second >> e.first;
sort(v.begin(), v.end(), greater<>());
... | 0 | 3,472,399 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | #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... ... | 0 | 301,118 |
#include <stdio.h>
int main() {
char depan[105];
char belakang[105];
scanf("%s %s", &depan, &belakang);
printf("%s%s\n", belakang, depan);
return 0;
} | #include <iostream>
#include <string.h>
#include <stdio.h>
#include <map>
#include <vector>
#include <math.h>
#include <algorithm>
#include <queue>
#include <set>
#include <tuple>
using namespace std;
#define rep(i,a) for(int i=0; i<a; i++)
#define rrep(i,a) for(int i=a; i>=0; i--)
#define rep1(i,a) for(int i=1; i<=a; ... | 0 | 39,072,710 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M; cin >> N >> M;
vector<vector<int>> s(M);
for(int i = 0; i< M; i++){
int k; cin >> k;
for(int j = 0; j < k; j++){
int a; cin >> a; a--;
s[i].push_back(a);
}
}
vector<int> p(M);
for(i... | #include <iostream>
#include <string>
using namespace std;
int main()
{
string number;
int num;
getline(cin,number);
while(number != "0"){
int sum = 0;
for(int i = 0 ;i < number.length() ;i++){
num = number[i] - '0';
sum += num;
}
cout << sum << en... | 0 | 726,113 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int64_t N, M;
cin >> N >> M;
int64_t even_num = (M + 1) / 2;
int64_t sep = even_num * 2;
for (int64_t i = 0; i < even_num; i++) {
cout << i + 1 << " " << sep - i << endl;
}
int64_t right = (N % 2 == 0 ? N - 1 : N);
for (in... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(ll i=(ll)(m); i<(ll)(n); i++)
#define rep(i,n) REP(i,0,n)
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
int main() {
int N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
ll sum = accumulate... | 0 | 62,915,630 |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int n,a,b,x;
while (cin>>n) {
if (n==0) {
break;
} else {
cin>>a>>b;
std::deque<int> deq;
for (int i=0;i<n;i++) {
cin>>x;
deq.emplace_back(x);
... | 0 | 15,064,714 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long ;
struct Node {
int i;
ll d;
Node() {}
Node(int _i, ll _d) : i(_i), d(_d) {}
bool operator<(const Node& _r) const {
return d > _r.d;
}
};
void solve() {
int n; cin >> n;
vector<int> p(n,-1), sz(n,1);
set<Node>... | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,ll> llP;
ll mod(ll a, ll b){
ll ret=a%b;
if(ret<0) ret+=b;
return ret;
}
ll modpow(ll a,ll b,ll c){
ll res=1;
while(b>0){
if(b&1) res=mod(res*a,c);
a=mod(a*a,c);
b>>=1;
... | 0 | 55,462,756 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
using V = vector<ll>;
#define rep(i, n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i, n) for(ll i=1;i<=(ll)(n);i++)
#define rep2(i, m, n) for(ll i=m;i<(ll)(n);i++)
#define rrep(i, n, m) for(ll i=n;i>=... | #include <bits/stdc++.h>
using namespace std;
#define F(i,a,n) for(int i=a;i<n;i++)
#define pb push_back
typedef vector<int> vi;
typedef pair<int,int> pi;
typedef long long ll;
#define mod 1000000007
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int w... | 0 | 23,510,221 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <iostream>
#include <functional>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define mp make_pair
#define xx first
#define yy second
#define pii pair <int, int >
#define pll pair < ll, ll >
#define xx first
#define yy second
#define vi vecto... | 0 | 6,517,552 |
#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 <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | 0 | 46,178,257 |
#include <iostream>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
using namespace std;
#define N 100000
#define MAX 1000000000
int main() {
int cnt = 0;
long long q = 1;
while(cnt++ < 10) {
string ans;
stringstream ss;
ss << "? " << q;
cout << ss... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
cin>>s;
int n=s.size();
for(int i=0; i<=n; i++) {
for(int j=0; j<=n; j++) {
string t=s;
if(t.erase(i,j)=="keyence") {
cout<<"YES"<<endl;
return 0;
}
}
}
cout<<"NO... | 0 | 89,321,198 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int iINF = 1000000000;
const long long int llINF = 10000... | #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 <tuple>
#include <numeric>
#define... | 0 | 88,082,695 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char A,B;
cin >> A;
if(A=='A'){
B='T';
}
else if(A=='C'){
B='G';
}
else if(A=='T'){
B='A';
}
else{
B='C';
}
cout << B << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<long long> vll;
typedef vector<pair<int,int>> vpi;
typedef vector<pair<long long, long long>> vpl;
typedef pair<int,int> pii;
typedef pair<long long, long long> pll;
#define INF (int)(1e9)
#define MAXX 1.1529215e+18
#define inf 999999
#d... | 0 | 67,694,447 |
#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 edge = pair<int, ll>;
using Graph = vector<vector<int>>;
using WeightedGraph = vector<vector<edge>>;
const ll INF = 1LL << 60;
const int INF32 = 1 << 29;
const ll MOD... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for... | 0 | 77,537,121 |
#include <iostream>
#define REP(i, a, n) for(int i = (a); i < (n); i++)
using namespace std;
int past(int Y, int M, int D) {
int day = 0;
REP(i, 1, Y) {
if(i % 3 == 0) day += 10 * 20;
else day += 19 * 5 + 20 * 5;
}
REP(i, 1, M) {
if(Y % 3 == 0) {
day += 20;
} else {
if(i % 2 == 1) da... | #include<bits/stdc++.h>
#include<ctype.h>
# define pb push_back
#define fst first
#define sec second
#define For(i,a,b) for(int i=a;i<b;i++)
#define ll long long int
#define ull unsigned long long int
#define mod 1000000007
#define fo(i,n) for(ll i=0;i<n;i++)
#define endl "\n"
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#d... | 0 | 35,225,346 |
#include<bits/stdc++.h>
#include<string>
using namespace std;
char N [9999];
void solve(){
if ((N[0] == N[1] && N[1] == N[2]) || (N[1] == N[2] && N[2] == N[3])) {
cout << "Yes"<< endl;
}
else {
cout << "No" << endl;
}
}
int main() {
cin >> N;
solve();
} | #include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
int main()
{
int n;
while(cin >> n && n) {
vector<string> v;
vector<pair<string... | 0 | 38,491,121 |
#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
using namespace std;
using pi... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for(int i... | 0 | 59,000,464 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (int i = (a); i < (int)(b); ++i)
#define endl "\n"
typedef long long ll;
typedef string str;
const double pi=3.14159265358979323846;
const long long inf = 1LL << 60;
int ctoi(const char c) {
if ('0' <= c && c <= '9') return (c - '0');
return -... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/agc008_a.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) ... | 0 | 44,460,695 |
#include <iostream>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
int n;
cin>>n;
int a[n];
int hoge[n];
long long ans=0;
double b=0.0;
for(int i=0;i<n;i++){
cin>>a[i];
hoge[i] = a[i]-(i+1);
}
sort(hoge,hog... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <math.h>
using namespace std;
#include <vector>
#define rep(i,n) for (ll i = 0; i < (n) ; i++)
#define INF 1e9
#define llINF 1e18
#define base10_4 10000
#define base10_5 100000
#define base10_6 1000000
#define base10_7 ... | 0 | 95,271,831 |
#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 <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
typedef pair<int, int> P;
int H, W, N;
char m[1001][1001];
int d[1001][1001];
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
void dfs(int i, int j) {
char... | 0 | 59,500,641 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n,m;
cin>>n>>m;
int p = 1;
for(int i=1;i<=m;i++)p*=2;
int ans = p*(n*100+m*1800);
cout<<ans<<endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <set>
#include <list>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <string>
#include <sstream>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <fstream>
#include <iomanip>
using namespace... | 0 | 92,048,901 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n,a,b;
cin >> n>>a>>b;
cout << (((b-a) % 2) ? "Borys" : "Alice") << '\n';
return (0);
} | #include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
#include <stack>
#include<iomanip>
using namespace std;
#define rep(i,a,n) for(int i=(a);i<(... | 0 | 78,125,984 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
void bubbleSort(string a[], int n) {
for (int i = 0; i < n; i++) {
for (int j = n - 1; j > i; j--) {
if (a[j - 1][1] > a[j][1]) {
swap(a[j - 1], a[j]);
}
}
}
}
void selectionSort(string a[], int n) {
for (int i = 0; i < n;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,ini,n) for(int i=ini;i<n;i++)
#define _rep(i,ini,n) for(int i=ini;i>=n;i--)
#define ToEnd(a) a.begin(),a.end()
uint64_t MOD=1000000007;
int main(){
int a,b,x; cin>>a>>b>>x;
double theta;
if(a*a*b/2.>=x){
double d=2.*x/b/a;
theta=ata... | 0 | 74,096,307 |
#include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
int gcd(int a, int b) { return b != 0 ? gcd(... | #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... | 0 | 81,245,874 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main() {
int n, k;
cin >> n >> k;
vector<int> mod_zero;
vector<int> mod_half;
for ( int i = 1; i <= n; i++ ) {
if ( i % k == 0 ) {
mod_... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using vll=vector<ll>;
using vvll=vector<vll>;
using vi=vector<int>;
using vvi=vector<vector<int>>;
using vb=vector<bool>;
using pii=pair<int,int>;
using vpii=vector<pair<int,int>>;
using plli=pair<ll,int>;
using vplli=vector<pair<ll,int>>;
using pllll=... | 0 | 17,795,211 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(int)(n); i++)
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main(){
double l;
cin >> l;
double ans = 1.0;
ans = l/3*l/3*l/3;
printf("%.20f\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void)
{
int n, m;
cin >> n >> m;
vector<int> a(m), b(m);
vector<int> rooms(n);
vector<vector<int>> routes(n, vector<int>(0));
for (int i = 0; i < m; i++)
{
cin >> a[i] >> b[i];
routes[a[i] - 1].push_back(b[i] - 1);
... | 0 | 95,771,634 |
#include <bits/stdc++.h>
using namespace std;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int hmax = 50;
const int wmax = 50;
int main() {
int H, W;
cin >> H >> W;
char s[wmax][hmax];
for(int i = 0; i < H; i++){
for(int j = 0; j < W; j++){
cin >> s[i][j];
}
}
for(in... | #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... | 0 | 18,680,585 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(),(a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int,int> P;
typedef long long ll;
int main(){
str... | #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>;
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, R, S, P;
string T;
cin >> N >> K >> R >> S >> P >> T;
vector<string> s(K);
rep(i, N) s[i % K... | 0 | 39,205,684 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
int main() {
int H,W;
cin >> H >> W;
vector<string> data(H);
for (int i = 0; i < H; i++) {
cin >> data[i];
bool flag = true;
for (int j = 0; j < W; j++) {
if (data[i][j] == '#') {
flag = false;
}
}
if (f... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (int)(b); i++)
#define rrep(i, a, b) for (int i = (a); i >= (int)(b); i--)
#define all(x) (x).begin(), (x).end()
using i32 = int32_t;
using i64 = int64_t;
using f32 = float;
using f64 = double;
using P = pair<int, int>;
template ... | 0 | 25,901,815 |
#include <iostream>
#include <string>
#include <math.h>
#include <stdio.h>
#include <ctype.h>
using namespace std;
int main() {
int n[101]={0};
int max = 0;
int x;
while(scanf("%d",&x)!=EOF){
n[x]++;
if(max<n[x]){
max=n[x];
}
}
for(int i=0; i<101; i++){
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
string s;
cin>>n>>s;
vector<int >r(n+1,0),b(n+1,0),g(n+1,0);
long long count=0;
for(int i=1;i<=n;i++){
if(s[i-1]=='R')r[i]++;
if(s[i-1]=='B')b[i]++;
if(s[i-1]=='G')g[i]++;
r[i]+=r[i-1];
b[i]+=b[i-1];
g[i]+=g[i-1];
}
for(int i=1;i<=n-2;i... | 0 | 74,458,241 |
#include <bits/stdc++.h>
#define int long long
#define Matrix vector<vector<int> >
#define double long double
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define td(v) v.begin(),v.end()
#define tdr(v) v.rbegin(),v.rend()
#define endl "\n"
#define Matrix vector<vector<int> >
using names... | #include<cstdio>
using namespace std;
int n, m, k, x, y, _2k;
char col[] = "RGBY";
char mp[505][505];
int main() {
scanf("%d%d%d", &n, &m, &k), _2k = k * 2;
for(register int i = 1; i <= n; ++i)
for(register int j = 1; j <= m; ++j) {
x = n + i + j, y = m + i - j;
mp[i][j] = col[2 * ((x / k) & 1) + ((y / k) & 1... | 0 | 91,309,693 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
int tmp=min(a,b);
vector<int>res;
for(int i=1;i<=tmp;i++){
if(a%i==0&&b%i==0)res.push_back(i);
}
reverse(res.begin(),res.end());
cout<<res[c-1]<<endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define FORR(i, a, b) for (int i = b - 1; i >= a; --i)
#define SORT(v) sort(v.begin(), v.end())
#define SORTR(v) sort(v.rbegin(), v.rend())
#define ... | 0 | 22,688,617 |
#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;
int main(){
int N;
scanf("%d",&N);
int maximum = 0,ans = 1;
for(int i = 2; i <= N; i++){
int cou... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
template <typename T>
using Graph = vector<vector<T>>;
const int MOD = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false... | 0 | 87,519,744 |
#include <bits/stdc++.h>
#include <fstream>
#include <string>
using namespace std;
#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 ll long long
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
int ans ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FO... | 0 | 16,417,572 |
#include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
const ll INF = 1001001001;
const ll MOD = 1000000007;
ll N, K, ans=0, tmp=0;
vector<ll> A;
map<ll,ll> B;
signed main(){
cin >> N >> K;
A.push_back(0);
B[0]++;
if(K>N) {
for(int i=0;i... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
template<class T = int> using V = vector<T>;
template<class T = int> using VV = V< V<T> >;
template<class T> void assign(V<T>& v, int n, const T& a = T()) { v.assign(n, a); }
template<class T, class... U> void assign(V<T>& v, int n, const U&... u... | 0 | 49,639,856 |
#include <iostream>
using namespace std;
#define MAX_N (1000000)
bool is_prime[MAX_N];
int sum[MAX_N + 1];
int main()
{
int n;
for (int i = 0; i < MAX_N; i++){
is_prime[i] = true;
}
is_prime[0] = false;
is_prime[1] = false;
for (int i = 4; i < MAX_N; i += 2){
is_prime[i] = false;... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long a,b,k;
cin>>a>>b>>k;
if(k<a)
{
cout<<a-k<<" "<<b;
}
else
{
k=k-a;
if(k<b)
{
b= b-k;
}
else b=0;
cout<<0<<" "<<b;
}
return 0;
} | 0 | 66,586,187 |
#include <stdio.h>
#include <algorithm>
using namespace std;
int x, y, a, b, c;
int p[100100], q[100100], r[100100];
int main()
{
scanf ("%d %d %d %d %d", &x, &y, &a, &b, &c);
for (int i = 0; i < a; i++) scanf ("%d", &p[i]); sort(p, p + a); reverse(p, p + a);
for (int j = 0; j < b; j++) scanf ("%d", &q[j]); sort(q, ... | #include<iostream>
#define CI cin >>
#define CO cout <<
#define E << endl;
using namespace std;
int main(void) {
int w, h, x, y, r;
bool flag1 = false;
bool flag2 = false;
bool flag3 = false;
bool flag4 = false;
CI w >> h >> x >> y >> r;
if ((w - (x + r)) >= 0) {
flag1 = true;
}
if (r <= x) {
flag2 = true;... | 0 | 30,694,132 |
#include<iostream>
using namespace std;
int main(){
enum{
STARTMULTITABLE = 1,
ENDMULTITABLE = 9
};
int i;
for(i = STARTMULTITABLE; i <= ENDMULTITABLE; i++){
int k;
for(k = STARTMULTITABLE; k <= ENDMULTITABLE; k++){
cout << i << "x" << k << "=" << (i*k) << end... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long... | 0 | 50,618,057 |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <string>
#include <vector>
#include <math.h>
#include <queue>
#include <deque>
#include <stack>
#include <map>
const int MOD = 1e9+7;
#define PI 3.14159265359
typedef long long ll;
using namespace std;
int dp[100001];
int main(){
int n;
cin >> n;
f... | #include <iostream>
int main(int argc, char const* argv[])
{
std::string snum;
std::cin >> snum;
while (snum != "0") {
unsigned sum{};
for (auto&& var : snum) {
sum += var - '0';
}
std::cout << sum << std::endl;
std::cin >> snum;
}
return 0;
} | 0 | 68,064,702 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
vector<... | #include<bits/stdc++.h>
using namespace std;
int n,a,b,p,problemone,problemtwo,problemthree;
int main(){
cin>>n>>a>>b;
for(int i = 1;i <= n;i++){
cin>>p;
if(p <= a){
problemone++;
}else if(p <= b){
problemtwo++;
}else{
problemthree++;
}
}
cout<<min(min(problemone,problemtwo),problemthree)<<endl;
... | 0 | 44,574,940 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
string s, t;
cin >> s;
cin >> t;
int cnt = 0;
if(s[0] == t[0]) ++cnt;
if(s[1] == t[1]) ++cnt;
if(s[2] == t[2]) ++cnt;
c... | #include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
const int INF=2000000000;
const int MAX_V=100;
int V,E;
int G[MAX_V][MAX_V];
int dp[MAX_V][MAX_V];
int min(int a,int b){
if(a>b)return b;
else return a;
}
void warshall_floyd(){
for(int k=0;k<V;k++){
for(int j=0;j<V;j++){
for(... | 0 | 12,625,260 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const int MAX = 1e5 + 5;
const int LIM = 3e5 + 5;
const int MOD = 1e... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1 << 29;
const int MOD = 1000000007;
map<long long, long long> prime_factorize(long long n) {
map<long long, long long> mp;
for (long long a = 2; a * a <= n; a++) {
if (n % a != 0) continue... | 0 | 85,706,256 |
#include "bits/stdc++.h"
using namespace std;
using i64 = int_fast64_t;
using seika = string;
template <class kizuna>
using akari = vector<kizuna>;
template <class yuzuki>
using yukari = akari<akari<yuzuki>>;
template <class tsurumaki>
using maki = akari<yukari<tsurumaki>>;
template <class kotonoha>
using akane = prior... | # include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
#include<limits.h>
#include<unorde... | 0 | 18,946,350 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define PI 3.141592653589793
#define MOD 1000000007
#define ALL(obj) (obj).begin(),(obj).end()
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... | #include<bits/stdc++.h>
#define llu unsigned long long
#define ll long long
#define INF 0x3f3f3f3f
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define to_lower(s) transform(s.begin(), s.end(), s.begin(), ::tolower);
#define to_upper(s) transform(s.begin(), s.end(), s.be... | 0 | 81,310,168 |
#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> time(N);
vector<int> speed(N);
cin >> time.at(0);
if ( N != 1 ) {
for(int i = 1 ; i < N ; i++) {
int x = 0;
cin >> x ;
time.at(i) = time.at(i-1) + x;
}
}
for(int i = 0... | #include<bits/stdc++.h>
#define int long long
#define rep1(i,a,b) for(int i=a;i<b;i++)
#define rep2(i,a,b) for(int i=a;i>=b;i--)
#define mod 1000000009
#define garou99 ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
signed main() {
string s,t;
cin>>s>>t;
int m=s.length();
int n=t.length();... | 0 | 71,357,613 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <queue>
using namespace std;
#define pb(n) push_back(n)
#define mp(n,m) make_pair(n,m)
#define fi first
#define se second
#define... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
set<LL> s;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
LL n, m, x, g = 1;
cin >> n >> m;
for(int i=0;i<n;i++) {
cin >> x; x /= 2;
if(s.find(x) == s.end()) {
if(!i) g = x;
g /= __gcd(x, g);
g *= x;
}
s.insert(x);
}
for(auto x... | 0 | 57,281,559 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<ll>;
using vvi = vector<vi>;
const int INF = 100010001;
const ll LINF =... | #include <iostream>
#include <iomanip>
#include <cmath>
#include <cstring>
using namespace std;
class dice
{
public:
dice()
{
}
int n[6];
int l[6][6];
void set(int n0,int n1,int n2,int n3,int n4,int n5)
{
n[0] = n0;
n[1] = n1;
n[2] = n2;
n[3] = n3;
n[4... | 0 | 91,779,195 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int ... | #include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define rep(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a,b) for(int i=a; i<=b; i++)
#define ll long long int
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pi(x) printf("%d\n",x)
#define ... | 0 | 57,116,023 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL<<60;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
ll LCM(ll a,ll b){
return a / GCD(a,b) * b;
}
const int MOD = 1000000007;
int main() {
int a,b; cin >> a >> b;
string ans1,ans2;
fo... | #include<bits/stdc++.h>
#define cs const
#define pb push_back
#define y1 y_1
using namespace std;
typedef long long ll;
int main(){
#ifdef FSYolanda
freopen("1.in","r",stdin);
#endif
ll S; scanf("%lld",&S);
ll t = sqrt(S);
if(1ll * t * t == S){
cout << 0 << " " << 0 << " " << t << " " <<
0 << " " << 0 << " "... | 0 | 48,899,914 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
string s, s2;
ll k;
cin >> s >> k;
int n = s.size();
s2 = s + s;
if (n == 1) {
cout << k / 2 << endl;
return 0;
} else if (all_of(s.begin(), s.end(),... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define REP(i,n) for (int64_t i=0; i<(n); ++i)
#define P pair<int,int>
using ll=int64_t;
using namespace std;
#define ketasuu(n) fixed<<setprecision(n)
#define btoe(p) p.begin(),p.end()
#define etob(p) p.rbegin(),p.rend()
int main(){
int a,b; c... | 0 | 22,272,378 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | #include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORR(i,a,b)for(ll i=(a);i<=(b);... | 0 | 14,317,010 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1001001001;
const int mod = 1000000007;
int main() {... | #include <iostream>
#include <iomanip>
#include <math.h>
#include <algorithm>
#include <functional>
#include <string>
#include <vector>
#include <cstring>
#include <set>
#include <map>
#include <queue>
#include <utility>
#include <limits.h>
using namespace std;
typedef long long LL;
#define rep(i,n) for (int i = 0; i... | 0 | 13,505,636 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
#define fi first
#define se second
template <class T>
void cout_vec(const vector<T> &vec){
for(auto itr:ve... | #include <bits/stdc++.h>
#define ll long long
#define ls id << 1
#define rs id << 1 | 1
#define mem(array, value, size, type) memset(array, value, ((size) + 5) * sizeof(type))
#define memarray(array, value) memset(array, value, sizeof(array))
#define pb(x) push_back(x)
#define st(x) (1LL << (x))
#define pii pair<int, i... | 0 | 76,708,054 |
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include... | #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 | 81,801,815 |
#include<bits/stdc++.h>
using namespace std;
const int t=1e7;
long long a[t],b[t];
int n;
long long sum,spfa;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
for(int i=1;i<=n;i++)
{
cin>>b[i];
}
for(int i=1;i<=n;i++)
{
if(a[i]>b[i])
... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
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;}
int ... | 0 | 59,399,434 |
#include <iostream>
using namespace std;
int main(void){
string s, left;
int pos, tmp, cnt, i;
left = "qwertasdfgzxcvb";
while(1){
cin >> s;
if(s == "#"){
break;
}
if(left.find(s[0]) != std::string::npos){
pos = 0;
}else{
pos = 1;
}
cnt = 0;
for(i=1;i<s.length()... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define vll vector<long long>
#define ll long long
#define pii pair<int,int>
const int mod=1e9+7;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("inputf.txt"... | 0 | 87,624,807 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi; typedef vector<vi> vii;
typedef vector<ll> vl; typedef vector<vl> vll;
typedef pair<int,int> pi; typedef pair<pi,int> pii;
typedef pair<ll,ll> pl; typedef pair<pl,ll> pll;
typedef pair<... | #include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <queue>
#include <math.h>
#include <assert.h>
#include <set>
#include <map>
#include <bitset>
#include <ctime>
#include <time.h>
#include <algorithm>
#include <cstdio>
#include <fstre... | 0 | 66,478,603 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i < (n); i++)
#define lower(s) transform(s.begin(), s.end(), s.begin(), ::tolower)
using namespace std;
using ll = long long;
int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
int before = 0;
int ans = 0;
for... | #include <bits/stdc++.h>
#include<chrono>
#define ll long long
#define db double
#define deb(x) cout<<#x<<": "<<x<<"\n"
#define all(x) x.begin(),x.end()
#define fo(i, n) for(i=0 ; i<n ; i++)
#define Fo(i, k, n) for(i=k ; i<n ; i++)
using namespace std;
using namespace chrono;
const ll MOD = 1000000007;
const ll N = 300... | 0 | 43,838,255 |
#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... | #include<algorithm>
#include<cstdio>
#include<vector>
using namespace std;
int n, k;
int a[5000];
bool jdg[5000];
int main() {
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
sort(a, a + n, [](const int &i1, const int &i2)->bool {
return i1 > i2;
});
for (int i = 0; i... | 0 | 6,942,009 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int a, b;
cin >> a >> b;
if (a > b) swap(a, b);
string ans(b, '0' + a);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (1e-7)
#define gearup io... | 0 | 3,932,983 |
#include <iostream>
using namespace std;
int main(){
int x;
int t;
cin >> x >> t;
if(x > t){
cout << x - t << endl;
}
else{
cout << "0" << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=1LL<<61;
int main() {
ll n,k;
cin >> n >> k;
k=min(k,50LL);
vec a(n);
for(ll i=0;i<n;i++) {
cin >> a[i];
}
priority_queue<ll,vec... | 0 | 59,139,399 |
#include<iostream>
using namespace std;
int n;
int a[200000+5];
long long sum = 0;
long long sum1 = 0;
long long span = (2e5)*(1e9)+5;
int main(){
scanf("%d",&n);
for(int i = 1; i <=n;i++){
scanf("%d",&a[i]);
sum = sum + a[i];
}
for(int i = 1;i<n;i++){
sum1 = sum1 + a[i];
long long m = sum - 2*sum1;
if(m<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define F first
#define S second
#define PB push_back
#define MK make_pair
#define REP(i, a, b) for (int i=a; i < b; i++)
bool sort_by(pi c, pi d){
return c.S < d.S;
}
int main() {
ll n, m=pow(10, 9)+... | 0 | 6,172,088 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
#define INF 100000000
int main()
{
int H, W, K;
cin >> H >> W >> K;
vector<string> grid(H);
for (int h = 0; h < H; h++)
cin >> grid[h];
int count ... | #include<bits/stdc++.h>
using namespace std;
const int N=2e5+5;
int n,k=2,s=1;
vector<int>v[N];
int main()
{
scanf("%d",&n);
v[1].push_back(1);
v[2].push_back(1);
while(s<n)
{
for(int i=s+1,j=1;i<=s+k;i++,j++)
{
v[k+1].push_back(i);
v[j].push_back(i);
... | 0 | 89,985,817 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using vb=vector<bool>;
using vvb=vector<vb>;
using pii = pair<int,int>;
using pli = pair<ll,int>;
using pll = pair<ll,ll>;
using vpii = vector<pii>;
using vpli = vec... | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(a) (int)a.size()
#define fi first
#define se second
#define ar array
#define forn(i, n) for(int i = 0; i < n ; ++i)
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int > pii;
type... | 0 | 7,980,876 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
bool K=false;
cin>>N;
vector<int>T(N+1);
vector<int>X(N+1);
vector<int>Y(N+1);
for(int P=0;P<N;P++){
cin>>T[P+1]>>X[P+1]>>Y[P+1];
if(abs(X[P+1]-X[P])+abs(Y[P+1]-Y[P])>T[P+1]-T[P]||(abs(X[P+1]-X[P])+abs(Y[P+1]-Y[P]))%2!=(T[P+1]... | #include <iostream>
using namespace std;
int main(){
int n, m, p;
while(true){
cin >> n >> m >> p;
if(n == 0)
break;
int ave = 0, deno, x;
for(int i=0; i<n; i++){
cin >> x;
if(i+1 == m)
deno = x;
ave += x*100;
}
if(deno == 0)
cout << 0 << endl;
else... | 0 | 21,872,710 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int n, m;
cin >> n >> m;
vector<int> broken(n+2);
rep(i,m) {
int a;
cin >> a;
broken[a+1] = 1;
}
vector<int> dp(n+2);
... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define pb push_back
#define endl '\n'
#define pii pair<ll int,ll int>
#define vi vector<ll int>
#define all(a) (a).begin(),(a).end()
#define F f... | 0 | 26,269,270 |
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long int
#define pb push_back
#define fi first
#define se second
#define ld long double
#define vi vector<vector<ll> >
using namespace std;
const int MOD=1000000007;
const int MOD2=15000007;
const ll MAX=918... | #include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
#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(... | 0 | 99,974,356 |
#include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}
typedef lon... | #include<bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
priority_queue<llint,vector<llint>,greater<llint> > que;
priority_queue<llint> Que;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
int ans=0... | 0 | 45,129,288 |
#include<iostream>
#include<map>
#include<string>
using namespace std;
int main(){
string s;
cin>>s;
map<char,int> a;
for(int i=0;i<s.size();++i){
++a[s[i]];
if(a[s[i]]>1){
cout<<"no"<<endl;
return 0;
}
}
cout<<"yes"<<endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
ll n,a,b,c;
cin >> n >> a >> b >> c;
vector<ll> l(n);
for(int i = 0;i < n;i++)... | 0 | 46,964,017 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef priority_queue<int> PQ;
#define fore(i,a) fo... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef p... | 0 | 100,663,173 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N;
map<long long, int, greater<long long>> mp;
for(int i = 0; i < N; i++){
long long hoge = 0;
cin >> hoge;
mp[hoge]++;
}
long long ans = 0;
int count = 0;
for (auto x : mp) {
if (x.... | #include <bits/stdc++.h>
using ull = unsigned long long int;
inline int digits_sum(int n) {
int sum = 0;
for (char c : std::to_string(n))
sum += c - '0';
return sum;
}
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
int n = 0 , a = 0, b = 0;
std... | 0 | 55,132,962 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> t(100001);
for(int i=0;i<n;i++){
cin >> a.at(i);
t.at(a.at(i))++;
}
int k=0,cnt =0;
for(int i=0;i<100001;i++){
if(t.at(i) >= 3){
if(t.at(i)%2 == 0) t.at(i) = ... | #include <iostream>
#include <string>
using namespace std;
int main() {
string str = "";
bool leftFlag = false;
int count = -1;
int i = -1;
while(str != "#") {
cin >> str ;
leftFlag = false;
count = -1;
i = -1;
while(true) {
i++;
if(str[i] == '\0') break;
if(str[i] < 'h... | 0 | 58,951,485 |
#include <iostream>
#include <iomanip>
using namespace std;
int main()
{
int t, x;
cin >> t >> x;
cout << setprecision(15) << "\n";
cout << (double)t / (double)x << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> P;
typed... | 0 | 10,001,240 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef long double ld;
typedef pair<int,ll> P;
typedef tuple<int,int,int> TP;
constexpr int INF = 2e9;
ll gcd(ll a, ll b){
if(b == 0)return a;
return gcd(b,a%b);
}
ll lcm... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
ll fact(int i) {
if (i == 0) return 1;
return (fact(i - 1)) * i;
}
ll gcd(ll a, ll b) {
if(b == 0) return a;
retu... | 0 | 98,078,857 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int , int> i_i;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> vvl;
typedef vector... | #include <bits/stdc++.h>
using namespace std;
int main(){
int W, H, N;
cin >> W >> H >> N;
int x[N], y[N], a[N];
for(int i=0; i<N; i++){
cin >> x[i] >> y[i] >> a[i];
}
int xl=0, yd=0;
int xr=W, yu=H;
for(int i=0; i<N; i++){
if(a[i]==1){
xl=max(xl, x[i]);
... | 0 | 75,543,103 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N; cin >> N;
vector<int64_t> vecA(N);
for (int i = 0; i < N; i++) cin >> vecA[i];
vector<int64_t> vecB(N);
for (int i = 0; i < N; i++) cin >> vecB[i];
int64_t sum = 0;
for (int i = 0; i < N; i++) {
int64_t tmpA = vecA[i], tmpB = vecB[i];
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 | 46,673,032 |
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
using Graph = vector<vector<int>>;
int main() {
int n;
cin >> n;
Graph G(n);
for (int i = 0; i < n; i++) {
int u, k;
cin >> u >> k;
u--;
for (int j = 0; j < k; j++) {
int v;
cin >> v;
v--;
G[u].push_back(v);
}
}
vect... | #include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<sstream>
#include<numeric>
#include<cassert>
#define f first
#define s second
#define mp make_pair
#define RE... | 0 | 9,410,699 |
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> A(5);
for(int &i:A)
cin>>i;
int N=0-10;
for(int i:A)
N+=(i+9)/10*10;
int j=10;
for(int i:A)
if(i%10!=0)
j=min(j,i%10);
cout<<N+j<<endl;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
#define endl "\n"
using ll = long long;
using P = pair<int,int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
int main (){
string s;
cin >> s;
if(s.size() >= 4){
str... | 0 | 4,023,517 |
#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... | #include <bits/stdc++.h>
using namespace std;
using str = string;
using ss = stringstream;
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
str a,b;
cin>>a>>b;
if(a.size()>b.size()) puts("GREATER");
else if(a.size()<b.size()) puts("LESS");
else
{
for(int i=0;i<a.size();i++)
... | 0 | 5,944,604 |
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define dunk(a) cout << (a) << "\n"
using name... | #include <stdio.h>
int main(){
int n,l,r;
char a[1001],temp[1001],c[1001];
scanf("%s",a);
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%s",temp);
if(temp[2]=='p'){
scanf("%d%d",&l,&r);
r++;
scanf("%s",c);
for(int j=0;j<r-l;j++){
... | 0 | 17,967,412 |
#include <bits/stdc++.h>
using namespace std;
vector<int> forintinput(int n) {
vector<int> x(100000);
for(int i = 0;i < n;i++) cin >> x[i];
return x;
}
int main(){
string s;
cin >> s;
int acnt = 0,bcnt = 0;
for(int i = 0;i < 3;i++){
if(s[i] == 'A'){
acnt++;
}else{
bcnt++;
}
}
if(acnt == 0 || bcnt =... | #include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
t... | 0 | 18,519,095 |
#include<cstdio>
#include<vector>
#include<iostream>
using namespace std;
vector<bool> prime(1000010, 1);
int n;
void precalc()
{
prime[0] = 0; prime[1] = 0; prime[2] = 1;
for( int i = 2; i * i <= 999999; i++ ){
if( prime[i] ){
for( int j = 1; ( j + 1 ) * i <= 999999; j++ ){
... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";n... | 0 | 45,995,001 |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define IO(i, o) freopen(i, "r", stdin), freopen(o, "w", stdout)
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
mt... | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
int N, K;
vector<ll> H;
ll INF = 1145141919810893;
vector<ll> pressAr;
void press() {
for (int i = 0; i < H.size(); i++) {
pressAr.push_back(H[i]);
}
sort(pressAr.begin(), pressAr.end());
pressAr.erase(unique(pressA... | 0 | 23,208,762 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(n) begin(n),end(n)
using ll = long long;
using P = pair<int,int>;
int main() {
string s;
cin >> s;
int n = s.size();
int A = 0;
int B = 0;
rep(i,n) {
if(s[i]-'0' != i%2) A++;
else ... | #include <bits/stdc++.h>
using namespace std;
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; }
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define re... | 0 | 19,066,752 |
#include<iostream>
using namespace std;
int main(void){
int s1,s2,s3,s4,a;
int t1,t2,t3,t4,b;
cin >>s1;
cin >>s2;
cin >>s3;
cin >>s4;
a=s1+s2+s3+s4;
cin >>t1;
cin >>t2;
cin >>t3;
cin >>t4;
b=t1+t2+t3+t4;
if(a>b)cout << a << endl;
else cout << b << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
typedef long long ll;
ll solve(ll arr[], ll n, ll k)
{
ll dp[n + 1][k + 1];
for (ll i = 0; i <= k; i++)
dp[1][i] = (i <= arr[1]) ? 1 : 0;
for (ll i = 2; i <= n; i++)
{
for (ll j = 0; j <= k; j++)
{
if (j == 0)
dp[i][j] = dp[i - 1][j];
... | 0 | 100,469,738 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int h, w;
cin >> h >> w;
vector<string> image(h);
for (int i = 0; i<image.size(); i++){
cin >> image.at(i);
for (int j = 0; j<2; j++){
cout << image.at(i) << endl;;
}
}
} | #include <bits/stdc++.h>
#define rep(i, z, n) for(int64_t i = z; i < n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
#define PI 3.14159265358979
const int INF = 1 << 29;
using namespace std;
typedef pair<int64_t, int64_t> P;
int main(){
int N;
cin >> N;
vector<int> dp(N + 100, INF);
dp.a... | 0 | 95,628,016 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define fi first
#define se second
#define pb push_back
#define mod 998244353
#define floop(i,a,b) for (int i=(a);i<(b);i++)
#define rloop(i,a,b) for (int i=(a);i>=(b);i--)
#define floopeq(i,a,b) for (int i=(a);i<(b);i++)
#define pa pair<int,int>
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
#define int lli
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<lli> vli;
typedef vector<pii> vii;
const int MOD = 1e9 + 7;
const double PI = acos(-1.0);
const int xd[4] = {1, 0... | 0 | 50,015,604 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.