code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using db = double;
using vi = vector<int>;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#... | #include <bits/stdc++.h>
using namespace std;
typedef int_fast32_t int32;
typedef int_fast64_t int64;
const int32 inf = 1e9+7;
const int32 MOD = 1000000007;
const int64 llinf = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define POSSIBLE(n) cout << ((n) ?... |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
const int N =2000005;
int cnt[20];
bool check(int x) {
int key[10]={};
while(x) {
key[x%10]++;
x/=10;
}
for(int i=0;i<10;++i) {
if(key[i]>cnt[i])
return false;
}
return true;
}
int main()
{
char ch[N];
scanf("%s",ch);
getchar();... | #include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <stack>
#include <cassert>
#include <map>
#include <numeric>
#include <cstring>
#include <set>
#include <ctime>
#include <queue>
#include <cmath>
#include <iomanip>
#include <iterator>
#include <unordered_set>
using namespace std;
... |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1e2 + 7;
char dp[MAX_N][MAX_N];
char s[MAX_N];
int n, k;
int f_pow(int base, int b, int mod) {
int res = 1;
while (b) {
if (b & 1) res = res * base % mod;
base = base * base % mod;
b >>= 1;
}
return res;
}
char ans(char a, char b) {
if (a ==... | #include <bits/stdc++.h>
#define endl '\n'
#define sz(X) X.size()
#define IO cin.tie(0), ios_base::sync_with_stdio(0);
#define FOR(N) for(int i=0;i<N;++i)
#define FORf(X,V,N) for(int X=V;X<N;++X)
#define FORi(X,V,N,S) for(int X=V;(S>0?X<N:X>=N);X+=S)
#define EACH(X, V) for(auto& X : V)
#define For(X, V, N) for(int X = ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long i64;
typedef unsigned long long ui64;
typedef vector<i64> vi;
typedef vector<vi> vvi;
typedef pair<i64, i64> pi;
#define pb push_back
#define sz(a) i64((a).size())
#define all(c) (c).begin(), (c).end()
#define REP(s, e, i) for(i=(s); i < (e); ++i)
inlin... | #include <bits/stdc++.h>
#define mk make_pair
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
// please, read the question correctly (do you need set or multiset)???
const int N=200010; //check the limits, dummy
vector<pair<int, int>> a[2*N];
vector<int> b[2*N];
int... |
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <string>
#include <vector>
#include <array>
#include <algorithm>
#include <map>
#include <list>
#include <queue>
#include <set>
#include <iostream>
#include <fstream>
#include <chrono>
using namespace std;
const int MOD = 998244353;... | //#pragma GCC optimize(3)
#include <bits/stdc++.h>
#include<stdio.h>
#include<queue>
#include<algorithm>
#include<string.h>
#include<iostream>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
typedef long long ll;
typedef unsigned long long ull;
using namespace ... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
int num;
scanf("%lld",&num);
string str1,str2;
cin>>str1>>str2;
int cur=0,ans=0;
vector<int>v;
for(int i=0;i<num;i++)
{
if(str1[i]=='1')
v.push_back(i);
}
for(int i=0;i<num;i++)
{
if(str1[i]==str2[i]) continue;
while(c... | #include <bits/stdc++.h>
using namespace std;
#define i64 int64_t
#define u64 uint64_t
const i64 inf = 1e17;
const int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dy[] = {1, 0, -1, 0, 1, -1, 1, -1};
#define endl "\n"
#define all(a) a.begin(),a.end()
#define overload(_1,_2,_3,_4,name,...) name
#define _rep1(n) for(int... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define db double
#define pii pair<int,int>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define pll pair<ll,ll>
#define ti3 tuple<int,int,int>
#define mat vector<vector<int>>
const int inf = 1 << 30;
const ll mod = 1e... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
long long sisu(long long n, long long k) {
long long a = 1;
for (long long i = 0; i < k; i++) {
a *= n;
}
return a;
}
int main() {
int N;
cin >> N;
long long max1=-1, max2=-1, b1,b2;
vector<long long> A(sisu(2, N-1));
vector<long long> B(si... |
#include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(ll i = 0;i < n;++i)
#define rrep(i,n) for(int i=int(n-1);i>=0;i--)
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define coy cout<<"Y... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define ALL(x) (x).begin(),(x).end()
const int IINF = 1e9;
const LL LINF = 1e18;
const LL MOD = 1e9+7;
int main() {
int H, W;
cin >> H >> W;
... |
#include <iostream>
#include <string>
#include <vector>
#include <unordered_map>
#include <algorithm>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main()
{
int N;
cin >> N;
std::unordered_map<int, int> mx;
std::uno... | #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>;
ll H, W;
ll d[2000][2000];
bool onBoard(int y, int x) {
if (y >= 0 && y < H && x >= 0 && x < W) {
return true;
}
return false;
}
int main() {
cin >> H >> ... |
#include <bits/stdc++.h>
using namespace std;
const int kN = 2e5 + 10;
int main() {
int n; scanf("%d", &n);
vector<long long> v[3];
auto ID = [&](char c) {
if(c == 'R') return 0;
else if(c == 'G') return 1;
return 2;
};
for(int i = 0; i < 2 * n; i++) {
long long x; char c[2];
scanf("%lld%... | #include <cstdio>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> T[20];
int query(int h, int k, int i, int j)
{
int m = (k << h) + (1 << (h - 1));
if(i == (k << h) && j == ((k + 1) << h) - 1) return T[h][k];
if(j < m) return query(h - 1, k << 1, i, j);
if(i >= m) return ... |
#include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
if(n%2==0)
cout<<"White"<<endl;
else if(n%2!=0)
cout<<"Black"<<endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int main(){
string N;
cin >> N;
N = N.substr(0, N.find_last_not_of('0') + 1);
string s;
s = N;
std::reverse(N.begin(), N.end());
// cout << s << N << endl;
if(N==s){
cout << "Yes" << endl;
return 0;
}
cout << "No" ... |
#include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define MOD (int)(1e9+7)
#define MOD1 998244353
#define ceil(x, y) ((x)%(y))==0? ((x)/(y)) : ((x)/(y)+1)
#define FOR(i, N) for(int i = 0; i < N; ++i)
#define FOR1(i, N) for(int i = 1; i <= N; ++i)
#define vi vector <int>
#define pii pair <int,... | //a solutjion from @tanmaymodi
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define ff(i,a,b) for(ll i=a;i<=b;i++)
#define bf(i,a,b) for(ll i=a;i>=b;i--)
const ll INF = 1e18;
//... |
#include <bits/stdc++.h>
#include <unordered_set>
#include <algorithm>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vs = vector<string>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repll(i,n)... | #include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define pll pair<ll,ll>
#define rep(i,n) for(ll i=0;i<n;i++)
#define mod 1000000007
#define INF 10000000000000000
#define ff first
#define ss second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define pie 3.14159... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,w;
cin >> a >> b >> w;
int m=1e9,M=0;
for(int n=1;n<=1000000;n++){
if(a*n<=1000*w && 1000*w<=b*n){
m=min(m,n);
M=max(M,n);
}
}
if(M==0)cout << "UNSATISFIABLE";
else cout << m << ' ' << M;
} | /// In the name of ALLAH
/// I'm THEOVE46
#include<bits/stdc++.h>
using namespace std;
#define gap " "
#define nn "\n"
#define pi 2*acos(0.0)
#define db double
#define ft float
#define ll long long int
#define ull unsigned long lo... |
#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define pb push_back
#define fi first
#define se second
#define ll long long
#define tp top()
#define fr front()
#define vi vect... | //Keep calm and carry on..
/* Problem :
URL :
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
# define fast ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL);
# define pb push_back
# define ... |
#include <bits/stdc++.h>
using namespace std;
// typedef long long int;
#define int long long
int const MAXN = 2e5 + 10, INF = 0x3f3f3f3f3f3f3f3f;
int T;
int a[5], m[5];
int qmi(int a, int b, int mod) {
int res = 0;
while (b > 0) {
if (b & 1) res = (res + a) % mod;
a = (a + a) % mod;
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define IFOR(i, a, b) for (long long i = (a); i <= (long long)(b); i++)
using namespace std;
using VL = vector<long long>;
using ll = int64_t;
ll mod(ll x,ll m){ll y=x%m;return (y>=0LL)?y:y+m;}
template<class T>bool chmin(T& a, T b){if(a>b){a... |
/*input
2021
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
//order_of_key #of elements less ... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define mp ... |
#include <bits/stdc++.h>
#define LL long long
#define ft first
#define sd second
#define mp(x,y) make_pair(x,y)
#define int LL
using namespace std;
//const int N = ;
//const int mod = ;
const int INF =numeric_limits<int >::max();
#define For(n) for (int i=1;i<=n;++i)
#define rep(i,n) for (int i=1;i<=n;++i)
#define re... | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ostream &operator<<(ostream &os, const... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mit map<int,int>::iterator
#define sit set<int>::iterator
#define itrm(g,x) for(mit g=x.begin();g!=x.end();g++)
#define itrs(g,x) for(sit g=x.begin();g!=x.end();g++)
#define ltype int
#define rep(i,j,k) for(ltype(i)=(j);(i)<=(k);(i)++)
#define r... | #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<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#include <ext/pb_ds/detail/standard_policies.hpp>
/*
* coder :: ATUL_PANDEY_2608
* >>> INDIA <<<
*/
using namespace std;
using namespace __gnu... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
int c,d;
cin>>c>>d;
cout<<a*d-b*c<<endl;
} |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int N;
cin >> N;
int ans;
if (N != 1) ans = N - 1;
else ans = 0;
cout << ans << endl;
} | #include <bits/stdc++.h>
#include<cmath>
#include<string>
#define pb push_back
#define x first
#define y second
#define fast ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define all(x) x.begin(),x.end()
#define int long long
#define ll long long
using namespace std;
void __print(int x) {cerr << x;}
void __print(lo... |
// Hail god Yato
#include <bits/stdc++.h>
using namespace std;
#define hs ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = 1e18;
const ll MAX = 100001;
//
//
pair<ll, ll> calc(ll b, ll c){
if(c&1)
return {-b-c/2, -b+c/2};
else{
... | #include <vector>
#include <iostream>
#define int long long
#define double long double
#define tezz ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;
signed main() {
tezz
vector<int> primes;
for (int i = 2; i < 72; i++) {
bool flag = true;
... |
#include <bits/stdc++.h>
#define repi(i, a, b) for (int i = (int)(a) ; i < (int)(b) ; i++)
#define rep(i, n) repi(i, 0, n)
#define SZ(x) ((int)(x).size())
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
using namespace std;
using P = pair<int, int>;
struct Vec{
double... | #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++)
#define all(x) x.begin(), x.end()
#ifdef _DEBUG
#define disp(x) cout << #x << " : " << x << endl
#else
#define disp(x)
#endif
using namespace std;
using ll = int64_t;
int main(){
int a, b, x... |
#include <iostream>
#include <vector>
using namespace std;
vector<vector<int>> solve(int n){
if(n==1){
vector<vector<int>> v;
v.resize(1);
v[0].push_back(0); v[0].push_back(1);
return v;
}
vector<vector<int>> u = solve(n - 1);
vector<vector<int>> v;
int x = (1<<n) - ... | #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar_unlocked(){
static char buf[1048576];
static int s = 1048576;
static int e = 1048576;
if(s == e && e == 1048576){
e = fread_unlocked(buf, 1, 1048576, stdin);
s = 0;
}
if(s == e){
return EOF;
}
r... |
#include<bits/stdc++.h>
#include <cmath>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(NULL);
long long n,m,k,l,j,p,i;
cin>>n;
for(i=1; powl(3,i)+5<=n; i++)
{
for(j=1; powl(5,j)+3<=n; j++)
{
k=powl(3,i);
m=powl(5,j);
p=m%10;
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,k,n) for(long long i=k;i<=n;i++)
#define per(i,n,k) for(long long i=n;i>=k;i--)
#define pb push_back
#define fi first
#define se second
///#pragma GCC optimize(3,"Ofast","inline")
typedef unsigned long long ull;
typedef long long ll;
typedef double db;
typedef ... |
#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
#include<utility>
using namespace std;
#define int long long
#define endl "\n"
constexpr long long INF = (long long)1e18;
constexpr long long MOD = 998244353;
struct fast_io {
fast_io(){
std::cin.tie(nullp... | #include<stdio.h>
#include<iostream>
using namespace std;
const int maxH=505,mod=998244353;
int H,W,ans;
int val[maxH<<1];
string s;
int main(){
scanf("%d%d",&H,&W);
for(int i=1;i<=H;i++){
cin>>s;
for(int j=1;j<=W;j++)
val[i+j]|=(s[j-1]=='R'? 1:(s[j-1]=='B'? 2:0));
}
ans=1;
for(int i=2;i<=H+W;i++){
if(val... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... | #include <iostream>
#include <fstream>
#include <cstdlib>
#include <bitset>
#include <map>
#include <iomanip>
#include <string>
#include <vector>
#include <cmath>
#include <queue>
#include <algorithm>
#include <sstream>
#include <set>
#include <unordered_set>
using namespace std;
#define ll long long
#define ld long ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll x,y,a,b;
void solve()
{
ll ans = 0;
while(x<y && x<=(b/(a-1))){
x*=a;
ans++;
}
if(x>=y){
cout<<ans-1<<'\n';
return;
}
ans+=(y-x)/b;
if((y-x)%b == 0) ans--;
cout<<ans<<'\n';
}
int main()
{
cin >> x >> y >> a >> b;
sol... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n - 1; 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--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#de... |
#include<bits/stdc++.h>
#define rep(i,n) for (int i =0; i <(n); i++)
using namespace std;
using ll = long long;
const double PI = 3.14159265358979323846;
const ll MOD = 1000000007;
int main(){
ll S , P ;
cin >> S >> P;
// M = S - Nを代入して N*(S-N) = Pをルートまで
for(ll i = 0; i*i <= P; i++){
if(i* (S... | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using ll = long long;
using lint = long long;
typedef vector<long long> vint;
typedef pair<long long, long long> pint;
#define MD 1000000007
#define INF INT32_MAX / 2
#define INF64 INT64_MAX / 2
#define EPS 0.001
#define REP(i, n) for (int i = 0; i < n;... |
#include<bits/stdc++.h>
#define int long long
#define zmrl(x) (int)((x).size())
#define ahen(x) (x).begin(),(x).end()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
using pii = pair<int,int>;
const int N = 10000000000LL;
signed main() {
ios_base::sync_with_stdio(f... | #include <bits/stdc++.h>
// clang-format off
using namespace std; using ll=long long; using ull=unsigned long long; using pll=pair<ll,ll>; const ll INF=4e18;
void print0() {}
template<typename H,typename... T> void print0(H h,T... t){cout<<fixed<<setprecision(15)<<h;print0(t...);}
void print() { print0("\n"); }
templat... |
#include <bits/stdc++.h>
#define file(x) freopen(#x".in", "r", stdin), freopen(#x".out", "w", stdout)
inline int read()
{
int data = 0, w = 1; char ch = getchar();
while (ch != '-' && !std::isdigit(ch)) ch = std::getchar();
if (ch == '-') w = -1, ch = std::getchar();
while (std::isdigit(ch)) data = data * 10 + (ch... | #include"bits/stdc++.h"
using namespace std;
#define pb push_back
#define eb emplace_back
#define ins insert
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define repr(i,a,b) for(int i=a;i>=b;i--)
#define lb lower_bound
#define ub upper_bound
#define sz(x... |
#include<bits/stdc++.h>
using namespace std;
#define FastIO ios_base::sync_with_stdio(false); cin.tie(0);
#define ll long long
#define ull unsigned long long
#define pb push_back
#define All(x) (x).begin(),(x).end()
#define mp make_pair
#define nl "\n"
typedef pair<int,int>ii;
typedef vector<int>vi;
typedef vector<ii>v... | #include <bits/stdc++.h>
using namespace std;
#define rep(index,num) for(int index=0;index<num;index++)
#define rep1(index,num) for(int index=1;index<=num;index++)
#define brep(index,num) for(int index=num-1;index>=0;index--)
#define brep1(index,num) for(int index=num;index>0;index--)
#define prin(a) cout<<a<<"\n"
#def... |
#include <bits/stdc++.h>
using namespace std;
typedef vector<long long> VL;
int main()
{
long long K, N, M, A, B, count;
cin >> K >> N >> M;
count = M;
priority_queue <VL> pque;
VL now;
for (int i = 0; i < K; i++)
{
cin >> A;
B = A*M;
B /= N;
count -= B;
pque.push(VL{A*M-B*N,B,i});
... | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (long long i = (s); i < (long long)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ld = long double;
using ll = long long;
using ull = unsigned long long;
using P =... |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main () {
std::ios::sync_with_stdio(false); std::cin.tie(0);
long double inx, iny, inr;
cin >> inx >> iny >> inr;
long double x = inx + 200005, y = iny + 200005, r = inr;
long long ans = 0;
for (long double p = ceil(x - r); p <= ... | #pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << '(' << ... |
#include<cstdio>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<unordered_map>
using namespace std;
typedef long long ll;
const int N = 1e6 + 50;
int k;
int res[10], mul[6];
char s[10], t[10];
int cal(char *s){
int num[10], val = 0;
for(int i = 1; i <= 9; ++i) num[i] = 0;
for... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void){
int k;
cin >> k;
int a[10];
for(int i=1;i<=9;i++) a[i] = k;
string s,t;
cin >> s >> t;
int b[10]={},c[10]={};
for(auto i:s){
if(i!='#'){
a[i-'0']--;
... |
//Bismillahir Rahmanir Raheem
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef trie<string,null_type,trie_string_access_traits<>,pat_trie_tag,trie_prefix_search_no... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define rep(i,n) for (ll i = 0;i<(n);++i)
#define all(v) v.begin(),v.end()
template <typename T>bool chmax(T &a, const T& b) {if (a < b) {a = b;return true;}return false;}
template <typename T>bool chmin(T &a, const T& b) {if (a > b) ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, s, n) for(int i = (int)(s); i < (int)(... | #include<iostream>
#include<vector>
#include<string>
#include<math.h>
#include<climits>
#include<algorithm>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<int> a(m); //青色のマスの場所(初期値1)
rep(i,m) cin >> a[i]; //青色のマスへの入力
if(m==0){
cout <<... |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long l;
cin >> l;
long long result = 1;
int a;
for (int i = 1; i < 12; i++)
{
a = l - i;
result *= a;
result /= i;
}
cout << result << endl;
return 0;
}
| #include<iostream>
#include<string>
#include<vector>
#include<utility>
#include<algorithm>
#include<map>
#include<set>
#include<cstdlib>
#include<cmath>
#include<numeric>//fill
#include<iomanip>
#include<functional>//https://cpprefjp.github.io/reference/functional/function.html
#include<cstdlib>//https://cpprefjp.githu... |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#include <cassert>
#include <random>
#include ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespa... |
#include <cstdio>
int main(){
int a[4];
for(int i=0; i < 4;i++){
scanf("%d", &a[i]);
}
int min_a = a[0];
for(int i = 1; i < 4; i++)
if(a[i] < min_a)
min_a = a[i];
printf("%d\n", min_a);
} | #include <algorithm>
#include<iostream>
#include<vector>
#include<deque>
#include<queue>
#include<stack>
#include<list>
#include<map>
#include<set>
#include<string>
#include <sstream>
#include<bitset>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<limits.h>
const int INF = 0x7fffffff;
using lll = long... |
/*
ID: omohamadooo
TASK: barn1
LANG: C++
*/
/*
___ ___ ___ ___ ___ ___ ___ _____ ___ ___ ___
/ /\ /__/\ / /\ /__/\ / /\ /__/\ / /\ / /::\ / /\ ... | #include <iostream>
#include <vector>
#include <complex>
using namespace std;
using C = complex<double>;
C rotate(C center, C vec, double rad) {
C r = {cos(rad), sin(rad)};
return center + (vec-center) * r;
}
int main() {
int N; cin >> N;
double x, y;
cin >> x >> y;
C s = {x, y};
cin >> x... |
#include <iostream>
#include<string>
#include<cmath>
#include<algorithm>
#include<cctype>
#include<queue>
#include<deque>
#include<regex>
#include<stack>
#include<stdio.h>
#include<vector>
#include<set>
#include<map>
#include<iomanip>
// #include<atcoder/all>
// using namespace atcoder;
#define rep(i,n) for(int i=0;... | #include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
#include <stack>
#include <set>
#include <bitset>
#include <functional>
#include <cassert>
using namesp... |
//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define DB double
#define LD long double
#define ST string
#define BS bitset
#define PA pair<LL... | #include <bits/stdc++.h>
#define SZ(X) ((int)(X).size())
#define pb emplace_back
#define MP make_pair
using namespace std;
using ll = long long;
using ii = pair<int,int>;
const int maxn = 1000 + 5;
const int maxk = 16 + 5;
int G[maxn][maxn] = {};
int a[maxk][2];
int seq[maxk];
map<int,int> mp;
int ans = 0;
void dfs(... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ll n;
cin >> n;
ll sum = 0;
for(ll i = 1; i <= 1000000; ++i){
sum += i;
if(sum >= n){
cout << i << endl;
return 0;
}
}
return 0;
}
| #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using pi = pair<int, int>;
using vpi = vector<pair<int, int>>;
using pl = pair<ll, ll>;
using vl = vector<ll>;
#define all(v) (v).begin(), (v).end()
#define ar array
#defin... |
/*
after dusk passed,
there is a starry sky.
*/
#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define m_k make_pair
using namespace std;
const int N=4*1e5+100;
int n,a[N];
char s[N];
inline int read()
{
int f=1,x=0;char s=getchar();
while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}
while(s>='0'&&s<='9'){x=x*10+s-'0... | #include<iostream>
using namespace std;
typedef long long ll;
int main()
{
int n,i;
ll res=0,x=0,y=1,t;//(n-1)ci=3^x*(3*z+y)
string s,tm="BWR";
cin >> n >> s;
for(i=0;i<n;i++){
if(x==0){
if(s[i]=='W')
res+=y;
else if(s[i]=='R')
res+=y*2;
}
res%=3;
if(i==n-1)
b... |
#include <bits/stdc++.h>
using namespace std;
#define fr(i,n) for(int i = 0; i<n; i++)
#define sz(v) (int)(v.size())
#define prin(a) cout << #a << " = " << a << endl
#define prinv(v) cout << #v << " = "; for(auto it : v) cout << it << ", "; cout << endl
#define all(v) (v).begin(),(v).end()
typedef long long ll;
#def... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
double check(double d, vector<double>& A) {
double val=0;
for(auto& e:A) val+=(d+e-min(e,2*d))/A.size();
return val;
}
int main() {
ll N; cin>>N;
vector<double> A(N);
for(auto& e:A) cin>>e;
// 三分探索かなあ
double low=0, high=1e10;
ll cnt... |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef std::vector<int> VI;
typedef long long ll;
typedef std::pair<int, int> ii;
template <class C> C& mini(C& a, C b) { if (b < a) a = b; return a; }
template <class C> C& maxi(C& a, C b) { if (a < b) a = b; return a; }
template <typename T> void rea... | #include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setpre... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define Rep(i,n) for(int i = 1; i <= n; i++)
#define sz(a) int(a.size())
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define debug(a) { cerr << #a << ':' << a << endl; }
#define endl '\n'
#define fi first... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
vector<int> X;
vector<vector<pair<int,int>>> B;
ll fact[20];
ll memo[18][1<<18];
bool visited[18][1<<18];
ll f(int p, int q) {
if (p == (int)X.size()-1) return fact[N-X.back()];
if (visited[p][q]) return memo[p][q];
visited[p][q] = true;
int... |
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+7;
bitset<N> pos;
long long a[N];
long long upto[N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, q;
cin>>n>>q;
for (int i=1; i<=n; i++) {
cin>>a[i];
upto[i] = a[i] - i;
}
while (q--) {
... | #include<bits/stdc++.h>
using namespace std;
int gcd(int a, int b)
{
int t =min(a,b);
a=max(a,b);
b =t;
while(a%b!=0)
{
int temp =b;
b=a%b;
a=temp;
}
return b;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,q;
cin>>n>>q;
... |
#include <iostream>
#include <vector>
#include <string>
#include <array>
#include <functional>
#include <algorithm>
#include <stack>
#include <map>
#include <set>
#include <climits>
#include <queue>
#include <bitset>
#include <cassert>
#include <math.h>
#include <complex>
#include <iomanip>
#include <unordered_map>
usi... | //Author: A_S_M_M@sud_P@rvez
#include<bits/stdc++.h>
using namespace std;
#define MP ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define For(i,n) for(int i=0;i<n;i++)
#define Forn(i,n) for(int i=1;i<=n;i++)
#define Fors(i,s) for(int i=0;i<s.size();i++)
#define all(v) v.begin(),v.end()
#defin... |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9+7;
int64_t gcdExtended(int64_t a, int64_t b, int64_t* x, int64_t* y) {
if (a == 0) {
*x = 0, *y = 1;
return b;
}
int64_t x1, y1;
int64_t gcd = gcdExtended(b % a, a, &x1, &y1);
*x = y1 - (b / a) * x1;
*y = x1;
return gcd... | // execute g++ main.cpp -std=c++14 -I C:\Users\naoya\Desktop\code\Atcoder
#include<bits/stdc++.h>
//#include<atcoder/all>
typedef long long ll;
typedef long double ld;
using namespace std;
//using namespace atcoder;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
//ordered_set 重複不可
#include <ext/pb_ds/assoc_con... |
#include <vector>
#include <list>
#include <map>
#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 <cstdlib>
#include <c... | #include "bits/stdc++.h"
using namespace std;
// 定義
typedef long long ll;
typedef pair<ll, ll> P;
#define ALL(x) (x).begin(),(x).end()
#define REP(i, n) for(ll i = 0 ; i < (ll)n ; ++i)
#define REPN(i, m, n) for(ll i = m ; i < (ll)n ; ++i)
#define VL vector<ll>
#define... |
#include<bits/stdc++.h>
using namespace std;
int check(int n,int base)
{
int flag=0;
while(n!=0)
{
int rem=(n%base);
if(rem==7)
{
flag=1;
break;
}
n/=base;
}
return flag;
}
int main()
{
int n;
cin>>n;
char a[32];
string ... | #include <bits/stdc++.h>
using namespace std;
#define fr(i,n) for(int i = 0; i<n; i++)
#define sz(v) (int)(v.size())
#define prin(a) cout << #a << " = " << a << endl
#define prinv(v) cout << #v << " = "; for(auto it : v) cout << it << ", "; cout << endl
#define all(v) (v).begin(),(v).end()
typedef long long ll;
#def... |
#include <cstdio>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long int;
int N;
const int MAXN=205;
int A[MAXN];
bool dp[MAXN][MAXN][MAXN];
int ans[MAXN][MAXN][MAXN];
bool dp2[MAXN][MAXN];
int ans2[MAXN][MAXN];
int main(){
scanf("%d",&N);
for(int i=1;i<=N;i++)... | #pragma region head
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using pi = pair<int, int>;
using pll = pair<ll, ll>;
template <class T>
using vv = vector<vector<T>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (in... |
#include <iostream>
#include<string>
using namespace std;
int main() {
string S;
cin >> S;
bool unreadable = true;;
int s = S.length();
for(int i = 0;i < s;i++) {
if(i%2==0){
if(!islower(S[i])){
unreadable=false;
}
}else{
if(!isupper(S[i])){
unreadable=false;
}
}
}
if(unreadable) {
... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <random>
#include <queue>
#include <stack>
#include <bitset>
#include <cassert>
#include <unordered_map>
#include <iomanip>
#define int long long
#define double long double
#define rep(i,... |
#include "bits/stdc++.h"
using namespace std;
int main(){
long long ans = 0;
long long N;
cin >> N;
long long A[N], B[N], C[N];
for(int i = 0; i < N; i++){
cin >> A[i];
A[i]--;
}
for(int i = 0; i < N; i++){
cin >> B[i];
B[i]--;
}
for(int i =... | #include<bits/stdc++.h>
using namespace std;
// GCC Optimizations
#pragma GCC optimize("Ofast")
#pragma GCC target("fma,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
//MACROS
#define ll long long
//to be excluded in critical cases(thanks to @Amank2854) https://cod... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout<<2*a+100-b<<endl;
} | #pragma region head
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using pi = pair<int, int>;
using pll = pair<ll,ll>;
template <class T> using vv = vector<vector<T>>;
#define rep(i,n) for(int i = 0; i < (int)(n); i... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i, st, en) for (ll i = (ll)st; i < (ll)(en); i++)
#define repm(i, st, en) for (ll i = (ll)st; i >= (ll)(en); i--)
#define all(v) v.begin(), v.end()
void c... | #include <bits/stdc++.h>
using namespace std;
#define vt vector
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
using ll = long long;
using pii = pair<int, int>;
#define die retu... |
#include <bits/stdc++.h>
using namespace std;
int k,p[200005];
vector<int> divk[200005];
long long ans;
int main() {
cin>>k;
for (int i=1; i<=sqrt(k); i++) {
for (int j=i; i*j<=k; j++) {
if (i!=j) p[i*j]+=2;
else p[i*j]++;
}
}
for (int i=1; i<=k; i++) {
fo... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("inp.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int n;
cin>>n;
if(n%100==0)
cout<<n/100;
... |
#include<bits/stdc++.h>
typedef long long ll;
#define mod 1000000007
ll gi(){
ll x=0,f=1;
char ch=getchar();
while(!isdigit(ch))f^=ch=='-',ch=getchar();
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
std::mt19937 rnd(time(NULL));
#define rand rnd
#define pr std::pair<int,int>
#define all(x) (x).beg... | //yukicoder@cpp14
//coder:luckYrat(twitter:@luckYrat_)
//dijkstraから逃げるな
//おすすめの曲
//https://soundcloud.com/nagiha/alice-in-a-xxxxxxxx
//https://soundcloud.com/synthion/sweetheart
//せんげん！
#include <iostream>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <string>
#include <vector>
#include <set>
#in... |
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
#define all(v) v.begin(), v.end()
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep_up(i, a, b) for (ll i = a; i < b; ++i)
#define rep_down(i, a, b) for (ll i... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
// 負の数にも対応した mod
// 例えば -17 を 5 で割った余りは本当は 3 (-17 ≡ 3 (mod. 5))
// しかし単に -17 % 5 では -2 になってしまう
inline long long mod(long long a, long long m) {
re... |
#include <bits/stdc++.h>
using namespace std;
int n;
string s;
int ans;
int t;
int main() {
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'o') {
t++;
}
}
if (t > 4) {
cout << 0 << endl;
return 0;
}
for (int a = 0; a <= 9; a++) {
for ... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(void){
int N;
char s[200001];
int cnt = 0;
char ptr[4] = "110";
char p[200010];
int flag = 0;
long long ans = 0;
scanf("%d", &N);
scanf("%s", s);
for(int k = 0;k < (N + 2)/ 3 + 1;k++){
memcpy(p + k * 3, ptr, 3... |
#pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <bitset>
#include <fstream>
#include <c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w, ans = 0;
cin >> h >> w;
char s[h][w];
for (int i = 0; i < h; i++)
for (int j = 0; j < w; j++)
cin >> s[i][j];
for (int i = 0; i < h - 1; i++)
for (int j = 0; j < w; j++)
if (s[i][j] == '.' && s[i + 1][j] == '.')
... |
#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <functional>
#include <vector>
#include <numeric>
int main(){
int N,X; std::cin >> N >> X;
std::string s;
std::cin >> s;
for(const auto& c : s){
X += (c == 'o' ? 1 : -1);
X = std::max(0,X);
}
... | #include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i <=b ; ++i)
#define per(i, b, a) for(int i = b; i >= a; --i)
#define ll long long
#define pb push_back
using namespace std;
inline void rd(int &x){scanf("%d", &x);}
inline void rd(ll &x){scanf("%lld", &x);}
int n, m, k;
const int maxn = 1145;
int par[maxn <<... |
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pi 3.1415926535897932384626433832795
#define FOR(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define FORL(i, a, n) for (ll(i) = (a); (i) <= (n); (i)++)
#define FORR(i, a, n) for (ll(i) = (a); (i) >= (n); (i)--)
#define FORSQ(i, a, n) for (ll(i) ... | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include <atcoder/all>
using namespace std;
//using namespace boost::multiprecision;
//using namespace atcoder;
typedef long long ll;
#define FOR(i, a, n) fo... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
ty... | #include <bits/stdc++.h>
using namespace std;
const int inf = 1000000009;
const int maxn = 100005;
const int maxk = 17;
vector <int> g_init[maxn];
vector <pair <int, int> > g[maxk];
int d[maxk][1 << maxk];
int32_t main () {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
for (int i = ... |
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define pii pair<int, int>
#define pll pair<long long,long long>
#define vl vector<long long>
#define vll vector<pll>
#define vi vector<int>
#define vii vector<pii>
#define... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define p(x,y) pair<x,y>
#define oset(x) tree<x, null_type, less<x>, rb_tree_tag, tree_order_statistics_node_update>
#define all(x) (x).begin(),(x).end()
#define ll ... |
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long LL;
const int MAXN = 55;
const int MOD = 1E9 + 7;
LL n, x, a[MAXN], g[MAXN], dp[MAXN][2];
template <class T>
void read(T& x) {
x = 0;
T f = 1;
char ch = getchar();
while (ch < '0' || ch ... | /**
* author: Dooloper
* created: 01.05.2021 20:57:29
**/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define repp(i,k, n) for(int i = (int)(k); i < (int)(n); i++)
#define ALL(a) (a).begin(),(a).end()
using ll = long long;
using P = pair<int, int>;
struct Ed... |
#include<bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);
#define ll long long
#define t() int t;cin>>t;while(t--)
#define lt() long long int t;cin>>t;while(t--)
#define ff first
#define ss second
#define pb ... | #include<bits/stdc++.h>
#define int long long
using namespace std;
const int maxn=200005;
const int inf=1ll<<60;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
int a,b;
cin>>a>>b;
cout<<(b%a==0?"Yes":"No");
} |
// This code wrote by chtholly_micromaker(MicroMaker)
#include <bits/stdc++.h>
#define reg register
#define int long long
#define ALL(x) (x).begin(),(x).end()
#define mem(x,y) memset(x,y,sizeof x)
#define sz(x) (int)(x).size()
#define ln std::puts("")
#define lsp std::putchar(32)
#define pb push_back
#define MP std::ma... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=n... |
#include<bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int x, y; cin >> x >> y;
if(abs(x-y) < 3){
cout << "Yes";
}else{
cout << "No";
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define tc ll t;cin>>t;while(t--)
#define PI 2*acos(0)
#define mset(pq) memset(pq, 0, sizeof(pq));
ll M=1e9+7;
int sum_digit(int x) { int sum=0; while(x>0){ sum+=x%10; x/=10; } return sum; }
int reverse_num(int n){ int tmp=n, ans=0, r; while(tmp>... |
#include <iostream>
#include <cstdio>
#include <stdio.h>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
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; }
#define rep(i,cc,n) for(int i=cc... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main()
{
int h, w;
cin >> h >> w;
vector<string> s(h);
rep (i, h)
cin >> s[i];
int ans = 0;
rep (i, h)
rep (j, w)
{
if (j + 1 < w && s[i]... | #include <bits/stdc++.h>
#define LL long long
#define LD long double
#define MAXN
#define MAXM
#define P 998244353
#define MP make_pair
#define PB push_back
#define INF 0x3f3f3f3f
#define dbg(a...) fprintf(stderr, a)
using namespace std;
int h, w, ans=1;
char mp[505][505];
int main()
{
scanf("%d%d", &h, &w);
f... |
#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
#define rep(i, a, n) for (int i=(a); i<(n); i++)
#define per(i, a, n) for (int i=(a); i>(n); i--)
typedef long long ll;
const int maxn = 2e5+5;
const int mod = 1e9+7;
using namespace std;
ll a[maxn], ti[maxn];
void solve() {
ll n,q,t; cin >> n;
ll L=0,R=0,add=0,ext=1e... | #include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#in... |
#include <algorithm>
#include <array>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
#... | #include<iostream>
using namespace std;
int main(){
int a,i,ii,N,co=0,b;
cin >> N;
for(i=1;i<=N;i++){
a=0;
if(i%10==7||i%100-i%10==70||i%1000-i%100==700||i%10000-i%1000==7000||i%100000-i%10000==70000){
a=a+1;
}
for(ii=i;ii>0;i=i){
b=ii%8;
ii=ii/8;
if(b==7)a=a+1;
}
i... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i... | #include <iostream>
#include <string>
using namespace std;
string S;
int main() {
cin >> S;
printf("%c%c%c\n", S[1], S[2], S[0]);
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,srt,end) for(int i = (srt); i < (int)(end); i++)
//cout << std::fixed << std::setprecision(15) << y << endl;
// For debug
// Ref: https://qiita.com/ysuzuki19/items/d89057d65284ba1a16ac
#define dump(var) do{std::cerr << #var << " : ";vie... | #include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fir first
#define sec second
#define SZ(a) (int)((a).size())
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef double db;
typedef pair <int, int> Pii;
typedef pair <ll, int> Pli;
typedef unsigned long long u... |
#include<bits/stdc++.h>
using namespace std;
long long a,b,len;
typedef long long ll;
ll dp[75][1<<20],pk;
vector<long long> m,p={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71};
int main()
{
cin>>a>>b;
len=b-a+1;
for(ll i=a;i<=b;i++) m.push_back(i);
pk=p.size();
dp[0][0]=1;
for(ll i=0;... | #include<bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
#define pow(n,m) powl(n,m)
#define sqrt(n) sqrtl(n)
const ll MAX = 5000000000000000000;
const ll MOD = 0;
void randinit(){srand((unsigned)time(NULL));}
int main(){
ll N,M;
cin >> N >> M;
vector<tuple<ll,ll>> A(0);... |
#include <bits/stdc++.h>
//#include <atcoder/all>
//#include "Z:\2_Src\31_Luzhiles_s.git\template\template.cpp"
using namespace std; //using namespace atcoder;
template<typename T> using ve=vector<T>;
using ll=long long; using ld=long double; using str=string; using pint=pair<ll,ll>;
using vll=ve<ll>; using vd=ve<ld>... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N, M, Q;
cin >> N >> M >> Q;
vector<pair<long long, long long>> v;
for(int i = 0; i < N; ++i) {
long long W, V;
cin >> W >> V;
v.push_back({V, W});
}
sort(v.begin(), v.end(), greater<pair<long long, long long>>());
vector<pair<long ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define mp make_pair
#define fr first
#define sc second
int n;
ll v[400010];
int main(){
scanf("%d",&n);
for(int i=0;i<2*n;i++)scanf("%lld",&v[i]);
ll ret=0;
priority_queue<ll> que;
for(int i=0;i<n;i++){
que... | #include <algorithm>
#include <any>
#include <atomic>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdint>
#include <deque>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define int lo... |
/*
Author: QAQAutoMaton
Lang: C++
Code: C.cpp
Mail: lk@qaq-am.com
Blog: https://www.qaq-am.com/
*/
#include<bits/stdc++.h>
#define debug(qaq...) fprintf(stderr,qaq)
#define DEBUG printf("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define Debug debug("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define all(... | #include<bits/stdc++.h>
#define inf 1e18
#define endl "\n"
#define mp make_pair
#define pb push_back
#define loop(i,x,y) for(int i = x; i < y ; i++ )
#define all(x) (x).begin(),(x).end()
#define in(n) int n; cin>>n;
#define inarr(arr,n) vector<int>arr(n); for(int i = 0; i < n ; i++){cin>>arr[i];}
#define maploop(... |
#include <bits/stdc++.h>
using namespace std;
#define int ll
typedef long long ll;
typedef long double ld;
void print(vector<int> v) {
cout << " ---> ";
for (auto &x : v) {
cout << x << " ";
}
cout << "\n";
}
int over = 0;
vector<int> get(vector<int> a) {
vector<int> init = a;
vector<int> sol;
in... | #include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
#define rep(i, n) for(int i=0;i<n;i++)
#define all(i, v) for(auto& i : v)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
ll n;
ll sol... |
#include<bits/stdc++.h>
using namespace std;
#define author "Sihare0riginals"
#define ss string
#define lli long long int
#define ld long double
#define f first
#define s second
#define all(v) v.begin(),v.en... | #include <bits/stdc++.h>
#define pi pair<int, int>
#define pb push_back
#define l first
#define r second
using namespace std;
const int maxn = 2e5 + 1, mod = 1e9 + 7;
int n;
string s;
bool subzero[101];
vector<int> v[10001];
int a[101], b[101], vl[101], c[101];
int cc = 0;
int32_t main() {
ios::sync_with_stdio(... |
#include <bits/stdc++.h>
typedef long long ll;
//forループ
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
//Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#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 FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;... | #include <bits/stdc++.h>
#pragma GCC optimize(2)
#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_b... |
#include<bits/stdc++.h>
long long n,x;
long long ans[2],k[2],a,b,c,now;
int main()
{
scanf("%lld%lld",&n,&x);
scanf("%lld",&b);
ans[0]=1;ans[1]=0;
for(int i=1;i<n;++i)
{
scanf("%lld",&a);
c=a/b;b=a;
now=x%c;
x/=c;
k[0]=ans[0],k[1]=ans[1];
if(now)k[1]+=ans[0];
if(++now!=c)k[0]+=ans[1];
ans[0]=k[0]... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int gcd(int x, int y) { return (x % y)? gcd(y, x % y): y; } //最大公約数
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; } //最小公倍数
using Graph = vector<vector<int>>;
ll inf=300000000000000000;
const d... |
#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(v) v.begin(), v.end()
#define V vector
#define debug(v) for(auto i: v) cout << i << " "; cout <<endl
#define vcin(v) rep(i, v.size()) cin >> v[i]
#define wcin(v, w) rep(i, v.size()) cin... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
ll n,m;
cin>>n>>m;
vector<ll> a(m);
if(m==0){
cout<<1;
return 0;
}
for(int i=0;i<m;i++) cin>>a[i];
sort(a.begin(),a.end());
ll prev=0;
vector<ll> nums;
f... |
#include <bits/stdc++.h>
using namespace std;
#define reps(i, a, n) for (int i = (a); i < (n); ++i)
#define rep(i, n) reps(i, 0, n)
#define deps(i, a, n) for (int i = (a); i >= (n); --i)
#define dep(i, n) deps(i, n, 0)
#define inf LLONG_MAX
#define int long long
signed main(void)
{
int n; cin >> n;
int ans = -1;
re... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a ;
cin>>a;
vector<vector<int>> s(a,vector<int>(3));
for(int i =0;i<a;i++){
for(int j =0;j<3;j++){
cin>>s.at(i).at(j);
}}
int ans=s.at(0).at(1);
bool bo =true;
for(int i =0;i<a;i++){
... |
#include <bits/stdc++.h>
using namespace std;
int64_t beki(int64_t n){
vector<int64_t> vec(50);
int64_t x,i,s,ans;
i=0;
ans=1;
x=1000000005;
while(x>0){
vec.at(i)=x%2;
x=x/2;
i++;
}
s=n;
for(int64_t j=0;j<50;j++){
if(vec.at(j)==1){ans=(ans*s)%1000000007;}
s=(s*s)%1000000007;
}
return ans; ... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <ctime>
#include <ctype.h>
#include <string>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
#define INF 0x3f3f3f3f
#define eps 1e-8
// #define _
using namespace std;
typedef long lo... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define fp(a,i,c) for ( int (a)=(i); (a)<(c); (a)++)
#define fm(a,b,c) for ( int (a)=(b); (a)>=(c); (a)--)
char a[9999][9999];
vector... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int read()
{
char c;
int w=1;
while((c=getchar())>'9'||c<'0')if(c=='-')w=-1;
int ans=c-'0';
while((c=getchar())>='0'&&c<='9')ans=(ans<<1)+(ans<<3)+c-'0';
return ans*w;
}
int k;
string a,b;
int t[10];
int tot1[10];
int tot2[10];
double check(int id)... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int cnt = 0;
int tmp1 = 0;
int tmp2 = 0;
int tmp3 = 0;
while(tmp1 <= 10000){
tmp1 += 6;
if((tmp1 % 5 != 0)&&(tmp1 <= 10000)){
cout << tmp1 << " ";
cnt++;
if(cnt == N) break;
}
tmp2 += 10;
if((... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
constexpr ll MOD=1000000007;
constexpr ll INF=2e18;
int main(){
int n; cin >> n;
VI a; a.push_ba... |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define repi(i,a,b) for(ll i=... | #include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
#include <map>
using namespace std;
#define int long long
main() {
int t;
cin >> t;
while (t--){
int n;
cin >> n;
int cnt = 0;
while (n % 2 == 0){
n /= 2;
cnt++;
... |
#include<bits/stdc++.h>
#define MAXM 205
typedef long long ll;
using namespace std;
ll n,m;
ll cnt[3],ans;
char a[MAXM];
int main(){
cin>>n>>m;
ll zz = 0;
for(int i = 1 ; i <= n ; i++){
zz = 0;
scanf("%s" , a + 1);
for(int j = 1 ; j <= m ; j++)zz += (a[j] == '1');
zz %= 2;
if(zz % 2 == 1)ans += cnt[0];
... | #include<bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x...) do { cout << "\033[32;1m " << #x << " -> "; err(x); } while (0)
void err() { cout << "\033[39;0m" << endl; }
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x) { for (auto v: a) cout << v << ' ';... |
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef long long ll;
typedef long d... | // C - Unlucky 7
#include <bits/stdc++.h>
using namespace std;
string to_oct(int i){
string r = "";
for(; i; i/=8) r += i%8 + '0';
return r;
}
int main(){
int n; cin>>n;
int ans = 0;
for(int i=1; i<=n; ++i) ans += (int)(to_string(i) + to_oct(i)).find("7") < 0;
cout<< ans <<endl;
}
|
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<cstdint>
#include<cstddef>
#include<vector>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
using i32 = int_fast32_t;
using i64 = int_fast64_t;
using usize = uint_fast64_t;
#def... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll = long long;
#define rep(i, n) for (int i=0; i<(int)(n); ++(i))
#define rep3(i, m, n) for (int i=(m); (i)<(int)(n); ++(i))
#define repr(i, n) for (int i=(int)(n)-1; (i)>=0; --(i))
#define rep3r(i, m, n) for (int... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define is_in(x,l,r) ((l) <= (x) && (x) < (r))
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)),x.end())
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(c) (c).begin(), (c).end()
#define ALL... | #include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
int abs(int x){
if(x<0) return -x;
else return x;
}
int ju(int x,int y){
if(x<2||x>2*y) return 0;
else return y-abs(x-(y+1));
}
int main()
{
int n,k;scanf("%d%d",&n,&k);
ll Ans=0;
for(int i=2;i<=2*n;i++) Ans+=((ll)ju(i,n)*ju(i-k,n));
... |
#include <algorithm>
#include <deque>
#include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int n = S.length();
deque<char> deq;
bool is_rev = false;
for (int i = 0; i < n; i++) {
char c = S[i];
if (c == 'R') {
is_rev = !is_rev;
} else {
if (is_rev) {
... | /*
author: Divy Agrawal
*/
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define bg begin
#define ed end
#define sz size
#define mkp make_pair
#define pb push_back
#define ll long long
#define f0(i,n) for(int i=0;i<n;i++)
#define f1(i,n) for(int i=1;i<=n;i++)
#define fe0(i,n) for(int ... |
// Problem : B - Orthogonality
// Contest : AtCoder - AtCoder Beginner Contest 188
// URL : https://atcoder.jp/contests/abc188/tasks/abc188_b
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
using namespace std;
typedef long long... | #include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s; cin >> s;
if( s[0] == s[1] && s[0] == s[2] ){
cout << "Won\n";
}
else{
cout << "Lost\n";
}
}
|
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
const int maxn=2e5;
int n;
int a[maxn+5],b[maxn+5];
int c[maxn+5];
int p[maxn+5],id[maxn+5];
int anss;
bool used[maxn+5];
struct Ans{
int x,y;
}ans[maxn+5];
bool check(){
for(int i=1;i<=n;i++)
if(p[i]!=i&&b[p[i]]>=a[i]) return 1;
return 0;
}... | #include <bits/stdc++.h>
#define REP(i,a,b) for (int i = (a); i <= (b); ++i)
using namespace std;
const int maxn = 2e5+10;
int n, a[maxn], b[maxn], p[maxn];
int pre[maxn];
vector<pair<int,int> > ans;
void debug() {
printf("p: ");
REP(i,1,n) printf("%d%c", p[i], " \n"[i==n]);
printf("pre: ");
REP(i,1,n) printf("%... |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double db;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tre... | #include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <stdint.h>
#include <string.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#in... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v... | #include <iostream>
#include <vector>
#define int long long
signed main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int n;
std::cin >> n;
int dp[n+1];
dp[0] = 0;
std::vector<int> poss(26, n+1);
std::string s;
std::cin >> s;
for(int i = 1; i <= n; i++) {
int j = s[i-1]-'a';
d... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.