code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
#define reps(i, a, n) for (int i = (a); i < (n); ++i)
#define rep(i, n) reps(i, 0, n)
#define deps(i, a, n) for (int i = (a); i >= (n); --i)
#define dep(i, n) deps(i, n, 0)
#define inf 2147483647
#define int long long
signed main(void)
{
int x, y, tmp; cin >> x >> y;
if ... | #include<bits/stdc++.h>
using namespace std;
signed main(){
int x, y;
cin >> x >> y;
if(abs(x - y) < 3)
cout << "Yes\n";
else
cout << "No\n";
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
string A,B;
cin>>A>>B;
int cnt1=0;
for(int i=0;i<N;i++){
if(A[i]=='1')cnt1++;
if(B[i]=='1')cnt1--;
}
if(cnt1!=0){
cout<<"-1\n";
return 0;
}
long long ans=0;
for(int i=0,cnt1move=0,cntA1=0,cntA0=0,lastA1=-1;i... | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
#include <iomanip>
using namespace std;
#define intmax INT_MAX
#define lmax LON... |
#include <bits/stdc++.h>
using namespace std;
const int c=5002;
long long n, m, sum, mod=998244353;
long long po[c][c];
int main()
{
ios_base::sync_with_stdio(false);
cin >> n >> m;
for (int i=0; i<=m; i++) {
po[i][0]=1;
}
for (int i=0; i<=m; i++) {
for (int j=1; j<=n; j++) {
... | #include <bits/stdc++.h>
#define fi first
#define se second
#define DB double
#define U unsigned
#define P std::pair
#define LL long long
#define LD long double
#define pb emplace_back
#define MP std::make_pair
#define SZ(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#defin... |
#include<bits/stdc++.h>
using namespace std;
using LL = long long;
constexpr int maxn = 200000 + 1;
void no(){
cout << -1;
exit(0);
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int N, M;
cin >> N >> M;
if(M < 0) no();
if(M == 0){
for(int i =... | #include<bits/stdc++.h>
#define pb emplace_back
#define AI(i) begin(i), end(i)
using namespace std;
using ll = long long;
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() {cerr << endl;}
template<class T1, class ...T2>
void kout (T1 v, T2 ...e) { cerr << v << ' ', kout(e...); }
temp... |
#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 length size()
#define int long long
#define ll long long
const int MOD = 1000000007;
const int MAX = 510000;
template<typename T> string join(vector<T> &vec ,c... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long int
#define mod 1000000007
#define vi vector<int>
#define pint pair<int,int>
#define vint vector<vector<int>>
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
const int N = 1e6+5;
int A[N], B[N], P[N], Q[... |
#include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int,int> II;
typedef tuple<int,int,int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
// minmax
te... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define d(x) cout<<x<<" "
#define nl cout<<endl
#define rep(var,init_val,final_val) for(int var = init_val; var < final_val; ++var)
#define tt ll t;cin>>t;while(t--)
#defin... |
#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <cstdio>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define ll long long
#define ull unsigned long long
#define cint const int&
#define Pi acos(-1)
const int mod = 1e9+7;
const int inf_int ... | #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)... |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
//const ll mod=998244353;
const ll mod=1000000007;
const vector<int> dy={-1... | #include<bits/stdc++.h>
#include<set>
using namespace std;
int main(){
int N,M;
cin >> N >> M;
int A[N];
vector<int> candidate,cnt(N+1);
for(int i = 0;i < N;i++){
cin >> A[i];
}
set<int> x;
for(int i = 0;i <= N;i++){
x.insert(i);
}
for(int i = 0;i < M;i++){
... |
#include <bits/stdc++.h>
#define arr array
#define pb push_back
#define fs first
#define sc second
#define eb emplace_back
#define vt vector
#define rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
using namespace std;
typedef long... | #include<bits/stdc++.h>
#define For(i,a,b) for(register int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(register int i=(a);i>=(b);--i)
#define int long long
using namespace std;
inline int read()
{
char c=getchar();int x=0;bool f=0;
for(;!isdigit(c);c=getchar())f^=!(c^45);
for(;isdigit(c);c=getchar())x=(x<<1)+... |
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll; typedef pair<int,int>pint; typedef long double ld;
using vll=vector<ll>; using vs=vector<string>;
#define b2e(v)v.begin(),v.end()
#define p2a(v, p) v[p.first][p.second]
class var { public: ll min,max,ct,s... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vp... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define ln cout<<'\n'
void pr(){ln;}
template<class A,class...B>void pr(const A &a,const B&...b){cout<<a<<' ';pr(b...);}
template<class T> inline bool chm... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int n,m;
int vdnsddglkdk;
cin>>n>>m;
vector<pair<int,int>>a(m);
for(int i=0;i<m;i++)
{
cin>>a[i].first>>a[i].second;
}
int k;
cin>>k;
vector<pair<int,int>>b(k);
for(int j=0;j<k;j++)
{
... |
/*
AUTHOR:SOURABH
CREATED:10:10:20
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<ll , null_type, less< ll >, rb_tree_tag, tree_order_statistics_node_update>
#define ll long long int
#define ld long double
#define fi first
#define s... | #pragma GCC optimize("Ofast")
#pragma GCC optimization("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define deb(x) cout << #x << " " << x << endl;
#define mod 1000000007
#define fast std::ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NU... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
typedef long long int ll;
typedef long double ld;
const int inf = 1e8;
const ll llinf = 1e18;
const double PI = acos(-1);
#define yes "Yes"
#define no "No"
#define all(n) n.begin(), n.end()
templa... | #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;
using ll = long long int;
using iPair = pair<int,int>;
using lPair = pair<ll, ll>;
using ivector = vector<int>;
using lvector = vector<ll>;
using istack = stack<int>;
u... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
void solve(){
ll n;
cin>>n;
if(n==2) {
cout<<1;
return;
}
ll i=1LL;
while(((i*(i+1))/2)<=(n+1))
i++;
ll res= n-(i-1)+1;
cout<<res;
}
int main() {
solve();
// your code goes here
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep1(i,n) for (int i=1;i<(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, ll>;
int main() {
int n;
cin >> n;
int mx = 1, th = 2;
rep(i,n){
if(i+1 == th){
mx++;
th *= 2;
}
cout << mx << " ";... |
#include<cstdio>
#include<algorithm>
typedef long long ll;
ll ans[2000005];
inline ll read() {
register ll x=0,f=1;register char s=getchar();
while(s>'9'||s<'0') {if(s=='-') f=-1;s=getchar();}
while(s>='0'&&s<='9') {x=x*10+s-'0';s=getchar();}
return x*f;
}
int main() {
ll n=read(); int cnt=0;
for(register ll i=1;... | #include <bits/stdc++.h>
#define M 1000000007
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define d(x) cout << #x << " " << x << "\n";
#define ll long long int
#define ul unsigned long long int
#define p pair<int, int>
#define ld long double
#define inf INT_MAX
usi... |
#include <iostream>
using namespace std;
typedef long long ll;
int main () {
int x;
cin >> x;
cout << ((x>0)?x:0) << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
#include <set>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main(){
int x;
cin >> x;
if(x >= 0)cout ... |
// Keep it simple
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define Br cout<<endl
#define int long long
#define fe first
#define se second
#define double long double
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define PT(x) cout << (x) << endl
#define last(x) prev(x.end()... | #include <bits/stdc++.h>
using namespace std;
void solve() {
string s;
cin >> s;
int ans = 0;
for (int i = 0; i <= 9999; ++i) {
set<char> have;
int t = i;
for (int j = 0; j < 4; ++j) {
have.insert(t % 10);
t /= 10;
}
int res = 1;
... |
#include <bits/stdc++.h>
using namespace std;
#define END '\n'
#define int long long
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define bug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define loop(i, a, b) for(int i = (a); i < (b); i++)
#define loopb(i, b, a) for(int ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
const ll mod = 10e8 + 7;
const ll inf = (1LL << 60);
vector<ll> x(20), y(20), z(20);
ll c(int i, int j) {
return abs(x[i] - x[j]) + abs(y[i] - y[j]) + max(0LL,z[j] - z[i]);
}
int main(){
int n... |
#include<bits/stdc++.h>
//#include <atcoder/all>
#define INF 1e9
#define rep(i,n)for(long long i=0;(i)<(long long)(n);i++)
#define REP(i,a,b)for(long long i=(long long)(a);(i)<=(long long)(b);i++)
#define ALL(a) (a).begin(),(a).end()
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define pb push_... | #include "bits/stdc++.h"
#define rep(i,b) for(ll i=0;i<b;i++)
#define ll long long
using namespace std;
/*--Input//////////////////////////////////////////////////*/
inline void IN(void){return;}
template <typename First, typename... Rest>
void IN(First& first, Rest&... rest){
cin >> first;
IN(rest...);
ret... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#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... | // author : ytczy666
// 21.6.29 10:09
#include <bits/stdc++.h>
const int N = 110;
#define inf 0x3f3f3f3f
int n, a[N], b[N * N][N];
char str[N];
int main() {
scanf("%d", &n);
scanf("%s", str + 1);
for (int i = 0; i <= n; i ++) scanf("%d", &a[i]);
int k = inf;
for (int i = 1; i <= n; i ++) k = std::min(k, abs(a... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
cout << 100*n*(n+1)*k/2+n*k*(k+1)/2 << endl;
} | #include<cstdio>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<vector>
#include<set>
using namespace std;
#define MAXN 100005
#define lowbit(x) (x&-x)
#define reg register
typedef long long LL;
typedef unsigned long long uLL;
typedef unsigned int uint;
typedef pair<int,int> pii;
cons... |
// E - Unique Color
#include <bits/stdc++.h>
using namespace std;
#define vec vector
using vi = vec<int>;
#define rep(i,e) for(int i=0;i<(e);++i)
int n;
vi C, ans;
vec<vi> G;
map<int,int> cc;
void dfs(int v){
if(ans[v] > 0) return;
cc[C[v]]++;
ans[v] = cc[C[v]];
for(auto&u:G[v]) dfs(u);
cc[C[v]]--;
}
int main()... | // 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 i64 MOD = 1e9 + 7;
const i64 INF = i64(1e18) + 7;
template <typename T>
bool chmin(T& x, T y){
if(x > y){
x = y;
return tr... |
//In The Name Of Allah
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define F first
#define S second
//#pragma GCC optimize("Ofast")
const int maxn = 1e5 + 5;
ll x, ans = 1e18 + 5;
map<ll, int> ca;
void calc(ll y)
{
queue<pair<ll, int> > q;
q.push({y, 0});
while(q.size(... | #include<bits/stdc++.h>
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define sc(a) scanf("%c",&a)
#define ss(a) scanf("%s",a)
#define pi(a) printf("%d\n",a)
#define pl(a) printf("%lld\n",a)
#define pc(a) putchar(a)
#define ms(a) memset(a,0,sizeof(a))
#define repi(i, a, b) f... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
#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 per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) ... | //starusc
#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
inline int read(){
int x=0,f=1,c=getchar();
while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
while(isdigit(c)){x=(x<<1)+(x<<3)+(c^48);c=getchar();}
return f==1?x:-x;
}
const int M=1004,N=1e6+4;
struct edge{
int v,... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long INF = 1LL<<60;
const double PI = acos(-1.0);
/*const double PI = atan2(0.0,-1.0)*/
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... | #define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(...) begin(__VA_ARGS__) , end(__VA_ARGS__)
#define boost {ios_base::sync_with_stdio(false); cin.tie(); cout.tie();}
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long... |
#include <bits/stdc++.h>
#define fir first
#define sec second
#define PB push_back
#define MP make_pair
#define all(a) (a).begin(), (a).end()
#define sz(a) (a).size()
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 foreach(itr, c)... | #include <bits/stdc++.h>
using namespace std;
typedef long double ld;
const int N = (int) 2e5 + 7;
int n;
int m;
int k;
int x[N];
bool is[N];
ld dp[N];
ld algo(ld dp0) {
ld sum = 0;
for (int i = n - 1; i >= 0; i--) {
if (is[i]) {
dp[i] = dp0;
} else {
dp[i] = 1 + sum / (ld) m;
}
sum ... |
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define ... | #include <bits/stdc++.h>
using namespace std;
int N, Q;
const int maxn = 2e5 + 5;
typedef long long ll;
inline ll read()
{
ll x = 0;
int s = 1;
char c = getchar();
while (c < 48 || c > 57)
{
if (c == '-')
s = -1;
c = getchar();
}
while (c >= 48 && c <= 57)
{
... |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
cout << a + b + c - min(min(a, b), c) << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define int long long
#define ordered_set tree<pair<int,int>, null_type, less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update>
#define fastio() ios_base::sy... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 7;
char s[N];
int main() {
cin >> (s + 1);
int n = strlen(s + 1);
ll ans = 0;
char last = '0';
int i;
for (i = 1; i <= n - 2; i++) {
if (s[i] == s[i + 1] && s[i + 2] != s[i] && last != s[i]) {
... | #include <bits/stdc++.h>
#define ll long long
ll md = 1000000007;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define g(v, i, j) get<i>(v[j])
#define vi vector<int>
#define vll vector<ll>
#define pii pair<i... |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <unordered_map>
#include <vector>
#include <queue>
#define lc u << 1
#define rc u << 1 | 1
using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
LL n,s,k;
LL exgcd(LL a,LL b,LL &x,LL &y)
{
if(!b)
{
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll n, ll m){
if(n < m) swap(n, m);
if(n % m == 0) return m;
return gcd(m, n % m);
}
ll extgcd(ll a, ll b, ll& x, ll& y){
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll gcd = extgcd(b, a % b, x, y);
ll oldX = x;
x = ... |
#include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for(ll i = 0;i < n;i++)
#define ll long long
#define MOD 998244353LL
using vi = vector<ll>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
ll n,k,x,y;
//moddivとnCkとgarner
//c剰余下でaをbで割った値
ll moddiv(ll a,ll b,ll c){
ll x0=... | #include <bits/stdc++.h>
using namespace std;
#define ar array
#define ll long long
const int MAX_N = 1e5 + 1;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
ll qexp(ll a, ll b, ll m) {
ll res = 1;
while (b) {
if (b % 2) res = res * a % m;
a = a * a % m;
b /= 2;
}
return res;
}
... |
#include<bits/stdc++.h>
#include<string.h>
#define ll long long
#define pf printf
#define sf scanf
#define ff first
#define ss second
#define clr clear()
#define sz size()
#define pb push_back
#define mk make_pair
#define pi acos(-1)
#define inf 200000000000
#define mod 998244353
#define ull unsigned long long int
#def... | #pragma region Region_1
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; 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 rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
using ll = long long;
using ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
long long int S = 0;
vector<long long int> V(2 * N);
for (int i = 0; i < 2 * N; i++) {
cin >> V.at(i);
S += V.at(i);
}
priority_queue<long long int, vector<long long int>, greater<long long int>> Q;
long long int T = 0;... | #include <bits/stdc++.h>
using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;
class rep {
struct Iter {
usize itr;
constexpr Iter(const u... |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
//const ll mod=998244353;
const ll mod=1000000007;
ll GCD(ll a,ll b) {retur... | /**
⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⡀⠀⠀⠀⠀⢀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⠀⣠⡖⠁⠀⠀⠀⠀⠀⠀⠈⢲⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⠀⣼⡏⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢹⣧⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⣸⣿⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⣿⣇⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⣿⣿⡇⠀⢀⣀⣤⣤⣤⣤⣀⡀⠀⢸⣿⣿⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⠀⢻⣿⣿⣔⢿⡿⠟⠛⠛⠻⢿⡿⣢⣿⣿⡟⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⣀⣤⣶⣾⣿⣿⣿⣷⣤⣀⡀⢀⣀⣤⣾⣿⣿⣿⣷⣶⣤⡀⠀⠀⠀⠀
⠀⠀⢠⣾⣿⡿⠿⠿⠿⣿⣿⣿⣿⡿⠏⠻⢿⣿⣿⣿⣿⠿⠿⠿⢿⣿⣷⡀⠀⠀
⠀⢠⡿⠋⠁⠀⠀⢸⣿⡇⠉⠻⣿⠇⠀⠀⠸⣿⡿⠋⢰⣿⡇⠀⠀⠈⠙⢿⡄⠀
⠀⡿⠁⠀⠀⠀⠀⠘⣿⣷⡀⠀⠰⣿⣶⣶⣿⡎⠀⢀⣾⣿⠇⠀⠀⠀⠀⠈⢿⠀
⠀⡇⠀⠀⠀⠀... |
#include<bits/stdc++.h>
using namespace std;
//#define int ll
#define ll long long
#define db double
#define rep(i,be,en) for(int i=be;i<=en;i++)
const int INF = 0x3f3f3f3f;
const ll inf=0x3f3f3f3f3f3f3f3f;
//const double pi=acos(-1);
const int mod=1e9+7;
const double eps = 1e-8;
using namespace std;
const int N=1e5+7;... | #include <bits/stdc++.h>
using namespace std;
#define watch(x) cerr << (#x) << ": " << (x) << endl
typedef long long LL;
const int N = 200009;
int n,m;
void nope() {
cout << -1 << endl;
exit(0);
}
void pr(int a,int b) {
cout << a << ' ' << b << '\n';
}
int main() {
ios_base::sync_with_stdio(false... |
#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;
int main(){
int l,r,m,n;
cin>>l>>r;
int nowmax=0;
for(int i=1;i<=r-l;i++){
if(l%i!=0) m=(l-l%i)+i;
else m=l;
n=(r-r%i);
if(m!=n){
nowmax=i;
}
}
cout<<nowmax;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,x;
cin>>n>>x;
vector<int> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
int c = 0;
for(int i = 0; i < n; i++){
if(a[i] != x){
cout << a[i] << ' ';
c++;
}
}
if(c == 0){cout << endl;}
} | #include<bits/stdc++.h>
using namespace std;
// ---------- Debugger
#define TRACE
string to_string(string s) {
return '"' + s + '"';
}
string to_string(char * s) {
return to_string((string) s);
}
string to_string(const char * s) {
return to_string((string) s);
}
string to_string(bool b) {
return (... |
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
#include<t... | #include<cstdio>
#include<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
#include<set>
typedef long long ll;
typedef unsigned un;
typedef std::vector<int> P;
typedef std::pair<int,int> pii;
ll read(){ll x=0,f=1;char c=getchar();while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9')x=x*1... |
#include<bits/stdc++.h>
using namespace std;
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args&&... args) {
const ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define repn(i,n) for(int i=1;i<=n;++i)
#define LL long long
#define pii pair <int,int>
#define fi first
#define se second
#define pb push_back
#define mpr make_pair
using namespace std;
const LL MOD=1e9+7;
int n,m,c[110],depth[110],ans[10010];
vector <... |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
if (n==1){
cout<<"1\n";
return 0;
}
if (n==2){
cout<<"1 2\n";
return 0;
}
vector<int> div(n+1,1);
for(int i=3;i<=n;i++){
for(int j=2;j*j<=i;j++){
if (i... | #include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <cstdio>
#include <string>
#include <cmath>
#include <queue>
#include <tuple>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <random>
#include <set>
#include <sta... |
#include<iostream>
#include<set>
#include<cmath>
#include<algorithm>
#include<vector>
#include<map>
using namespace std;
int N;
vector<pair<int,int> >S,T;
const double EPS=1e-7;
bool eq(double x,double y){return abs(x-y)<EPS;}
main()
{
cin>>N;
for(int i=0;i<N;i++)
{
int x,y;cin>>x>>y;
S.push_back(make_pair(x,y))... | #include <bitset>
#include <deque>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <algorithm>
#include <functional>
#include <iterator>
#include <locale>
#include <memory>
#include <stdexcept>
#include <utility>
#include <string>
#include <fstream>
#include <i... |
#include<bits/stdc++.h>
#define ll long long
#define ri register int
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a == b) cout<<a<<endl;
else cout<<(3-a-b)<<endl;
return 0;
} | #include <bits/stdc++.h>
int main() {
using namespace std;
cin.tie(nullptr)->sync_with_stdio(false);
int n;
cin >> n;
string s;
cin >> s;
if (s[0] != s.back()) {
cout << "1\n";
exit(0);
} else {
for (int i = 1; i + 1 < n - 1; ++i)
if (s[i] != s[0] and s[i + 1] != s[0]) {
cout ... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int v,t,s,d;
cin>>v>>t>>s>>d;
float x = (float)d/v;
int flag =1;
if(x>=(float)t && x<=(float)s)
flag =0;
if(flag == 1)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#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 dsrep(i,t,s) for(int i = (t)-1; i >= (s); --i)
#define rng... |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
typedef long long ll;
using namespace std;
using P=pair<int,int>;
int main()
{
string s;
cin>>s;
string t="ZONe";
int ans=0;
// rep(i,s.size()){
// if(s[i]==t[0]) cnt++;
// if(cnt==1&&s[i]==t[1])cnt++;
// if(cnt=... | #include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL)
#define ll unsigned long long int
#define Test ll t; cin>>t; while(t--)
#define en cout<<endl;
#define ub upper_bound
#define lb lower_bound
#define pb push_back
#define PI 3.141592653589793238
#define str string s; cin>>s; ll len=s.... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N,M;
string a;
cin >> N >> M;
for(int i=0; i<M; i++) {
cin >> a;
}
for(int y=0; y<N; y++) {
for(int x=0; x<N; x++)
cout << ".";
cout << endl;
}
};
| #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
vector<vector<char>> mat;
vector<pair<int,string>> in;
vector<string> in2;
vector<string> in3;
vector<string> in4;
vector<string> in5;
vector<string> in6;
vector<string> in7;
vector<string> in8;
vector<string> in9;
vector... |
/* これを翻訳している間、あなたはあなたの人生のいくつかの貴重な瞬間を無駄にしました */
#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 pb push_back
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define S(x) (int)(x).size()
#define L(x) ... | #include<bits/stdc++.h>
using namespace std;
int a,b;
long long k;
long long C(int x,int y){
if(x<0||x<y)return 0;
long long ans=1;
for(long long i=0;i<y;++i)ans*=x-i,ans/=i+1;
return ans;
}
int main(){
scanf("%d%d%lld",&a,&b,&k);
while(a||b){
if(a&&k<=C(a+b-1,a-1))putchar('a'),a--;
else k-=C(a+b-1,a... |
#include <cstdio>
using namespace std;
using LL = long long;
char s[7], t[7];
int score(const char* cards)
{
int cnt[10];
for(int i=0; i<10; i++) cnt[i] = i;
for(int i=0; i<5; i++)
cnt[cards[i] - '0'] *= 10;
int res = 0;
for(int x: cnt) res += x;
return res;
}
int main()
{
int k;
scanf("%d%s%s", &k, s, t)... | #include<iostream>
#include<vector>
#include<map>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int main()
{
int n,i;
ll s=0,res=0;
map<ll,ll> m;
decltype(m)::iterator it;
cin >> n;
vector<ll> a(n);
for(i=0;i<n;i++)
cin >> a[i];
m[0]=1;
for(i=0;i<n;i++){
if(i%2==0)
s+... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define INF32 2147483647 //2.147483647×10^{9}:32bit整数のinf
#define INF64 9223372036854775807 //9.223372036854775807×10^{18}:64bit整数のinf
#define MOD 1000000007
ll myceil(ll a,ll b){return (a + (b - 1)) / b;}
ll myfloor(ll a,ll b){return a / b;}
int ReLU... | #include <iostream>
using namespace std;
int main(){
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << b - c << endl;
} |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <map>
using namespace std;
int main() {
int N;
cin>>N;
cout<<N-1<<endl;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long int n;
cin>>n;
long long int r=sqrt(2*n);
long long int ans=0;
for(long long int i=1;i<=r;i++)
{
if(i%2!=0)
{
if(n%i==0)
{
long long int temp=n/i;
... |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 2e5+8, inf = 1e18+9, mod = 1e9+7;
int n, m, a[maxn], b[maxn], p[maxn], vs[maxn];
void solve() {
int i, j;
//cin >> n;
scanf("%lld", &n);
vector<pair<int, int>> vec;
for (i = 1; i <= n; i++) scanf("%lld", &a[i]);... | #include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#inc... |
#include <bits/stdc++.h>
#define MOD 1000000007
#define MAXN 1000000
#define ll long long
#define ull unsigned long long
#define vi vector<int>
#define vd vector<double>
#define vll vector<long long>
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define pi pair<int, int>
#defi... | /*
*/
#pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#include <assert.h>
#include <math.h>
#include <memory.h>
#include <stdio.h>
#include <algorithm>
#include <complex>
#include <ctime>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
... |
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define pii pair<int,int>
#define piii pair<int,pii>
#define sp " "
#define nl "\n"
#define all(x) x.begin(),x.end()
#define fastio() ios_base::sync_with_stdio(0);cin.tie(0);
#define ll long long
#define int ll
using... | #include<bits/stdc++.h>
#include<vector>
#include<math.h>
#include<string>
using namespace std;
#define MOD 998244353
#define MAX 200005
#define PMAX 18
#define PRECISION 0.000001
#define INF 1000000000000000000
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(NULL)
#include <ext/pb_ds/assoc_container.hpp>
#incl... |
#include <stdio.h>
typedef long long ll;
int main(void) {
ll i, j, l, n, k, a, b;
scanf("%lld%lld", &n, &k);
char s[n + 10], t[n], r[4] = "RPS";
scanf("%s", s);
for(j = 0; j < k; ++j) {
for(i = 0; i < n; ++i) {
a = (i * 2) % n, b = (i * 2 + 1) % n;
for(l = 0; l < 3; ++l) if(s[a] == r[l] && s[... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
int n, k;
string s;
cin >> n >> k >> s;
rep(i, k) {
string t = "";
rep(j, n) {
char c = s[(j * 2) % n], d = s[(j * 2 + 1) % n];
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rep3(i,m,n) for(int (i)=m;(i)<=(n);(i)++)
#define rep3rev(i,m,n) for(int (i)=m;(i)>=(n);(i)--)
#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
#define fi first
#define se second
#define pb p... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF=20;
int main(){
ll n,m;cin>>n>>m;
vector<ll> g(n);
while(m--){
ll a,b;cin>>a>>b;a--;b--;
g[a]|=(1<<b);
g[b]|=(1<<a);
}
vector<ll> d(1<<n,INF);
d[0]=1;
for(ll i=0;i<n;i++)for(ll j=0;j<(1<<n);j++)if(d[j]==1 && (g[i]&j)==j)d[j|(... |
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define LL long long int
vector<pair<LL,LL> > adj[100001];
vector <LL> djikstra(LL src,LL N)
{
vector <LL> dis(N,INT_MAX);
priority_queue< pair<LL,LL> ,vector< pair <LL,LL> >, greater< pair<LL,LL> > > pq;
for(auto it:adj[src])
{
pq... | #include <bits/stdc++.h>
using namespace std;
int N, Q;
const int maxn = 2e5 + 5;
typedef long long ll;
inline ll read()
{
ll x = 0;
int s = 1;
char c = getchar();
while (c < 48 || c > 57)
{
if (c == '-')
s = -1;
c = getchar();
}
while (c >= 48 && c <= 57)
{
... |
//agrawal117
//chahatagrawal117
#include<bits/stdc++.h>
#define endl '\n'
#define mod 1000000007
typedef long long int ll;
using namespace std;
#define MAX 100005
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n,m; cin>>n>>m;
char arr[n+10][m+10];
for(int i=1;i<=n;i++) fo... | #include <bits/stdc++.h>
#define debug(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long LL;
const int MAXN = 55;
const int MOD = 1E9 + 7;
LL n, x, a[MAXN], g[MAXN], dp[MAXN][2];
template <class T>
void read(T& x) {
x = 0;
T f = 1;
char ch = getchar();
while (ch < '0' || ch ... |
#include <bits/stdc++.h>
#include <cmath>
#define fl(i,a,b) for(long long i=a;i<b;i++)
#define test long long t_c;cin>>t_c;for(long long ks=1;ks<=t_c;ks++)
#define pb push_back
#define vi vector<int>
#define all(x) x.begin(),x.end()
#define cy cout<<"YES\n";
#define cn cout<<"NO\n";
#define nl cout<<endl;
#define ca... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define speed ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr)
#define all(vec) vec.begin(),vec.end()
#define int long long int
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,nul... |
// Problem : B - Abbreviate Fox
// Contest : AtCoder - AtCoder Regular Contest 108
// URL : https://atcoder.jp/contests/arc108/tasks/arc108_b
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#define DEBUG fprintf(stderr, "Passing... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
using vint = vector<int>;
using vll = vector<ll>;
using vld = vector<ld>;
using vpii = vector<pii>;
using vpil = vecto... |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 510 + 10;
#define gcd __gcd
const int mod = 200;
const int inf = 0x3f3f3f3f;
#define x first
#define y second
int a[N];
void solve() {
int n;
scanf("%d", &n);
printf("%d\n", n / 100 + (n % 100 != 0));
}
i... | // Problem C
#include <stdio.h>
#include <iostream>
#include <vector>
#include <string.h>
#include <cassert>
#include <algorithm>
#include <set>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#define MAXN 1000
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long int l... |
#include<bits/stdc++.h>
using namespace std;
#define MOD 998244353
#define ll long long
int main(){
ll a=0,b=0,c=0;
cin>>a>>b>>c;
ll moda = a*(a+1)/2, modb = b*(b+1)/2, modc = c*(c+1)/2;
ll modx = ((moda % MOD)*(modb % MOD))%MOD;
ll mody = ((modx % MOD)*(modc % MOD)% MOD);
cout<<mody<<endl;
} | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
template <typename A, size_t N, typename T> void Fill(A (&array)[N], const T& val) {
std::fill((T*)array, (T*)(array + N), val);
... |
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <fstream>
#include <queue>
#include <deque>
#include <iomanip>
#include <cmath>
#include <set>
#include <stack>
#include <map>
#include <unordered_map>
#include<cstring>
typedef unsigned long long ull;
ty... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
#define f first
#define s second
#define pb push_back
#define pob pop_back
#define mk make_pair
#define vi vector<int>
#define pii pair<int, int>
#define mod 1000000007
#define set_pre(x, y) fixed << setprecision(y) << x
#define w(t) \
int t... |
#include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
template <class Tp, class Comp = std::less<Tp>>
bool chle(Tp &x, const Tp &y, Comp comp = Comp()) {
return comp(y, x) ? x = y, true : false;
}
template <class Tp, class Comp = std::less<Tp>>
bool chge(Tp &x, const Tp &y, Comp comp = Comp()) {
... | #include <iostream>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n;
scanf("%lld", &n);
ll cnt = 0;
for(ll i = 1; i * i <= n; i++)
{
if(n % i == 0)
{
if(i % 2 == 1 )
cnt++;
if(i != n / i && (n / i) % 2 ==... |
#include <bits/stdc++.h>
#define ln '\n'
#define all(dat) dat.begin(), dat.end()
#define loop(i, to) for (int i = 0; i < to; ++i)
#define cont(i, to) for (int i = 1; i <= to; ++i)
#define circ(i, fm, to) for (int i = fm; i <= to; ++i)
#define foreach(i, dat) for (__typeof(... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#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<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define ALL(x) (x).begin(),(x).end()
template<class T>bool umax(... |
#include <bits/stdc++.h>
#define ln '\n'
#define all(dat) dat.begin(), dat.end()
#define loop(i, to) for (int i = 0; i < to; ++i)
#define cont(i, to) for (int i = 1; i <= to; ++i)
#define circ(i, fm, to) for (int i = fm; i <= to; ++i)
#define foreach(i, dat) for (__typeof(... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define ud unsigned int
#define ll long long
#define ull unsigned long long
#define MAX_INF 0x3f
#define MAX_INF_VAL 0x3f3f3f3f
#define MAX_INF_VAL_LL 0x3f3f3f3f3f3f3f3f
//#define pi 3.141592653589
#define eps 1e-9
#define F(x) ((x)/3+((x)%3==1?0:tb))
#define G(x) ... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define fi first
#define se second
#define vvvll vector<vector<vector<ll>>>
#define vvll vector<vector<ll>>
#define vll vector<ll>
constexpr ll INF = ... | #include <cstdio>
#include <iostream>
#define N 300005
using namespace std;
long long val[N];
inline long long read()
{
long long f(1),x(0);char a=getchar();
while(a!='-'&&(a<'0')||a>'9')a=getchar();
a=='-'?f=-1:x=a-'0';a=getchar();
while(a>='0'&&a<='9')x=(x<<3)+(x<<1)+a-'0',a=getchar();
return x*f;
}
struct n... |
#include <bits/stdc++.h>
#define rep(a,n) for (ll a = 0; a < (n); ++a)
using namespace std;
//using namespace atcoder;
using ll = long long;
typedef pair<ll,ll> P;
typedef pair<ll,P> PP;
typedef vector<vector<int> > Graph;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
temp... | #include <bits/stdc++.h>
using namespace std;
const int N = 1005;
int n, x;
void solve(int Case) {
scanf("%d %d", &n, &x);
x *= 100;
int ans = -1;
int v, p, y = 0;
for (int i = 0; i < n; ++i) {
scanf("%d %d", &v, &p);
y += v * p;
if (ans == -1 && y > x) ans = i + 1;
}
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fr first
#define sc second
// full credit ecnerwala
template <int& MOD_>
struct modint {
static constexpr i... | #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>;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> in... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,x;
cin>>n>>x;
vector<int> vec;
int c;
for(int i=1;i<=n;i++)
{
cin>>c;
vec.push_back(c);
}
auto it=find(vec.begin(),vec.end(),x);
while(it!=vec.end())
{
vec.erase(it);
it=find(vec.begin(),vec.end(),x);
}
for(auto i:vec)cout<<i<<" ";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define nl cout<<endl
#define pii pair<ll,ll>
#define vi vector<ll>
#define vii vector<pii>
#define mi map<ll,ll>
#define all(a) (a).begin(),(a).end()
#define pb push_back
#define ... |
#include <bits/stdc++.h>
#ifdef LOCAL
#include "debuger.hpp"
#else
#define DUMP(...) 1145141919810
#define CHECK(...) (__VA_ARGS__)
#endif
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
printf("%d %d\n", 2 * i % n + 1, (2 * i + 1) % n + 1);
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.en... |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll=int;
using ld=long double;
using pll=pair<ll, ll>;
//using mint = modint1000000007;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
#define PI acos(-1)
#define oo 2e18
template<typename T1, ... | #include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define dump(v) \
cerr << #v ":[ "; ... |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define reps(i,a,b) for(int i= a; i < b; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main()
{
int a, b, c = 0, d = 0;
cin >> a >> b;
while... | /*
* Author : Arman Sykot
* Date & time : 02.01.2021 18:00:36 +06
*/
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define I_am_the_one_who_KNOCKS ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
using namespace std;
const double EPS = 1e-9;
int main() {
#ifndef ONLINE_JUDGE
fre... |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int a;
double b;
cin>>a>>b;
cout<<a*b/100.0<<endl;
} | #line 1 "main.cpp"
#include <bits/stdc++.h>
using namespace std;
// template {{{
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define range(i, l, r) for (i64 i = (i64)(l); i < (i64)(r); (i) += 1)
#define rrange(i, l, r) for (i64 i = (i64)(r) - 1; i >= (i64)(l); (i... |
// C++(GCC 9.2.1)
// 解き直し.
// https://atcoder.jp/contests/arc108/editorial/348
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using P = pair<int, int>;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i,... | // Author : Sarthak Kapoor
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int ll
#define rep(i,n) for(int i=0;i<n;++i)
#define repa(i,a,n) for(int i=a;i<n;++i)
#define repr(i,n) for(int i=n-1;i>=0;--i)
#define ll long long
#define pi pair<int,in... |
#include <bits/stdc++.h>
using namespace std;
const int N = 321123;
int n, k, ans, black[N], white[N];
vector<int> g[N];
void dfs(int v, int p, int x) {
black[v] = N;
white[v] = 0;
for (auto u : g[v]) {
if (u == p) continue;
dfs(u, v, x);
if (black[v] + 1 + white[u] <= x)
white[u] = -1;
if (black[u] ... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<cstdio>
#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;
void solve() {
string s;
cin >> s;
ll m;
cin >> m;
ll maxi = 0LL;
for (char c : s) {
maxi = max(maxi, (ll)c - '0');
}
maxi += 1;
if (s.size() == 1) {
cout << (m >= stoll(s) ? 1 : 0) << '\n';
return;
}
ll n = (int... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <cstdint>
bool IsFeasible(const std::vector<int>& digits, std::int64_t base, std::int64_t M) {
std::int64_t X = 0;
for (const auto digit : digits) {
if (X > M / base) {
return false;
}
X = X * base + digit;
}
... |
#include <cstdio>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <string>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <tuple>
#include <bitset>
#include <complex>
using namespace std;
//typedef long long ll;
//typede... | #include<iostream>
using namespace std;
int main()
{
int A,B=0;
int maxFollow=0;
cin >> A;
cin >> B;
maxFollow = 2*A + 100;
int diff = maxFollow - B;
cout << diff << endl;
} |
#include <iostream>
#include <map>
#include <algorithm>
#include <vector>
using namespace std;
#define ll long long
vector<ll> vec;
void solve(){
for(char i = '1';i<='9';i++){
string temp = "";
temp += i;
temp += temp;
vec.push_back(stoll(temp));
}
for(char i = '1';i<='9'... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG //これつけるとA[N]でもいいらしい
//for文のマクロ
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define mp(a,b) make_pair(a,b)
#define big 1000000007
#define all(a) sort((a).begin(),(a).end()) //ソートのマクロ
#define Re(a) reverse((a).begin(),(a).end())
#define YN(a) i... |
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
typedef unsigned long long int ull;
typedef long int li;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define test ll t; cin >> t; while(t--)
#define print_tc(t, c) cout << "Case #" << t << ": " << c << "\n"; ... | #pragma GCC optimize("Ofast")
#include <iostream>
#include <stdio.h>
#include <string>
#include <vector>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <cctype>
#include <sstream>
#include <stack>
#include <deque>
#include <queue>
#include <list>
#include <set>
#include <map>
#incl... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define reps(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define uniq(a) (a).erase(unique(all(a)), (a).end())
#define bit(n) (1LL << (n))
#define dump(a) cerr << #a "... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <bitset>
#include <cmath>
#include <set>
#include <map>
#include <stdio.h>
#include <stdlib.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (int)(n); ++i)
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; }
typedef long long ll;
ll comb[61][... | #include <iostream>
using namespace std;
__uint128_t T = 1;
long long MOD = (1LL << 61) - 1;
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u ... |
//For higher stack size use g++ -O2 -std=c++11 -Wall -Wl,--stack=268435456 a.cpp -o a.exe in cmd
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#define ll long long
#define ld long double
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
const double eps = 1e-10;
const double INF = 1e9;
class Union_Find{
vector<int> par; vector<int> rank; vector<int> num;
public:
Union_Find(int n) {
par = vector<int>(n); rank = vector<int>(n,0);... |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#includ... | #include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long x, y;
cin >> x >> y;
map<long long, long long> dp;
auto sol = [&](auto &&self, long long val){
if(dp[val]) return dp[val];
if(x >= val){
return x - val;
}
long long rv = val - x;
if(... |
#include <bits/stdc++.h>
#pragma GCC optimize("O2")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,fma")
using namespace std;
using ll = long long int;
#define F first
#define S second
#define pb push_back
#define fast_io ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
const ... | //#include<cstdio>
//#include<cassert>
//#include<iostream>
//#include<cstring>
//#include<algorithm>
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define MAX ((int)1e8 + 5)
#define MAXP ((int)2e5)
#define MAXL ((ll)1e18 + 5)
#define MAX_X ((ll)1e5 + 2)
#define pi ... |
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
using VI = vector<int>;
int g(VI a, int i, int d);
int f(VI const& v) {
int i = find(cbegin(v), cend(v), 0) - cbegin(v);
return i < v.size() ? g(v, i, 0) + g(v, i, 1) : 1;
}
int w;
int g(VI v, int i, int d) {
int j = i +... | #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)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int ans0[4] = { 0,0,0,0 };
int ans1[4] = { 1,1,1,1 };
int ans2[4] = { 6,2,4,8 };
int ans3[4] = { 1,3,1,3 };
int ans4[4] = { 6,4,6,4 };
int ans5[4] = ... |
#include <bits/stdc++.h>
using namespace std;
// input
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__); // __VA_ARGS__可変引数マクロ
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void... | #define ll long long
#define dd long double
#define pb push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mp make_pair
#define mt make_tuple
#define F first
#define S second
#define fo(i ,a, n) for(ll i =a ; i < n ; i++)
//#define all(x) x.begin(), x.end()
#define tr(it, a) for(auto it ... |
#include <map>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#define ll long long
#define DEBUG pritnf("Passing [%s] in Line %d\n" , __FUNCTION__ , __LINE__) ;
const int MAX_N = 2e5 + 10 ;
std::map<int , int> bh ;
std::stack<int> st[MAX_N] ;
int n , tot , b[MAX_N] , BIT[MAX_N] ;
inline int lowbit(int x) ... | //#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,tune=native")
#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define X first
#define Y second
#define mp make_pair
typedef long long ll;
typedef unsigned long lon... |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
int h, w;
cin >> h >> w;
vector<string> vs;
for(int i = 0; i < h; i++){
string s;
cin >> s;
vs.push_back(s);
}
/*
i,j i+1,j
i,j+1 i+1,j+1
*/
int res = 0;
... | #include <bits/stdc++.h>
using namespace std;
using LL=long long;
using ULL=unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)
string S;
int main(){
cin>>S;
reverse(S.begin(),S.end());
int right_block=0;
char right_c='$';
LL ans=0;
stack<char> buf;
for(char c:S){
if(buf.size()!=0) if(buf.... |
#include <bits/stdc++.h>
typedef long long ll;
#define llinf 0x3f3f3f3f3f3f3f3f
#define inf 0x3f3f3f3f
#define SZ(x) (int)x.size()
#define mp make_pair
#define pii pair<int, int>
#define vi vector<int>
#define pb push_back
using namespace std;
char s[1005], t[1005];
string atc = "0atcoder";
vector<int> vec[26];
i... | #include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=1e9+7;
int dist[2000][2000];
bool done[26];
signed main(){
int h,w;
string a[2000];
cin>>h>>w;
pair<int,int>s,g;
vector<pair<int,int>>pos[26];
for(int i=0;i<h;i++){
cin>>a[i];
for(int j=0;j<w;j++){
... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 10;
int d[N], a[N];
ll f[N];
int n, m;
int h[N], e[N], ne[N], idx;
void add(int x, int y) {
e[++idx] = y, ne[idx] = h[x], h[x] = idx;
}
int main()
{
memset(h, -1, sizeof h);
idx = 0;
scanf("%d%d", &n, &m);
for(int i = 1; i <=... | // abc188e.cpp
#include <iostream>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
const int INF = 1000000009;
int main()
{
int n, m;
cin >> n >> m;
vector<int>a(n);
rep(i, n) cin >> a[i];
vector<vector<int>>w(n);
int x, y;
rep(i, m) {
cin >> x ... |
#include<bits/stdc++.h>
using namespace std;
const int INF=0x3f3f3f3f;
#define SZ(v) ((int)(v).size())
typedef pair<int,int> pii;
#define ll long long
int n;
const int Maxv=1e5+5;
bool dp[Maxv];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n;
dp[0]=1;
int tot=0;
for(int i=1;i<=n;i++... | #include <iostream>
#include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
vector<int>set(n);
int sum = 0;
int x1= 0 ,x2 = 0;
for(int i=0;i<n;i++){
cin>>set[i];
sum+=set[i];
}
bool subset[n + 1][sum + 1];
// If sum is 0, then answer is true
for (int i = 0; i <= n; i++)
s... |
//pls work
#include <bits/stdc++.h>
#include <cmath>
#include <cctype>
#include <cstring>
#define fori(i, j, k, in) for (int i = j; i < k; i += in)
#define rfori(i, j, k, in) for (int i = j - 1; i >= k; i -= in)
#define rep(i, j) fori(i, 0, j, 1)
#define rrep(i, j) rfori(i, j, 0, 1)
#define sq(a) (a) * (a)
#define... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vec;
typedef vector<vec> grid;
int main() {
int h, w;
cin>>h>>w;
grid dp(h+1, vec(w+1, -1));
grid cell_score(h+1, vec(w+1, -1));
vector<string> game(h);
for (int i=0; i<h; ++i) {
cin>>game[i];
}
for (int i=0; i<h; ++i) {
for ... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define pii pair<int,int>
#define pll pair<ll,ll>
#define ldb double
template<typename T>void ckmn(T&a,T b){a=min(a,b);}
template<typename T>void ckmx(T&a,T b)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int sz = 2e5+5;
int n, a[sz], w[sz], bit[sz];
void add(int x) {
while(x <= n) {
bit[x]++;
x += x & (-x);
}
}
int quer(int x) {
int ans = 0;
while(x) {
ans += bit[x];
x -= x & (-x);
}
return ans;
}
int... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#defin... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define all(x) (x).begin(),(x).end()
using namespace std;
constexpr int INF = 1e9, MOD = 1e9 + 7;
constexpr int64_t LINF = 5e18, LMOD = 998244353;
// #include <atcoder/all>
// using namespace atcoder;
// const int dy[]={0,-1,0,1,1,-1,-1,1};
// const int dx[... |
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <string>
#include <list>
#include <cassert>
#include <numeric>
#include <cstdint>
#include <queue>
#include <deque>
using ll = long long;
using ld = long double;
using namespace std;
using Graph = ve... | #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
typedef vector<int> vi;
#define all(x) x.begin(), x.end()
#define FIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
#define deb(x) ... |
#include<iostream>
#include<cstdio>
using namespace std;
const int M=1e9+7;
int T,n,a,b,ans;
int mo2(int x){
return (x<0)?x+M:x;
}
int get_sum(int l,int r,int k,int t){
int key1=l*k+t,key2=r*k+t;
return 1ll*(key1+key2)*(r-l+1)/2%M;
}
int main(){
scanf("%d",&T);
while (T--){
scanf("%d%d%d",&n,&a,&b);
if (... | #include <bits/stdc++.h>
typedef long long LL;
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define RALL(X) (X).rbegin(), (X).rend()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define RI(X) scanf("%d", &(... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define endl '\n'
#define all(x) (x).begin(),(x).end()
#define trace(...) debug(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void debug(const char* name, Arg1&& arg1){
cerr << name << ": " << arg1 << endl;
}
tem... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define FOR(i, a, b) for(int i = a; i < b; i++)
ll MOD = 1000000007;
ll power(ll base, ll n){
if (n == 0) return 1;
if (n == 1) return base;
ll halfn = power(base, n/2);
i... |
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
// #pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define f first
#define s second
#define fore(i,a,b) for(int i = (a), ThxMK = (b); i < ThxMK; ++i)
#define pb push_back
#define all(s) begin(s), end(s)
#define _ ios_base::sync_with_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
bool ok (ll len, ll tot)
{
ll tmp = tot / len;
return (tmp + 1 - len) % 2 == 0;
}
int main()
{
ll n; scanf("%lld", &n);
n <<= 1;
int cnt = 0;
for (ll i = 1; i * i <= n; i++)
{
if (n % i) continue;
cnt += ok(... |
#include <bits/stdc++.h>
using namespace std;
#define lc (rt << 1)
#define rc ((rt << 1) | 1)
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define rep(i, l, r) for (int i = (l); i <= (r); ++i)
#define per(i, r, l) for (int i = (r); i >= (l); --i)
#define PE(i, u) for (int i = head[... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DEBUG 1
using namespace std;
constexpr int kMod = 1000000007;
typedef long lo... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
char s , t;
cin >> s >> t;
if(s == 'Y' )cout << char (toupper(t)) << endl;
else cout << t << endl;
}
| #include<stdio.h>
#include<string.h>
int main(void){
char S,T;
S=fgetc(stdin);
T=fgetc(stdin);
scanf("%c",&T);
if(S=='Y'){
if(T=='a'){
printf("A");
}
else{
if(T=='b'){
printf("B");
}
else{
if(T==... |
#include <bits/stdc++.h>
using namespace std;
#define MS(a, b) memset(a, b, sizeof(a))
#define REP(a, b, c) for (register int a = b, _n = c; a <= _n; ++a)
#define DREP(a, b, c) for (register int a = b, _n = c; a >= _n; --a)
#define FOR(a, b, c) for (register int a = b, _n = c; a < _n; ++a)
#define EREP(a, b) for (reg... | #include <cstdio>
#include <iostream>
#include <cassert>
#include <string>
#include <algorithm>
#include <cstring>
#include <utility>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <deque>
#include <unordered_map>
#include <ext/pb_ds/assoc_container.hpp>
#inc... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.