code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#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 ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#def... | #include <bits/stdc++.h>
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#defin... |
// Author: Muhesh Kumar
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using db = long double;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using vs = vector<string>;
using vpi = vecto... | #include<bits/stdc++.h>
using namespace std;
int n,t,i;
char s[200005],c[200005];
int main(){
cin >>n;
cin >>s;
for(int i=0;i<n;i++)
if(s[i]=='x'&&t>1&&c[t]=='o'&&c[t-1]=='f')
t-=2;
else
c[++t]=s[i];
cout <<t <<"\n";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i, st, en) for (ll i = (ll)st; i < (ll)(en); i++)
#define repm(i, st, en) for (ll i = (ll)st; i >= (ll)(en); i--)
#define all(v) v.begin(), v.end()
void c... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for(int i=0; i<n; i++)
struct Data {
ll w, v;
Data(ll w, ll v) : w(w), v(v) {}
bool operator < (const Data &d) const {
if (d.v == v) {
return d.w > w;
} else {
... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define irep(i,a,b) for(int i=int(a);i<(int)b;++i)
#define rrep(i,a,b) for(int i=int(a);i>=(int)b;--i)
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vvp vector<vector<pair<ll,ll>>>
#... | #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;
int main() {
int N;
cin >> N;
vector<long long>A(N+1);
for(int i=0; i<N; i++)cin >>A[i];
long long ans=1;
sort(A.begin(), A.end());
for(int i=1; i<N+1; i++){
ans*=A[i]-A[i-1]+1;
ans%=1000000007;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend... |
#include<bits/stdc++.h>
#define LL long long
using namespace std;
int Len,fact[400010];
char str[400010];
LL ans,KSM[5][400010],f[400010],g[400010];
LL crt_m[1010],crt_r[1010],crt_cnt;
inline int read()
{
int x=0;bool w=0;char ch=0;
while(!isdigit(ch)){w|=ch=='-';ch=getchar();}
while(isdigit(ch)){x=(x<<1)+(x<<3)+(ch... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
int comb[10][10];
int lucas (int n, int k) {
int res = 1;
while (n > 0) {
res *= comb[n % 3][k % 3];
n /= 3;
k /= 3;
res %= 3;
}
return res;
}
signed main() {
ios::sync_with_stdio(false); cin.tie(0);
comb[0][0] = 1;
f... |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i ++)
vector <int> dy = {0, 1, 0, -1};
vector <int> dx = {1, 0, -1, 0};
const int INF = 1000000000;
const ll INFLL = 100000000000000000;
int main(){
int n, m; cin >> n >> m;
ve... | #include <iostream>
#include <cstdio>
#include <queue>
using namespace std;
const int maxn = 2050,inf = 1e9;
int n,m,x,y,z,last[maxn],ms[maxn],vis[maxn],dis[maxn],g[maxn][maxn];
struct Edge{
int v,w,nxt;
}e[maxn];
priority_queue <pair<int,int> > q;
int read(){
int x = 0;
char c = getchar();
while(c < '0' || c > '9'... |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
int main()
{
int n;
cin >> n;
map<int, int> m;
rep(i, n) {
int a;
cin >> a;
if (m.count(a)) {
m[a] = m[a] + 1;
} else {
m[a] ... | #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) -= 1)
#define w... |
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long LL;
LL mod = 998244353;
LL N , M , K;
LL qpow(LL a , LL b) {
LL res = 1;
while(b) {
if(b & 1) res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
int main() {
scanf("%lld %lld %lld" , &N , &M , &K);
if(N == 1 || M =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define rep(i,n) for (int i=1;i <=int(n);i++)
#define rrep(i,n) for(int i= int(n);i>=1;i--)
#define ffor(i,n) for (int i=0;i <int(n);i++)
#define p... |
#include<iostream>
#include<vector>
#include<bitset>
#include<algorithm>
using namespace std;
unsigned xorshift()
{
static unsigned y=2463534242;
y^=y<<13;
y^=y>>17;
y^=y<<5;
return y;
}
const int N=20;
int M;
string S[800];
string outH[N],outW[N];
int G[800][800];
using bit=bitset<800>;
bit rest;
bit can[N+1][800... | #include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <cassert>
#in... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << 7 * 3 - (a + b + c) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int f(int x){
return 7 - x;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
cout << f(a) + f(b) + f(c) << '\n';
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long int
#define pll pair<ll,ll>
#define vpll vector< pll >
#define mpll map<ll,ll>
#define MOD 1000000007
#define all(v) v.begin(),v.end()
#define s(v) v.size()
#define test ll t;cin>>t;while(t--)
#define vec vector<ll>
#define read0(v,n) for(int i=0;i<n;i++)cin>>v[i];
#define r... | #include <bits/stdc++.h>
// clang-format off
using namespace std; using ll = long long; using ull = unsigned long long; using pll = pair<ll,ll>; const ll INF = 4e18;
void print0() {}
template<typename Head,typename... Tail> void print0(Head head,Tail... tail){cout<<fixed<<setprecision(15)<<head;print0(tail...);}
void p... |
#include <algorithm>
#include <iostream>
#include <vector>
using std::cin;
using std::cout;
using std::min;
using std::sort;
using std::vector;
struct block {
int x, y;
} blocks[400000];
int up_most[200001];
vector<vector<int>> sum;
void set(int place) {
if (!sum[0][place]) {
for (int bit = 0; ; ++... | #include<bits/stdc++.h>
#define int long long
using namespace std;
vector<int>a[3];
int n,mp[200],x,y,ok,ans=LLONG_MAX,m1=LLONG_MAX,m2=LLONG_MAX;
signed main()
{
ios::sync_with_stdio(0);
mp['R']=0,mp['G']=1,mp['B']=2;
cin>>n;
n<<=1;
for(int i=1;i<=n;i++)
{
int x;
char t;
cin>>x>>t;
a[mp[t]].push_back(x);
... |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int a,b,w,minn = 1e9,maxx = -1e9;
bool ok = false;
int main()
{
cin>>a>>b>>w;w*=1000;
for(int i=1;;i++)
{
if (a*i<=w && w<=b*i && !ok){
minn = i;ok = true;
}
if (a*i>w && ok){
maxx = i-1;bre... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define getbit(n, i) (((n) & (1LL << (i))) != 0)
#define setbit0(n, i) ((n) & (~(1LL << (i))))
#define setbit1(n, i... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int t;
cin>>t;
vector<pair<int,int>> m(t);
rep(i,t){
cin>>m.at(i).first>>m.at(i).second;
}
vector<int64_t> nums(t);
rep(i,t){
int64_t min_c=m.at(i).first;
in... | #include<bits/stdc++.h>
using namespace std;
int read(){
int x=0,f=1;char ch=getchar();
while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int tests,n,a,b;
int main(){
a=read(),b=read();
printf("%d\n",2*a-b+100);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define flush cout.flush
using ll = int;
using ull = unsigned long long;
using ld = long double;
using pl = pair<ll, ll>;
const ll INF = 1e9 + 7;
const ll mod = 1e9 + 7;
const ll mod2 = 998244353;
const ld eps = 1e-9;
const ld PI = acos(-1);
const ll LOG = 13;
ll bit[L... | #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read()
{
bool flag=1;
int x=0;
char c=getchar();
while(c<'0'||c>'9')
{
if(c=='-')
flag=0;
c=getchar();
}
while(c>='0'&&c<='9')
{
x=(x<<1)+(x<<3)+c-'0';
c=getchar();
}
return (flag?x:~(x-1));... |
#pragma GCC optimise ("O1")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,j,n) for(ll i=j;i<n;i++)
#define _rep(i,n) for(ll i=n-1;i>=0;i--)
#define scn(a) scanf("%lld",&a)
#define scns(a,b) scanf("%lld %lld",&a,&b)
#define print(a) printf("%lld ",a)
#define v... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long int n,x;
cin>>n>>x;
string s;
cin>>s;
for(int i=0;i<s.length();i++)
{
if(s[i]=='o')
x++;
else if(s[i]=='x')
{
if(x==0)
{
continue;
}
else
x--;
}
}
cout<<x<<endl;
} |
#include <iostream>
#include <vector>
#define MSEED 1000000007
#define MCUT(num) ((num)>=0?((num)%MSEED):((MSEED+(num))%MSEED))
using namespace std;
int main()
{
int n;
cin >> n;
long long num[n];
for (int i = 0; i < n; i++) {
cin >> num[i];
}
if (n == 1)
cout << num[0] << endl;
else {
long long p... | #pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2")
#include <bits/stdc++.h>
#define mem(a,x) memset(a,x,sizeof(a))
#define gi(x) scanf("%d",&x)
#define gi2(x,y) scanf("%d%d",&x,&y)
#define gll(x) scanf("%lld",&x)
#define gll2(x,y) scanf("%lld%lld",&x,&y)
using namespace std;
const double... |
#include <bits/stdc++.h>
using namespace std;
#define e1 first
#define e2 second
#define pb push_back
#define mp make_pair
#define boost {ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); }
#define eb emplace_back
#define OUT(x) {cout << x; exit(0); }
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define scanf... | #include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int a[N],b[N],bit[N],id[N],x;
using ll = long long;
map<int,queue<int>> p;
int main(void){
int n;
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n;
for(int i = 1; i <= n; i++){
cin >> x;
p[x + i].push(i);
}
for(int i = 1; i <= ... |
#include <iostream>
#include <vector>
using namespace std;
bool is_ok (int x) {
if (x % 2 != 0) return false;
if (x % 3 == 0) return true;
if (x % 5 == 0) return true;
if (x % 7 == 0) return true;
if (x % 11 == 0) return true;
return false;
}
int main () {
vector<int> ans;
ans.push_back(3 * 5 * 7 * 1... | #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read()
{
bool flag=1;
int x=0;
char c=getchar();
while(c<'0'||c>'9')
{
if(c=='-')
flag=0;
c=getchar();
}
while(c>='0'&&c<='9')
{
x=(x<<1)+(x<<3)+c-'0';
c=getchar();
}
return (flag?x:~(x-1));... |
#include <iostream>
#include <string>
#include <vector>
#include <map>
using ll=long long;
using namespace std;
int main(){
int N;
ll X;
cin>>N>>X;
vector<ll> A(N);
for(int i=0;i<N;i++){
cin>>A[i];
}
vector<ll> C(N+1);
C[0]=1000000000000000000;
for(int i=1;i<=N;i++){
... | #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;
using ll=long long;
using ull=unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)
ll GCD(ll a,ll b){ return b?GCD(b,a%b):a; }
ll A,B;
int E[73][73];
int pN;
int I[38];
ll G[38];
int dp1[1<<19], dp2[1<<19];
ll solve(){
rep(i,pN) G[i]=0;
rep(i,pN) rep(j,pN) i... | #define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include <chrono>
#include <random>
#include <unordered_set>
using namespace std;
typedef long long ll;
void solve() {
ll a, b;
cin >> a >> b;
int n = 73;
vector<int> s(n);
vector<int> prime;
for (int i = 2; i < n; i++) {
if (s[i... |
#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar(){
static char buf[1048576];
static int s = 1048576;
static int e = 1048576;
if(s == e && e == 1048576){
e = fread(buf, 1, 1048576, stdin);
s = 0;
}
if(s == e){
return EOF;
}
return buf[s++];
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define pb push_back
template <class T, class U>
inline bool chmax(T& a, U b) {
if (a < b) {
a = b;
return true;
... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
int i,j;
int count=0;
cin >> n;
if(n%100!=0){
cout << n/100+1 << endl;
}else{
cout << n/100 << endl;
}
} | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define rep(i,cc,n) for(int i=cc... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
typedef double db;
#define fi first
#define se second
const int MAXN=2e5+10;
int a[MAXN], n, pa[MAXN], cnt;
set<int> s;
inline void pre(int siz) { iota(pa+1, pa+1+siz, 1); cnt=siz; }
int find(int u) { return u==pa[u]?u:(pa[u]=f... | #include<bits/stdc++.h>
#define MAXN 300005
#define INF 1000000000000000000LL
#define MOD 1000000007
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int n,a[MAXN];
map<ll,int> cnt;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
ll c... |
#include <sstream>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <complex>
#include <malloc.h>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <bitset>
#include <list>
#include <strin... | #include <bits/stdc++.h>
using namespace std;
long long INF = 1LL<<60;
using ll = long long;
using vll = vector<ll>;
using mll = map<ll, ll>;
#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()
template<class T>bool chma... |
#include<bits/stdc++.h>
using namespace std;
int n;
string s;
int ans(){
if(s.front()!=s.back()) return 1;
for(int sz=s.size(),i=1; i<sz; ++i){
if(s[i-1]!=s[0] && s[i]!=s[0]) return 2;
}
return -1;
}
int main(){
cin>>n>>s;
cout<<ans();
} | #define DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printA... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,k,ans;
ll sum(ll x){
if(x>n+1)return 2*n-x+1;
return x-1;
}
int main(){
cin>>n>>k;
k=abs(k);
for(int i=2;i+k<=2*n;i++)ans+=sum(i)*sum(i+k);
cout<<ans<<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 int
#define ld long double
#define pb push_back
#define MOD 10... |
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
void e(vector<ll> a, vector<ll>& p){
ll c=a.size(),d=p.size();
for(ll bits=0; bits<d; ++bits){
ll sum=0;
for(int i=0; i<c; ++i){
if(!(bits&(1<<i))) continue;
sum+=a[i];
}
p[bits]=sum;
}
sort(p.begin(),p.end());
}
int ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pll = pair<ll, ll>;
using vll = vector<ll>;
#define endl "\n"
#define space " "
#define TLE_na_ho ios_base::sync_with_stdio(false);cin.tie(NULL)
#define MAX_SIZE 1024
#define MOD 1000000007
... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = ll(10000);
void solve(long long N) {
set<ll> ans;
N -= 3;
for (ll i = 12; i <= INF; i += 6) {
ans.insert(i);
}
for (ll i = 20; i <= IN... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define deb(x) cout<< #x << " " << x << "\n";
#define MAX 9223372036854775807
#define MIN -9223372036854775807
#define setbits(n) __builtin_popcountll(n)
#define mkunique(a... |
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#d... | #include <bits/stdc++.h>
using namespace std;
int n, m, a[1005], b[1005], dp[1005][1005];
int main (){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n >> m;
for (int i=1; i<=n; i++) cin >> a[i];
for (int i=1; i<=m; i++) cin >> b[i];
for (int i=1; i<=max(n, m); i++)
dp[0][i]=dp[i][0]=i;
for (int i=1; i<=n; i... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
const long long INF = 1e17;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
long long n;
cin >> n;
long long f0 = 0, l = -INF, r = INF;
long long memo = 0;
for(long long i ... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll a,b;
cin>>a>>b;
ll ans=1;
if(b>=2*a){
for(ll i=b;i>=a;i--){
if(i*2<=b){
ans=i;
break;
}
}
cout<<max(ans,(ll)1);
}
else{
ll ans=1;
for(ll i=1;i<=b;i++){
int... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x) cerr << "Line " << __LINE__ << ": " << #x << " = " << (x) << "\n";
#define spa << " " <<
#define fi first
#define se second
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
using ld =... |
#include <bits/stdc++.h>
using namespace std;
#define INF 200005
#define MOD 1000000007
#define ping cout << "ping\n"
int main()
{
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
//ios_base::sync_with_stdio(false);
//cin.tie(NULL);
int n;
cin >> n;
string a;
cin >> a;... | #ifdef DBG_MACRO_NO_WARNING
#include <dbg.h>
#endif
#include <bits/stdc++.h>
#define all(c) c.begin(), c.end()
#define isz(c) (int)c.size()
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
template <typename InputIterator,
typename T = typename iterator_traits<In... |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n,m,K,C[31][61];
int main(){
cin>>n>>m>>K;K--;
for(int i=0;i<=60;i++){
C[0][i]=1;
for(int j=1;j<=30&&j<=i;j++)C[j][i]=C[j][i-1]+C[j-1][i-1];
}
int t=0;
for(int i=1;i<=n+m;i++){
if(K>=C[m-t][n+m-i])K-=C[m-t][n+m-i],cout<<'b',t++;
else cout... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0; i<(n); ++i)
#define RREP(i, n) for(int i=(n);i>=0;--i)
#define FOR(i, a, n) for (int i=(a); i<(n); ++i)
#define RFOR(i, a, b) for(int i=(a);i>=(b);--i)
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
#define DUMP(x) c... |
#include <bits/stdc++.h>
#define ll long long
#define MAXN 200010
using namespace std;
vector<pair<ll,ll> > cp(MAXN),dp(MAXN);
ll n;
void All()
{
for (ll i=0;i<=n;i++)
cp[i]=make_pair(INT_MAX,INT_MIN);
}
int main()
{
///ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
ll x,c;
cin >> n;
... | //インクルード(アルファベット順)
#ifndef TEMPLATE
#define TEMPLATE
#include<algorithm>//sort,二分探索,など
#include<bitset>//固定長bit集合
#include<cmath>//pow,logなど
#include<ctime>
#include<complex>//複素数
#include<deque>//両端アクセスのキュー
#include<functional>//sortのgreater
#include<iomanip>//setprecision(浮動小数点の出力の誤差)
#include<iostream>//入出力
#include... |
#include <bits/stdc++.h>
using namespace std;
//int target()
int looping(int cnt1, int depth, int res, int limdep, string N1){
depth ++;
//cout << limdep << " " << depth << " " << cnt1 << endl;
if (res == -1){
if (depth == limdep){
if /*write conditon from here*/ ((stol(N1) % 3) =... | #include<bits/stdc++.h>
using namespace std;
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
typedef long long int ll;
typedef long double ld;
#define trump(v,a) vector<ll> v(a); for(int i =0;i<a; ++i)cin>>v[i];
#define modi(v) for(auto i:v) cout<<i<<" ";
#define debug_pair(obg) for(auto i:obg) cerr<<i.... |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <queue>
#include <numeric>
#include <iomanip>
#include <map>
#include <set>
using namespace std;
using ll = long long;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
#define pb push_... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0,endrep=(n); i<endrep; ++i)
#define rep1(i,n) for(ll i=1,endrep=(n); i<=endrep; ++i)
#define revrep(i,n) for(ll i=(ll)(n)-1; i>=0; --i)
inline constexpr ll Inf = (1ULL << 60) -123456789;
#define fastio cin.tie(0); ios_base::s... |
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace chrono;
typedef long long int ll;
typedef vector<int> vii;
typedef vector<ll> vll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define pb push_back
#define odd(x) ((x)&1)
#define even(x) (!odd(x))
#define all(v) (v).begin(),(v).e... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N,first=0,second=0,findex=0,sindex=0;
vector<string> s(1010);
vector<int> t(1010);
cin >> N;
for (int i = 0; i < N; i++){
cin >> s[i] >> t[i];
}
for (int i = 0; i < N; i++){
if(first<t[i]){
... |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
int main(){
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i, h) cin >> s[i];
int ans = 0;
rep(i, h)rep(j, w){
if (s... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=1e6+7;
const int inf=INT_MAX;
const ll inff=1e18;
const ll mod=1e9+7;
#define pii pair<int,int>
#define mkp make_pair
#define F first
#define S second
#define pb push_back
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(),(v).... |
#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | #include<bits/stdc++.h>
#define int long long
using namespace std;
int mod=998244353;
const int sz=5e3+1;
int fac[sz];
int inv[sz];
int fpow(int a,int b)
{
int ans=1;
while(b)
{
if(b&1)
{
ans*=a;
ans%=mod;
}
a*=a;
a%=mod;
b>>=1;
... |
#include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define mod 1e9+7
#define inf 1e18
#define N 1000043
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define loop(a,b) for(int i=a;i<b;i++)
#define test int t; cin >> t; while(t--)
#define pll pair<ll,ll>
#define int ll
using names... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <iterator>
#include <stack>
#include <queue>
#include <functional>
#include <map>
#include <set>
#include <tuple>
#include <bitset>
using namespace std;
#define ll long long
#define double long double
#define vi vect... |
//雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se seco... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define DIV 1000000007 //10^9+7
#define INF LONG_MAX/3
#define bit(n) (1LL<<(n))
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(... |
#include<bits/stdc++.h>
using namespace std;
#define Mod(x) (x>=P)&&(x-=P)
#define rep(i,a,b) for(int i=a,i##end=b;i<=i##end;++i)
#define drep(i,a,b) for(int i=a,i##end=b;i>=i##end;--i)
#define erep(i,a) for(int i=hd[a];i;i=nxt[i])
typedef long long ll;
void Max(int &x,int y){x<y&&(x=y);}
void Min(int &x,int y){x>y&&... | #ifdef DEBUG_BUILD
# define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#ifdef DEBUG_BUILD
# include "debugger.hpp"
#else
# define debug(...)
# define debugdo(...)
#endif
using namespace std;
using ll = long long;
using ld = long double;
using pll = std::pair<ll, ll>;
template <class T> using vec = std::vector<T>;
t... |
#include <iostream>
#include <vector>
#include <algorithm>
#define _LIBCPP_DEBUG 0 // clang
// #define _GLIBCXX_DEBUG // gcc
using namespace std;
using ll = long long;
int main()
{
int x, y, z;
cin >> x >> y >> z;
int res = (y * z - 1) / x;
cout << res << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll,ll>;
using pld = pair<ld,ld>;
using vll = vector<ll>;
using vld = vector<ld>;
using vstr = vector<string>;
#define _GLIBCXX_DEBUG
#define rep(j, m) for (ll j = 0; j < (ll)(m); j++)
#define rep2(i, l, n) for (... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b,c, d;
cin>>a>>b>>c>>d;
int ans = INT_MIN;
for(int i=a;i<=b;i++)
{
for(int j=c;j<=d;j++)
ans = max(ans, i-j);
}
cout<<ans;
}
| #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
using vvc = vector<vc>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for(ll i = (ll)(m); i < (ll)(n); ... |
#include <bits/stdc++.h>
using namespace std;
// 総数を1000000007（素数）で割った余り
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vec... | #include<bits/stdc++.h>
#define LL long long
using namespace std;
int n,m;
LL a[200010],b[200010];
LL A[200010],B[200010],ans=1e18;
inline LL read()
{
LL x=0,w=0;char ch=0;
while(!isdigit(ch)){w|=ch=='-';ch=getchar();}
while(isdigit(ch)){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
return w?-x:x;
}
LL Find(LL x)
{
int L... |
#include <bits/stdc++.h>
#define SIS std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define lowbit(x) (x & -x)
#define FOR(i,a,b) for(int i=(a); i< (b); ++i)
#define RFOR(i,b,a) for(int i=(b);i>=(a);i--)
#define REP(i,a,b) for(int i=(a); i<=(b); ++i)
#define PI 3.14159265358979323846264338327950L
using nam... | #include<bits/stdc++.h>
using namespace std;
int main(){
vector<string> vec(3);
for(int i=0; i<3; i++){
cin >> vec[i];
}
map<char,int> M;
int cnt = 0;
for(int i=0; i<3; i++){
for(int j=0; j<vec[i].size(); j++){
if(!M.count(vec[i][j])){
M[vec[i][j]] = cnt;
cnt++;
}
}
... |
#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;
//typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> index_set;
//typedef tree<ll, null_type, less_equal<ll>, rb_tree_tag, tre... | #include<bits/stdc++.h>
using namespace std;
#define deb(x) cout <<"\n"<< (#x) << " = " << (x) << "\n"
const long long INF = 1e18;
const long long mod=1e9+7 ;
#define ll long long int
bool iscolinear(int x1, int y1, int x2,
int y2, int x3, int y3)
{
int a = x1 * (y2 - y3) +
x2 *... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define io ios::sync_with_stdio(false); cin.tie(0)
void print_vec(const vector<int>& vec) {
int n = vec.size();
cout << n << " ";
... | // 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... |
/*Lucky_Glass*/
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int N=2e5+10;
inline int Rint(int &r){
int b=1,c=getchar();r=0;
while(c<'0' || '9'<c) b=c=='-'? -1:b,c=getchar();
while('0'<=c && c<='9') r=(r<<1)+(r<<3)+(c^'0'),c=getchar();
return r*=b;
}
int n,... | #include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
using namespace __gnu_pbds;
using namespace std;
typedef tree<
int,
null_type,
less<int>,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#pragma GCC ta... |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
typedef long long LL;
typedef pair<LL, LL> PII;
PII vote[N];
LL n;
bool cmp(PII, PII);
int main(){
cin >> n;
LL va = 0, vb = 0;
for(LL i = 1; i <= n; i++){
cin >> vote[i].first >> vote[i].second;
va += vote[i].first;
... | #include<bits/stdc++.h>
using namespace std;
#define setbits(x) __builtin_popcountll(x)
#define leadzero(x) __builtin_clz(x)
#define trailzero(x) __builtin_ctz(x)
#define mod 1000000007
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define FIO ios_base::sync_wi... |
#include <bits/stdc++.h>
#define gc() getchar()
using namespace std;
typedef long long ll;
template <typename T> void rd(T &x){
ll f=1;x=0;char c=gc();
for(;!isdigit(c);c=gc())if(c=='-')f=-1;
for(;isdigit(c);c=gc())x=(x<<1)+(x<<3)+(c^48);
x*=f;
}
int a,b;
int main(){
rd(a),rd(b);
printf("%d\n",(1+a)*a/2*b*100+... | #include<bits/stdc++.h>
#define rep(i, s, n) for (long long i = s; i < (int)(n); i++)
#define all(a) a.begin(), a.end()
#define put(i) cout<<fixed<<i<<endl
#define putl(a) for(auto x:a)cout<<x<<' '; cout<<endl
using namespace std;
using ll = long long;
int main(){
ll n; cin >> n;
deque<char> q;
rep(i,0,n)... |
#include <bits/stdc++.h>
using namespace std;
bool flg[100][100];
int main() {
int n; cin >> n;
for(int i = 0; i < n; ++i) {
for(int j = 0; j < n; ++j) {
char c; cin >> c;
flg[i][j] = (c == '1');
}
flg[i][i] = true;
}
for(int k = 0; k < n; ++k) {
for(int i = 0; i < n; ++i) {
for(int j = 0; j < n; ... | #pragma GCC optimize("Ofast")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define mp make_pair
#define eb emplace_back
#define pb push_... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define dl double
using namespace std;
const int N = 2e6 + 7;
const long long mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n,m,k;
ll bnp(ll x, ll y)
{
if(y == 0)return 1ll;
i... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <iomanip>
#include <queue>
#include <deque>
#include <map>
#include <unordered_map>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define repr(e,x) for(auto& e:x)
usi... |
#include<bits/stdc++.h>
using namespace std;
#define fr(i,t) for(i=0;i<t;i++)
#define fr1(i,r,t) for(i=r;i<t;i++)
typedef long long int lli;
typedef unsigned long long int ulli;
#define inf LONG_MAX
#define ff first
#define ss second
double pie=3.14159265358979323846;
#define dbug(x) cout<<#x<<"="<<x<<endl;
#define db... | #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"
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
#define pb push_back
#define sz size()
#define ice(i, a, b) for (int (i) = (a); (i) < (b); ++(i))
void solve() {
int n, m; cin >> n >> m;
vi v(n); vvi track(1500001);
ice (i, 0, 1500001) {
track[i].p... | #include <bits/stdc++.h>
using namespace std;
#define poi 400100
typedef long long ll;
typedef double db;
const int mod = 998244353;
int f[poi];
inline int re()
{
char c = getchar();
int x = 0, k = 1;
while (c < '0' || c > '9')
{
if (c == '-')
k = -1;
c = getchar();
}
... |
#include<bits/stdc++.h>
#define db double
using namespace std;
int read()
{
int a=0,f=1,c=getchar();
while(!isdigit(c))
{
if(c=='-')f=-1;
c=getchar();
}
while(isdigit(c))
{
a=a*10+c-'0';
c=getchar();
}
return a*f;
}
const int N=1e5+10;
const db INF=1e18;
int n;
int a[N];
int main()
{
// freopen("... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using LL = long long;
using P = pair<int,int>;
using vv = vector<vector<int>>;
const int INF = (int)1e9;
const LL LINF = (LL)1e18;
int main(){
int K;
cin >> K;
int ans = 0;
for(int A = 1; A <= K; A++){
for(int B = 1... |
#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;
const int N = 200010;
int n, p[N];
int main() {
cin >> n;
for (int i = 1; i <= n; ++i) {
scanf("%d", p + i);
}
vector <int> ans;
for (int i = n; i >= 1; --i) {
if (p[i] == i) continue;
int at = -1;
for (int j = i - 1; j >= 1; --j) if (p[j] == i... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1001001001;
const long long MOD = 1000000007;
const double EPS = 1e-10;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin>>n;
int a[n],minv=INF,maxv=-1;
for(int i=0;i<n;i++){
cin>>a[... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define fi first
#define se second
#define mp(i,j) make_pair(i,j)
typedef long long ll;
const int maxn = 1e3+5;
vector<int> vec;
vector<int> pre;
int gcd(int x,int y){
return y? gcd(y,x%y) : x;
}
int ... |
#include<bits/stdc++.h>
#define cs const
#define fr first
#define se second
#define ls (now<<1)
#define mp make_pair
#define pb push_back
#define ll long long
#define ppb pop_back
#define rs (now<<1|1)
#... | #include <bits/stdc++.h>
using namespace std;
#define ffor(i,o,f) for(int i = o; i < f; i++)
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define PI 3.1415926535897932384... |
// abc188F.cpp
#include <iostream>
#include <vector>
#include <map>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
ll x;
map<ll, ll> memo;
ll f(ll y) {
if (y == 1)return abs(x - y);
if (memo.find(y) != memo.end()) return memo[y];
if (y % 2 == 0) {
return me... | #include<iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <map>
#include<time.h>
using namespace std;
//int N=1;
int P[11] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 };
int binary(int bina) {
int ans = 0;
for (int i = 0; bina > 0; i++)
{
//ans = ans + (bina % 2) * pow(10, i);
bina = bina / ... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fop(i, n) for(int i=0; i<n; ++i)
#define bgen(i) i.begin(),i.end()
void chmin(int& a, int& b){if(a > b)a = b;}
void chmax(int& a, int& b){if(a < b)a = b;}
ll xcy(int i){
ll ic = 1;
fop(j, 5) ic *= i-j;
return ic/120;
}
int main() {
in... |
// C++ implementation to find nCr
#include <bits/stdc++.h>
using namespace std;
// Function to find the nCr
long long printNcR(long long n, long long r)
{
// p holds the value of n*(n-1)*(n-2)...,
// k holds the value of r*(r-1)...
long long p = 1, k = 1;
// C(n, r) == C(n, n-r),
// choosing the smaller value
... |
#include <algorithm>
#include <iostream>
#include <climits>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <set>
#include <map>
using namespace std;
// ------------------------------------------------
template <typename T> istream &operator>>
(ist... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007;
//constexpr long long MOD = 998244353;
constexpr long long INF = 1000000000 + 100;
constexpr long long LINF = 1000000000000000000 + 100;
#define wh... |
#include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long long tmp; scanf("%llu", &tmp);
__int128 N = tmp;
__int128 i = 5; char j = 1;
for (; N >= i + 3; i *= 5, ++j) {
__int128 t = N - i;
char k = 0;
while (t > 0 && t % 3 == 0)
t /= 3, ++k;
if (t == 1) {
printf("%d %d\n", k, j);
re... | #include<bits/stdc++.h>
#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)
#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)
#define foreach(i, n) for(auto &i:(n))
#define all(x) (x).begin(),... |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define V vector<long long>
#define VV vector<vector<long long>>
#define VVV vector<vector<vector<long long>>>
#define P pair<ll,ll>
#define rep(i,n) for(ll (i)=0;(i)<(n);++(i))
#define per(i,n) for(ll (i)=(n)-1;(i)>=0;--(i))
#ifdef LOCAL
#define debu... | /**
* author: tomo0608
* created: 27.02.2021 21:01:58
**/
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
typedef pair<int,int> pii;
typedef pair<long long, l... |
/** Fucc :/
- doanphuc : /
** author: doanphuc. **
**/
#include <bits/stdc++.h>
#define TASK ""
#define inpf freopen(TASK".inp", "r", stdin)
#define outf freopen(TASK".out", "w", stdout)
#define FOR(i,x,y) for(int i = x; i <= y ; i ++)
#define FORT(i,x,y) for(int i = x; i < y ; i ++)
#define FORD(i,x,y) for(int i = x... | //AUTHOR: RAVAN_2070
//PUNE INSTITUTE OF COMPUTER TECHNOLOGY
/*
I ♥ CLARICE STARLING...
EXPLAINATION BELOW->
*/
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull... |
/* dont stick to an approach */
#include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <algorithm>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#include <numeric>
#include <cstdlib>
typedef long long ll;
typedef u... | #include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
char s[N];
int main()
{
int n,q;
cin>>n;
scanf("%s",s+1);
cin>>q;
int t,a,b,now=0;
while(q--)
{
cin>>t>>a>>b;
if(t==2)
now++;
else
{
if(now&1)
{
if(a<=n) a+=n;
else a-=n;
if(b<=n) b+=n;
else b-=n;
}
swap(s[a],... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define all(x) (x).begin(), (x).end()
#define uniq(v) (v).erase(unique(all(v)), (v).en... | #include<bits/stdc++.h>
using namespace std;
#define int long long
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout << setprecision(6) << fixed;
string s;
cin >> s;
for(char x : s)
{
if(x == '.')
break;
cout << x;
}
cout << endl;
return 0;
} |
#include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
#include <list>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <tuple>
#include <deque>
#include <complex>... | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; 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\n", x)
#define c... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int q;q=1;
while(q--)
{
int a,b,x,y;cin>>a>>b>>x>>y;
if(a>=b)
{
if(a==b)
cout<<x;
else
{
if(2*x>=y)
... | #include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358979323846264338327950L
int A = 0, B = 1;
int a, b, x, y;
vector<vector<int >> dp;
queue<pair<int, int>> que;
int solver(int ab, int floor) {
if (dp[ab][floor] > 0) {
return dp[ab][floor];
}
if (floor < a) {
return 0;
}
int ret;
if (a... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define cs const
#define fr first
#define se second
#define ls (now<<1)
#define rs (now<<1|1)
#define mid ((l+r)>>1)
#define mp make_pair
#define pb push_back
#define ppb pop_back
#define low(i) (i&(-i))
#define par pair<int,int>
... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int pri[maxn], t;
bool vis[maxn];
int yue[maxn];
int last[maxn];
void pre() {
memset(vis, 0, sizeof(vis));
t = 0;
yue[1] = 1;
last[1] = 0;
for (int i = 2; i < maxn; i++) {
if (!vis[i]) {
pri[t++] = i;
... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin>>n;
cout<<(1<<n)-1<<endl;
for(int i=1;i<1<<n;i++){
for(int j=0;j<1<<n;j++){
if(__builtin_popcount(j&i)&1) cout<<'B';
else cout<<'A';
}
cout<<endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#d... |
#include <bits/stdc++.h>
using namespace std;
#define int int64_t
#define rep(i, a, b) for(int i = a; i < b; ++i)
int debug = 1;
const int N = 5100, mod = 998244353;
int n, m, a[N], dp[20][N], C[N][N];
void calc_c() {
rep(i, 0, n + 1) {
rep(j, 0, i + 1) {
if (j == 0) C[i][j] = 1;
... | #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>
#define N 20005
using namespace std;
const int inf=0x3f3f3f3f,mod=998244353;
inline int read() {
int s=0,f=0;
char ch=getchar();
while(ch<48||ch>57)f=(... |
#include <bits/stdc++.h>
#define ri register int
#define fi first
#define se second
#define pb push_back
#define ppp pop_back
#define rez resize
using namespace std;
typedef unsigned int uit;
typedef long long ll;
typedef vector <int> poly;
typedef pair <ll, int> pli;
typedef pair <int, ll> pil;
typedef pair <ll, ll> p... | #include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
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) { ... |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
using ll=long long;
using P = pair<int,int>;
int main(){
string s;
cin >> s;
ll c[10]={0};
ll answer=0;
ll one = (ll)s[0]-48;
ll two =(ll)s[1]-48;
ll three =(ll)s[2]-48;
if(s.size()==1){
if(one%8==... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
// g++ -std=c++17 -Wshadow -Wall -g -fsanitize=address -fsanitize=undefined -D_GLIBCXX_DEBUG -o
int main(){
string s;
cin>>s;
map<int,int>d;
int n=s.length();
for(int i=0;i<n;i++){
d[s[i]-'0']++;
}
if(n==1)cout<<(s=="... |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
#define rep(i,x,y) for(ll i=(x);i<(y);i++)
#define rrep(i,x,y) for(ll i=(ll)(y)-1;i>=(x);i--)
#define all(x) (x).begin(),(x).end()
#define itrout(x) for(int i=0;i<x.size();i++) {cout << x[i] << (i==x.size()-1 ? "\n" : " ");}
#ifdef LOCAL
#define de... | #include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
return (int)c - (int)zero_num;
}
signed ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int a,b,c,d,m,n;
cin>>a>>b>>c>>d;
m=max(a,b);
n=min(c,d);
cout<<m-n<<"\n";
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
vector<ll> v;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
ll n,m,i,j,k,a,b,c,t,q,sum = 0,cnt = 0,maxn = 0,ans = 0;
cin>>n>>a>>b>>c;
a*=n;
b*=n;
if(a<=c&&c<=b)cout<<"No";
else cout<<"Yes";
} |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 4000000000000000000 //オーバーフローに注意
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 200005
typedef vector<ll> V;
typedef vector<V> MATRIX;
struct Info{
l... | #include<bits/stdc++.h>
using namespace std;
using ll=int64_t;
using pll=pair<ll,ll>;
struct OP{
pll o={0,0},ex={1,0},ey={0,1};
};
pll operator+(pll a,pll b){return{a.first+b.first,a.second+b.second};}
pll operator-(pll a,pll b){return{a.first-b.first,a.second-b.second};}
pll operator*(pll a,ll b){return {a.first*... |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main()
{
ll n,w;
cin>>n>>w;
cout<<n/w<<endl;
}
/*
8888888888888888888888888888
Md. Masud Mazumder
University of Chittagong
Department of CSE
8888888888888888888888888888
*/
| #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#i... |
#include <iostream>
#include <string>
#include<math.h>
#include<vector>
#include<algorithm>
using ll = long long;
using namespace std;
int main(void) {
ll n, k; cin >> n >> k;
ll ans=0;
ll before=0;
vector<vector<ll>> a(n,vector<ll>(2)); for (int i = 0; i < n; i++) cin >> a[i][0]>>a[i][1];
sort(a.begin(), a.end()... | #include<iostream>
#include<cstring>
#include<algorithm>
#define int long long
using namespace std;
int a[101];
int g1(int x)
{
if(x==0)return 0;
int cnt=0;
while(x)
{
a[++cnt]=x%10;
x/=10;
}
sort(a+1,a+1+cnt);
int ans=0;
for(int i=cnt;i>=1;i--)
{
ans*=10;
ans+=a[i];
}
return ans;
}
int g2(int x)
... |
#include <bits/stdc++.h>
using namespace std;
//const long nPrime = 1000000007;
//const long nPrime = 998244353;
int main() {
int n,m;
cin >> n >> m;
vector<vector<pair<int,int>>> vviiNum(n);
for(int i = 0; i < m; i++){
int x,y,z;
cin >> x >> y >> z;
x--, y--;
vviiNum[x].... | #include<bits/stdc++.h>
#define f(i,n) for(long long int i = 0 ; i < n; i++)
#define F first
#define S second
#define vll vector<ll>
#define vvll vector<vector<ll>>
#define all(s) s.begin(), s.end()
#define u_s unordered_set
#define u_m unordered_map
#define ll long long int
#define pb push_back
#define pll pair<ll,ll... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int nax=1e5+100;
struct node
{
int n,ok;
vector<int> par;
node(int n):n(n),par(n,-1),ok(n){}
bool merge(int x,int y)
{
x=find(x);
y=find(y);
if(x==y)
return 0;
if(par[x]>par[y])
... | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long double LD;
typedef pair<LL,LL> pii;
typedef pair<LL,pii> ppi;
typedef pair<pii,pii> ppp;
#define FOR(i, n) for(int i = 1; i<=n; i++)
#define F0R(i, n) for(int i = 0; i<n; i++)
#define mp make_pair
#define pb push_back
#define f first
#defin... |
// I SELL YOU...!
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<chrono>
#include<iomanip>
#include<map>
#include<set>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using TP = tuple<ll,ll,ll>;
void init_io(){
cin.tie(0);
ios::sync_with_stdi... | #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 <iostream>
using namespace std;
using ll=long long;
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main(){
ll MOD=1000000000+7;
ll N,P;cin>>N... | //ll __(){
// _(int,n);
// _(string,s);
// _(string,t);
// vi a,b;
// rep(i,n){
// if(s[i] == '1')
// a.pb(i);
// if(t[i] == '1')
// b.pb(i);
// }
// vi erase;
// ll ans = 0;
// int l = 0;
// rep(i,sz(a)){
// if(l < sz(b) && a[i] >= b[l]){
// ... |
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
#define rep(i,j,k) for(int i=j;i<k;i+=1)
#define rrep(i,j,k) for(int i=n-1;i>=0;i-=1)
#define sorti(v) sort(v.begin(),v.end())
#define sortd(v) sort(v.begin(),v.end(),greater<int>())
#define mm map<int,int>
#define vv vector<int>
#def... | # include <bits/stdc++.h>
#include <cmath>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;
typedef pair <pii, int> ... |
// lcmとか__builtin_popcountとかはg++ -std=c++17 default.cppみたいなかんじで str[0]=toupper(str[0]);
// g++ hoge.cpp -std=c++17 -I . でコンパイルできる
// -fsanitize=undefinedでオーバーフロー検出
#include <bits/stdc++.h>
//#include <atcoder/all>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define endl '\n'
#define ln cout<<endl
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
char s[4];
cin >> s;
// cout << s << endl;
char temp;
temp = s[0];
s[0] = s[1];
s[1] = s[2];
s[2] = temp;
cout << s << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define FastIO() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define read() freopen("... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=n... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0; i<(int)(n); i++)
int main(){
int N, ans=0; cin >> N; int A[N];
REP(i, N){ cin >> A[i]; A[i]=A[i]%200; }
int M=min(8, N), R[200]={};
vector<int> X={}, Y={};
REP(i, 1<<M){
if(i==0){ continue; }
int k=i, d=0, n=0; Y={};
while(k){
if(k%2==1)... | #include<bits/stdc++.h>
#include<string>
using namespace std;
#define ll long long int
#define ld long double
#define pb push_back
#define all(v) v.begin(),v.end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
#define deb(x) cout<< #x << '=' << x <<endl
#define MOD 1000000007
ll p(ll a , ll n){
... |
#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;
///Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
#de... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main(){
int n;
cin >> n;
int a[n];
rep(i,n) cin >>a[i];
int max=0;
int ans=0;
for(int i=2;i<1000;i++){
int cnt =0;
for(int j=0;j<n;j++){
... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define forn(i,a,n) for (int i=a; i<n; i++)
int n;
int a[200005],b[200005],c[200005];
int suma,sumb;
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
cin>>n;
forn(i... | #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;
// using ordered_set = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
void __dbg() { cout << endl; }
template<typename Arg, ... |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
int main(){
int N;
cin >> N;
vector<int> W(N);
for (int i = 0; i < N; i++){
cin >> W[i];
}
int S = 0;
for (int i = 0; i < N; i++){
S += W[i];
}
if (S % 2 == 1){
cout << 0 << endl;
} else {
vector<vector<lo... | #include<bits/stdc++.h>
template <typename _Tp>void read(_Tp &x){
char ch(getchar());bool f(false);while(!isdigit(ch))f|=ch==45,ch=getchar();
x=ch&15,ch=getchar();while(isdigit(ch))x=x*10+(ch&15),ch=getchar();
if(f)x=-x;
}
template <typename _Tp,typename... Args>void read(_Tp &t,Args &...args){read(t);read(args...);... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <cmath>
#include <queue>
#include <string>
#include <utility>
#include <functional>
using namespace std;
using ll = long long int;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
int main(){
int N;
cin >> N;
for(int ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
for (int i = 0; i < n; i++) {
cout << (2*i)%n + 1 << " " << (2*i+1)%n + 1 << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
const ll LL_MAX=LLONG_MAX;
struct In{
template<typename T>
operator T(){
T x;
cin >> x;
return x;
}
};
In in;
template <typename T,typename U>
void forin(T* x,U n){
for (U i=0;i<n;i++) cin >>... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#define fast ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define int long long
#define endl "\n"
#define yn(b) cout << &("NO\n\0YES\n"[4*b]);
#define show(a) ... |
#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <numeric>
#include <ut... | #include <bits/stdc++.h>
#define ll long long
#define sc scanf
#define pr printf
using namespace std;
const int N = 100010, M = 1 << 13;
const double eps = 1e-10;
ll n, m;
//int w[N], d[N], b[N];
//double x[N], y[N];
//char s[N];
ll powMOD(ll a, ll b, ll MOD) {
ll res = 1;
while (b) {
if (b & 1) res = res * ... |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <random>
#include <math.h>
#include <stdi... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
LL N, fib[100];
vector<int> ans;
int vis[100];
void print() {
LL x = 0, y = 0;
for (int i : ans) {
if (i == 1) x++;
if (i == 2) y++;
if (i == 3) x = x + y;
if (i == 4) y = x + y;
}
cerr << x << endl;
}
in... |
#include<bits/stdc++.h>
#define LL long long
#define dl double
#define P pair<int,int>
#define SZ(a) ((int)a.size())
using namespace std;
const int N = 4e5 + 10;
int n,a[N],id[N];
bool cmp(const int &x,const int &y){return a[x] < a[y];}
bool c[N];
int main(){
// freopen("in.txt","r",stdin);
// freopen("o.txt","w... | #include<iostream>
#include<algorithm>
using namespace std;
int N;
pair<int,int>A[4<<17];
bool lo[4<<17];
main()
{
cin>>N;
for(int i=0;i<2*N;i++)
{
cin>>A[i].first;
A[i].second=i;
}
sort(A,A+2*N);
for(int i=0;i<N;i++)lo[A[i].second]=true;
string ans="";
int now=0;
bool up;
for(int i=0;i<2*N;i++)
{
if(n... |
#include<bits/stdc++.h>
#include<math.h>
using namespace std;
/*------------------------------------------------------------------*/
#define ll long long int
#define mp make_pair
#define pb push_back
#define MOD 998244353
bool isvowel(char c)
{
if(c=='a'||c=='e'||c=='i'||c=='o'||c=='u')
return true;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int h,w,x,y;
char s[110][110];
cin >> h >> w >> y >> x;
int count = 1;
for(int i = 1; i <= h; i++){
for(int j = 1; j <= w;j++){
cin >> s[i][j];//問題文の通りに入力されてる
}
}
for(int i = y;i >= 1;i--){ //同じ列でy~0まで調べる
... |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
vector<pair<T, int>> prime_factor(T num) {
vector<pair<T, int>> ret;
for(T i=2; i*i<=num; ++i) {
int cnt = 0;
while(num%i == 0) {
num /= i;
++cnt;
}
if(cnt != 0) ret.emplace_back(i, cnt);
}
if(num != 1) ret.emplace_b... | #include<bits/stdc++.h>
using namespace std;
#define N 2005
#define mod 998244353
#define LL long long
int n, a_min, i, a[N], j, ans;
vector<int> vec;
unordered_set<int> Ans;
map<int,int> A, ext;
int main (void)
{
scanf("%d",&n);
a_min=-1;
for (i=1; i<=n; i++) {
scanf("%d",&a[i]);
if (a_min==-1) a_min=a[i];
... |
#include <iostream>
#include <map>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <math.h>
#include <string>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(n) for( int i = 0 ; i < n ; i++ )
#define REP(n) for( int i = 1 ; i <= n ; ... | #include <stdio.h>
int main(void)
{
int n, w, i;
int count = 0;
scanf("%d %d", &n, &w);
for (i = n - w; i >= 0; i -= w)
count++;
printf("%d\n", count);
return 0;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.