code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
#include <set>
#include <functional>
#include <... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define rng(i,l,r) for (int i=l; i<r; i++)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
using namespace std;
using ll = long long;
using P = pair<int,int>;
template <class T> using V = vector<T>;
template<class T> bool chmin(T& a, T... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define vi vector<int>
#define vvi vector<vector<int>>
#define pb push_back
#define pii pair<ll,ll>
#define tii tuple<ll,ll,ll>
#define all(v) (v).begin(),(v).end()
#define ll long long
#define ull unsigned long long
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define re(i,n) for(int i = 0 ; i < n ; i++)
#define rep(i,a,b) for(int i = a ; i <= b ; i++)
#define rer(i,b,a) for(int i = b ; i >= a ; i--)
#define debug(x) cout << #x << " : " << x << '\n';
const int N = (int)2e3+3;
int main(){
ios_bas... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
using P = pair<ll, ll>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, -1, 0, 1};
string char_to_string(char val) {
return string(1, val);
}
int ... | /* CREATED BY
STREAM_CIPHER
june-2021
*/
#include<bits/stdc++.h>
using namespace std;
void __print(long long x) {cerr << x;}void __print(unsigned long long x) {cerr << x;}void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}void __print(const char *x) {cerr << '\"' << x << ... |
/*
Author: QAQAutoMaton
Lang: C++
Code: B.cpp
Mail: lk@qaq-am.com
Blog: https://www.qaq-am.com/
*/
#include<bits/stdc++.h>
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define DEBUG printf("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define Debug debug("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int llu;
typedef long double ld;
#define vi vector<int>
#define vl vector<ll>
#define vp vector<pair<int,int>>
#define pb push_back
#define pf push_front
#define mp map<ll,ll>
#define INF 1000000000000000000
#define fast i... |
#include <bits/stdc++.h>
using namespace std;
#define clr(a) memset(a, 0, sizeof(a))
#define full(a) memset(a, 0x3f, sizeof(a))
#define fornext(x, i) for(int i = head[x], y = ver[i]; i; i = nxt[i], y = ver[i])
#define mset(a, b) memset(a, b, sizeof(a))
#define Rep(i, a, b) for(int i = (a); i <= (b); ++i)
#define dRep(i... | #include<bits/stdc++.h>
using namespace std;
const int N=1e5+1e3+7;
int n,f[N],sz[N];
vector<int>g[N];
int main()
{
scanf("%d",&n);
for(int i=2;i<=n;i++)
{
int p;
scanf("%d",&p);
g[p].push_back(i);
}
for(int i=n;i>=1;i--)
{
int x=i;
f[x]=1;
sz[... |
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#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;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_upd... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, ans=0;
cin >> n;
for(int i = 1; i < n; i++) {
if ((n-i) > 0) ++ans;
}
cout << ans << endl;
return 0;
} |
#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;
template<typename has_less>
using ordered_set =
tree<has_less,
null_type,
less_equal<has_less>,
rb_tree_tag,
tree_order_statistics_node_update>;
... | #include<bits/stdc++.h>
#define re register
using namespace std;
inline int read(){
re int t=0;re char v=getchar();
while(v<'0')v=getchar();
while(v>='0')t=(t<<3)+(t<<1)+v-48,v=getchar();
return t;
}
const int M=998244353;
inline void add(re int &x,re int y){(x+=y)>=M?x-=M:x;}
inline int ksm(re int x,re int y){
re... |
#include<bits/stdc++.h>
using namespace std;
vector<int> G[400400];
bool vis[400400];
int ce,cv;
void dfs(int x)
{
vis[x]=true;
cv++;
ce+=(int)(G[x].size());
for(int i=0;i<(int)(G[x].size());i++)
if(!vis[G[x][i]])
dfs(G[x][i]);
return ;
}
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++)
{
... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<numeric>
//#include<at... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int X,Y;
bool a = false;
cin >> X >> Y;
if(max(X,Y)-min(X,Y) < 3){
a = true;
}
if(a == false){
cout << "No" << endl;
}
if(a == true){
cout << "Yes" << endl;
}
} | #include<cstdio>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
using namespace std;
#define DEBUG(x) cout<<#x<<"="<<x<<endl
#define... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define mii map <int, int>
#define mll map <ll, ll>
#define pii pair <int, int>
#define pll pair <ll, ll>
#define vi vector <int>
#define vd vector <double>
#define vll vector <ll>
#define fi first
#define se second
#define si set... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
ll gcd(ll a, ll b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
ll f(ll h) {
if (h == 1) {
return 1;
} else {
return ... |
#pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n;
cin >> n;
char s[n];
for (int i=0;i<n;i++){
cin >> s[i];
}
string res;
res="";
for(int i=0;i<n;i++){
res.push_back(s[i]);
if(res.size()>=3){
if(res.at(res.size()-3)=='f' && res.at(res.size()-2)=='o' && res.at(res.si... |
// Bismillahir Rahmanir Rahim
//============================
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define infL LLONG_MAX
#define infI INT_MAX
#define pb push_back
#define fo(i,a,b) for(int i=a;i<b;i++)
#define fo2(i,a,b) for(int i... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long n,k,i,j,num,sum=0,x,y;
cin>>n>>k;
vector< pair <long long,long long> > vect;
for (int i=0; i<n; i++){
cin>>x>>y;
vect.push_back( make_pair(x,y) );
}
sort(vect.begin(), vect.end());
for(i=0;i<n;i++)
{
if(... |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
typedef long long ll;
typedef pair<int,int> ii;
double a, b, c, d;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> a >> b >> c >> d;
cout << fixed << setprecision(12);
cout << a + b*(c-a)/(b+d... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
template <typename T>
void read(T &x) {
x = 0; char c = getchar(); int f = 0;
for (; !isdigit(c); c = getchar())
f |= c == '-';
for (; isdigit(c); c = getchar())
x = x * 10 + (c ^ '0');
if (f) x = -x;
}
template <typename T>
void write(T x, cha... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long; //mp::int128_t; //mp::_int512_tなど //256, 1024
#define sz(x) int(x.size()) //size_tはunsigned
using P = pair<int,char>;
int main() {
string s;
cin >> s;
char last;
bool first = true;
int ssize = sz(s);
ll ans=0;
vector<P> v;
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ldb = long double;
//sort(myVec.begin(),myVec.end(),[](const vector<int> &alpha,const vector<int> &beta){return alpha[0] < beta[0];});
using ll = long long;
using ldb = long double;
int main() {
int N; cin >> N;
int s = N*1.08;
... | #include <bits/stdc++.h>
#define endl '\n'
#define ff first
#define ss second
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define vvi vector < vi >
#define pii pair<int,int>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define deb(x) cout << #x <<... |
#include <string>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <iostream>
#include <functional>
#include <algorithm>
#include <sstream>
#include <iterator>
#include <cmath>
#include <limits>
#include <tuple>
#include <queue>
#include <stack>
#include <bitset>
using namespace std;
typedef l... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define SPEED \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
// Aakash
int32_t main() {
SPEED;
int n;
cin>>n;
vector<int> a(3,0);
int temp=n;
int... |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int N;
string S, X;
vector<int> v;
int main() {
cin >> N >> S >> X;
v.resize(N);
for (int i = N - 1, a = 1; i >= 0; i--, a = a * 10 % 7) {
v[i] = a * (S[i] - '0') % 7;
}
vector<vector<bool>> dp(N + 1, vector<bo... | #include<iostream>
#include<string>
#include<cmath>
using namespace std;
int main() {
int r1, r2, c1, c2;
int result = 0;
cin >> r1 >> c1;
cin >> r2 >> c2;
if (r1 == r2 && c1 == c2) {
result = 0;
}
else if (r1 + c1 == r2 + c2 || r1 - c1 == r2 - c2 || abs(r1 - r2) + abs(c1 - c2) <= 3) {
result = 1;
}
els... |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define PI acos(-1)
#define pb push_back
#define int long long
#define ld long double
#define sp fixed<<setprecision
#define bp __builtin_popcountll
#define all(x) x.begin(),x.end()
#define pii pair<long long,long long>
#define FAST ios_ba... | //
#include <bits/stdc++.h>
const int INF=0x3f3f3f3f;
const int maxn=50000005;
using namespace std;
int main(){
//freopen(".in", "r",stdin );
//freopen(".out","w",stdout);
ios::sync_with_stdio(0);
int a,b,x,y;
cin>>a>>b>>x>>y;
if(b>a){
if(2*x<y)
cout<<(b-a)*2*x+x<<endl;
else
cout<<(b-a)*y+x<<endl;
}
... |
#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)
#include <algorithm>
#include <iostream>
using ll=long long;
using namespace std;
int main() {
int n;
cin>>n;
vector<pair<ll,int>>x(n),y(n);
rep(i,n){
cin>>x[i].first>>y[i].first;
x[i].second=i+1;
... | #include <bits/stdc++.h>
using namespace std;
typedef pair <int,int> P;
typedef long long int ll;
P get_max(vector <P> vec){
int n=vec.size();
vector <P> vx(n),vy(n);
for(int i=0;i<n;i++) vx[i]=P(vec[i].first,i);
for(int i=0;i<n;i++) vy[i]=P(vec[i].second,i);
sort(vx.begin(),vx.end());
sort(vy.begin(),vy.end());... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
typedef long long ll;
typedef long double ld;
#define REP(i,a,b) for (int i = a; i <= b; i++)
#... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
using namespace std;
using ll = long long;
using vi = vector<int>;
#define in(v) v; cin >> v;
void ins() {}
template<class T,class... Rest>void ins(T& v,Rest&... rest){cin>>v;i... |
#include <bits/stdc++.h>
using namespace std;
const int bound = 10000;
bool visited[10010];
int main(){
int N; cin >> N;
cout << 6 << " " << 10 << " " << 15;
N -= 3;
for(int j = 12; j <= bound; j += 6){
if(!visited[j] && N > 0){
cout << " " << j;
visited[j] = true;
N--;
}
}
for(int j = 20; j <=... | #include <cstdio>
using namespace std;
int n,cnt,ans[10010];
int main()
{
scanf("%d",&n);
if(n==3)
{
printf("6 10 15");
return 0;
}
for(int i=1;i<=10000;i++)
if(i%10==0||i%15==0||i%6==0)
ans[++cnt]=i;
printf("%d %d %d ",6,10,15);
for(int i=1;i<=n;i++)
{
if(ans[i]==6||ans[i]==10||ans[i]==15)
contin... |
#define _DEBUG
#include "bits/stdc++.h"
//#include <atcoder/all>
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,a5,x,...) x
#define debug_1(x1) cout<<#x1<<": "<<x1<<endl
#define debug_2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<endl
#define debug_3(x1,x2,x3) cout<<#x1<<": "<<x1<<", "#x2<<": "<<x2<<", "... | /*君は今なにをして生きる
君は今なにをして生きてる？
いつまでたっても君は相も変わらず暮らしているようで
本音 深い暗い沼の底で
溜まりに溜まって溢れそうです
光景 あの時の思い出
美化に美化 重ねてしまった
いいないいなあの子は楽しそう
嫌いなあの子は
わたしはわたしでがんばった
あなたはあなたで何していた？
気づいた時には粉々の鏡
あなたにきづいてほしかったな
まだかな まだかな
待っていたのに 待っていたのに
愛していたのに 愛していたのに
永遠の愛はメーデーの中
永遠の愛はたしかにどこにももうない*/
#include <bits/stdc++.h>
#define fastio() ... |
#include <bits/stdc++.h>
using namespace std;
struct BIT{
vector<long long> num;
int N;
BIT(int n){
N = n;
num.resize(N + 1, 0);
}
long long sum(long long t){
long long res = 0;
while(t > 0){
res += num[t];
t -= t & -t;
}
return... | #include<bits/stdc++.h>
#define For(i,x,y) for (register int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (register int i=(x);i<(y);i++)
#define Dow(i,x,y) for (register int i=(x);i>=(y);i--)
#define Debug(v) for (auto i:v) cout<<i<<" ";puts("")
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#... |
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define fr(i, a, b) for (ll i = a; i < b; i++)
#define rf(i, a, b) for (ll i = a; i >= b; i--)
typedef std::vector<long long> vi;
#define F first
#define S second
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
#define pii pair<int,int>
#define fi first
#define se second
#define pb push_back
#define rep(i,n) for (int i=1;i <=int(n);i++)
#define ffor(i,n) for (int i=0;i <int(n);i++)
#d... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve(){
int n; cin>>n;
vector<int> v;
for(int i = 1; i*i <= n; i++){
if(n%i == 0){
v.push_back(i);
if(i*i != n) v.push_back(n/i);
}
}
sort(v.begin(), v.end());
for(int i : v) cout << i << "\n";
}
int32_t main()... | // Problem: C - Secret Number
// Contest: AtCoder - Mynavi Programming Contest 2021（AtCoder Beginner Contest 201）
// URL: https://atcoder.jp/contests/abc201/tasks/abc201_c
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
cin >> str;
int ans = 0;... |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>
using ... | #include <bits/stdc++.h>
using namespace std;
#define ios ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long
#define inf INT_MAX
#define llinf LLONG_MAX
#define mt make_tuple
#define mp make_pair
#define parll pair<ll,ll>
#define parii pair<int,int>
#define min3( brp1, brp2, brp3 ) min( mi... |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
#define int long long int
#define pb push_back
#define mp make_pair
#define pll pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
#define setbits(x) __builtin_popcountll(x)
#define md (ll)1e9 + 7
#define inf ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <utility>
#include <vector>
... |
// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "/debug.h"
#else
#define db(...)
#endif
#define all(v) v.begin(), v.end()
#define pb push_back
using ll = long long;
const int NAX = 2e5 + 5, MOD = 1000000007;
string solveCase(int64_t N, string S, string X)
{
// TODO: edit here
vector<int> ... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define ld long double
#define forr(i, a, n) for (int i = a; i < n; i++)
#define rep(i, n) forr(i, 0, n)
#define repp(i, n) forr(i, 1, n + 1)
#define foreach(it, t) for (__typeof(t.begin()) it = t.begin(); it != t.end(); it++)
#define ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
double dp[100][100][100];
double dfs(ll a,ll b,ll c){
if(a==99 && b==99 && c==99)return 1.0;
if(a==100 || b==100 || c==100)return 0.0;
if(dp[a][b][c]!=0)return dp[a][b][c];
double ans=0.0;
if(a>0)ans+=((double)a/(a+b+c))*(1+dfs(a+1,b,... |
#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>
#define pb emplace_back
#define AI(i) begin(i), end(i)
using namespace std;
using ll = long long;
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + strin... |
#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 <bits/stdc++.h>
using namespace std;
long long int mem[40][40];
void comb(vector<vector<long long int> > &v) {
for (int i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (int k = 1; k < v.size(); k++) {
for (int j = 1; j < k; j++) {
v[k][j] = (v[k - 1... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
int n;
double D,H;
cin>>n>>D>>H;
double ans=0;
rep(i,n){
double d,h;
ci... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void)
{
vector<int> A(3);
rep(i, 3) cin >> A.at(i);
sort(A.begin(), A.end());
do {
if (A.at(0) - A.at(1) == A.at(1) - A.at(2)) {
cout << "Yes" << endl; return 0;
}
} while (next_permutati... |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long ... | #include <bits/stdc++.h>
#define rep(i, n) for (lli i = 0; i < (n); i++)
#define rrep(i, n) for (lli i = (n)-1; i >= 0; i--)
#define vall(x) (x).begin(), (x).end()
using namespace std;
namespace atcoder {}
using namespace atcoder;
using lli = long long int;
void YESNO(bool), YesNo(bool);
template <class T1, class T2> b... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define gc getchar() //(p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<20,stdin),p1==p2)?EOF:*p1++)
#define mk make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define IT iterator
#define V vector
#define TP template <class o>
#define TP... | #include <bits/stdc++.h>
#define SLAY ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define PI 3.141592653589793238
#define ll long long
#define pii pair<int , int>
#define pll pair<long long , long long>
using namespace std;
int _=1 , tc=1;
int dx[] = { 0 , 0 , 1 , -1};
int dy[] = { 1 , -1 , 0 , 0};
const... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
//#define vec vector<ll>
//#define mat vector<ve... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (ll i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define pb push_back
using ll = long long;
using ld=long double;
using vin=vector<int>;
using v... |
#include <iostream>
#include <iostream>
#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define ll long long
#define li longll
#define pp pair<ll, ll>
#define lb lower_bound
#define ub upper_bound
#define mk make_pair
#define pb push_back
#define llp(i, x, n) for (... | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds; //required
using namespace std;
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define fast ios_base::sync_with_stdio(... |
#include <iostream>
using namespace std;
int main()
{
int N;
cin >> N;
int x[N];
int y[N];
for(int i = 0; i < N; i++) {
cin >> x[i] >> y[i];
}
for(int i = 0; i < N-2; i++) {
for(int j = i+1; j < N-1; j++) {
for(int k = j+1; k < N; k++) {
int x_d... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
void fin(string s){
cout<<s<<endl;
exit(0);
}
signed main(){
int n;cin>>n;
vector<int> x(n),y(n);
REP(i,n)cin>>x[i]>>y[i];
auto check=[&](int i,int j,int k){
if(i==j||j==k||k==i)retu... |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n; cin >> n;
string t; cin >> t;
string s = "110";
long long res = 0;
REP(i, 3) {
bool ok = true;
REP(j, n) ok = ok && s[(i+j)%3] == t[j];
if (ok) res += 1e10 - (n+i+2)/3 + 1;
}
cout << res << '\... | // #include <atcoder/all>
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n - 1); i >= 0; --i)
#define BIT(n, k) ((n >> k) & 1)
#define LEN(s) (int)s.size()
#define RANGE(a) a.begin(), a.end()
#define RRANGE(a) a.rbegin(), a.rend()
using namespace std;
using ll ... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
using ll = long long;
using P = pair<in... | #include <bits/stdc++.h>
// #include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb empla... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using tiii = tuple<int, int, int>;
using str = string;
using ld = long double;
#define FOR(i,a,b) for(int i = (a);i < (b);i ++)
#define ROF(i,a,b) for(int i = (a);i >= (b);i --)
#define trav(a, b)... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
typedef vector<ll> vi;
typedef vector<pi> vpi;
typedef long double ld;
const int inf = 1e9 + 7;
const int mod = 998244353;
const int maxn = 1e6 + 3;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#de... |
#include <bits/stdc++.h>
#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;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define SIZE(x) ((ll)(x).size())
#define ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,ans;
int main(){
cin>>n;
for(ll i=1;i*i<=n+n;i++){
ll S=n+n-i*(i-1);
if(S%(i+i)!=0)continue;
ll l=S/(i+i);
if(l<=0)continue;
ans++;
}
ans<<=1;
cout<<ans<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, m, a, b, ans = 0;
int vis[21][21];
void dfs(int x,int y)
{
if(x==n+1)
{
if(a==0 && b==0) ans++;
return;
}
if(vis[x][y]==1)
{
if(y==m) dfs(x+1,1);
else dfs(x,y+1);
return;
}
if(b)
{
--b;
vis[x][y]=1;
if(y==m) dfs(x+1,1... | /**
* author: naniwazu
**/
#include<bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define pe... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,a,b) for(int i=a;i<b;i+=1)
#define repE(i,a,b) for(int i=a;i<=b;i+=1)
#define pb push_back
const ll MOD = 1e9 + 7;
const ll N = 1e5 + 5, M = 10;
const ll WE = 1e5;
const ll maxV = 1e3;
const ll INF = 1e18;
ll ceil(ll a, ll b) {
r... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
#include<map>
#include<cassert>
using namespace std;
#define ll long long
#define reps(i, a, b) for(int i = a; i < b; i++)
#define rreps(i, a, b) for(int i = a-1; i >= b; i--)
#def... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
if(N==1){cout<<1;}
if(N==2){cout<<1<<' '<<2;}
if(N==3){cout<<1<<' '<<2<<' '<<2;}
if(N>3){
vector<int> a(N);
a[0]=1;
a[1]=2;
a[2]=2;
cout<<a[0]<<' '<<a[1]<<' '<<a[2]<<' ';
for (double i = 4; i <= N; i++) {
a[i-1]=2;
... |
/*#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")*/
#include <bits/stdc++.h>
#define f first
#define s second
#define sym(s) s = "#" + s + "#";
#define all(x... | /**
* Author: Sanchit Sinha
* Created: 17.10.2020 16:38:47
**/
#include "bits/stdc++.h"
using namespace std;
#define ll unsigned long long
ll powermod(ll x,ll ex,ll md){ll ans=1ll;while(ex>0){if(ex&1ll) ans=(ans*x)%md; ex>>=1ll;x=(x*x)%md;}return ans;}
inline ll gcd(ll a,ll b) {if(b==0)return a;a%=b;... |
#include <bits/stdc++.h>
#define mid(l,r) ((l + r) >> 1)
#define lsb(x) (x & (-x))
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define FOR(X,L,R) for(int X=L;X<R;++X)
#define endl '\n'
#define int long long
#define MOD ((int)1e9 + 7)
#define INF (0x3f3f3f3f)
#define LLINF (0x3f3f3f3f3f3f3f3f... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9+7;
int solve_naive(const int n, const int s, const int k){
int cnt = 0;
ll now = s;
while (now % n != 0 && cnt < n){
now += k;
cnt += 1;
}
if (cnt >= n){
return -1;
}
return cn... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repp(i, l, n) for (int i = (l); i < (int)(n); i++)
using ll = long long;
int main(){
int n; cin>>n;
cout << n-1 << endl;
} | #define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#define endl '\n';
#define sz(s) int(s.size())
#define all(v) ((v).begin()),((v).end())
#define allr(v) ((v).rbegin()), ((v).rend())
#define mem(x,y) memset(x,y,sizeof(x))
#define Ceil(x,y) ((x+y-1)/y)
typedef long long ll;
typedef double dl;
using namespace std... |
#include <bits/stdc++.h>
#define iter_all(x) x.begin(), c.end()
#define umap unordered_map
#define uset unordered_set
using namespace std;
typedef long long int ll;
auto io_speed = []() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
return 0;
}();
ll pow_mod(ll a, ll e, ll mod) {
... | #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<iostream>
#include<cstdio>
#include<algorithm>
#include<map>
namespace do_while_true {
#define ld double
#define ll long long
#define re register
#define pb push_back
#define fir first
#define sec second
#define pp std::pair<int, int>
#define mp std::make_pair
const ll mod = 1000000007;
template <typ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 4e2+5;
char s[N],t[N];
inline char get(char a,char b){
if(a == b) return a;
if(a == 'P' && b == 'R') return 'P';
if(a == 'R' && b == 'P') return 'P';
if(a == 'S' && b == 'P') return 'S';
if(a == 'P' && b == 'S') return 'S';
if(a =... |
#include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
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; retu... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#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(x) cout << (x) << "\n"
#define cosp(x... |
#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(nullptr)
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double ld;
const ll LINF=1e18;
const ll MOD=998244353;... | #include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#include<math.h>
#define DIV 1000000007
#define TE 2e5
using namespace std;
using ll = long long;
using ldb = long double;
ll gcd(ll a, ll b) {
if (b == 0... |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define fi first
#define se second
#define mset(a,b) memset(a, b, sizeof(a))
#define dbg(x) cout << "[" << #x << "]: " << x << endl;
#define forn(i,n) for(int i=0; i < n;i++)
#define forab(i,a,b) for(int i = ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(ll i=0;i<n;++i)
#define ocut cout
#define ouct cout
#define itn int
struct Union{
vector<ll> par;
Union(ll a){
par=vector<ll>(a,-1);
}
ll find(ll a){
if(par[a]<0){
return a;
}... |
#include<bits/stdc++.h>
using namespace std;
const double eps=1e-7;
struct point {
double x,y;
friend bool operator<(point a,point b) {
if(a.x==b.x)return a.y<b.y;
return a.x<b.x;
}
} p[205];
int n;
int main() {
int x,y;
scanf("%d",&n);
for(register int i=1; i<=n; i++) {
scanf("%lf%lf",&p[i].x,&p[i].y);
}
... | /* by Natsu Kinmoe */
#include <bits/stdc++.h>
using namespace std;
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define loop(i, n) for(int i = 0; i < (n); ++i)
#define cont(i, n) for(int i = 1; i <= (n); ++i)
#define circ(i, a, b) for(int i = ... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define p (long long)(1e9+7)
#define _(i,a,n) for(int i=a;i<n;i++)
ll solve(ll a,ll b)
{
a%=1000000;
ll r=1;
while (b)
{
if (b&1)
r=(r*a)%3000000000;
a=(a*a)%3000000000;
b>>= 1;
}
return r;
}
i... | #include <iostream>
using namespace std;
long long mod=998244353;
int llpow(long long a,long long b){
long long r;
if(b==0)r=1;
else if(b==1)r=a%mod;
else if(b%2==1){
r=llpow(a,b-1)*a;
r%=mod;
}else{
r=llpow(a,b/2);
r*=r;
r%=mod;
}
if(r<0)r+=mod;
return r;
}
int main(){
long long N... |
#include<iostream>
using namespace std;
int main(void)
{
char s,t; cin>>s>>t;
if(s=='Y'){cout<<(char)(t-32)<<endl;}
else{cout<<t<<endl;}
return 0;
} | #include<bits/stdc++.h>
#define FULL(x,y) memset(x,y,sizeof(x))
#define ll long long
#define pb push_back
using namespace std;
int x,y;
int main() {
cin>>x>>y;
if (abs(x-y)<3) printf("Yes");
else printf("No");
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define fo(i,a,b,c) for(int (i)=a;(i)<=b;(i)+=c)
string S;
deque<char> ans;
bool op;
int main() {
cin>>S;
int L=S.size();
fo(i,0,L-1,1) {
if(S[i]=='R') op^=1;
else {
if(op) {
if(ans.size()&&ans.front()==S[i]) ans.pop_fr... | #pragma region RegionDefs
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0,i##_len=(n);i<i##_len;++i)
#define reps(i,l,r) for(int i=(l),i##_len=(r);i<i##_len;++i)
#define repr(i,l,r) for(int i=(r)-1,i##_left=(l);i>=i##_left;--i)
#define all(x) begin(x),end(x)
using namespace std;
typedef long long ll;
const ll INF... |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 2e5+8, inf = 1e18+9, mod = 1e9+7;
char ans[maxn * 2];
struct node { int v, id, b; } a[maxn * 2];
int n, m;
void solve() {
int i, j, cnt = 0;
cin >> n;
for (i = 1; i <= (n * 2); i++) cin >> a[i].v, a[i].id = i;
sort(a... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi=vector<int>;
int main() {
int N; cin>>N;
vi A(2*N);
for (int i = 0; i < 2*N; i++)cin >> A[i];
vector<pair<int,int>> B(2*N);
for (int i = 0; i < 2*N; i++)B[i] = make_pair(A[i], i);
sort(B.begin(),B.end());
string S(... |
#include <bits/stdc++.h>
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef unsigned long long llu;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = 1; i <= (int)(n); i++)
#define drep(i, n) for(int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
#define dup(x,y) (((x)+(y)-1)/(y))
#define srep(i,s,t) for (int i = s; i < t; ++i)
using namespace s... |
#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 <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define X first
#define Y second
#define nl '\n'
#define AC return 0
#define pb(a) push_back(a)
#define mst(a,b) memset(a, b, sizeof a)
#define rep(i,n) for(int i = 0; (i)<(n); i++)
#define rep1(i,n) for(int i = 1; (i)<=(n); i++)
#de... |
#include<bits/stdc++.h>
#define INFTY 10000000000
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
const int MOD=998244353;
const int di[4] = {-1,0,1,0};
const int dj[4] = {0,-1,0,1};
const int INF = 1e9;
const int A = 1000005;
int main(){
int n;cin>>n;
vector<int> ... | #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>
int main()
{
int X, Y, Z;
std::cin >> X >> Y >> Z;
auto ans = (Z * Y - 1) / X;
std::cout << ans << std::endl;
return 0;
}
| #include<iostream>
#include<vector>
#include<stdio.h>
#include<stdint.h>
#include<string>
#include<algorithm>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int a;
int b;
int c;
cin >> a >> b >> c;
int ans = b * c / a;
if((b * c) % a == 0) cout << ans-1... |
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, j, n) for (int i = j; i < (n); ++i)
#define rrep(i, j, n) for (int i = (n)-1; j <= i; --i)
#define vi... | // clang-format off
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define mp make_pair
#define fst first
#define snd second
#define forn(i,n) for (int i = 0; i < int(n); i++)
#define forn1(i,n) for (int i = 1; i <= int(n); i++)
#define popcnt __builtin_popcount
... |
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <vector>
#include <random>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
//#include <atcoder/all>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long... | //#include <bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include <string.h>
#include<cmath>
#include<string>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define pb push_back
#define INF 2e9
using namespace std;
typed... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 5e3 + 5;
const int INF = 0x3f3f3f3f;
#define DEBUG(x) cout << (x) << '\n'
#define fi first
#define se second
char s[MAXN];
int n;
void run(){
cin >> n >> s + 1;
int ans = 0;
for(int i = 1; i < n; i++){
int f1 = 0, ... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <map>
#include <cmath>
#include <queue>
#include <deque>
#include <set>
#include <iomanip>
#include <utility>
typedef long long ll;
typedef long double ld;
using namespace std;
int sum[5010][4];
int main() {
int N;
string S;
cin ... |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fcout cout << fixed << setprecision(18)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
double N; cin >> N;
double X0, Y0; cin >> X0 >> Y0;
double Xn, Yn; cin >> Xn >> Yn;
double Xc = (X0 + Xn) / 2.0;
double Yc = (Y0 + Yn... |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0, length = n; i < length; i++)
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ep emplace
#define epb emplace_back
#define scll static_cast<long long>
#define sz(x) static_cast<int>((x).size())
#define pfll(x) printf("%lld... | #include<bits/stdc++.h>
#define double long double
#define maxn 100010
using namespace std;
int read()
{
int s=0,w=1;
char ch=getchar();
while(ch<'0'||ch>'9') {if(ch=='-') w=-1;ch=getchar();}
while(ch>='0'&&ch<='9') s=(s<<3)+(s<<1)+(ch^48),ch=getchar();
return s*w;
}
int n,m,K,v[maxn];
double k[maxn],b[maxn],sk[ma... |
#include<bits/stdc++.h>
using namespace std;
# define ll long long
# define read read1<ll>()
# define Type template<typename T>
Type T read1(){
T t=0;
char k;
bool vis=0;
do (k=getchar())=='-'&&(vis=1);while('0'>k||k>'9');
while('0'<=k&&k<='9')t=(t<<3)+(t<<1)+(k^'0'),k=getchar();
return vis?-t:t;
}
# define fre(k... | //abc193_e.cpp
//Mon Mar 15 23:09:25 2021
#include <bits/stdc++.h>
#define INTINF 2147483647
#define LLINF 9223372036854775807
#define MOD 1000000007
#define rep(i,n) for (int i=0;i<(n);++i)
using namespace std;
using ll=long long;
typedef pair<int,int> P;
inline ll mod(ll a, ll m){
return (a%m+m)%m;
}
ll extGCD(l... |
#include<bits/stdc++.h>
using namespace std;
# define ll long long
# define read read1<ll>()
# define Type template<typename T>
Type T read1(){
T t=0;
char k;
bool vis=0;
do (k=getchar())=='-'&&(vis=1);while('0'>k||k>'9');
while('0'<=k&&k<='9')t=(t<<3)+(t<<1)+(k^'0'),k=getchar();
return vis?-t:t;
}
# define fre(k... | #include <bits/stdc++.h>
using namespace std;
int64_t extgcd(int64_t a, int64_t b, int64_t& x, int64_t& y){
int64_t d = a;
if(b != 0){
d = extgcd(b, a%b, y, x);
y -= (a/b) * x;
}else{
x = 1; y = 0;
}
return d;
}
pair<int64_t, int64_t> crt(int64_t b1, int64_t m1, int64_t b2,... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<ll, ll>;
using tp = tuple<ll, ll, ll>;
template <class T>
using vec = vector<T>;
template <class T>
using vvec = vector<vec<T>>;
#define all(hoge) (hoge).begin(), (hoge).end()
#... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i,j,n) for (int i=j; i <=(int)(n); i++)
int a[110];
int b[110];
int main() {
int n,k,m,mi;
string s;
cin >> n >> s;
rep(i,n+1)cin >> a[i];
rep(i,n) b[i]=a[i+1]-a[i];
k=10010;
rep(i,n){
if(b[i]>0) ... |
#line 1 "main_b.cpp"
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#i... | //#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline") //Optimization flags
//#pragma GCC option("arch=native","tune=native","no-zero-upper") //Enable AVX
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
#ifdef LOCAL
#include "debug-te... |
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
char S[200200]; int K, bc[1 << 16], tr[200200], dig[200200];
const long long mod = 1000000007;
long long prv[17][17], nxt[17][17];
int main()
{
scanf ("%s %d", S, &K);
int l = 0;
while (S[l]) l++;
for (int i = 0; i < l; i++){
if ('... | #include<bits/stdc++.h>
using namespace std;
const int N=5005,mod=998244353;
int n,m,ans,v[N][N];
int qp(int a,int b)
{
if(v[a][b]!=-1)
return v[a][b];
int ma=a,mb=b;
int ans=1;while(b){if(b&1)ans=1ll*ans*a%mod;a=1ll*a*a%mod;b>>=1;}
v[ma][mb]=ans;
return ans;
}
int main()
{
memset(v,-1,sizeof(v));
scanf("%d%d"... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
ty... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T>
ostream& operator<<(ostream &os, vector<T> &v){
string sep = " ";
if(v.size()) os << v[0];
for(int i=1; i<v.size(); i++) os << sep << v[i];
return os;
}
template<typename T>
istream& operator>>(istream &is, vector<... |
#include <bits/stdc++.h>
using ll = long long;
const int N(1010);
ll n, f[N];
int pos, fl[N];
std::vector<int> ans;
int main()
{
std::scanf("%lld", &n), f[1] = 1;
for (int i = 2; i <= 90; i++) f[i] = f[i - 1] + f[i - 2];
for (int i = 90; i; i--)
if (n >= f[i]) n -= f[i], fl[i] = 1, pos = std::max(pos, i);
for (... | #include <bits/stdc++.h>
#define rep(i,n) for ((i)=1;(i)<=(n);(i)++)
#define rep0(i,n) for ((i)=0;(i)<(n);(i)++)
using namespace std;
long long n,m,s,i;
vector<int> ans;
long long gcd(long long x,long long y){
if(!y) return x;
long long t=gcd(y,x%y);
s+=x/y;return t;
}
void print(long long x,long long y){
if(!x){
... |
#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;
template<class T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define pb push_back
#define N 100012
#define ll long long
#d... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll bin(ll a[],ll l,ll r,ll x){
ll m=(l+r)/2;
if(l>=r)return -1;
if(a[m]==x)return m;
if(a[m]>x)return bin(a,l,m-1,x);
return bin(a,m+1,r,x);
}
ll exp(ll a,ll b){
if(b==0)return 1;
ll res=exp(a,b/2);
if(b%2==0)return res*res;
return res*res*a;
}... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = (int)5e5 + 77;
const ll mod = (ll)1e9 + 7;
const ll inf = (ll)1e18;
ll n, m, ans;
map<ll, ll> mp;
int main()
{
int t = 1;
// cin >> t;
while (t--)
{
cin >> n;
ans = 0;
for (int i = 0; i < n; ... | #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<ll> dp(2, 1);
rep(i, n) {
vector<ll> temp(2);
swap(dp, temp);
string s;
cin >> s;
rep(y, 2) rep(x, 2){
int l... |
#pragma region RegionDefs
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0,i##_len=(n);i<i##_len;++i)
#define reps(i,l,r) for(int i=(l),i##_len=(r);i<i##_len;++i)
#define repr(i,l,r) for(int i=(r)-1,i##_left=(l);i>=i##_left;--i)
#define all(x) begin(x),end(x)
using namespace std;
typedef long long ll;
const ll INF... | #include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio; cin.tie(0); cout.tie(0)
#define ll long long
#define ull unsigned long long
#define pb push_back
#define pii pair<int,int>
#define pll pair<long,long>
#define vi vector<int>
#define ... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> //required
#include <ext/pb_ds/tree_policy.hpp> //required
using namespace __gnu_pbds;
using namespace std;
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// find_by_order(k) r... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for... |
#include<iostream>
#include<algorithm>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<deque>
#include<queue>
#include<map>
#include<set>
#include<list>
#define ll long long
#define str string
#define ld long double
#define vec vector
#define vll vec<ll>
#define vvll vec<vll>
#define rep(i,... | #include<iostream>
using namespace std;
int main()
{
int v,t,s,d,s1,s2;
cin>>v>>t>>s>>d;
s1=t*v;
s2=v*s;
if(d>=s1&&d<=s2)
cout<<"No";
else
cout<<"Yes";
return 0;
}
|
#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 ... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#in... |
#include <bits/stdc++.h>
using namespace std;
const int N = 20;
int h,w,a,b,ans;
bool vis[N][N];
void dfs(int now,int x,int y,int a,int b){
if (now==h*w){
ans++;
return ;
}
int nx=x+1,ny=y;
if (x==w) nx=1,ny++;
if (vis[x][y]) return dfs(now+1,nx,ny,a,b);
if (a){
if (x!=w&&!vis[nx][ny]){
vis[x][y]=vis[n... | #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;
#define ll long long
#define endl '\n'
#define F first
#define S second
#define test ll cases; cin>>cases; for(ll testCase = 1; testCase <= cases; testCase++)
#define f... |
#include "bits/stdc++.h"
#include "random"
#include <unistd.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define vl vector<long long>
#define vvi vector<vi>
#define pi pair<int,int>
#define mp make_pair
#define pb push_back
#define MOD int(1e9) + 7
#define PAI 3.1415926535
#define all(x) (x... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define f first
#define dbg(x) cout<< #x <<" "<<x<<"\n";
#define pii pair<ll,ll>
using namespace std;
void solve(){
ll n;
cin>>n;
unordered_set<ll> s;
for(ll i=2; i*i<=n; ++i){
ll x = i*i;
while(x<=n){
s.... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A, B;
cin >> A >> B;
int ans = 1;
for (int i = 1; i <= B; i++){
int X = (A + i - 1) / i * i + i;
if (X <= B){
ans = i;
}
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n;cin >> n;
string s;cin >> s;
ll res = -1;
if(s[0] != s[s.size() - 1])res = 1;
else{
for(int i = 1;i < (int)(s.size() - 2);i++){
if(s[0] != s[i] && s[i + 1] != s[s.size() - 1])res = 2;
}
}
cout << res << endl;... |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
#include <cstdint>
#include <string>
#include <sstream>
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 ... | #line 2 "/home/snow/competitive-programming/competitive-programming-library/snow/template.hpp"
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
constexpr long long INF = 1LL << 60;
constexpr long double PI = 3.141592653589;
#define rep(i, n) for (ll i... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
ty... | #include<bits/stdc++.h>
using namespace std;
const int maxn=2e5+10;
const int mod=1e9+7;
char s[maxn];int n,vis[300],ans=0,cnt=0;
int dp[maxn][17],f[maxn][17][17];
int mp[300];
void dfs(int pos)
{
if(pos>n) return;
for(int i=1;i<=16;i++){
dp[pos][i]=(dp[pos][i]+1LL*i*dp[pos-1][i]%mod)%mod;
dp[pos][i]=(dp[pos][i... |
#include<bits/stdc++.h>
#define ll long long
#define INF LLONG_MAX
#define MAXN 1000000000
#define mod 1000000007
#define PI 3.14159265
#define pb push_back
#define all(x) x.begin(),x.end()
#define d1(x) cerr<<#x<<":"<<x<<endl;
#define d2(x,y) cerr<<#x<<":"<<x<<' '<<#y<<":"<<y<<endl;
#define fast std::ios_base::sync_wi... | // Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools
#include <bits/stdc++.h>
// #include "atcoder/all"
using namespace std;
using i64 = long long;
const long long MOD = 1000000007;
const i64 INF = i64(1e18) + 7;
template <typename T>
bool chmin(T& x, T y){
if(x > y){
x = y;
... |
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <ctime>
using namespace std;
template<class T>
T gcd(T a, T b)
{
while (a > 0)
{
T t = a;
a = b%a;
b = t;
}
return b;
}
int main()
{
int N;
cin>>N;
vector<int> A(N);
for (int &a: ... | #include<bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#endif
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
#define endl "\n"
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef std::vecto... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define SP << " "
#define LLi long long int
using namespace std;
int imax=2147483647;
long long int llimax=9223372036854775807;
//int型vectorを出力
void PV(vector<int> pvv) {
rep(i, pvv.size()) cout << pvv[... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string x;
cin >> x;
int n = x.find(".");
if (n == std::string::npos) cout << x << endl;
else {
cout << x.substr(0, n) << endl;
}
... |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
long long modpow(long long a, long long p){
if(p == 0)return 1;
if(p % 2 == 1)return a * modpow(a, p - 1) % MOD;
long long r = modpow(a, p / 2);
return r * r % MOD;
}
long long modinv(long long a){
return modpow(a, MOD - 2)... | #include <iostream>
#include <math.h>
#include <iomanip>
#include <bits/stdc++.h>
#include <string.h>
#include <string>
#include <algorithm>
#define ll long long int
#define pb push_back
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
ll binomialCoeff(ll n,ll k)
{
ll res = 1;
if(k >n - k)
... |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
#include <cstdint>
#include <string>
#include <sstream>
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 ... | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define repp(i,n,m) for (int i = m; i < (n); ++i)
#define repl(i,n) for (long long i = 0; i < (n); ++i)
#defin... |
#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;
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
... | #include "bits/stdc++.h"
using namespace std;
#define endl "\n"
using ll = long long;
const int MOD = 1e9 + 7;
void solve() {
int n, w; cin >> n >> w;
cout << n / w << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
// cin >> t;
while (t--) {
solve();
}
} |
#include <bits/stdc++.h>
// #include <atcoder/all>
// #include "icld.cpp"
using namespace std;
using ll = long long int;
using vi = vector<int>;
using si = set<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using ss = string;
using db = double;
template<typename T> using minpq = priority_queue <T,vector... | #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 fi first
#define se second
using namespace std;
using pii = pair<int, int>;
signed main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
int n; cin>>n;
pri... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... | #include <bits/stdc++.h>
using namespace std;
long double dp[101][101][101];
long double f(int x, int y, int z)
{
long double ans = 0;
if (dp[x][y][z] > 0)
{
return dp[x][y][z];
}
if (x == 100 || y == 100 || z == 100)
{
return 0;
}
else
{
ans += x * f(x + 1, ... |
#include <bits/stdc++.h>
//#include "debugger.h"
#define int long long
using namespace std;
int gcd (int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int lcm (int a, int b) {
return (a / gcd(a, b)) * b;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef map<ll,ll>::iterator itll;
typedef long double ld;
typedef map<ll,ll> mapll;
#define con continue
#define pb push_back
#define fi first
#define se second
#define fr front()
#define INF 1000000000000000000
#define all(v... |
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define reps(i, s, n) for (int i = (s); i < (int)(n); ++i)
#define all(obj) begin(obj), end(obj)
#define cinv(a) rep(i,(int)a.size()) cin >> a[i]
#define debug(a) rep(i,(int)a.size()) c... | #include <bits/stdc++.h>
#if MYDEBUG
#include "lib/cp_debug.hpp"
#else
#define DBG(...) ;
#endif
#if __cplusplus <= 201402L
template <typename T>
T gcd(T a, T b) { return ((a % b == 0) ? b : gcd(b, a % b)); }
template <typename T>
T lcm(T a, T b) { return a / gcd(a, b) * b; }
#endif
using LL = long long;
constexpr LL ... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int h,w,a[110][110],maxx=0,minn=1010;
long long sum=0;
cin>>h>>w;
for(int i=1;i<=h;i++){
for(int j=1;j<=w;j++){
cin>>a[i][j];
minn=min(minn,a[i][j]);
maxx=max(maxx,a[i][j]);
}
}
if(maxx==minn) {
cout<<0;
return 0;
}
else {
for(int i=1;... | //インクルードなど
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
//イテレーション
#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;i>=ll(b);i--)
#define FORA(i,I) for(const auto& i:I)
//x:コンテナ
#define ALL(... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
constexpr ll MOD = 1e9 + 7;
//constexpr ll MOD = 998244353;
//constexpr ll MOD = ;
ll mod(ll A, ll M) {return (A % M + M) % M;}
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if ... | #include<cstdio>
#include<queue>
#define F(i,l,r) for(int i=l,i##_end=r;i<i##_end;++i)
using namespace std;
const int N=505,INF=0x3fffffff;
template<typename T>void read(T &x)
{
bool neg=false;
unsigned char c=getchar();
for(;(c^48)>9;c=getchar())if(c=='-')neg=true;
for(x=0;(c^48)<10;c=getchar())x=(x<<3)+(x<<1)+(c^... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
int main() {
int H, W;
cin >> H >> W;
vector<vector<int>> grid(H, vector<int>(W));
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
char c;
cin >> c;
if (c ==... | #include <bits/stdc++.h>
using namespace std;
// using mint = long double;
// using mint = modint998244353;
// using mint = modint1000000007;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> T;
typedef pair<ll, vector<ll>> Pd;
const ll INF = 1e18;
const ll fact_table = 3200008;
priority_queue<ll> ... |
#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;
#ifdef ENABLE_DEBUG
#define dump(a) cerr<<#a<<"="<<a<<endl
#define dumparr(a,n) cerr<<#a<<"["<<n<<"]="<<a[n]<<endl
#else
#define dump(a)
#define dumparr(a,n)
#endif
#... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
inline ll read() {
ll x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9') {
if(ch=='-') f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9') {
x=(x<<1)+(x<<3)+(ch-'0');
ch=getchar();
}
return x*f;
}
const int maxn=2e5+5;
ll n,k,a[maxn],cnt[15];
ll... |
#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 P=pair<int,int>;using PL=pair<ll,ll>;using vp=vector<P>;using vpl=vector<PL>;
#define all(v)(v).begin(),(v).end()
#define rall(v)(v).rbegin(),(v).rend()
// cin and c... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
double a, b, c;
cin >> a >> b >> c;
vecto... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define endl "\n"
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
// const ll mod = 1e9 + 7;
const ... | #include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, x;
string s;
cin >> n >> x >> s;
for (auto &c : s) {
if (c == 'o') {
x++;
} else {
x--;
}
if (x < 0) {
x = 0;
}
}
cout << x << "\n";
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.