code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include<bits/stdc++.h>
#define ll long long
#define fixed cout.setf(ios::fixed);
#define rep1 for( i=0; i<n; i++)
#define Precise cout.precision(7);
using namespace std;
int main()
{
ll n,a[32]={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
cin>>n;
... | #include<stdio.h>
int main()
{
int n;
scanf("%d",&n);
if(n == 1){
printf("1\n");
}
else if(n == 2){
printf("1\n");
}
else if(n == 3){
printf("1\n");
}
else if(n == 4){
printf("2\n");
}
else if(n == 5){
printf("1\n");
}
else ... | 1 | 100,027,315 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
long long cnt=0;
cin >> n;
vector<int> a(n+1);
vector<int> b(n);
for(int i=0;i<n+1;i++){
cin >> a[i];
}
for(int i=0;i<n;i++){
cin >> b[i];
}
for(int i=0;i<n;++i){
int c = min(a[i],b[i]);
cnt += c;
a[i] -= c;
b[i] -= c;
int d = min(a... | #include <bits/stdc++.h>
using namespace std;
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { os << "["; for (int i = 0; i < v.size(); ++i) { os << v[i]; if (i != v.size() - 1) os << ", "; } os << "]"; return os; }
template <typename T> void print(T v, string s = "\n") { cout << ... | 1 | 6,690,978 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(long long i=0;i<int(N);++i)
using ll = long long;
const int INF = 2147483647;
const ll MOD = 1e9+7;
int main() {
string s; cin >> s;
ll k; cin >> k;
char ans;
bool flag = true;
rep(i,s.size()){
if(s[i]!='1')
flag = false;
if(i==k-1) brea... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
string S;
ll K;
int b = 0;
cin >> S >> K;
int N[S.size()];
rep(i, S.size()){
N[i] = (int)(S[i] - '0');
}
rep(i, S.size()){
if(N[i] == 1){
K--;
}els... | 1 | 3,413,823 |
#include "iostream"
#include "algorithm"
#include "string"
#include "vector"
#include "cmath"
#include "bitset"
#include "queue"
#include "functional"
#include "map"
#include "unordered_map"
#include "set"
#include "stack"
#define lp(n) for (int i = 0; i < n; i++)
#define LP(n,i) for (int i = 0; i < n; i++)
#define mod... | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_... | 1 | 23,432,306 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>;
usi... | #include <bits/stdc++.h>
using namespace std;
int ctoi(char a)
{
return a-'0';
}
int itoc(int n)
{
return '0'+n;
}
int main(void)
{
int k;
cin >> k;
string s = "1";
int count = 0;
for (int i = 1; i < k; i++) {
if (s.size() == 1) {
if (ctoi(s.back()+1)== 10) {
s[0] = '0';
s.insert(s.begin(), '1');
... | 1 | 40,477,170 |
#include <bits/stdc++.h>
using namespace std;
int64_t calc_partial_sum(int n, int k, const vector<int> &a_vec)
{
int64_t s = 0;
int64_t max_s = 0;
for (int i = 0; i < k; ++i)
s += a_vec.at(i);
max_s = s;
for (int i = k; i < n; ++i) {
s += a_vec.at(i) - a_vec.at(i - k);
if (max_s < s)
max_s = s;
}
return... | #include<stdio.h>
int MAX(int *num,int n,int k){
int i,now,max = 0;
for(i = 0;i < k;i++){
max += num[i];
}
now = max;
for(i = 0;i < n-k;i++){
now += num[i+k]-num[i];
if(max < now)
max = now;
}
return max;
}
int main(){
int n,k,max;
int *num;
int i;
while(1){
scanf("%d%d",&n,&k);
if(n == 0 && k =... | 1 | 31,507,486 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size()... | #include <bits/stdc++.h>
int main(){std::string s;std::cin>>s;std::cout<<(s.substr(0,4)=="YAKI"?"Yes":"No")<<"\n";} | 1 | 57,315,928 |
#include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#in... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
vector <int> adj[N];
int dfs(int u, int p) {
int x = 0;
for(int v: adj[u]) if(v ^ p) {
x ^= (1 + dfs(v, u));
}
return x;
}
int32_t main() {
ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n; cin >> n;
for(int i = 1; i < n; i++) {... | 1 | 54,794,967 |
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define REP(i,a,n) for(int i = a;i < (n);i++)
#define rep(i,n) for(int i = 0;i < (n);i++)
#define all(s) s.begin(), s.end()
#define rall(s) s.rbegin(), s.rend()
#define range(x,min,max) ((min) <= (x) && (x) <= (max))
#define xyrange(x, minX, maxX, y, mi... | #include<iostream>
#include<string>
using namespace std;
int main(){
string N;
int a=0,b=0,t;
while(cin>>N){
if(N=="#"){
break;
}
for(int i=0;i<N.size();i++){
if(N[i]=='q'||N[i]=='w'||N[i]=='e'||N[i]=='r'||N[i]=='t'||N[i]=='a'||N[i]=='s'||N[i]=='d'||N[i]=='f'||N[i]=='g'||N[i]=='z'||N[i]=='x'... | 1 | 17,284,050 |
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <set>
#include <cstring>
#include <cmath>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, k, n) for (int i = (int)(k); i < (int)(n); i++)
#define rrep(i, n) for (int i = (int... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
ll dp[1001][1001];
int main()
{
string s,t;
cin >> s >> t;
int n = s.size(),m = t.size();
for(int i = 0;i<n+1;i++)
{
dp[i][0] = i;
}
for(int i = 0;i<m+1;i++)
{
dp[0][i] = i;
}
for(int i = 1;i<n+1;i++)
{
for(int j = 1;j<m+1;j++)
{
i... | 1 | 95,440,862 |
#include<bits/stdc++.h>
using namespace std;
int main( void )
{
int N;
cin >> N;
vector<int> a( N );
int point = 0;
bool can = false;
int count = 0;
for( int i = 0; i < N; i++ )
cin >> a.at( i );
for( int i = 0; i < N; i++ ) {
point = a.at( point ) - 1;
count++;
if( point == 1 ) {
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<int> vec(N);
for(int i=0;i<N;i++){
cin>>vec.at(i);
}
int a=1;
for(int i=1;i<N;i++){
a=vec.at(a-1);
if(a==2){
cout<<i<<endl;
return 0;
}
}
cout<<-1<<endl;
} | 1 | 58,509,195 |
#include <iostream>
void bubble_sort(int l[], int N)
{
for(int i = 0; i < N; i++)
{
for(int k = i + 1; k < N; k++)
{
if(l[i] < l[k])
{
int temp = l[i];
l[i] = l[k];
l[k] = temp;
}
}
}
}
int main()
{
int N, K, l[50], length = 0;
std::cin >> N >> K;
for(in... | #include <bits/stdc++.h>
#define rep(i,a,n) for (int i=a; i<n; i++)
#define ll long long
#define MOD 1000000007
using namespace std;;
int main() {
int N,K,ans =0; cin >> N >> K;
int l[N]; rep(i,0,N) cin >> l[i];
sort(l,l+N);
rep(i,0,K) ans += l[N-i-1];
cout << ans << endl;
} | 1 | 68,963,690 |
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define debug freopen("in.txt","r",stdin),freopen("out.txt","w",stdout);
#define pb push_back
#define all(x) x.begin(),x.end()
#define fs first
#define sc second
using namespace std;... | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
lli x, y, a, b, c;
int main(void){
... | 1 | 27,343,943 |
#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()
int main()
{
string a, b;
cin >> a >> b;
reverse(all(a));
cout << ((a == b) ? "YES" : "NO") << e... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll=long long;
using P = pair<int,int>;
int main(){
string a,b;
cin >> a >> b;
if(a[0]==b[2]&&a[1]==b[1]&&a[2]==b[0])cout << "YES" << endl;
else cout << "NO" << endl;
} | 1 | 94,296,478 |
#include <iostream>
int sign(double x);
int main()
{
double x1, y1, x2, y2, x3, y3;
double xp, yp;
while (std::cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> xp >> yp) {
double vec12_x_vec1p = (x2 - x1) * (yp - y1) - (y2 - y1) * (xp - x1);
double vec23_x_vec2p = (x3 - x2) * (yp - y2) - (y3 - y2)... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <cmath>
#include <complex>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cassert>
#include... | 1 | 8,432,180 |
#include<bits/stdc++.h>
using namespace std;
char s[200005];
int f[1<<26];
int main(){
scanf("%s",&s);
int n=strlen(s),td;
for (int i=1;i<(1<<26);i++) f[i]=1000000000;
for (int i=0,zt=0;i<n;i++){
zt^=(1<<(s[i]-'a'));
td=f[zt]+1;
for (int j=0;j<26;j++) td=min(td,f[zt^(1<<j)]+1);
f[zt]=min(f[zt],td);
}
pr... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
#define ll int
int dp[1<<26]={0};
int main(){
string s;
cin>>s;
vector<ll> hs;
ll now_h=0;
ll n=s.length();
for(int i=0;i<n;i++){
ll c=(ll)(s[i]-'a');
now_h^=((ll)1<<c);
hs.push_back(now_h);
}
for(i... | 1 | 17,555,435 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
string s, t;
int z = 0;
cin >> s >> t;
for (int i = 0; i < s.leng... | #include <iostream>
using namespace std;
int main()
{
string s, k; cin >> s >> k;
int num = 0;
for (int i = 0; i < s.size(); i++){
if (s[i] != k[i]){
num++;
}
}
cout << num << endl;
return 0;
} | 1 | 75,851,058 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; --i)
#define FOR(i, n, m) for (int i = m; i < n; i++)
#define INF 1e9
#define ALL(v) v.begin(), v.end()
typedef long long ll;
int main()
{
int N, H, W;
cin >> N >> H >> W;
... | #include <bits/stdc++.h>
using namespace std;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
int main(){
int N, H, W;
scanf("%d %d %d", &N, &H, &W);
int ans = 0;
rep(i, N){
... | 1 | 84,750,827 |
#include<iostream>
using namespace std;
const int size=1e5+5;
const int level = 60;
typedef long long int ll;
ll basis[level];
void add(ll mask)
{
for(int i=level-1;i>=0;i--)
{
if(((mask>>i)&1) == 0)
continue;
if(!basis[i])
{
basis[i] = mask;
return;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MN = 100100;
const int A = 60;
ll w[MN];
ll fr[A];
int main() {
ll n;
cin >> n;
for(int i=0;i<n;i++) {
cin >> w[i];
for(int j=0;j<A;j++) {
if(w[i]&(1LL<<j)) {
fr[j]++;
}
}
}
ll res = 0;
ll tot = 0;
ll ms = 0;
int st = ... | 1 | 6,062,262 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,A,B;
cin >> N;
B = N;
for (int i = 0; i < 9; i++) {
A += N % 10;
N = N / 10;
}
if (B % A == 0) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
} | #include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(void) {
int N;
scanf("%d", &N);
int tmp = N;
int f = 0;
while (tmp > 0) {
f += tmp % 10;
tmp /= 10;
}
printf(N % f == 0 ? "Yes\n" : "No\n");
return 0;
} | 1 | 56,898,440 |
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#define all(a) (a).begin(),(a).end()
#define vecin(a) rep(i,a.size())cin >> a[i]
#define vecout(a) rep(i,a.size()){cout << a[i];cout << (i == a.size() - 1 ? "\n":" ");}
#define rep(i,x) for(int i = 0;i<x;i++)
#define RE... | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
int s;
int m[1000000];
int count=1;
cin >> s;
int a = s;
m[a]++;
while (true)
{
count++;
if (a%2==0)
{
a=a/2;
}else
{
a=3*a+1;
}
if (m[a]==0)
{
m[a]++;
}else... | 1 | 69,566,448 |
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b,... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#include<functional>
#include<unordered_set>
#include<iomanip>
#define rep(i,a) for(int i=(int)0;i<(i... | 1 | 14,972,833 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 10;
int x[maxn], y[maxn], n;
ll cal(ll x) {
return x * (x + 1) / 2;
}
int main() {
scanf("%d",&n);
ll ans = 0;
for (int i = 1; i < n; i++) {
scanf("%d%d",&x[i],&y[i]);
if (x[i] > y[i]) swap(x[i],y[i]);
ans += cal(i);
a... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
ll v = 0, e = 0;
cin >> n;
for (ll i = 1; i <= n; ++i) v += i * (n - i + 1);
for (int i = 0; i < n-1; ++i) {
ll l, r;
cin >> l >> r;
if (l > r) swap(l, r);
e ... | 1 | 57,795,487 |
#include <iostream>
#include <math.h>
using namespace std;
int main(void){
cout.precision(11);
double a,b,x;
cin >>a>>b>>x;
if(x<=a*a*b/2){
cout << 90-180*atan((2*x)/(a*b*b))/acos(-1.0) <<endl;
}
else cout << 90-180*atan((a*a)/(2*a*b-2*x/a))/acos(-1.0)<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { ... | 1 | 47,046,779 |
#include <cstdint>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
static const int32_t null = -1;
struct tree_t {
int32_t parent;
int32_t left_child;
int32_t right_sibling;
tree_t()
{
parent = null;
left_child = null;
right_sibling = null;
}
};
static vector<tree_t>... | #include <bits/stdc++.h>
using namespace std;
#define NIL -1
#define MAX 100000
class node{
public:
int parent;
int left;
int right;
int depth;
node(){
parent = NIL;
left = NIL;
right = NIL;
depth = NIL;
}
};
node T[MAX];
void setDepth(int id, int d){
T[id].depth = d;
if(T[id].left != NI... | 1 | 98,967,968 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a, b;
cin >> a >> b;
for (int i = 0; i<a.size(); i++) {
if (a[i] != b[i]) {
cout << "No";
return 0;
}
}
cout << "Yes";
return 0;
} | #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... | 1 | 50,935,317 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define INF ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
void solve();
clock_t start_time;
double get_current_time() {
return (double)(clock() - start_time) / CLOCKS_PER_SEC;
}
int main() {
ios_base::sync_with_stdio(false);
solve();
}
#define fi first
#define re return
#define s... | 1 | 37,577,643 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int My_Calc(int A,int B,int index){
if(index == 0) return A+B;
else return A-B;
}
bool My_Calc_All(int i,int j,int k,int A,int B,int C,int D){
char s[2]; s[0] = '+'; s[1] = '-';
int sum = 0;
sum += My_Calc(A,B,i);
sum += My_Calc... | #include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <map>
#include <vector>
#include <cmath>
using namespace std;
void c_train_ticket(void) {
string abcd;
int a, b, c, d;
cin >> abcd;
a = abcd[0] - '0';
b = abcd[1] - '0';
c = abcd[2] - '0';
d = abcd[3] - '0';
char op[2] = { '+'... | 1 | 4,530,717 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int LLI;
typedef pair<int, bool> Data;
typedef pair<LLI, Data> Event;
int W;
int H;
LLI ls[2];
LLI cnt[2];
LLI ps[114514];
LLI qs[114514];
vector<Event> es;
int main() {
scanf("%d%d", &H, &W);
ls[0] = H;
ls[1] = W;
for (int i=0; i<H; i++) {
sca... | #include <algorithm>
#include <cstdio>
#include <utility>
using namespace std;
typedef pair<int,int> P;
int W,H;
bool used[200020];
int restx,resty;
P costs[200020];
int main(int argc, const char * argv[]) {
scanf("%d%d", &W,&H);
restx = W+1;
resty = H+1;
for(int i=0;i<W;++i) {
int p;
scanf("%d", &p);
... | 1 | 73,202,593 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll=long long;
int main(){
int k,a,b;
cin>>k>>a>>b;
ll ans=0;
if(k<=a||b-a<=2)ans=k+1;
else{
if(k%2==a%2)ans=a+ll(b-a)*((k-a+1)/2)+1;
else ans=a+ll(b-a)*((k-a+1)/2);
}
cout<<ans<<end... | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long int k,a,b,sum=0;
cin>>k>>a>>b;
long long int tmp=k+1;
if (a<b) {
if (k-(a-1)>=0) {
k-=a-1;
if (k>=2) {
sum+=a+((b-a)*(k/2));
if (k%2!=0) {
sum+=k%2;... | 1 | 40,427,108 |
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int pay;
int change;
int coin;
while (cin >> pay)
{
if(pay == 0) break;
coin = 0;
change = 1000 - pay;
while (change >= 500)
{
coin++;
change -= 500;
}
while (change >= 100)
{
coin++;
change -= 100;
}
while (cha... | #include<iostream>
using namespace std;
int coin[] = {1, 5, 10, 50, 100, 500};
int remain, in;
int main()
{
while(cin >> in, in){
remain = 1000 - in;
int ans = 0;
for(int i = 0; i < 6; i++){
ans += remain / coin[5 - i];
remain %= coin[5 - i];
}
cout << ans << endl;
}
return 0;
} | 1 | 67,519,743 |
#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,... | #include <bits/stdc++.h>
#include <climits>
using namespace std;
int main(){
int N;
string s,t;
cin >> N;
cin >> s >> t;
for(int i = 0;i < N;i++){
if(s.substr(i)==t.substr(0,N-i)){
cout << N + i<<endl;
return 0;
}
}
cout <<s.size() + t.size() <<endl;
... | 1 | 94,174,855 |
#include <stdio.h>
#include <iostream>
#include <string.h>
#include <stdlib.h>
#include <math.h>
using namespace std;
#define L 12
#define M 1046527
#define NIL "Z"
char hash_table[M][L + 1];
int h_1(int num){
return (num * 2 + 1) % (M - 2);
}
int h_2(int num){
return (num * 3 + 1) % (M - 4);
}
int H_k(int num,... | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <set>
#include <string>
using namespace std;
set<string> g;
int main()
{
int n;
cin >> n;
for(int i=0; i<n; i++) {
string a,b;
cin >> a >> b;
if(a == "insert") {
g.insert(b);
} else {
cout << (g.count(b) ? "yes" : "no") << endl;
}
}... | 1 | 57,193,085 |
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
using namespace std;
typedef long long s64;
inline int getint()
{
static char c;
while ((c = getchar()) < '0' || c > '9');
int res = c - '0';
while ((c = getchar()) >= '0' && c <= '9')
res = res * 10 + c - '0';
return ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define llu unsigned long long
#define ld double
#define llu unsigned long long
#define rep(i,x,y) for(int i=int(x);i<int(y);++i)
#define For(i,x,y) for(int i=int(x);i<=int(y);++i)
#define FOr(i,x,y) for(int i=int(x);i>=int(y);--i)
#define pi acos(-1)... | 1 | 80,409,638 |
#include<bits/stdc++.h>
#include<cmath>
#define SZ(x) ((int)x.size())
#include<vector>
#include<set>
#include<map>
#define ll long long
#define lli long long int
#define REP(i,a,b) for(ll i=a;i<b;i++)
#define pb push_back
#include<string>
#include<cctype>
#include<queue>
#define ii pair<int,int>
#include <sstream>
#def... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define nl '\n'
#define vec vector<ll>
#define pr pair<ll,ll>
#define vecp vector< pr >
#define pq priority_queue<ll>
#define pqp priority_queue<pr>
#define ff first
#define ss second
#define f(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)
#d... | 1 | 72,540,677 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> c(n);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
c[a-1]++;
}
sort(c.rbegin(), c.rend());
vector<int> d(n + 1);
int ... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
constexpr char newl = '\n';
constexpr double eps =... | 1 | 67,144,690 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int x, y;
cin >> x >> y;
int ans =INFINITY;
if (y - x > 0) ans = min(ans, y - x);
if (y - (-x) >= 0) ans = min(ans, y - (-x) + 1);
if (-y - x >... | #include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
... | 1 | 13,061,442 |
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include<set>
using namespace std;
int main() {
int a;
cin >> a;
int paid = a*800;
int ret = (a/15)*200;
cout << paid - ret;
cout << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define rrep(i,n) for(int i=1;i<(n);++i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1001001001;
const int mod = 1000000007;
int main() {... | 1 | 8,238,731 |
#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>;
struct Edge {
int to;
ll cost;
Edge(int t, ll c) : to(t), cost(c) { }
};
int main() {
cin.tie(0)->sync_with_stdio(false);
int N; cin >> N;
vector<vector<Edge> > G(N);
... | #include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
typedef long long ll;
using Graph = vector<vector<pair<ll,ll>>>;
const int mod =1e+9+7;
const int dy[4]={0,1,0,-1};
const int dx[4]={1,0,-1,0};
const ll INF=1e10;
int main(){
... | 1 | 19,629,721 |
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"... | #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;}
const Int MAX = 303;
const Int INF = 1e18;
Int dp[MAX][MAX][MAX];
signed main(){
Int n,k;
ci... | 1 | 26,869,942 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define ALL(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int,int>;
using vi = vector<int>;
using vs = vector<string>;
using vb = vector<bool>;
usin... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,int> pli;
typedef pair<int,int> pii;
#define rep(i,a,b) for(ll i=a ; i<b ; i++)
#define qrep(que, ite)... | 1 | 96,913,648 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int x, i = 0; cin >> x;
while(true)
{
i++;
if (x * i % 360 == 0) break;
}
cout << i << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x; cin >> x;
long long g = 360ll / __gcd(1ll * x, 360ll);
cout << g << "\n";
return 0;
} | 1 | 55,418,295 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <math.h>
#include <string>
#include <cctype>
#include <map>
#include <limits>
#include <iomanip>
using namespace std;
const int mod = 1000000007;
#define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0]))
#define ll long long
int... | #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 ALL(c) (c).begin(), (c).end()
#define pb push_back
#define eb emplace_back
using namespace std;
const long long INF = 1LL<<60;
using ll = long long;
using P = pair<int, int>;
#define vi vector<int>
... | 1 | 74,407,123 |
#include<bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a, b, m, mr = INT_MAX, mm = INT_MAX;
cin >> a >> b >> m;
vector<int>r(a, 0), mic(b, 0);
for(int i = 0; i < a; i++) {
cin >> r[i];
mr = min(mr, r[i]);
}
for(int i = 0; i < b;... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,m;
cin>>a>>b>>m;
vector<int> renzi(a);
vector<int> ref(b);
vector<int> total(m);
int saisyo=300000;
for(int i=0;i<a;i++){
cin>>renzi[i];
}
for(int i=0;i<b;i++){
cin>>ref[i];
}
for(int j=0;j<m;j++){
int x,y,c;
cin>>x>>y>>c;
... | 1 | 49,360,042 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
int h[n];
REP(i,n) cin >> h[i];
int m = h[0];
int ans = 0;
REP(i,n) {
if (h[i] >= m) {
ans++;
m = h[i];
}
}
cout << ans << endl;
} | #include<bits/stdc++.h>
#define forr(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define ALL(a) (a.begin()),(a.end())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll, ll> LP;
const ll LINF = 1LL... | 1 | 12,034,836 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int n,m,x,y;
int hantei = 0;
cin >> n >> m >> x >> y;
int X[n],Y[m];
for(int i=0;i<n;i++){
cin >> X[i];
if(X[i] >= y){
hantei = 1;
break;
}
}
for(int i=0;i<m;i++){
cin >> Y[i... | #include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define be begin
#define en end
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ALL(a) (a).be() , (a).en()
#define REP(i,n) for(int (i)=0;(i)<(n);(i)++)
#define REP2(i,s,n) for(int (i)=(s);(i)<(n);(i)++) ... | 1 | 29,363,876 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); ++i)
using ll = long long;
int main(){
int h1,m1,h2,m2,k; cin >> h1 >> m1 >> h2 >> m2 >> k;
int x1 = 60 * h1 + m1;
int x2 = 60 * h2 + m2;
int t = x2 - x1;
if(t>=k){
cout << t-k << endl;
}else{
cout ... | #define _GLIBCXX_DEBUG
#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>;
void solve()
{
int h1, m1, h2, m2, k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
int bt = h1 * 60 + m1;
int et = h2 * 60 + m2;
int ans = et... | 1 | 58,674,031 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define INF 1000000007
#define mod 1005
#define ll long long int
const double mx = 2e6 + 5 ;
int findSum(int num)
{
int dS = 0;
while(num)
{
dS+=(num%10);
num/=10;
}
return dS;
}
voi... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_bac... | 1 | 44,398,525 |
#include<bits/stdc++.h>
#include<vector>
#include<string>
#include<stack>
#include<iostream>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ll long long
#define MOD 1000000007
#define vec(a) vector<int>a
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("output.txt",... | #include <iostream>
using namespace std;
int main(){
int N,R;
cin >> N >> R;
if (N >= 10) {
cout << R << endl;
}
else if (N < 10) {
cout << 100*(10-N)+R << endl;
}
} | 1 | 40,927,560 |
#include<bits/stdc++.h>
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long int
using namespace std;
int mod = 1e9 + 7;
int32_t main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fastio;
int d, t, s;
cin >... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int d,t,s;
cin >> d >> t >> s;
if (d <= t*s){
cout << "Yes" << '\n';
}else{
cout << "No" << '\n';
}
} | 1 | 72,342,279 |
#include <bits/stdc++.h>
using namespace std;
using P = pair<int,int>;
using P3 = pair<P, int>;
using ll = long long int;
constexpr int INF = 1<<30;
constexpr ll MOD = (1e9)+7;
int main(){
ll N, A, B;
cin >> N >> A >> B;
if(A+B > N+1 || A*B < N){
cout << -1 << endl;
return 0;
}
vecto... | #include<iostream>
using namespace std;
typedef long long LL;
const int N = 3e5;
LL boxes[N+1];
LL ans[N+1];
int main()
{
LL n, a, b; cin >> n >> a >> b;
if(!(a+b-1 <= n && n <= a*b))
cout<<-1<<endl;
else
{
boxes[a-1] = b;
for(int i = 0; i < a-1; i++)
boxes[i] = 1;
... | 1 | 40,770,674 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C;
string ans="No";
cin >> A >> B >> C;
if(C>=A && C<=B){
ans = "Yes";
}
cout << ans<<endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int a, b, c;
cin >> a >> b >> c;
cout << (((a <= c) && (c <= b)) ? "Yes" : "No") << endl;
} | 1 | 35,684,086 |
#include<bits/stdc++.h>
using namespace std;
#define read FILE *fp;\
fp=freopen("testcase.txt","r",stdin);
#define ll long long
#define ull unsigned long long
#define sf(n) scanf("%lld",&n)
#define pf(n) printf("%lld ",n)
#define loop for(long long i=0;i<n;i++)
#define lp(b,n) for(long long i=b;i<=n;i++)
#define pb(n) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i <= b; i++)
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define debug(...) cerr<<__LINE__<<... | 1 | 52,143,089 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t N, sa = 0, sb = 0, minus = 0, cnt = 0;
cin >> N;
vector<int64_t> A(N), B(N), D(N);
for (int i = 0; i < N; i++)
{
cin >> A.at(i);
sa += A.at(i);
}
for (int i = 0; i < N; i++)
{
cin >> B.at(i);
sb += B.at(i);
D.at(i) = ... | #include <bits/stdc++.h>
#include <cmath>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<int, int> P;
const ll INF = LONG_LONG_MAX / 100;
const ll MINF = LONG_LONG_MIN;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#de... | 1 | 92,720,216 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int A, B;
cin >> A >> B;
cout << A - B + 1 << endl;
} | #include<iostream>
#include<vector>
#include<string.h>
#include<queue>
using namespace std;
const int N = 1e5 + 7;
string x[3] = { "RGB","GBR","BRG" };
int y[3][N];
int main() {
int n, k;
while (cin >> n >> k) {
cout << n - k + 1 << '\n';
}
return 0;
} | 1 | 17,742,374 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define cvector vector<char>
#define svector vector<string>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll,lvector,greater<ll>>
#define P pair<ll,ll>
#define ALL(a) a.begin(),a.end()
#d... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define vc vector<char>
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
#define get_bit(x, k) ((x >> k) & 1)
void MAIN() {
int n; cin >> n;
map<string, int> m;
for (int i = 0... | 1 | 48,014,706 |
#include <iostream>
#include <vector>
struct Data
{
int x;
int y;
};
int main()
{
Data data;
std::vector<Data> vector;
while (1)
{
std::cin >> data.x >> data.y;
if (data.x == 0 && data.y == 0)
{
break;
}
vector.push_back(data);
}
for (int i = 0; i < vector.size(); ++i)
{
if (vector[i].x > vector... | #include<stdio.h>
int main()
{
int x,y;
for(;;)
{
scanf("%d %d",&x,&y);
if(x<y)
{
printf("%d %d\n",x,y);
}
else if(y<x)
{
printf("%d %d\n",y,x);
}
else if(x==y&&x!=0&&y!=0)
{
printf("%d %d\n",x,y);
}
else if(x==0&&y==0)
{
break;
}
}
return 0;
} | 1 | 21,390,286 |
#include <iostream>
#include <cstdlib>
#include <cstdio>
#define N 200011
using namespace std;
struct apple{
int v,nxt;
}edge[N*4];
int indexx[N],n,dp[N],tot;
void addedge(int x,int y){
edge[++tot].v=y;
edge[tot].nxt=indexx[x];
indexx[x]=tot;
}
void dfs(int u,int fa){
int t=indexx[u],vv;
while(t){
vv=edge[t].v;... | #include "bits/stdc++.h"
#include<cassert>
#pragma warning(disable:4996)
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define MRE assert(0)
const int mod = 1000000007;
const long long inf = 1ll << 61;
typedef pair<int, int> P;
typedef pair<P, int>PP;
vector<int>G[100006];
int dp[1000... | 1 | 3,203,201 |
#include <bits/stdc++.h>
using namespace std;
int main(){
char c;
cin >> c;
bool flag = false;
if(c == 'a'){
flag = true;
}
else if(c == 'i'){
flag = true;
}
else if(c == 'u'){
flag = true;
}
else if(c == 'e'){
flag = true;
}
else if(c == 'o'){
flag = true;
}
else{
flag = false;
}
if(flag ==... | #include<algorithm>
#include<bitset>
#include<cmath>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<string>
#include<unordered_map>
#include<utility>
#include<vector>
constexpr int IINF = (1 << 30) - 1;
constexpr long long... | 1 | 90,652,009 |
#include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <algorithm>
#include <sstream>
#include <string>
#include <math.h>
#include <set>
#include <deque>
#include <queue>
#include <list>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
#define for1(n) for... | #include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define println(x) cout << x << endl;
using namespace std;
int main()
{
int r;
cin >> r;
if (r < 1200) {
... | 1 | 2,844,371 |
#pragma once
#pragma once
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<math.h>
#include <iomanip>
#define rep(i,n) for(auto i=0;i<(n);i++)
#define all(vs) (vs).begin(),(vs).end()
#define roundup(A,B) (A)/(B)+((A)%(B)==0?0:1)
#define read(type,name) type name;cin>>name
us... | #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... | 1 | 57,249,959 |
#include <bits/stdc++.h>
#define sz(arr) (int)arr.size()
#define all(arr) arr.begin(), arr.end()
using namespace std;
void _cin() {}
template <class Head, class... Tail>
void _cin(Head&& head, Tail&&... tail) {
cin >> head;
_cin(forward<Tail>(tail)...);
}
#define Cin(T, ...) \
T __VA_ARGS__; \
_cin(__VA_ARGS... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0;i<int(N);++i)
#define rep1(i,N) for(int i=1;i<int(N);++i)
#define all(a) (a).begin(),(a).end()
typedef long long ll;
typedef vector<int> vi;
typedef set<int> seti;
typedef vector<string> vs;
const int MOD = 1e9+7;
const int inf = 1e9;
int main()... | 1 | 70,739,811 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll 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 = vect... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(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 > b) { a = b... | 1 | 15,254,536 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using Graph = vector<vector<int>>;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typede... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main(){
int sum = 21;
rep(i,4){
int n;
cin >>n;
if(n==1 || n==9 || n==7 || n==4) sum -= n;
}
if(sum==0) cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
} | 1 | 17,776,525 |
#include <bits/stdc++.h>
using namespace std;;
int main() {
int K,N; cin >> K >> N;
vector<int> A(N); vector<int> interval(N);
for (int i =0; i<N; i++) {
cin >> A.at(i);
if (i >= 1) interval.at(i) = A.at(i) - A.at(i-1);
}
interval.at(0) = K + A.at(0) - A.at(N-1);
int maxInterval =0;
for (int i =0;... | #include<iostream>
#include<cmath>
#include<iomanip>
#include<algorithm>
#include<set>
using namespace std;
#define ll long long
int gcd(int a, int b){
if(b==0)
return a;
return gcd(b, a%b);
}
int main(){
int r,n;
cin>>r>>n;
int maxdis=0;
int a,b,c,d;
cin>>a;
c=a;
for(int i=1;i<n;i++){
cin>>b;
maxdi... | 1 | 11,078,545 |
#include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#define all(a) (a).begin(),(a).end()
using ll = long long;
using ld = long double;
using namespace std;
using dou = double;
const ll inf = 2147483647;
const ll INF = 1LL << 60;
const ll mod = 1000000007;
const ld pi = 3... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
string s; cin >> s;
if (s.length() < 26) {
char c = 'a';
while (s.find(c) != string::npos) c++;
return !(cout << s + c << endl);
}
string t(s);
if (next_permutation(begin(s), end(s)))... | 1 | 71,091,150 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int n,k;
cin>>n>>k;
ll v[n];
for(int i=0;i<n;i++)
{
cin>>v[i];
}
int kk = k;
ll maxsum=0;
for(int i=0;i<=min(n,k);i++)
{
int ab=i;
for(int j=0;j<=ab;j++)
{
int pre=j;
int suf=ab-j;
ll sum=0;
multiset<ll>val;
for(int l... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD=998244353;
#define chmin(x,y) x=min(x,y)
int main(void){
int n,k;
cin>>n>>k;
vector<int> V(n);
rep(i,n) cin>>V[i];
int ans=0;
rep(l,n+1) rep(r... | 1 | 77,660,586 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
const long long INF = 1LL << 60;
typedef long long ll;
const long long MOD = 1000000000 + 7;
int main()
{
ll n;
cin >> n;
set... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n;
cin >> n;
ll ans;
cin >> ans;
for(int i=1; i<n; i++){
ll a;
cin >> a;
ans = gcd(ans,a);
}
cout << ans << endl;
return 0;
} | 1 | 57,865,330 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repn(i,n) for(int i = 0; i <= (int)(n); i++)
#define srep(i,l,n) for(int i = l; i < (int)(n); i++)
#define srepn(i,l,... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string st, tt; cin >> st >> tt;
int n = st.length();
vector<char> s(n);
vector<char> t(n);
for (int i=0; i<n; i++) {
s[i] = st[i];
t[i] = tt[i];
}
bool flag = false;
for (int i=0; i<n; i++) {
if (s == t) {
flag = true; brea... | 1 | 11,429,746 |
#include <iostream>
#include <queue>
using namespace std;
#define INF 9999999
int graph[101][101];
int dis[101];
bool check[101];
int main(){
int n;
cin>>n;
fill(dis,dis+101,INF);
dis[1]=0;
check[1]=true;
for(int i=0;i<n;i++){
int u,k,v;
cin>>u>>k;
for(int j=1;j<=k;j++){
graph[u][0]=k;
... | #include<iostream>
#include<queue>
using namespace std;
static const int N = 100;
int n,d[N],M[N][N];
void dfs(int r) {
queue<int> q;
q.push(r);
for (int i = 0; i < n; i++) d[i] = -1;
d[r] = 0;
int u;
while (!q.empty()) {
u = q.front();
q.pop();
for (int v = 0; v < n; v++) {
if (M[u][v] == 0) continue;
... | 1 | 29,427,382 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <cmath>
#include <cstdlib>
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define MA(i,j) make_pair(i,j)
#define PA pair<int,int>
#define PB push_back
#def... | #include "bits/stdc++.h"
#define MOD 1000000007
#define INF 11234567890
#define in std::cin
#define out std::cout
#define rep(i,N) for(int i=0;i<N;++i)
typedef long long int LL;
LL K;
LL ans[51];
int main()
{
in >> K;
if (K == 0) { out << 4 << std::endl << 3 << " " << 3 << " " << 3 << " " << 3 << std::endl; }
else i... | 1 | 75,568,922 |
#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
#define pq priority_queue
#define P pair<int,int>
#define P2 pair<int,P>
#define P3 pair<int,P2>
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
void solve();
int main(void){
int N;
int nosolve = -1;
int upplim = -1;
int index = 1;
cin >> N;
while(N >= 0){
N -= index;
index++;
}
nosolve = abs(N);
fo... | 1 | 60,645,109 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll INF = 1e10;
int main()
{
int x, y;
string s;
cin >> s >> x >> y;
int n = s.size();
vector<vector<bool>> dp(16010, vector<bool>(8010));
for(int i = 0; i <= n; i++)
{
for(int j = 0; j <= n; j++)
{
... | #include<bits/stdc++.h>
#define EM 100000000
using namespace std;
using LL = long long;
using P = pair<LL, LL>;
LL LINF = 1e18;
int INF = 1e9;
using vint = vector<int>;
using vLL = vector<LL>;
using vvint = vector<vector<int>>;
using vvLL = vector<vector<LL>>;
bool solve(vint a, int b){
set<int> s, ss;
s.insert(0);
... | 1 | 52,908,723 |
#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 sort(A) sort(A.begin(),A.end())
#define reverse(A) reverse(A.begin(),A.end())
typedef long long ll;
int main(){
int n;
cin >> n;
vector<pair<int,int>> r(n);
vector<pair<int,int>> ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long int;
#define long ll
template <typename T>
struct SegmentTree {
using F = function<T(T, T)>;
const T e;
const F f;
size_t sz;
vector<T> tree;
SegmentTree(size_t n, const F &f, const T &e = 0) : f(f), e(e) {
sz = 1;
... | 1 | 53,337,130 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll m,k;
cin >> m >> k;
if(m==0){
if(k==0){
cout << "0 0" << endl;
}else{
cout << -1 << endl;
}
return 0;
}
if(m==1){
if(k==0){
cout << "1 0 0 1" << endl;
}else{
cout << -1 << endl;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
#de... | 1 | 80,607,009 |
#include <iostream>
#include <algorithm>
#include <complex>
#include <utility>
#include <vector>
#include <string>
#include <queue>
#include <tuple>
#include <cmath>
#include <bitset>
#include <cctype>
#include <set>
#include <numeric>
#include <functional>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) r... | #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... | 1 | 35,315,184 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <math.h>
#include <map>
#include <functional>
#include <iomanip>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <typeinfo>
#define PI 3.14159265359
#define INF 99999999
#define rep(i, n... | #include <iostream>
#include <cmath>
using namespace std;
#define loop(i,a,b) for(int i=(a);i<int(b);i++)
#define rep(i,b) loop(i,0,b)
int N,A,B,C,X;
int Y[200];
int solve(){
int r = X;
int reel=0;
for(int i=0; i<=10000; i++,r=(r*A+B)%C){
if(r==Y[reel]){
reel++;
}
if(reel... | 1 | 72,974,929 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long>A(N);
vector<long long>B(N);
B.at(0) = 0;
for (int i = 0; i < N; i++) {
cin >> A.at(i);
if (i != 0){
if (A.at(i) > A.at(i-1)){
B.at(i) = 1;
}
else if (A.at(i) < A.at(i-1)){
... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<functional>
#include<math.h>
#define rep(i,n) for(ll i=0;i<(n);i++)
typedef long long ll;
using namespace std;
int main(void){
ll N,money = 1000,stock = 0;
cin >> N;
vector<ll> A(N... | 1 | 97,883,048 |
#include<iostream>
#include<iomanip>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<numeric>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using... | #include <iostream>
using namespace std;
int main() {
string stra;
int x;
cin >> stra;
x= stra.length();
x=x-1;
for(int i=x-1;i>=0;i--){
if(i%2==1 && stra.substr(0,i/2+1)==stra.substr(i/2+1,i/2+1)){
cout << i+1 << endl;
break;
}
}
} | 1 | 45,285,813 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<iomanip>
#include<sstream>
#include<cmath>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, m;string s;
cin >> n >> s >> m;
rep(i, n) {
if (s[i]... | #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)1E17;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a... | 1 | 31,550,080 |
#include <bits/stdc++.h>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
string upper(string str);
string lower(string str);
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define pb push_b... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<int,int>;
int main(void){
int n, i;
cin >> n >> i;
cout << n - i + 1 << endl;
return 0;
} | 1 | 9,424,662 |
#include <iostream>
#include <vector>
#include <numeric>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (auto &v : vec)
cin >> v;
int s1 = 0;
int s2 = accumulate(vec.begin(), vec.end(), 0);
int ans = s2 - s1;
for (int i = 0; i < n; ++i) {
s1 += vec[i];
s2 -= vec[i... | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
#define rep(a,n) for(ll a = 0;a < n;a++)
static const ll INF = 1e15;
static const ll mod = 1e9+7;
template<typename T>
static inline void chmin(T& ref, c... | 1 | 52,842,187 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define se second
#define fi first
#define mp make_pair
#define pb push_back
#define ll long long
const int MAXN = (int)1e7 + 1000;
const int N = (int)1e5 + 100;
const int mod = (int)1e9 + 7;
const int INF = (int)1e9;
ll a[N],b[N];
int main(){
ios_b... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=100005;
int n,a[maxn],b[maxn];
ll ans;
inline int read(){
int res=0,f_f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-') f_f=-1;ch=getchar();}
while(ch>='0'&&ch<='9') res=(res<<3)+(res<<1)-'0'+ch,ch=getchar();
return ... | 1 | 72,427,398 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <iomanip>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <queue>
using namespace std;
void outputPattern(int length, int offset) {
int times = length/2;
for (int i = 0... | #include <stdio.h>
int main(){
int n,m,i,t,l,r;
scanf("%d%d",&n,&m);
if(n%2==0)n--;
t=(n-1)/2;
if(t==1)return 0*printf("1 2\n");
if(t&1){
l=t/2,r=l+2;
for(i=1;i<=m;i++){
printf("%d %d\n",l,r);
l--,r++;
if(l==0)l=(t+n)/2,r=l+1;
}
}else{
l=t/2,r=l+2;
for(i=1;i<=m;i++){
printf("%d %d\n",l,r);
... | 1 | 27,279,462 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long X,Y,A=pow(10,18);
cin >> X >> Y;
if(X%Y==0){
cout << -1 << endl;
}
else{
cout << X << endl;
}
} | #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... | 1 | 48,729,894 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cassert>
#include <set>
#include <vector>
#include <cmath>
#include <bitset>
#include <functional>
#include <limits>
#include <map>
using namespace std;
typedef long long ll;
#define rep1(i, n) for(ll i = 1; i <=(ll)(n); i++)
#define rep0(i, n) for(ll... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> C(n - 1), S(n - 1), F(n - 1);
rep(i, n - 1) {
cin >> C[i] >> S[i] >> F[i];
}
rep(i, n - 1) {
int ans = 0;
ans... | 1 | 46,257,980 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for(ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina c... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
... | 1 | 99,123,419 |
#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;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> vec(2*N);
for (int i = 0; i < 2 * N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
int ans = 0;
for (int i = 0; i < 2 * N; i += 2) {
ans += vec.at(i);
... | 1 | 85,332,274 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c;
cin >>a>>b;
if((a==1||a==2) && (b==2||b==1))
cout<<3<<endl;
else if((a==1||a==3) && (b==3||b==1))
cout<<2<<endl;
else
cout<<1<<endl;
} | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <numeric>
#include <ctime>
#include <complex>
#include <bitset>
#include <ra... | 1 | 55,616,254 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int64;
typedef vector<int> vec;
typedef vector<int64> vec64;
#define db(x) cout << "> " << #x << ": " << x << "\n";
#define ss cout << " ";
#define ct(x) cout << x;
#define nn cout << "\n";
#define cts(x) cout << x << " ";
#define ctn(x) cout << x << "\n";... | #include <bits/stdc++.h>
#define FIO ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
int main() {
FIO
int n; cin >> n;
int a[n];
for (int i = 0; i < n; i++) cin >> a[i];
int ans = 0, k = 1;
for (int i = 0; i < n; i++) {
if (a[i] == k) k++;
else ans++;
}
if (ans == n) cout... | 1 | 5,769,130 |
#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 sort(A) sort(A.begin(),A.end())
#define reverse(A) reverse(A.begin(),A.end());
#define vecmin(A) *min_element(A.begin(),A.end());
#define vecmax(A) *max_element(A.begin(),A.... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,i,k,l;
cin>>n;
vector<long long>a(n);
for(i=0;i<n;i++)
cin>>a[i];
sort(a.begin(),a.end());
reverse(a.begin(),a.end());
queue<long long >q;
for(i=0;i<n-1;i++)
{
if(a[i]==a[i+1])
{
... | 1 | 87,196,193 |
#include <iostream>
#include <algorithm>
using namespace std;
struct Card
{
int num;
char type;
};
void trace(int n, Card c[])
{
for (int i = 0; i < n; ++i)
{
cout << c[i].type << c[i].num;
if (i < n - 1)
{
cout << " ";
}
}
cout << endl;
}
void bubbleSort(int n, Card c[])
{
for (int i = 0; i < n; ++i... | #include <stdio.h>
#include <algorithm>
using namespace std;
struct TRAMP{
char mark;
int number;
};
int main(){
int n,min;
char buf[3];
scanf("%d",&n);
TRAMP selectArray[n],bubbleArray[n];
for(int i = 0; i < n; i++){
scanf("%s",buf);
selectArray[i].mark = buf[0];
selectArray[i].number = buf[1] - '0';
bu... | 1 | 65,993,601 |
#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 ... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include <sstream>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include <iomanip>
using namespace std;
int main(void){
int N;
cin >> N;
std::map<std::string,long> ... | 1 | 43,722,309 |
#include <iostream>
using namespace std;
int main(void){
int N, A;
cin >> N >> A;
int i = N / 500;
int j = N - (500 * i);
if ( A >= j)
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
int n,a;
cin>>n>>a;
int rem=n%500;
cout<<(rem<=a?"Yes":"No")<<endl;
return 0;
} | 1 | 607,811 |
#include <iostream>
#include <string>
#include <map>
#include <algorithm>
using namespace std;
typedef map<string, void(*)> funcs_type;
void print(string &s, int a, int b){
if(a < 0 || a > b || b > s.size()) return;
for(int i = a; i <= b; i++)
cout << s[i];
cout << endl;
}
void reverse(string &s, int a, int b){
i... | #include <iostream>
#include <string>
using namespace std;
int main(void)
{
int i, j, a, b, q;
string str, command, tmpstr, repstr;
cin >> str >> q;
for (i = 0; i < q; i++){
cin >> command >> a >> b;
if (command == "print") {
cout << str.substr(a, b - a + 1) << endl;
}
else if (command == ... | 1 | 80,481,765 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <sstream>
#include <string>
#define _repargs(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s; cin >> s;
int n = s.size();
vector<int> masks(n + 1), dp(n + 1, n);
for (int i = 0; i < n; ++i) masks[i + 1] = masks[i] ^ (1 << (s[i] - 'a'));
map<int, int> dps;
dps[0] = 0;
for (int i = 1; i <= n; ++i) {
dp[i] = dp... | 1 | 67,463,470 |
#include <algorithm>
#include <bits/stdc++.h>
#include<iostream>
#include<string>
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
const ll MOD=100000007;
const ll INF=1000000101001;
ll gcd(ll a, ll b) {
return b ? gcd(b, a%b) : a;
}... | #include <bits/stdc++.h>
#include <cassert>
#include <numeric>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using vi=vector<int>;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
ll gcd(ll a, ll b){
if(a%b == 0){
return(b);
}else{
return(gc... | 1 | 43,275,462 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, j, n) for(int i = j; i < (int)(n); i++)
ll MOD = 1000000007;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> Graph(N, vector<int>(N, 0));
vector<pair<int, int>> input(M);
rep(i, 0, M) {
cin >> input.at(... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define vv(T) std::vector<std::vector<T>>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
int n, m;
vv(int) G(n, vector<int>());
int ans = 0;
void dfs(int now, vector<bool> check)
{
check[now] = 1;... | 1 | 9,766,171 |
#include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define IOS ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
#define ff first
#define ss second
#define pb push_back
#define debug(val) cerr << "The value of " << #val << " is = " << val << '\n';
typedef long long ll;
typedef unsigned long long ull;
... | #include <bits/stdc++.h>
#define append push_back
using namespace std;
using ll = long long;
const int N = 1e5 + 3;
const int M = 1e6 + 7;
const long long MOD = 1e9 + 7;
const long long INF = 1e18 + 9;
const int SM = 1e3 + 5;
const int logN = 22, BL = 400;
const double EPS = 1e-9, PI = acos(-1);
const int dx[] = {1, 0,... | 1 | 57,133,463 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define all(x) x.begin(), x.end()
#define x first
#define y second
#define mp make_pair
#define mt make_tuple
signed main() {
#ifdef LC
assert(freopen("input.txt", "r", stdin));
#endif
ios::sync_with_stdio(0);
cin.tie(0);
string s;
... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
#define rep(i,n) for (ll i = 0; i < (ll)(n); ++i)
#define rrep(i,j,n) for(ll i = (ll)(j); i < (ll)(n); i++)
#define mrep(i,n) for (ll i = (ll)(n-1); i > 0; i--)
#define be(v) (v).begin(), (v).end()
#define sc... | 1 | 89,094,156 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.