code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include<bits/stdc++.h>
#define int long long
#define all(a) a.begin(),a.end()
#define sz(a) a.size()
#define re return
#define MP make_pair
#define pb push_back
#define pii pair<int,int>
#define se second
#define fi first
using namespace std;
signed main(){
ios_base::sync_with_stdio(0);
int a,b,c,d;
cin>>a>>b>>c>>... | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a... | 0 | 2,241,011 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll w, h;
cin >> w >> h;
vector<ll> lp(w), lq(h);
for (ll &p: lp) cin >> p;
for (ll &q: lq) cin >> q;
sort(lp.begin(), lp.end());
sort(lq.begin(), lq.end());
lp.push_back(1e10);
lq.push_ba... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int set=0;
int max=10;
vector<int> a(5);
for(int i=0;i<5;i++){
cin >> a[i];
if(max>a[i]%10 && a[i]%10!=0){
max=a[i]%10;
set=i;
}
}
int ans=0;
for(int i=0;i<5;i++){
if(i!=set && ... | 0 | 100,127,014 |
#include <iostream>
#include <vector>
using namespace std;
int main(void){
int n, m, p, total, ans;
while(true){
cin >> n >> m >> p;
if(n == 0 && m == 0 && p == 0){
break;
}
vector<int> x(n, 0);
for(int i = 0; i < n; i++){
cin >> x[i];
}
total = 0;
for(int i = 0; i < n; ... | #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 ... | 0 | 30,084,591 |
#include<iostream>
#include<cstdio>
using namespace std;
int main () {
int N;
int A[100];
double ans=0;
cin >> N;
for (int i=0; i<N; i++) {
cin >> A[i];
ans+=(double)1.0/A[i];
}
printf("%.10lf\n", 1.0/ans);
} | #include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep(i, n) repd(i, 0, n)
using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
ll mod = 1000000007;
int main() {
ll n;
cin >> n;
... | 0 | 40,185,420 |
#include <bits/stdc++.h>
#include <functional>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string s, t;
std::cin >> s >> t;
sort(s.begin(), s.end());
sort(t.rbegin(), t.rend());
if (s < t) {
std::cout << "Yes" << std::endl;
} else {
std::cout << "No" << std... | #include "bits/stdc++.h"
using namespace std;
int main() {
int n;
while (cin >> n,n) {
int Sum = 0;
int Max = -1;
int Min = 1001;
for (int i = 0; i < n; i++) {
int a; cin >> a;
Sum += a; Max = max(Max, a); Min = min(Min, a);
}
Sum -= Max + Min;
cout << Sum / (n - 2) << endl;
}
} | 0 | 81,427,682 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
int MAX=0, pre_MAX=0;
int max_ids=0, pre_ids=0;
for(int i=0;i<n;i++){
cin >> a[i];
if(a[i]>MAX){
pre_MAX = MAX; pre_ids = max_ids;
MAX = a[i]; max_ids = i;
... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
#define mod 1000000007
#define IINF INT_MAX
#define INF 1LL << 30
int main() {
int n, k; cin >> n >> k;
int r, s, p; cin >> r >> s >> p;
string t; cin >... | 0 | 40,892,925 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,s,n) for(int i = s;i < (int)(n);i++)
typedef long long ll;
#define MODSIZE 1000000007
ll reppow(ll x,ll n){
ll rep = 1;
while(n > 0){
if(n & 1) rep = (rep*x) % MODSIZE;
x = x*x % MODSIZE;
n >>= 1;
}
return rep;
}
int main(){
int x;
int ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <functional>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
void Main();
signed main() {
ios::sync_with_stdio(false)... | 0 | 10,154,788 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define all(v) begin(v),end(v)
using ll = long long;
int main() {
string s;cin>>s;
int ans=s.size(),n=s.size();
rep(i,2){
int cnt=0;
rep(j,n){
if(j%2==0&&s[j]!=(char)(i+'0'))cnt++;
if(j%2==1&&s[j]==(c... | #pragma GCC optimize("O3", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
using pii = pair<int, int>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using Prior = priority_queue<T>;
#define X first
#define... | 0 | 65,270,972 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <cmath>
#include <stack>
#include <map>
#include <iomanip>
using namespace std;
int64_t min(int64_t a,int64_t b) {
if (a > b)
{
return b ;
}else
{
return a ;
}
}
int main(){
v... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long lon... | 0 | 50,192,161 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll S;
cin >> S;
ll x1 = 0, y1 = 0;
ll x2 = 1e9, y2 = 1;
ll x3, y3;
if (S==1e18) x3 = 0, y3 = 1e9;
else {
y3 = S / (int)1e9 + 1;
x3 = 1e9 - S % ... | #include <iostream>
using namespace std;
int main(){
int g[1001][1001]={{0}};
int n,a,b,c;
cin >> n;
for (int i = 0; i < n; ++i)
{
cin >> a >> b ;
for (int i = 0; i < b; ++i)
{
cin >> c;
g[a-1][c-1]=1;
}
}
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
{
... | 0 | 99,217,394 |
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cctype>
#include<list>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>
using namespace std;
#define MAX_N 1000005
const int INF = 0x3f3f3f3f;
int prime[1000000];
int c[MAX_N]... | #include<bits/stdc++.h>
using namespace std;
bool search();
int ans[100009];
int n;
string s;
int main(){
cin>>n>>s;
for(int i=0;i<2;i++){
for(int j=0;j<2;j++){
memset(ans,0,sizeof(ans));
ans[0]=i;
ans[1]=j;
if(search()){
for(int k=0;k<n;k++){
if(ans[k]==0){
cout<<'S';
}
e... | 0 | 37,957,974 |
#include<bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
long long N;
vector<long long> P;
vector<long long> Q;
int main(){
cin >> N;
rep(i, N) {
long long tmp;
cin >> tmp;
P.push_back(tmp);
}
rep(i, N) {
long long tmp;
cin >> tmp;
Q.push_back(tmp);
}
vector<lo... | #include <iostream>
#include <algorithm>
using namespace std;
double check(double x1, double y1, double x2, double y2, double x3, double y3){
double ab = sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
double bc = sqrt((x2 - x3) * (x2 - x3) + (y2 - y3) * (y2 - y3));
double ca = sqrt((x3 - x1) * (x3 - x1) + (y3 ... | 0 | 7,628,965 |
#include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <deque>
#include <set>
#include <stdlib.h> ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (n); i++)
#define irep(i, n) for (int64_t i = 0; i <= (n); i++)
#define rrep(i, ... | 0 | 77,568,234 |
#include<iostream>
#include<algorithm>
#define ll long long int
using namespace std;
const int maxn=300005;
int N,A,B;
int res[maxn];
int main()
{
int con;
bool flag=true,change=false;
cin>>N>>A>>B;
if (B>N-A+1||(ll)A*(ll)B<(ll)N)cout<<-1<<endl;
else
{
for (int i=N-A+1;i<=N;i++)cout<<i<<" ";
while (1)
{
... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
long long int n;
cin>>n;
vector<long long int >v(n);
for(long long int i=0;i<n;i++){
cin>>v[i];
}
long long int result=0;
for(long long int i=0;i<n;i++)
{
v[i]=v[i]-i-1;
}
... | 0 | 42,200,537 |
#include <bits/stdc++.h>
using namespace std;
#define loop(i, n) for(int i = 0;i < int(n);i++)
#define rloop(i, n) for(int i = int(n);i >= 0;i--)
#define range(i, a, b) for(int i = int(a);i <= int(b);i++)
#define SZ(c) int(c.size())
#define ALL(c) c.begin(), c.end()
#define RALL(c) c.rbegin(), c.rend()
#define PI acos(... | #include <iostream>
#include <vector>
#include <utility>
#include <string>
using namespace std;
int main() {
int n, k; cin >> n >> k;
string s;
cin >> s;
int i = 0, c0 = 0;
vector<pair<int, int> > v;
if (s[0] == '0')
v.push_back(pair<int,int>(1, 0));
while (i < n) {
int sta... | 0 | 49,626,228 |
#include <iostream>
#include <stdio.h>
using namespace std;
int main(){
char c[1200];
fgets(c,1200,stdin);
for (int i = 0;i<1200;i++){
if (c[i] == '\n') break;
if (islower(c[i])) c[i] = toupper(c[i]);
else if (isupper(c[i])) c[i] = tolower(c[i]);
printf("%c",c[i]);
}
printf("\n");
return 0;
} | #include <map>
#include <set>
#include <ctime>
#include <queue>
#include <stack>
#include <cmath>
#include <vector>
#include <bitset>
#include <cstdio>
#include <cctype>
#include <string>
#include <numeric>
#include <cstring>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <algorit... | 0 | 52,124,625 |
#include<iostream>
using namespace std;
int main(){
int A[3][3],N,bingo[3][3];
for (int i = 0; i < 3; i++){
for (int j = 0; j < 3; j++){
cin >> A[i][j];
bingo[i][j]=0;
}
}
cin >> N;
for (int k = 0; k < N; k++){
int b;
cin >> b;
for (int i = 0; i < 3; i++){
for (int j ... | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#in... | 0 | 83,007,763 |
#include<stdio.h>
long long int abs_1(long long int i){
if(i<0) return -i;
else return i;
}
int main()
{
int N,i,j;
long long int sum1=0,sum=0;
scanf("%d",&N);
long long int a[200000]={0},x,min=2e+9;
for(i=0;i<N;i++)
{
scanf("%lld",&a[i]);
sum+=a[i];
}
for(i=0;i<N-1;i++)
{
sum1+=a[i];
x=abs_1(2*sum... | #include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
#include <stack>
#include <set>
using namespace std;
#define fast_io ios_base::sync_with_stdio (false) ;... | 0 | 78,768,356 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 100005;
int n, m, v, p, a[maxn];
ll sum[maxn];
int check(int x)
{
if (a[x] + m < a[p]) return 0;
return (ll)(a[x] + m) * (x - p) - (sum[x - 1] - sum[p - 1]) >= (ll)m * (v - (p - 1) - (n - x + 1));
}
int main()
{
scanf("%d%d%d%d", &n... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
#define rep(i,n) for(ll i=0; i<(ll)(n); i++)
ll l=1000000007;
string alphabet="abcdefghijklmnopqrstuvwxyz";
int main() {
string s; cin>>s;
if(s.size()!=26){
cout<<s;
rep(i,26){
if(count(s.begin(),s.en... | 0 | 22,557,226 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin >> n >> m;
vector<string> a(n);
vector<string> b(m);
for(int i=0;i<n;i++) cin >> a.at(i);
for(int i=0;i<m;i++) cin >> b.at(i);
int ans=0;
for(int i=0;i<=n-m;i++){
for(int j=0;j<=n-m;j++){
int k=1;
for(int y=0;y<m;y++)... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
vector<ll> a, p;
ll dfs(ll n, ll x) {
if (n == 0)
return x <= 0 ? 0 : 1;
else if (x <= a[n - 1] + 1)
return dfs(n - 1, x - 1);
else
return p[n - 1] + 1 + dfs(n - 1, x - 2... | 0 | 21,247,973 |
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <vector>
#include <cstdlib>
#include <list>
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
int main() {
int n,len;
char c[100000];
char ans[1000... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr ll INF = 1e16;
constexpr ll MOD = 1000000007;
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i <... | 0 | 32,405,140 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
ll k,a,b;
cin >> k >> a >> b;
if(k <= a || a >= b - 1)cout << k + 1<< endl;
el... | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define mx 1003
char S[mx],T[mx];
int main(){
scanf("%s",S);
scanf("%s",T);
int ns=strlen(S);
int nt=strlen(T);
int ans=1e9;
for(int i=0;i<=ns-nt;i++){
int del=0;
for(int j=0;j<nt;j++){
if(... | 0 | 82,134,723 |
#include <iostream>
#include <string>
using namespace std;
int main(void){
int n, taro = 0, hanako = 0;
cin >> n;
for(int i = 0; i < n; i++){
string t, h;
cin >> t >> h;
if(t > h) taro += 3;
else if(t < h) hanako += 3;
else {taro += 1; hanako += 1;}
}
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int H,N,A;
cin >> H >> N;
for(int i=0;i<N;i++){
cin >> A;
H -= A;
if(H <= 0){
cout << "Yes" <<endl;
return 0;
}
}
cout << "No" <<endl;
} | 0 | 9,240,628 |
#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 <bits/stdc++.h>
using namespace std;
int main()
{
int N,M;
cin >> N >> M;
vector<vector<int>> G(N);
for (int i=0; i<M; ++i)
{
int a, b;
cin >> a >> b;
G[a-1].push_back(b-1);
G[b-1].push_back(a-1);
}
vector<int> dist(N, -1);
queue<int> que;
dis... | 0 | 28,026,239 |
#include <bits/stdc++.h>
using namespace std;
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitset>
#include <cassert>
#include<algorithm>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, ... | #include <bits/stdc++.h>
using namespace std;
const int NMAX = 1e5 + 5;
long long a[NMAX], sol, b[NMAX];
int n;
int main()
{
cin >> n;
for(int i = 1; i <= n + 1; i++) {
cin >> b[i];
}
for(int i = 1; i <= n; i++) {
cin >> a[i];
}
for(int i = 1; i <= n; i++) {
long long min... | 0 | 85,449,398 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n, h[100100], cost[100200]={0}, k, i;
cin >> n >> k;
for(i=0;i<n;i++){
cin >> h[i];
}
for(i=1;i<n;i++){
cost[i]=cost[i-1]+abs(h[i-1]-h[i]);
for(int j=2;j<=k;j++){
if(i-j<0) break;
cost... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
string s;
cin>>s;
for (int i=0; i<8; i++) {
bool i0 = (i >> 2) & 1;
bool i1 = (i >> 1) & 1;
bool i2 = i & 1;
if (i1) {
if (s[1] == 'o') {
if (i0 != i2) {
continue;
}
} else {
... | 0 | 95,493,816 |
#include <bits/stdc++.h>
#define load ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
using namespace std;
#define ll long long
#define ull unsigned long long
#define fori(i,n) for (int i=0; i<int(n);i++)
#define srt(v) sort(v.begin(), v.end())
#define MOD 1000000007
const int INF = 1e9;
const double PI... | #include <iostream>
using namespace std;
int main() {
int v[4] = {0,0,0,0};
for(int i=0;i<3;++i){
int a,b;cin>>a>>b;
++v[a-1];
++v[b-1];
}
int cnt1 = 2;
int cnt2 = 2;
for(int i=0;i<4;++i){
if(v[i]==1) --cnt1;
if(v[i]==2) --cnt2;
}
if(cnt1==0&&cnt2==0){
cout << "YES" << endl;
} else {
cout << "NO"... | 0 | 60,737,731 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define pp pair<int,int>
#define ll long long
#define ld long double
int inf=100000000;
ll INF=4000000000000000000;
ll MOD=1000000007;
int main() {
int n,m;
cin >> n >> m;
vector<ll> x(n),y(m);
rep(i,n) cin >> x.at(i);
... | #include <bits/stdc++.h>
#define mp make_pair
using namespace std;
typedef int32_t i32;
typedef uint32_t u32;
typedef int64_t i64;
typedef uint64_t u64;
typedef pair<int,int> pii;
typedef pair<i64,int> pli;
typedef pair<int,i64> pil;
typedef pair<i64,i64> pll;
typedef vector<int> vi;
typedef vector<i64> vl;
template <t... | 0 | 19,116,055 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,a[105],cost=4000005;
scanf("%d",&n);
for(int i=0; i<n; i++)
scanf("%d",&a[i]);
for(int i=-100; i<=100; i++)
{
int sum=0;
for(int j=0; j<n; j++)
{
int t = (i-a[j])*(i-a[j]);
sum+=t;... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a ... | 0 | 32,565,350 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll a, ll b)
{
if(a % b == 0)
return b;
return gcd(b, a % b);
}
int main()
{
ll a, b;
cin >> a >> b;
ll res = (a * b) / gcd(a, b);
cout << res << "\n";
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1;} return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1;} return 0;}
int const INF = 1e9;
int const MAX_N = 105;
u... | 0 | 10,905,792 |
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<double, double> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() ret... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin>>n;
if(n==0){
cout <<0 << endl;
return 0;
}
long long int count=0;
if(n%2==1){
cout <<0 << endl;
return 0;
}
else{
n/=10;
count+=n;
while(n>0){
... | 0 | 95,514,144 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D, L, R;
cin >> A >> B >> C >> D;
if(!((L=A+B)-(R=C+D)))
cout << "Balanced" << endl;
else if(L>R)
cout << "Left" << endl;
else
cout << "Right" << endl;
} | #include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
using namespace std;
using ll=long long;
int main() {
int N,M,X; cin >>N >>M >>X;
vector<int> C(N);
vector<vector<int>> A(N,vector<int>(M));
rep(i,0,N) {
cin >>C[i];
rep(j,0,M) ... | 0 | 81,213,032 |
#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int sum = 0;
for (int i = 1; i <= n; i++) {
if (i % 2 == 0)continue;
int kosuu = 0;
for (int j = 1; j <= i; j++) {
if (i % j == 0)kosuu++;
}
if (kosuu == 8)sum++;
}
cout << ... | #include <stdio.h>
int main(){
int n,a[5000],top;
while(1){
scanf("%d",&n);
if(n==0)return 0;
scanf("%d",&a[0]);
top=a[0];
for(int i=1;i<n;i++){
scanf("%d",&a[i]);
if(a[i-1]>0)a[i]+=a[i-1];
if(a[i]>top)top=a[i];
}
printf("%d\n",top);
}
... | 0 | 61,847,166 |
#include<cstdio>
#include<iostream>
using namespace std;
const int N = 99999;
int n, m, d, q;
int X[N], Y[N], f[N];
int Mabs(int x)
{
return x<0?-x:x;
}
int main()
{
scanf("%d%d%d", &n, &m, &d);
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)
{
int x;
scanf("%d", &x);
X[x] = i;
Y[x] = j;
}
... | #include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define ii pair<int,int>
#define F first
#define S second
#define pb push_back
#define pf push_front
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define fore(i,a,b) for(int i = a;i < b; i... | 0 | 41,752,077 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<60) - 1;
int d[100010];
int par[100010];
int main(){
int n, m;
cin >> n >> m;
vector<vector<int>> G(n);
int a, b;
for (int i = ... | #include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& operator<<(ostream &O, const vector... | 0 | 32,186,027 |
#include <iostream>
#define int long long
using namespace std;
int powmod(int a, int n, int mod) {
if (n == 0) return 1;
if (n % 2 == 0) return powmod((a * a) % mod, n / 2, mod);
return (a * powmod(a, n - 1, mod)) % mod;
}
int mod = 1000000007;
int x, y;
int fact[2000001];
int finv[2000001];
int comb(int n, int k) {... | #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>;
vector<string> split(const string &s, char delim) {
vector<string> elems;
stringstream ss(s);
string item;
while (getline(ss, item, delim)) {
if (!item.empty()) {
... | 0 | 51,242,967 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#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 ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int ... | 0 | 3,099,051 |
#include<iostream>
#include<vector>
#include<string>
using namespace std;
struct tree {
vector<int> children;
int depth;
int parent;
string type;
};
tree trees[100000];
int calc_depth(int n) {
for (vector<int>::iterator i = trees[n].children.begin(); i < trees[n].children.end(); i++) {
trees[*i].depth = trees[n... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<ll> A(N);
... | 0 | 12,660,035 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
string N;
cin >> N;
if(N[0] == '7' || N[1] == '7' || N[2] == '7')
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
} | #include <iostream>
using namespace std;
void print_number(int a[], int N){
if(N==1){
cout << a[0] <<endl;
return;
}
for(int i=0; i<N-1; i++){
cout << a[i] << " ";
}
cout << a[N-1] << endl;
}
int main() {
int N, count=0;
const int MAX_N = 100;
int a[MAX_N];
cin >> N;
for(int i=0; i<N; i++){
cin >> a[i... | 0 | 98,315,823 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 0x3f3f3f3f;
ll H, W;
void solve()
{
if(H%3==0 || W%3==0) cout << 0 << '\n';
else{
ll ans = 1e18;
for(int w=1;w<W;++w){
ll a1 = w*H, a2 = (W-w)*(H/2), a3 = H*W-a1-a2;
ll mx = max(a1,max(a2,a3));
ll mi = min(a1,min(a2,a3));... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int h, n;
cin >> h >> n;
vector<int> a(n), b(n);
for(int i=0; i<n; i++){
cin >> a[i] >> b[i];
}
vector<int> dp(h+1, numeric_limits<int>::max());
dp[0] = 0;
for(int ... | 0 | 22,643,138 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep2(i, m, n) for(int i=int(m); i<int(n); i++)
#define rep(i, n) rep2(i, 0, n)
#define all(a) a.begin(), a.end()
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using VV = ve... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 | 57,741,031 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
#define rep(i,n) for (ll i=0;i<n;++i)
#define rep2(i,a,b) for (ll i=a;i<b;++i)
const ll MOD=1e9+7;
const ll INF=1e9;
const ll IINF=1e18;
const double EPS=1e-8;
const double pi=acos(-1);
template<class... | #include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
using namespace std;
#define rep(i,n)for(int i=0; i<(int)(n); i++)
#define bitrep(tmp, N)for (int tmp=0; tmp < (1<<N);tmp++)
#define all(v) v.begin(), end.bigin()
using P = pair<int,int>;
int main(){
int ... | 0 | 47,758,940 |
#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main(){
int h,w;
cin>>h>>w;
vector<vector<char>>c(w,vector<char>(h));
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>>c.at(j).at(i);
}
}
for(int i=0;i<h;i++){
for(int j=0;j<2;j++){
for(int k=0;k<w;k++){
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define for0(n) for(i=0; i<(n); i++)
#define for1(n) for(i=1; i<=(n); i++)
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
ll _,i,j,n,a,b,e,k,u,t,x=1,m,y,q,f=1,c=0,d=0,l,p,z,o,r,g;
string ss,s;
cin>>x>>n;
set<ll> st... | 0 | 99,541,830 |
#include<iostream>
using namespace std;
const int N=1e5+5;
int a[N];
int main(){
int n;
scanf("%d",&n);
int ai;
while(n--){
scanf("%d",&ai);
a[ai]++;
a[ai-1]++;
a[ai+1]++;
}
int max=0;
for(int i=0;i<N-1;i++){
if(max<a[i])
max=a[i];
}
printf("%d\n",max);
return 0;
} | #include <iostream>
#include <iomanip>
#include <string>
#include <algorithm>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main()
{
string o, b;
cin >> o >> b;
int n = min(o.size(), b.size());
repi(i, ... | 0 | 69,879,878 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
while (N--) {
string s;
vector<string> v;
v.push_back(".,!? ");
v.push_back("abc");
v.push_back("def");
v.push_back("ghi");
v.push_back("jkl");
v.push_back("mno");
... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define int ll
#define PI 3.1415926535897932384626433832795
#define pb push_back
#define rep0 for(int i=0;i<n;i++)
#define rep1 for(int i=1;i<=n;i++)
#define inputar0(ar) for(int i=0;i... | 0 | 80,944,526 |
#include<iostream>
#include<vector>
#include<map>
#include<algorithm>
#include<set>
#include<cstring>
using namespace std;
typedef long long int lli;
#define all(arr) arr.begin(),arr.end()
#define f first
#define s second
#define debug1(x) cout<<x<<"\n"
#define debug2(x,y) cout<<x<<" "<<y<<"\n"
#define debug3(x,y,z) co... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <string>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#define INF (int)1e09
using std::cin;
using std::cout;
using std::endl;... | 0 | 84,263,867 |
#include <iostream>
#include <iomanip>
#include <cmath>
#include <vector>
#include <numeric>
#include <algorithm>
using namespace std;
void Rect(int h, int w){
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cout << '#';
if (j==w-1) cout << endl;
}
}
}
int main(){
int H,W;
while(true){
cin >> H >> W;
if(H... | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<stack>
#include<algorithm>
#include<iostream>
#include<cmath>
using namespace std;
typedef struct st
{
double x;
double y;
}st_Coordinate;
int n;
void Koch_curve(st_Coordinate p1, st_Coordinate p2, int n);
int main(void)
{
st_Coordinate st_start,... | 0 | 65,729,997 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
vector<ll> ans;
void dfs(int d, ll now){
ans.push_back(now);
if(d==10) return;
for(int j = -1; j<=1; j++){
int add = (now % 10) + j;
if(add>=0 && add <= 9) dfs(d+1, now*10+add);
}
}
i... | #include <bits/stdc++.h>
using namespace std;
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, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string... | 0 | 48,789,691 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF 0x6fffffff
#define INFL 0x6fffffffffffffffLL
ll n,m;
vector<string> A(50),B(50);
bool isok(ll i, ll j) {
ll x,y;
for(x=0;x<m;x++) {
for(y=0;y<m;y++) {
if (A[i+x][j+y] != B[x][y] ) return false;
}
}
return true;
}
int main() {
ll... | #include "bits/stdc++.h"
#define ll long long
#define rep2(i,a,b) for(int i=(a);i<=(b);++i)
#define rep(i,n) for(int i=0;i<n;i++)
#define pii pair<int,int>
#define ti3 tuple<int,int,int>
#define pq priority_queue<int>
#define pqg priority_queue<int,vector<int>,greater<int>>
ll int MOD=998244353;
#define N 3000000
using... | 0 | 35,893,426 |
#include <iostream>
#include <vector>
#define rep(i, a, b) for(int i = a; i < b; i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
rep(i, 0, n) cin >> v[i];
int mx = 0, s = 0;
rep(i, 1, n) {
if(v[i] <= v[i-1]) {
s++;
} else {
if(mx < s) mx = s;
s = 0;
}
... | #include <bits/stdc++.h>
using namespace std;
int main(void){
string s;
int cnt[26] = {0};
cin >> s;
for (int i=0; i<s.size(); i++){
if (cnt[s[i]-'a'] == 1){
cout << "no" << endl;
return 0;
} else{
cnt[s[i]-'a'] = 1;
}
}
cout << "yes" <... | 0 | 31,089,641 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N;
const ll mod = 1000000007;
int main(){
cin >> N;
vector<ll> A(N);
for ( int i = 0; i < N; i++ ){
cin >> A[i];
}
ll result = 0;
for ( ll b = 0; b < 60; b++ ){
ll bb = (ll)1 << b;
vector<int> bitacc(N+1);
int acc = 0;
for ( int i = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i = k; i > (int)(n); i--)
#... | 0 | 5,760,214 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
#define forn(i,n) for(int i=0;i<(int) n;i++)
#define Forn(i,n) for(int i=1;i<=(int) n;i++)
#define M 100005
lli gcd(lli a,lli b)
{
if(a%b==0) return b;
return gcd(b,a%b);
}
int main()
{
lli n,i;
cin>>n;
lli a[n];
for(i=0;i<n;i++... | #include <iostream>
#include <map>
#define ll long long
using namespace std;
map <ll, int> freq;
ll arr[200005];
ll prefsum[200005];
int main()
{
int n;
cin >> n;
prefsum[0] = 0;
for (int i = 1; i <= n; i++){
cin >> arr[i];
prefsum[i] = prefsum[i-1] + arr[i];
}
freq[0] = 1;
l... | 0 | 18,031,147 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, k, min = 0;
cin >> n >> k;
vector<int> p;
for (size_t i = 0; i < n; i++)
{
int x;
cin >> x;
p.push_back(x);
}
sort(p.begin(), p.end());
for (size_t i = 0; i < k; i++)
{
min += p[i];
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main(void){
int n;
cin >> n;
vector<int> A(n+2);
A[0] = 0;
for(int i=1; i<=n; i++){
cin >> A[i];
}
A[n+1] = 0;
int total = 0;
for(int i=1; i<=n+1; i++){
total += abs(A[i] -... | 0 | 18,440,852 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i,n) for(long long i = 0; i < (n); ++i)
#define ll long long
#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);
int main(void)
{
ll n, ans=0;
cin >> n... | 0 | 50,255,033 |
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <numeric>
#include <cmath>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
template... | #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 | 79,116,016 |
#include <bits/stdc++.h>
#include<math.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 PI 3.14159265358979323846264338327950
#define INF 1e18
int main () {
int n ;
cin >> n ;
vector<string> s (n) ;
rep(i, n){
cin ... | #include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358979323846264338327950L
int main() {
int N, M;
cin >> N >> M;
for (int ii = 0; ii < M; ii++) {
int A;
cin >> A;
N = N - A;
if (N < 0) {
cout << -1 << endl;
return 0;
}
}
cout << N << endl;
} | 0 | 61,036,482 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<string>
#include<cmath>
#include<numeric>
using namespace std;
int main(void) {
string s;
getline(cin, s);
for(int i=0; i<s.size(); i++){
if( s[i]-'A' >= 0 && s[i]-'A' < 26 ) s[i] += 32;
else if( s[i]-'a' >= 0 && s[i]-'a' < 26 ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string A;
cin>>A;
if(A=="RRR"){
cout<<3;
}
else if(A=="SSS"){
cout<<0;
}
else if(A=="SRR"||A=="RRS"){
cout<<2;
}
else if(A=="SRS"||A=="RSS"||A=="SSR"||A=="RSR"){
cout<<1;
}
return 0;
} | 0 | 52,985,438 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
co... | #include <bits/stdc++.h>
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#define INF 1000000000... | 0 | 39,037,472 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(int argc, const char *argv[]) {
ll n, k;
cin >> n >> k;
ll cur = 1;
for (int i = 0; i < n; i++) {
if (cur * 2 < cur + k) {
cur *= 2;
} else {
cur += k;
}
}
cout << cur << '\n';
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define eb emplace_back
const int MAX=1000000;
int main()
{
ll a,b;
cin>>a>>b;
if(a==b)
{
cout<<"Draw"<<endl;
}
else if(b==1)
{
cout<<"Bob"<<endl;
}
else if(a==1)
{
c... | 0 | 78,135,252 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<math.h>
#include<map>
#include<iomanip>
#include<numeric>
#define rep(i,n) for(int i=0;i<n;++i)
#define mod 1000000007
using namespace std;
int main(){
vector<pair<int,int> > map;
while(true){
int H,W; cin>>H>>W;
... | #include<bits/stdc++.h>
#define pi acose(-1)
typedef long long int ll;
typedef double dl;
using namespace std;
const int mx = 1e2+5;
int main()
{
int n;
cin>>n;
cout<< n*n;
return 0;
} | 0 | 41,803,912 |
#include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << endl
#define debugArray(x, n) \
for(long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << #x << "[" << hoge << "]: " << x[hoge] << endl
using namespace std;
using... | #include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
auto g = atcoder::dsu(n);
for (int i = 0; i < q; i++) {
int t, u, v;
cin >> t >> u >> v;
if (t) {
cout << (g.same(u, v) ? 1 : 0) << endl;
} else {
... | 0 | 95,001,552 |
#include<bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n ; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define whole(f, x, ...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main(void){
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
i... | 0 | 58,916,131 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];
#define max3(a,b,c) max(max(a,b),c)
#define min3(a,b,c) min(min(a,b),c)
#define ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#d... | #include <iostream>
#include <vector>
#include <bitset>
using namespace std;
#define INF 1<<30
int dp[1<<26];
int main(){
fill_n(dp, 1<<26, INF);
string s;
cin >> s;
int N = s.size();
int bt = 0;
for(int i=0; i<N; i++){
int x = s[i] - 'a';
bt ^= 1<<x;
if(__builtin_popcoun... | 0 | 69,473,331 |
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int N;
cin >> N;
map<int, int>d;
d[N] = 1;
int b_a = N;
int num = 2;
while (true) {
int ans;
if (b_a % 2 == 0) {
ans = b_a /2;
} else {
ans = (3 * ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long LL;
typedef vector<ll>VI;
typedef vector<bool>VB;
typedef pair<ll,ll>P;
typedef pair<double,double>P_D;
#define VV(T) vector<vector<T>>
#define PI 3.1415926535897932384626433832795
#define rep(i, n) for (ll i = 0; i < (ll)n; i... | 0 | 73,981,017 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n , c,k;
cin>>n>>c>>k;
ll t[n];
for(int i=0;i<n;i++)
{
cin>>t[i];
}
sort( t , t+n);
int index =0;
ll ans =0;
while( index < n)
{
ll curr = t[index];
ll cap =1;
w... | #include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<deque>
#include<bitset>
#include<iomanip>
#include<cctype>
#include<map>
#include<cstring>
#include<bitset>
#include<cassert>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#d... | 0 | 62,009,528 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define Rep(i,s,f) for(int i=(int)s;i<(int)f;i++)
using ll=long long;
using namespace std;
int main()
{
string s;
cin>>s;
int one=0;
int zero=0;
for(char c : s)
{
if(c=='0') zero++;
else one++;
}
cout<<min(zero,one)*2<<endl;
return 0;
} | #include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<vector>
#include<queue>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int,int> PI... | 0 | 29,767,215 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int t; cin>>t; while(t--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a, b... | #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 | 51,069,280 |
#include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << "debug" << x << endl;
using namespace std;
int main(){
int w,h,x,y,r;
x = 1;
while(cin >> w){
if(w == 0) break;
cout << "Case " << x << ": " << w << endl;
... | #include <cstdint>
#include <iostream>
#include <string>
#include <algorithm>
constexpr int32_t kMaxNumberOfMatrices = 100;
constexpr int32_t kMaxNumberOfRowsAndCols = 100;
void CallMatrixChainMultiplication(std::istream &input_stream);
struct Matrix {
int32_t number_of_rows{0};
int32_t number_of_columns{0};
};
str... | 0 | 80,085,667 |
#include<stdio.h>
#include<math.h>
#include<algorithm>
using namespace std;
long long a[200005] = {0}, i, n, m, ans= 99000000000;
int main()
{
scanf("%lld", &n);
for (i = 1; i <= n; i++)
{
scanf("%lld", &m);
a[i] = a[i - 1] + m;
}
for (i = 1; i<n; i++)ans = min(abs(a[i] * 2 - a[n]), ans);
printf("%lld\n", an... | #include <bits/stdc++.h>
#include <regex>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
#define INIT ... | 0 | 64,797,634 |
#include<stdio.h>
int main(){
int a;
int b;
scanf("%d %d",&a,&b);
int c;
c = a + b;
if(c==3){
printf("3");
}
if(c==4){
printf("2");
}
if(c==5){
printf("1");
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1e9+7;
const ll inf = 1e18;
const double pi = 3.1415926535897932384626;
ll mpow(ll a,ll b,ll m){
ll res=1;
while(b){
if(b%2) res=res*a%m;
a=a*a%m;
b/=2;
}
return res;
}
ll inv(ll a,ll m){
return mpow(a,m-2,m);
}
l... | 0 | 8,910,040 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
constexpr ll mod=1e9+7;
int main()
{
ll n;
cin>>n;
map<pair<ll,ll>,ll> path;
vector<vector<ll>> connect(n);
for (int i = 0; i < n-1; ++i)
{
ll a,b,c;
cin>>a>>b>>c;
a--;b--;
path[make_pair(a,b)]=c;
path[make_pair(b,a)]=c;
... | #include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define Rep(i, a, b) for(int i = a; i <= b; i++)
#define repr(i, a, b) for(int i = a; i >= b; i--)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
#define P pair<ll, ll>
using ll = long long;
... | 0 | 91,638,923 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin();... | #include<iostream>
using namespace std;
int main(){
int n;
int x[4][3][10] = { { {} } };
cin >> n;
for (int i = 0; i < n; i++){
int a, b, c, d;
cin >> a >> b >> c >> d;
x[a - 1][b - 1][c - 1] += d;
if (x[a - 1][b - 1][c - 1] > 9){
x[a - 1][b - 1][c - 1] = 9;
}
if (x[a - 1][b - 1][c - 1] < 0){
x[... | 0 | 73,744,732 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define rep2(i,a,n) for(int i=(a); i<(n); i++)
#define all(vec) vec.begin(),vec.end()
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
int main(){
int N; cin >> N;
map<string, int> mp;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int H,W,K;cin>>H>>W>>K;
char A[H][W];
for(int i=0;i<H;i++){
for(int j=0;j<W;j++) cin>>A[i][j];
}
int ans=0;
for(int s=0;s<(1<<H);s++){
for(int t=0;t<(1<<W);t++){
int black=0;
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
... | 0 | 27,158,845 |
#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 a,b;
cin >> a>>b;
if(a=='H'&&b=='H') cout << 'H' <<endl;
else if(a=='H'&&b=='D') cout << 'D' <... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
typedef vector<ll> vi;
typedef vector<pi> vpi;
typedef long double ld;
const int inf = 1e9 + 7;
const int mod = 1e9 + 7;
const int maxn = 1e6 + 3;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#defi... | 0 | 16,147,395 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1'000'000'007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define rep(i, n) for(ll i=0; i<(ll)(n); i++)
#define repd(i, n) for(ll i=n-... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 50 + 5, mod = 1e9 + 7;
int n, k;
int a[N], dp[N][N][102];
int solve(int l, int r, int left)
{
if (l > r)
return 0;
if (dp[l][r][left] != -1)
return dp[l][r][left];
int ans = 0;
if (a[l] < 0)
{
i... | 0 | 52,326,286 |
ll ten_ruijo_amari = 1;
ll cur = 0;
val[cur]++;
REP(i, n) {
cur = (cur + (s[n - 1 - i] - '0') * ten_ruijo_amari) % p;
ten_ruijo_amari = (ten_ruijo_amari * 10) % p;
val[cur]++;
}
ll ans = 0;
REP(i, p) ans += val[i] * (val[i] - 1) / 2;
cout << ans << endl;
return 0;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep1(i, n) for(int i = 1; i < n+1; i++)
#define all(A) A.begin(),A.end()
typedef long long ll;
const ll MOD = (ll)pow(10,9)+7;
int main(){
int n,k;
cin >> n >> k;
vector<int> a(n);
rep(i,n){
cin >> a[i];
}
... | 0 | 44,262,482 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define M 1000000007
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n, i, j, wt, m;
cin >> n >> m;
vector<string> v(n);
vector<vector<int>> dp(n, vector<int> (m));
for(i = 0;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
template <typename T>
using Graph = vector<vector<T>>;
const int MOD = 1e9 + 7;
vector<int> dijkstra(int s, Graph<pii> &G) {
int N = G.... | 0 | 53,599,667 |
#include<iostream>
using namespace std;
int main() {
int a[101];
for(int i = 0; i < 101; i ++) {
a[i] = 0;
}
int x;
int max = 0;
while(cin >> x) {
a[x]++;
if(a[x] > max) {
max = a[x];
}
}
for(int i = 1; i < 101; i++) {
if(a[i] == max) {
cout << i << endl;
}
}
return 0;
} | #include <iostream>
#include <algorithm>
#include <vector>
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
using namespace std;
typedef long long ll;
int main()
{
int n;ll l;
cin >> n >> l;
vector<ll> a(n);
rep(i,n){
cin >> a[i];
}
vector<ll> sum(n+1);
sum[0] = 0;
rep(i... | 0 | 71,170,070 |
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using P = pair<int, int>;
using vec = vector<int>;
using mat = vector<vector<int>>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
int m... | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
char n='0';
int cnt=0,ans=0;
for(int i=0;i<s.size();i++){
if(cnt==0){
n=s.at(i);
cnt++;
}else{
if(n==s.at(i)){
cnt++;
}else{
cnt--;
ans+=2;
}
}
}
cout << ans << en... | 0 | 89,361,514 |
#include<bits/stdc++.h>
#define int long long
#define double long double
#define pb emplace_back
#define pf emplace_front
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int,int>
#define mii map<pii,int>
#de... | #include <iostream>
#include <vector>
using namespace std;
#define max 2000001
#define vmax 10000
int main(){
int c[vmax+1];
int n,i,j;
cin >> n;
unsigned short *A, *B;
A = new unsigned short[n + 1];
B = new unsigned short[n + 1];
for (i = 0; i<vmax;i++){
c[i]=0;
}
for (i =... | 0 | 21,562,779 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template<typename T>
void fin (T a){
cout<<a<<endl;
exit(0);
}
template<typename S>
void print(S a){
cout<<a<<endl;
}
template<typename U>
void pprint(U a){
... | #include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;
template<class T> constexpr T... | 0 | 40,439,124 |
#include <iostream>
#include <queue>
#include <vector>
#include <climits>
using namespace std;
#define NODE_NUM 101
#define INF INT_MAX
int weight[NODE_NUM][NODE_NUM];
int WarshallFloyd(int n){
for(int k=0; k < n; k++) {
for(int i=0; i < n; i++) {
for(int j=0; j < n; j++) {
if(we... | #include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(... | 0 | 58,293,485 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const double pi = 3.141592653589793238462643383279;
const int INF = 1000000000;
const ll LINF = 100000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijkl... | #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<un... | 0 | 86,804,018 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (ll i=0; i<(n); ++i)
typedef long long ll;
bool debug=false;
string yes = "Yes";
string no = "No";
int main(){
ll n,k; cin >> n >> k;
if(k>=n){
cout << n;
return 0;
}
string s; cin >> s;
queue<ll> q;
q.push(0);
char prev='1';
ll ... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <atcoder/dsu>
using namespace std;
using namespace atcoder;
template<class T> inline void read(T &x){
x=0;
T f=1;
char ch=getchar();
while(ch<'0' || ch>'9'){
if(ch=='-'){
f=-1;
}
ch=getchar();
}
... | 0 | 89,150,665 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for(int __x = __start; __x < __end; __x++)
#define chmax(x,y) (x = max(x, y))
template<class T1, class T2>
T1 intpow(const T1& a, const T2 n) {
if (n == 0) return 1;
auto t = intpow(a, n / 2);
t = t * t;
if (n &... | #include <iostream>
#include <vector>
int main(){
using namespace std;
int n,x,i,j,k,l,ans;
vector<int> vn;
vector<int> vx;
while(1){
cin >> n >> x;
if(n==0&&x==0){
break;
}
vn.push_back(n);
vx.push_back(x);
}
int size = vn.size();
for(... | 0 | 56,034,457 |
#pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
constexpr ll INF = 1e9, MOD = 1e9 +... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long int ll;
int main()
{
ll m,n;
c... | 0 | 88,644,137 |
#pragma region header
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#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>
#... | #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 ... | 0 | 49,476,588 |
#include<bits/stdc++.h>
#include <numeric>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define erep(i, n) for (ll i = 0; i <= (ll)(n); ++i)
#define FOR(i,a,b) for (ll i = (a); i < (ll)(b); ++i)
#define EFOR(i,a,b) for (ll i = (a); i <= (ll)(b); ++i)
template<class T>boo... | #include <bits/stdc++.h>
#include <iostream>
#include <vector>
#define int long long
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repeq(i,a,b) for(int i=a;i<=b;i++)
#define Vi vector<int>
#define VVi vector<Vi>
#define Vs vector<string>
#define Vc vector<char>
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"... | 0 | 100,895,658 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
vector<ll> s;
void solve(){
int a,b;
cin>>a>>b;
if(a+b==15)cout<<"+"<<endl;
else if(a*b==15)cout<<"*"<<endl;
else cout<<"x"<<endl;
}
int main(){
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);++i)
typedef long long ll ;
const ll MOD = 1000000007;
ll dp[2100][2100];
ll sum[2100][2100];
int main() {
int N,M;
cin >> N >> M;
vector< int > S(N+3),T(M+3);
REP(i,N) cin >> S[i];
REP(i,M) cin >> T[i];
dp[0][0] = 1;
sum[0][... | 0 | 71,692,623 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int>A(N);
vector<int>B(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
cin >> B[i];
}
priority_queue<int>que;
int ans = 0;
l... | #include <bits/stdc++.h>
using namespace std;
int main() {
while (1) {
int n;
int m;
int p;
int sum = 0;
int k;
scanf("%d%d%d", &n, &m, &p);
if (n == 0 && m == 0 && p == 0) return 0;
for (int i=0; i<n; i++) {
int x;
scanf("%d", &x);
if (i == m-1) k = x;
sum += x... | 0 | 84,695,159 |
#include <bits/stdc++.h>
using namespace std;
const int INF=999999999;
char a[10][10];
int main() {
string S;
cin>>S;
string T[4]={"dream", "dreamer", "erase", "eraser"};
reverse(S.begin(),S.end());
for(int i=0;i<4;i++){reverse(T[i].begin(),T[i].end());}
bool can=true;
for(int i=0;i<S.size()... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll mod=1e9+7;
int main(){
int X,Y; cin>>X>>Y;
if((2*Y-X)%3||(2*X-Y)%3||X*2<Y||Y*2<X){
cout<<0<<endl;
}else{
int a=(2*Y-X)/3;
int b=(2*X-Y)/3;
if(a<b) swap(a,b);
ll nx=a+1,dx=1,n=1,d=1;
while(b>0){
n=n*nx%mod;
... | 0 | 27,220,117 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int K;
cin >> K;
vector<ll> A(K,0);
for(int i=0;i<K;i++){
cin >> A[K-1-i];
}
ll U=2,L=2;
for(int i=0;i<K;i++){
ll S = U/A[i];
if(S*A[i]<U){
S ++;
}
ll T = L/A[i];
if(T<S){
cout << -1 << endl... | #include <numeric>
#include <bits/stdc++.h>
#include <utility>
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <math.h>
#include <string>
#define ll long long
#define ull unsigned long long
#define make(type,x) type x; cin>>x
#define make2(type,x,y) type x,y; cin>>x>>y
#define fr(x,... | 0 | 78,308,388 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loo... | #include<bits/stdc++.h>
using namespace std;
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
#define pi acos(-1)
#de... | 0 | 55,957,553 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main()
{
string s;
cin>>s;
ll sum=0;
for(ll i=0;i<s.length();i++)
{
sum+=s[i]-'0';
}
if(sum%9==0){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
} | #include<bits/stdc++.h>
#include<string.h>
typedef long long int ll;
#define all(x) (x).begin(), (x).end()
using namespace std;
int nxt() {
int x;
cin >> x;
return x;
}
ll nxtl(){
ll x;
cin>>x;
return x;
}
void SieveOfEratosthenes(int n,vector <int> &primes)
{
bool prime[n+1];
memset(... | 0 | 97,659,107 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string sample[4] = {"dream","dreamer","erase","eraser"};
string s; cin >> s;
reverse(s.begin(), s.end());
for (int i = 0; i < 4; i++) reverse(sample[i].begin(), sample[i].end());
bool count1 = true;
for (int i = 0; i < s.size(); ){
bool count2 =... | #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 S[2005];
ll T[2005];
ll dp[2005][2005];
int main() ... | 0 | 15,056,479 |
#include <stdio.h>
using namespace std;
int main(void){
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
if(a<b&&b<c){
printf("Yes\n");
}else{
printf("No\n");
}
} | #include <stdio.h>
#include <math.h>
int calc_max_sum(long a, long b){
long long inte = sqrt(a * b);
if((inte + 1) * inte < a * b){
return inte * 2 + 1;
}else if(inte * inte <= a * b){
return inte * 2;
}
}
bool is_square_number(long s){
long inte = long(sqrt(s));
if(inte * inte =... | 0 | 84,284,126 |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#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 <cst... | #pragma GCC optimize("O3", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
using pii = pair<int, int>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using Prior = priority_queue<T>;
#define X first
#define... | 0 | 91,707,597 |
#include<stdio.h>
int main()
{
char a,a1;
scanf("%c",&a);
a1=a+1;
printf("%c",a1);
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
void testcase(){
string s,t;
cin >> s >> t;
int ns=s.length();
int nt=t.length();
int mx=0;
for(int i=0;i<ns-nt+1;i++){
int c=0;
for(int j=0;j<nt;j++){
if(s[i+j]==t[j])
c++;
}
... | 0 | 52,139,151 |
#include "algorithm"
#include "bitset"
#include "cmath"
#include "functional"
#include "iomanip"
#include "iostream"
#include "map"
#include "numeric"
#include "queue"
#include "set"
#include "string"
#include "vector"
#define rep(i, to) for (ll i = 0; i < (to); ++i)
#define rep1(i, to) for (ll i = 1; i <= (to); ++i)
#... | #include <bits/stdc++.h>
#define rep(n) for(int i=0;i<n;i++)
#define reps(i,s,n) for(int i=s;i<n;i++)
#define rep_bit(n) for (int bit = 0; bit < (1<<n); ++bit)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define ll long long
#define CYES cout<<"Yes"<<endl
#define CNO cout<<"No"<<endl
using namespace std;
... | 0 | 37,922,604 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
using namespace std;
int main()
{
string s1, s2, s3;
cin >> s1 >> s2 >> s3;
cout << (char)toupper(s1[0]) << (char)toupper(s2[0]) << (char)toupper(s3[0]) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (int)(b); ++i)
const int MAXN = 1e5 + 4;
int main() {
int n;
string s;
cin >> n;
cin >> s;
s[n] = s[0], s[n + 1] = s[1];
bitset<100005> a;
REP(i, 4) {... | 0 | 18,028,922 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.