code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, m, k = 0, ans = 0;
cin >> n >> m;
vector<int64_t> a(m + 1, 0);
map<int64_t, int> s;
for (auto i = 0; i < m; i++) cin >> a[i];
a.push_back(n + 1);
sort(a.begin(), a.end());
for (auto i = 0; i < (int)a.size() - 1; i++)
... | #include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=1000000007;
int p(int A,int B){
if(!B)return 1;
if(B&1)return p(A,B-1)*A%mod;
int C=p(A,B/2);
return C*C%mod;
}
signed main(){
int H,W,cnt=0,ans=0;
cin>>H>>W;
vector<string> A(H);
for(string &S:A)cin>>S;
vector<vector<int... |
#include<iostream>
using namespace std;
int main(void){
int a,b,x,y;
int ans;
cin >> a >> b >> x >> y;
ans = 0;
if(a < b){
if(x*2 < y){
ans = (b - a + 1) * x + (b - a) * x;
}
else{
ans = (b - a) * y + x;
}
}
else if(a > b){
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
struct Vertex {
vector<pll> edge;
};
int mai... |
#include <bits/stdc++.h>
using namespace std;
int _ = (cout << fixed << setprecision(9), cin.tie(0), ios::sync_with_stdio(0));
using Int = long long;
vector<int> solve(vector<int> P) {
int N = P.size();
for (auto &p : P) p--;
vector<int> ans;
int pos = 0;
auto op = [&](int n) {
assert(ans.si... | #include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<iostream>
#include<vector>
using namespace std;
const int N=4e5+5;
int s[N],t,n;
struct node {
int x,id;
inline bool operator < (const node &a) const {return x!=a.x?x<a.x:id<a.id;}
}a[N];
bool tp[N];
int main() {
scanf("%d",&n);
... |
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <cmath>
using namespace std;
long long a[105][105], k, b[105];
int n, m;
string st;
int main()
{
for (int i = 1; i <= 60; i++) {a[0][i] = 1; a[i][0] = 1;}
for (int i = 1; i <= 60; i++)
for (int j = 1; j <= i; j++)... | #include "bits/stdc++.h"
using namespace std;
long long ncr(long long a,long long b)
{
long long m=1;
for(int i=a;i>b;i--)
{
m*=i;
m/=a-i+1;
}
return m;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
long long a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, m = 0, n =... |
//To debug : g++ -g file.cpp -o code
//to flush output : fflush(stdout) or cout.flush()
//cout<<setprecision(p)<<fixed<<var
//use 1LL<<i to for 64 bit shifting , (ll)2 because by default 2 is ll
//take care of precedence rule of operators
//do not forget to change the sizes of arrays and value of contants and other t... | #include<bits/stdc++.h>
#define pb push_back
#define ll long long
#define ld long double
#define lld long double
using namespace std;
clock_t time_p=clock();
void Time() {
time_p=clock()-time_p;
cerr<<"Time Taken : "<<(float)(time_p)/CLOCKS_PER_SEC<<"\n";
}
const int INF = 1e9 + 7;
lld pi=3.141592653589793... |
//#pragma GCC optimize(2)
#include <bits/stdc++.h>
#define IO (ios::sync_with_stdio(false), cin.tie(0), cout.tie(0))
#define inf 0x3f3f3f3f
#define ll long long
#define pii pair<int, int>
#define vs vector<int>
#define pk push_back
#define vss vector<vector<int> >
#define sz(x) (int)(x).size()
#define mk(a, b) make_pai... | #include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
bool flag = true;
for (int i = 0; 2*i <= s.length(); i++)
{
if (s[2*i] >= 65 && s[2*i] <= 90)
{
flag = false;
}
}
for (int i = 0; 2*i+1 <= s.length(); i++)
{
if (... |
/* Be patient, things will be at their rightful place.
Everything happens for a reason.
It was meant to happen this way, accept it.
And now decide what you can do about it.
*/
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define ip pair<ll,ll>
#define vii vector<ll>
#define v... | #include<bits/stdc++.h>
using namespace std;
const int maxH = 16;
const int maxW = 16;
int config[maxH][maxW];
int h,w,a,b;
long long find_ans(int r,int c,int rem)
{
if(rem==0){
return 1;
}
if(c == w)
return 0;
long long ans = 0;
int i1=-1;
for(int i=r;i<h;i++)
{
if(config[i][c] == 0)
{
i... |
#include<iostream>
#include<math.h>
#include<stdlib.h>
#include<string>
#include<limits.h>
#include<utility>
#include<vector>
//#include<bits/stdc++.h>
#include<tuple>
#include<queue>
#include<map>
#include<algorithm>
//#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;i++)
#define ALL(A) A.begin(),A.end()
us... | #include <bits/stdc++.h>
using ll = long long int;
ll mod_pow(ll n, ll r, ll mod) {
ll ans = 1;
ll pow = n;
while (r > 0) {
if (r & 1) {
ans = (ans * pow) % mod;
}
pow = (pow * pow) % mod;
r >>= 1;
}
return ans;
}
int main() {
ll MOD = 1e9 + 7;
... |
#include <bits/stdc++.h>
using namespace std;
//TEMPLATE
#define len(a) (ll) a.size()
#define ms(a, x) memset(a, x, sizeof a)
#define bitcount(n) __builtin_popcountll(n)
#define FR ios_base::sync_with_stdio(false);cin.tie(NULL)
#define cin1(a) cin >> a
#define cin2(... | #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 <bits/stdc++.h>
#ifndef aly_local
#include <ext/rope>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
template<typename T>
#define oset(T) tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>
void __funxc(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define ROF(i, a, b) for (ll i = (b)-1; i >= (a); --i)
#define rep(a) for (ll i = 0; i < a; ++i)
#define fio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
co... |
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define ll long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i,n) for(i=0;i<n;i++)
#define forn(i, n) for (ll i = 0; i < (l... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <complex>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#include <queue>
#define INF 1010101010
#define INFLL 1010101010101010101
using namespace std;
int mod = 100000... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n;
int k;
string s;
int main(){
cin>>s>>k;
for(int i=0;i<k;i++){
ll a,b,ant;
ant=1;
a=0;
b=0;
string st;
sort(s.begin(),s.end());
st=s;
reverse(st.begin(),st.end());
for(int i=s.size()-1;i>=0;i--){
a+=(s[i]-'0')*ant;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll n, k;
ll g1(ll x){
if(x == 0) return 0;
string S = to_string(x);
vector<int> V;
for(char s : S){
int i = s-'0';
V.push_back(i);
}
sort(V.begin(), V.end(), greater<int>());
string R = "";
for(int v : V) R += to_string(v);
l... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,i1,n) for(int i=(int)(i1);i<(int)(n);i++)
#define ll long long
#define vi vector<int>
#define vll vector<long long>
using graph = vector<vector<int>>;
int main() {
string s;
cin>>s;
int count=0;
rep(i,0,9){
if(s.at(i)=='Z'&&s.at(i+1)=='O'&&s.at... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define V vector
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), ... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
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; }
#define M 1502
int a[M][M];
int b[M][M] = {};
signed main(){
int h, w;... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <functional>
#include <stdio.h>
#include <ctype.h>
#include <random>
#include <string.h>
#include <unordered_map>... |
#include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = std::vector<int>;
using Vl = std::vector<ll>;
using Pii = std::pair<int, int>;
using Pll = std::pair<ll, ll>;
constexpr int I_INF = std::numeric_limits<int>::max();
constexpr ll L_INF = std::numeric_limits<ll>::max();
templ... | #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 Head,typename... Tail> void print0(Head head,Tail... tail){cout<<fixed<<setprecision(15)<<head;print0(tail...);}
void p... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 70 * 70 ;
int dp[N][N];
const string s = "atcoder";
int main()
{
cout.precision(15);
ll n;
ll ans1 = 0, ans2 = 0, ans3 = 0, x;
cin >> n;
for(int i=0;i<n;i++)cin >> x, ans1+=abs(x),ans2+=abs(x)*abs(x), ans3 = max(ans3, a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << end... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = long double; // or double, if TL is tight
using str = string; // yay python!
using pi = pair<int,int>;
using pl = pair<ll,ll>;
using pd = pair<db,db>;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vec... | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const double pi = 3.1415926535897932384626433832795028841971693993751058209749445923;
#define FOR(i, a, b) for(ll i = a; i < b; ++i)
#define beg begin()
#define ll long long
#define vll vector <ll>
#define pb push_back
#define mkp make_pair
#de... |
#include<bits/stdc++.h>
using namespace std;
#define INF 1234567890
#define ll long long
int N;
string s;
int main()
{
ios::sync_with_stdio(0); cin.tie(0);
cin.exceptions(ios::badbit | ios::failbit);
cin >> N >> s;
if (s[0] != s.back()) { cout << "1\n"; return 0; }
for(int i=1; i<N; i++)
if (s[i-1] != s[0] &&... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<map>
#include<queue>
#include<deque>
#include<iomanip>
#include<tuple>
#include<cassert>
#include<set>
#include<complex>
#include<numeric>
#include<functional>
#include<unordered_map>
#in... |
#include<iostream>
#include<set>
#include<vector>
using namespace std;
typedef long long li;
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) { cout << t; if (sizeof...(ts)) cout << ... | #include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<algorithm>
#include<cstring>
using namespace std;
int n, m;
int a[510][510];
int b[510][510];
long long dist[510][510];
priority_queue<pair<long long, pair<int, int>>, vector<pair<long long, pair<i... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read()
{
int x=0,flag=1;
char ch=getchar();
while(ch<'0'||ch>'9')
{
if(ch=='-')
flag=0;
ch=getchar();
}
while(ch>='0'&&ch<='9')
{
x=(x<<1)+(x<<3)+ch-'0';
ch=getchar();
}
return (flag?x:~(x-1));
}
int n,x,v,p;
signed mai... | #include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int vsum = 0;
x *= 100;
for (int i = 0; i < n; ++i) {
int v, p;
cin >> v >> p;
vsum += v * p;
if (x < vsum) {
cout << i + 1 << endl;
break;
}
}
if (vsum <= x)
cout << -1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<ll> fac;
ll p=1e9+7;
ll power(ll a, ll x) {
ll ans=1;
while(x) {
if(x&1) {
ans=(ans*a)%p;
}
x=x>>1;
a=(a*a)%p;
}
return ans;
}
void pre(int n) {
ll x=1;
fac.push_back(x);
for(ll i=1; i<=n; i++) {
x=(x*i)%p;
fac.push_back(x)... | #include<iostream>
#include<cmath>
long long func(double a,double b){
long long hb,lb;
if (b>=0||b<0&&((long long)b)-b==0) hb=(long long) b;else hb=(long long) b-1;
if (a<=0||a>0&&((long long)a)-a==0) lb=(long long) a;else lb=(long long) a+1;
return hb-lb+1;
}
using namespace std;
int main(){
long double x,y,r;
c... |
#include <bits/stdc++.h>
using namespace std;
# define deb_v(x) cerr << #x << " = ("; \
for (auto item: x) cerr << a[i] << " "; \
cerr << ")\n";
# define deb(x) cerr << #x << " = " << x << "\n";
void solve(int t) {
}
int main() {
int x;
scanf("%d", &x);
if (x >= 0) {
printf("%d\n", x);... | #define DEBUG 0
#include <bits/stdc++.h>
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define rep(i,n) for(int i=0; i<(n); i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i, begin, end) for(int i = int(begin); i < int(end); i++)
using namespace std;
using ll = long long;
using ld = long ... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
#include<iostream>
#include<cstring>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(... | //雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se seco... |
#include <algorithm>
// #include <atcoder/all>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <tuple>
#include <unordered_map>
#include <vector>
/*
cd $dir && g++ -std=c++17 -Wall -Wextra -O2 -DATCODERDEBUG
-I/mnt/d/MyProjects/atcoder/l... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
#define reps(i,s,n) for(int i=s; i<n; i++)
#define per(i,n) for(int i=n-1; i>=0; i--)
#define pers(i,n,s) for(int i=n-1; i>=s; i--)
#define all(v) v.begin(),v.end()
#define fi first
#define se second
#define pb push_back
#define si(v) int(v.size())
#defin... |
#include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <iomanip>
#include <set>
#include <ctime>
#include <tuple>
#include <bitset>
#include <assert... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
int main() {
ll A, B, C;
cin >> A >> B >> C;
ll mod = 998244353;
ll inv2 = (mod+1)/2;
ll X = A*(A+1)%mod*inv2%mod;
ll Y = B*(B+1)%mod*inv2%mod;
ll Z = C*(C+1)%mod*inv2%mod;
ll ans = X*Y%mod*Z%mod;
... |
#include<bits/stdc++.h>
using namespace std;
#define MAXN 5005
#define lowbit(x) (x&-x)
#define reg register
#define mkpr make_pair
#define fir first
#define sec second
typedef long long LL;
typedef unsigned long long uLL;
const int INF=0x3f3f3f3f;
const int mo=998244353;
const LL jzm=2333;
const int iv2=499122177;
con... | #include <bits/stdc++.h>
using namespace std;
const int maxn=210;
int n;
unsigned long long C[maxn][maxn];
int main() // C(n-1,11)
{
cin>>n;n--;
for(int i=0;i<=n;i++) C[i][0]=1;
for(int i=1;i<=n;i++) for(int j=1;j<=12;j++) C[i][j]=C[i-1][j]+C[i-1][j-1];
cout<<C[n][11];
return 0;
} |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define pb push_back
#define INF 9223372036854775807ll
#define endl '\n'
#define pii pair<ll int,ll int>
#define vi vector<ll int>
#define all... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30)-1;
const int M... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=18,M=205;
long long dp[(1<<N)+5];
int n,m,x[M],y[M],z[M];
vector<pair<int,int> >g[N+5];
int main(){
cin>>n>>m;
for(int i=1;i<=m;++i) cin>>x[i]>>y[i]>>z[i],g[x[i]].push_back(make_pair(y[i],z[i]));
for(int i=0;i<=n;++i) sort(g[i].... | #include <bits/stdc++.h>
const long long INF = 1e9;
const long long MOD = 1e9 + 7;
//const long long MOD = 998244353;
const long long LINF = 1e18;
using namespace std;
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIB... |
#include <bits/stdc++.h>
#include <vector>
#include <fstream>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define ll unsigned long long
int main() {
//入力
int n;
cin >> n;
//処理
if (n % 2 ... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
if (n%2 == 0) {
cout << "White" << endl;
} else {
cout << "Black" << endl;
}
} |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include <functional>
#include <iomanip>
#include<cmath>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int GetDigit(ll num) {
int a = 0;
while (num) {
num /= 10;
... | #include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <unordered_set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
type... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define per1(i, n) for (int i = n; i >= 1; i--)
using namespace std;
typedef long long int ll;
template <class T> using V = vector<T>;
template <class... | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(lint (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
const lint MOD =1000000007;
const lint MA... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define fi first
#define se second
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep0(i, n) for (ll i = 0; i <= (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep1(i, n) for (ll i = (n); i > 0; --i)
#define rrep0(i, n)... | #include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
#include<queue>
#include<stack>
#include<math.h>
#include<map>
typedef long long int ll;
using namespace std;
#define maxn 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
const int mm=2e5+100;
ll d[mm],num[mm];
int main()
{
ll n,m,i,j,t,a,b,c,p,k,... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend... | #include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
long long t,n;
cin>>t>>n;
cout<<(long long)ceil(100*n/(long double)t)+n-1<<endl;
return 0;
}
|
//#include <atcoder/maxflow.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#include <iostream>
#include <map>
#include <list>
#include <set>
#include <algorithm>
#include <vector>
#include <string>
#include <functional>
#include <queue>
#include <deque>
#include <stack>
#inclu... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <queue>
using namespace std;
typedef long long ll;
int main(){
ll X,Y,A,B;
cin >> X >> Y >> A >> B;
ll ans = 0;
while(X<Y/A && X*A<=X+B){
X *= A;
ans++;
}
ans += (Y-1-X)/B;
cout << ans << end... |
#include <bits/stdc++.h>
typedef long long LL;
using namespace std;
LL n;
int main (){
cin>>n; LL m=2*n+2, x=sqrt(n);
while(x*(x+1)>m) x--; while(x*(x+1)<=m) x++;
n -= x-1; printf("%lld\n",n+1);
} | #include<bits/stdc++.h>
using namespace std;
#define f(i,a,b) for(register int i=a;i<=b;++i)
#define ll long long
inline ll read(){ll x;scanf("%lld",&x);return x;}
ll Abs(ll x){if(x<0)return -x;return x;}
int main()
{
ll n=read();
__int128 L=0,R=n+1;
while(L<R){
__int128 Mid=(L+R+1)>>1;
if((__int128)(1+Mid)*Mid... |
#include <bits/stdc++.h>
using namespace std;
int main(){
//2位を出力して、O(n)で2位の順番を探しだす
int n;
cin >> n;
int n_sub=1;
for(int i=0;i<n;i++){
n_sub*=2;
}
vector<int> a(n_sub/2);
vector<int> a_sub(n_sub/2);
vector<int> b(n_sub/2);
vector<int> b_sub(n_sub/2);
for(int i=0;i<n_sub;i++){
if(i<(n_sub/2)){
cin >... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
ll pow(ll a, ll b)
{
for (int i = 1; i <= b; i++)
{
a *= a;
if (i = b)
return a;
}
}
int main()
{
ll n;
cin >> n;
ll max_1 = 0, max_2 = 0;
ll p = 0, q = 0;
ll k = pow(2, n - 1);
vector<ll> a(k ... |
#include <iostream>
#include <vector>
#include <array>
#include <set>
using namespace std;
int main(){
int n;
cin>> n;
vector<array<int,5> > A(n);
for(auto& a: A) for(int &i :a) cin>> i;
//for(auto& a: A) for(int &i :a) cout <<i<<" ";
int left=0, right = 1e9+1;
auto check = [&](int x)-> bo... | #include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<time.h>
#include<algorithm>
using namespace std;
const int N=50005;
int n;
int w[N][5],ans;
int mn[N][1<<5],a[N];
inline bool check(int val) {
for(int i=1 ; i<=n ; ++i) a[i]=0;
for(int i=1 ; i<=n ; ++i) for(int j=0 ; j<5 ; ++j) if(w... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define lop(n) for(ll i=0;i<n;i++)
#define loop(a,b) for(ll i=a;i<b;i++)
#define sortt(x) sort(x.begin(),x.end())
#define MOD 1000000007
#define en "\n"
#define F first
#define S second
#define inputlist for(ll i=0;i<n;i+... | //#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <math.h>
#include <cmath>
#include <algorithm>
#include <climits>
#include <functional>
#include <cstring>
#include <string>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <vector>
#include <stack>
#include <queue>
#include <dequ... |
#pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#includ... | #include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
template <class T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
... |
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
inline ull Hash(const string& s){
ull ans=0;
for(auto c : s)
ans=ans*26+c-'a';
return ans;
}
string s;
int N;
set<ull> s1,s2;
inline void work(){
for(int i=1;i<=N;i++){
cin>>s;
set<ull> &t1=(s[0]=='!'?s1... | #include<bits/stdc++.h>
using namespace std;
struct{template<class T>constexpr operator T(){return numeric_limits<T>::max();}constexpr auto operator-();}inf;
struct{template<class T>constexpr operator T(){return numeric_limits<T>::lowest();}constexpr auto operator-();}negative_inf;
constexpr auto decltype(inf)::operat... |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int mod = 998244353;
const int N = 3000 + 10;
LL dp[N][N];
LL f(LL n, LL k) {
if(n < k) return 0;
if(n == k) return 1;
if(!n) return 0;
if(!k) return 0;
if(dp[n][k] != -1) return dp[n][k];
return dp[n][k] = (f(n - 1, k - 1) + f(n, 2 * k))... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF=0x3f3f3f3f3f3f3f3f;
const int maxn=3e3+5,mod=998244353;
int n,k;
ll dp[maxn][maxn];
int main(){
scanf("%d%d",&n,&k);
dp[0][0]=1;
// dp[i][j]
for(int i=1;i<=n;i++){
for(int j=i;j>=1;j--){
dp[i][j]=(dp[i-1]... |
#include<bits/stdc++.h>
using namespace std;
#define MAXN 100005
#define lowbit(x) (x&-x)
#define reg register
#define mkpr make_pair
#define fir first
#define sec second
typedef long long LL;
typedef unsigned long long uLL;
const int INF=0x3f3f3f3f;
const int mo=998244353;
const LL jzm=2333;
const int iv2=499122177;
c... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#def... |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
typedef long long int ll;
typedef long double ld;
#define MOD 1000000007
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define endl '\n'
#define pb push_back
#define conts continue
#define all... | #include <algorithm>
#include <iostream>
#include <list>
#include <numeric>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <iterator>
#include <ostream>
#include <sstream>
#include <iomanip>
#include <stdio.h>
#include <queue>
#include <cstdio>
using namespace std;
#define rep(i, n) for(in... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,f,n) for(ll i=(f); (i) < (n); i++)
#define repe(i,f,n) for(ll i=(f); (i) <= (n); i++)
#define repc(i,f,n) for(char i=(f); (i) <= (n); i++)
//#define PI 3.14159265358979323846264338327950L
#define debug(x) cout<<#x<<" :: "<<... | #include <bits/stdc++.h>
using namespace std;
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define MOD 1000000007
#define MOD1 998244353
#define INF 1e18
#define nline "\n"
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define ff first
#define ss second
#define PI 3.1... |
#include<iostream>
#include<vector>
using namespace std;
int main() {
int m, n;
char a;
cin >> m;
cin >> n;
for (int i = 0; i < m; i++) {
cin >> a;
if (a == 'o') {
n++;
}
else {
n--;
if (n < 0)n++;
}
}
cout << n << endl;
return 0;
} |
#include <bits/stdc++.h>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main()
{
ll x,n;
cin>>n>>x;
string mozi;
cin >> mozi;
rep(i,n){
if (mozi.compare(i,1, "x") == 0)
{
if (x > 0)
{
x--;
... |
#include<bits/stdc++.h>
#define ll long long
#define f(i,a,b) for(int i=a;i<=b;++i)
using namespace std;
ll a,b,kq;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin>>a>>b;
f(i,1,a){
f(j,1,b){
kq+=i*100+j;
}
}
cout<<kq;
}
| #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//namespace mp = boost::multiprecision;
//#include "atcoder/all"
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
... |
#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
const int N=2e3+5;
const int mod=1e9+7;
ll read()
{
ll c=getchar(),Nig=1,x=0;
while(!isdigit(c)&&c!='-')c=getchar();
if(c=='-')Nig=-1,c=getchar();
while(isdigit(c))x=((x<<1)+(x<<3))+(c^'0'),c=getch... | #include <bits/stdc++.h>
using namespace std;
#define X ios_base::sync_with_stdio(false); cin.tie(NULL);
#define FIXED_FLOAT(x) std::fixed <<std::setprecision(2)<<(x)
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void ... |
#include<bits/stdc++.h>
using namespace std;
template<typename T>inline T read(){
T f=0,x=0;char c=getchar();
while(!isdigit(c)) f=c=='-',c=getchar();
while(isdigit(c)) x=x*10+c-48,c=getchar();
return f?-x:x;
}
namespace run{
const int N=2e6+5,lim=309,mod=998244353,inv2=(mod+1)/2;
inline int add(int x,int y){retu... | #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
template<int MOD=1000000007>
struct modint{
/*static modint inv[2005];
static void init(){
for(int i=0;i<2005;i++)inv[i]=modpow(modint(i),MOD-2);
}*/
ull va... |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main(){
int a;
int b;
cin >> a >> b;
int tmp = (2 * (a) + 100);
cout << tmp - b << endl;
return 0;
} | #include <algorithm>
#include <array>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define ll long long
#define INF 1LL << 33
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define SHOW(p) \
if (test) \
cout <<... |
#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 <bits/stdc++.h>
#define rep(i,N) for(int i=0; i<(N); i++)
using namespace std;
int main() {
int64_t N;
cin >> N;
vector<int64_t> a(0);
for(int64_t i=1; i*i<=N; i++){
if(i*i == N){
a.push_back(i);
continue;
}
if(N%i == 0){
a.push_back(i);
a.push_back(N/i);
... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 998244353;
#define rep(i,a,b) for(ll i=a;i<b;++i)
#define pii pair<ll,ll>
ll ar[8];
ll pow(ll a,ll b)
{
return ar[b];
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
ar[0] = 1;
rep(i,1,8)
ar[i] = ar[i... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false)
#define rep(i, n) for(ll i=0; i<(ll)n; i++)
#define ALL(obj) begin(obj), end(obj)
typedef long long ll;
vector<vector<int> > G(22);
vector<int> color(22, -1), ts;
vector<bool> vis(22, 0);
int n, m, a, b;
void dfs(int now){
ts.push_... |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long int i=1;
long long int ans=0;
bool flag=false;
long long int N;
cin >> N;
while(flag==false){
string str1 = to_string(i);
string str2 = to_string(i);
string str = str1+str2;
l... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(), (x).end()
#define uniq(v) (v).erase(unique(all(v)), (v).en... |
#include <bits/stdc++.h>
using namespace std;
#define tolowercase(s) transform(s.begin(),s.end(),s.begin(),::tolower);
#define touppercase(s) transform(s.begin(),s.end(),s.begin(),::toupper);
#define lsb(x) (x&(-x))
#define MOD 1000000007
#define ll long long
typedef pair<ll, ll> ii;
typedef vector<ll> vi;
typedef vect... | #include "bits/stdc++.h"
using namespace std;
int main(){
int A, B;
cin>>A>>B;
if(A<B&&A+3>B||B<A&&B+3>A) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vec vector<int>
#define mii ... | #include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize(2)
typedef long long ll;
const int N=1e6+5;
const int inf=0x3f3f3f3f;
ll gcd(ll a,ll b)//最大公约数
{
return b==0?a:gcd(b,a%b);
}
ll lcm(ll a,ll b)//最小公倍数
{
return a*b/gcd(a,b);
}
ll quick_pow(ll x, ll n)//快速幂
{
ll num=x,ansult=1;
while(n)
{
... |
#include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define fo(a,b,c) for(int a=b;a<c;a++)
#define int long long int
#define ff first
#define ss second
#define pb push_back
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int mod = 1e9 + 7;
const int cmod = 998244353;
const... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int a, b, c;
cin >> a >> b >> c;
if(a > b) swap(a, b);
if(a > c) swap(a, c);
if(b > c) swap(b, c);
if(b - a == c - b) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin >> s;
for (auto it = s.rbegin(); it != s.rend(); ++it) {
char c = *it;
if (c == '6' || c == '9') {
c ^= '6' ^ '9';
}
cout << c;
}
cout << endl;
}
| #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define mem(a,val) memset(a,(val),sizeof((a)))
#define FAST std::ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define decimal(n) cout << fixed ; cout << setprecision((n));
#define mp make_pair
#define eb emplace_ba... |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define IOS ios::sync_with_stdio(false); cin.tie(0);cout.tie(0)
const int P = 1e9 + 7;
const double PI = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int N = 3e6 + 10;
int main()
{
IOS;
int n;
string str;
vector<int> v;
cin >> str >> n;
for(... | #include <cstdio>
#include <iostream>
using namespace std;
typedef long long LL;
const int mod = 1e9 + 7;
const int L = 2e5 + 100;
const int K = 16 + 4;
char lmt[L]; int lp;
long long f[L][K];
bool has[L]; int cnt;
int n, k;
int main() {
char in = getchar();
while((in < '0' || in > '9') && (in < 'A' || in > 'F'))... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int x, cnt = 0;
bool flag = false;
for (int i = 1; i <= n; i++) {
flag = false;
x = i;
while (x) {
if (x % 10 == 7) {
flag = true;
break;
} else {
x /= 10;
}
}
if (flag) c... | #include <iostream>
using namespace std;
int h8(int x){
int x0,x1,x2,x3,x4,x5;
x5=x/32768;
x4=(x-x5*32768)/4096;
x3=(x-x5*32768-x4*4096)/512;
x2=(x-x5*32768-x4*4096-x3*512)/64;
x1=(x-x5*32768-x4*4096-x3*512-x2*64)/8;
x0=x-x5*32768-x4*4096-x3*512-x2*64-x1*8;
return x0+x1*10+x2*100+x3*100... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
int N,S,D; cin >> N >> S >> D;
rep(i,N){
int X,Y; cin >> X >> Y;
if(X < S && Y > D){ cout << "Yes" << endl; return 0; }
... | #include<bits/stdc++.h>
using namespace std;
#define fr(i,t) for(i=0;i<t;i++)
#define fr1(i,r,t) for(i=r;i<t;i++)
typedef long long int lli;
typedef unsigned long long int ulli;
#define inf LONG_MAX
#define ff first
#define ss second
double pie=3.14159265358979323846;
#define dbug(x) cout<<#x<<"="<<x<<endl
#define dbu... |
#include <bits/stdc++.h>
using namespace std;
const int N = 2005;
int n, m, fa[N], ans1, ans2, siz[N];
char a[N][N];
int find_(int x) {
return x == fa[x] ? x : fa[x] = find_(fa[x]);
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n + m; i++)
fa[i] = i, siz[i] = 1;
for (int i = 1; i <= n; i++)
sc... | #include <bits/stdc++.h>
#define _overload3(_1,_2,_3,name,...)name
#define _rep(i,n)repi(i,0,n)
#define repi(i,a,b)for(int i=int(a),i##_len=(b);i<i##_len;++i)
#define MSVC_UNKO(x)x
#define rep(...)MSVC_UNKO(_overload3(__VA_ARGS__,repi,_rep,_rep)(__VA_ARGS__))
#define all(c)c.begin(),c.end()
#define write(x)cout<<(x)<<'... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
ll gcd(ll a, ll b){return b? gcd(b, a % b): a;}
ll quickpow(ll a, ll b){ll res = 1; while(b){if (b & 1) res = res * a; a = a * a; b >>= 1;} return res;}
// head
const int N = 2e5 + 5, mod = 998244353;
int n, m;
int dp[20][N], ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()
void dbg_out() { cerr << "\b\b]\n"; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T){ cerr << H << ", "; dbg_out(T...);}
#define watch(...) cerr ... |
#include<iostream>
using namespace std;
int main(){
int n,a,b;
cin>>n>>a>>b;
cout<<n-a+b<<endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... |
#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 <tuple>
#include <numeric>
#includ... | #include <bits/stdc++.h>
using namespace std;
int A,B,W;
int main(){
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;
} |
#include <bits/stdc++.h>
#ifdef LILY
#include "Debug.h"
#else
#define var(...) (0)
#define dbg(...) (0)
#endif
using int32 = int;
using int64 = long long;
using namespace std;
class Solution
{
#define int int32
#define sfor(i, n) for (int i = 1; i <= (n); ++i)
#define tfor(i, n) for (int i = 0; i < (n); ++i)
#define I... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (a % b == 0) {
return b;
}
else {
return gcd(b, a % b);
}
}
int main(void) {
int A, B, ans = 1;
cin >> A >> B;
for (int i = 1; i <= B; i++) {
if (floor(B / i) - floor((A - 1) / i) >= 2) {
ans = i;
}
}
cout << ans << endl;
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 998244353;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) <<... | #include<bits/stdc++.h>
using namespace std;
const long long int MOD = 998244353;
void solve() {
int n; cin >> n;
vector<int> a(n);
long long int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
if (sum % 2) {
cout << 0;
return;
}
vector<long l... |
#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> a(n),b(n);
rep(i, n)cin >> a[i];
sort(a.begin(), a.end());
rep(i, n)b[i] = i + 1;
rep(i, n) {
if (a[i] != b[i]) {
cout << "No... | #include<bits/stdc++.h>
using namespace std;
const int INF = INT_MAX;
const int MOD = 1e9 + 7;
//const int ULTRA = 1e14;
const int PROMAX = 1e6 + 5;
const int PRO = 1e5 + 5;
#define ll long long
#define int ll
#define all(x) x.begin(), x.end()
#define lla(x) x.rbegin(), x.rend()
#define pb push_back
#define ThinkTwice... |
// Created by Priyanshu
#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 M 1000000007
#define pi 3.14159265358979323846
#define ll long long
#... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main()
{
int a, b, c, Max1, Max2;
cin >> a >> b >> c;
Max1 = max(a+b, b+c);
Max2 = max(c+a, Max1);
cout << Max2 << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#ifdef Dhiraj
#include "D:/dhiraj/Programming/debug.h"
#else
#define d(...) 11
#define cerr if(0) cerr
#endif
#define ll long long int
#define endl '\n'
template <typename T, typename U>
inline istream& operator >> (istream& in, pair<T, U>& p) {
in >> p.f... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, n) for(int (i)=0; (i)<(n); (i)++)
#define FOR1(i, n) for(int (i)=1; (i)<=(n); (i)++)
#define FORI(i, n) for(int (i)=n-1; (i)>=0; (i)--)
template<class T, class U> void umin(T& x, const U& y){ x = min(x, (T)y)... |
#include <bits/stdc++.h>
#define forn(i,n) for(int i=0;i<(int)n;i++)
#define forx(i,x,n) for(int i=x;i<(int)n;i++)
#define ce(e,i,n) cout<<e<<" \n"[i==(int)n-1];
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int N=5e2+2;
//int a[N][N],vis[N][N],dr[4]={1,0,-1,0},dc[... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int n;cin>>n;
vector<ll>ae(n+1,0),be(n+1,0),b(n+1);
int tmp;
for(int i=0;i<n;i++){
cin>>tmp;
ae.at(tmp)++;
}
for(int i=1;i<=n;i++){
cin>>b.at(i);
be.at(b.at(i))=1;
}
ll ans=0;
for(int i=0;i<n;i++){
cin>>t... |
#include <bits/stdc++.h>
#define int long long
// #define m 1000000007
// #define piii pair<pair<int,int>>
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
void solve(){
int n;
cin>>n;
int a[n],b[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=0;i<n;i++){
cin>>b[... | #include <iostream>
#include <vector>
using namespace std;
int main()
{
int M;
cin >> M;
vector<int> vec(M);
for (int i = 0; i < M; i++)
{
cin >> vec.at(i);
// cout << vec.at(i) << endl;
}
vector<int> prime({2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47});
uint64_t answer = -1;
for... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MAX 1000000001
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
void solve(void)
{
vector<int> v(3);
rep(i, 3) cin >> v[i];
map<int, int> mp;
rep(i, 3) mp[v[i]]++;
bool f = false;
for (auto i : mp)
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
#define pb emplace_back
#define desend(x) greater<x>()
#define srt(v) sort(v.begin(),v.end())
#define all(x) x.begin(),x.end()
#define rvs(x) reverse(x.begin(),x.end())
#define Input(x) for(auto &n:x) cin>>n;
#define Output(x)... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); ++i)
#define rrep(i,n) for(int i=1; i<=(n); ++i)
#define drep(i,n) for(int i=(n)-1; i>=0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define fi first
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, n) for(int (i)=0; (i)<(n); (i)++)
#define FOR1(i, n) for(int (i)=1; (i)<=(n); (i)++)
#define FORI(i, n) for(int (i)=n-1; (i)>=0; (i)--)
template<class T, class U> void umin(T& x, const U& y){ x = min(x, (T)y)... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
constexpr int MOD = 1000000007;
/*
実行時MODint :
template <int& MOD = 1000000007>
static int MOD;
cin >> MOD;
*/
template <int MOD = 1000000007>
s... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define ll long long
#define int long long
#define length size()
const int MOD = 1000000007;
const int MAX = 510000;
const int inf = 400000000000000;
template<typename... |
#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); +... | // ----- In the name of ALLAH, the Most Gracious, the Most Merciful -----
#include<bits/stdc++.h>
using namespace std;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > stru... |
#include <iostream>
using namespace std;
int main()
{
int h, m;
cin >> m >> h;
cout << (h % m == 0 ? "Yes\n" : "No\n");
return 0;
} | #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>
using namespace std;
#define mod 1000000007
#define int long long
#define big 998244353
#define ff first
#define se second
#define pb push_back
#define pii pair<int,int>
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define PSET(x,y) fixed<<setprecision(y)<<x
#define mp make... | ///Bismillahir Rahmanir Rahim
#include "bits/stdc++.h"
#define ll long long
#define int ll
#define fi first
#define si ... |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 200000;
typedef long long ll;
const ll MOD = 998244353;
int n, k;
ll A[MAX_N];
ll S[301];
ll inv[301];
ll func(ll t) {
ll ans = 1;
ll pow = MOD - 2;
while (pow > 0) {
if (pow&1)
ans = ans * t % MOD;
t = t * t % MO... | #include <bits/stdc++.h>
#define endl '\n'
#define fi first
#define se second
#define MOD(n,k) ( ( ((n) % (k)) + (k) ) % (k))
#define forn(i,n) for (int i = 0; i < (n); i++)
#define forr(i,a,b) for (int i = a; i <= b; i++)
#define all(v) v.begin(), v.end()
#define pb(x) push_back(x)
using namespace std;
typedef long... |
/*
* Created By: 'Present_Sir'
* Created On: Thursday 27 May 2021 10:33:10 AM
*/
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int Mod = 998244353;
template <int mod>
struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(long long x_) {
if ((x = x_ % mod + mod) >= mod) x -... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
int h,w; cin >> h >> w;
vector<string> s(h);
rep(i,h) cin >> s[i];
vector<bool> flag_R(h+w-1);
vector<bool> flag_B(h+w-1)... |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
inline int inint(istream& in) {int x; in >> x; return x;}
inline ll inll(istream& in) {ll x; in >> x; retur... | #include <bits/stdc++.h>
using namespace std;
#define deb(k) cerr << #k << ": " << k << "\n";
#define size(a) (int)a.size()
#define fastcin cin.tie(0)->sync_with_stdio(0);
#define st first
#define nd second
#define pb push_back
#define mk make_pair
#define int long long
typedef long double ldbl;
typedef double dbl;
typ... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(int)(n); i++)
using namespace std;
using LL = long long;
using P = pair<int,int>;
const LL INF = 1e18;
int main(){
int N, M;
cin >> N >> M;
vector<LL> H(N), W(M);
rep(i,N) cin >> H[i];
rep(i,M) cin >> W[i];
sort(H.begin(),H.end());
vector<int> sum_left(... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
#define itn int
#define ll long long
#define pir pair<ll,ll>
#define yes {puts("Yes");}
#define no {puts("No");}
using namespace std;
ll read(){
ll a=0,b=1;char c=getchar();
while(c>'9'||c<'0'){if(c=='-')b=-1;c=getchar();}
whi... |
#include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
// const ll mod = 998244353;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define rep(i,n) for(int i=0;i<n;i++)
... | /*
Written By mafailure
*/
//In the name of God
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
using namespace std;
using namespace __gnu_pbds;
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define en... |
// Template
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <tuple>
#include <utility>
#include <queue>
#include <set>
#include <map>
#include <array>
#include <cassert>
#include <cmath>
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i... | #include <bits/stdc++.h>
#define SZ(x) (int)x.size()
#define ll long long
#define pb push_back
using namespace std;
const int N = 200005;
int n;
int a[N], f[N];
int find(int x) {
return x == f[x] ? x : f[x] = find(f[x]);
}
int main() {
cin >> n;
int ans = 0;
for(int i = 0; i < n; ++i) {
cin >... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll inf = -1e12;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n; string str;
cin >> n >> str;
if(str[0] != str[n-1]){
cout << 1;
return 0;
}
for(int i=1; i<=n-3; i++){
if(str[i] != str[0] && str[i+1] !=... | #include<bits/stdc++.h>
using namespace std ;
#define Next( i, x ) for( int i = head[x]; i; i = e[i].next )
#define rep( i, s, t ) for( int i = (s); i <= (t); ++ i )
#define drep( i, s, t ) for( int i = (t); i >= (s); -- i )
#define mp make_pair
#define pi pair<int, int>
#define pb push_back
#define vi vector<int>
int ... |
#include <vector>
#include <algorithm>
#include <iostream>
#include <climits>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define fep(i,j,n) for(int i=j;i<n;++i)
#define ll long long
#define ay array
#define vtc vector
#define MN 200001
vtc<int> dag;
vtc<int> v[MN];
int val[MN];
int dp[MN];
bool don... | ///////////////////////////////////////////////////////////////////////////////////////////////////
#include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <map>
#include <math.h>
#include <climits>
#include <set>
#include <cstring>
#include <unordered_map>
#include <cstdli... |
#include <bits/stdc++.h>
using namespace std;
int main() {
string N;
cin >> N;
string n;
reverse_copy(N.begin(), N.end(), back_inserter(n));
int count = 0;
for (int i = 0; i < N.size(); i++) {
if (N.at(i) == '0') {
count++;
}
}
int f = 0;
for(int i = 0; i < count + 1; i++){
if(N ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define index(i, n) for(ll i = 0; i < n; i++)
#define loop(i, a, b) for(ll i = a;i<b;i++)
long long binpow(long long a, long long b) {
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a;
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bo... | #include <bits/stdc++.h>
using namespace std;
struct UnionFind {
vector<int> par;
vector<int> sz;
vector<int> es;
UnionFind(int n = 1) { init(n); }
void init(int n = 1) {
par.resize(n);
sz.resize(n);
es.resize(n);
for (int i = 0; i < n; ++i) {
par[i] = ... |
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define N 200005
#define ll long long
#define mod 998244353
int n, k;
int A[N], S[305];
int C[305][305];
int main()
{
scanf("%d%d", &n, &k);
for (int i = 0; i <= k; i++)
{
C[i][0] = 1;
for (int j = 1; j <= i; j++)
... | #include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
// @@ !! LIM()
int main(/* int argc, char *argv[] */) {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << setprecision(20);
ll N, X; cin >> N >> X;
vect... |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <st... | #include<bits/stdc++.h>
#define int long long
using namespace std;
int T,L,R;
signed main(){
cin>>T;
while(T--){
cin>>L>>R;
if(R>=2*L)printf("%lld\n",(R-2*L+2)*(R-2*L+1)/2);
else printf("0\n");
}
return 0;
}
/*
*/ |
#include <bits/stdc++.h>
#define ll long long
#define V vector<long long>
#define VV vector<vector<long long>>
#define VVV vector<vector<vector<long long>>>
#define P pair<ll,ll>
#define rep(i,n) for(ll (i)=0;(i)<(n);++(i))
using namespace std;
long long mod=1e9+7;
struct mint{
long long x;
mint(long long x=0)... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 5;
long long ksm(long long a,long long n,long long mod)
{
if(n==1)return a%mod;
if(n==0)return 1;
long long ans=ksm(a,n>>1,mod);
ans=ans*ans%mod;
if(n&1)ans=ans*a%mod;
return ans;
}
void solve(long long N, long long M){
pri... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x,v) (lower_... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<long> vec(N);
long max_distance = 0,now=0;
long diff = 0,max_idx = 0;
for(int i = 0;i<N;i++){
cin >> vec.at(i);
diff += vec.at(i);
now += diff;
if(now >= max_distance){
max_distance = now;
max_i... |
#include <iostream>
#include <algorithm>
#include <string>
#include <cmath>
#include <vector>
#include <iomanip>
#include <random>
#include <climits>
#include <set>
#include <map>
using namespace std;
/*
*/
int main() {
int n;
cin >> n;
int i = 1;
int sum = 0;
while (1) {
sum += i;
if (sum >= n) ... | #pragma GCC optimize(2)
#include<bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vii;
ll n;
int main()
{
... |
#include"bits/stdc++.h"
using namespace std;
using ll=long long;
template<class T=ll>inline T in(istream&is=cin){T ret;is>>ret;return ret;}
template<class T,class Size=typename vector<T>::size_type>inline auto vector_2d(Size h,Size w,T v){return vector<vector<T>>(h,vector<T>(w,v));}
template<class RandomAccessIterator,... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
#define DENOM 1000000007
using namespace std;
using ll = long long;
int main(){
string s ;
cin >> s ;
size_t n = s.size() ;
size_t j ;
fo... |
#include <cmath>
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<set>
#include<map>
#include<bitset>
#include<iomanip>
#include<stack>
#include<set>
#include<string>
#include<deque>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll mod = 1000000... | #include <bits/stdc++.h>
#define int long long
#define pb push_back
#define vi vector<int>
#define all(a) a.begin(), a.end()
using namespace std;
void solve()
{
int n; cin>>n;
vi a(n);
int ans=(n*(n-1))/2;
for(int i=0;i<n;i++){
cin>>a[i];
}
sort(all(a));
int cnt=1,val;
for(in... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
string S; cin>>S;
int ans=0;
for(int i=0;i+3<S.size();i++)ans+=S.substr(i,4)=="ZONe";
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (int)(a); (i) < (int)(b); (i)++)
#define rrep(i, a, b) for (int i = (int)(b) - 1; (i) >= (int)(a); (i)--)
#define all(v) v.begin(), v.end()
typedef long long ll;
template <class T> using V = vector<T>;
template <class T> using VV = vector... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i< (n); i++)
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
template<class T> bool chmax(T& a, T b){
if(a < b){
a = b;
return true;
}
return false;
}
template<class T> bool chmi... | // ** Sumonta Saha Mridul ** SWE - SUST
/*
* ###### ## ## ## ## ####### ## ## ######## ###
! ## ## ## ## ### ### ## ## ### ## ## ## ##
? ## ## ## #### #### ## ## #### ## ... |
#include<bits/stdc++.h>
using namespace std;
// Macros
//#define int long long int
#define lli long long int
#define ulli unsigned long long int
#define mods 1000000007
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define fio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define for... | #include <bits/stdc++.h>
using namespace std;
const int N = 105;
int n;
char s[N][N];
vector<int> edges[N];
int cnt[N];
void bfs(int u) {
queue<int> q;
vector<bool> vis(n);
q.push(u);
vis[u] = true;
while (q.size()) {
int u = q.front();
q.pop();
for (int v: edges[u]) {
if (vis[v]) cont... |
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<iomanip>
#include<regex>
using namespace std;
#define int long long
const int mod=1e9+7;
int dp[101][100001]={};
signed main(){
int n,t[100];
... | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { for (auto e : v) os << e << ' '; return os; }
template <typename T> ostream &operator<<(ostream &os, co... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=55e4;
int n,K,mo,i,j,ff[N*2],*f=ff+N,S;
inline void red(int&x){x+=x>>31&mo;}
inline void ins(int x){
if(x>0)for(j=-S;j<=S;++j)red(f[j]+=f[j-x]-mo);
else for(j=S;j>=-S;--j)red(f[j]+=f[j-x]-mo);
if(x>0)for(j=S;j>=-S;--j)red(f[j]-=f[j-x*(K+... | #include<bits/stdc++.h>
using namespace std;
int n,k,p,f[2][300005];
int mod(int x){return x>=p?x-p:x;}
int solve(int x)
{
memset(f,0,sizeof(f));
f[0][150001]=1;
for(register int i=1;i<=n;++i)
{
if(i>x)
{
for(int j=1;j<=300001;j++)
{
f[i&1][j]=f[(i... |
#include<bits/stdc++.h>
#define fo(i,a,b) for(int i=(a);i<=(b);++i)
#define fd(i,a,b) for(int i=(a);i>=(b);--i)
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
using namespace std;
typedef long long ll;
const ll mod = 998244353;
const int maxn = 5e3 + 5;
int n, m, k;
ll a[maxn][maxn], dp[maxn][maxn];
ll powe... | #include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 2e5 + 50;
int n,x1[maxn],x2[maxn];
long long f[2][2];
struct node{
int x,c;
bool operator < (node p){
return c < p.c;
}
}a[maxn];
int read(){
int x = 0,f = 1;
char c = getchar();
while(c < '0' || c > '9'){
if(c ==... |
#include<bits/stdc++.h>
using namespace std;
const int M=505;
int n,m,lsum[M][M],rsum[M][M];
char mp[M][M];
int main() {
scanf("%d%d",&n,&m);
for(int i=1; i<=n; ++i)
scanf("%s",mp[i]+1);
for(int i=1; i<=n; ++i)
for(int j=1; j<=m; ++j) {
lsum[i][j]=lsum[i][j-1]+lsum[i-1][j]-lsum[i... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
char X[110][110]={};
int ans =0,H,W;
cin>>H>>W;
for(int i=0;i<H;i++){
string S;
cin>>S;
for(int j=0;j<W;j++){
X[i][j]=S[j];
}
}
for(int i=0;i<H;i++){
for(int j=... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.