code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 137 101M |
|---|---|---|---|
#include <algorithm>
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
typedef pair<int, int> P;
struct Graph
{
int n;
vector<vector<int>> g;
Graph(int n) : n(n){
g.resize(n);
}
void init(int n_){
n = n_;
g.resize(n_);
}
void add_edge(int fro... | #include<string.h>
#include<stdio.h>
#include<cmath>
#include<iostream>
#include<algorithm>
using namespace std;
int n,m,d;
int a[2111][2111];
int B=1010;
char ans[511][511];
int main()
{
int i,j,k;
cin>>n>>m>>d;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
int xx,yy;
... | 0 | 33,500,699 |
#include <bits/stdc++.h>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <functional>
using namespace std;
#de... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <cstring>
#include <cmath>
#include <cstdio>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define reps(i,s,n) for(int i=s; i<n; i++)
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef un... | 0 | 56,590,465 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int x,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 unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod=1000000007;
ll mod2=9982... | 0 | 42,269,750 |
#include "bits/stdc++.h"
using namespace std;
long long P[5010];
long long C[5010];
int main() {
long long N, K;
cin >> N >> K;
for (long long i = 1; i <= N; i++) {
cin >> P[i];
}
for (long long i = 1; i <= N; i++) {
cin >> C[i];
}
long long nmax = -1000000000;
long long ntemp = 0;
long long allmax = -1000... | #include <bits/stdc++.h>
using namespace std;
#define XDAY 196471
void solve(int y,int m,int d){
int today=1;
for(int i=1;i<y;i++){
if(i%3) today+=195;
else today+=200;
}
for(int i=1;i<m;i++){
if(i%2||!(y%3)) today+=20;
else today+=19;
}
today+=(d-1);
cout<<XD... | 0 | 18,999,503 |
#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() {
int n, m;
cin >> n... | #include<bits/stdc++.h>
using namespace std;
int cal(string str){
int sum=0;
stack<char> c;
c.push('e');
for(int i=0;i<str.size();i++){
c.push(str[i]);
}
while(c.size()!=1){
if(c.top()=='i' || c.top()=='x' || c.top()=='c' || c.top()=='m'){
char tmp=c.top();
... | 0 | 83,811,933 |
#include <bits/stdc++.h>
#define ROOP(i, N) for(int i=0; i++; i<N)
#define RVROOP(i, N) for(int i=N; i--; i>=0)
#define ALL(v) v.begin(), v.end()
const int INF = 1e9;
const int MAX = 510000;
const int MOD = 1000000007;
const double PI = acos(-1);
using namespace std;
typedef long long ll;
typedef unsigned long long ull... | #include <bits/stdc++.h>
#define boost_ ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define iter_(i,n) for (int i = 0; i < int(n); i++)
#define for_n(i, n) for (int i = 1; i <= int(n); i++)
#define ... | 0 | 78,828,040 |
#include <stdio.h>
#include <bitset>
using namespace std;
int dp[1010][1010];
bitset<1010> went[1010];
int min(int a,int b){
if(a>b)return b;
return a;
}
int dis(int n,int m,char l[],char r[]){
if(n<0&&m<0)return 0;
if(n<0)return m+1;
if(m<0)return n+1;
if(went[n][m])return dp[n][m];
went[n]... | #include<bits/stdc++.h>
using namespace std;
#define M 1000000007
#define ll long long
#define FIO ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ifor(st,lim) for(int i=st;i<lim;i++)
#define j... | 0 | 27,304,129 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <cmath>
#include <map>
using namespace std;
int H, W;
string s;
string mozi="snuke";
string alpha="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
i... | #include<bits/stdc++.h>
using namespace std;
int main(){
int k,n;
cin>>k>>n;
set<int> st;
int a[n],min=INT_MAX,res;
if(n==0){
cout<<k;
return 0;
}
for(int i=0;i<n;i++){
cin>>a[i];
st.insert(a[i]);
if(abs(a[i]-k)<min){
min = abs(a[i]-k);
res = a[i];
}
}
int i=res+1,j=r... | 0 | 47,958,655 |
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#d... | #include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif
#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#de... | 0 | 71,781,625 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5... | #include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <cmath>
#include <iomanip>
#define vec vector
using namespace std;
using ll = long long;
using vl = vector<long long>;
using vi = vector<int>;
using vvl = vector<vl>;
using vvi = vector<vi>;
using pii = pair<int, int>;... | 0 | 92,211,266 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int current_a;
int goal_b;
cin >> current_a >> goal_b;
cout << 2 * goal_b - current_a << endl;
} | #include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <list>
#include <iterator>
#include <assert.h>
#pragma warning(disable:4996)
typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b)... | 0 | 68,873,783 |
#include <iostream>
#include <list>
#include <numeric>
#include <algorithm>
int main()
{
int n;
std::cin >> n;
std::list<int> p(n), q(n);
for (auto &e : p) std::cin >> e;
for (auto &e : q) std::cin >> e;
if (p > q) std::swap(p, q);
int diff = 0;
int k = 1;
for (int i = 2; i < n; i++) k *= i;
std::list<int> ls... | #include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <utility>
#include <iostream>
#include <algorith... | 0 | 81,861,322 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int n, l, q, ai, bi;
int a[1000010];
int f[1000010][40];
void prepare() {
for(int i = 1; i <= n; i++){
int id = upper_bound(a + 1,a + 1 + n, a[i] + l) - a - 1;
if(a[i] + l > a[n]) f[i][0] = n;
else f[i][0] = id;
}
for(int i = 1; i <= 32; i++... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cmath>
#include<cstdio>
#include<tuple>
#include<bitset>
#include<map>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define ALL(x) x.begin(),x.end... | 0 | 38,341,847 |
#include <stdio.h>
int main(){
int hi[10];
int n,count=0;
while(scanf("%d",&n) != EOF){
if(n == 0){
printf("%d\n",hi[count-1]);
hi[count-1]=0;
count--;
}
else{
hi[count]=n;
count++;
}
}
return 0;
} | #include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#de... | 0 | 13,609,002 |
#include <iostream>
#include <string>
using ll=long long;
#define rep(i,a,b) for(ll i=a;i<ll(b);i++)
#define repr(i,a,b) for(ll i=a;i>=ll(b);i--)
#define endl "\n"
#define ALL(x) x.begin(),x.end()
using namespace std;
string s, t;
int ans;
int main() {
cin >> s >> t;
int lengh = s.length();
rep(i, 0, lengh) if(s[i] ... | #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);
... | 0 | 79,765,158 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int A, B, C;
cin >> A >> B >> C;
int max_num = max(max(A, B), C);
int remaining = (A + B + C) - max_num;
int diff_num = (max_num * 2) - remaining;
int ans = 0;
if (diff_num % 2 == 0) {
ans = diff_num / 2;
} else {
m... | #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>;
void solve() {
ll n, h;
cin >> n >> h;
vector<ll> a(n), b(n);
rep(i, n) cin >> a[i] >> b[i];
ll maxa = -1;
rep(i, n) maxa = max(maxa, a[i]);
sort(b.rbeg... | 0 | 61,351,197 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define FOR(i, a, b) for(int i = a; i < b; i++)
#define sizeOf(A) (sizeof(A))/(sizeof(A[0]))
#define odd(x) ((x) % (2))
#define fastio ios_base::sync_with_stdio(false), cin.tie(0);
int main() {
fastio;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5... | 0 | 33,907,564 |
#include <bits/stdc++.h>
using namespace std;
class UnionFind {
public:
vector<int> par;
UnionFind(int n) {
par.resize(n);
for(int i=0;i<n;i++) {
par[i] = i;
}
}
int root(int x) {
return par[x] == x ? x:par[x] = root(par[x]);
}
bool same(int x, int y) ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B... | 0 | 12,066,305 |
#include<iostream>
#include<cstdio>
using namespace std;
int main() {
int n, people[4][3][10] = {};
cin >> n;
for (int i = 0; i < n; i++) {
int b, f, r, v;
cin >> b >> f >> r >> v;
people[b-1][f-1][r-1] += v;
}
for (int b = 0; b < 4; b++) {
for (int f = 0; f < 3; f++)... | #include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
int main(){
long long n;
cin >> n;
long long a[n+1], b[n+1];
for(long long i = 0; i <= n; i++){
cin >> a[i];
}
if(n == 0){
if(a[0] == 1){
cout << 1 << endl;
return 0;
}
... | 0 | 78,979,531 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
string s;
cin >> s;
int w;
cin >> w;
int n=s.size();
for(int i=0;i<n;i=i+w){
cout << s[i];
}
cout << endl;
return 0;
} | #include <cstdio>
#include <cstdlib>
#include <string>
#include <vector>
#include <iostream>
#define NIL -1
struct Node{
int parent, leftChild, rightSibling;
};
void getDepth(int *arr, Node *nodes, int label, int depth);
std::string getProperty(Node node);
std::vector<int> getChildren(Node *nodes, int label);
int m... | 0 | 20,914,492 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
constexpr ll mod = 998244353;
ll mod_pow(ll a, ll n){
ll ret = 1;
while(n > 0){
if(n & 1) ret = (ret*(a % mod))%mod;
a = ((a%mod)*(a%mod)) % mod;
... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
#define repr(i, s, e) for(int i=s; i>=e; i--)
#define reps(i, s, e) for(int i=s; i<=e; i++)
#define inf 1e18
#define all(v) v.begin(),v.end()
#define vsort(v) sort(v.begin(), v.end())
#define vsortr(v) sort(v.begin(), v.end(), greater<ll>())
#define sz(x... | 0 | 13,201,655 |
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define DD long double
#define M 1000000007
#define INF 1e18
void setIO(string s = "") {
cin.sync_with_stdio(0); cin.tie(0);
if (s.size()) s += ".in", freopen(s.c_str(), "r", stdin);
}
int tt = 1;
void solve() {
int n;
cin >> n;
set<int> f;
... | #include<bits/stdc++.h>
using namespace std;
#define ft ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
ll a[105];
int main()
{
ft
ll t,i,j,n,m,l,r,s=0,x=0,y=0,z=0;
cin>>n;
for(l=2; l<=n; l++)
{
r=l;
for(i=2; i<=(r/i); i++)
{
while(r%... | 0 | 16,077,121 |
#include <bits/stdc++.h>
typedef uint64_t u64;
typedef int64_t i64;
typedef uint32_t u32;
typedef int32_t i32;
#define MAX_NUM (1000000007)
#define PI 3.14159265358979323846
using namespace std;
template <typename T>
static inline void ArrayInput(vector<T>& A) {
for (auto itr = A.begin(); itr < A.end(); ++itr) cin >>... | #include <iostream>
int mcxi2int(std::string s) {
int ret = 0;
int tmp = 1;
for (int i = 0; i < s.size(); i++) {
switch (s[i]) {
default: {
tmp = s[i] - '0';
break;
}
case 'm': { ret += tmp * 1000, tmp = 1; break; }
case 'c': { ret += tmp * 100, tmp = 1; break; }
case 'x': { ret += tmp * 10,... | 0 | 99,094,142 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
arr.push_back(a);
}
if (n == 1) {
cout << 0;
return 0;
}int i = 0;
int j = 1;
int ans = 0;
while (i < arr.size()) {
if (arr.at(i) != j) {
arr.... | #include <bits/stdc++.h>
#include <iostream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define fix(f,n) std::fixed<<std::setprecision(n)<<f
ll mod = 1e9 + 7;
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
t... | 0 | 55,888,387 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
int n;
cin>>n>>s;
for(int i=0;i<2;i++)
for(int j=0;j<2;j++)
{
string t;
t+=(i+'0');
t+=(j+'0');
for(int k=1;k<n-1;k++)
{
if(t[k]=='0')
{
if(s[k]=='o')
t+=t[k-1];
else
t+=(t[k-1]=='0'?'1':'0');
}
else
{
... | #include<iostream>
#include<algorithm>
#include<string>
#include<cstdio>
using namespace std;
int main(){
int n, m, l;
while (1) {
cin >> n >> m >> l;
if((n == -1) && (m == -1) && (l == -1)) {
break;
} else if ((n == -1) || (m == -1)) {
cout << 'F' << endl;
} else if (n + m >= 80) {
... | 0 | 40,064,134 |
#include <cstdio>
#include <iostream>
using namespace std;
int main()
{
string s;
cin >> s;
string t = "2019/04/30";
if(s>t)
{
cout << "TBD" << "\n";
}
else
{
cout << "Heisei" << "\n";
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
inline int read() {
int x = 0, fh = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
fh = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = (x << 1) + (x << 3) + c - '0';
... | 0 | 31,976,928 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int apple, fragment, pie;
cin >> apple >> fragment;
pie = (apple * 3 + fragment)/2;
cout << pie << endl;
} | #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=998244353;
const ll MAX=91... | 0 | 81,001,820 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
signed main(void)
{
set<char> st;
string s;
cin >> s;
st.insert(s[0]);
st.insert(s[1]);
st.insert(s[2]);
if (st.size() == 3)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using Graph=vector<vector<int>>;
typedef long long ll;
int rui(int N,int K){
int A=1;
if(K==0){
return 1;
}
else{
rep(i,K){
A=A*N;
}
return A;
}
}
template<class T> i... | 0 | 15,612,176 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define repe1(i, n) for (int i = 0; i <= (n); ++i)
#define all(x) (x).begin(),(x).end()
#define pb(x) push_back(x)
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T, class U> using Pa = pair<T, U>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
int main(){
int N;
cin >> N;
vec<int> cnt(26,100);
for(int i=0;i<N;i++){
string S;
... | 0 | 18,123,614 |
#include<iostream>
using namespace std;
int main(void) {
int A, B, C, D;
scanf("%d%d%d%d", &A, &B, &C, &D);
printf("%d\n", min(A, B) + min(C, D));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
int n, q;
long long x[100005], l, y[100005][20];
vector<int> vec;
signed main() {
cin.tie(0), ios::sync_with_stdio(0);
cin >> n;
for(int i = 1; i <= n; i++){
cin >> x[i];
vec.pb(x[i]);
}
vec.pb(-... | 0 | 29,254,747 |
#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
char s[303][303];
int ans = 0;
for(int i = 0; i < n; i++) for(int j = 0; j < n; j++) cin >> s[i][j];
for(int l = 0; l < n; l++){
bool yes = true;
for(int i = 0; i < n; i++) for(int j = 0; j < n; j++) if(s[(i +... | #include <bits/stdc++.h>
#include<math.h>
#include<algorithm>
#define rep(i,n) for (int i = 0; i < (n) ; ++i)
using namespace std;
using ll = long long ;
using P = pair<int, int> ;
#define PI 3.14159265358979323846264338327950
#define INF 1e18
#define mod 1000000007
int r, p, s;
int c (char x){
if(x == 'r') retur... | 0 | 31,147,815 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
string S;
ll K;
cin >> S >> K;
ll cnt=0;
char bf=S[0];
ll ac=0;
for(int i=0;i<S.size();i++){
if(i==S.size()-1){
... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(int i=k;i<n;i++)
#define endl "\n"
#define ff first
#define ss second
#define int l... | 0 | 4,712,399 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#de... | 0 | 23,229,773 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[3][3];
bool s[3][3];
int i, j;
for(i = 0; i < 3; i++) {
for(j = 0; j < 3; j++) {
cin >> a[i][j];
}
}
for(i = 0; i < 3; i++) {
for(j = 0; j < 3; j++) {
s[i][j] = false;
}
}... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int) (n); i++)
#define _GLIBCXX_DEBUG
template <typename T>
bool chmax(T &a, const T& b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typenam... | 0 | 52,369,267 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a,b,c;
string kekka;
cin >> a >> b >> c;
kekka = toupper(a.at(0));
kekka += toupper(b.at(0));
kekka += toupper(c.at(0));
cout << kekka;
} | #include <iostream>
using namespace std;
int main(int argc, const char * argv[]) {
int n,x;
while(cin >> n >>x,(n!=0)||(x!=0)){
int answer = 0;
for(int a = 1;a<=n;a++){
for(int b = a+1;b <=n;b++){
for(int c=b+1;c <=n;c++){
if(x == a+b+c){answer++;
... | 0 | 32,254,771 |
#include <iostream>
using namespace std;
int main (){
int a, b, c, x ;
cin >>a >>b >>c;
if(a > b ) {
x=a;
a=b;
b=x;
};
if(b > c ) {
x=c;
c=b;
b=x;
};
if(a > b) {
x=a;
a=b;
b=x;
};
cout <<a <<" " << b << " " << c <<"\n";
return 0 ;
} | #include <iostream>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int total = 0;
for (int n=1; n<=N; ++n) {
int r = n;
int sub = 0;
while (r != 0) {
sub += r % 10;
r /= 10;
}
if (((A <= sub) && (sub <= B))) {
... | 0 | 4,710,282 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
int x;
cin >> x;
if(x < 1200) cout << "ABC" << endl;
else cout << "ARC" << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=1e5+5;
const int inf=1e9;
const int mod=998244353;
int x,m;
ll n;
int pre[maxn];
ll sum1[maxn];
int main(){
scanf("%lld%d%d",&n,&x,&m);
pre[x]=1;sum1[1]=x;
int cnt=0,pos=inf;
ll sum=0;
for(int i=2;i<=n;i++){
x=... | 0 | 79,392,530 |
#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <ctime>
#include <algorithm>
#include <sstream>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <cstdlib>
#include <cstdio>... | #include<bits/stdc++.h>
using namespace std;
int main(){
cin.tie(NULL);
ios::sync_with_stdio(false);
string s;
int h,w;
char x='A';
cin>>h>>w;
for(int i=1;i<=h;i++){
for(int j=0;j<w;j++){
cin>>s;
if(s=="snuke"){
cout<<char(x+j)<<i<<'\n';
}
}
}
return 0... | 0 | 91,963,157 |
#include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define IO ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;
const int INF = 1e9 + 7;
const int N = 1e5+5;
int main() {
IO;
int n, x;
cin >> n >> x;
if (x%2 == 0 && x <= 4*n && x >= 2*n)
cout << "Yes";
... | #include <iostream>
#include <algorithm>
int main()
{
int w, h, n;
std::cin >> w >> h >> n;
int x_l = 0, x_u = w, y_l = 0, y_u = h;
for (int i = 0; i < n; ++i)
{
int x, y, a;
std::cin >> x >> y >> a;
switch (a)
{
case 1:
x_l = std::max(x, x_l);
... | 0 | 34,314,228 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
string s;
cin >> n >> s;
if(s.size() % 2 == 1) {
cout << "No" << endl;
return 0;
}
int x = s.size() / 2;
rep(i, x) {
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=105;
struct node{
int x,y;
bool operator<(const node&o)const{
return atan2(y,x)<atan2(o.y,o.x);
}
}a[N<<1];
int n;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d%d",&a[i].x,&a[i].y);
sort(... | 0 | 77,519,692 |
#include <bits/stdc++.h>
using namespace std;
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define endl '\n'
#define ft first
#define sd second
#define pb push_back
#define pob pop_back()
#define pf push_front
#define pof pop_front()
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<char,char> pcc;
ty... | #include <cstdio>
using namespace std;
int main(int argc, char** argv)
{
char a = getchar();
if('a' <= a && a <= 'z') putchar('a');
else putchar('A');
return 0;
} | 0 | 94,624,401 |
#include<bits/stdc++.h>
using namespace std;
#define fo(a,b) for(int a=0;a<b;a++)
#define Sort(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define fi first
#define se second
#define co(a) cout<<a<<endl
#define sz size()
#define bgn begin()
#define en end()
#define pb(a) push_back(a)
#define pop... | #include<bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define watch(x); cout << "\n" << #x << " is: " << x << "\n";
#define ll long long int
#define ff first
#define ss second
#define all(a) ... | 0 | 19,274,968 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main() {
int n;
cin >> n;
vector... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | 0 | 36,868,022 |
#include <bits/stdc++.h>
using namespace std;
signed main () {
string s, t;
cin >> s >> t;
int n = s.size();
map < char, char > assigned;
bool fucked = 0;
for (int i = 0; i < n; ++i) {
if (assigned.find(s[i]) == assigned.end())
assigned[s[i]] = t[i];
else if (assigned... | #include <iostream>
#include <string>
using namespace std;
string str;
void change(){
for(char i = 'a' ; i <= 'z' ; i++) str[i] = i;
for(char i = 'A' ; i <= 'Z' ; i++) str[i] = i;
for(char i = '0' ; i <= '9' ; i++) str[i] = i;
}
int main(){
int n;
while(cin >> n,n){
str = "";
change(... | 0 | 50,021,492 |
#include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
bool compPair(const pair<int, int>& arg1, const pair<int, int>& arg2) { return arg1.first > arg2.first; }
template<class T> void chmax(T& a, T b) { if (a < b) { a = b; } }
template<class T> void chmin(T& a, T b) { if (a > b) { a =... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
#define inputv(v, n) \
vl v; ... | 0 | 24,361,971 |
#include <iostream>
#include <algorithm>
#define INF 2147483647
#define MAX_N 100001
using namespace std;
int tree[(1<<18)];
int n,q;
void update(int i,int x) {
i+=(n-1);
tree[i] = x;
while(i!=0){
i=(i-1)/2;
tree[i] = min(tree[i*2+1],tree[i*2+2]);
}
}
int find(int a ,int b,int M,int L,int R){
if(R<=a... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x)... | 0 | 19,146,515 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int n, m, k; cin >> n >> m >> k;
for (int i = 0; i <= n; i++) for (int j = 0; j <= m; j++) {
if (i * m + j * n - 2 * i * j == k) {
cout << "Yes\n";
return 0;
}
}
cout << "No\n";
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main(){
int t;
cin >> t;
int p1=0,p2=0;
for (int i=0;i<t;i++){
string s1,s2;
cin >> s1 >> s2;
if (s1>s2)
p1+=3;
else if (s1<s2)
p2+=3;
else {
p1+=1;
p2+=... | 0 | 52,616,002 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a[100],b[100],ra[100];
int kt(int a[],int n){
int ret=0;
for(int i=1;i<=n;i++){
int cnt=0;
for(int j=i+1;j<=n;j++){
if(a[j]<a[i]) cnt++;
}
ret+=cnt*ra[n-i];
}
return ret;
}
void init(int n){
ra[0]=1;
for(int i=1;i<=n;i++) ra[i]=i*... | #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 | 77,746,101 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using V = vector<ll>;
#define _GLIBCXX_DEBUG
#define rep(i, a) for(int i = 0; i < a; i++)
#define ALL(v) v.begin(), v.end()
int main(){
int a,b,c; cin>>a>>b>>c;
if(a+b>=c) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
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 all(a) (a).begin(), (a).end()
#define all2(a, b) (a).begin(), (a).begin() + (b)
#define debug(vari) cerr << #vari << " = " << (vari) << endl;
... | 0 | 78,872,063 |
#include<iostream>
#include<string>
using namespace std;
int main(void){
int count = 0;
string s, keyence = "keyence";
cin >> s;
int len = s.size();
int i = 0;
while(s[i] == keyence[i++]){
count++;
if(count == 7){
cout << "YES" << endl;
return 0;
}... | #include<iostream>
#include<string>
using namespace std;
struct Node{
int key;
Node* prev;
Node* next;
};
class List{
Node* nil;
void delete_node(Node* n){
n->prev->next = n->next;
n->next->prev = n->prev;
delete n;
}
public:
List(){
nil = new Node;
... | 0 | 83,232,629 |
#include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i,n) for (int i = 0; i < n; i++)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define MOD (1000000007)
#define vi vector<int>
#define vl vector<ll>
#define vb vector<bool>
... | #include<iostream>
using namespace std;
int main(void){
while(1){
int a;
int n;
int c=0;
cin>>a;
if(a==0)break;
int count=0;
for(n=1000-a;n!=0;c++){
if(n>=500)n-=500;
else if(n>=100)n-=100;
else if(n>=50)n-=50;
else if(n>=10)n-=10;
else if(n>=5)n-=5;
else... | 0 | 66,415,109 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int INFint = 2e9+1;
const ll INFll = 2e18+1;
ll MOD=1e9+7;
int main(){
int N;
cin>>N;
vector<int> A(N+1);
for(int i(1);i<=N;i++){
cin>>A[i];
}
vector<bool> used(N+1,0);
int cnt(0);
for(int i(1);i<=N;i++){
if(used[i] == fal... | #include <bits/stdc++.h>
const std::int64_t INF = 1e18;
int main() {
std::int32_t N; std::cin >> N;
std::vector<std::int64_t> A(N + 1), B(N + 1);
for (std::int32_t i = 0; i <= N; ++i) {
std::cin >> A[i];
}
B[N] = A[N];
for (std::int32_t i = N - 1; i >= 0; --i) {
B[i] = B[i + 1] +... | 0 | 63,508,926 |
#include <bits/stdc++.h>
using namespace std;
const int INF=999999999;
int main() {
string S;
cin>>S;
bool ok =true;
if(S[0]!='A'){ok=false;}
int count1=0;
for(int i=2;i<S.size()-1;i++){
if(S[i]=='C'){count1++;}
}
if(count1!=1){ok=false;}
int count2=0;
for(int i=0;i<S.size();i++){
if(S[i]>='A'&&S[i]<='Z')... | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if(A==1 || B==1) {
if(A==1 && B!=1) {
cout << "Alice" << endl;
} else if(A!=1 && B==1) {
cout << "Bob" << endl;
} else {
cout << "Draw" << endl;
}
} else {
... | 0 | 80,253,155 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, M;
cin >> N;
map<string, int> m;
for (int i = 0; i < N; i++)
{
string s;
cin >> s;
m[s]++;
}
cin >> M;
for (int i = 0; i < M; i++)
{
string s;
cin >> s;
... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
#define setbits(x) __builtin_popcountll(x)
#define mod 1000000007
#define ps(x,y) fixed<<setprecision(y)<<x
#define w(x) int x; cin>>x; while(x-... | 0 | 83,108,054 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
int p = -1;
for (int i = 0; i < int(s.size()) - int(t.size()) + 1; ++i) {
int cnt = 0;
for (int j = 0; j < int(t.size()); ++j)
cnt += s[i+j] == '?' || s[i+j] == t[j];
if (cnt == int(t.size()))
... | #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()... | 0 | 90,911,713 |
#include"bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
using ll = long long;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vi = vector<int>;
using vii = vector<vi>;
using vl = v... | #include <bits/stdc++.h>
#define ll long long
#define pq priority_queue
using namespace std;
const ll INF=(ll)1e9;
const ll MOD=(ll)1e9+7;
const ll MAX=510000;
vector<int> dx={1,0,-1,0,1,-1,1,-1},dy={0,1,0,-1,1,-1,-1,1};
template<class T> inline bool chmax(T& a, T b) { if (a<b) { a=b; return 1; } return 0; }
template<c... | 0 | 24,100,833 |
#include<iostream>
#include<cstdio>
#include <stdio.h>
#include<algorithm>
#include<cstring>
#include <string>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<map>
#include<vector>
#include<bits/stdc++.h>
#include <set>
#define ll long long
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#defi... | #include<bits/stdc++.h>
using namespace std;
#define lint long long
#define P pair<int, int>
#define LLP pair<long long, long long>
#define REP(i, x, n) for(int i = (x), i##_len = (int)(n) ; i < i##_len ; ++i)
#define rep(i, n) for(int i = 0, i##_len = (int)(n) ; i < i##_len ; ++i)
#define repr(i, n) for(int i = (int)(... | 0 | 100,795,038 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
ll Mod = 1000000007;
int main() {
ll N,K;
cin >> N >> K;
ll A[N];
ll gcd = A[0];
ll m = -1;
for (int i = 0; i < N; i++) {
cin >> A[i];
m = max(A[i],m);
}
for (int i = 1; i < N; i++) {
gcd = __gcd(gc... | #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};
const int ... | 0 | 24,627,155 |
#include <bits/stdc++.h>
#define uint uint64_t
#define mx 100001
#define ll long long int
#define ull unsigned long long int
#define pii pair<int, int>
#define pll pair<long long int, long long int>
#define mp make_pair
#define pb push_back
#define inf INT_MAX
#define pi acos(-1)
#define eps 1e-8
#define gcd(a, b) __gc... | #include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define pii pair<ll, ll>
#define vi vector<ll>
#define vii vector<pii>
#define mi map<ll, ll>
#define mii map<pii, ll>
#define all(a) (a)... | 0 | 1,152,575 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define chmin(a,b) if((a)>(b)) (a)=(b);
#define chmax(a,b) if((a)<(b)) (a)=(b);
#define vi vector<int>
#define pii pair<int,int>
#define all(v) (v).begin(),(v)... | #include<bits/stdc++.h>
using namespace std;
#define fo(i,a,n) for(i=a;i<n;i++)
#define ll long long
#define deb(x) cout << #x << "=" << x << endl
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort... | 0 | 5,239,286 |
#include <iostream>
using namespace std;
int h, w, d;
char c[500][500], a[2][2]={{'R', 'Y'}, {'G', 'B'}};
void f(int y, int x, char z){
for(int i=0;i<d;i++){
int s=i;
if(i>=d/2)s=d-i-1;
for(int j=-s;j<=s;j++){
int ny=y+j, nx=x+i;
if(ny>=0&&ny<h&&nx>=0&&nx<w){
... | #include<iostream>
#include<stdio.h>
#include<stdlib.h>
struct Node
{
int value;
Node* prev,* next;
};
Node* head;
void Init()
{
head=(Node*)malloc(sizeof(Node));
head->next=head;
head->prev=head;
}
Node* FindNode(int x)
{
Node*temp=head->next;
while(temp!=head&&temp->value!=x)
temp=temp->next... | 0 | 69,376,704 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T, class U> using Pa = pair<T, U>;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
int main(){
int N;
cin >> N;
vec<int> T(N+2),V(N+2),S(N+3);
int tsum = 0;
for(int i=1;i<=N;... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <c... | 0 | 46,366,127 |
#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define pb push_back
int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};
#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 REP(i,n) for (int i=0;i<(n);i++)
#define RRE... | #include <stdio.h>
int main() {
char a[10];
scanf("%s", &a);
(a[2] == a[3] && a[4] == a[5]) ? puts("Yes") : puts("No");
return 0;
} | 0 | 63,257,514 |
#include <bits/stdc++.h>
#define slld(longvalue) scanf("%lld", &longvalue)
#define ll long long
#define ull unsigned long long
#define pll pair < long long, long long >
#define fastio ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define pb push_back
#define bug printf("BUG\n")
#define mxlld LLONG_MAX
#def... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define per(i,n) for(int i = n-1; i >= 0; i--)
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
const long long mod = 1000000007LL;
int main() ... | 0 | 41,575,059 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int total = 0;
for (int i = 0; i < N; i++) {
int r, l;
cin >> r >> l;
int part = l - r + 1;
total += part;
}
cout << total << endl;
} | #include<iostream>
int main(){
int a=0,i,b;
for(i=1;i<10;i++){
a=a+1;
for(b=1;b<10;b++){
std::cout<<a<<"x"<<b<<"=";
std::cout<<a*b<<std::endl;
}
}
return 0;
} | 0 | 84,454,622 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int64_t> data2(N);
vector<int64_t> data1(N);
for(int i=0; i<N; i++){
cin >> data2.at(i);
}
for(int i=0; i<N; i++){
cin >> data1.at(i);
}
int64_t sum2= 0;
int64_t sum1= 0;
int64_t cnt2= 0;
int64_t cnt1= 0;
... | #include<iostream>
#include<algorithm>
#include<vector>
#include<cstring>
using namespace std;
const int N_MAX = 200005;
int counter[N_MAX];
int plusc[N_MAX];
vector<int> root[N_MAX];
void dfs(int n, int p, int num){
int nownum = num + plusc[n];
counter[n] = nownum;
for(auto u: root[n]){
if (u == p)... | 0 | 53,968,018 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s.size() == 2) {
if (s.at(0) == s.at(1)) {
cout << 1 << " " << 2 << endl;
return 0;
}
else
{
cout << -1 << " " << -1 << endl;
return 0;
}... | #include <bits/stdc++.h>
#if DEBUG
template <typename T>
void debug(T value) {
std::cerr << value;
}
template <typename T, typename... Ts>
void debug(T value, Ts... args) {
std::cerr << value << ", ";
debug(args...);
}
#define DBG(...) \
do { \... | 0 | 38,568,940 |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = s; i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) cout << ( (n) ? "Yes":"No") << endl;
#define CFYN(... | #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <numeric>
#include <string>
#include <complex>
#include <algorithm>
#include <iostream>
#include <vector>
#include <bitset>
#include <deque>
#include <queue>
#include <map>
#include <utility>
#include <functional>
#include... | 0 | 19,322,877 |
#include <bits/stdc++.h>
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ii pair<int,int>
#define vi vector<int>
#define vll vector<ll>
#define vii vector<ii>
using namespace std;
ll dp[111][4][2];
string n;
int k;
ll solve(int i, int n0, bool l... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) =... | 0 | 74,203,293 |
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<map>
#include<iostream>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for... | #include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
vector<vector<long long> > G(200000);
vector<long long> counter(200000 ,0);
void dfs(long long i , long long p){
for(long long v = 0; v < G[i].size(); v++){
if(p == G[i][v]){
continue;
}
counter[G[i][v]]... | 0 | 49,047,428 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define endl '\n'
#define debug(x) cerr << #x << ": " << x << endl;
#define fast_io; ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const ll MAXN=1e... | #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 | 86,242,649 |
#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,m,ans=0;
cin >> n>>m;
vector<int> a(n);
vector<vector<int>> p(n,vector<int>(n,0));
rep(i,m){
int a,b;
cin>> a>>b;
a--;b--;
p[a][b]=p[b]... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,a,b,aa=0,bb=0,j=0,k=0,l=0,s,t,u,v;
cin>>n;
vector<int> A(100005,0),B(100005,0),AA(100005,-1),BB(100005,-1);
for(int i=0;i<n/2;i++){
cin>>a>>b;
A[a-1]++;
B[b-1]++;
aa=max(aa,A[a-1]);
bb=max(bb,B[b-1]);
... | 0 | 45,243,334 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <cmath>
double PI = acos(-1);
using namespace std;
class point{
public:
double x, y;
point(){ x = 0, y = 0; }
point(double a, double b){ x = a, y = b; }
friend point operator+(point a, point b){
... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define PB pop_back
#define nn "\n"
#define all(p) p.begin(),p.end()
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/gcd(a,b)
#define pi acos(-1.0)
typedef long long ... | 0 | 73,840,003 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
if(a==max(a,max(b,c)))cout << a*10+b+c << endl;
else if(b==max(a,max(b,c)))cout << b*10+a+c << endl;
else if(c==max(a,max(b,c)))cout << c*10+a+b << endl;
} | #include<iostream>
#include<bits/stdc++.h>
#define fl(k, n) for(int i = k; i < n; i++)
#define flr(k, n) for(int i = n - 1; i >= k; i--)
#define vi vector<int>
#define vp vector<pair<int, int>>
#define mp make_pair
#define ll long long
using namespace std;
int binary_search(vector<int> nums, int target_val){
int begi... | 0 | 78,428,730 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define ... | #include <bits/stdc++.h>
using namespace std;
#define MAX 2000001
#define VMAX 10000
int main(void)
{
int C[VMAX + 1];
int n;
cin >> n;
unsigned short A[n + 1], B[n + 1];
for (int i = 0; i <= VMAX; ++i) C[i] = 0;
for (int i = 0; i < n; ++i) {
cin >> A[i + 1];
C[A[i + 1]]++;
}... | 0 | 81,154,953 |
#include <bits/stdc++.h>
using namespace std;
int x,y;
int main() {
cin >> x >> y;
if (y>=x*2 && y<=x*4 && y%2==0) cout<<"Yes"; else cout<<"No";
} | #include <bits/stdc++.h>
#define int long long
#define fi first
#define se second
using namespace std;
const int maxN = 1e5 + 10;
const int inf = 3e18 + 10;
typedef pair<int, int> ii;
int k;
int dist[maxN];
vector<ii> adj[maxN];
void dijkstra(int src){
priority_queue<ii , vector<ii> , greater<ii> > pq ;
for(int... | 0 | 34,730,008 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll x;
cin >> x;
ll ta=x%100;
ll judge=0;
while(ta>=5){
ta-=5;
judge++;
}
if(ta>0) judge++;
if(100*judge>x){
cout << 0 << endl;
}
else {
cout << 1... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define ... | 0 | 61,387,085 |
#include <cstring>
#include <iostream>
using namespace std;
char s[200005];
long long t[35];
int main()
{
cin>>s;
long long n=strlen(s);
long long ans=1+n*(n-1)/2;
for(int i=0;i<n;i++)
t[s[i]-'a']++;
for(int i=0;i<26;i++)
ans-=t[i]*(t[i]-1)/2;
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | 0 | 10,301,258 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#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
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector... | #include "bits/stdc++.h"
using namespace std;
const int INF = numeric_limits<int>::max() / 2;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
while(cin>>n,n){
vector<int> a(n);
for(int i=0;i<n;i++) cin>>a[i];
sort(a.begin(),a.end());
int res=INF;
for(int i=... | 0 | 36,575,817 |
#include<algorithm>
#include<iostream>
#include<vector>
using namespace std;
typedef long long lint;
typedef vector<int>vi;
typedef pair<int,int>pii;
#define rep(i,n)for(int i=0;i<(int)(n);++i)
int main(){
int n;
lint k;
cin>>n>>k;
vector<lint>a(n),b(n);
rep(i,n){
cin>>a[i]>>b[i];
}
lint m=0;
while(... | #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 | 10,661,362 |
#include<iostream>
#include<string>
using namespace std;
int main()
{
string S;
cin >> S;
if(S == "SSS") cout << 0 << endl;
else if(S == "SSR") cout << 1 << endl;
else if(S == "SRS") cout << 1 << endl;
else if(S == "SRR") cout << 2 << endl;
else if(S == "RSS") cout << 1 << endl;
else if(S == "RSR") cout... | #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 | 45,537,490 |
#include <bits/stdc++.h>
using namespace std;
#define N 1010
int x[N],y[N],d[N];
bool flag[2];
int read(){
int x=0,f=1;
char ch=getchar();
while (ch<'0' || ch>'9'){
if (ch=='-') f=-1;
ch=getchar();
}
while (ch>='0' && ch<='9'){
x=x*10+ch-'0';ch=getchar();
}
return x*f;
}
signed main(){
int n=read(),m=0;
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define eps 1e-9
#define maxp 99940000
#define mod 1000000007
#define pi 3.141592653589793238
#define sin(s) scanf("%lld",&s);
#define sout(s) printf("%lld\n",s);
#define in(s) cin>>s
#define in2(a,b) cin>>a>>b
#define in3(a,b,c) c... | 0 | 43,524,115 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0);
int n;
cin >> n;
if(n < 1200)
cout << "ABC" << endl;
else
cout << "ARC" << endl;
return 0;
} | #include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <limits>
#include <queue>
#include <iomanip>
#include <set>
template<typename T> bool chmax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<typename T> bool chmin(T &a,T b){if(a>b){a=b;return true;}return ... | 0 | 13,012,713 |
#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)++)
#define frep(i,m,n) for(ll (i)=(m); (i)<=(ll)(n); (i)++)
#define rrep(i,n) for(ll (i)=(n)-1; (i)>-1; (i)--)
#define frrep(i,m,n) for(ll (i)=(n); (i)>(ll)(m); (i)--)
#define ALL(... | #include <bits/stdc++.h>
using namespace std;
#define int long long
struct edge {
int to, cost;
};
signed main() {
int K;
cin >> K;
vector<bool> vis(K, false);
deque<pair<int, int>> dq;
dq.push_back({1, 1});
while (!dq.empty()) {
pair<int, int> p = dq.front();
dq.pop_front();
int x = p.first, ... | 0 | 32,786,889 |
#include <bits/stdc++.h>
#define rep(i, s, n) for(int i = (s); i < (int)(n); i++)
#define INF INT_MAX/2
using namespace std;
int N, K;
int main() {
cin >> N >> K;
queue<int> que1;
que1.push(1);
rep(i, 0, N) {
queue<int> que0;
while (!que1.empty()) {
int x = que1.front(); que1... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define F(i,s,e) for(ll i=s;i<e;++i)
int main()
{
ll N,M;
cin >> N >> M;
ll A[M],B[M];
F(i,0,M) cin >> A[i] >> B[i];
vector<ll> G[N];
F(i,0,M){
G[A[i]-1].push_back(B[i]-1);
G[B[i]-1].push_back(A[i]-1);
}
ll... | 0 | 62,481,354 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
int h,w;
cin>>h>>w;
char fi[h][w];
rep(i,h) rep(j,w) cin>>fi[i][j];
int cw[h][w];
rep(i... | #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<long long, null_type, less<long long>, rb_tree_tag, tree_order_statistics_node_update> ind... | 0 | 98,250,801 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
int main() {
int n;
string s, t;
cin >> n >> s >> t;
for (int i = 0; i <= n; i++) {
string u = s + t.substr(n-i, i);
... | #include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <list>
using namespace std;
typedef long long ll;
vector<ll> v;
int main() {
int n;
cin >> n;
ll a[n],sum=0;
for(int i=0;i<n;i++){
cin >> a[i];
sum += a[i];
}
for(int i=0;i<n-1;... | 0 | 87,783,045 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
constexpr ll Mod = 998244353;
constexpr ll mod = 1e9 + 7;
constexpr ll inf = 1LL << 60;
template <typename T> constexpr bool chm... | 0 | 12,921,854 |
#include <bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
using namespace std;
int dp[111][111],n,L[111],R[111];
int dfs(int l,int r){
if(dp[l][r]!=-1)return dp[l][r];
int res=1e9;
for(int i=l;i<r;i++){
res=min(res,dfs(l,i)+dfs(i+1,r)+L[l]*R[i]*R[r]);
}
return dp[l][r]=res;
}
signed main(){
memset(dp,-1,size... | #include <bits/stdc++.h>
using namespace std;
#define BIG 100000000000
int main(void){
int N, K;
vector<int64_t> h;
vector<int64_t> cost(100001);
cin >>N >>K;
for(int i=0;i<N;i++){
int tmp;
cin >>tmp;
h.push_back(tmp);
}
cost[0]=0;
for(int i=1;i<K;i++){
cost[i]=BIG;
for(int j=0;j<i;j... | 0 | 8,316,783 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C,D;
1 <= A,B,C,D <= 10;
cin >> A >> B >> C >> D;
if (A+B > C+D) {
cout << "Left" << endl;
} else if (A+B == C+D) {
cout << "Balanced" << endl;
} else {
cout << "Right" << endl;
}
} | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
short dp[1010][1010];
int main(void)
{
int q;
cin >> q;
while (q)
{
string X, Y;
cin >> X >> Y;
int Xs = X.size(), Ys = Y.size();
for (int i = 0; i < Xs; i++) dp[i][0] = 0;
for (int j ... | 0 | 19,543,030 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll,ll>
vector<ll> S(10000006, 0);
vector<ll> A(10000006, 0);
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n;
cin>>n;
const ll N=n+1;
A[0]=A[1]=0;
for(ll i=2;i<N;i++){
if(A[i]==0){
for(ll j=2*i;j<N;j... | #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 | 14,091,415 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin>>S;
int X=S.size();
vector<char>A((X-1)/2);
vector<char>B((X-1)/2);
for(int i=0; i<(X-1)/2; i++){
A.at(i)=S.at(i);
}
for(int i=0; i<(X-1)/2; i++){
B.at(i)=S.at(i+(X+1)/2);
}
bool a=true;
for(int i=0; i<(X-1)/2; i++){
if(A.at(i)!=B.at(i)... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < (int)(b); i++)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using ll = long long;
int pow(int a, int... | 0 | 48,030,666 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,t,i;
cin >> n >> t;
vector<long long> ti(n);
for(i=0;i<n;++i){
cin >> ti[i];
}
long long ans=0;
bool bet=false;
for(i=0;i<n-1;++i){
ans+=min(t,ti[i+1]-ti[i]);
}
ans+=t;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long int
#define mod 1000000007
bool isPrime[1000001];
ll power(ll a,ll b)
{
ll result = 1;
while(b>0)
{
if(b%2)
{
result = (a*result)%mod;
}
a = (a*a)%mod;
b = b/2;
}
return re... | 0 | 68,987,466 |
#include <iostream>
#include <map>
using namespace std;
int main(int argc, char const* argv[])
{
int table_size;
while(cin >> table_size) {
if (table_size == 0) break;
map<char, char> table;
char key, val;
for (int i = 0; i < table_size; i++) {
cin >> key >> val;
table.insert( map<char,... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
ll N,K;
cin >> N >> K;
vector<ll> x(N);
vector<ll> y(N);
rep(i,N) cin >> x[i] >> y[... | 0 | 66,862,623 |
#include<bits/stdc++.h>
#define lld long long int
#define llf long double
#define pb push_back
#define mp make_pair
#define IN insert
#define loopN(n) for(lld i=0;i<n;i++)
#define loop(p,n) for(lld i=p;i<=n;i++)
#define rloop(p,n) for(lld i=n;i>=p;i--)
#define loop2(p,n)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define INF (1LL<<50)
#define MOD 1000000007
int main(){
string S;
cin >> S;
if(S=="zyxwvutsrqponmlkjihgfedcba"){
cout << -1 << endl;
return 0;
}
map<char,int> m,m2;
... | 0 | 10,481,478 |
#include <bits/stdc++.h>
using namespace std;
#define sws ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define INFINITO 1000000000
#define ll long long
#define vi vector<int>
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define ff first
#define ss second
#define vvi vector<vi>
#define a... | #include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
using ll = long long;
#define chmin(i, j) i = min(i, j);
#define chmax(i, j) i = max(i, j);
#define rep(i, n) for(int i=0;i<n;i++)
ll X, Y, Z, K;
vector<ll> a, b, c;
vector<ll> ans;
bool solve(ll T, bool sp) {
int cnt = 0;
rep(i, X) {
rep(j... | 0 | 43,993,746 |
#include<iostream>
#include<algorithm>
using namespace std;
int main() {
int A, B, C;
cin >> A >> B >> C;
int ans = A + B + C;
cout << ans - max(A, max(B, C)) << endl;
return 0;
} | #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 | 64,706,716 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fi first
#define se second
#define pb push_back
#define soo(v) sort(v.rbegin(),v.rend())
#define so(v) sort(v.begin(),v.end())
#define lb(v,x) lower_bound(v.begin(),v.end(),x)
#define ub(v,x) upper_bound(v.begin(),v.end(),x)
#define endl '\... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1000000007;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define ALL(a) (a).begin(),(a).end()
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll Len(ll n) {
ll s=0;
while(n!=0) s++, n/=10;
return s;
}
ll Sint(ll... | 0 | 32,855,224 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define vt vector
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
#define die return c... | #include<iostream>
#include<algorithm>
#include<vector>
using ll = long long;
using namespace std;
constexpr ll INFI = 1e18;
ll calc(int n, int k, vector<int> v, int* a);
int main() {
int n, k;
ll lcost;
ll cost;
cin >> n >> k;
int* a = new int[n];
for (int i = 0;i < n;i++) {
cin >> a[i];
}
vector<int> v;
v.... | 0 | 31,935,348 |
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#i... | #include<iostream>
#include<string>
#include<vector>
#include <algorithm>
using namespace std;
int main() {
string S;
cin >> S;
int size = S.size() ;
vector<int> alphabet(26);
for(int i=0;i<size;i++){
int num = S[i] -'a' ;
alphabet.at(num) = 1;
}
char min_char;
bool judge = f... | 0 | 18,657,857 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.