code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int x,a;
cin>>x>>a;
if(a==1)
{
cout<<'0'<<endl;
return 0;
}
cout<<x-a<<endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#include <map>
#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 pair<int,int> P;
const int dx[4] = {0,1,0,-1};
co... | 0 | 71,564,333 |
#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;
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long int h,w,a,b,c;
cin>>h>>w;
a=h*w;
if(h==1 || w==1)
{
cout<<1<<endl;
return 0;
}
if(h%2==0)
{
b=h/2;
c=w*b;
cout<<a-c<<endl;
}
else
{
b=h/2;
c=b*w+w/2;
... | 0 | 91,506,961 |
#include<string>
#include<iostream>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
int i, len = s.length();
while(i < len){
if(s == t) {
cout << "Yes";
return 0;
}
s = s.substr(len - 1) + s.substr(0, len - 1);
i++;
}
cout << ... | #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 ft first
#define sc second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(),(v).end()
#define mod 1000000007
#define FS fix... | 0 | 72,235,469 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int a = N/1000;
int b = N/100%10;
int c = N/10%10;
int d = N%10;
if(b==c&&(a==b||c==d)){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
} | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
int n;
cin >> n;
vector<string> w(n);
for(int i = 0; i < n; i++) cin >> w[i];
string ans = "Yes";
for(int i = 1; i < n; i++){
for(int j = 0; j < i; j++){
if(w[j] == w[i]) ans = "No";
... | 0 | 25,343,554 |
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> n(10);
for(int i=0;i<4;i++){
int a;
cin >> a;
n.at(a)++;
}
if(n.at(1)==1&&n.at(7)==1&&n.at(9)==1&&n.at(4)==1){
cout << "YES" << endl;
}else{
cout << "NO" << endl;
}
} | #include <iostream>
using namespace std;
using Int = long long int;
using UInt = unsigned long;
int main (void) {
char c;
cin >> c ;
if (c == 'a') {
cout << "vowel" << endl;
}else if (c == 'e') {
cout << "vowel" << endl;
}else if (c == 'i') {
cout << "vowel" << endl;
}els... | 0 | 34,254,298 |
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
int main() {
int n, k, s; cin >> n >> k >> s;
V<int> ans;
for(int i = 0; i < n - k; i++){
if(s != 1e9) ans.push_back(s + 1);
else ans.push_back(s - 1);
}
... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
int main(){
int n;
cin >> n;
vector<pii> vp;
for(int i = 0; i < n; i++){
int a, b;
cin >> a >> b;
vp.push_back({a+b, a});
}
sort(vp.rbegin(), vp.r... | 0 | 35,708,964 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;cin >>s;
int win =8;
int rday =15;
int day =0;
while(s.size()> day){
auto f = s.substr(day,1);
if(f=="o"){
--win;
}
--rday;
++day;
}
string ans;
if(rday>=win){
ans = "YES";
} else {
ans = "NO";
}
cout << ans <<... | #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 | 53,672,558 |
#include<bits/stdc++.h>
#define lint long long
#define st first
#define nd second
#define INF 0x3f3f3f3f
using namespace std;
int g[2020][2020];
char g2[2020][2020];
int maxi[2020][2020];
int maxj[2020][2020];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int n, m;
cin>>n>>m;
memset(... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
using namespace std;
typedef long long int ll;
#define dame { puts("-1"); return 0;}
#define yn {puts("... | 0 | 23,852,717 |
#include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
signed main(){
Int n;
cin>>n;
vector<vector<Int> > G(n);
for(Int i=1;i<n;i++){
Int x... | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
#ifdef DEBUG
#define DEBUG_PRINT(fm, ...) do{std::printf("%s:%d(%s)", __FILE__, __LINE__, __func__);std::cout << "DEBUG PRINT ";std::printf(fm, __VA_ARGS__);}while(0)
#define DEBUG_VAL(a, b) do{std::printf("%s:%d(%s)", __FILE__, __LINE__, __func__);... | 0 | 54,922,983 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s, t;
cin >> s >> t;
ll res = 0;
rep(i, 3) {
if (s.at(i) == t.at(i)) res++;
}
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | 0 | 5,667,083 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int64_t first = 0;
int64_t second = 2;
int64_t answer = 1;
for (int i=0;i < N - 1; i++){
first = second;
second = answer;
answer = first + second;
}
printf("%ld",answer);
} | #include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int y, m, d;
cin >> y >> m >> d;
int count = 0;
if (y%3==0) {
count += 20 - d + 1;
count += ((10 - m) / 2) * (20 + 20) + ((10 - m) % 2) * 20;
}... | 0 | 73,604,482 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int INF = 100100101;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string a,b;
cin >> a >> b;
if(a.length() > b.length()){
cout << "GREATER" << endl;
return 0;
... | #include <stdio.h>
#include <iostream>
#include <utility>
#include <algorithm>
#include <math.h>
#include <vector>
using namespace std;
#define inf 2000000001
vector<int> S = {inf};
int parent(int i)
{
return i / 2;
}
int left(int i)
{
return 2 * i;
}
int right(int i)
{
return 2 * i + 1;
}
void maxHeapify(v... | 0 | 40,180,781 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int A,B,C;
cin >> A >> B >> C;
cout << max(C-(A-B), 0) << endl;
return 0;
} | #include <iostream>
#include <algorithm>
using namespace std;
void SelectSort(int x[], int N);
void BubbleSort(int x[], int N);
void InsertSort(int x[], int N, int num);
void ShellSort(int x[], int N);
void Trace(int x[], int N);
int gCount = 0;
int main() {
int N;
cin >> N;
int x[N];
for (int i = 0; i ... | 0 | 23,359,082 |
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>... | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typede... | 0 | 46,579,232 |
#include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int main() {
int n, m;
cin >> n >> m;
Graph G(n);
Graph d(n, vector<int>(n, 100100100));
map<P, int> edge;
int ans = 0;
for(int i=0;i<n;i++) d[i][i] = 0;
for(int i=0;i<m;i++) {
int a, b, c;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i,l,r) for (int i = (l); i < (r); ++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define MIN(c) *min_element(ALL(c)... | 0 | 73,623,716 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
while (cin >> N, N) {
N = 1000 - N;
int v[] = {500, 100, 50, 10, 5, 1};
int ans = 0;
for (int i = 0; i < 6; i++) {
ans += N / v[i];
N %= v[i];
}
cout << ans << endl;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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;
--a; --b;
g[a].push_back(b);
g[b].push_back(a);
}
vector<int> d(n, -1), pr... | 0 | 4,166,781 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
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... | #include <iostream>
using namespace std;
int main()
{
int m,f,r;
char g;
while(1)
{
cin>>m>>f>>r;
if(m==-1&&f==-1&&r==-1) break;
if(m==-1||f==-1)
g='F';
else
{
if ((m+f)>=80)
g='A';
else if ((m+f)>=65)
g='B';
else if ((m+f)>=50)
g='C';
el... | 0 | 20,502,311 |
#include <bits/stdc++.h>
#define rep(a,n) for (ll a = 0; a < (n); ++a)
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<vector<ll> > Graph;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a ... | #include <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... | 0 | 67,793,151 |
#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 = 1001001001LL;
constexpr long long LINF = 1001001001001001001... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
const ll LongINF=1e13+7;
const int INF=1e9+7;
const int dx[]={0,1,0,-1};
const int dy[]={1,0,-1,0};
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template... | 0 | 38,122,941 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define M 1000000007
#define boost
#define push_back push
#define pop_back pop
#define fo(i,n) for (size_t i = 0; i < n; i++)
#define fo1(i,n) for (size_t i = 1; i <= n; i++)
template<class _T>inline void read(_T &_a)
{
bool f... | 0 | 57,288,748 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
typedef pair<dd,dd> d_d;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define... | #include <iostream>
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <cctype>
#include <string>
#include <map>
#include <set>
#include <math.h>
#include <cmath>
#define ll long long
using namespace std;
using P = pair<int,int>;
int main(){
string S;
cin >> S;
S.erase(S.size()-1);
int n =... | 0 | 85,708,609 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n) ;i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll=long long;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define MOD 1000000007
const ll INF... | #include<bits/stdc++.h>
using namespace std ;
int main(){
int A , B ;
cin >> A >> B ;
int cnt = 0 ;
for(int i = A ; i <= B ; i++){
int T = 0 ;
string S = to_string(i) ;
for(int j = 0 ; j < S.size() ; j++){
if(S.at(j) != S.at(S.size() - 1 - j )){
T++ ;
}
}
if(T == 0 ... | 0 | 79,086,280 |
#include <iostream>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <queue>
using namespace std;
#define pb(n) push_back(n)
#define mp(n,m) make_pair(n,m)
#define ... | #include<bits/stdc++.h>
#include<iostream>
using namespace std;
int main(){
int n,l;
cin>>n>>l;
vector<string> z(n);
for(int i=0;i<n;i++)
cin>>z[i];
sort(z.begin(),z.end());
for(int i=0;i<n;i++)
cout<<z[i];
cout<<endl;
} | 0 | 10,128,331 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <algorithm>
#include <numeric>
#include <random>
#include <vector>
#include <array>
#include <bitset>
#include <queue>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map... | #include<cstring>
#include<string>
#include<vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<list>
#include<set>
#include<map>
#include<complex>
#include<sstream>
#include<climits>
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X)... | 0 | 31,137,789 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cmath>
#include <climits>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <string>
#include <list>
#include <bitset>
#include <vector>
using namespace s... | #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 MOD (long long int)(1e9+7)
#define ll long ... | 0 | 92,607,974 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stdlib.h>
#include <math.h>
#include <numeric>
int main() {
int n;
std::cin >> n;
std::string s;
std::cin >> s;
int k;
std::cin >> k;
for (size_t i = 0; i < s.length(); i++)
{
if (s[k - 1] != s[i]) {
s[i] = '*';
}
}
... | #include<iostream>
#define rep(i,n) for(int i=0; i<n; i++)
using namespace std;
int main(void)
{
int n, u, v, k, a[101][101]={0}, adj[101];
cin >> n;
rep(i,n){
cin >> u >> k;
rep(i,k){
cin >> v;
a[u][v] = 1;
}
}
rep(i,n){
rep(j,n){ cout << a[i+... | 0 | 33,505,709 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<pair<int, int>> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i].first;
p[i].second = i;
}
sort(p.begin(), p.end());
for (int i = 1; i <= N; i++) {
cout << N * i + p[i - 1].second << " ";
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long n;
cin >> n;
int ans = 0;
long x = (long)sqrt(n);
while (x > 0)
{
if (n % x == 0)
{
long b = n / x;
while (b > 0)
{
ans++;
b /= 10;
}
... | 0 | 3,591,253 |
#include <iostream>
#include <algorithm>
using namespace std;
int N;
int A[100005];
void Read()
{
cin >> N;
for(int i = 1; i <= N; i++)
cin >> A[i];
sort(A + 1, A + N + 1);
}
void Solve()
{
int Max = 0, PMax = 0;
for(int i = 1; i < N; i++)
{
bool rev = 0;
if(A[i] > A[N] -... | #include <iostream>
#include <string>
using namespace std;
const long M = 1046527;
string H[M];
long getKey(string str){
long sum = 0 , digit = 0 , p = 1;
for (int i = 0; i < str.size() ; ++i) {
if (str[i] == 'A') {
digit = 1;
} else if (str[i] == 'C') {
digit = 2;
... | 0 | 30,135,306 |
#include<bits/stdc++.h>
#define endl "\n"
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
int main()
{
fast;
int k;
cin>>k;
string s;
cin>>s;
int m=s.length();
if(k==m||k>m)
{
cout<<s<<endl;
return 0;
}
... | #include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
#define f0r(a, b) for (long long a = 0; a < (b); ++a)
#define f1r(a, b, c) for (long long a = (b); a < (c); ++a)
#define f0rd(a, b) for (long long a = (b); a >= 0; --a)
#define f1rd(a, b, c) for (long long a = (b); a >= (c); ... | 0 | 5,211,310 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, k, n) for (int i = k; i < (int)(n); i++)
#define repd(i, n) for (int i = n-1; i >= 0; i--)
#define rrepd(i, k, n) for (int i = n-1; i >= (int)(k); i--)
#define all(x) (x).begin(),(x).end()
#define chmax(x,... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cerr << #x << " = " << x << endl;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FOR(it, b, e) for (typeof(b) it = (b); it != (e); ++it)
#define MSET(c, v) memset(c, v, sizeof(c))
const int INF = ... | 0 | 45,465,048 |
#include <stdio.h>
#include <ctype.h>
int main(void) {
char c;
do {
scanf("%c", &c);
if (isupper(c)) {
c = c - 'A' + 'a';
} else if (islower(c)) {
c = c - 'a' + 'A';
}
printf("%c", c);
} while (c != '\n');
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << end... | 0 | 41,583,572 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
const int MOD=1000000007;
const int INF= int(1e9);
const int MAX =1007;
string a,b;
int n,m;
int dp[MAX][MAX];
int solve ( int n,int m) {
if(dp[n][m] != -1) {
retu... | #include <bits/stdc++.h>
using namespace std;
int main(void){
while (true){
int m,a,b;
cin >> m >> a >> b;
if (m==0 && a==0 && b==0) break;
vector<int> n(m);
for (int i=0;i<m;i++){
cin >> n.at(i);
}
int u=0,ans=0;
for (int i=a-1;i<b;i++){
... | 0 | 1,416,757 |
#include <bits/stdc++.h>
using namespace std;
int n, ai;
int main(){
scanf("%d", &n);
long long res = 0, sum = 0;
map <long long, int> cnt;
cnt[0]++;
for(int i = 0; i < n; i++){
scanf("%d", &ai);
sum += ai;
res += cnt[sum];
cnt[sum]++;
}
printf("%lld\n", res);
return 0;
} | #include <bits/stdc++.h>
#include <ext/rope>
#define VALHALLA cin.tie(0);ios_base::sync_with_stdio(false);cout<<fixed<<setprecision(13);cerr<<fixed<<setprecision(5);
#define endl "\n"
#define pb push_back
#define all(v) v.begin(),v.end()
#define debug(x) std::cerr << #x << ": " << (x) << '\n';
#define sz(x) (int)x.size... | 0 | 34,112,318 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define MAX 10000
using namespace std;
typedef long long ll;
int mod = 1000000007;
ll dp[100005];;
ll gcd(long long a,long long b){
if(b == 0)
return a;
else return gcd(b,a%b);
}
bool compare(pair<int,int>p1, pair<int,int>p2){
return p1.... | #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, M, X; cin >> N >> M >> X;
vi c... | 0 | 59,573,877 |
#ifndef CLion
#endif
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define F first
#define S second
#define pb push_back
#define ll long long
#define all(x) x.begin() , x.end()
#define rep(i,s,e) for (int i = s; i < e; ++i)
#define rev(i,s,e) for (int i = s; i >... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define Graph vector<vector<int>>
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1000000007;
int main(){
ll N;
cin >> N;
vector<ll> A(N), digit(64, 0);
re... | 0 | 6,818,584 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const long double PI = acos(-1);
#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 MOD = 1000000007;
ll fact(ll m) {
if(m == 0 || m == 1) return 1LL;
else retur... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i, s, n) for (int i = s; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool ch... | 0 | 81,505,508 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin, (x).end()
int main(){
int x,a; cin>>x>>a;
if(x>=a)cout<<10<<endl;
else cout<<0<<endl;
return 0;
} | #include <iostream>
#include <iomanip>
#include <map>
#include <set>
#include <utility>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <numeri... | 0 | 1,331,360 |
#include <bits/stdc++.h>
using namespace std;
#define forn for (ll i = 0; i < n; i++)
#define form for (ll j = 0; j < m; j++)
#define NO cout << "NO\n";
#define YES cout << "YES\n";
#define pb push_back
#define mp make_pair
#define rep(i,a,b) for (ll i = a; i < b; i++)
typedef long long ll;
typedef vector<ll> vi;
typed... | #include "bits/stdc++.h"
using namespace std;
bool judge(const vector<vector<bool>>& picture) {
int H = picture.size();
int W = picture.front().size();
}
void Main() {
int H, W;
cin >> H >> W;
vector<vector<bool>> picture(H, vector<bool>(W, false));
for (int i = 0; i < H; ++i) {
string s... | 0 | 93,715,604 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <bitset>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ty... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define setbits(x) __builtin_popcountll(x)
#define zerobits(x) __builtin_ctzll(x)
#define deb(x) cout << #x << " -> " << x << "\n"
template<class T> bool uin(T a, T b) ... | 0 | 99,996,249 |
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <map>
#include <utility>
#include <limits.h>
#include <bitset>
#include <set>
using namespace std;
#define LL long l... | #include<bits/stdc++.h>
using namespace std;
int main(){
int H,W;
cin>>H>>W;
vector<vector<char>>A(H,vector<char>(W));
for(int i=0;i<H;i++){
string s;
cin>>s;
for(int j=0;j<W;j++)
A.at(i).at(j)=s.at(j);
}vector<vector<int>>B(H,vector<int>(W,0));
for(int i=0;i<H;i++){
int sum=0;
for(i... | 0 | 90,150,705 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
string s,t;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
vector<int> vec(26, 0);
cin >> str;
if (str == "zyxwvutsrqponmlkjihgfedcba") {
cout << -1;
} else if (str.size() == 26) {
string tmp = str;
next_permutation(str.begin(), str.end());
string kekka = ... | 0 | 52,013,409 |
#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;
ll n, k;
ll a[15];
string d[10005];
bool v[10005];
ll b[15] = {0, 2, 5, 5, 4, 5, 6, 3, 7, 6};
bool f(string p, string q)
{
if(p.size() != q.size()) return p.size() < q.size();
else return p < q;
}
int main()
{
scanf("%lld%lld",... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | 0 | 20,022,932 |
#include <iostream>
int main()
{int A, B, C, K, c{}; std::cin >> A >> B >> C >> K;
for (; A >= B; ++c) B *= 2; for (; B >= C; ++c) C *= 2;
puts(c <= K ? "Yes" : "No");} | #include <bits/stdc++.h>
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);
#define ADD +
#define SUBTRACT -
#define MULTIPLY *
#define DIVIDE /
#define MOD %
#define INCREMENT(x) ++x
#define DECREMENT(x) --x
#define in(a,b) cin>>a>>b;
#define out(a,b) cout<<a<<endl<<b<<endl;
#define scan(a) scanf("%d",&a);
#define... | 0 | 30,028,727 |
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define all(v) v.begin(), v.end()
#define FILL(a, x) memset(a, x, sizeof(a))
#define ll long lon... | #pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitse... | 0 | 72,082,435 |
#include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allo... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
int main() {
string S, T;
cin >> S >> T;
vector<vector<int>> _s(30), _t(30);
REP(i, S.size()) {
_s[S[i] - 'a'].push_back(i);
_t[T[i] - 'a'].push_back(i);
}... | 0 | 2,784,735 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s, t;
cin >> s >> t;
vector<string> ans;
for (int i = 0; i < s.size() - (t.size() - 1); i++) {
string temp = s;
int count = 0;
bool flag = true;
for (int j = 0; j < t.size(); j++) {
if (i + count < s.si... | #include <ios>
#include <iostream>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
int n, i, j, k, m, c = 0, a[100] = {};
cin >> n;
for(i = 0; i < n; ++i)
cin >> a[i];
for(i = 0; i < n; ++i){
m = i;
for(j = i; j < n; ++j){
if( a[j] < a[m] )
m = j;
}
if( m != i ){
k = a[i];
a[i... | 0 | 12,978,979 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
int ans = 0;
vector<int> c(n + 1, 0);
rep(i, m){
int a, b;
cin >> a >> b;
a--;
c[a]++, c[b]--;
}
rep(i, n){
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
vector<long long> V(N);
for(int i=0; i<N; i++) cin >> V[i];
int ans=0;
for(int i=0; i<=K; i++){
for(int j=0; j<=K-i; j++){
if(i+j>N) continue;
vector<long long> S;
int res=0;
for(int k=0; k<i; k++){... | 0 | 29,740,332 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
int main() {
string S; cin >> S;
vector<int> N;
rep(i,S.size()) {
int cnt = 1;
int j = i + 1;
while (j < S.size() && S[i] == S[j]) j++, cnt++;
N.push_back... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using stkll = vector<pll>;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#de... | 0 | 89,766,350 |
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main(){
ll x, t;
cin >> x >> t;
cout << m... | #include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
using namespace std;
#define INF 100000000
typedef... | 0 | 94,356,843 |
#include <iostream>
#include <array>
#include <string>
using namespace std;
int main(){
int n;
while(cin >> n,n){
bool l = false,r = false;
bool t = true;
int ret = 0;
for(int i=0;i<n;i++){
string s;
cin >> s;
if(s == "ru") r = true;
if(s == "rd") r = false;
if(s == "lu") l = true;
if(s == "... | #include <bits/stdc++.h>
using namespace std;
#define MAXN 100001
const int M = int(1e9) + 7;
int N, K, cnt[MAXN], ans;
int mpow(int a, int p) {
int res = 1, sqr = a;
while (p) {
if (p & 1) res = ((int64_t)res * sqr) % M;
p >>= 1;
sqr = ((int64_t)sqr * sqr) % M;
}
return res;
}
i... | 0 | 13,206,685 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,ini,n) for(int i=ini;i<n;i++)
#define _rep(i,ini,n) for(int i=ini;i>=n;i--)
#define ToEnd(a) a.begin(),a.end()
uint64_t MOD=1000000007;
int main(){
int N; cin>>N;
vector<int64_t> A(N);
rep(n,0,N) cin>>A.at(n);
int64_t ans=0;
rep(i,0,N){
... | #include<bits/stdc++.h>
#define poi 601000
using namespace std;
typedef long long ll;
struct girl
{
int x,y;
bool operator<(const girl &b)const
{
return (x^b.x)?x<b.x:y<b.y;
}
}a[poi];
int b[poi],ans,h,w,n,tans;
set<pair<int,int> > s;
inline int re()
{
char x=getchar();
int k=1,y=0;
while(x<'0'||x>'9')
{if(x... | 0 | 13,700,601 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
ll A, B, K;
cin >> A >> B >> K;
ll tmp = A;
A = max(A - K, 0LL);
... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | 0 | 79,666,611 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <vector>
#include <climits>
#include <queue>
#include <utility>
#include <iomanip>
#include <sstream>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
ll inf=(ll)1E18;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a... | 0 | 40,796,707 |
#include <algorithm>
#include <iostream>
struct Card {
char suit;
unsigned int rank;
Card() = default;
Card(const Card&) = default;
Card& operator=(const Card&) = default;
bool operator!=(const Card& rhs) const { return rank != rhs.rank || suit != rhs.suit; }
bool operator<(const Card& rhs) const { return... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | 0 | 85,228,407 |
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<bitset>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<queue>
#include<vector>
using namespa... | #include <bits/stdc++.h>
using namespace std;
using str = string;
using ll = long long;
int a[500010];
int main()
{
cin.tie(0);
ios::sync_with_stdio(0);
str s;
cin>>s;
int n=s.size()+1;
int nn=0;
int sn=0;
int mn=0;
for(int i=0;i<s.size();i++)
{
if(s[i]=='<')nn++;
... | 0 | 13,675,160 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | 0 | 18,475,851 |
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <map>
#include <queue>
#define rep(i,n) for (int i=0;i<(n);i++)
using namespace std;
int main() {
int n, k, r, s, p;
string t;
cin >> n >> k >> r >> s >>... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using pll=pair<ll,ll>;
using plll=pair<ll,pll>;
using graph=vector<vector<int>>;
using wgraph=vector<vector<pll>>;
const ll MOD=1000000007;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
ll abs1(ll a){
if(a>=0)return a;
... | 0 | 40,197,005 |
#include <iostream>
#include <iomanip>
#include <cmath>
#include <vector>
#include <queue>
#include <limits>
#include <algorithm>
#include <string>
#include <cstring>
#include <map>
using namespace std;
typedef long long ll;
class union_find_tree
{
private:
int N;
vector<int> parents, rank, node_cnt;
public:
void in... | #include<stdio.h>
#include<iostream>
using namespace std;
int selectinsert(int A[], int n){
int i,j,minv;
int sw=0;
for ( i = 0;i<n-1;i++){
minv=i;
for (j=i;n>j;j++){
if(A[minv]>A[j]){
minv=j;
}
}
swap(A[i],A[minv]);
if(i != minv){
sw +=1;
}
}
... | 0 | 63,979,466 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
using Graph = vector<vector<int> >;
using GraphC = vector<vector<char> >;
const int INF = 100000000;
typedef pair<int, int> P;
const int MAX_N = 1000000;
int main() {
int A, B, C, D, E;
int tmp,div,ans=0,buf=0;
rep(i, 5) {
cin... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
constexpr int INF = (1<<29);
using ll = long long;
using pii = pair<int,int>;
struct edge{
int to,cost;
edge(int to, int cost) : to(to), cost(cost) {}
};
int main(){
int k... | 0 | 74,221,872 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x ,n) for(int i = x; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main(){
int n;
cin >> n;
double x[n];
str... | #include <bits/stdc++.h>
using namespace std;
#define M 1046527
#define NIL (-1)
#define L 14
int getChar(char ch);
long long getKey(char[]);
int h1(int);
int h2(int);
int find(char[]);
int insert(char str[]);
char H[M][L];
int main(){
int i,n,h;
char str[L],com[9];
for(i = 0; i < M; i++){
H[i][0] = '\0';
}... | 0 | 8,893,131 |
#include <iostream>
#include <stdio.h>
#include <fstream>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <limits.h>
#include <math.h>
#include <functional>
#include <bitset>
#define repeat(i,n) for (long long i = 0; (i) < (n); ++ (i))
#d... | #include <iostream>
#include <string>
#include <math.h>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <set>
#include <queue>
#include <deque>
#include <map>
#include <stack>
#include <cmath>
using namespace std;
#define mod 1000000007
#define ten5 100005
#define ten52 200005
#define ten53 300005
#d... | 0 | 3,234,412 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int K, A, B;
cin >> K;
cin >> A >> B;
for (int i = 0; i <= (B - A); i++)
{
if ((A + i) % K == 0)
{
cout << "OK" << endl;
break;
}
else if ((A + i) % K != 0)
{
if (i ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve(long long N, long long A, long long B, std::vector<long long> P)
{
ll one = 0, two = 0, three = 0;
for (auto p : P) {
if (p <= A) {
one++;
} else if (A < p && p <= B) {
two++;
} else {
... | 0 | 76,717,320 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
int a,b,ans=... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define pll pair<long,long>
#define vi vector<int>
#define vll vector<ll>
#define vii vector<pii>
#define mi map<int,int>
#define mii ... | 0 | 42,322,053 |
#include <bits/stdc++.h>
#include <string>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
long long gcd(long long a, long long b) {
if (b == 0) {
return a;
}
else {
return gcd(b, a % b);
}
}
long long lcm2(long long a, lon... | #include <iostream>
#include <string>
#include <cmath>
using namespace std;
int main(void){
long long int N,H,W,i,j,k,ans,count,cost,tmp;
long long int S[200010];
long long int Ssum[200010];
string T;
bool flag;
count=0;
ans=std::pow(10,18);
flag=false;
cin >>N>>H;
if (N>H){
... | 0 | 41,458,647 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
string s;
ll k;
cin>>s>>k;
int i=0;
while(i<s.size() && s[i]=='1'){
i++;
}
if(k<=i){
cout<<'1'<<endl;
}
else{
cout<<s[i]<<endl;
}... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin(... | 0 | 11,075,939 |
#include <bits/stdc++.h>
#define int long long
#pragma GCC optimize("O3")
#define fi first
#define se second
#define em emplace
#define eb emplace_back
#define mp make_pair
#define pi pair<int,int>
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define e... | #include <cstdio>
#include <iostream>
using namespace std;
int main(){
int n, x;
while(1){
cin >> n >> x;
if (n == 0 && x == 0) break;
int cnt = 0;
for(int i = 1; i <= n; i++){
for(int j = i+1; j <= n; j++){
for(int k = j+1; k <= n; k++){
... | 0 | 18,869,158 |
#include<iostream>
#include <stdio.h>
#include <math.h>
using namespace std;
bool num[1000000] = { false };
void primNumberCheck(){
num[2] = true;
int i, j, k;
for (i = 3; i <= 1000000; i += 2)
{
k = 0;
for (j = 3; j <= sqrt((double)i); j += 2)
{
if (i%j == 0)
... | #include <bits/stdc++.h>
#define MOD 1000000007
#define ll long long
#define ull unsigned long long
#define ld long double
#define uint unsigned int
#define endl '\n'
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pll pair<long long ,long long >
#defin... | 0 | 69,071,769 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rng(a) a.begin(),a.end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int x, a;
cin >> x >> a;
cout << (x<a? "0":"10") << endl;
return 0;
} | #include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<sstream>
#include<numeric>
#include<cassert>
#define f first
#define s second
#define mp make_pair
#define RE... | 0 | 9,384,104 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
const ll mod = 1e9+7... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n;
ll a[200002];
int main(){
cin >> n;
for(ll i=0;i<n;i++) cin >> a[i];
ll res=0;
ll right=0;
ll sum=0;
for(ll left=0;left<n;left++){
while(right<n&&(sum^a[right])==(sum+a[right])){
sum+=a[right];
... | 0 | 10,972,652 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | #include <algorithm>
#include <iostream>
#include <vector>
#include <functional>
#include <string>
#include <cmath>
#include <iomanip>
using namespace std;
int main(){
int n ; cin >> n;
int m;
int count=0;
int odd=0;
while(n){
m=n;
count=0;
while(m){
count++;
... | 0 | 20,266,981 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
ll a,b,k;
cin >> a >> b >> k;
ll mini = min(a,k);
a = a - mini;
k = k - mini;
b = b - min(b,k);
cout << a << " " << b << endl;
return 0 ;
} | #include <bits/stdc++.h>
#define show(x) std::cerr << #x << " = " << x << std::endl
using ll = long long;
using ld = long double;
constexpr ll MOD = 1000000007LL;
template <typename T>
constexpr T INF = std::numeric_limits<T>::max() / 10;
std::mt19937 mt{std::random_device{}()};
int main()
{
int N;
std::cin >> ... | 0 | 1,749,386 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vout(x) rep(i,x.size()) cout << x[i] << " "
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return... | #include<iostream>
#include<vector>
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, s;
cin >> k >> s;
int x=0,y=0,z=0;
int cnt=0;
for (int x = 0; x <=k ; x++) {
for(int y=0;y<=k; y++){
z=s-x-y;
if (z>=0 && z<=k){
cnt++;
}
... | 0 | 12,715,841 |
#include <iostream>
#include <string>
std::string s;
std::string t;
int main() {
std::cin >> s >> t;
std::cout << t + s;
} | #include <iostream>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <bitset>
#include <algorithm>
#include <cmath>
#include <tuple>
#include <climits>
#include <stdlib.h>
#include <queue>
#include <stack>
#define mp make_pair
#define pb push_back
#define forn(n... | 0 | 6,684,772 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#include<ext/pb_ds/detail/standard_policies.hpp>
#define pi acos(-1)
#define pb push_back
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define MAX 300005
#define INF 0x3f3f3f3f
tem... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define pdi pair<db,int>
#define mp make_pair
#define pb push_back
#define enter putchar('\n')
#define space putchar(' ')
#define eps 1e-8
#define mo 974711
#define MAXN 100005
using namespace std;
typedef long long int64;
typedef dou... | 0 | 17,455,955 |
#include<iostream>
#include<cmath>
#include<string>
#include<cctype>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int a,b,c,t;
scanf("%d %d %d",&a,&b,&c);
for(;;){
if(a<=b && b<=c){
break;
}
if(a>b){... | #include"bits/stdc++.h"
using namespace std;
using ll = int64_t;
int main() {
ll N;
cin >> N;
for (ll i = 1; i * (i + 1) / 2 <= N; i++) {
if (i * (i + 1) / 2 == N) {
cout << "Yes" << endl;
cout << i + 1 << endl;
vector<vector<ll>> ans(i + 1);
ll num = ... | 0 | 57,858,287 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main (){
ll A;
double B;
cin >> A >> B;
B *= 100;
B += 0.5;
ll b = B;
cout << A*b/100 << endl;
} | #include <cstdio>
int A[100 + 10], N;
int count;
void selectionSort(int A[], int N);
void swap(int& a, int& b);
void trace(int A[], int N);
int main() {
scanf("%d", &N);
for (int i = 0; i < N; ++i) { scanf("%d", &A[i]); }
selectionSort(A, N);
trace(A, N);
printf("%d\n", count);
return 0;
}
void selectionSor... | 0 | 52,117,856 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double score;
double leate;
cin >> score >> leate;
cout << ceil((score + leate) / 2) << endl;
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0;}
int ... | 0 | 100,700,619 |
#include<queue>
#include<cstdio>
#include<iostream>
using namespace std;
int main()
{
int n;
int b[300], f[300], r[300], v[300];
int building[4][3][10] = { 0 };
cin >> n;
for (int i = 0; i < n; i++)
cin >> b[i] >> f[i] >> r[i] >> v[i];
for (int i = 0; i < n; i++)
{
switch (b[i])
{
case 1:
building[0][... | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
ll N, M, ans=0, tmp=0;
priority_queue<ll> job[100005];
priority_queue<pair<ll,ll>> PQ;
signed main(){
cin >> N >> M;
for(int i=0;i<N;i++) {
ll a, b;
cin >> a >> b;
job[a].pus... | 0 | 44,014,902 |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
#include<cassert>
using namespace std;
int inf = 1000000000;
int main(void) {
string s;
getline(cin, s);
s +... | #include <iostream>
#include <vector>
using namespace std;
typedef long long int ll;
const ll N = 2 * 1e5, MOD = 1e9 + 7;
vector <int> edges[N], children[N];
ll dp[N][2];
ll numberOfWays(ll curr, int parentColor) {
if (dp[curr][parentColor])
return dp[curr][parentColor];
ll ans = 0, localAns = 1;
for (int i =... | 0 | 34,047,174 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <climits>
using namespace std;
int n, m, x;
int c[12], a[12][12];
int main()
{
cin >> n >> m >> x;
for (int i = 0; i < n; i++) {
cin >> c[i];
for (int j = 0; j < m; j++) {
cin >> a[... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define ii pair<int,int>
#define Max 100000+5
#define IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define f first
#define s second
#define pb push_back
int mo... | 0 | 17,024,868 |
#include<algorithm>
#include<complex>
#include<ctype.h>
#include<iomanip>
#include<iostream>
#include<map>
#include<math.h>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<stdio.h>
#include<string>
#include<string>
#include<vector>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) f... | #include "bits/stdc++.h"
using namespace std;
#define EACH(i,a) for (auto&& i : a)
#define FOR(i,a,b) for(int i=(int)a;i<(int)b;++i)
#define RFOR(i,a,b) for(int i=(int)b-1;i>=(int)a;--i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RREP(i,n) RFOR(i,0,n)
#define RREPS(i,n) RFOR(i,1,n+1)
#define ALL... | 0 | 62,546,454 |
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define ll long long
#define int long long
#define inf ((ll)1e18)
#define mod 1000000007
#define double long double
#define ull unsigned long long
#define vi vector<ll>
#define ppi ... | #include<bits/stdc++.h>
using namespace std;
#define ALL(v) (v).begin(),(v).end()
#define REP(i,p,n) for(int i=p;i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define SZ(x) ((int)(x).size())
#define debug(x) cerr << #x << ": " << x << '\n'
#define INF 999999999
typedef long long int Int;
typedef pair<int,int> P;
using ll... | 0 | 93,428,263 |
#include <cstdio>
#include <iostream>
#include <cmath>
#include <ctype.h>
#include <string>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <list>
#include <cstring>
#include <stack>
using namespa... | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define inputInt(a) int a; cin >> a;
#define inputInt2(a,b) int a; int b; cin >> a >> b;
#define inputInt3(a,b,c) int a; int b; int c; cin >> a >> b >> c;
#define inputLong(a) long a;cin >> a;
#define inputIntArray(a,N) int a[N];for(int i=0;i<N;i++){ci... | 0 | 12,406,998 |
#include <bits/stdc++.h>
#define INF 2e9
#define MOD 1000000007
#define MOD9 998244353
#define intMAX 51000;
#define PI 3.14159265359
using namespace std;
typedef long long llong;
using Graph = vector<vector<int>>;
int main(){
int a, b;
cin >> a >> b;
if(a < 9 && b < 9) cout << "Yay!" << endl;
else cout << ":("... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ve... | 0 | 61,039,311 |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#... | 0 | 81,577,505 |
#include <cstdio>
#include <iostream>
#include <cmath>
#include <limits>
#include <iomanip>
#include <cstring>
#include <bits/stdc++.h>
#include <string>
#include <algorithm>
using namespace std;
int main() {
long long a, b, c, d;
priority_queue<long long> values;
cin >> a >> b >> c >> d;
values.push(a*c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX =510000;
const int MOD = 1000000007;
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<MAX; i++){
fac[i]=fac[i-1]*i%MOD;
inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD... | 0 | 79,380,136 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <set>
#include <unordered_set>
#include <bitset>
using namespace std;
using ll = long... | #include <bits/stdc++.h>
using namespace std;
static const int MAX = 3600*24+60*60+60;
int main(){
while(1){
int N;
cin>>N;
if(N == 0) break;
vector<int> V(MAX,0);
for(int i=0; i<N; i++){
int h1,h2,m1,m2,s1,s2;
scanf("%d:%d:%d",&h1,&m1,&s1);
... | 0 | 40,906,308 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i,n) for(ll i=0;i<n;i++)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool chmax(T &a, T b){i... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
ll c[300005]={0};
ll d[300005]={0};
ll dsum[300005]={0},dksum[300005]={0};
signed main(){
ll n;
cin>>n;
for(int i=0;i<n;i++){
ll a;
cin>>a;
c[a]++;
}
for(int i=1;i<=n;i++) d[c[i]]++;
for(int i=1;i<=n;i++){
dsum... | 0 | 46,547,241 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
int n,a,b; scanf("%d%d%d",&n,&a,&b);
if(a+b-1>n || 1LL*a*b<n) return puts("-1"),0;
vector<int> ans(n);
int idx=0,num=n;
rep(i,a) ans[idx++]=num+i-a+1;
num-=a;
int m=n-(a+b-1);
for(int i=1;i<b;i++){
int k=min(a-1,... | #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... | 0 | 28,449,128 |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 5, mod = 1e9 + 7;
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n;
cin >> n;
int mx = 2e9, ans = 0;
for(int i = 0; i < n; i++){
int x;
cin >> x;
if(x <= mx){
... | #include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#... | 0 | 4,817,403 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define int long long
signed main() {
int a,b,c,k;
cin >> a >> b >> c >> k;
int odd = (b - a);
int even = (a - b);
if(k % 2 == 0) cout << even << '\n';
else cout << odd << '\n';
} | #include <bits/stdc++.h>
using namespace std;
#define elif else if
typedef long long ll;
typedef unsigned long long ull;
#define DEBUG(x) cout << (x) << endl
#define MODULE 1000000007
int n, k;
int arr[200005] = {0};
int ans = 0;
map<int, int> record;
ll cnt[200005] = {0};
void dfs(int pos)
{
if (pos == n)
{
... | 0 | 18,862,804 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
vector<string> options = {"dream", "dreamer", "erase", "eraser"};
stack<int> DFS;
DFS.push(0);
bool divisible = false;
while (!DFS.empty()) {
int t = DFS.top();
DFS.pop();
if (t == s.size()) {
divisible = ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define per(i,n) for(int i = (n)-1; i >= 0; --i)
#define rng(i,a,b) for(int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int main() {
int... | 0 | 53,705,674 |
#include <iostream>
#include <map>
#include <vector>
#define rep(i,n) for(int (i)=0;(i)<(n);++(i))
using namespace std;
using ll = long long;
int main() {
int n;
ll m;
cin >> n >> m;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<ll> s(n + 1, 0);
rep(i, n) s[i + 1] = s[i] + a[i];
map<ll,... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
long long N, A[1 << 17], dp[1 << 17]; vector<pair<long long, long long>> vec, G; vector<int> X[1 << 17];
long long dist[1 << 17], par[1 << 17], dp2[1 << 17];
void dfs(int pos, int dst) {
dist[pos] = dst; dp2[pos] = 1;
for (int i = 0; i < ... | 0 | 97,036,753 |
#include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> A(N);
vector<int> num(100000);
for(int i=0;i<N;i++){
cin >> A.at(i);
num.at(A.at(i))++;
}
int max_ans=0;
for(int i=0;i<100000;i++){
int ans;
if(i==0){
ans=num.at(0)+num.at(1);
}
else if(i=... | 0 | 4,219,152 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using P = pair<string,int>;
const double PI = acos(-1);
ll gcd(int x, int y){
int r;
while(true){
r = x%y;
if(r == 0){
return y;
}
x = y;
y = r;
}
}
int main() {
ll ... | #include <bits/stdc++.h>
#define pb push_back
#define pi acos(-1.0)
#define loop(i,a,n) for(int i=a;i<n;i++)
#define rloop(i,n,a) for(int i=n;i>=a;i--)
#define ll long long int
#define ff first
#define ss second
#define pii pair<ll,ll>
... | 0 | 70,546,374 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define int ll
typedef pair<int,int> pii;
#define fi first
#define se second
#define Sort(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; i++)
#define REP(i,n) for(int i = 0;i < (n) ; i++)
#define MP(a,b) m... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb push_back
#define INF (1e9+1)
int main(){
int n;
cin>>n;
rep(i,n){
string s,t;
cin>>s>>t;
int dp[... | 0 | 16,643,819 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
if(a>b){
swap(a,b);
}
if(b>c){
swap(b,c);
}
if(a>b){
swap(a,b);
}
cout<<c*10+a+b;
} | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int N, M;
while(cin >> N >> M && (N|M)) {
vector<pair<int, int> > vec;
int expect = 0;
for(int i=0; i<N; i++) {
int d, p;
cin >> d >> p;
vec.push_back(make_pair(p, d));
expect += d * p;
... | 0 | 19,403,096 |
#include <iostream>
#include <algorithm>
#include <math.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <utility>
#include <iomanip>
using namespace std;
using ll = long long;
#define rep(i,a,b) for(int i=(a); i<(b); i++)
#define YES cout << "YES" << endl;
#define NO cout << "NO" << en... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(v) v.begin(),v.end()
#define mem(arr) memset(arr, 0, sizeof(arr))
#define ff first
#define ss second
#define int long long int
const int MOD = 1e9 + 7;
const int INF = 1e18;
const int N = 1e6 + 20;
vector<int> g[N];
vector<int> vis(N);
int po... | 0 | 90,902,731 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
const int INF = 1001001001;
int main(){
while(true){
int n, k... | #include<bits/stdc++.h>
#include<ctype.h>
# define pb push_back
#define fst first
#define sec second
#define For(i,a,b) for(int i=a;i<b;i++)
#define ll unsigned long long int
#define ull unsigned long long int
#define mod 1000000007
#define fo(i,n) for(ll i=0;i<n;i++)
#define endl "\n"
#define rev(i,n) for(ll i=n-1;i>=... | 0 | 100,750,114 |
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main() {
string s, t;
cin >> s;
cin >> t;
if(s==t){
cout << "Yes\n";
}
else{
int len = s.size();
int i;
bool ok = false;
for(i=0; i<len; i++){
s = s.back() + s.sub... | #include "bits/stdc++.h"
using namespace std;
#define ASC(vec) vec.begin(), vec.end()
#define DESC(vec) vec.rbegin(), vec.rend()
#define rep(i, n) for(int i = 0; i < (n); i++)
#define Rep(i, n) for(int i = 1; i < n; i++)
const int mod = 1000000007;
const int inf = (int)1e9 + 7;
const long long INF = 1LL << 60;
using... | 0 | 21,924,919 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.