code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define loop(i, a, n) for(int i = (a); i < (n); i++)
#ifdef _DEBUG
#define dd(x) cout << #x << " : " << x << endl
#else
#define dd(x)
#endif
using namespace std;
using ll = int64_t;
int main(){
int n, x, t; cin >> n >> x >> t;
if(n%x) cout ... | #include <iostream>
#include <cstring>
using namespace std;
int dp[1001][1001];
int main(){
int q,xl,yl;
char X[1001],Y[1001];
cin >> q;
for (int i=0;i<q;i++){
cin >> X >> Y;
xl=strlen(X);
yl=strlen(Y);
for (int i=1;i<=xl;i++)dp[0][i]=0;
for (int i=1;i<=yl;i++)dp[i][0]=0;
for (int i=0;i<... | 0 | 90,459,709 |
#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... | #include<bits/stdc++.h>
using namespace std;
#define ioS ios::sync_with_stdio(false);cin.tie(0);
#define li long int
#define ll long li
#define ull unsigned ll
#define pi pair<int,int>
#define vi vector<int>
#define vli vector<li>
#define v... | 0 | 13,529,529 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 10000000000 + 7;
int main(){
cout << setprecision(10);
int N,M; cin >> N >> M;
map<int,int> m;
for(int i = 0; i < M; i++){
int tmp1,tmp2; cin >> tmp1 >> tmp2;
m[tmp1]++;
m[tmp2]++;
}
for... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (int ... | 0 | 19,729,280 |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int N, M;
cin >> N >> M;
int ans;
ans = ((N - M) * 100 + M * 1900);
for (int i = 0; i < M; i++)
{
ans *= 2;
}
cout << ans << endl;
}
int main() {
solve();
return 0;
} | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <map>
#include <queue>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(a) (a).begin(), (a).end()
#define rALL(a) (a).rbegin(), (a).rend()
using namespace std;
using ll = long long;
usin... | 0 | 84,949,353 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main()
{
int a[4];
for(int i=0;i<4;i++)cin>>a[i];
sort(a,a+4);
if(a[0]==1&&a[1]==4&&a[2]==7&&a[3]==9)cout<<"YES"<<endl;
else cout<<"NO"<<endl;
return 0;
} | #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... | 0 | 52,765,135 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n;
cin >> n;
vector<int> vec(n);
rep(i, n) cin >> vec.at(i);
bool clear = true;
int p = 1;
int count = 0;
while (p != 2)
{
... | #include <iostream>
using namespace std;
int main(){
int M;
while(cin >> M){
long long res = 0;
long long sum = 0;
for(int i=0;i<M;i++){
long long d, c; cin >> d >> c;
res += c;
sum += d*c;
}
--res;
res += (sum-1)/9;
cou... | 0 | 89,864,074 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#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... | #include <bits/stdc++.h>
#define __STDC_FORMAT_MACROS
#define p64 PRId64
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR (i, 0, n)
#define ALL(f, x, ...) \
([&] (decltype ((x)) ALL) { \
... | 0 | 7,696,833 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
string s[10] = {
"",
".,!? ",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz"
};
char p(int n, int times) {
return s[n][(times - 1) % (int)s[n].size()];
}
int main() {
int N;
cin >> ... | #define _USE_MATH_DEFINES
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <memory>
#include <string>
#include <algorithm>
#include <complex>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#inc... | 0 | 76,348,299 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long N, cnt = 0, ans = 0;
cin >> N;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
if (i%j == 0 && i%2 == 1) cnt++;
}
if (cnt == 8) ans++;
cnt = 0;
}
cout << ans << endl;
} | #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--)
#define rep1(i,n) for(int i = 1; i <= (n); i++)
#define rrep1(i,n) for(int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 1000000007
#define I... | 0 | 91,167,981 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m=1e32,s,p,j,i,a[500];
cin>>n;
for(i=0;i<n;i++)cin>>a[i];
sort(a,a+n);
for(i=a[0];i<=a[n-1];i++)
{
s=0;
for(j=0;j<n;j++)
{
p=(a[j]-i);
s+=(p*p);
}
if(s<m)m=s;
}
... | 0 | 69,310,467 |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <utility>
#include <tuple>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cstring>
#include <cmath>
#define rep(i, n) for (int i = 0; ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
const ll C = 1e9+7;
int main(){
string S, T;
cin >> S >> T;
int ns = S.size();
int nt = T.size();
vector<string> V;
bool flg;
string ss;
for(int i=0; i<ns-nt+1; i++) {
flg = true;... | 0 | 61,247,326 |
#include <iostream>
#include <algorithm>
using namespace std;
int main( void )
{
int n, k, input[100000];
while(cin >> n >> k, n | k) {
int sum = 0;
for(int i=0; i < n; ++i) {
cin >> input[i];
if(i < k) sum += input[i];
}
int i, j, ans = sum;
i = 0; j = k-1;
while(j < n-1) {
sum -= input[i++];
... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size()... | 0 | 73,014,780 |
#include <iostream>
bool isInside(int w, int h, int x, int y, int r) {
return !(x - r < 0 || x + r > w || y - r < 0 || y + r > h);
}
int main(void) {
int w, h, x, y, r;
std::cin >> w >> h >> x >> y >> r;
std::cout << (isInside(w, h, x, y, r) ? "Yes" : "No") << std::endl;
return 0;
} | #include <bits/stdc++.h>
int main(){
int X, Y, Z, K;
std::cin >> X >> Y >> Z >> K;
std::vector< long long > A(X);
std::vector< long long > B(Y);
std::vector< long long > C(Z);
for(int i=0; i<X; i++){
std::cin >> A[i];
}
for(int i=0; i<Y; i++){
std::cin >> B[i];
}
... | 0 | 87,696,169 |
#include <iostream>
#include <string>
using namespace std;
string satu;
string dua;
string tiga;
int main(){
cin>>satu>>dua>>tiga;
satu[0]-=32;
dua[0]-=32;
tiga[0]-=32;
cout<<satu[0]<<dua[0]<<tiga[0]<<endl;
} | #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() {
int n, d,x,cnt=0;
double nn = 0.0;
... | 0 | 96,751,782 |
#define MINUS -99999999
#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int main(){
int n,a[5010],j;
long long int sum[5010] = {0},max;
while(1){
max = MINUS;
cin >> n;
if(n == 0)break;
for(int i = 1; i <= n; i++){
cin >> a[i];
sum[i] = sum[i-1] + a[i];
... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1e9;
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a%b);
}
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
int Amax =... | 0 | 14,445,202 |
#include <bits/stdc++.h>
using namespace std;
long long int lucas(int a){
if(a==1){
return 2;
}
if(a==2){
return 1;
}
if(a==41){
return 228826127;
}
if(a==42){
return 370248451;
}
if(a==71){
return 425730551631123;
}
if(a==72){
return 688846502588399;
}
return lucas(a-1... | #pragma warning(disable: 4996)
#include <string>
#include <vector>
#include <iostream>
#include <cstdio>
#include <sstream>
#include <fstream>
#include <math.h>
#include <algorithm>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < (n); i++)
int main() {
ll l, r, ans = 2... | 0 | 6,010,424 |
#include <iostream>
#include <map>
#include <vector>
using namespace std;
constexpr int N_max = 2'000;
constexpr int M_max = 2'000;
constexpr int mod = 1'000'000'007;
#ifdef _MSC_VER
constexpr int debug = 1;
#else
constexpr int debug = 0;
#endif
static int dp0[2'005][2'005];
static int dp1[2'005][2'005];
int main() {
... | #include <iostream>
#include <stdio.h>
#include <string>
#define MAX_H 50
using namespace std;
char C[MAX_H][MAX_H];
int main() {
int H, W;
cin >> H >> W;
for (int i = 0; i < H; ++i) {
string S;
cin >> S;
for (int j = 0; j < W; ++j) {
C[i][j] = S[j];
}
}
for (int i = 0; i < H; ++i) {
... | 0 | 28,704,607 |
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <algorithm>
#include <ctime>
#define ll long long
#define vecvec(h, w, name) vector<vector<ll>> name(h, vector<ll>(w));
#define rep(init, i, n) for (ll i = init; i < (n); i++)
#define rev(s) reverse(s.begin(), s.end())
#define sor(v) sort... | #include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(a); (i)<(b); ++(i))
#define rFor(i, a, b) for(int (i)=(a)-1; (i)>=(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulin... | 0 | 63,824,334 |
#include "bits/stdc++.h"
using namespace std;
long long MOD = 1000000007;
static long long F[100010] = {}, RF[100010] = {};
long long Calc(int a, int b) {
if (b == 0) return 1;
if (b % 2 == 0) {
long long c = Calc(a, b / 2) % MOD;
return (c * c) % MOD;
}
return (a * Calc(a, b - 1)) % MOD;
}
void Fac() {
F[0] =... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcount
#define ll long long
#define mp make_pair
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define Time (doub... | 0 | 95,747,003 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <climits>
#include <cassert>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
using VVI = vect... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, K;
char S[22];
scanf("%d %s %d", &N, S, &K);
for(int i = 0; i < N; i++){
if(S[i] != S[K - 1]) printf("%c", '*');
else printf("%c", S[i]);
}
printf("\n");
return 0;
} | 0 | 98,694,011 |
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
typedef long long ll;
const char nl = '\n' ;
const ll MOD = 1e9 + 7;
bool check(string s)
{
int k = s.size()/2;
for(int i = 0; i <k; i++)
{
if(s[i] != s[i+k])
return false;
}
return ... | #include <bits/stdc++.h>
#define INF 1000000000000000001
#define ll long long
#define pll pair<ll, ll>
using namespace std;
ll N;
void start_check(ll a, ll b, vector<vector<bool>>& ans, vector<vector<char>>& board)
{
for (ll i = N - 2; i >= 0; --i)
{
for (ll j = i + 1; j < N; ++j)
{
if (board.at(a + i... | 0 | 15,897,863 |
#include<iostream>
#include<vector>
using namespace std;
int main(){
vector<vector<int> > graph;
int n;
cin >> n;
graph.resize(n);
for(int i=0;i<n;i++){
graph[i].resize(n);
for(int j=0;j<n;j++){
graph[i][j]=0;
}
}
for(int i=0;i<n;i++){
int idx,times;
cin >> idx >> times;
for(... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,d;
cin>>a>>b>>c>>d;
if((a+b)==(c+d))
cout<<"Balanced"<<endl;
if((a+b)>(c+d))
cout<<"Left"<<endl;
if((a+b)<(c+d))
cout<<"Right"<<endl;
return 0;
} | 0 | 59,340,175 |
#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(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
static const int INF = 1e9... | #include <bits/stdc++.h>
using namespace std;
double EPS=1e-10;
double add(double a, double b){
if(abs(a+b)<EPS*(abs(a)+abs(b))) return 0;
else return a+b;
}
typedef complex<double> Pt;
double det(Pt a, Pt b){
return add(a.real()*b.imag(),-a.imag()*b.real());
}
int main(){
int n; cin >> n;
for(int i=... | 0 | 85,403,042 |
#include<bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int n;
cin>>n;
for (int i = 0; i < n; ++i)
{
int y,m,d;
cin>>y>>m>>d;
int ans=0;
int ty=1000-y-1;
ans+=(20*20+19*10)*(ty/3);
if(ty%3==1) ans+=20*10;
else if(ty%3==2) ans+=20*15+19*5;
if(y%3==0)
{
ans+=20*(10-m... | #include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define LOOP(i,x,n) for(int i=x;i<n;i++)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define MP make_pair
#define FR first
#define SC second
#define int long long
using namespace std;
const int MOD=1000000007;
const int INF=9000000009;
int M[10... | 0 | 10,243,267 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define LIMIT 1000000007
#define rep(i, n) for(int i=0; i<(int)n; i++)
#define all(v) (v).begin(), (v).end()
int main(){
string S;cin>>S;
int L = 0;
int ok_0 = 0;
int ok_1 = 0;
for(char x: S){
int c = x-'0';
if(L%2==c)ok_0++;
if... | #include <bits/stdc++.h>
#define NREP() for(ll i = 0; i < n; i++)
#define MREP() for(ll j = 0; j < m; j++)
#define REP(i, x, y) for(ll i = x; i < y; i++)
#define ALL(x) (x).begin(), (x).end()
#define MSG(x) cout << x << endl;
#define MSGF(x, n) MSG(fixed << setprecision(n) << x)
#define END(x) cout << x << endl; return... | 0 | 8,552,040 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
using namespace std;
int main() {
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int a = x2 - x1;
int b = y2 - y1;
int ansx, ansy;
ansx = x2 - b;
ansy = y2 + a;
cout << ansx << ' '<< ans... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using msi = map<string, int>;
using mii = map<int, int>;
using psi = pair<string, int>;
using pii = pair<int, int>;
using vlai = valarray<int>;
#define rep(i,n) for(int i=0;i<n;i... | 0 | 14,586,471 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n, m, sum=0, cnt=0, ans;
cin >> n >> m;
vector<long long> a(m);
for(int i = 0; i < m; i++) {
cin >> a[i];
sum += a[i];
cnt++;
}
if(n >= sum) {
ans = n-sum;
cout << ans << endl;
}else{
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 2000000000000000000ll
#define fi first
#define sec second
#define... | 0 | 44,606,874 |
#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
const ll MOD = 10000... | #include <bits/stdc++.h>
#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, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const ll mod2 = 998... | 0 | 37,164,579 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#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()
#define rep(i,n) for(ll (i)=0; (i)<(n); ++(i))
#define pri... | #include <bits/stdc++.h>
#define lli long long int
#define pb(a) push_back(a)
#define forr(a,n) for(lli i=a;i<n;i++)
#define forrr(j,a,n) for(lli j=a;j<n;j++)
#define all(x) x.begin(),x.end()
#define mp make_pair
#define ff first
#define ss second
#define pi2 1.57079632679489661923
using namespace std;
void print(lli ... | 0 | 2,185,157 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
vector<int> isMax(n + 1, false);
int tmp = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (tmp < a[i]) {
tmp = a[i];
isMax[i] = true;
}
}
m... | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
inline int readInt() { int x; scanf("%d", &x); retur... | 0 | 50,368,257 |
#include <cstdio>
#include <algorithm>
#include <climits>
typedef long long ll;
const int max_t = 20;
ll dist[max_t][max_t];
int main() {
while (1) {
int n, t = 0;
scanf("%d", &n);
if (n == 0) break;
for (int i = 0; i < max_t; i++) {
std::fill(dist[i], dist[i] + max_t, INT_MAX);
}
for (int i = 0; i < n;... | #include <bits/stdc++.h>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> s(N);
rep(i,0,N-1) cin >> s[i].first >> s[i].second;
vector<pair<int, int>> c(M);
rep(i,0,M-1) cin >> c[i].first >> c[i].second;
vector<int> answers(N);
r... | 0 | 84,288,665 |
#include<bits/stdc++.h>
using namespace std;
int k, a, b;
int main()
{
cin >> k;
cin >> a >> b;
if(a%k==0)
cout << "OK" << endl;
else{
if((a/k+1)*k<=b)
cout << "OK" <<endl;
else
cout << "NG" << endl;
}
return 0;
} | #include <vector>
#include <list>
#include <map>
#include <climits>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <c... | 0 | 69,661,440 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n+2);
a.at(0) = 0;
for(int i=1;i<n+1;i++){
cin >> a.at(i);
}
a.at(n+1) = 0;
ll dist = 0;
for(int i=1;i<n+2;i++){
dist += abs(a.at(i) - a.at(i-1));
}
for(int i=1;i<n+1;i++){
c... | #include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repa(i, s, n) for(int i = s; i < (int)n; i++)
#define MOD 1000000007
using namespace std;
using ll = long long;
typedef vector<int> vi;
signed main() {
string s;
cin >> s;
vi a(4);
a[0] = s[0] - '0';
a[1] = s[1] - '0';... | 0 | 30,611,201 |
#include <iostream>
#include <queue>
using namespace std;
static const int N = 100;
static const int UNREACHABLE = -1;
int n, M[N][N];
int d[N];
void bfs(int);
int main(){
int u,k,v;
cin >> n;
for(int i=0; i<N; i++){
for(int j=0; j<N; j++){
M[i][j] = 0;
}
}
for(int i=0; i<n; i++){
cin >> u >> k;
for(i... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define clr(arr) memset(arr,0,sizeof(arr))
#define nn '\n'
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
while(t--)
{
ll tk = 1000, x = 0;
ll n;
cin>>n;
... | 0 | 34,770,347 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using pll = pair<ll, ll>;
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(n) for(ll i=0;i<n;++i)
#define rep2(i,n) for(ll i=0;i<n;++i)
#define rep3(i,a,b) for(ll i=a;i<b;++i)
#define rep... | #include <iostream>
#include <vector>
using namespace std;
int main(){
for(;;){
unsigned long n,k;
vector<int> a;
cin>>n>>k;
if(!n) return 0;
int ai;
for(unsigned long i=0;i<n;i++){
cin>>ai;
a.push_back(ai);
}
long sum=0,max=0;
for(unsigned long i=0;i<k;i++){
sum+=a[i];
}
max=sum;
for(... | 0 | 60,876,955 |
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
using namespace std;
#define intmax INT_MAX
#define lma... | #include<iostream>
#include<cstdio>
#include<cmath>
#define size 20000000
using namespace std;
int find_prime(int n)
{
int count =0;
bool *numberList=new bool[size+1];
for(unsigned long i=3;i<=sqrt(n);i+=2)
{
for(unsigned long j=i;i*j<=n;j+=2)
numberList[i*j]=true;
}
for (uns... | 0 | 65,519,701 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF=1e+9;
const int MOD=1e+9+7;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define REP2(i,a,b) for(ll i=a;i<(ll)(b);i++)
#define REPD2(i,a,b) for(ll i=a;i>(ll)(b);i--)
template<class T>
vector<T> make_v... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
bool cmp(pair<int, int> &a, pair<int, int> &b) { return a.second > b.second; }
int main() {
int n;
cin >> n;
vector<pair<int, int>> red(n), blue(n);
for (int i = 0; i < n; i++) {
cin >> red[i].first >> red[i].second;
}
for (... | 0 | 28,776,796 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
std::ios_base::sync_with_stdio(false);
cin.tie(0);
int x;
cin >> x;
cout << 360/__gcd(360,x) << "\n";
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
signed main() {
... | 0 | 58,691,861 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,int>
co... | #include<stdio.h>
#include<string>
void max_heapify(int* A, int i, int H)
{
int l = 2 * i, r = 2 * i + 1;
if(l > H && r > H) return;
int maxid = i, x;
if(l <= H) maxid = (A[l] > A[maxid] ? l : maxid);
if(r <= H) maxid = (A[r] > A[maxid] ? r : maxid);
if(maxid == i) return;
x = A[maxid]; A[ma... | 0 | 37,881,620 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1000 + 10;
ll a[N], b[N * N], sum[N];
int x;
bool cmp(ll a, ll b) { return ((a >> x) & 1) > ((b >> x) & 1); }
int main()
{
int n, k;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
{
scanf("%lld", &a[i]);
... | #include <bits/stdc++.h>
#define EPS (1e-10)
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<ll>;
using v... | 0 | 73,935,441 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
constexpr int INF = 2e9;
int main() {
string vac = "Vacant";
string left, right;
int n;
cin >> n;
int l = 0, r = n / 2;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define ITR(v,c) for(auto v=begin(c);v!=end(c);v++)
#define FOR(v,a,n) for(int v=a;v<(int)(n);v++)
#define FORE(x,arr) for(auto &x:arr)
#define REP(v,n) FOR(v,0,n)
#define RREP(v,n) for(int v=(int)(n);v>=0;v--)
#define ALL(c)... | 0 | 54,125,670 |
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <fstream>
#include <sstream>
#include <iomanip>
#define ll long long
using namespace std;
long long MOD = 1000000007;
int calc(ll A, ll B){
int retA=0;
while(A>0... | # include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if(x == 0) { return y; }
else { return gcd(y%x,x); }
}
lint lcm(lint x, lint y) { return x/gcd(x,y)*y; }
lint C(lint n, lint k) {
if(n == k) { return 1; }
else if(n < k) { return 0; }
else if(k == 0) { return 1; ... | 0 | 2,838,894 |
#include <bits/stdc++.h>
using ll = long;
using namespace std;
int main(){
ll m, k; cin >> m >> k;
if (1ll<<m <= k) { cout << -1 << "\n"; return 0; }
if (m == 1 && k == 1) { cout << -1 << "\n"; return 0; }
if(m == 1 && k == 0) { cout << "0 0 1 1" << "\n"; return 0; }
for (ll i = 0; i < (1ll<<m); i++) ... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define fastio ios:: sync_with_stdio(0);cin.tie(0);cout.tie(0);cout<<fixed;cout<<setprecision(10);
#define randomINIT mt19937 rnd(chrono::steady_clock:... | 0 | 14,886,460 |
#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int main()
{
int a,b,k;
cin>>a>>b>>k;
set<int> st;
for(int i=1;i<=a;i++)
{
if(a%i==0)
{
st.insert(i);
}
}
int ans=0;
for(int i=b;i>=1;i--)
{
if(b%i==0 && st.count(i))
{
k--;
if(k==0)
{
ans=i;
}
}
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define INCANT cin.tie(0), cout.tie(0), ios::sync_with_stdio(0), cout << fixed << setprecision(20);
#define int long long
const int INF = 1e18, MOD = 998244353;
signed main() {
int n;
cin>>n;
int l = 0, r = n - 1, m;
string ls, rs, ms;
cout<<l<<endl<<flu... | 0 | 48,879,990 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n,a,b;
cin>>n>>a>>b;
int64_t sum_all=0;
for(int i=1;i<=n;i++){
string swk = to_string(i);
int64_t sum=0;
for(int j=0;j<swk.size();j++){
char cwk = swk.at(j);
sum+=(cwk-'0');
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ve... | 0 | 76,564,314 |
#include <iostream>
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#include <algorithm>
#include <bits/stdc++.h>
#define MOD 1000000007
#define ll long long
#define l long
#define mm(arr) memset(arr, 0, sizeof(arr))
#define scanArray(a,n) for(int i = 0; i < n; i++){cin >> a[i]}
using namespace ... | #include <bits/stdc++.h>
#include <string.h>
using namespace std;
int main()
{
char s[10];
scanf("%s", s);
if(s[2] == s[3] && s[4] == s[5]) cout << "Yes";
else cout << "No";
} | 0 | 27,842,346 |
#include<iostream>
using namespace std;
int main(void){
while(1){
int a;
int n;
int c=0;
cin>>a;
if(a==0)break;
int count=0;
for(n=1000-a;n!=0;c++){
if(n>=500)n-=500;
else if(n>=100)n-=100;
else if(n>=50)n-=50;
else if(n>=10)n-=10;
else if(n>=5)n-=5;
else... | #include<iostream>
#include<list>
#include<string>
using namespace std;
int main(){
int n;
list<int> l;
list<int>::iterator it;
while(cin>>n){
string op;
int num;
while(n--){
cin>>op;
if(op=="insert"){
cin>>num;
l.push_front... | 0 | 10,182,993 |
#include <iostream>
#include <algorithm>
#include <vector>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
using namespace std;
void chmin(int &a, int b) { a = min(a, b); }
int INF = 1e+13;
int n, K;
int h[301];
vector<int> sortH;
int ordH[301];
int dp[302][302][302];
signed main() {
int i, j, k;
cin ... | #include <iostream>
#include <stack>
#include <string>
using namespace std;
int main(){
string s;
while( getline(cin,s) ){
if( s == "." ) break;
stack<char> st;
bool flag = true;
for(int i=0 ; i < s.size() ; i++ ){
char c = s[i];
if( c == '(' || c == '[' ){
st.push( c );
}else if( s[i] == ')' ){
... | 0 | 99,100,831 |
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
#define mod 100000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(),v.end()
ll INF = 100100010... | #include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int MAX = 100000;
typedef pair<int,int> P;
int ans[MAX];
int ToS(int h, int m, int s){
return h*60*60+m*60+s;
}
void init(){
fill(ans,ans+MAX,0);
}
int main(){
int n;
while(cin >> n && n){
init();
for(int i = 0; i < n; i+... | 0 | 79,695,876 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int R,G;
cin>>R>>G;
cout<<(2*G)-R<<endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i,n) for (long i=0;i<(n);i++)
#define FOR(i,a,b) for (long i=(a);i<(b);i++)
#define RREP(i,n) for(long i=n;i>=0;i--)
#define RFOR(i,a,b) for(long i=(a);i>(b);i--)
#define dump1d_arr(array) REP(i,array.size()) cerr << #array << "[" << (i) << "] ==> " << (array[i]) << endl;
#define du... | 0 | 58,895,506 |
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <cmath>
#include <ctime>
#include <cassert>
#include <cstdio>
#include <queue>
#include <set>
#include <map>
#include <fstream>
#include <cstdlib>
#include <string>
#include <cstring>
#include <algorithm>
#include <numeric>
using namespace std;
#de... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<vector<char>> a(h, vector<char>(w));
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) cin >> a.at(i).at(j);
}
bool check;
for (int i = 0; i < h; i++) {
check = true;
for (int j = 0; j < w; j++) ... | 0 | 72,398,749 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector <pair <int , int>> a(n);
for (int i=0 ; i<n ; i++){
int b ;
cin >> b;
a.at(i) = make_pair(b,i+1) ;
}
sort ( a.begin() , a.end() ) ;
for ( int i = 0 ; i< n ; i++){
int c,b;
tie(c,b)=a.at(i) ;
cout <<... | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h, T...... | 0 | 14,019,435 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
if(n>=m) cout<<10;
else cout<<0;
return 0;
} | #include <iostream>
#include <cmath>
#include <iomanip>
const double PI = acos(-1);
using namespace std;
int main(int argc, char const *argv[])
{
double a, b, C;
cin >> a >> b >> C;
C = PI * C / 180;
double s, l, h;
s = a * b * sin(C) / 2;
l = a + b + sqrt(a*a + b*b - 2*a*b*cos(C));
h = 2 * s / a;
cout << setpr... | 0 | 89,471,915 |
#include <bits/stdc++.h>
using namespace std;
#define EACH(i,a) for (auto&& i : a)
#define FOR(i,a,b) for(int i=(int)a;i<(int)b;++i)
#define RFOR(i,a,b) for(int i=(int)b-1;i>=(int)a;--i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define debug(x) cerr << #x << ":" << ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, N) for (int i = 0; i < (N); ++i)
int N;
vector<int> graph[100100];
int grundy(int cur, int prv = -1) {
int ret = 0;
for (auto& nxt: graph[cur]) {
if (nxt == prv) continue;
ret ^= grundy(nxt, cur) + 1;
}
re... | 0 | 89,919,607 |
#include <iostream>
#include <stdlib.h>
#include <algorithm>
using namespace std;
int main(int argc, const char * argv[])
{
string input_line;
int *heights;
heights = new int[0];
int lineNum = 0;
while(cin)
{
getline(cin, input_line);
lineNum++;
int line = atoi(input_line... | #include <bits/stdc++.h>
#define mod 1000000007
#define pb push_back
#define ll long long
using namespace std;
int n,flag=0;
vector<ll> a(100009), pat[100009],used(100009);
ll solve(ll x){
used[x]=1;
int fl = 0;
for(int i=0;i<pat[x].size();i++){
if(used[ pat[x][i] ] == 0)fl++;
}
if(fl == 0){
return a[x];
}
v... | 0 | 51,519,733 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
void solve(long long N, long long K, std::vector<long long> P, std::vector<long long> C){
Graph G(N);
vector<bool> reached(N,false);
stack<pair<long long,long long>> st;
for (int i = 0;i<N;i++){
... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int h, w;
cin >> h >> w;
vector<string> lines(h);
for (int i = 0; i < h; ++i) {
cin >> lines[i];
}
for (int i = 0; i < h; i++) {
string line = lines[i];
cout << line << endl;
... | 0 | 8,387,914 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (ll i = 0; i<(n); ++i)
int main() {
ll n;
string s;
cin >> n >> s;
string s1,s2;
rep(i,n/2){
char a = s[i];
s1 += a;
}
for(ll i = n/2; i<n; i++){
char a = s[i];
s2 += a;
}
if(s1==s2) cout << "Yes" ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a.at(i);
int num = 1, cnt = 0;
for (int i = 0; i < n; i++) {
if (a.at(i) == num) {
num++;
} else {
cnt++;
}
}
i... | 0 | 42,160,066 |
#include <bits/stdc++.h>
#define select(_1, _2, x, ...) x
#define repn(i, n) for (int i = 0; i < (n); i++)
#define repr(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, ...) select(__VA_ARGS__, repr, repn)(i, __VA_ARGS__)
#define umax(m, x) (m = max(m, x))
#define umin(m, x) (m = min(m, x))
#define bit(x, n) ((x... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) {}
int root(int x) {
if (par[x] < 0) {
return x;
} else {
return p... | 0 | 27,071,617 |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | #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);
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 yes c... | 0 | 19,123,574 |
#include<cstdio>
#include<vector>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
using namespace std;
typedef long long ll;
const int maxv = 10005;
const int inf = 1e9 + 7;
int main(){
int n;
scanf("%d",&n);
int a,b;
ll ans=0;
for(int i=1;i<=n-1;i... | #include<iostream>
#include<vector>
#include<queue>
#include<string>
#include<algorithm>
#include<map>
#include<cmath>
#include<cstring>
#include<iomanip>
#include<set>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define INF 1000000100
#define rep(i,n) for (int i=0;i<n;i++)
int main(){
int N... | 0 | 9,218,908 |
#include <stdio.h>
#include <math.h>
#include <string.h>
#define rep(i,a,n) for(int i=a;i<n;i++)
int main(){
int m,h,len;
while(1){
char s[210],t[210]="";
scanf("%s",s);
if(strcmp(s,"-")==0) break;
len=strlen(s);
scanf("%d",&m);
rep(i,0,m){
scanf("%d",&h);
rep(j,0,h){
t[j+len-h]=s[j];
}
re... | #include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;
int main()
{
int n; cin >> n;
string inp;
vector<string> s;
for(int i = 0; i < n; i++){
cin >> inp;
sort(inp.begin(), inp.end());
s.push_back(inp);
}
sort(s.... | 0 | 4,248,875 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int lis(vector<int> a){
int n = a.size();
int dp[n];
fill(dp, dp + n, INT_MAX);
rep(i,n) *lower_bound(dp, dp+n, a[i]) = a[i];
return lower_bound(dp, dp+n, INT_MAX) - dp;
}
int main(void){
int n;
cin >> n;
vector<int> ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long L[100];
L[0] = 2;
L[1] = 1;
int N;
cin >> N;
for(int i = 2; i <= N; i++) {
L[i] = L[i - 1] + L[i - 2];
}
if(N == 0) {
cout << L[0] << endl;
} else if(N == 1) {
cout << L[1] << endl;
} els... | 0 | 40,734,907 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pi 3.141592653589793238
#define rep(i,a,b) for (int i = a; i <= b; i++)
#define zip(i,a,b) for(int i=a;i<b;i++)
#define rzip(i,a,b) for(int i=a;i... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
using namespace std;
#define FOR(i,a,b) for(lo... | 0 | 81,389,275 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0; i<(n); i++)
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; return true; } return false; }
int main()... | #include<iostream>
#include<algorithm>
#include<vector>
#include<cstdio>
#include<cmath>
using namespace std;
#define ll long long int
#define ld long long double
#define reps(i,f,n) for(int i=f;i<n;i++)
#define rep(i,n) reps(i,0,n)
#define m1 cout<<"move1"<<endl
#define m2 cout<<"move2"<<endl
#define m3 cout<<"move3"<... | 0 | 78,816,906 |
#include <bits/stdc++.h>
#include <string.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define mod 1000000007
#define pi 3.1415926535
typedef long long ll;
int main(){
vector<int>N(4);
vector<int>A={1,4,7,9};
rep(i,4){
c... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cstring>
#include <math.h>
#include <bitset>
#include <queue>
#include <set>
#include <iomanip>
#include <math.h>
#include <assert.h>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1001001001001001LL;
constex... | 0 | 8,765,707 |
#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;
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
ll a, b... | #include <iostream>
#include <vector>
#include <string.h>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
typedef long long ll;
typedef char str255[256];
#define BIG_PRIME 1'000'000'007
#define BP_remainder(x) ((x) % BIG_PRIME)
const int INF = 1 << 30;
const int INF_NEG = INF * -... | 0 | 55,342,809 |
#include <cstdio>
#include <cstdint>
using namespace std;
char s[3];
char t[3];
void solve() {
uint16_t cnt = 0;
for (int i=0;i<3;i++) {
cnt += (s[i] == t[i]);
}
printf("%d\n", cnt);
}
int main() {
scanf("%s", s);
scanf("%s", t);
solve();
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define REPS(i, m, n) for (int i = (m); i <= (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define reps(i, n) for (int i = 0; i <= (int)(n); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rre... | 0 | 74,566,226 |
#include<cstdio>
int main(){
int n,a[100000],b[100000],max=0,min=1000000000,m;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
if(a[i]>max){
max=a[i];
}
}
for(int i=0;i<n;i++){
if(max... | #include<iostream>
#include<vector>
#include<set>
#include<string>
typedef long long int lli;
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
vector<string> v;
vector<string> v1;
string s1;
string s2;
cin >> s1;
cin>>s2;
v.push_back(s2);
reverse(s1.be... | 0 | 54,230,539 |
#include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
int main(){
ll A, B, C, K;
cin >> A >> B >> C >> K;
ll ans;
if(K % 2 == 0){
ans = A... | #include <bits/stdc++.h>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define DEBUG
#define PI 3.141592653589793238462643383279
#define _GLIBCXX_DEBUG
#ifdef DEBUG
#define s(...) show(__VA_ARGS__);
#define sl(...) show(__VA... | 0 | 24,640,458 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C,D;
cin >> A >> B >> C >> D;
int a = A+B , b = C+D;
if ( a > b ) {
cout << " Left " << endl;
}
else if (a < b) {
cout << " Right " << endl;
}
else {
cout << " Balanced " << endl;
}
} | #include<iostream>
#include<string>
using namespace std;
int main(){
int ans;
string s1="qwertasdfgzxcvb";
string s2="yuiophjklnm";
string s;
while(1){
cin>>s;
ans=0;
if(s[0]=='#')break;
int flag=0;
for(int i=0;i<(int)s.size();i++){
for(int j=0;j<(int)s1.size();j++){
if(s[i]==s1[j])... | 0 | 21,584,039 |
#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 double ld;
typedef long long ll;
typedef ... | #include <bits/stdc++.h>
#define F first
#define S second
#define maxn 200005
#define MOD 1000000007
#define mp make_pair
#define pb push_back
#define pi acos(-1)
#define bit(p,x) ((x>>p) & 1)
#define Task "CF"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<pair<int,int>,int > piii;
... | 0 | 80,289,575 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A;
int B;
cin >> A >> B;
int N = B - A + 1;
int n = 0;
for (int i=0; i < N; i++){
int K = A + i;
int a;
int b;
int c;
int d;
a = K / 10000;
b = (K / 1000) - 10*a;
c = (K / 10) - (K / 100) * 10;
d = K - ( K/10 ... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x)... | 0 | 100,834,374 |
#include <cstdio>
#include <iostream>
#include <stack>
using namespace std;
typedef pair<int, int> pii;
#define W_MAX 20
#define H_MAX 20
#define B '.'
#define R '#'
#define M '@'
char map[W_MAX][H_MAX];
int main(){
while(true){
int W,H;
cin >> W >> H;
if(W==0 && H==0) break;
pii s;
for(int i=0; ... | #include <bits/stdc++.h>
#include "atcoder/dsu"
using namespace std;
typedef long long int ll;
int main(int, char **) {
int n, q;
cin >> n >> q;
atcoder::dsu uf(n);
for (int i = 0; i < q; i++) {
int t, u, v;
cin >> t >> u >> v;
if (t == 0) {
uf.merge(u, v);
} ... | 0 | 51,142,222 |
#pragma region header
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cctype>
#include <assert.h>
#include <time.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#i... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
int main() {
string N;
ll K;
cin >> N >> K;
ll dp[N.size() + 1][2]
[5];
reverse(N.begin(), N.end());
REP(i, N.size() + 1) REP(j, 2) REP(k, 5) dp[i][j][k... | 0 | 24,612,780 |
#include<iostream>
int main(void) {
int a, b;
std::cin >> a >> b;
if (a < b) {
std::cout << "a < b" << std::endl;
} else if (a > b) {
std::cout << "a > b" << std::endl;
} else {
std::cout << "a == b" << std::endl;
}
return 0;
} | #include <iostream>
#include <algorithm>
#include <string>
#include <cstdio>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <cmath>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= ... | 0 | 64,963,155 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define prtd(var, i) cout << fixed << setprecision(i) << var << endl;
#define ll long long
#define P pair<int, int>
using namespace std;
const int M = 1000005;
int main() {
int x;
cin >> x;
int zy = x / 100;
int per = x % 100;
int cnt = z... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int mod = 998244353;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main(){
int N,L;
cin >> N >> L;
vector<int>a(N);
vector<int>ans;
int sum = 0,res = 0;
for(int i = 0; i <... | 0 | 81,841,438 |
#include <iostream>
#include <cstdio>
using namespace std;
static const int SIZE = 10001;
int parent[SIZE];
int rk[SIZE];
void init()
{
for (int i = 0; i < SIZE; ++i)
{
parent[i] = i;
rk[i] = 0;
}
}
int find(int x)
{
if (x == parent[x])
{
return(x);
}
else
{
return(parent[x] = find(parent[x]));
}
}
voi... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
stack<int> train;
while (cin >> n) {
if (n) {
train.push(n);
} else {
cout << train.top() << endl;
train.pop();
}
}
} | 0 | 3,963,563 |
#include<iostream>
using namespace std;
int main(){
int n;
while((cin>>n)!=NULL){
long long fac=n;
while(--n>0)fac*=n;
cout<<fac<<endl;
}
return 0;
} | #include<iostream>
#include<stdlib.h>
#include<queue>
using namespace std;
int main () {
int a,b;
while(cin>>a>>b,a|b){
int x,y,m=0;
int d[a*b]={};int k;cin>>k;
for(int i=0;i<k;++i){
cin>>x>>y;x--;y--;
d[x+y*a]=1;
}
int t=a+b;
int dp[2][a*b];
for(int i=0;i<2;++i)for(int j=0;j... | 0 | 4,526,516 |
#include<iostream>
#include<math.h>
#include<algorithm>
#include<utility>
#include<queue>
#include<string.h>
#include<string>
#include<set>
#include<map>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll INF=2e18;
const ll MOD=1e9+7;
ll N;
ll T[100010];
ll A[100010];
ll u[10001... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
typedef pair<ll,ll> l_l;
typedef pair<dd,dd> d_d;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define... | 0 | 18,876,006 |
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main(void){
for(;;){
int a,b,n,m=0;
int x;
int y;
int map[50][50]={0};
cin>>a>>b;
if(a==0&&b==0)break;
cin>>n;
map[0][0]=1;
for(... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,a) for(int i = 0; i < (a); i++)
#define ALL(a) (a).begin(),(a).end()
typedef long long ll;
typedef pair<ll, ll> P;
const int INF = 1e9;
const long long LINF = 1e18;
const long long MOD = 1e9 + 7;
signed main(){
int n,K;
cin >> n >> K;
vector<ll> x,... | 0 | 90,920,337 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n;
cin >> n;
cout << n*(n-1)/2;
} | #include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <numeric>
#define ll long long int... | 0 | 30,770,962 |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define all(v) v.begin(), v.end()
#define sz size()
#define mp make_pair
#define pb push_back
#define rep(p, a, b) for (ll p = a; p < b; p++)
#define rap(p, a, b) for (ll p = a; p <= b; p++)
#define per(p, a, b) for (ll p = a; p >= b; p--)
#define F f... | #include <bits/stdc++.h>
#define INF 1e9
using namespace std;
using ll = long long;
int main(void)
{
int N, K;
cin >> N >> K;
vector<int> count(N, 0);
for (int i = 0; i < K; i++)
{
int d;
cin >> d;
for (int j = 0; j < d; j++)
{
int a;
cin >> a;... | 0 | 93,636,508 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#define pi 3.14159265358979323846264338327950
int main() {
int K, N; std::cin >> K >> N;
std::vector<int> A(N);
for (auto& r : A) std::cin >> r;
std::vector<int> Dis(N);
Dis[0] = A[0] + K - A[N - 1];... | #include<iostream>
#include<vector>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
string s;
cin >> s;
int n = s.size() + 1;
vector<ll> a(n, 0);
int k = 1, sum = 0;
for (int i = 0; i < n - 1; i++) {
if (s[i] == '<') a[i + 1] = a[i] + ... | 0 | 24,181,220 |
#include <bits/stdc++.h>
using namespace std;
int main () {
long long N;
cin >> N;
long long sum = 0;
for (long long i = 1; i <= N; i++) {
sum += i * (N / i) * (N / i + 1) / 2;
}
cout << sum << endl;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | 0 | 63,802,102 |
#include<iostream>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int n, m, k;
cin >> n >> m >> k;
bool ok = false;
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= m; j++) {
int b = i * (m - j) + j * (n - i);
if (b ... | #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 A, B;
cin >> A >> B;
int ans = -1;
rep(i,1500) {
int tax8 = i * 8 / 100.0;
int tax10 = i * 10 / 100.0;
if (tax8 == A && tax... | 0 | 38,130,773 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long long unsigned int ull;
typedef long double ld;
typedef vector<int> vr;
typedef pair<int, int> pr;
#define pb push_back
#define ff first
#define ss second
#define INF 1999999999
#define MODA 1000000007
#define PI 3.141592653589793238462... | #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... | 0 | 7,190,081 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 1e5 +... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,cc,n) for(int i=cc;i<n;++i)
#define lrep(i,cc,n) for(long long i=cc;i<n;++i)
#define sqrep(i,cc,n) for(long long i=cc;i*i<=n;++i)
#define rrep(i,cc,n) for(long i=cc;i>n;--i)
#define pii pair<int, int>
#define pll pair<long long, long long>
using ll = long long... | 0 | 78,724,536 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rp(i,s,e) for(int i=(int)(s);i<(int)(e);++i)
int main(){
ll n; int x, m; cin>>n>>x>>m;
vector<pair<int,int>> P;
ll sum_p = 0;
vector<int> X(m, -1);
for(ll i=0; i<n; ++i){
if(X[x] > -1){
int cyc_len = P.size() - X[x];
int nxt_len =... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
bool cmp(pair<int, int>& a, pair<int, int>& b){
return a.second < b.second;
}
void solve() {
int a, b;
cin >> a >> b;
map<int, int> m;
set<int> s;
for (int i = 0; i < a; i++) {
int c;
cin >> c;
m[c]++;
s.insert(c);
}
if (s.size() <= b) {... | 0 | 44,756,531 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a, b, c;
cin >> a >> b >> c;
int mx = max({a, b, c});
int ans = a + b + c + 9 * mx;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include <iomanip>
#include <math.h>
#include <unistd.h>
#include <stdio.h>
#define rep(i,x) for(ll i = 0;i<x;i++)
#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] << " "
using ll = long long;
using ld = long double;
... | 0 | 27,435,961 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <numeric>
#include <queue>
using namespace std;
int64_t min(int64_t a,int64_t b) {
if (a > b)
{
return b ;
}else
{
return a ;
}
}
int main(){
string s ;
cin >> s ;
vecto... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int _n = n / 2;
unordered_map<int, int> M0;
unordered_map<int, int> M1;
for (int i = 0; i < n; ++i) {
int v;
cin >> v;
if (i... | 0 | 38,718,480 |
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
struct card{
char type;
int num;
};
void swap(card *a,card *b){
card temp=*a;
*a=*b;
*b=temp;
return ;
}
int printCardArray(card data[],int num){
int i;
for(i=0;i<num;i++){
if(i!=0)printf(" ");
printf("%c%d",data[i].type,data[i].num);... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
cin >> n;
map<int,int> m;
rep(i,n){
int a;
cin >> a;
m[a]++;
}
for(auto p : m){
if(p.second > 1){
... | 0 | 30,058,747 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
string S;
cin >> S;
if (S.size() != A+B+1) {
cout << "No" << endl;
return 0;
}
try {
int num1 = stoi(S.substr(0, A));
int num2 = stoi(S.substr(A+1, B));
}
catc... | #include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define ll long long
#define pii pair<int,int>
#define all(x) begin(x), end(x)
#define loop(i,n) for(int i=0; i<n; i++)
#define rep(i,a,b,c) for(int i=a; i<b; i+=c)
#define brep(i,a,b,c) for(int i=a; i>b; i-=c)
#defi... | 0 | 8,627,521 |
#include <iostream>
#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>
#inc... | #include<bits/stdc++.h>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long int
#define mod 1000000007
#define inf 1e18+42
#define endl "\n"
#define pi 3.1415926535897932384626433832795028841971693993751058
#defi... | 0 | 49,015,432 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
#define txt freopen("ip.txt", "r", stdin); freopen("op.txt", "w", stdout)
#define a3 INT_MAX
#define i3 INT_MIN
#define a6 INT64_MAX
#define i6 INT64_MIN
#define F first
#define S second
#define PB ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
ll n;
cin >> n;
vector<ll> a(n),ev(100001),od(100001);
rep(i,n){
cin >> a.at(i);
if(i%2==0){
od.at(a.at(i))++;
}else{
ev.at(a.at(i))++;
}
}
ll maxie... | 0 | 96,133,349 |
#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>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i,n) for(ll i=0;i<n;i++)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool chmax(T &a, T b){i... | 0 | 88,213,809 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
const long long MOD = 1e9 +7;
int main()
{
#ifndef ONLINE_JUDGE
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
#endif
ll n,k;
cin >>n>>k;
vector<ll> v(n);
for(int i = 0;i < n; i++) cin >> v[i];
vector<ll> dp(k+1), end(k+1);
ll a... | #include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <map>
#include <queue>
#define rep(i,n) for (int i=0;i<(n);i++)
using namespace std;
int main() {
long long a, b, k;
cin >> a >> b >> k;
if (k > a) {
k... | 0 | 567,421 |
#include <iostream>
#include <cmath>
#include <queue>
#include <string>
#include <algorithm>
#include <iomanip>
void extract(std::priority_queue<int>& S) {
printf("%d\n", S.top());
S.pop();
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::string s;
std::priority_queue<int> ... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <algorithm>
#include <cstdio>
#include <iomanip>
#include <queue>
#include <deque>
#include <stack>
#include <fstream>
#include <cmath>
#include <random>
#include <complex>
#include <functional>
#include <b... | 0 | 93,282,766 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | #include <iostream>
#include <queue>
using namespace std;
int main(){
string s;
cin>>s;
int n,q,w,i;
cin>>n;
while(n--){
string a,b;
cin>>a;
if(a[2]=='p'){
int c=0;
cin>>q>>w>>b;
for(i=q;i<=w;i++)s[i]=b[c++];
}
else if(a[2]=='v'){
int c=0;
cin>>q>>w;
for... | 0 | 61,070,681 |
#include <bits/stdc++.h>
#define PI 3.1415926535897
using namespace std;
typedef long long ll;
const int INF = 1000000000;
const ll LINF = 1000000000000000000;
const double EPS = 1e-10;
int main(void)
{
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++)
{
cin >> a[i];
}
... | #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 chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define fi first
#define se second
#define INF 1000000009
#define LLINF 1000000000000000009LL
... | 0 | 56,792,605 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
bool flag = true;
string A = S.substr(0, (N - 1) / 2);
string A_ = A;
reverse(A_.begin(), A_.end());
if (A_ != A) flag = false;
string B = S.substr((N + 1) / 2, (N - 1) / ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n + 2, 0);
rep(i, n) cin >> a[i ... | 0 | 64,645,150 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.