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 main(){
int c=0;
string s,x;
cin>>s>>x;
for(int i=0,j=s.size()-1;i<s.size();i++,j--){
if(s[i]==x[j])
c++;
}
if(c==3)
cout<<"YES";
else cout<<"NO";
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define vll vector<ll>
#define umap unordered_map<ll, ll>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, a, ans = 0;
cin >> n;
umap x;
for(ll i=0; i<n; i++){
cin >> a;
x[a]++;
}
a = 0;
... | 0 | 96,774,710 |
#include<cstdio>
#include<iostream>
#include<map>
#include<set>
#include<vector>
#include<cstring>
#include<cassert>
#include<sstream>
#include<cmath>
#include<algorithm>
#include<queue>
#include<limits>
#include<ctime>
#include<stack>
#include<bits/stdc++.h>
#include<string>
#include<stdlib.h>
#include<stdio.h>
typede... | #include <bits/stdc++.h>
#define FAST_IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define mod 1000000007
#define endl "\n"
using namespace std ;
using bigint = long long int ;
using vi = vector<int> ;
using vll = vector<long long int> ;
int main(){
int N ; cin >> N ;
int arr[N+2] ;
ar... | 0 | 30,895,908 |
#include<iostream>
#include<string>
using namespace std;
int main(){
int l, c, len, m_len, m_cnt;
int cnt[500] = {};
string str, word[500];
while(cin >> str){
for(int i=0; i<500; i++){
if(word[i] == ""){
word[i] = str;
cnt[i] = 1;
break;
}
else if(word[i] == str){
... | #include<cstdio>
#include<iostream>
#include<string>
#include<algorithm>
#include<stdio.h>
#include<locale.h>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long int ll;
const ll cs=1000000000;
bool z[1000]={};
int main()
{
int N;
string s;
scanf("%d",&N); cin>>s;
b... | 0 | 24,959,306 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
ll MOD = 1000000000 + 7;
bool debug = 0;
void solve() {
int n, c, k;
cin >> n >> c >> k;
vector<int> t(n);
for (int i = 0; i < n; i++) cin >> t[i];
sort(t.begin(), t.end());
int cnt = 0;
for (int i ... | #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<... | 0 | 32,451,257 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int a, x;
cin >> a >> x;
int amari = a % 500;
if(amari > x) cout << "No" << endl;
else cout << "Yes" << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define vp vector<pair<int, int>>
#define vll vector<long long>
#define inf 1000000100
#define infll 1LL << 50
int main()
{
string s;
cin >> s;
int ans = 0;
for(int i = 1; i < s.size()/2; ++i)
... | 0 | 45,489,983 |
#include <bits/stdc++.h>
using namespace std;
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
#define pb push_back
#define mp make_pair
#define cotu cout
#define itn int
#define Red ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define F first
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
vector<int>x(3);
cin >> x[0] >> x[1] >> x[2];
sort(x.begin(),x.end());
int a=x[0],b=x[1],c=x[2];
int ans=0;
if(a%2==b%2&&b%2==c%2){
int dif1,dif2;
dif1=c-a;
dif2=c-b;
... | 0 | 62,075,051 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int64_t> a(n);
for(auto &e : a) cin >> e;
vector<int64_t> sum(n + 1), pos(n + 1);
for(int i = 0; i < n; ++i) sum[i + 1] = sum[i] + a[i];
for(int i = 0; i < n; ++i) pos[i + 1] = pos[i] + (a[i] > 0 ? a[i... | #include <cstdio>
#include <cstdlib>
using namespace std;
#define MAX_N 100
#define MAX_T 40000
int t[MAX_N];
double v[MAX_N], f[MAX_T];
double min(double a, double b)
{
return a < b? a: b;
}
int main()
{
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &t[i]);
for (int i = 0;... | 0 | 65,770,193 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char c;
cin >> c;
if (c == 'a') {
cout << "vowel" << endl;
}
else if (c == 'e') {
cout << "vowel" << endl;
}
else if (c == 'i') {
cout << "vowel" << endl;
}
else if (c == 'o') {
cout << "vowel" << endl;
}
else if (c == 'u')... | #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... | 0 | 26,698,077 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | #include "bits/stdc++.h"
using namespace std;
int main(){
int H,W,K; cin >> H >> W >> K;
vector<string> c(H);
for (int i = 0; i < H; i++) cin >> c.at(i);
int bt = 0;
int ans = 0;
while (bt < (1 << (H+W))){
vector<bool> H_bool(H,false),W_bool(W,false);
for (int k = 0; k < H+W; k++) {
if ((bt >> k)... | 0 | 96,948,038 |
#include <bits/stdc++.h>
#include <tuple>
#define REP(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
const int INF = 1e9;
using namespace std;
struct node{
vector<int> child;
int parent;
int depth;
};
node n[100000];
int main() {
int v;
cin >> v;
REP(i, v){
n[i].p... | #include <bits/stdc++.h>
#define pb push_back
#define mkp make_pair
#define llu unsigned long long int
#define ll long long
#define ld long double
#define foi(a, n) for (int i = a; i < n; i++)
#define foj(a, n) for (int j = a; j < n; j++)
#define foin(a, n) for (int i = n; i >= a; i--)
#define fojn(a, n) for (int j = n... | 0 | 89,380,346 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int MAX = 1e5 + 5;
const int INF = 1001001001;
const int MOD = 1e9 + 7;
int main(){
int N, K;
cin >> N >> K;
vector<int> A(N);
rep(i, N) cin >> A[i];
vec... | #include <iostream>
using namespace std;
typedef long long ll;
int N;
int M=35;
ll X[1005];
ll Y[1005];
int main() {
cin >> N;
for (int i=0; i<N; i++)
cin >> X[i] >> Y[i];
bool seen_parity[2] = {false,false};
for (int i=0; i<N; i++) {
seen_parity[(X[i]+Y[i... | 0 | 69,588,805 |
#include <iostream>
using namespace std;
int main(void){
int a;
cin>>a;
int b=a/1000;
int c=(a%1000)/100;
int d=(a%100)/10;
int e=a%10;
if((b==c&&c==d)||(c==d&&d==e)||(b==c&&c==d&&d==e)){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
} | #include <bits/stdc++.h>
#define PI 3.14159265359
#define INF 1e9
#define LINF 1e18
#define IMOD 1000000007
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define lrep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define lrep2(i,a,n) for(long l... | 0 | 84,059,418 |
#include <bits/stdc++.h>
using namespace std;
static const int INF=100000000;
int main() {
int H,N;
cin>>H>>N;
int A[N];
int B[N];
int maxA=0;
for(int i=0;i<N;i++){
cin>>A[i]>>B[i];
maxA=max(maxA,A[i]);
}
int DP[H+maxA+1];
for(int i=0;i<=H+maxA;i++){
DP[i]=INF;
}
DP[0]=0;
for(int i=0... | #include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<string>
#include<map>
#include<set>
using namespace std;
const double esp = 1e-8;
const int maxn = 1007;
typedef long long ll;
int n;
int main(){
scanf("%d", &n);
for(int i = 1; i <= n; i++){
int y, m, d;
... | 0 | 65,179,978 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
void Digvijay()
{
int k;
cin>>k;
queue<int> q;
for(int i=1;i<10;i++)
{
q.push(i);
}
k--;
while(k)
{
int f=q.front();
q.pop();
if(f%10==9)
{
q.push(f*10+f%10-1);
q.push(f... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main()
{
ll n, m;
cin >> n >> m;
vector<ll> h(n);
vector<set<ll>> mat(n, set<ll>());
rep(i, n){
cin >> h[i];
}
rep(i, m){
ll a, b;
cin >> a >> b;... | 0 | 46,200,527 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
constexpr ll INF = 9e18;
constexpr int inf = 1e9;
constexpr double INFD = 1e100;
constexpr ll mod = 1000000007;
const double PI = 3.1415926535897932384626433832795028841971;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0,... | #include <bits/stdc++.h>
#define INF 1e9
#define endl '\n'
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define FORE(i, a, b) for (int i = (a), e = (b); i < e; ++i)
#define RFORE(i, a, b) for (int i = (b)-1, e = (a); i >= e; --i)
#define ALL(x) (x).begin(... | 0 | 43,378,221 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
using P = pair <int, int>;
int main() {
char c;
cin >>c;
if(c=='a'||c=='e'||c=='i'||c=='o'||c=='u') cout << "vowel" <<endl;
else cout <<"conson... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i,n) for(i=0;i<n;i++)
#define F(i,a,b) for(i=a;a<=b;i++)
#define arr(a,n) for( i=0;i<n;i++)cin>>a[i];
#define fi first
#define se second
#define mp make_pair
#define mod 1000000007
#define YES cout<<"YES... | 0 | 59,343,605 |
#include <bits/stdc++.h>
using namespace std;
using pp=pair<int,int>;
int main() {
vector<int> A(3);
cin >> A[0] >> A[1] >> A[2];
sort(A.begin(), A.end());
cout << A[2]-A[0] << endl;
} | #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... | 0 | 73,063,565 |
#include<iostream>
#include<cstdio>
#include<string>
#include<math.h>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<map>
#include<numeric>
#include<queue>
#include<functional>
#include<cassert>
#include<set>
#define rep(a,b) for(int a=0;a<b;++a)
#define REP(a,b,c,d) for(int a=b;a<c;a+=d)
#define yes c... | #include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <vector>
#include <cstdlib>
#include <map>
#include <queue>
#include <deque>
#include <algorithm>
#include <stack>
#include <functional>
#include <sstream>
#define rep(i,j,n) for(i=j;i<(n);i++)
#define rrep(i,j,n) for(i=j;i>(n);i--)
type... | 0 | 80,197,994 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcount
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
const int C = 26;
in... | #include<iostream>
#include<math.h>
#include<string>
using namespace std;
#define rep(i,n) for(i=0;i<n;i++)
int main(){
long long H,W;
cin>>H>>W;
if(H==1 || W==1){
cout<<'1';
return 0;
}else{
;
}
if((H*W)%2==0){
cout<<(H*W)/2;
return 0;
}else{
... | 0 | 22,113,694 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for... | #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 | 80,144,600 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template... | 0 | 38,861,345 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int j, tmp, ans = 0,min;
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> n;
pair<int, int> tmpair;
cin >> j;
for (int i = 1; i < (j + 1); i++) {
cin >> tmp;
n.push(make_pair(tmp, i));
}
for (int i = 0; i < j; i++) {
... | #include<iostream>
#include<math.h>
#include<algorithm>
#include<utility>
#include<queue>
#include<string.h>
#include<string>
#include<set>
#include<map>
#include<vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
int N;
int a[200010],b[200010];
int main(){
cin>>N;
int mB=2001001001;
... | 0 | 24,574,991 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N, M;
cin >> N >> M;
vector<long long> x(N), y(N), z(N);
for(int i = 0; i < N; i++) cin >> x[i] >> y[i] >> z[i];
vector<long long> a(N);
vector<long long> ans(8, 0);
int j = 0;
for(int i = 0; i < N; i++) a[i] = x[i] + y[... | #include<iostream>
#include<math.h>
#include<bits/stdc++.h>
#include<queue>
#include<cstdio>
#include<vector>
#include <algorithm>
#include<string>
#define rep(i,n) for (int i=0;i<(n);++i)
using ll = long long;
using namespace std;
using P = pair<int,int>;
int main(){
string s;
cin>>s;
int ans = 0;
for(... | 0 | 8,433,439 |
#include <iostream>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
while(!(a == 0 && b == 0)){
for(int i = 0; i < a; i++){
for(int j = 0; j < b; j++){
cout << "#";
}
cout << endl;
}
cout << endl;
cin >> a >> b;
... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld double
#define rep(i,a,b) for(ll i=a; i<b; ++i)
#define BOOST std::ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define all(v) v.begin(),v.end()
#define sl(a) a.size()
#define mo... | 0 | 16,817,780 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s; cin >> s;
int n = 15 - s.size();
int cnt = 0;
for (char c: s) {
if (c == 'o') cnt++;
}
bool ans = (cnt + n >= 8);
cout << (ans ? "YES" : "NO") << endl;
} | #include "bits/stdc++.h"
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "#x3<<": "<<x3<<endl
#define debug_4(x1,x2,x... | 0 | 38,233,776 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
string S,T;
cin>>S>>T;
for(ll i=0;i<T.size();i++) {
cout<<S[i]<<T[i];
}
if(S.size()!=T.size()) {
cout<<S.back();
}
cout<<endl;
} | #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>;
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_eleme... | 0 | 40,780,338 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vi = vector<int>;
#define _GLIBCXX_DEBUG
#define IO_STREAM cin.tie(0);ios::sync_with_stdio(false)
#define all(x) x.begin(),x.end()
#define rep(i,sta,end) for(int i=sta;i<end;++i)
#define lcm(a,b) (a)/__gcd((a),(b))*(b)
#d... | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n; cin >> n;
vector<ll> a(n + 2, 0);
ll sum = 0;
for(int i = 1; i < n + 1; i++){
cin >> a[i];
sum += abs(a[i] - a[i - 1]);
... | 0 | 59,662,673 |
#include <stdio.h>
int main(){
int a[4][3][10]={0},n,x,y,z,temp;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d%d%d%d",&x,&y,&z,&temp);
a[x-1][y-1][z-1]+=temp;
}
for(int i=0;i<4;i++){
for(int j=0;j<3;j++){
for(int k=0;k<10;k++){
printf(" %d",a[i][... | #include <bits/stdc++.h>
#define int long long
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)a, i##_len=(b); i<i##_len; i++)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(box) box.begin(), box.end()
using namespace std;
using P... | 0 | 41,193,518 |
#include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <algorithm>
#include <sstream>
#include <string>
#include <math.h>
#include <set>
#include <deque>
#include <queue>
#include <list>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
int main() {
io... | #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;
constexpr int INF = 2e9 + 1;
int main() {
int n, l, q;
cin >> n;
vector<int> x(n);
rep(i,n) cin >> x[i];
cin >> l >> q;
vector<vector<int>> to(32, vector<int>(n, 0));
... | 0 | 29,788,767 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
int main() {
int n, a, ... | #include <iostream>
using namespace std;
double func(double a){
return a*a;
}
int main(){
double d=1;
long long int sum=0;
while(cin >> d){
for(double i=0;i<=(600-d);i+=d){
sum += d * func(i);
}
cout << sum << endl;
sum =0;
}
return 0;
} | 0 | 73,860,365 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<map>
using namespace std;
int main() {
long long MOD = 1000000007;
int N; cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++) cin >> A[i];
long long ans = 0;
long long pow = 1;
for (int bit = 0; bit <... | #include <iostream>
#include <queue>
using namespace std;
using ll = long long;
int main(){
ll K,n;
cin >> K;
queue<ll> q;
for(int i=1;i<10;++i) q.push(i);
while(1){
n = q.front();
q.pop(); --K;
if(K==0){
cou... | 0 | 40,592,791 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
#define ll long long
int main(void){
ll n,k;
vector<ll>a,b;
cin >> n >> k;
a.resize(n); b.resize(n);
ll ans = 0;
for(int i = 0; i < n; ++i){
cin >> a[i] >> b[i];
if((a[i]|k) <= k)
ans += b[i];
}
ll cnt = 0;
... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | 0 | 76,799,949 |
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) (v).begin(),(v),end()
#define pb push_back
typedef long long ll;
typedef pair<int,int> P;
template<typename A,typename B> inline void chmin(A &a,B b){if(a>b) a=b;}
template<typename A,typename B> inline void chmax(A &a,B... | #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<<" ";ne... | 0 | 2,948,806 |
#include <iostream>
using namespace std;
void checkDistance(int a , int b){
if((b - a + 1) % 2 == 0){
cout << "Borys" << endl;
}
else{
cout << "Alice" << endl;
}
}
int main(){
int n , a , b;
cin >> n >> a >> b;
if(n == 2){
cout << "Borys" << endl;
exit(0);
}
if(b == a + 1){
cout << "Borys" << endl;
... | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define vi vector<int>
#def... | 0 | 58,433,944 |
#include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
const int mod = 998244353;
int main() {
long long N, ans;
cin >> N;
long long D[N];
map<int, int> count;
for (int i = 0; i < N; i++) {
cin >> D[i];
count[D[i]]++;
}
if (count[0] != ... | 0 | 29,005,222 |
#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;
#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 | 41,068,472 |
#include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
int X[3];
int main() {
for (int i = 0; i < 3; ++i) {
cin >> X[i];
}
sort(X, X + 3);
int ba = X[1] - X[0];
int ca = X[2] - X[0];
int cb = X[2] - X[1];
if (cb % 2 == 0 && ca % 2 == 0) {
printf("%d\n", (ca + cb) / 2);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rep2(i,s,n) for(int i = (s); i < (n); ++i)
#define ll long long
#define ld long double
#define P pair<ll,ll>
#define all(v) v.begin(),v.end()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1.0);
ll f(... | 0 | 53,236,145 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n,t;
cin>>n>>t;
vector<int64_t> data(n);
for (int64_t i=0;i<n;i++){
cin>>data.at(i);
}
int64_t answer=0;
for (int64_t i=0;i<n-1;i++){
answer+=min(data.at(i+1)-data.at(i),t);
}
answer+=t;
cout<<answer<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,int> pli;
typedef pair<int,int> pii;
#define rep(i,a,b) for(ll i=a ; i<b ; i++)
#define qrep(que, ite)... | 0 | 81,367,749 |
#include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<algorithm>
#include<cstdio>
#include<stdio.h>
#include<stack>
#include<sstream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<list>
#include<numeric>
typedef long long ll;
#define pi 3.14159265358979323846
#define VI vecto... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | 0 | 27,609,576 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
int n;
cin>>n;
ll a;
cin>>a;
ll res = 0, h = a;
for (int i=1; i<n; i++) {
cin>>a;
if (a > h) h = a;
else res += (h - a);
}
cout << res << '\n';
return 0;
} | #include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <iterator>
#include <map>
#include <set>
#include <iomanip>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using G... | 0 | 22,924,913 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i=0; i<n; i++)
int main(){
int n;
cin>>n;
int i;
int sum=0;
string str_n=to_string(n);
rep(i, str_n.length()) {
sum+=(str_n[i]-'0');
}
if (n%sum == 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
int n;
while (cin >> n) {
if (n == 0) {
break;
}
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
int ans = a[1] - a[0];
for (int i = 0; i < n - 1... | 0 | 16,970,241 |
#include <iostream>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
using ll = long long;
using namespace std;
int main() {
int a,b;
cin >> a >> b;
int ans = 6 - a - b;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> l_l;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#def... | 0 | 29,746,175 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <math.h>
using namespace std;
#define coYES cout << "YES" << endl
#define coNO cout << "NO" << endl
#define coYes cout << "Yes" << endl
#define coNo cout << "No" << endl
#define coyes cout << "yes" <<... | #include<bits/stdc++.h>
using namespace std;
template <typename T> using vec = vector<T>;
int main()
{
int n;
cin >> n;
vec<int> a(n);
for (int i = 0; i < n; i++)
{
cin >> a[i];
a[i]--;
}
int ans = 0;
for (int i = 0; i < n; i++)
{
if(i == a[a[i]])
{
... | 0 | 16,499,440 |
#include <stdio.h>
int main() {
int h1, m1, h2, m2, k, minute;
scanf("%d %d %d %d %d", &h1, &m1, &h2, &m2, &k);
m2 = m2 + h2 * 60;
m1 = m1 + h1 * 60;
if(m2 >= m1) minute = m2 - m1;
else minute = m1 - m2;
printf("%d\n", minute - k);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
bool isOK(int ma, int n) {
for (int i = ma; i >= 1; --i) {
if (n >= i) {
n -= i;
}
}
return n == 0;
}
int main() {
int n;
cin >> n;
int left = 0, right = n;
int ma = n;
while (right - left > 1) {
int mid = left + (right - left) / 2;
if ... | 0 | 20,416,071 |
#define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#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(void) {
int X, A;
cin >> X >> A;
if (X < A) {
cout << 0 << endl;
} else {
co... | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define MIN(a) *min_element(all(a))
#define MAX(a) *max_element(all(a))
#define SUM(a) accumulate(all(a), 0LL)
#define REP(i, n) for(int (i)=0; (i)<(n); (i)++)
#define RREP(i, n) for(int (i)=(n)-... | 0 | 43,891,005 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long ll;
typedef pair<int,int> P;
int main(){
int n,m,A[200001];
cin>>n;
rep(i,n) cin>>A[i];
sort(A,A+n);
vector<P> ans;
rep(i,n-2){
if(A[i+1]>=0) ans.push_back(P(A[0],A[i+1])),A[0]-=A[i+1];
... | #include<bits/stdc++.h>
using namespace std;
using Int = long long;
#include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T, typename E>
struct SkewHeap{
typedef function<T(T, E)> F;
typedef function<E(E, E)> G;
typedef function<bool(T,T)> C;
F f;
G g;
C c;
E e;
SkewHeap(... | 0 | 68,124,880 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
signed main() {
#ifdef _DEBUG
#endif
ios::sync_with_stdio(0); cin.tie(0);
vector<int> v = {105, 104, 103, 102, 101, 100};
int n;
cin >> n;
for (a... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr long long MOD = 1e9 + 7;
#define MAX 30000
signed main() {
int n;
cin >> n;
int p[n];
... | 0 | 17,632,556 |
#include <bits/stdc++.h>
using namespace std;
int val=1,n;
double k;
int main (){
cin>>n>>k;
int z=k;
while(double(k)/2>1){
val++;
k/=2;
}
if(n>=val){
cout<<pow(2,val)+z*(n-val);
}
else{
cout<<pow(2,n);
}
} | #include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1e18
#define ceill(a, b) (a+b-1)/b
#define ok cout << "ok" << endl;
#define sp << " " <<
ll mod = 1e9+7;
void ans(bool b, ostream& out=cout){ out << (b ? "Yes" : "No") << endl; }
void ans2(bool b, ostre... | 0 | 2,770,266 |
#include<cstdio>
#include<iostream>
using namespace std;
int main(void) {
int N;
scanf("%d", &N);
int ans = 0;
for (int i = 1; i <= N; i++) {
ans += i;
}
printf("%d", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main(){
int N, T;
cin >> N >> T;
vector<ll> t(N);
for(int i=0; i<N; i++) cin >> t[i];
ll max_time = 0;
ll total_time = 0;
for(int i=0; i<N; i++) {
if(max_time >= t[i]) {
... | 0 | 50,564,553 |
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep2(i, l, r) for (ll i = (l); i < (r); i++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define pri(x) cout << (x) << "\n"
#define pri2(x, y) cout << (x) << " " << (y) << "\n"
#d... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int N,D;cin>>N>>D;
int X[N][D];
for(int i=0;i<N;i++){
for(int l=0;l<D;l++){
cin>>X[i][l];
}
}
int ans=0;
for(int i=0;i<N;i++){
for(int l=i+1;l<N;l++){
int sum=0;
for(int m=0;... | 0 | 84,294,727 |
#include <iostream>
using namespace std;
const int N = 100000;
int par[N], runk[N];
void init(int n)
{
for(int i = 0; i < n; ++i){
par[i] = i;
runk[i] = 0;
}
}
int find(int x)
{
if(par[x] == x)
return x;
else
return par[x] = find(par[x]);
}
void unite(int x, int y)
{
x = find(x);
y = find(y);
if(x == y) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define P pair<int,int>
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
template<class T>void chmax(T &a,T b){if(a<b)a=b;}
template<class T>void chmin(T... | 0 | 5,321,168 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define getbit(n, i) (((n) & (1LL << (i))) != 0)
#define setbit0(n, i) ((n) & (~(1LL << (i))))
#define setbit1(n, i... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 0 | 40,497,507 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
vector <ll> primes;
ll divi[1000005];
vector <ll> fact;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll i,j,k,l,m,n,t;
cin >> n;
if(n == 1)
{
cout << 0 << '\n';
return 0;
}
for(i=2;i<1000005;i++)
{
for(j=i+i;j<1000005... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main(){
ll n;
ll res=0;
cin >> n;
ll a[n];
ll totala=0;
for(ll i=0;i<n;i++){
cin >> a[i];
totala+=a[i];
}
ll b[n];
ll c[n];
ll totalb=0;
ll count=0;
for(ll i=0... | 0 | 47,730,839 |
#include <iostream>
#include <math.h>
#include <vector>
typedef long long LL;
using namespace std;
int main() {
LL n;
vector<LL> a;
LL tmp_a;
LL orig=0;
LL ans;
cin >> n;
a.push_back(0);
for(int i=0; i<n; i++){
cin >> tmp_a;
a.push_back(tmp_a);
}
a.push_back(0);
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define vp vector<pair<int, int>>
#define vll vector<long long>
#define inf 1000000100
#define infll 1LL << 50
ll gcd(ll a, ll b)
{
if(b == 0)
{
return a;
}
return gcd(b, a%b);
}
ll lcm... | 0 | 34,914,935 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using Tup = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define prt(v) cout<<(v)<<"\n";
#define fl cout<<flush;
#define ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int A, B, M;
cin >> A >> B >> M;
vector<int> a(A);
vector<int> b(B);
for (int i=0; i<A; i++) cin >> a.at(i);
for (int i=0; i<B; i++) cin >> b.at(i);
int min_a = 1e6;
int min_b = 1e6;
for (int i=0; i<A; i++){
min_a = mi... | 0 | 49,560,004 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod=1000000007;
const ll inf=1e18;
int main(){
ll n,m;
cin >> n>> m;
ll a[n+1]={};
bool b[n+1]={};
ll c=0;
ll d=0;
for(ll i=0;i<m;i++){
ll p;
string s;
cin >> p >> s;
if(s=="AC"){
b[p]=true;
}
else... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
const int MOD = 1000000... | 0 | 91,980,091 |
#pragma region header
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int n;
cin>>n;
int a[n];
for (int i = 0; i < n; ++i)
{
cin>>a[i];
}
int cnt=0,ans=0;
for (int i = 0; i < n-1; ++i)
{
if (a[i]==a[i+1])
{
++cnt;
}
else
{
ans+=(cnt+1)/2;
cnt=0;
}
}
ans+=(cnt+1)/2;
co... | 0 | 89,946,971 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const int MOD = 1000000009;
const long long INF = 1LL << 60;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
f... | #include <iostream>
#include <cstring>
using namespace std;
int main()
{
string strr;
cin >> strr;
if(strr.size()>0 && strr.size()<11)
{
string answer;
int i = 0;
while(i<strr.size())
{
if(strr[i]!='B')
{
answer+=strr[i];
... | 0 | 32,923,884 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, s1 = 0, s2 = 0, diff = 10007, dif;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
for (int i = 1; i < n; i++)
{
s1 = s2 = 0;
for (int j = 0; j < i; j++)
{
s1 = s1 + a[j];
}
for (int k = i; k ... | #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>;
static const double PI = acos(-1);
int main(){
int n;
cin >> n;
vector<int> a(n+1);
vector<int> b(n);
REP(i,n+1) cin >> a[i];
REP(i,n) ... | 0 | 40,926,157 |
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <map>
#include <vector>
#include <cmath>
using namespace std;
void a_bichrome_cells(void) {
int n, a;
cin >> n >> a;
n *= n;
cout << (n - a) << endl;
}
int main()
{
a_bichrome_cells();
return 0;
} | /* https:
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#d... | 0 | 26,467,200 |
#include <stdio.h>
int main(){
int n, n1, n2, n3;
scanf("%d", &n);
n1=n%10;
n2=(n/10)%10;
n3=n/100;
if(n1==7){
puts("Yes");
}
else if(n2==7){
puts("Yes");
}
else if(n3==7){
puts("Yes");
}
else{
puts("No");
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, count = 0;
double sq;
cin >> n;
for (int c = 1; c < n; c++)
{
sq = sqrt((double(n - c)));
if ((int)sq * (int)sq == n - c)
count++;
for (int a = 1; a < sq; a++)
{
if (((n - c) % a) == 0)
count += 2;
}
}... | 0 | 13,265,067 |
#include <bits/stdc++.h>
using namespace std;
int solve(int a, int b){
return abs(a-b);
}
int main(){
int N,ans=0; cin >> N;
vector<int> a(N);
for(int i=0; i<N; i++) cin >> a.at(i);
for(int i=0; i<N; i++){
for(int j=0; j<N; j++){
ans = max({ans,solve(a.at(i),a.at(j))});
}
}
cout << ans << en... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
ll H[305];
ll dp[305][305][305];
ll m[305][305]... | 0 | 48,864,821 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if ( a % 2 == 0 || b % 2 == 0 ) {
cout << " Even " << endl;
}
else {
cout << " Odd " << endl;
}
} | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <math.h>... | 0 | 10,531,175 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
using namespace std;
signed main() {
int n,m;
cin >> n >> m;
vector<int> a(n);
int sum = 0;
rep(i,n) {
cin >> a[i];
sum += a[i];
}
int cnt = 0;
for (int i = 0; i < n; i++) {
int vote = a[i];
if(vote * 4 * m < su... | #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 h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) cin >> s.at(i);
vector<int> dx = {-1, 0, 0, 1}, dy = {0, -1, 1, 0};
rep(i, h) {
rep(j, w) {
... | 0 | 67,651,129 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,total,K;
cin >> N;
K=N;
total=0;
for(int i=0;i<8;i++){
total+=K%10;
K/=10;
}
if(N%total==0)cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, p;
string s;
cin >> n >> p >> s;
if (10 % p == 0) {
ll ans = 0;
for (int i = 0; i < n; i++) {
if ((s[i] - '0') % p == 0) ans += i + 1;
}
cout << a... | 0 | 16,720,930 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a[11][11];
int i,j,n,d,ans,chek,cnt=0;
cin>>n>>d;
for(i=0;i<n;i++){
for(j=0;j<d;j++) cin>>a[i][j];
}
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
ans=0;
for(int k=0;k<d;k++){
ans+=((a[i... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#d... | 0 | 93,662,809 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
#define LINF 1e18
typedef long long ll;
int main() {
int N,K; cin >> N... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define N 1000000007
#define N2 998244353
#define Nmax 100001
#define INF (ll)1e18
#define pll pair<ll,ll>
#define pii pair<ll,ll>
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,... | 0 | 96,097,734 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef pair<int, int> pi;
const int maxn = 1e5 + 5;
int deg[maxn];
int n, m;
int main(){
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
int main(){
int n;
cin >> n;
int a[n];
int c[n];
rep(i,n) c[i]=0;
rep(i,n){
cin >> a[i];
c[--a[i]]++;
}
... | 0 | 27,115,645 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int x,y,z;cin>>x>>y>>z;
cout<<min(min(x+y,x+z),(y+z))<<endl;
return 0;} | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include... | 0 | 23,995,800 |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(v) v.begin(),v.end()
#define mem(arr) memset(arr, 0, sizeof(arr))
#define ff first
#define ss second
#define int long long int
const int MOD = 1e9 + 7;
const int INF = 1e18;
const int N = 1e6 + 20;
vector<int> g[N];
vector<int> vis(N);
int po... | #include<cstdio>
#include<set>
#include<functional>
#include<utility>
#include<algorithm>
using namespace std;
int main(){
unsigned N;
scanf("%u", &N);
pair<unsigned, unsigned> red[N];
set<pair<unsigned, unsigned> > blue;
unsigned a, b;
for(int i = 0; i < N; ++i){
scanf("%u %u", &red[i].... | 0 | 72,695,469 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
using ll = long long;
using P = pair<int, int>;
ll gcd(ll a, ll b){return b ? gcd(b,a%b): a;}
int main(){
int n; cin >> n;
vect... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
#define PI 3.14159265359
#define INF 1000100100
#define MOD 1000000007
#define all(x) (x).begin(),(x).end()
typedef long long ll;
#define P pair<int, int>
#define PP pair<P,P>
#define T tuple<ll,ll,ll>
#define pr(x) cout << x << endl;
using namespace std;... | 0 | 38,940,203 |
#include <stdio.h>
#define MAX_N (105)
static
void
swap( int A[], int i, int j )
{
int tmp = A[i];
A[i] = A[j];
A[j] = tmp;
return;
}
static
void
printArray( int A[], int N )
{
int i;
for ( i = 0; i < N; i++ ) {
printf("%d%c", A[i], (i == N-1) ? '\n' : ' ');
}
return;
}
static
void
sel... | #include<bits/stdc++.h>
#define ll long long
#define N 100005
#define M 1000000007
#define pii pair<ll,ll>
#define fast ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
main()
{
int n;
cin>>n;
map<int,int>mp;
int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
mp[a[i]]=i;
... | 0 | 7,454,844 |
#include<iostream>
using namespace std;
int main(){
int x,y;
while(1){
cin >> x >> y;
if(x==0 && y==0){
break;
}else{
if(y<x){
cout << y << " " << x << '\n';
}else{
cout << x << " " << y << '\n';
}
}
}
return 0;
} | #include <bits/stdc++.h>
#include <vector>
#include <queue>
using namespace std;
int main(){
int N, D;
cin >> N >> D;
vector<vector<int>> Xij(N, vector<int>(D));
for(int i=0; i<N; i++){
for(int j=0; j<D; j++){
cin >> Xij[i][j];
}
}
int count =0;
double length;
... | 0 | 99,980,879 |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define int long long
#define _GLIBCXX_DEBUG
const int INF=1e15;
signed main(){
int N;cin>>N;
for(int i=1;i<=9;i++){
if(111*i-N>=0){
cout<<111*i<<endl;
break... | #include <bits/stdc++.h>
using namespace std;
#define DUMP(x) cerr << #x << "=" << x << endl
#define DUMP2(x, y) cerr<<"("<<#x<<", "<<#y<<") = ("<<x<<", "<<y<<")"<< endl
#define BINARY(x) static_cast<bitset<16> >(x)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,m,n) for (int i=m;i<(int)(n);i++)
#define in_... | 0 | 39,801,814 |
#include<bits/stdc++.h>
#define ll long long
#define nl "\n"
#define pi acos(-1)
#define fast ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define pcase printf("Case %d:\n",ca)
int ca=1;
using namespace std;
int main(){
fast;
int a;
cin>>a;
set<int>s;
for(int i = 0;i<a;i++){
int x;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n, p;
cin >> n >> p;
vector<char>s(n + 3);
for(int i = 1; i <= n; i++){
cin >> s[i];
}
long long ans = 0;
if(p == 2){
for(int i = 1; i <= n; i++){
if((s[i] - '0') % 2 == 0){
ans = ans + 1... | 0 | 22,332,873 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) for (int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define MOD 1000000007
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using ... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <numeric>
#include <iomanip>
#defi... | 0 | 79,771,410 |
#include <iostream>
#define rep(i, n) for(int i=0; i<n; i++)
using namespace std;
int main(){
string S;
cin >> S;
int N = S.size();
int constant_left_greater[N+1] = {0};
int constant_right_less[N+1] = {0};
int tmp = 0;
rep(i, N){
if(S[i] == '<')
tmp++;
else
tmp = 0;
constant_left_g... | #include<bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, left, right;
cin >> a >> b >> c >> d;
left = a + b;
right = c + d;
if (left > right) {
cout << "Left" << endl;
} else if (left == right) {
cout << "Balanced" << endl;
} else {
cout << "Right" <<... | 0 | 95,420,719 |
#include<iostream>
#include<vector>
#include<iomanip>
using namespace std;
int main(){
int n,k;
cin>>n>>k;
double possibility=0;
int counter=0;
for(int j=1;j<n+1;j++){
for(int i=j;i<k;i=i*2){
counter++;
}
double n1=1;
for(int y=0;y<counter;y++){
n1=n1*2;
... | #include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cmath>
#include <set>
#include <queue>
#include <vector>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
using namespace std;
typedef unsigned long long ull;
typedef lon... | 0 | 91,869,843 |
#include"bits/stdc++.h"
using namespace std;
typedef long long ll;
#define int ll
const int mod=1e9+7;
int dp[3000][3000];
int a[3000],b[3000];
int32_t main()
{
#ifndef ONLINE_JUDGE
freopen("in","r",stdin);
freopen("out","w",stdout);
#endif
int n,m;cin>>n>>m;
for(int i=1;i<=n;i++)cin>>a[i];
for(int i=1;i<=m;i++... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
vector<int> twoadd(vector<int> v, int N){
v[N-1]+=1;
int ind = N-1;
int j=N-1;
for(j=N-1;j>=1;j--){
if(v[j]>1){
v[j-1]+=1;
v[j]=0;
}
}
return v;
}
long long f... | 0 | 37,686,862 |
#include<bits/stdc++.h>
#define endl '\n';
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast")
constexpr ll INF = 1e18;
constexpr int inf = 1e9;
constexpr... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#i... | 0 | 30,265,462 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main()
{
int h[2], m[2], k;
cin >> h[0] >> m[0] >> h[1] >> m[1] >> k;
cout << h[1] * 60 + m[1] - h[0] * 60 - m[0] - k << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main(){
int n;
string foot;
int left = 0;
int right = 0;
int status = 0;
int count = 0;
while(1){
count = 0;
int left = 0;
int right = 0;
i... | 0 | 11,451,887 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<string> VS;
typedef vector< vector<int... | #include <bits/stdc++.h>
#define respa return 0
#define all(x) x.begin(), x.end()
#define sz size
#define pb push_back
#define eb emplace_back
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = 2e5 + 17, M = N << 2, mod = 1e9 + 7;
int tt = 1, n;
string s, t;
void solve () {
cin >> n >> s... | 0 | 49,506,389 |
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
using namespace std;
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
typedef long long ll;
typedef pair<int,i... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <climits>
using namespace std;
int count(vector<long long> &v){
int cnt = 0;
int N = v.size();
while(true){
long long mx = -1;
for(int i=0; i<N; i++)
... | 0 | 94,585,555 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<set>
#include<map>
#include<queue>
#define REP(i,a) for (int i = 0;i < (a);++i)
#define FOR(i,a,b) for (int i = (a);i < (b); ++i)
#define FORR(i,a,b) for (int i = (a);i >= (b); --i)
#define ALL(obj) (obj).begin,(obj).end()
#define SORT(li... | #include <iostream>
#include <string>
using namespace std;
int main(){
string s;
cin>>s;
bool can_make=true;
int ind=0;
while(can_make&&ind<s.size()-1){
if(s.substr(ind,5)=="dream"){
ind+=5;
if(s.substr(ind,2)=="er"&&s.substr(ind,5)!="erase"){
ind+=2;
... | 0 | 58,945,387 |
#include <bits/stdc++.h>
typedef long long ll;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REP2(i, a, b) for(int i = a;i <= b;i++)
#define REPR(i, a, b) for(int i = a; i >= b; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define PI 3.14159265358979323846
#define v... | #include <stdio.h>
int main() {
while(1){
int x, y, t;
scanf("%d %d", &x, &y);
if(0==x && 0==y) break;
if(y > x){
t=y;
y=x;
x=t;
}
printf("%d %d\n", y, x);
}
return 0;
} | 0 | 36,707,116 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N;
cin >> N;
long long max_height = 0;
long long sum_height = 0;
for (int i = 0; i < N; ++i) {
int A;
cin >> A;
if (A < max_height) {
sum_height += max_height - A;
}
else {
max_height = A;
}
}
co... | #include <bits/stdc++.h>
using namespace std;
using ld = double;
using point = complex<ld>;
int main() {
int n; cin >> n;
vector<point> ps;
for(int i = 0; i < n; ++i) {
int x, y; cin >> x >> y;
if(x == 0 && y == 0) continue;
ps.emplace_back(x, y);
}
n = ps.size();
sort(ps... | 0 | 12,972,032 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <bitset>
#include <numeric>
#include <complex>
#include <iomanip>
#include <cassert>
#include <random>
int main() {
lon... | #include<iostream>
#define N 3
#define loop(i,n) for(int i=0;i<n;i++)
using namespace std;
int a[100002][N];
int dp[100002][N+1];
int n;
int min_cost(int n,int c){
if(n==0) return 0;
if(dp[n][c]!=-1) return dp[n][c];
int ans=0;
for(int i=0;i<=2;i++)
if(c==3)
ans=max(ans,a[n-1][i]+... | 0 | 92,011,833 |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define int long long
#define pii pair<int, int>
#define F first
#define S second
#define pb push_back
const int N=1e5+5, INF=1e9;
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using ordered_set... | #include <iostream>
#include <map>
#include <cmath>
#include <ios>
#include <iomanip>
#include <algorithm>
#include <queue>
#include <stack>
#include <numeric>
using namespace std;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T1, cla... | 0 | 29,372,942 |
#include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define pb push_back
#define mp make_pair
#define s second
#define f first
#define mod 998244353
#define sz(v) (int)(v).size()
#define pii pair<int, int>
#define vi vector<int>
#define ll long long
#define fastio ios_base::sync_with_stdio(false);cin.tie... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <map>
#include <set>
using namespace std;
bool ok(long long cnt, long long a, long long b)
{
long long c = a * b;
if (cnt < b)
{
long long F = 1 * cnt;
long long L = (cnt ... | 0 | 63,834,455 |
#include <bits/stdc++.h>
using namespace std;
const int64_t INF=999999999;
int main() {
int x;
cin>>x;
if(x<1200){cout<<"ABC"<<endl;}
else{cout<<"ARC"<<endl;}
return 0;} | #include<bits/stdc++.h>
#define MAX 1000000007
using namespace std;
typedef long long LL;
typedef pair<int,int> P;
char s[105];
bool cput(LL x) {
printf("? %lld\n",x);
fflush(stdout);
scanf("%s",s);
return s[0] == 'Y';
}
int main() {
int i,l = 0,r;
bool vis = 1;
for(i = 1000000000; i > 0; i ... | 0 | 95,494,299 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[3],ans;cin>>a[0]>>a[1]>>a[2];
sort(a,a+3);
ans=a[2]-a[0];
cout<<ans<<endl;
return 0;
} | # include <bits/stdc++.h>
# define ll int64_t
# define rep(i,n) for(ll i=0;i<n;i++)
# define rrep(i,n) for(ll i=1;i<=n;i++)
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((int)(x).size())
# define pb push_back
# define mod 1000000007
# define vec vector
#define dump(x) cerr<<#x<<"="<<x<<endl
using namespace std... | 0 | 27,480,523 |
#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)... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define rep(i,n) for(int i = 0;i < n;i++)
#define NIL = -1;
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const ll mod = 1e9 + 7;
int digit(ll x) {
if (x / 10 == 0) return 1;
return digit(x / 1... | 0 | 99,476,498 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define nl '\n'
#define vec vector<ll>
#define pr pair<ll,ll>
#define vecp vector< pr >
#define pq priority_queue<ll>
#define pqp priority_queue<pr>
#define ff first
#define ss second
#define f(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)
#d... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S> void cmin(T &a, const S &b) { if (... | 0 | 15,382,258 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
vector<int> v[66];
signed main(){
string str;
cin>>str;
for(int i=0;i<str.size();i++) v[str[i]-'a'].push_back(i);
for(int i=0;i<26;i++){
if(v[i].size()>1){
for(int j=1;j<v[i].size();j++){
if(v[i][j]-v[i][j-1]<=2){
cout<<v[i][j-1]+1<<" ... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#... | 0 | 2,531,259 |
#include <iostream>
#include <queue>
using namespace std;
int main(){
while(1){
int n,k,num,max,tmp;
queue<int> a;
cin >> n >> k;
if(!n&&!k) break;
max=tmp=0;
for(int i=0;i<k;i++){
cin >> num;
a.push(num);
max+=num;
}
n-=k;
tmp=max;
while(n--){
cin >> num;
a.push(num);
tmp+=a.back... | #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() {
ll n, l;
cin >> n >> l;
vector<ll> a(n);
rep(i, n) cin >> a[i];
rep(i, n - 1) {
if (a[i] + a[i + 1] >= l) {
puts("Possible");
for (int j =... | 0 | 28,263,294 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> buttons(N);
for (int n = 0; n < N; n++) cin >> buttons.at(n);
int answer = 0;
int pushedButton = 0;
for (int n = 0; n < N; n++) {
answer++;
if (buttons.at(pushedButton) == 2) {
cout << answer << endl;... | #include <iostream>
#include <iomanip>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <algorithm>
#include <cmath>
using namespace std;
int main(void)
{
int N;
cin >> N;
vector<long> P(N);
vector<int> idx(N + 1, -1);
long ans = 0;
for (int i = 0; i <... | 0 | 65,319,682 |
#include<bits/stdc++.h>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vl... | #include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <climits>
using namespace std;
const int mod = 1e9 + 7;
int main() {
int n, K;
cin >> n >> K;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<vector<int>> dp(n, vector<int>(K + 1, 0));
for (int j... | 0 | 40,061,101 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int R, G, B, N;
cin >> R >> G >> B >> N;
int ans = 0;
for (int r = 0; r * R <= N; ++r) {
for (int g = 0; g * G <= N; ++g) {
int re... | #include<iostream>
using namespace std;
int main()
{
while (1)
{
int n, s;
int ans = 0;
cin >> n >> s;
if (n == 0 && s == 0)break;
int comb = (1 << n) - 1;
while (comb < (1 << 10))
{
int sum = 0;
for (int i = 0; i < 10; i++)
{
if ((comb >> i) & 1)sum += i;
}
if (sum == s)ans++;
int... | 0 | 40,712,390 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(void) {
int N, A[101];
cin >> N;
for (int i = 0; i < N; i++) cin >> A[i];
int temp;
int cnt = 0;
for (int i = 0; i < N; i++) {
int idx = i;
for (int j = i; j < N; j++) {
if (A[idx] > A[j]) {
idx = j;
}
}
if (idx != i) {
te... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | 0 | 338,211 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
#define rep(i,n) for(int i=0; i<n; i++)
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define INF 2147483647
#define LLINF 9223372036854775807LL
ll MOD = 1000000007;
ll n;
ll Pow(ll m){
ll ret = 1;
rep(i... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a, b;
cin >> a >> b;
int p[n];
for(int i = 0; i < n; i++){
cin >> p[i];
}
int cou_1 = 0;
int cou_2 = 0;
int cou_3 = 0;
for(int i = 0; i < n; i++){
if(p[i] <= a){
cou_1++;... | 0 | 80,713,878 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.