code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <bits/stdc++.h>
typedef long long i64;
#define sz(a) int((a).size())
#define all(a) (a).begin(), (a).end()
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define per(i, a, b) for (int i = (b) - 1; i >= (a); --i)
using namespace std;
int main() {
// freopen("#.in", "r", stdin); // @
ios::sync_with_st... | #include <bits/stdc++.h>
using namespace std;
unordered_map <long long, int> mp;
int main() {
int n; scanf("%d", &n);
long long sum = 0, ans = 0;
mp[0] = 1;
for (int i = 0; i < n; ++i) {
int x; scanf("%d", &x);
if (i & 1)
sum -= x;
else
sum += x;
ans += mp[sum]++;
}
printf("%lld\n", ans);
return ... |
#include <bits/stdc++.h>
#define int long long
using namespace std;
int32_t main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int N;
cin >> N;
for(int i = 3, c1 = 1 ; i <= 1e18 ; i*=3, c1++)
{
for(int j = 5, c2 = 1 ; j <= 1e18 ; j*=5, c2++)
{
if(i+j == N)
{
... | #include"bits/stdc++.h"
using namespace std;
using ll=long long;
template<class T=long long>inline T in(istream&is=cin){T ret;is>>ret;return ret;}
template<class T,class Size=typename vector<T>::size_type>inline auto vector_2d(Size h,Size w,T v){return vector<vector<T>>(h,vector<T>(w,v));}
template<class T>auto comp_pa... |
/*
* Author: JophieQu
* Date: 06/06/21 19:53
* Welcome to follow my sister's CODEFORCES account:@Cccc23333
*/
#include<bits/stdc++.h>
#define ll long long
#define endl '\n'
const int N=2e3+7;
const int mod=1e9+7;
using namespace std;
ll ans=0;
vector<ll>e[N+1];
int vis[N];
void dfs(int ii,int fa,int f){
if(ii==fa&&f) ... | #include <bits/stdc++.h>
#include <cassert>
#define rep(i, N) for (int i = 0; i < (N); ++i)
#define rep2(i, a, b) for (ll i = a; i <= b; ++i)
#define rep3(i, a, b) for (ll i = a; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define nl '\n'
#define endl '\n'
#define all(c)... |
#include <bits/stdc++.h>
int n;
long long x;
long long a[100];
long long b[100];
long long dp[100][2];
// dp[i]最低i位的方案数字
// dp[i][0]: 不借位的方案数
// dp[i][1]: 借位的方案数
int main() {
scanf("%d%lld", &n, &x);
for (int i = 1; i <= n; ++i) {
scanf("%lld", &a[i]);
}
long long tmp = x;
for (int i = n; i >= 1; --i) ... | #include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
#include<utility>
using namespace std;
#define int long long
#define endl "\n"
constexpr long long INF = (long long)1e18;
constexpr long long MOD = 1'000'000'007;
struct fast_io {
fast_io(){
std::cin.tie(n... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(40)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
ll A[300005];
template<typename T>
struct Segmen... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define FASTINOUT ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const int N=3e5+9;
ll a[N],tree[4*N];
void build(int node, int start, int end)
{
if (start == end)
{
tree[node] = a[start];
}
els... |
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<long long> ans;
int a, b;
cin >> a >> b;
if (a == b){
for (int i = 1; i <= a; i++){
ans.push_back(i);
ans.push_back(-i);
}
}else if (a > b){
for (int i = 1; i <= a; i++){
ans.push_back(i);
... | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP2(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; ++i)
#define REP3(i, l, r) for (int i = (l), i##_len = (int)(r); i < i##_len; ++i)
#define GET_MACRO_REP(_1, _2, _3, NAME, ...) NAME
#define REP(...) GET_MACRO_... |
// #include <atcoder/all>
#include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define FORR(i, n) for(ll i = (ll)n - 1LL; i >= 0LL; i--)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using ll = long long;
constexpr ll Mod = 998244353;
constexpr ll mod = 1... | #include <bits/stdc++.h>
using namespace std;
void fail(){
cout << "No" << endl;
exit(0);
}
int main(){
int N;
cin >> N;
vector<int> A(N), B(N);
vector<pair<int, int>> p2n(2*N+1, {-1, -1});
for(int i=0; i<N; i++){
cin >> A[i] >> B[i];
if(A[i] != -1 && B[i] != -1 && A[i] >= ... |
#pragma GCC target ("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define S 600020
struct dinic {
struct edge {int b, cap, flow, flip;};
vector<edge> g[S+2];
int ans=0, d[S+2], ptr[S+2];
v... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl '\n'
#define pb push_back
#define pob pop_back
#define pii pair<int,int>
// int mod = 3;
#define mod 1000000007
// #define mod 1000000009
// #define mod 163577857
// #define mod 998244353
#define rep(i,n) for (int... |
#include<bits/stdc++.h>
#include<cmath>
#define SZ(x) ((int)x.size())
#include<vector>
#include<set>
#include<map>
#define ll long long
#define lli long long int
#define REP(i,a,b) for(ll i=a;i<b;i++)
#define pb push_back
#include<string>
#include<cctype>
#define F first
#define rep(i,a,b) for(int i=a;i<b;i++)
#defi... | #include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
int h,w;
long long int dp[2001][2001];
char board[2001][2001];
long long int up[2001];
long long int diag[2001];
int main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
cin >> h >> w;
for(int i=1;i<=h;i++)
{
... |
#include<bits/stdc++.h>
typedef double D;
typedef long long int LL;
typedef long double LD;
#define OR ||
#define AND &&
#define nl '\n'
#define S string
#define inf INT_MAX
#define SQR(a) (a) * (a)
#define pb push_back... | #include <bits/stdc++.h>
using namespace std;
std::chrono::high_resolution_clock::time_point start_time = std::chrono::high_resolution_clock::now();
//*******************************************Defines***************************************************************************
#define all(x) (x).begin(),(x).end() ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define INF 1000000007
#define llINF 1000000000000000007
#define v(i) vector<i>
#define vv(i) vector<vector<i>>
// int num = atoi(string.c_str()); 文字列の整数変換
int keta(ll n){int ans=0;while(n>0){n /= 10; a... | #include<bits/stdc++.h>
#include <iterator>
#include <iostream>
#include <numeric>
#include <math.h>
#define ll long long
#define ull long
#define mpa make_pair
#define pb push_back
#define ff first
#define pii pair<ll,ll>
#define dd double
#define trace(x) cerr << #x << " : " << x << endl
#define ss second
#define boo... |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#define Ma7moud_7amdy \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define Open_Sesame Open()
#define all(v) ((v).begin()), ((v).end())
#define allr(v) ((v).rbegin()), ((v).rend(... |
#line 1 "main.cpp"
/**
* @title Template
*/
#include <iostream>
#include <algorithm>
#include <utility>
#include <numeric>
#include <vector>
#include <array>
#include <cassert>
#include <stack>
#line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/chmin_chmax.cpp"
template <class T, class U>
constexpr ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n;
string s, t;
set<int> have;
int nxt(int idx)
{
auto it = have.upper_bound(idx);
if(it == have.end()){
cout<<-1<<'\n';
exit(0);
}
int res = *it;
have.erase(it);
s[res] = '0';
return res;
}
void solve()
{
int a = 0, b = 0;
for(int ... |
#include<bits/stdc++.h>
using namespace std;
template<typename T>inline T read(){
T f=0,x=0;char c=getchar();
while(!isdigit(c)) f=c=='-',c=getchar();
while(isdigit(c)) x=x*10+c-48,c=getchar();
return f?-x:x;
}
#define int long long
namespace run{
const int N=4e5+9;
int head[N],nex[N],to[N],cnt;
inline void add(... | #include<bits/stdc++.h>
#define ll int64_t
#define pp pair<int,int>
#define ppn pair<pp,int>
#define F first
#define S second
#define N 1000005
#define mod 1000000007
#define pi 3.14159265358979323846
using namespace std;
vector<int>graph[N];
int vis[N], vis1[N];
ll a[N],b[N], n, m;
void dfs(int s, int r)
{
vis... |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long n,l,r,mid;
scanf("%lld",&n),l=1,r=n;
while(l<r){
mid=(l+r+1)>>1;
if(mid+1<=((n+1)<<1)/mid)l=mid;
else r=mid-1;
}printf("%lld\n",n+1-r);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define For(i,a,b) for(int (i) = (a);(i) < (b);i++)
#define Rep(i,n) For((i),0,(n))
#define All(a) (a).begin(),(a).end()
#define sp " "
#define INF 1e18
#define INT_INF 1e9
typedef long long ll;
const ll MOD = 1000000007;
const ll MOD_9 = 998244353;
vector<char> boin = {... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
#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) c.begin(),c.end()
#define si(x) ... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using ld = long double;
const int INF = (INT_MAX >> 1);
const ll LLINF = (LLONG_MAX >> 1);
#define all(x) x.begin(), x.end()
#define rep(i, s, e) for(ll i = s; i < e; ++i)
#define repr(i, s, e) for(ll i = s; i > e; --i)
temp... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define ... |
// clang-format off
#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;
#ifndef godfather
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,av... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
if(m==0){
cout<<1;
return 0;
}
if(n==m){
cout<<0;
return 0;
}
vector<int> v;
for(int i=0;i<m;i++){
int a;
cin>>a;
v.push_back(a);
}
int gap=1e9;... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
const int inf = 0x3f3f3f3f;
int mod = 1000000007;
bool remend... | //#pragma GCC optimize ("Ofast,unroll-loops")
//#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#include <unistd.h>
#define FAST_IO ios::sync_with_stdio(0);cin.tie(NULL)
#define all(v) (v).begin(),(v).end()
using namespace std;
void __print(int x) {cerr << x;}
vo... |
#include <bits/stdc++.h>
using namespace std;
int main(){
cout << fixed << setprecision(15);
int n;
cin >> n;
vector<int>x(n);
for(int i=0;i<n;i++)cin >> x[i];
long ans1=0;
for(int i=0;i<n;i++)ans1+=abs(x[i]);
cout << ans1 << endl;
long ans2=0;
for(int i=0;i<n;i++)ans2+=a... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long int n,sum=0;
long double sum1=0;
cin>>n;
long long int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
if(a[i]<0)
a[i]=-a[i];
sum=sum+a[i];
sum1=sum1+a[i]*a[i];
}
sort(a,a+n);
cout<<sum<<endl<<setprecision(16)... |
#include <bits/stdc++.h>
#define f first
#define s second
#define MOD 1000000007
#define PMOD 998244353
#define pb(x) push_back(x)
using namespace std;
typedef long long int ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> plii;
typedef pair<int, pii> piii;
const int INF = 1e9+10;
const ll LINF = 1LL*INF*INF;
const ... | #include <bits/stdc++.h>
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define size_t unsigned long long
#define ll long long
#define rep(i, a) for (int i = 0; i < (a); i++)
#define repr(i, a) for (int i = (int)(a)-1; i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#de... |
#include<bits/stdc++.h>
using namespace std;
#define ln "\n"
void solve(int input)
{
int a, b;
cin >> a >> b;
int r = abs(a - b);
if (r <= 2)
{
cout << "Yes";
}
else
cout << "No";
return;
}
signed main()
{
int t = 1;
while (t--)
{
solve(t);
}
return 0;
} | #include<bits/stdc++.h>
#define ll long long int
#define pragi(a,b) for(ll i = a;i<b;i++)
#define pragj(a,b) for(ll j = a;j<b;j++)
#define pragk(a,b) for(ll k = a;k>=b;k--)
#define all(v) (v.begin(),v.end())
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define MP make_pair
#define MT make_tuple... |
#include <bits/stdc++.h>
using namespace std;
const int c=200002;
long long kom[c], a[c], sok=1e16, nagymax=-sok, kismin=sok;
int n, q, t[c];
int main()
{
ios_base::sync_with_stdio(false);
cin >> n;
for (int i=1; i<=n; i++) {
cin >> a[i] >> t[i];
kom[i]=kom[i-1];
if (t[i]==1) {
... | //#define MULTIPLE_TESTS 0
#include "bits/stdc++.h"
#include <ext/numeric>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
template<typename T> using policy_set = tree<T, null_type, less < T>, rb_tree_tag, tree_order_statistics_node_update>;
using ll... |
#include<bits/stdc++.h>
using namespace std;
#define dd double
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define ll long long
#define ull unsigned long long
#define ld long double
#define mx 300005
#define mod 1000000007
#define fr first
#define cti(a) (a-48)
#define itc(a)... | /*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).be... |
#include <bits/stdc++.h>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/rope>
using namespace std;
//usin g namespace __gnu_pbds;
//using namespace __gnu_cxx;
//template<class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
using nam... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using edge = pair<int, int>;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
const int MX = 400000;
int n;
cin >> n;
vector<vector<edge>> g(MX, vector<edge>());
unordered_set<int> co... |
#include <bits/stdc++.h>
using namespace std;
///////////////////////////
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<
long long,
null_type,
less<long long>,// _equal for multiset
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
///////////////////////////
#define int l... | #pragma GCC optimize("O3")
//#pragma GCC target("avx")
#include <bits/stdc++.h>
using namespace std;
#define re return
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define make_unique(x) sort(all(x)),x.resize(unique(all(x))-x.begin())
#define fi first
#define se second
#define ss second.second
#define sf ... |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ll N;
cin>>N;
vector<ll>arr(N,0);
ll maxi=0;
for(ll i=0;i<N;i++)
{
cin>>arr[i];
maxi=max(maxi,arr[i]);
}
ll i=0;
ll j=N-1;
ll ans=0;
vector<ll>mapper(maxi+100,0);
fo... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define pb push_back
int main()
{
ll n,i,j,k;
cin>>n;
ll arr[n];
ll mx=0;
ll temp1=0,temp=0;
for(i=0;i<n;i++)
{
cin>>arr[i];
mx=max(mx,arr[i]);
temp1=temp1+arr[i];
temp=temp1+temp;
co... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<ll> a(n), b(n);
ll first = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i] >> b[i];
first += a[i];
}
vector<int> p(n);
... |
#include <iostream>
#include <iomanip>
#include <cassert>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <vector>
#include <algorithm>
#include <numeric>
#include <unordered_map>
#incl... |
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#ifdef _LOCAL_
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define name(x) #x
#define dump(x) cout << name(x) << " = " << x << endl;
#define rep(i,n) for (int i = 0; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#ifdef _DEBUG
#define show(x) \
cerr << #x << " : "; \
showVal(x)
template <typename T>
void showVal(const T &a) { cerr << a << endl; }
template <typename T>
void showVal(const vector<T> &a) {
for (const T &v : a) cerr << v << " ";
cerr <<... |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
struct BIT{
vector<LL> node;
int size;
BIT(int n){
size=n;
node.resize(size,0);
}
void add(int a,int x){
for(int i=a;i<size;i|=i+1) node[i]+=x;
}
LL sum(int a){
LL res=0;
for(int ... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#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 ll long long
#define REP(i, a, b) for (ll i = a; i < ... |
#include <bits/stdc++.h>
#define ll long long
#define V vector<long long>
#define VV vector<vector<long long>>
#define VVV vector<vector<vector<long long>>>
#define P pair<ll,ll>
#define rep(i,n) for(ll (i)=0;(i)<(n);++(i))
#define per(i,n) for(ll (i)=(n)-1;(i)>=0;--(i))
#define inf 9223372036854775807
#ifdef LOCAL
#de... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repb(i,a,b) for(int i=a;i>b;i--)
#define pb push_back
#define mp make_pair
#define all(A) A.begin(),A.end()
#define allr(A) A.rbegin(),A.rend()
#define precise(i) fixed << setpre... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T,class U> using P = pair<T,U>;
template<class T> using vec = vector<T>;
template<class T> using vvec = vector<vec<T>>;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
// https://ei1333.github.io/luzhiled/
// combination with fermat the... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll one = 1;
const ll INF = 9223372036854775807; //10^18
const int inINF = 2147483647; //10^9
const ll MO... |
#include <bits/stdc++.h>
using namespace std;
// p^q
long long sisu(long long p, long long q){
long long ans = 1;
for (int i=0; i<q; i++){
ans *= p;
}
return ans;
}
//log(p^q)
int hantei(long long p, long long q){
return q*log(p);
}
int main(){
string X_;
long long M;
cin >> X_ >> M;
int S =... | /*
{
######################
# Author #
# Gary #
# 2020 #
######################
*/
//#pragma GCC target ("avx2")
//#pragma GCC optimization ("O3")
//#pragma GCC optimization ("unroll-loops")
#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define rb(a,b,c) for(int a=b;a<=c;++a)
#... |
#include<bits/stdc++.h>
#define pairs pair<int,int>
#define loop(i,a,n) for(int i=a;i<n;i++)
#define m_p make_pair
#define fi first
#define se second
#define pb push_back
#define ll long long
#define all(v) v.begin(),v.end()
using namespace std;
void solve(){
ll a,b,c;
cin>>a>>b>>c;
string ans;
if(c==1){
ans="Ao... | #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;
// #pragma GCC optimize("O2")
typedef long long int ll;
typedef long double ld;
typedef map <ll,ll> mm;
typedef vector <ll> mv;
typedef pair <ll,ll> mp;
typedef set <l... |
#include<bits/stdc++.h>
using namespace std;
int main(){
char a , b , c;
cin>> a >> b >> c;
if( a==b and b==c ){
cout<<"Won";
}
else{
cout<<"Lost";
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define V vector
#define vcin(v) rep(i, v.size()) cin >> v[i]
int main(){
string s;
cin >>s;
puts(s[0]==s[1]&&s[0]==s[2]?"Won":"Lost");
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef pair<int,int> Pair;
typedef tuple<int,int,int> tpl;
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c... | #include <iostream>
#include <algorithm>
#include <string.h>
using namespace std;
int n;
int main()
{
cin>>n;
for(int i=0;i<n;i++)
cout<<(2*i)%n+1<<' '<<(2*i+1)%n+1<<endl;
return 0;
} |
#include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int k, n, m;
cin >> k >> n >> m;
int a[k], b[k];
vector<pair<int,int>> v;
int rem = m;
for (int i = 0; i < k; i++) {
cin >> a[i];
b[i] = (m*a[i... | /**
template for testing/using the algorithms
import(copy-paste the methods ;v) algorithm/s and use here
**/
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
///------------------- algorithm function/s to be placed here start -------------------///
string s[3];
unsigned long long N[3][10+5... |
//Littleboy123 Template 1.8
#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;
//pragmas
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
... | #include <bits/stdc++.h>
#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))
#ifdef LOCAL
#define log(val) std::cerr << std::setw(3) << __LINE__ << "| " << #val << " = " << (val) << std::endl
#define dbg(proc) proc
#else
#de... |
#include <bits/stdc++.h>
#define mk make_pair
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
const int N=1000010;
int pr[N];
void sev(){
pr[1]=1;
for(int i=2; i<N; ++i){
if(pr[i])
continue;
for(int j=i; j<N; j+=i){
pr[j]=i;
}
}
}
int m... | #include <bits/stdc++.h>
using namespace std;
signed main(){
int A, B, i, ans = 0;
scanf("%d%d", &A, &B);
for(i = 1; i <= B; i++){
if(i * ((A + i - 1) / i) < i * (B / i)){
ans = i;
}
}
printf("%d\n", ans);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector< ll > vi;
typedef pair< ll, ll > pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for(ll i = a; i <= b; i++)
#define nl "\n"
const int MAX_N = 1e5 + 1;
co... | #pragma region Template // clang-format off
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i, m, n) for (int i = m; i < (int)(n); i++)
#define repe(i, m, n) for (int i = m; i <= (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#... |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<iomanip>
using namespace std;
int main(){
int N;
cin >> N;
vector<pair<int, int>> S(0), T(0);
int a, b, c, d;
for(int i = 0; i < N; i++){
cin >> a >> b;
a *= N;
b *= N;
... | #include <iostream>
#include <array>
#include <algorithm>
#include <vector>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define reps(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define prl(a) cout << (a) << endl
#define allrange(a) a.begin(),a.end()
bool solve_translated(vector<pair<i... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i,a,b) for(int i=a;i<=b;i++)
inline ll rd() {
ll x=0,f=1;
char c=getchar();
while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return x*f;
}
#define d rd()
ll n;
struct node{
ll x,y,sum;
}a[200010];... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long long
#define ll long long
#define F(type, i, a, b, incr) for (type i = a; i <= (type)(b); i += (type)(incr))
#define RF(type, i, a, b, decr) for (type i = a; i >= (type)(b); i -= (type)(decr))
#define sz(a) sizeof(a)
#define deb(a) cerr ... |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>
using ... | #define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
// 解説を見て
int main(void) {
string x;
cin >> x;
ll m;
cin >> m;
if (x.size() == 1) {
if (stoi(x) <... |
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using db = double;
using ld = long double;
template<typename T> using... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define pll pair<long long,long long>
#define pdd pair<long double,long double>
#define vll vector<ll>
#define rep(i,j,n) for(int i=j;i<n;i++)
#define mp make_pair
#define pb push_back
#define pf push_front
#define inf 1e17
#defin... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int x;
cin >> x;
if(x >= 0) cout << x << endl;
else cout << "0" << endl;
return 0;
} | #include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using namespace __gnu_pbds;
//using namespace boost::multiprecision;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
typedef l... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < (int)(b); i++)
#define all(v) v.begin(), v.end()
const int MOD = 1e9 + 7;
const int INF = 1e9;
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
class UnionFind {
public:
vector<int> par;
int num;
UnionFin... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a, i##end = b; i <= i##end; ++i)
#define per(i, a, b) for (int i = a, i##end = b; i >= i##end; --i)
#define rep0(i, a) for (int i = 0, i##end = a; i < i##end; ++i)
#define per0(i, a) for (int i = (int)a-1; ~i; --i)
#define chkmax(a, b) a = std::max(a, b)
#defi... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mod 1000000007
#define pb push_back
#define ff first
#define ss second
typedef pair<int,int> pp;
bool com(pp x,pp y){
if(x.ff==y.ff) return x.ss<y.ss;
return x.ff<y.ff;
}
ll power(ll x,ll y){
ll prod=1;
while(y){
if(y... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define vll vector<ll>
#define pll pair<ll,ll>
#define vpll vector<pll>
#define ub upper_bound
#define lb lower_bound
#define all(v) ((v).begin()),((v).end())
#define allr(v) ((v).rbegin()),((v).rend())
#define... |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <set>
#define IN
#define LL long long
#define P(t1) ((t1 - 1) / blk + 1)
using namespace std;
const int MAXN = 2e3 + 5;
int T;
LL A, B, C;
int main() {
int i,j,k;
scanf ("%d", &T);
while (T--) {
scanf ("%lld%lld", &A, &B), C = max (B - 2ll * A +... | #include <bits/stdc++.h>
#pragma region my_template
struct Rep {
struct I {
int i;
void operator++() { ++i; }
int operator*() const { return i; }
bool operator!=(I o) const { return i < *o; }
};
const int l_, r_;
Rep(int l, int r) : l_(l), r_(r) {}
Rep(int n) : Rep(0, n) {}
I begin() const... |
#include <bits/stdc++.h>
#include <math.h>
#define ALL(a) a.begin(), a.end()
#define rep(i, K, N) for(long long int i = K; i < N; i++)
#define ll long long int
#define PP 1000000007
using namespace std;
int main(){
string S;cin >> S;
ll N = S.size();
bool C;
map<char, ll> M;
vector<ll> V(124, -1);
if(1 == N)V[0] ... | #include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
string S;
cin >> S;
map<char, int> digits;
for (int i = 0; i < S.length(); i++) {
digits[S[i]]++;... |
#include<bits/stdc++.h>
using namespace std;
struct fastio{fastio(){cin.tie(nullptr);ios_base::sync_with_stdio(false);std::cout<<std::fixed<<setprecision(10);}}oitsaf;
#define rep(i,n) for(int i=0;i<int(n);++i)
template<class T>std::vector<T>vec(size_t a){return std::vector<T>(a);}
template<class T, class... Ts>auto v... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll g[20][20];
ll a[20],n,k,res;
bool vis[20];
void dfs(int t)
{
if(t > n)
{
int ans = 0;
for(int i = 2;i <= n;i++)
{
ans += g[a[i-1]][a[i]];
}
ans += g[a[n]][1];
if(ans == k) res++;
}
else{
for(ll i = 2;i <= n;i++)
{
if(!vis[i... |
#include <bits/stdc++.h>
using namespace std;
using s64 = signed long long;
using u64 = unsigned long long;
using f128 = long double;
#define LOGVAR(var) cout << #var << ": " << var << endl
int main()
{
vector<s64> a(3);
cin >> a[0] >> a[1] >> a[2];
sort(a.begin(), a.end());
if(a[2] - a[1] == a[1] -... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define mp ... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> v(n);
for(int i=0;i<n;i++){
cin>>v[i];
}
stack<pair<int,int>> st;
st.push({v[0],0});
vector<int> right(n,-1);
vector<int> left(n,-1);
for(int i=1;i<n;i++){
while(!st.empty() && st.... | #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> P;
int cnt[10];
int calc_points(string s)
{
//cout << "b";
int res = 0;
vector<int> c(10,0);
rep(i,5)
{
c[s[i]-'0']++;
}
for (int i = 1; i <= 9; ++i)
{
int t = i;
rep(j,c[... |
#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;
using Graph = vector<vector<int>>;
#define rep(i, a, N) for (int i = (a); i< N; i++)
typedef pair<int, int> pii;
int N;
int main() {
cin >> N;
vector<int> a(N);
vector<int> b(N);
vector<int> c(N);
int cnt[100001];
memset(cnt, 0, sizeof(cnt));
... |
#include<bits/stdc++.h>
using namespace std;
const int MAXN=505;
int n,p[MAXN];
int opt[MAXN*MAXN],m;
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch))(ch=='-')&&(f=-f),ch=getchar();
while(isdigit(ch)) x=x*10+ch-'0',ch=getchar();
return x*f;
}
inline int find(int x){
for(int i=1;;++i) if(p[... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
template<typename T1,typename T2> bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;}
template<typename T1,typename T2> bool chmax(T1 &a,T2 b){if(a>=b)return 0; a=b; return 1;}
int dx[4]={0,1,0,-1}, dy[4]={1,0,... |
#include <iostream>
#include <bits/stdc++.h>
#include <vector>
#include <set>
#include <math.h>
#include <string.h>
#include <cstdlib>
#include <sstream>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <fstream>
typedef long long ll;
#define INF 10000000;
using na... | #include<bits/stdc++.h>
#define rep(i, m, n) for(int i = m; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
int main() {
ll n, k;
cin >> n >> k;
vector<pair<ll, ll>> ab(n);
rep(i, 0, n) cin >> ab[i].first >> ab[i].second;
sort(ab.begin(), ab.end());
rep(i, 1... |
#include <bits/stdc++.h>
using namespace std;
int _ = (cout << fixed << setprecision(9), cin.tie(0), ios::sync_with_stdio(0));
using Int = long long;
void solve(int N, string S, vector<int> A) {
int k = 1e9;
for (int i = 0; i < N; i++) {
k = min(k, abs(A[i + 1] - A[i]));
}
vector<vector<int>> B(... | #include<iostream>
#include<cstring>
#include<algorithm>
#include<unordered_map>
using namespace std;
typedef long long LL;
const int N=2e5+10;
int a[N];
int main(){
int n,m;
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++){
scanf("%d",&a[i]);
}
a[++m]=0;
a[++m]=n+1;
sort(a+1,a+1+m);
int minv=n;
for(int i=1;i<=m-1... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i=a; i<=b; i++)
#define repd(i, a, b) for(int i=a; i>=b; i--)
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define fr first
#define sc second
#define vb... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
using namespace std;
int main(){
int a,b;
cin >> a;
if(a%100 == 0) b = a/100;
else b = (a+100)/100;
cout << b << endl;
} | #include<cstdio>
#include<iostream>
using namespace std;
int main(){
int x;
scanf("%d", &x);
printf("%d", (x+99)/100);
return 0;
} |
/*Look at Abhinav man, so inspirational*/
#pragma GCC optimize ("-O3")
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
#define forn(i,x,n) for(ll i=x;i<n;i++)
#define pb push_back
#define int long long
#define mp make_pair
#define debug(x) cout<<x<<"\n";
#define lb lower_bound
#define ub ... | #include<bits/stdc++.h>
using namespace std;
const int toSreachDirX[4]={-1,0,1,0};
const int toSreachDirY[4]={0,1,0,-1};
const string toSreachDir="URDL";
int Term=0;
const int Height=30;
const int Width=30;
unordered_map<char,int>Direction2Index={{'U',0},{'R',1},{'D',2},{'L',3}};
struct road{
array<pair<int,int>,4>di... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<V>;
using VVV = vector<VV>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
template<class T> using VE = vector<T>;
template<class T> using P = pair<T, T>;... | #include<bits/stdc++.h>
using namespace std;
#define N 100005
#define Db double
#define For(i,x,y)for(i=x;i<=(y);i++)
struct dls
{
int val,id;
}b[N];
int a[N],h[N],n,m;
bool cmp(dls _,dls __)
{
return 1LL*_.val*n-1LL*a[_.id]*m>1LL*__.val*n-1LL*a[__.id]*m;
}
int main()
{
int k,i,tot=0;
scanf("%d%d%d",&k,&n,&m);
For... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
#define int long long
const int MOD=998244353;
int dp[15][1000001];
int pw(int n,int k){
assert(k>=0);
int res=1;
while(k){
if(k&1)(res*=n)%=MOD;
(n*=n)%=MOD;
k>>=1;
}
return r... | #include<bits/stdc++.h>
using namespace std;
#define M 5005
#define K 13
#define MOD 998244353
int comb[M][M];
int dp[K][M];
int main()
{
for(int i = 0; i < M; i++) comb[i][0] = 1;
for(int i = 1; i < M; i++)
{
for(int j = 1; j <= i; j++) comb[i][j] = (comb[i-1][j]+comb[i-1][j-1])%MOD;
}
i... |
#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
#include<cstdio>
#include<stdio.h>
#include<cmath>
#include<math.h>
#include<vector>
#include<set>
#include<queue>
#include<map>
#include<sstream>
#include<iomanip>
#define forn(i,n) for(int (i)=0;i<(n);i++)
#define pb push_back
#define mp make_p... | #include <bits/stdc++.h>
using namespace std;
#define ll long long; //个人习惯
int main()
{
stack <char> fox; //定义
int n; //定义
string s; //定义
cin >> n; //输入
cin >> s; //输入
for(int i = 0; i < s.length(); i++)
{
if(fox.size() < 2)
{
fox.push(s[i... |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constex... | #include <bits/stdc++.h>
using namespace std;
int n;
vector<pair<int,int> > x,y;
vector<int> ans;
map<pair<int,int>,int > ma;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin>>n;
for(int i=1;i<=n;i++)
{
int u,v;
cin>>u>>v;
x.push_back({u,i});
... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
string S;
cin >> S;
stack<char> s;
int cnt = 0;
for(int i = 0; i < N; i++){
if(S[i] == 'f') s.push('f');
else if(S[i] == 'o'){
if(s.empty() || s.top() != 'f'){
while(!s.empt... | #include <bits/stdc++.h>
#include <functional>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <stdio.h>
#inc... |
#include <iostream>
using namespace std;
char c[4];
typedef long long ll;
ll mod = 1000000007;
ll pw(ll a, ll x){
if(x<0) return 1;
ll ret = 1;
while(x){
if(x&1) (ret *= a) %= mod;
(a *= a) %= mod; x /= 2;
}
return ret;
}
ll dp1[2010][2],dp2[2010][2];
void solve(){
dp1[0][0] = ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long N;
cin >> N;
vector<long long> A(N);
vector<long long> sumVec(N);
for (long long i = 0; i < N; i++)
{
cin >> A.at(i);
if (i == 0)
{
sumVec.at(i) = A.at(i);
}
else
{
... |
//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> ... | #include <iostream>
#include <cstdio>
#define N 202
#define int long long
using namespace std;
const int mod=998244353;
const int G=3;
int read()
{
char c=getchar();
int w=0,f=1;
while(c<'0'||c>'9'){
if(c=='-') f=-1;
c=getchar();
}
while(c<='9'&&c>='0'){
w=w*10+c-'0';
c=getchar();
}
return w*f;
}
int n,... |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef vector<int> V;
#define F(N,S,E) for(int N=(int)(S);N<=(int)(E);N++)
#define R(N,S,E) for(int N=(int)(S);N>=(int)(E);N--)
#define D(N,E) for(int N=0;N<(int)(E);N++)
LL read(){LL x;scanf("%lld",&x);return x;}
int main(){
int n=read();
int mx=-1... | #include <iostream>
using namespace std;
typedef long long ll;
int main() {
int N, A[110];
cin >> N;
for (int i = 0; i < N; ++i){
cin >> A[i];
}
int res = 0;
int res_index = 2;
for(int i = 2; i <= 1000; ++i){
int score = 0;
for (int j = 0; j < N; ++j){
... |
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,avx512f")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vect... | /**
* File : B.cpp
* Author : JCHRYS <jchrys@me.com>
* Date : 12.01.2020
* Last Modified Date: 12.01.2020
* Last Modified By : JCHRYS <jchrys@me.com>
*/
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, m;
cin >> n >> k >> m;
int total = 0;
... |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vect... | #define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(...) begin(__VA_ARGS__) , end(__VA_ARGS__)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef vector <int> vi;
typedef pair<int,int> PII;
typedef p... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
vector<pair<long long, long long>> A;
long long ans = 0;
for (long long i=0; i<(pow(2,N)); i++) {
long long x;
cin >> x;
A.push_back( make_pair(i+1, x) );
}
vector<pair<long long, long long>> B = A;
w... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>
using ... |
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <string>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <ctime>
#include <cassert>
#include <fstream>
#include <stack>
#include <random>
#include <i... | #include<bits/stdc++.h>
using namespace std ;
#define all(x) (x).begin(), (x).end()
#define ll long long
const ll mod = 1e9 + 7;
int ri(){
int n;
scanf("%d", &n);
return n;
}
void solve(){
int n = ri();
int a[n];
for(auto &i : a) i = ri();
int res = INT_MAX;
for(int i=0; i < (1 << (n-1)); i++){
int ored = ... |
#include <bits/stdc++.h>
using namespace std;
long long get(long long x) {
string s = bitset<100>(x).to_string();
int ans = 0;
int cur = 0;
for (int i = 0; i < 100; i++)
if (s[i] == '1') cur++;
else {
ans += min(cur, 2);
cur = 0;
}
ans += min(cur, 2);
return ans;
}
long long get(lo... | #pragma GCC optimize("O3")
#pragma GCC target("avx2")
#include <algorithm>
#include <iostream>
using namespace std;
#define f(x,y,z) for(int x=y;x<=z;++x)
#define d(x,y,z) for(int x=y;x>=z;--x)
typedef long long ll;
ll n, ans = 1, a[100001];
const int mod = 1e9+7;
int main() {
ios_base::sync_with_stdio(false); cin.... |
#pragma region head
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using pi = pair<int, int>;
using pll = pair<ll, ll>;
template <class T>
using vv = vector<vector<T>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (in... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx")
#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) ... |
#ifdef _DEBUG
#define dout(x) clog << "Line " << __LINE__ << ": " << #x << "=" << (x) << el
#else
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#define dout(x)
#endif
#include <bits/stdc++.h>
using namespace std;
#define MP(a, b) make_pair(a, b)
#define PB(x) push_back(... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
std::pair<std::vector<int>,bool> fct(std::vector<int>z) {
std::vector<int> a(z.begin(), z.end());
std::sort(a.rbegin(), a.rend());
std::vector<int> b(a.rbegin(), a.rend());
int taille = a.size();
std::vector<int>ans(taille);
bool ok = true... |
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define mp make_pair
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define sz(a) a.size()
#define md(a, b) ((a) % b + b) % b
#define mod(a) md(a, MOD)
#define srt(a) sort(all(a))
#defin... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
vector<int> dx = {0, 0, -1, 1}, dy = {1, -1, 0, 0};
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
for (int i = 0; i < h; i++) {
cin >> s[i];
}
int ans = 0;
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
//const ll INF = numeric_limits<ll>::max() / 4;
//const int INF = numeric_limits<int>::max() / 4;
map<int,set<pair<int,int> > > M; // (moji, (k,d)) dは、その文字の位
vector<bool> F(10,true);
ll X[3];
ll Z[3]; // 最大digit
bool l... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "/debug.h"
#else
#define db(...)
#endif
#define all(v) v.begin(), v.end()
#define pb push_back
using ll = long long;
const int NAX = 2e5 + 5, MOD = 1000000007;
string solveCase(int n, const vector<string> &a)
{
// TODO: edit here
vector<int>... |
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define pre(i,a,b) for(int i=a;i>=b;i--)
#define N 20
using namespace std;
char c[N];int k;
int u[N],v[N],s[N],t[N],a[N],b[N];
int Pow(int x,int y){
int now=1;
for(;y;y>>=1,x=x*x)if(y&1)now=now*x;
return now;
}
bool check(){
long long ans=0;
memset(a... | //#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define P... |
//templete
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0;i<n;i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int N;
ll A,B;
ll ans=0;
cin>>N;
rep(i,N){
cin>>A>>B;
ans+=B*(B+1)/2-A*(A-1)/2;
}
cout<<ans;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, a, b) for(int i = (int)(a); i <= (int)(b); i++)
struct ad{
int left, up, right, down;
};
int time_start;
int Num;
std::vector<ad> ads;
std::vector<std::pair<ad,int>> ads_start;
void in(){
std::cin >> Num;
ads.resize(Num);
ads_start.resize(Num);
rep(i,0,Num-... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(i,b) for(int i=0;i<b;i++)
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
main()
{
fast
int n,k;
cin>>n>>k;
int o=0,e=0;
loop(i,n){
string str;
cin>>str;
int cnt=0;
loop(i,k){
if(str[i]=='1') cnt++;
}
if(cnt... | #include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define ll long long
#define ui unsigned int
#define us unsigned short
#define inf_int 1e9
#define inf_ll 1e18
#define mod 1000000007
#define smod 998244353
int n, m;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(... |
#include<bits/stdc++.h>
using namespace std;
int gcd(int a,int b){
int g=max(a,b),l=min(a,b),n=l;
while(g%l!=0){
n=g%l;
g=l;
l=n;
}
return l;
}
int main(){
int n;
cin>>n;
vector<int64_t>a(n);
for(int i=0;i<n;i++)cin>>a[i];
int ans=a[0];
for(int i=0;i<n;i++){
ans=gcd(ans,a[i]);
}
... | #include <iostream>
#include <cstdio>
using namespace std;
int n,a,now;
int gcd(int x,int y)
{
if(x<y) swap(x,y);
if(y==0) return x;
return gcd(y,x%y);
}
int main()
{
scanf("%d%d",&n,&now);
for(int i=2;i<=n;i++)
{
scanf("%d",&a);
now=gcd(now,a);
}
printf("%d",now);
return 0;
} |
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
int n,d;
inline ll calc(int x)
{
if(x<2 || x>2*n) return 0;
int l = max(x-n, 1), r = min(x-1, n);
return r<l? 0: r-l+1;
}
int main(v... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll a[300005], b[300005];
int main(){
int n;
cin >> n;
ll res = 0;
for(int i = 0; i < n; i ++ ) cin >> a[i], res += a[i] * a[i] * (n - 1);
for(int i = n - 1; i >= 0; i -- ){
b[i] = b[i + 1] + a[i];
}
ll... |
#include<bits/stdc++.h>
#define For(a,b,c) for(int a=b;a<=c;++a)
#define Dor(a,b,c) for(int a=b;a>=c;--a)
using namespace std;
typedef long long LL;
const int N=1007;
int n,m,c,a,vH[N],vL[N];
char G[N][N];
void flyL(int);
void flyH(int u) {
if(vH[u]) return;
vH[u]=c;
For(v,1,m) if(G[u][v]=='#') flyL(v);
}
void flyL(... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, l, n) for (int i = (int)(l); i < (int)(n); i++)
#define drep(i, n, l) for (int i = (int)(n); i > (int)(l); i--)
#define INF INT_MAX
#define INFF (pow(2,64))
#define def (200007)
#define MOD (1000000007)
typedef int64_t intt;
typedef vector<int> veci;
typedef ... | #include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+5;
const int inf=0x3f3f3f3f;
int a[maxn],b[maxn];
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
int sum,num,en;
cin>>sum>>num>>en;
int ls=0,x=sum;... |
#include<bits/stdc++.h>
using namespace std;
#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
typedef long long int lli;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<pll> vop;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define REP(i,a,b) for(long long int i=a;i<b;i++)... | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define RFOR(i, a, n) for (ll i = (ll)n - 1; i >= (ll)a; i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep... |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | #include <bits/stdc++.h>
using namespace std;
void read (int &x) {
char ch = getchar(); x = 0; while (!isdigit(ch)) ch = getchar();
while (isdigit(ch)) x = x * 10 + ch - 48, ch = getchar();
} const int N = 2e5 + 5;
int n; pair<int, int> a[N * 2];
struct tree {
int c[N << 2], tag[N << 2];
#define ls (p <... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
vector<vector<ll>>adj(200010);
ll vis[200010];
vector<ll>ans;
map<ll,ll>mp;
ll c[200010];
void dfs(ll u)
{
vis[u]=1;
mp[c[u]]++;
for(auto it=adj[u].begin();it!=adj[u].end();it++)
{
if(!vis[*it])
{
if(mp[c[*it]]... | #include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define ice(i, a, b) for (int (i) = (a); (i) < (b); ++(i))
vector<vector<int>> adj(100001);
vector<int> color(100001);
vector<bool> good(100001);
void dfs(int n, multiset<int>& s, int m = -1) {
if (!s.count(color[n])) {
good[n] = true;
... |
#include<bits/stdc++.h>
using namespace std;
// modpow
template<class T> T modpow(T b,T p,T m){
T rt = 1; b %= m;
while(p>0){
if(p&1) rt = (rt*b)%m;
b = (b*b)%m; p>>=1;
}
return rt;
}
// small mod combination
// # f,g を次のようにする
// - f[i] : i が何回 MOD で割れるか. これを f_pre とする
// - g[i] : i の MOD で割れない部分の MOD... | // KNOW NOTHING!
#include <bits/stdc++.h>
#define ll long long int
#define F(i,j,k,in) for(int i=j;i<k;i+=in)
#define DF(i,j,k,in) for(int i=j;i>=k;i-=in)
#define feach(it,l) for (auto it = l.begin(); it != l.end(); ++it)
#define fall(a) a.begin(),a.end()
#define sz(x) (int)x.size()
#define szs(x) (int)x.length()
#defi... |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <map>
#include <math.h>
#include <queue>
#include <vector>
#include <stack>
#include <set>
#include <bitset>
using namespace std;
#define rep(i,n) for (ll i = 0; i < (n) ; i++)
#define rep2(i,n,i2,n2) for (ll i = 0; i < (n) ; i++) for (ll i2 = 0... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
ll f(ll x){
string s = to_string(x);
return stoll(s+s);
}
int main(){
ll n;
cin >> n;
ll x = 1;
// n以下までループする
while(f(x) <= n) ++x;
ll ans = x-1;
cout << ans <<endl;
... |
#include <iostream>
#include <tuple>
#include <vector>
#include <algorithm>
#include <unordered_map>
// using declaration, alias
using llong = long long;
using ldouble = long double;
// constant
constexpr auto INF_LL = 0x7FFFFFFFFFFFFFFFLL;
// constexpr auto MOD = 0LL;
namespace io {
template <class T = llong> au... | #include <bits/stdc++.h>
using namespace std;
template <class A, class B> inline bool chmax(A &a, const B &b) { return b > a && (a = b, true); }
template <class A, class B> inline bool chmin(A &a, const B &b) { return b < a && (a = b, true); }
template <class A, class B> inline void chmod(A &a, const B b) { a = a%b; r... |
#include <bits/stdc++.h>
#define ALL(s) (s).begin(),(s).end()
using namespace std;
using ll=long long;
ll M=1000000007LL;
int main(void)
{
ll h,w,ans=0; cin>>h>>w; vector<string> s(h);
for(ll i=0;i<h;i++) cin>>s[i];
for(ll i=0;i<h;i++)
{
for(ll j=0;j<w-1;j++)
{
if(s[i][j]==s[... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <random>
#include <chrono>
#include <tuple>
#include <random>
#include <cmath>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fastInp cin.tie(0); cout.tie(0)... |
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <math.h>
#include <random>
#include <chrono>
#include <assert.h>
#include <ctime>
using namespace std;
#define x first
#define y second
#de... | #include <bits/stdc++.h>
// #define ONLINE_JUDGE 1
using namespace std;
#define ll long long int
#define endl '\n'
#define vi vector<int>
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define vll vector<ll>
#define vvll vector<vector<ll>>
#define f(var,start,end) for(int var = start; var<=end; var++)
#def... |
#include <bits/stdc++.h>
const long long INF = 1e9;
const long long MOD = 1e9 + 7;
//const long long MOD = 998244353;
const long long LINF = 1e18;
using namespace std;
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIB... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define x first
#define y second
using namespace std;
typedef pair<int, int> pii;
const int md = 998244353;
const int N = 2e5 + 7;
int n, m, f[2][18];
int prvdiv[N];
void addmod(int &a, int b) {
a=(a+b)%md;
}
void mulmod(int &a, int b) {
a=(1ll... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int(i)=0;i<(n);i++)
#define SIZE 1001
typedef long long ll;
int h,w,ans=0;
typedef pair<int,int> P;
vector<string> s(SIZE);
int main(){
cin>>h>>w;
REP(i,h) cin>>s.at(i);
REP(i,h) REP(j,w){
if(j+1<w && s.at(i).at(j)=='.'&&s.at(i).at(j... | #include <cstdio>
#include <iostream>
using namespace std;
char ar[101][101];
int main()
{
int h, w;
scanf("%d%d", &h, &w);
for (int i = 0; i < h; i++)
{
for (int j = 0; j < w; j++)
{
cin >> ar[i][j];
}
}
int xdir[4] = { 0, 1, 0, -1 };
int ydir[4] = { 1, 0, -1, 0 };
int cnt = 0;
for (int i = 0; i < ... |
#include<bits/stdc++.h>
using namespace std;
#define fi(a,b) for(int i=a;i<b;i++)
#define fj(a,b) for(int j=a;j<b;j++)
#define ff first
#define ss second
#define ll long long
#define ld long double
#define ull unsigned long long
#define bp(x) __builtin_popcount(x)
#define pr(x) for(auto it: x) cout<<... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
int n; ll k; cin >> n >> k;
ll dp[4][3000005] = {0};
dp[0][0] = 1;
for(int i = 0; i < 3;i++){
for(int j = 0; j <= i * n... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n);i++)
using ll = long long;
const ll INF = 1e9+7;
const ll mod=1000000007;
using P = pair<ll, ll>;
int main(){
int n;
string s;
cin >> n >> s;
string t ="";
int ans =0;
rep(i,n){
t += s[i];
while(t... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FIO ios::sync_with_stdio(false); cin.tie(nullptr)
#define TC(t) int t; cin >> t; for(int i = 1; i <= t; i++)
#define deb(x) cerr << #x << " = " << x << e... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
int main(){
int N;
string S;
cin >> N >> S;
map<char,int> ma;
map<int,char> am;
ma['R'] = 0; am[0] = 'R';
ma['B'] = 1; am[1] = 'B';
ma['W'] = 2; am[2] = 'W';
vector<int> f(N,1),c(... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
template<class T> ostream& operator<<(ostream &os, vector<T> V) {
os << "[ "; for(auto v : V) os << v << " "; return os << "]";}
template<class L, class R> ostream& operator<<(ostream &os, pair<L,R> P) ... |
#include<bits/stdc++.h>
#define LL long long
#define SZ(x) (int)x.size()-1
#define F(i,a,b) for (int i=a;i<=b;++i)
#define DF(i,a,b) for (int i=a;i>=b;--i)
#define pb push_back
#define ms(a,b) memset(a,b,sizeof a)
using namespace std;
LL read(){
char ch=getchar(); LL w=1,c=0;
for (;!isdigit(ch);ch=getchar()) if... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long int b, c; cin >> b >> c;
long long int ansin = 0, ansout = 0;
long long int C = c, B = b;
long long int p1 = 0, p2 = 1;
p1 = 2*abs(b)+1;
if(b<0){
if(c>0){
C--;
p2++;
}
p2 += C-1;
}
else{
if(c>0) p2++;
p2... |
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int h,w,a,ans=0;
bool f[16][16];
inline void dfs(int x,int y,int n) {
if(y>w) {
y=1,
++x;
}
if(x==h&&y==w) {
if(n==0) {
++ans;
}
return;
}
dfs(x,y+1,n);
if(n>0&&f[x][y]) {
if(f[x+1][y]) {
f[x+1][y]=f[x][y]=false;
dfs(x,y+1,n-1);
... | #include <algorithm>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
using namespace std;
int H, W, A, B, ans = 0;
void dfs(int i, long long bit, int a, int b) {
if (i == H*W) {
ans++;
... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int mod=1e9+7;
int h,w,a,b;
int ans=0;
int mat[20][20];
void calc(int mark){
if(mark==a){
ans++;
}
else{
for(int i=1;i<=h;i++){
for(int j=1;j<=w;j++){
if(i!=h && mat[i][j]==0 && mat[i+1][j]==0){
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int h,w;
bool used[16][16];
int Dfs(int i, int j, int a, int b){
if(a < 0 || b < 0) return 0;
if(j == w) j = 0, i++;
if(i == h) return 1;
if(used[i][j]) return Dfs(i, j + 1, a, b);
int... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define P pair<ll, ll>
#define all(a) (a).begin(), (a).end()
int main(){
ll n;
cin >> n;
vector<ll> a(n), b(n);
rep(i, n) cin >> a[i];
rep... | #include<string>
#include<iostream>
int main(){
int N,A[100],B[100],z=1000,w=0;
std::cin>>N;
for(int f=0;f<N;f++){
std::cin>>A[f];
}
for(int i=0;i<N;i++){
std::cin>>B[i];
}
for(int t=0;t<N;t++){
if(z>=B[t])z=B[t];
if(w<=A[t])w=A[t];
}
if(z>=w)std::cout<<... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.