code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
const int mod = 1e9+7;
char s[N];
int d[N], r[N];
int main(){
int n, ans;
scanf("%d", &n);
scanf("\n%s", s+1);
for(int i=1; i<=n*2; ++i){
d[i] = d[i-1];
if(s[i] == s[i-1]) d[i] ^= 1;
}
for(int i=n*2; i>=1; --i){
if(d[i] == 1) r[i] =... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int64_t> A(N);
for(int i=0; i<N; i++) cin >> A[i];
int64_t ans = 0;
while(true){
bool updated = false;
for(int i=0; i<N; i++){
int64_t d = A[i]/N;
ans += d;
if(d ... | 0 | 75,245,324 |
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#inc... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <cassert>
using namespace std;
typedef long long LL;
template <typename F, typename S> std::ostream& operator<<(ostream& os, const p... | 0 | 68,602,822 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int X;
int A=0;
int B=0;
cin >>X;
while(1)
{
A=A-X;
B++;
if(A<0)A=A+360;
if(A==0)break;
}
cout << B;
} | #include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORR(i,a,b)for(ll i=(a);i<=(b);i++)
#define repR(i,n)... | 0 | 26,415,851 |
#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... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll N, M;
cin >> N >> M;
vector<vector<vector<vector<ll>>>> plusMinusAbs(2, vector<vector<vector<ll>>>(2, vector<vector<ll>>(2, vector<ll>(0))));
for... | 0 | 25,006,086 |
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#inc... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
void solve(long long N, std::vector<long long> P){
ll cnt = 1;
vector<ll> M(N, P[0]);
for(ll i = 1; i < N; ++i){
M[i] = min(P[i], M[i-1]);
if(P[i] == M[i]) cnt++;
}
cout << cnt << endl;
retur... | 0 | 75,437,796 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
string S,T;
cin>>N>>S;
if(N%2!=0){
cout<<"No"<<endl;
}
else{
T=S.substr(0,N/2);
if(T==S.substr(N/2,N/2)){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll N=1e6+5,inf=1e18,mod=1e9+7;
#define test ll testcases;cin>>testcases; while(testcases--)
#define lp(var,start,end) for (ll var = start; var <end ; ++var)
#define rlp(var,start,end) for(ll var = start; var>=end ; var--)
#... | 0 | 87,252,213 |
#include<iostream>
using namespace std;
int main(){
int h1,m1,h2,m2,k;
cin>>h1>>m1>>h2>>m2>>k;
cout<<60*(h2-h1)+m2-m1-k;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | 0 | 73,981,711 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(pos,mp) for(ll pos=mp.begin();pos!=mp.end();pos -++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 62;
const int INF = 1e9 + 7;
int m... | #include<bits/stdc++.h>
using namespace std;
int main(){
int h,w;cin>>h>>w;
string s[h];
for(int i=0;i<h;i++)cin>>s[i];
vector<int> row(h,false),col(w,false);
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
if(s[i][j]=='#'){
row[i]=true;
col[j]=true;
}
}
}
for(int i=0;i<h;i++)
if(row[i]){
for(... | 0 | 22,719,688 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a1,a2,a3;
cin >> a1 >> a2 >> a3;
if(a1==a2&&a1==a3){
cout << 1 << endl;
}
else if(a1==a2||a1==a3||a2==a3){
cout << 2 << endl;
}
else{
cout << 3 << endl;
}
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <cstring>
#include <functional>
#include <iostream>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <regex>
#include <vector>
#define fix(n... | 0 | 79,156,070 |
#include <cstdio>
#include <cstring>
using namespace std;
int main(){
char p[202],s[101],ch[101];
scanf("%s %s",p,s);
strcpy(ch, p);
strcat(p, ch);
if (strstr(p, s)) printf("Yes\n");
else printf("No\n");
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = 1e9 + 7;
vector<int> filho[100005];
ll dp[100005][2];
ll dfs(int pai, int cor, int pos)
{
if(dp[pos][cor] > 0)
return dp[pos][cor];
for (int i = 0; i < (int)filho[pos].size(); ++i)
{
int viz = filho[pos][i];
ll valor = 0;
if(vi... | 0 | 36,008,030 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for(int i=0; i<N; i++)
typedef long long ll;
#define dump(x) cerr<<#x<<"="<<x<<endl
using P = pair<int, int>;
int main() {
ll x, t; cin >> x >> t;
if(x<t){
cout << 0 << endl;
}
else{
cout << x-t << endl;
}
return 0;... | #include <bits/stdc++.h>
using namespace std;
vector<vector<int>> gr;
int n, q;
struct DSU{
vector<int> par, siz;
int n;
DSU(int n_) {
int n = n_ + 1;
par.resize(n);
siz.resize(n);
fill(siz.begin(), siz.end(), 1);
iota(par.begin(), par.end(), ... | 0 | 56,230,516 |
#include <bits/stdc++.h>
using namespace std;
int n, f[105];
int main() {
scanf("%d", &n);
int mn = 1e9;
for(int i = 1; i <= n; i++) {
int x; scanf("%d", &x);
f[x]++;
mn = min(mn, x);
}
if(f[mn] > 2) {
printf("Impossible\n");
return 0;
}
int up = 2 * mn - (f[mn] == 2);
for(int i = mn + 1; i <= up; i++... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
#define rep(i,n) for (ll i=0;i<(n);++i)
#define rep2(i,a,b) for (ll i=(a);i<(b);++i)
#define debug(x) cout << #x << '=' << x << endl
#define all(v) (v).begin(),(v).end()
const ll MOD=1e9+7;
const ll I... | 0 | 83,695,071 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
map<int, int> mp;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
mp[arr[i]]++;
}
sort(arr.begin(), arr.end());
int resp = 0;
for (int i... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using namespace std;
int main(){
int N, D, X;
cin >> N >> D >> X;
int A[N];
rep(i,N) cin >> A[i];
rep(i,N)rep(j,101) {
int d = j*A[i]+1;
if (d>D) break;
X++;
}
cout << X << endl;
return 0;
} | 0 | 16,985,847 |
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#defi... | 0 | 49,768,510 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const int MOD=1e9+7;
int main(){
string s; cin >> s;
map<char,ll> ma;
ll N=s.size();
for(int i=0;i<N;i++){
ma[s[i]]++;
}
ll ans=N*(N-1)/2+1;
for(auto it=ma.begin();it!=ma.en... | #include <iostream>
#include <vector>
long long INF = 1e18;
long long N, K;
std::vector<long long> a;
int main(){
std::cin >> N >> K;
a.resize(N);
for(int i = 0; i < N; i++) std::cin >> a[i];
long long ans = INF;
for(int bit = 0; bit < (1 << N - 1); bit++){
std::vector<int> sele(N - 1, 0);
... | 0 | 47,739,077 |
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
using P = pair<int,int>;
vector<int> g[200005];
int ma... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int t; cin>>t; while(t--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a, b... | 0 | 39,812,619 |
#include <bits/stdc++.h>
using namespace std;
void __start__() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifdef MY
freopen("/home/ainur/CLionProjects/wow/input.txt", "r", stdin);
freopen("/home/ainur/CLionProjects/wow/output.txt", "w", stdout);
#else
#define endl '\n'
#endif
}
#define sz(x... | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int inf = 0x3f3f3f3f;
const int maxn = 200000 + 10;
map<int, int> pre;
int inline idx(char x)
{
return x - 'a';
}
char s[maxn];
int n;
int main()
{
scanf("%s", ... | 0 | 53,119,326 |
#include <bits/stdc++.h>
using namespace std;
int x;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
cin >> x;
for(int i = 1;i <= 1000000;i++) {
if(i*x%360 == 0) {
cout << i;
return 0;
}
}
} | #include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<long long> x;
long long tmp;
for(int i = 0;i<n;i++){
cin >> tmp;
x.push_back(tmp);
}
long l;
cin >> l;
x.push_back(1e12);
int db[20... | 0 | 38,031,969 |
#include <bits/stdc++.h>
using namespace std;
string s;
int main () {
cin >> s;
for (char c = 'a'; c <= 'z'; c++){
if (s.find(c) == -1){
cout << c;
return 0;
}
}
cout << "None";
} | #include <iostream>
#include <cstdlib>
#include <string>
using namespace std;
int main()
{
string str;
while (getline(cin, str))
{
if(str == "0"){
break;
}
int val = 0;
for (auto c : str)
{
val += c - '0';
}
cout << val << endl;... | 0 | 19,670,886 |
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define se second
#define fi first
#define ll long long
#define INF INT_MAX
#define mod 1000000007
#define chutiyaap ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
using namespace std;
ll pw(ll a, ll b) {
if (b == 0) return 1;
ll t... | #include <iostream>
#include <algorithm>
#include <string.h>
#include <stdio.h>
#include <cmath>
#include <queue>
#define INF 0x3f3f3f
using namespace std;
struct edge
{
int from,to,cost;
};
int V[100],E[100],dis[100][100],N;
edge edges[100];
void floyd()
{
int i,j,k;
for(k=0;k<N;k++)
for(i=0;i<N;i+... | 0 | 67,938,351 |
#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_eleme... | 0 | 30,695,614 |
#include <bits/stdc++.h>
using namespace std;
int main() {
float a;
float b;
float ave;
int i_ave;
int sum;
cin >> a >> b;
ave = (a+b)/2.0;
i_ave = ave;
sum = a + b;
cout << i_ave+(sum % 2) * (sum % 2) << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U... | 0 | 85,069,896 |
#include <iostream>
int main()
{
int H,W,x,y,r;
bool in;
std::cin >> W;
std::cin >> H;
std::cin >> x;
std::cin >> y;
std::cin >> r;
if (x < 0 || x > W || y < 0 || y > H) {
in = false;
} else if ((y - r) < 0 || (y + r) > H) {
in = false;
} else if ((x - r) < 0 || ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define en '\n'
const int MAXN = 1e6+69;
const int INF = 1e18;
const int mod = 1e9+7;
struct vl{
int x,y;
bool operator<(vl t)const{
if(x==t.x)return (y<t.y);
return x<t.x;
}
};
map<int,int>mp;
int q;
int m,p,n,k;
int x,y,z;... | 0 | 9,127,807 |
#include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<stack>
#include<queue>
#include<string>
#include<utility>
#include<numeric>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
using ll = long long;
class Stream{
public:
Stream(){
}
void read(){
}
t... | #include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e13;
const int mod ... | 0 | 51,960,598 |
#include <iostream>
#include <cassert>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <ctime>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <string>
#include <bitset>
#include <vector>
#include <complex>
#include <algorithm>
using namespace... | #include <bits/stdc++.h>
using namespace std;
int soln(vector<vector<int>>a){
int n=a.size();
int dp[n][3];
dp[0][0]=a[0][0];
dp[0][1]=a[0][1];
dp[0][2]=a[0][2];
for(int i=1;i<n;i++){
dp[i][0]=a[i][0]+max(dp[i-1][1],dp[i-1][2]);
dp[i][1]=a[i][1]+max(dp[i-1][0],dp[i-1][2]);
... | 0 | 68,984,848 |
#include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#de... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<pii> vii;
const double EPS=(double)1e-9;
const double PI=(double)acos(-1.0);
#define fi first
#define se second
#define mp make_pa... | 0 | 82,957,812 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef tree<ii,null_type,less<ii>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
int main() {
cin.tie(0); cout.tie(0); ios_base::sync_with_stdi... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define coYES cout << "YES" << endl
#define coNO cout << "NO" << endl
#define coYes cout << "Yes" << endl
#define coNo cout << "No" << endl
#define coyes cout << "yes" << endl
#define cono cout << "no" << endl
#define rep(i, n) for (int i = 0; i < (in... | 0 | 92,901,326 |
#include<bits/stdc++.h>
#define MOD (long long)(1e9+7)
using namespace std;
long long n,k,dp[100005],c[105],sum[100005];
int main()
{
cin >> n >> k;
for(int i=1; i<=n; i++) cin >> c[i];
dp[0]=sum[0]=1;
for(int i=1; i<=n; i++)
{
for(int j=1; j<=k; j++) sum[j]=(dp[j]+sum[j-1]);
for(int j=1; j<=k; j++) dp[j]=(sum... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define repeat(i, n) for (int i = 0; (i) < (n); ++(i))
#define repeat_from(i, m, n) f... | 0 | 72,542,693 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >>n;
for(int i=0; i<n; i++){
float x1, y1, x2, y2, x3, y3, x4, y4;
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
if((x2-x1)*(y3-y4)-(y2-y1)*(x3-x4) == 0){
cout << "YES" << endl;
} else {
cout << "NO" << endl;
... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i ,n) for (int i = (n) - 1; i >= 0; i--)
#define LL long long
#define... | 0 | 35,665,780 |
#include<bits/stdc++.h>
#define ll long long int
#define endl '\n'
#define M 1000000007
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define f first
#define s second
#define b begin
#define e end
#define pb push_back
#define mp make_pair
#define FOR(i,a,b) for(i=a;i<b;i++)
#define RFOR(i,a,b) for(i=a;i>=b;i--)
#de... | #include <bits/stdc++.h>
using namespace std;
int main (void) {
int N, K;
cin >> N >> K;
int n = 0;
int half_n = 0;
for ( int i = 1; i <= N; i++ ) {
if ( K % 2 == 0 ) {
if ( i % K == 0 )
n++;
else if ( i % (K / 2) == 0 )
half_n++;
... | 0 | 87,164,709 |
#include <iostream>
#include <string>
using namespace std;
bool isok(string a, string b)
{
return (a == "lu" && b == "ru") || (a == "ru" && b == "lu") || (a == "ld" && b == "rd") || (a == "rd" && b == "ld");
}
int main(void)
{
int n;
while (cin >> n, n){
string str, prev = "";
int ret = 0;
for (int i = 0; i < ... | #include <iostream>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <algorithm>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using hset = unordered_set<T>;
template<class Key, class T> using hmap = unordered_map<Key, T>... | 0 | 10,056,474 |
#include <iostream>
using namespace std;
int main(){
char c;
cin >> c;
cout << ((c == 'a' || c == 'i' || c == 'u' || c == 'e' || c == 'o') ? "vowel" : "consonant") << endl;
} | #include <algorithm>
#include <bitset>
#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++)
#define reps(i, f, ... | 0 | 7,028,985 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < n; ++i)
#define rep1(i,n) for (int i = 1; i <= n; ++i)
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N; cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
ll ans = 0;
ll sum = 0;
int right... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define rep... | 0 | 5,776,414 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
ll GetDigit(ll num){ return log10(num)+1; }
int main()
{
string s,t;
cin >> s >> t;
int ans = 0;
rep(i,3){
if(s[i] == t[i]) ans++;
}
cout << ans << endl;
return 0... | #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 | 65,946,202 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
int main(){
int n;
cin>>n;
vector<int>v;
for(int i=0;i<n;i++){
int a;cin>>a;
v.push_back(a);
}
int now=1;
for(int i=0;i<v.size();i++){
if(v[i]==now){
now++;
}
}
if(now==1){cout<<-1<<endl;}
else{
cout<<n-(now-... | #include <cstring>
#include <algorithm>
#include <iostream>
struct Card {
char suit;
unsigned int rank;
bool operator<(const Card& rhs) { return rank < rhs.rank; }
};
std::ostream& operator<<(std::ostream& os, const Card& card)
{
return os << card.suit << card.rank;
}
std::istream& operator>>(std::istream& is, ... | 0 | 21,782,295 |
#include<iostream>
#include<cstdio>
#include<queue>
#include<string>
using namespace std;
priority_queue<int>q;
int main()
{
int k;
string com;
while(cin>>com){
if(com=="end"){
break;
}else if(com=="extract"){
printf("%d\n",q.top());
q.pop();
}else... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<long long int>> v(8, vec... | 0 | 48,326,022 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i = 0;i<((ll)(n));i++)
#define reg(i,a,b) for(ll i = ((ll)(a));i<=((ll)(b));i++)
#define irep(i,n) for(ll i = ((ll)(n)-1);i>=0;i--)
#define ireg(i,a,b) for(ll i = ((ll)(b));i>=((ll)(a));i--)
template<class T = int> using V = vect... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int selection_Sort(int A[], int N){
int res = 0;
for(int i = 0; i < N-1; ++i){
int min_j = i + 1;
for(int j = i +1; j < N; ++j){
if(A[min_j] > A[j]) min_j = j;
}
if( A[i] > A[min_j]){
... | 0 | 34,449,490 |
#include <iostream>
#include <vector>
#include <sstream>
#include <cstring>
using namespace std;
struct P {
int id;
char name;
};
P newP(int id, char name){
P *v = new P;
v->id = id; v->name = name;
return *v;
}
void swap(P& a, P& b){
P h = newP(a.id, a.name);
a = b;
b = h;
}
bool check(vector<P>& A, vector<P> ... | #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 | 3,231,517 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
bool G[10][10];
int main() {
int N, M; cin >> N >> M;
for (int i = 0; i < M; ++i) {
int a, b; cin >> a >> b; --a, --b;
G[a][b] = G[b][a] = true;
}
vector<int> ord(N);
for (int i = 0; i < N; +... | 0 | 38,278,630 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
for(int i =0 ;i <10 ; i++)
if(111*i>=N &&111*(i-1)<N)
cout<<i*111;
} | #include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#... | 0 | 97,801,527 |
#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>
#... | #include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <map>
#include <set>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <vector>
#include <algorithm>
#include <functional>
#include <cstring>
#include <string>
#include <sstream>
#include <bit... | 0 | 53,479,231 |
#include <iostream>
using namespace std;
class Triangle {
public:
double Cross_Product_AB_AP, Cross_Product_BC_BP, Cross_Product_CA_CP;
double Vec_ABx, Vec_BCx, Vec_CAx, Vec_APx, Vec_BPx, Vec_CPx;
double Vec_ABy, Vec_BCy, Vec_CAy, Vec_APy, Vec_BPy, Vec_CPy;
Triangle(double x1, double y1, double x2, double y2, doubl... | #pragma region template 2.4
#include <bits/stdc++.h>
using namespace std;
template <typename T>
using pq_asc = priority_queue<T, vector<T>, greater<T>>;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
#define REP(i, n) for ... | 0 | 28,204,814 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int n;
cin>>n;
long long x,y,u[n],v[n];
for (int i = 0; i < n; ++i)
{
cin>>x>>y;
u[i]=x+y;
v[i]=x-y;
}
long long r=((u[0]%2LL)+2LL)%2LL;
for (int i = 1; i < n; ++i)
{
if (r!=((u[i]%2LL)+2LL)%2LL)
{
cout<<"-1\n";... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define all(a) a.begin(), a.end()
#define P pair<int, int>
#define F first
#define S second
#define mod 1000000007
#define MOD 998244353
#define INF 40000000000000000
int dx8[8] = {-1, 0, 1, 1, 1, 0, -1, -1}... | 0 | 59,311,663 |
#include<bits/stdc++.h>
using namespace std;
vector<vector<int>>G;
vector<bool>seen;
vector<int> cost;
void dfs(int v,int p=-1){
seen[v]=true;
if(v!=0)cost[v]+=cost[p];
for(auto next_v:G[v]){
if(next_v==p)continue;
if(seen[next_v])continue;
dfs(next_v,v);
}
}
int main(){
int n,q;
cin>>n>>q;
G.... | #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 | 62,342,025 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int H, N;
cin >> H >> N;
vector<pair<int, int>> magics(N+1);
for (int n = 1; n <= N; ++n) {
int A, B;
cin >> A >> B;
magics[n] = {A, B};
}
sort(magics.begin(), magics.... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O0")
typedef long long int ll;
typedef long double ld;
const ll mod = 1e9+7;
const ll INF = 1e18;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
#define Rep(i,a,n) for (ll i = (a); i < (n); ++i)
#define All(a) (a).begin(),(a).end()
#define Pi acos(-1)
u... | 0 | 16,210,367 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n,k;
cin >> n >> k;
long long a[n];
for(int i=0;i<n;i++) cin >> a[i];
long long mod=1000000007;
long long b=0,c=0;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(a[i]>a[j]) b++;
}
}
for(i... | #include <iostream>
#include <string>
#include <array>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#define int long long
using namespace std;
void printVector(const vector<int>& vec) {
for (int value : vec) {
cout << value << " ";
}
cout << endl;
}
signed main() {
str... | 0 | 20,221,870 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
string S;
cin >> N >> S;
if(S.size() <= N){
cout << S << endl;
return 0;
} else if(N < S.size()) {
S.erase(N);
cout << S << "..." << endl;
return 0;
}
} | #include <bits/stdc++.h>
using namespace std;
class Dice{
public:
int s[6];
string str = "EWNSRL";
int d[6][4] = {{0, 3, 5, 2}, {0, 2, 5, 3}, {0, 1, 5, 4}, {0, 4, 5, 1}, {1, 2, 4, 3}, {1, 3, 4, 2}};
void roll(char c){
int idx = str.find(c);
int b = s[d[idx][0]];
for(int i = 0; i ... | 0 | 82,614,702 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
int main() {
string S;
cin >> S;
sort(S.begin(),S.end());
if (S.at(0) == 'a' && S.at(1) == 'b' && S.at(2) == 'c') {
cout << "Yes" << endl;
} else cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Field = vector<vector<ll>>;
using Graph = vector<vector<ll>>;
using VI = vector<int>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VC = vector<char>;
using PI = pair<int, int>;
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#d... | 0 | 69,689,801 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
int main() {
char a, b;
cin >> a >> b;
if ((a == 'H')&&(b == 'H')) {
cout << 'H' << endl;
} else if ((a == 'H')&&(b == 'D')) {
cout << 'D' << endl;
} else if ((a == 'D')&&(b == 'H')) {
cout << 'D' << e... | #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 | 89,327,699 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long i,j,s,k,r=0;
cin>>k>>s;
for(i=0;i<=k;i++)
{
for(j=0;j<=k;j++)
{
if(s-i-j<=k && s-i-j>=0) r++;
}
}
cout<<r;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
using namespace std;
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) { a = b; ret... | 0 | 63,842,638 |
#include <iostream>
using namespace std;
int main()
{
int a[101] = {};
int n;
while (cin >> n) {
a[n-1] += 1;
}
int ma = 0;
for (int i = 0; i < 100; ++i) if (ma < a[i]) ma = a[i];
for (int i = 0; i < 100; ++i) if (a[i] == ma) cout << i + 1 << endl;
} | #include <cstdio>
#include <iostream>
#include <set>
#include <map>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <cmath>
#include <iomanip>
#include <deque>
#include <queue>
#include <unordered_map>
#include <stack>
#include <bitset>
#include <cstdlib>
#include <sstream>
typedef ... | 0 | 14,484,000 |
#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#include <set>
#include <cmath>
#include <tuple>
#include <cstring>
#include <map>
#include <iomanip>
#include <ctime>
#include <complex>
#include <cassert>
#include <climits>
using namespace std;
typedef long long ll;
typedef unsigned long lon... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<long long>lve;
typedef vector<pair<ll,ll> > lvp;
typedef vector<pair<string,ll> > svp;
#define spc ' '
#define endl '\n'
#define F first
#define S second
#define pp pop_back`
#define pb p... | 0 | 68,262,338 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#include <c... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 100010
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
template<typename T>... | 0 | 17,230,981 |
#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<ll,ll>;
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin>>n>>k;
int mod = 1e9 + 7;
vector<int> candies(n+1);
for (int i = 1; i <= n; i++)
cin>>candies[i];
vector<vector<int> > ways(n+1, vector<int>(k+1));
vector<int> sum(k+1);
sum[0] = 1;
for (int child = 0; c... | 0 | 65,452,161 |
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
long long ans = 0;
bool rest = false;
for (int i = 0; i < N; i++) {
int A;
cin >> A;
if (rest && A > 0) {
ans++;
A--;
}
ans += (long long)A / 2;
rest = A % 2 == 1;
}
cout << ans << endl;
} | #include<bits/stdc++.h>
#define ll long long
using namespace std;
ll sumIt(vector<ll>&V,ll n)
{
vector<ll>L(n+2),R(n+2),LL(n+2),RR(n+2);
V.push_back((ll)(1e9));
V.insert(V.begin(),(ll)(1e9));
ll i,j;
for(i=1;i!=n+1;i++)
{
j = i-1;
while(j > 0 && V[j] < V[i])
j = L[j];... | 0 | 60,997,032 |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#inclu... | #include <iostream>
#include <map>
#include <vector>
using namespace std;
map<int, int> counter(vector<int> nums){
map<int, int> outcome;
for (auto n: nums){
outcome[n]++;
}
return outcome;
}
int main(){
vector<int> nums;
for (int i=0;i<3;i++){
int a, b;cin>>a>>b;
nums.pu... | 0 | 96,347,310 |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long LL;
const int N = 2e5;
vector<int> adj[N+1];
int p[N+1];
void dfs(int u, int prev)
{
p[u] = prev;
for(const int& v : adj[u])
if(v != prev)
dfs(v,u);
}
int main()
{
int n; cin >> n;
for(int ... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <unordered_map>
#include <deque>
using namespace std;
using ll = long long;
void _cin(){} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... tail){ cin >> head; _cin(forward<Tail>(tail)...); }
void ... | 0 | 17,018,176 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
string s;
cin >> a >> b >> s;
if(s[a] == '-'){
for(int i = 0; i < s.size(); i++){
if(i != a){
if(!(s[i] >= 48 && s[i] <= 57)){
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
retu... | #include <bits/stdc++.h>
using namespace std;
typedef pair<double,int> pp;
int main() {
int n;
cin >> n;
vector<int> a(n);
for(int i=0; i<n; ++i) cin >> a[i];
sort(a.begin(), a.end());
int p = a[n-1];
int q = 0;
int m = min(a[0], a[n-1] - a[0]);
for(int i=1; i + 1 < n; ++i) {
... | 0 | 71,202,833 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<(int)(n); i++)
int main() {
string S;
cin >> S;
rep(i, S.size()){
if(i % 2 == 0) cout << S.at(i);
}
cout << endl;
} | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
string s, t;
cin >> s >> t;
int a,... | 0 | 93,929,339 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <math.h>
#include <string>
#include <numeric>
#include <queue>
#include <cstdio>
#include <cstring>
#define ll long long
#define rep(i,n) for(ll i=0;i<n;++i)
#define rep1(i,n) for(ll i=1;i<n;++i)
#define... | #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
string s;
cin >> s;
long long int k;
cin >> k;
for (int... | 0 | 66,704,696 |
#include <iostream>
#include <vector>
#include <utility>
#include <set>
using namespace std;
typedef pair<int, int> P;
int main(){
int N, K;
cin >> N >> K;
int cnt = 0;
if(K > (N - 1) * (N - 2) / 2){
cout << -1 << endl;
return 0;
}
set<P> s;
for(int i = 1; i < N; i++){
... | #include<iostream>
using namespace std;
int main() {
int line[101] = { 0 };
int code;
while (cin >> code) {
++line[code];
}
int max = 0;
for (int i = 1; i <= 100; ++i) {
if (max < line[i])max = line[i];
}
for (int i = 1; i <= 100; ++i) {
if (line[i] == max)cout << i << endl;
}
return 0;
} | 0 | 89,599,789 |
#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,... | #include <bits/stdc++.h>
using namespace std;
#define prec(n) fixed << setprecision(n)
#define maxpq priority_queue<int>
#define minpq priority_queue<int, vector<int>, greater<int>>
#define PI 3.14159265
#define pb push_back
#define bits(n) __builtin_popcount(n)
#define ll long long int
void solve()
{
int n,k;
... | 0 | 79,246,611 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string alphabet = "abcdefghijklmnopqrstuvwxyz";
string S;
cin >> S;
vector<bool>al(26, false);
for (char s : S) al[s-'a'] = true;
if (S.size() == 26) {
int i = S.size()-1;
while (S[i-1] > S[i]) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define ARRAY_LENGTH(array) sizeof(array)/sizeof(*array)
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; ... | 0 | 33,553,021 |
#include <iostream>
int main()
{
int n;
std::cin >> n;
unsigned long long int s = 1;
for(std::size_t i = 2; i <= n; ++i){
s *= i;
}
std::cout << s << std::endl;
return 0;
} | # pragma GCC target("avx")
# pragma GCC optimize("O3")
# pragma GCC optimize("unroll-loops")
# include <iostream>
# include <vector>
# include <algorithm>
# include <string>
# include <sstream>
# include <cmath>
# include <queue>
# include <stack>
# include <map>
# include <iomanip>
# include <stdexcept>
# inclu... | 0 | 5,878,936 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18) + 1;
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define y... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = (a); i < (b); ++i)
#define all(x) begin(x), end(x)
typedef long long ll;
typedef pair<int, int> pii;
const int inf=1010001000;
const ll INF=1001000100010001000;
const int mod=(int)1e9+7;
int main(){
int n;
cin>>n;
vector<int>h(n... | 0 | 75,399,737 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
int main() {
int A, B;
cin >> A >> B;
string S;
cin >> S;
bool flag = true;
for(int i = 0; i < A; i++) {
if(S[i] >= '0' && S[i] <= '9') continue;
else { flag = false; }
}
if(S[A] != '-') {
flag = false;
}
... | #include <iostream>
#include <string.h>
int main()
{
char main_string[1000], sub_string[1000];
std::cin >> main_string;
std::cin >> sub_string;
int difference = strlen(main_string) - strlen(sub_string) + 1;
int max_same_char[difference];
for (int i = 0; i < difference; i++)
{
max_sam... | 0 | 62,620,977 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
int N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
sort(all(A));
vector<ll> use;
vector<ll> tmp;
rep(i, N) {
... | #include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
using namespace std;
using pii = pair<int,int>;
... | 0 | 82,392,043 |
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int a[N+1];
for(int i=0; i<N; i++)
cin >> a[i+1];
bool pushed[N+1];
for(int i=0; i<N+1; i++)
pushed[i] = false;
int count = 0;
int now = 1;
pushed[now] = true;
while(1){
if(a[now] == 2){
cout << count+1 << endl;
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ldb long double
#define rep(i, x, n, j) for(int i=x;i<(int)n;i+=j)
#define F first
#define S second
#define per(i, x, n, j) for(int i=(int)n-1;i>=0;i-=j)
#define all(v) v.begin(),v.end()
#define sz(a) (int)a.size()
const int N = 2000100;
const ll... | 0 | 60,881,463 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) \
for (int i = 0; i < (int)(n); i++) \
;
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
int main() {
string s;
cin >> s;
int ans = 0;
if (s.find("RRR") == 0) {
ans = 3;
} else if (s.find("RR") == 0 || s.find("RR") == ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int x;
cin>>x;
for(int i=1;i<100000;i++)
{
if(i*x%360==0)
{
cout<<i<<endl;
break;
}
}
} | 0 | 80,561,864 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define mod 998244353
#define INF 1 << 30
#define MAX 1 << 18
int solve(int src, int count, vector<vector<int>>& adj, vector<bool>& color, int* dp) {
if(dp[src] != -1) {
return dp[src];
}
int ans = MAX;... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
template<class T>
inline ... | 0 | 14,555,748 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FO... | #include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define int long long
#define mp make_pair
const int MOD=1e9+7;
const int INF=1e15;
int myf(int x,int d){
if(x%d==0)return x/d;
else return x/d+1;
}
signed main(){
int N,H;cin>>N>>H;
... | 0 | 13,118,053 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> pi;
typedef pair<ll,pi> pii;
typedef vector<pi> vpi;
typedef set<ll> si;
typedef long double ld;
#define mp make_pair
#define pb push_back
#define f first
#define s second
ll INF = 1e9;
ll MOD = 1e9;
#define lb... | #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;++i)
#include<string>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<int, int>P;
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 ... | 0 | 69,681,478 |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <iostream>
#include <functional>
#include <unordered_set>
#include <bitset>
#include <time.... | #include<cstdio>
#include<iostream>
#include<vector>
using namespace std;
int main(void) {
int N, M, X;
scanf("%d %d %d", &N, &M, &X);
int C[12];
int A[12][12];
for (int i = 0; i < N; i++) {
scanf("%d", &C[i]);
for (int j = 0; j < M; j++) {
scanf("%d", &A[i][j]);
}
}
int ans = 1<<30;
bool ansFound = fa... | 0 | 91,112,895 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<pair<int, int>> vpi;
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#def... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using pii=pair<int,int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(),a.end()
#define rrng(a) a.end(),a.begin()
#define endl "\n"
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll N,L;
... | 0 | 41,035,320 |
#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 int ll;
typedef long double ld;
#define MOD 1000000007
#define ALL(obj) (obj).begin(),(obj).end()
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;}
... | 0 | 42,140,064 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#include<algorithm>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
#define large "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
#define small "abcdefghijklmnopqrstuvwxyz"
using namespace std;
using ll = long lon... | #include<bits/stdc++.h>
using namespace std;
int main() {
int x[12];
int y[12];
scanf("%d %d %d",&x[0],&x[1],&x[2]);
scanf("%d %d %d",&x[3],&x[4],&x[5]);
scanf("%d %d %d",&x[6],&x[7],&x[8]);
int n;
scanf("%d",&n);
for(int i = 1 ; i <= n ; i++)
scanf("%d",&y[i]);
for(int i = 0 ;... | 0 | 67,099,335 |
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
int main(){
int n, q;
cin >> n >> q;
dsu d(n);
for(int i = 0; i < q; i++){
int t, u, v;
cin >> t >> u >> v;
if(t == 0){
d.merge(u, v);
}
else{
if(d... | #include<bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma... | 0 | 70,102,859 |
#include <bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#include<cstring>
#include<bitset>
#include<stack>
#include<time.h>
#define X first
#define Y second
#define PB push_back
#define MP make_pair
#d... | #include <bits/stdc++.h>
#define rep(i,a,n) for(int i=a;i<n;i++)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define int long long
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
signed main(){
int n;
string s;
while(1){
int l=0,r=0,ans=0,pre=0;
cin... | 0 | 70,791,164 |
#include<bits/stdc++.h>
using namespace std;
#define ll long
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
string s;
int a, b;
cin >> a >> s >> b;
if (s == "+") {
cout << a + b << endl;
} else {
cout << a - b << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
#define ssort(n) sort((n).begin(),(n).end())
#define rsort(n) sort((n).begin(),(n).end(),greater<ll>())
using ll=long long;
using ld=long double;
typedef pair<int,int> P;
typedef pair<P,int> ... | 0 | 75,280,864 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define FOR(i,a,b) for(int i=(a); i<=(b); i++)
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define chmin(a,b) if((a)>(b)) (a)=(b);
#define chmax(a,b) if((a)<(b)) (a)=(b);
#define vi vector<int>
#define pii pair<int,int>
#def... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int MAX = 1e5 + 5;
const int INF = 1001001001;
const int MOD = 1e9 + 7;
int main(){
int N, K;
cin >> N >> K;
vector<int> A(N);
rep(i, N) cin >> A[i];
vec... | 0 | 49,319,437 |
#include <iostream>
#include <map>
#include <string>
using namespace std;
int main(){
string s, str1, str2;
int maxn = 0, maxl = 0;
map<string, int> mp;
while(cin >> s){
mp[s]++;
if(mp[s] > maxn){maxn = mp[s];str1 = s;}
int si1 = s.size();int si2 = str2.size();
if(si1 > si2){str2 = s;}
}
cout << str1 << "... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll a[10000000];
int main() {
ll i, j, k, l, test, n;
cin >> n;
for (i = 0; i < n; i++) cin >> a[i];
for (i = 0; i < n; i++) {
a[i] -= (i + 1);
}
ll sum = 0;
sort(a, a + n);
for (i = 0; i < n; i++) {
sum += abs(a[i] - a[n / 2]);
}
cout << ... | 0 | 40,441,387 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<ve... | #include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) Rep(i, 0, n)
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> PP;
const int mod = 1000000007;
signed main()
{
ios::sync_with... | 0 | 9,606,752 |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int x, n, ans = 0, best = 1e9;
cin >> x >> n;
vector<bool> vis(101);
for (int i = 0; i < n; ++i){
int foo;
cin >> foo;
vis[foo] = 1;
}
for (int i = 0; i <= 101; ++i){
if (!vis[i] && abs(i - x) < best){
bes... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> vec(N);
rep(i, N) vec.at(i) = i + 1;
for (int i = 0; i < K; i++) {
int d;
cin >> d;
for (int j = 0; j < d; j++) {
int x;
cin >> x;
... | 0 | 9,095,487 |
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
int left = 0;
int right = n - 1;
int sum = 0;
while(1) {
int lCount = left;
int rCount = right;
while(left < n && s[left] == 'x')left++;
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | 0 | 61,096,312 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
int a = 0;
for (int i = 0; i < S.size() - T.size() + 1; i++) {
int count = 0;
for (int j = 0; j < T.size(); j++) {
if (T.at(j) == S.at(j + i)) {
count++;
}
if (j == T.size() - 1) {
if (a <= count) {
a = ... | #include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <assert.h>
#pragma warning(disable:4996)
typedef long long ll;
#define MIN(a,... | 0 | 6,090,445 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 62;
const int INF = 1e9 + 7;
int m... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const long long int m=pow(10,9)+7;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,ans=0;
cin>>n;
int a[n+1],b[n];
for(int i=0;i<n+1;i++)
cin>>a[i];
for(int i=0;i<n;i++)
cin>>b[i];
... | 0 | 51,444,561 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int a, b;
cin >> a >> b;
cout << (double)a / b << endl;
} | #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 | 24,629,371 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
#define repo(i, n) for(int i=1; i<=n; i++)
#define ssort(a) sort(a.begin(), a.end())
#define INF 1001001001
#define INFll 100100100100100
#define PrintVec(x) for (auto elementPrintVec: x) { cout << elementPrintVec << " "; } cout << endl;
using namespace s... | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define endl "\n"
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define prt(x) cout << (x)
#define prtl(x) cout << (x) << endl
#define rep(i,a,b) for(ll i=a; i<b; i++)
#define rrep(i,a,b) for(ll i=a; i>b; i--)
#define mp(a, ... | 0 | 27,803,139 |
#include<iostream>
#include<cstdio>
#include <stdio.h>
#include<algorithm>
#include<cstring>
#include <string>
#include<cmath>
#include<cstdlib>
#include<queue>
#include<map>
#include<vector>
#include<bits/stdc++.h>
#include <set>
#define ll long long
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#defi... | #include <iostream>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const string YES = "Yes";
const string NO = "No";
void solve(std::string S, std::string T){
bool ans = false;
REP(i, S.size()) {
string s1 = S.substr(0, i);
string s2 = S.substr(i);
if (s2 + s1 == T)... | 0 | 40,041,949 |
#include <bits/stdc++.h>
#include <iostream>
#define ll long long
#define map unordered_map
#define set unordered_set
#define pll pair<ll, ll>
#define vll vector<ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
int main() {
string str;
cin >> str;
ll ans = INF;
for (ll i = 0; ... | #include<bits/stdc++.h>
using namespace std;
#define lli long long int
# define rep(i,n) for(int i=0;i<n;i++)
void solve(){
int n;
cin>>n;
int a[n];
rep(i,n)
cin>>a[i];
lli sum=0;
for(int i=1;i<n;i++){
if(a[i-1]>a[i]){
sum+=(a[i-1]-a[i]);
a[i]=a[i-1];
}
}
c... | 0 | 34,116,082 |
#include <iostream>
using namespace std;
int main()
{
int x, y;
cin >> x >> y;
if(x % y == 0)
cout << -1;
else
cout << x;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 0 | 60,673,503 |
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include<map>
#include <iomanip>
#include <time.h>
#include ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+100;
bool check(string s)
{
if(s[0]==s[1]||s[1]==s[2]||s[0]==s[2]) return true;
return false;
}
int main()
{
ios::sync_with_stdio(0);cin.tie(0);
string s;cin>>s;
if(s.size()<2) cout<<-1<<" "<<-1;
else if(s.size()... | 0 | 47,440,269 |
#include <bits/stdc++.h>
#define mp make_pair
#define eb emplace_back
#define ff first
#define ss second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#ifdef ONPC
mt19937 rnd(228);
#else
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#endif
const int MAXN = 100;
const ... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#define TASK "Yet Another Palindrome Partitioning"
using namespace std;
const int maxn = 2e5 + 1;
string s;
int n,f[(1<<26)],x;
void OpenFile()
{
}
void Enter()
{
cin >> s;
}
void Init()
{
}
void Solve()
{
fill(f+1,f+(1<<26),s.size());... | 0 | 70,384,664 |
#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(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
string s;
ll sum=0, wcnt = 0;
cin >> s;
ma... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf=1000001000;
ll INF=1e18+5... | 0 | 74,528,209 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0;i<n;i++)
#define erep(i,n) for(int i = 0;i<=n;i++)
#define rep1(i,n) for(int i = 1;i<n;i++)
typedef long long ll;
#define vint vector<int>
#define vstring vector<string>
#define vll vector<ll>
#define vbool vector<bool>
#define INF 100000000
ll... | #include<iostream>
int main(){
int i,n,m;
for(i=0;i<3000;i++){
std::cin>> n>> m;
if(n==0&&m==0) break;
if(n>=m){
std::cout<< m<< " "<< n<< std::endl;
}else{
std::cout<< n<< " "<< m<< std::endl;
}
}
return 0;
} | 0 | 33,670,767 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Rep(i, k, n) for (int i = k; i < (int)(n); i++)
#define RRep(i, k, n) for (int i... | 0 | 95,111,017 |
#include <bits/stdc++.h>
#include <algorithm>
#include <math.h>
using namespace std;
int CalcSumOfDigit(int n);
int getDigit(int n);
string upper(string str);
string lower(string str);
class Combi
{
public:
Combi();
long long Combination(long long n, long long k);
private:
... | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
#include<map>
#include<stack>
#include<set>
#include<utility>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ii> P;
typedef unsigned long long i... | 0 | 95,177,857 |
#include<bits/stdc++.h>
#include<algorithm>
#include<math.h>
#include<string>
#include<iostream>
#include<vector>
#include<cstdlib>
#include<stdio.h>
#include<cmath>
#include<limits>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<random>
using namespace std;
template <class T> using V = vector<T>;
templa... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
void solve(long long N, long long Z, long long W, std::vector<long long> a){
if(N==1){
cout << abs(W-a[N-1]) << endl;
return;
}
cout << max(abs(a[N-1]-a[N-2]),abs(W-a[N-1])) << endl;
}
int main(){
... | 0 | 68,823,416 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
long long N, L, T;
cin >> N >> L >> T;
vector<long long> X;
int c = 0;
for(int i = 0; i < N; ++i){
long long x, w, x_;
cin >> x >> w;
if(w == 1) x_ = x+T;
else x_ = x-T;
c += x_/L;
x_ %= L;
... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define all(x) (x).begi... | 0 | 76,117,174 |
#include <bits/stdc++.h>
#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++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
string s, t;
cin >> s >> t;
string ans = "";
rep(i, t.size()) {
ans += s[i];
ans += ... | #include <bits/stdc++.h>
using namespace std;
int dp[1 << 26];
int main()
{
int bit = 0;
string S;
fill_n(dp, 1 << 26, 1 << 27);
dp[0] = 0;
cin >> S;
for(int i = 0; i < S.size(); i++) {
bit ^= (1 << (S[i] - 'a'));
for(int j = 0; j < 26; j++) {
dp[bit] = min(dp[bit], d... | 0 | 11,307,577 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.