code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int n, len, sum = 0;
map < int, int > haha;
string str;
cin >> str;
len = str.size();
for(auto &a : str){
n = (a - '0') % 3;
haha[n]++;
sum +... | #include <bits/stdc++.h>
using namespace std;
int main () {
int N=0;
cin >> N;
int an;
an=N%2;
if (an==1){
cout << "Black" << endl;
}
if (an==0){
cout << "White" << endl;
}
} |
#include <bits/stdc++.h>
#define ll long long
#define endl "\n"
#define spacex ios_base::sync_with_stdio(false);cin.tie(NULL)
using namespace std;
long long int score(string temp)
{
vector<long long int> cnt(10,0);
// iota(cnt.begin(),cnt.end(),0);
// that is, it will assign or make increasing vector... | #include<bits/stdc++.h>
using namespace std;
double eps=1e-7;
char a[10],b[10];
long long shi[7]={1,10,100,1000,10000,100000,1000000};
long long aa,bb,K,sum[15],cnta[15],cntb[15];
long long ans1,ans2;
int main()
{
cin>>K;
scanf("%s",a+1);
scanf("%s",b+1);
for(int i=1;i<=9;i++) sum[i]=K;
for(int i=1;i<=4;i++){
s... |
#include <cstdio>
#include <cmath>
#include <stack>
#include <queue>
#include <string>
#include <iostream>
#include <sstream>
#include <ostream>
#include <cstring>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <map>
#include <iomanip>
#include <set>
#include <bitset>
#define INT_MINs -2000000000
#d... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i:x){cout << i << " ";} cout << endl;}
#define isin(x,l,r) ((l)<=(x) && (x)<(r))
using namespace std;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
template<typename T>bool chm... |
#include <iostream>
using namespace std;
int main(){
double a,b,c,d;
cin>>a>>b>>c>>d;
if(a+b==c+d){
cout<<"Yes"<<endl;
}
else if(a+c==b+d){
cout<<"Yes"<<endl;
}
else if(a+d==b+c){
cout<<"Yes"<<endl;
}
else if(a+b+c==d)
cout<<"Yes"<<endl;
else if(b+d+c==a)
cout<<"Yes"<<endl;
else if(c==a+b+d)
cout<<"Yes"<<endl... | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define log_2(a) (log((a)) / log(2))
#define ln '\n'
using... |
#include<bits/stdc++.h>
#define BOOM ios_base::sync_with_stdio(false);cin.tie(NULL);cout<<setprecision(10);
#define NEWLINE cout<<'\n';
#define ll long long
#define pb push_back
#define all(v) v.begin(), v.end()
#define MOD 1000000007
#define mod 998244353
#define ff first
#define ss second
#define mset(a,b) memset(a... | #include <bits/stdc++.h>
#define Fast cin.tie(0), ios::sync_with_stdio(0)
#define All(x) x.begin(), x.end()
#define louisfghbvc int t; cin >> t; for(int tt = 0; tt < t; ++tt)
#define sz(x) (int)(x).size()
#define sort_unique(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()));
using namespace std;
typedef... |
#include <iostream>
#include <vector>
#include <math.h>
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1... | #include<bits/stdc++.h>
#define ll long long
#define M 1000000007
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
srand(chrono::high_resolution_clock::now().time_since_epoch().count());
int n;
cin>>n;
float res = 1.08*n;
res = round(res);
// cout<<res<<"\n";
if(res<206)
... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define rep(i,j,n) for(int i=j;i<n;i++)
#define readvec(v,n) for(int i=0;i<n;i++){cin>>v[i];}
#define MOD 1000000007
int n,m;
vector<vector<int>> v;
vector<vector<int>> dp;
int rec(int i,int j)
{
if(dp[i][j]!=INT_MIN)return dp[i][j];
int a=INT_MI... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <iomanip>
#include <locale>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int INT_MA... |
#include <bits/stdc++.h>
/* #include <atcoder/lazysegtree> */
#include <iostream>
using namespace std;
/* using namespace atcoder; */
using pint = pair<int, int>;
using ll = long long;
using ull = unsigned long long;
using vll = vector<long long>;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) \
for (long lon... | #include <bits/stdc++.h>
#define bug1(x) cout<<#x<<" = "<<x<<endl
#define bug2(x,y) cout<<#x<<" = "<<x<<" "<<#y<<" = "<<y<<endl
#define bug3(x,y,z) cout<<#x<<" = "<<x<<" "<<#y<<" = "<<y<<" "<<#z<<" = "<<z<<endl
#define bug4(x,y,z,m) cout<<#x<<" = "<<x<<" "<<#y<<" = "<<y<<" "<<#z<<" = "<<z<<" "<<#m<<" = "<<m<<endl
usin... |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, n) for (ll i = (s); i < (ll)(n); ++i)
#define all(x) (x).begin(), (x).end()
const int INF = 1e9;
const ll llINF = 1e18;
/*#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
*/
int ... | #include <bits/stdc++.h>
using namespace std;
#define FI ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#d... |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
typedef long double ld;
const long long INF = 1LL << 60;
const int inf = (1 << 30);
const ll mod = 998244353;
const ll MOD = 1000000007;
const ld PI = acos(-1.0L);
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a =... | #include <stack>
#include <queue>
#include <set>
#include <vector>
#include <deque>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <string>
#include <utility>
#include <climits>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <cstring>
#include <iostream>
#include <fstream>
... |
#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 <algorithm>
#include <cstdio>
#include <cstring>
#include <set>
typedef long long int64;
const int N = 500000 + 10;
int n;
char s[N], t[N];
int main() {
static std::set<int> set;
std::set<int>::iterator it;
int i, x;
int64 tot = 0;
scanf("%d", &n);
scanf("%s %s", s + 1, t + 1);
... |
#include<bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define swap(a,b) (a^=b^=a^=b)
#define ll long long int
#define ull unsigned long long int
#define uint unsigned int
#define format(a) memset(a,0,sizeof(a))
#define rep(x,y,z) for(int x=y;x<=z;x++)
#define dec(x,y,z) for(int x=y;x>=z;x--)
#define mst(x... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define reps(i,s,n) for(int i=s;i<n;++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main()
{
int r, c;
cin >> r >> c;
vector<vector<P>> g(2 * r * c);
//横方向
rep(i, r)rep(j, c - 1)
{
int a; cin >> a;
int idx = i * c + j;
... |
// g++ -std=c++11 a.cpp
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<random>
#... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 998244353
#define N 400005
#define l(x) (x&(-x))
int n,a[N],b[N],c[N];
vector<int>to[N];
struct lsh{
int pos,val;
}a_[N<<1],b_[N];
inline void add(int x){while(x<N)++c[x],x+=l(x);}
inline int sum(int x){int ret=0;while(x)ret+=c[x],x-=l(x);... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define mp(a, b) make_pair(a, b)
#define ls (rt << 1)
#define rs (rt << 1 | 1)
inline int lowbit(const int & x) { return x & (-x);}
int n;
int tot;
const int maxn = 200 + 10;
int P[maxn];
bool visa[maxn], visb[maxn];
int f[m... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl
#define debug2(x, y) debug(x), debug(y)
#define repn(i, a, b) for(int i ... |
// {{{ by unolight
#include <bits/stdc++.h>
#include <unistd.h>
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC diagnostic ignored "-Wunused-function"
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x),end(x)
#define RALL(x) rbegin(x),rend(x)
#define REP(i,n) for ( int i=0; i<int(n); i++ )
#define REP... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b;
cin >> c >> d;
cout << (b-c) << endl;
} |
/*
Problem: A.cpp
Time: 2021-05-08 11:22
Author: CraZYali
E-Mail: yms-chenziyang@outlook.com
*/
#define REP(i, s, e) for (register int i(s), end_##i(e); i <= end_##i; i++)
#define DEP(i, s, e) for (register int i(s), end_##i(e); i >= end_##i; i--)
#define DEBUG fprintf(stderr, "Passing [%s] in Line %d\n", __FU... | #include<fstream>
#include<iostream>
#include<sstream>
#include<vector>
#include<stack>
#include<string>
#include<algorithm>
#include<cmath>
#include<unordered_map>
#include<map>
#include<queue>
#include<tuple>
#include<iomanip>
#include<bitset>
#include<stdio.h>
#include<set>
#include<array>
using namespace std;
#defi... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define sz(x) ((int)x.size())
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define mset(x,y) memset(x,y,sizeof(x))
#define rep(i,n) for(int i=0;i<i... | #include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mkp make_pair
#define rint register int
#define INF ((1 << 30) - 1)
#define FI(n) FastIO::read(n)
#define FO(n) FastIO::write(n)
#define Pair pair < int, int >
#define ull unsigned long long
#define mst(a,b) memset(a,b,sizeof(a))
#define foR(i, k... |
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <stack>
#include <queue>
#include <array>
#include <bitset>
#include <cstdio>
#include <string>
#include <vector>
#include <random>
#include <chrono>
#include <utility>
#include <numeric>
#include <cstdlib>
#include <cstring>
#incl... | // ConsoleApplication1.cpp : Defines the entry point for the console application.
//
#include <stack>
#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <cmath>
#include <queue>
#define MAXCHAR 255
#define ll long long
using namespace std;
const ll div... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);++i)
using ll = long long;
using P = pair<int, int>;
using C = complex<double>;
int main() {
int n, k;
cin >> n >> k;
vector<vector<int>> a(n, vector<int>(n));
rep(i, n)rep(j, n) cin >> a.at(i).at(j);
int L = k * k / 2 + 1;
int wa... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define forn(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define sz(a) ... |
#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
int N; string S; cin >> N >> S;
vector<int> B(N + 1);
for (auto &b : B) cin >> b;
int k = 0;
REP(i, 1, 1... |
//you can do anything // be strong :|
#include <bits/stdc++.h>
#define ll long long
#define FAST ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define pk push_back
#define f first
#define s second
using namespace std;
int const maxn = 1e6+9 ;
ll pric[maxn] ;
bool vis[maxn] ;
vector<vector<ll>>adj;
... |
#include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define loop(i,a,b) for(lli i=a;i<b;i++)
#define loopb(i,a,b) for (lli i=a;i>=b;i--)
#define pb push_back
#define mod 1000000007
#define fast() ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define mem(a,b) memset(a,b,sizeof(a))
#define gcd(a,b)... |
#include<bits/stdc++.h>
using namespace std;
const int N=2000+5;
inline int read()
{
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9')
{
if(c=='-')
f=-1;
c=getchar();
}
while(c>='0'&&c<='9')
{
x=x*10+c-'0';
c=getchar();
}
return x*f;
}
int n;
int a[N];
inline int exgcd(int x,i... | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#define int LL
typedef pair<int, int> PII;
typedef pair<int, LL> PIL;
const int N = 5e5 + 10, M = 3e5 + 10;
const int inf = 0x3f3f3f3f;
const LL INF = 0x3f3f3f3f3f3f3f3f;
#define x first
#define y second
const int mod = 1e9 + 7;
#define gcd __gcd
map<... |
#include <bits/stdc++.h>
using namespace std;
const string YES = "Yes";
const string NO = "No";
using ll = long long;
bool is_kaibun(string s){
for(int i = 0;i < s.size();i++){
if(s[i] != s[int(s.size()) - i - 1]){
return false;
}
}
return true;
}
void solve(long long _N){
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
typedef unsigned long long ull;
#define loop(i,a,b) for(ll i=a;i<b;i++)
#define f(i,a,b) for(ll i=a;i<=b;i++)
// #define testcases ll t;cin>>t;while(t--)
#define dec(x) greater<x>()
/*** Define fues ***/
#define mx 200005
#define ... |
#include <iostream>
using namespace std;
int main(void){
int n,s,d;
cin >> n >> s >> d;
for(int i=0;i<n;i++){
int x,y;
cin >> x >> y;
if(x<s){
if(d<y){
cout << "Yes" << endl;
break;
}
else{
if(i+1==n)... | #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;
typedef pair<int,int> pii;
typedef long long ll;
#define FIO ios::sync_with_stdio(false),cin.tie(0),cou... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using pl = pair<ll, ll>;
const ll INF = ll(1e18);
const ll mod = ll(998244353);
const double pi = acos(-1);
#define rep0(i,n) for(ll (i) = 0; (i) < (n); ++(i))
#define rrep0(i,n) for(ll (i) = (n) - 1; (i) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int count = 0;
for (int i = 0; i < n; i++) {
int c1 = 0, c2 = 0;
for (int j = i; j < n; j++) {
switch (s[j]) {
case 'A':
c1++;
break;
case 'T':
c1--;
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using p = pair<int, int>;
int main() {
//vector<vector<int>>data(h,vector<int>(w));
int n;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
int am = 100000, bm = 100000, ai = ... | #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;
// please, read the question correctly (do you need set or multiset)???
const int N=200010; //check the limits, dummy
int a[N], b[N];
int n, m;
int main(){
scanf("%d",&n);... |
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = (n-1); i >= 0; i--)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
//const int MOD = 998244353;
const ll INF = 1LL<<60;
const int IINF = 1000000000;
template<class T> inlin... | /*
Author: Racer5x
*************************************** UNAUTHORISED COPYING OF CODE PROHIBITED **********************************
*/
// #pragma GCC optimize("O3")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=n... |
#include<bits/stdc++.h>
#define rg register
#define fp( i , x , y ) for( rg int i=(x); i<=(y); ++i )
#define fq( i , x , y ) for( rg int i=(y); i>=(x); --i )
#define dou double
using namespace std ;
void upd( int &x , int y ) {
if( x == -1 ) x = y ;
else x = min( x , y ) ;
}
signed main( ) {
ios::s... | #include<bits/stdc++.h>
using namespace std;
#define en '\n'
#define endl '\n'
#define ll long long signed
#define pb push_back
#define append push_back
#define all(v) (v).begin(),(v).end()
#define FOR(i,a,b,k) for(int i=a; k>0?i<b:i>b; i+=k)
#define fori(a) for(int i=0; i<a; i++)
#define forj(a) fo... |
#include <iostream>
#include <vector>
#include <iomanip>
signed main(){
int N;
std::cin >> N;
std::vector<std::string> S(N);
for(auto &si:S) std::cin >> si;
std::vector<std::vector<int>> A(N,std::vector<int> (N));
for(int i=0;i<N;i++){
for(int j=0;j<N;j++){
A[i][j]=S[i][j]-'... | #include <bits/stdc++.h>
using namespace std;
typedef long double LD;
typedef long long ll;
#define int ll
#define ff(i,a,b) for (int i = a; i < b; i++)
#define bf(i,a,b) for (int i = a; i >= b; i--)
#define all(v) v.begin(),v.end()
#define show(a) for(auto xyz:a)cout<<xyz<<" ";cout<<endl;
#define F first
#defin... |
#include <bits/stdc++.h>
#define watch(x) cout <<(#x)<<" is "<<(x)<<endl
#define debug cout <<"hi"<<endl
#define maxn 3e5+10
#define inf32 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int,int>pii;
const int MOD=1e9+... | #include <bits/stdc++.h>
/* #include <atcoder/all> */
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
using namespace std;
/* using namespace atcoder; */
using ll = long long;
usin... |
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
int main() {
string S; cin >> S;
int l = 0, r = S.size() - 1;
bool is_zero = true;
while (l < r) {
if (S[l] == S[r]) {
++l, --r;
if (S[l] != '0') is_zero = ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(a, c) for (int(a) = 0; (a) < (c); (a)++)
#define FORL(a, b, c) for (int(a) = (b); (a) <= (c); (a)++)
#define FORR(a, b, c) for (int(a) = (b); (a) >= (c); (a)--)
#define INF 1000000000000000003
#define MOD 1000000007
#define F first
#define S second
#define... |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author tatsumack
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#define int long long
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <math.h>
#include <numeric>
#include <complex>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <functional>
#include <assert.h>
us... |
#include<algorithm>
#include<cstdio>
typedef long long ll;
const int maxn=1e5+5;
const int mod=1e9+7;
int n;
int val[maxn];
ll sum[maxn][2];
ll cn[maxn][2];
signed main(){
scanf("%d",&n);
if(n==1){
int x;
scanf("%d",&x);
printf("%d",x);
return 0;
}
for(int i=1;i<=n;i++)scanf("%d",val+i);
sum[2][0]=1ll*(val... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int INF = (int)1e9;
constexpr long long LINF = (long long)1e18;
constexpr long long MOD = 1e9 + 7;
//constexpr long long MOD = 998244353;
constexpr double pi = 3.141592653589793238;
int main() {
int n;
cin >> n;
vector<ll> a... |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<l... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k; cin >> n >> k;
auto count_pairs = [&](int x) {
if (x <= 1 || x > 2 * n) return 0LL;
return (long long) (x - 1) / 2 * 2 + (x - 1) % 2 - max(0, (x - n - 1) * 2);
};
long long ans = 0;
for (int x = 2; x <=... |
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
#include<t... | #include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep(i, n) repd(i, 0, n)
using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
const ul mod = 1000000007;
ll inf = 1LL << 60;
struct ed... |
//---------------------------------------------------------------
#include <bits/stdc++.h>
using namespace std;
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cassert>
//---------------------------------------------------------------
#define rep(i, n) for (long lon... | #include<bits/stdc++.h>
#define int long long
#define maxn 200010
// #define mod
using namespace std;
// template<class T>T ABS(T x) {return x<0?-x:x;}
//int ksm(int x,int y) {int r=1;while(y) y&1?r=1ll*r*x%mod:0,x=1ll*x*x%mod,y>>=1;return r;}
int read()
{
int s=0,w=1;
char ch=getchar();
while(ch<'0'||ch>'9') {if(c... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
string s;
cin>>n>>s;
n++;
vector<int> a(n);
for(int i=0;i<n;i++)cin>>a[i];
int l=0,r=10001,mid;
bool h;
while(l<r){
mid=(l+r)/2;
vector<vector<int>> A(n,vector<int>(mid));
h=true;
for(int i=0;i<n;i++){
for(int j=0;j... | #include<bits/stdc++.h>
using namespace std;
ostream& operator<<(ostream&o,const pair<auto,auto>&p){return o<<"<"<<p.first<<", "<<p.second<<">";}
ostream& operator<<(ostream&o,const vector<auto>&v){o<<'[';int f=0;for(auto&x:v)(f?o<<", ":o)<<x,f=1;return o<<']';}
#ifdef BIZON
#define rr(...) [](const auto&...x){ cha... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
vector<int> parent;
int root(int i){
if(parent[i]==i) return i;
parent[i] = root(parent[i]);
return parent[i];
}
int main(){
int n,q;
cin >> n >> q;
vector<int> c(n);
for(auto& i : c) cin >> i;
vector... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define ull unsigned long long
#define rep(i, begin, end... |
#include <stdio.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <vector>
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
using namespace std;
int main(){
vector<long>viOrd(10,0);
for(int i = 1; i < 10; i++){
viOrd[i] = viOrd[i-1] * 10 + 9;
}
long... | #include<bits/stdc++.h>
#define debug(a) cout<<#a<<"="<<a<<endl
#define rep(i,a,b) for(ll i=a,i##end=b;i<=i##end;++i)
#define drep(i,a,b) for(ll i=a,i##end=b;i>=i##end;--i)
#define erep(i,a) for(ll i=hd[a],y;(y=to[i]);i=nxt[i])
typedef long long ll;
//57200710018
using namespace std;
char IO;
inline ll rd() {
ll res=... |
#include <bits/stdc++.h>
#define int long long
using namespace std;
long long a;
long long n, m;
long long s=0;
vector <int> dd;
void xy(long long r, vector <vector <int>> &qw, vector <vector <int>> &as, long long e, long long d, vector <int> &dd)
{
if (r!=n+1)
{
for (int i=0; i<qw[e].size(); ++i)
... | #include <bits/stdc++.h>
#define pb push_back
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int cost[n + 1][n + 1];
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
cin >> cost[i][j];
vector <int> vec;
for (int i = 1; i <= n; ++i)
vec.pb(i);
vec.pb(1);
int cnt ... |
#include<bits/stdc++.h>
#define it register int
#define ct const int
#define il inline
using namespace std;
#define P 998244353
const int N=1000005;
int n,a[N],f[2][105][10005],fac[N];
il void add(it &p,ct q){p+=q,p>=P?p-=P:0;}
int main(){
scanf("%d",&n);it i,j,sum=0,ans=0;
for(i=fac[0]=1;i<=n;++i) scanf("%d",&a[i])... | #include "bits/stdc++.h"
using namespace std;
#define ffor(n) for(int i = 0; i < n; i++)
#define fffor(n) for(int j = 0; j < n; j++)
#define uwu ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize("Ofast")
const int INF = 1e9 + 7;
const long long INF2 = 1e17;
int main(void) {
uwu
int n, m; cin >> n... |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi=vector<int>;
#define INF 1000000001
int main() {
int N,M; cin>>N>>M;
vi H(N), W(M);
for (int i = 0; i < N; i++)cin>>H[i];
for (int i = 0; i < M; i++)cin>>W[i];
sort(H.begin(),H.end());
sort(W.begin(),W.end());
vi pa... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define pp pair<ll,ll>
#define ld long double
#define all(a) (a).begin(),(a).end()
#define mk make_pair
int inf=1000001000;
ll INF=2e18;
ll MOD=1000000007;
ll mod=998244353;
int main() {
int n,l;
ci... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector <int> a(n),b(n);
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=0;i<n;i++){
cin>>b[i];
}
int ans=0;
for(int l=1;l<=1000;l++){
for(int r=l;r<=1000;r++){
bool ok=true;
for(int i=0;i<n;i++){
if(l>=a[i] ... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
vector<int> a, b;
int n;
cin >> n;
a.reserve(n);
b.reserve(n);
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
a.push_back(temp);
}
for (int i = 0; i < n; i++) ... |
#if 1
#ifdef LOCAL
#define _GLIBCXX_DEBUG 1
#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif
#include <bits/stdc++.h>
using namespace std;
#define all(x) begin(x), end(x)
typedef pair<int, int> pii;
typedef vector<int> vi;
#endif
int... | #include <stdio.h>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, d, h;cin>>n>>d>>h;
cout<<fixed<<setprecision(20);
vector<pair<int, int>>v;
int a[n], b[n];for(int i=0;i<n;i++){
cin>>a[i]>>b[i];
v.push_back({b[i], a[i]});
}
double ans=0.0;
for(int i=0;i<n;i++){
... | #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>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define rep(i,n) for(int i = 0; i < n ; ++i)
#define REP(i,a,b) for(int i = a ; i <= b ; ++i)
#define filei freopen("input.txt", "r", s... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define INF ((1LL<<62)-(1LL<<31))
typedef long long ll;
int main()
{
int n;
cin >> n;
rep(i,n) {
ll a;
cin >> a;
string ans;
if(a%2==1) ans="Odd";
else {
if((a/2)%2==1... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
int main(){
int a[4];
int ans = 100;
rep(i,4) {
cin >> a[i];
ans = min(ans,a[i]);
}
cout << ans << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int a1,a2,a3,a4;
int main(){
cin>>a1>>a2>>a3>>a4;
cout<<min(a1,min(a2,min(a3,a4)));
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
double A, B;
int main() {
scanf("%lf%lf", &A, &B);
printf("%lf\n", 100.0 - B / A * 100);
return 0;
} | //デバッグ用オプション：-fsanitize=undefined,address
//コンパイラ最適化
#pragma GCC optimize("Ofast")
//インクルードなど
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
typedef long long ll;
using vint = vector<int>;
using vll = vector<ll>;
using vs = vector<string>;
using vbool = vector<bo... |
#include <bits/stdc++.h>
#define SZ(x) (int)(x).size()
#define ALL(x) (x).begin(),(x).end()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
using namespace std;
typedef double DB;
typedef long double LD;
typedef long long LL;
typedef unsigned long long ULL;
typedef p... | /* -*- coding: utf-8 -*-
*
* f.cc: F - Digits Paradise in Hexadecimal
*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<... |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#include<queue>
using namespace std;
#define LL long long
#define DB double
#define MAXN 100
#define Pr pair<int,int>
#define X first
#define Y second
#define INF 1000000001
#define mem(x,v) memset(x,v,sizeof(x))
LL read(){
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
ll f(string s) {
vector<ll> c(10);
ll res = 0;
rep(i, 5) c[s[i] - '0']++;
for (int i = 1; i < 10; ++i) {
ll t = i;
while (c[i]--) t *= 10;
res += t;
}
return... |
#include <iostream>
#include <iomanip>
double ans[112][112][112];
int main(){
for(int i = 99; i >= 0; --i){
for(int j = 99; j >= 0; --j){
for(int k = 99; k >= 0; --k){
int sum = i + j + k;
ans[i][j][k] += ans[i + 1][j][k] * i;
ans[i][j][k] += ans[i][j + 1][k] * j;
ans[i][j][k] += ans[i][j][k + 1... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int inf=0x3f,INF=0x3f3f3... |
#include <bits/stdc++.h>
//#include <atcoder/all>
#define rep(i,n)for(ll i=0;i<(n);i++)
#define whole(f,x,...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)
using namespace std;
typedef long long ll; typedef long double ld; typedef pair<ll,ll>pint;
using vll=vector<ll>; usi... | #include <cstdio>
#include <iostream>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
using namespace std;
using ll = long long;
using ull = unsigned long lon... |
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <algorithm>
#include <math.h>
#include <iomanip>
#include <sstream>
#define INF 1000000009
#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() {
ll k,n,... | #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 <algorithm>
#include <iostream>
#include <deque>
#include <climits>
#include <cmath>
#include <map>
#include <set>
#include <list>
#include <vector>
// #include <atcoder/convolution>
using namespace std;
using ll = long long;
#define len(s) static_cast<ll>(s.size())
#define rep(i, n) for (ll i = 0; i < n; i+... | #include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <utility>
using ll = long long;
ll pow2(int x) {
ll i=1;
if (x == 0) return i;
for (int k=0; k<x; k++) {
i *= 2;
}
return i;
}
int main() {
std::vector<ll> a;
int n;
std::cin >> n;
a.rese... |
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_ll.hpp>
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,b,a) for(ll i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
double pi=acos(-1);
#define ll long long
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define sz(v) v.size()
#define INF 100000000000000 //10^14
template <typename T>
bool chmax(T &a, const T& b) ... |
#include <bits/stdc++.h>
#include <time.h>
#include <queue>
#define ll long long int
#define mp make_pair
#define ff first
#define ss second
#define forr(i,a,n) for(ll i=a;i<n;i++)
#define ford(i,a,n) for(ll i=n-1;i>=a;i--)
#define all(v) v.begin(),v.end()
#define testc ll ts;\
cin>>ts;\
... | // AUTHOR:- Saumya Rangani
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pi (3.141592653589)
#define mod 1000000007
#define float double
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define vii vector<pair<int,int>>
#define fr first
#define sc second
#define all(c) c.b... |
/*
Author : MatsuTaku
Date : 02/20/21
*/
#include <bits/stdc++.h>
using namespace std;
#include <x86intrin.h>
#ifndef ONLINE_JUDGE
#define Assert(cond) assert(cond)
#else
#define Assert(cond)
#endif
#define rep(i, n) for (size_t i = 0, i##_len = (n); i < i##_len; i++)
using lint = long long in... | #include <bits/stdc++.h>
typedef long long ll;
typedef std::vector<int> vi;
typedef std::vector<std::vector<int>> vii;
typedef std::pair<int, int> pii;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } retu... |
#include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <algorithm>
#include <set>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long int n;
cin>>n;
vector<pair<long long int,long long int>> hoge(n);
for(lon... | #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 forr(i,n) for(int i = 0 ; i < n ; i++)
#define forr1(i,n) for(int i = 1 ; i <= n ; i++)
#define int long long int
#define pb push_back
#define endl... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REPS(i, n) for(int i = 1; i <= (n); i++)
#define RREP(i, n) for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#... | #include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) x.begin(),x.end()
#define SZ(x) ((in... |
#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<ll,int> Pair;
typedef tuple<int,int,int> tpl;
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c)... | #include <bits/stdc++.h>
#define int long long int
#define ll long long int
#define ld long double
#define getFaster ios_base::sync_with_stdio(false), cin.tie(nullptr)
#define rep(i, init, n) for (int i = init; i < (int)n; i++)
#define rev(i, n, init) for (int i = (int)n; i >= init; i--)
#define MOD1 1e9 + 7
#define MO... |
/* winners never quit and quitters never win.
#swap */
#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;
#pragma GCC optimize ("-O3")
using ll = long long;
using ld = long ... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string.h>
#include <cstdio>
#include <tuple>
#include <numeric>
#include <functional>
#include <fstream>
#include <iostream>
using n... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define N 1000
#define INF 1000000005
#define INFLL (ll)1000000000000000005
#define PI 3.1415926535897
typedef long long ll;
#define ALL(v) (v).begin(),(v).end()
#define SZ(x) int(x.size())
#define IN(a) cin>>(a)
#define OUT(a) cout<<... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cstdlib>
#include <queue>
#include <stack>
#include <bitset>
us... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c;
cin >> a >> b >> c;
if(a != b && a != c && b != c) {
cout << "0";
}
else if(a == b && b == c && a == c) {
cout << a;
}
else if(a == b && a != c) {
cout << c;
}
else if(a == c && a != b) {
cout << b;
}
else if(c == b && a != b) {
... | #include<bits/stdc++.h>
using namespace std;
#define INF 1234567890
#define ll long long
int N;
string s, t;
vector<int> S, T;
int main()
{
ios::sync_with_stdio(0); cin.tie(0);
cin.exceptions(ios::badbit | ios::failbit);
cin >> N >> s >> t;
int sz = 0, so = 0, tz = 0, to = 0;
for(int i=0; i<N; i++)
{
if (s[i... |
#include <bits/stdc++.h>
#define pb push_back
// #define int long long
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define ld long double
using namespace std;
const int M = 1000000007;
set<int> qq;
int cnt[4000009];
int mex = 0;
void add(int x) {
cnt[x]--;
if (cnt[x] == 0) {
qq.inse... | #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,M; cin >> N >> M;
vector<vector<int>> pos(N + 1);
rep(i,N){
int A; cin >> A;
pos[A].push_back(i);
}
rep(... |
#include <bits/stdc++.h>
using namespace std;
#define ms(a, b) memset((a), (b), sizeof(a))
#define eps 1e-8
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
const int N = 4e5 + 5;
const int M = 1e6 + 5;
const int INF = 0x3f3f3f3f;
const ll LL_MAX = 0x3f3f3f3f3f3f3f3f;
const int mod = 998... |
//================code===================//
//#define TLE
#ifdef TLE
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#endif
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <ctime>
#define ci(t) cin>>t
#define co(t) ... |
#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>
using namespace std;
#define ll long long
#define ld long double
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(), x.end()
#define mp(x, y) make_pair(x, y)
#define sz(li) (int) (li).size()
#define sum(a) (accumulate ((a).begin(), (a).end(), 0ll))
#define mine(a... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
int f[100000][2] = {0}, times[100000][2] = {0};
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n;
cin >> n >> f[0][0];
times[0][0] = 1;
for (int i = 1; i < n; ++i) {
time... | #include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define lli long long int
#define tc int t;cin>>t;while(t--)
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define pb push_back
#define pi pair<int,int>
#define pll pair<lli,lli... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
struct node {
int to,next;
} a[400005];
int aa[200005],b[200005],suma,sumb;
int h[200005],cnt,use[200005],st[200005],top;
void add(int x,int y) {
cnt++;
a[cnt].to=y;
a[cnt].next=h[x];
h[x]=cnt;
}
void dfs(int v) {
st[++top]=v;
use[v]=1;
for(int ... | #include <bits/stdc++.h>
#define fi first
#define se second
#define lc (x << 1)
#define rc (x << 1 | 1)
#define gc getchar() //(p1==p2&&(p2=(p1=buf)+fread(buf,1,size,stdin),p1==p2)?EOF:*p1++)
#define mk make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define IT iterator
#define vi vec... |
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <iostream>
#include <cassert>
#include <cmath>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <cstdlib>
using namespace std;
#define INF 1e+9
#define mp make_pair
#define pb push_back
#define fi first
#defi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define N 214514
#define all(x) (x).begin(), (x).end()
const ll mod = 1000000007;
// const ll mod = 998244353;
const ll inf = 8000000000000000000;
void dfs(ll from, vector<vector<ll>>& v, vect... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
#define fi first
#define se second
#define rep(i,k,n) for(int i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
const int M=1e9+7,N=205001;
int mm(int x,int y){x%=M,y%=M;retur... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <tuple>
#include <unordered_map>
#include <vector>
// #include <atcoder/all>
/*
cd $dir && g++ -std=c++17 -Wall -Wextra -O2 -DATCODERDEBUG
-I/mnt/d/MyProjects/atcoder/... |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 101;
map<int,int>f;
int n, a[N];
set<int>s;
set<int>::iterator it;
signed main()
{
scanf("%d",&n);
for(int i = 1;i <= n; i++) scanf("%d",&a[i]);
sort(a + 1,a + n + 1);
int ans = 1;
for(int i = 1;i <= n; i++)
for(int j = 1;j * j <= a[i]; j++)
{
... | #include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const int maxn = 1e6 + 5;
const int inf = 2e9;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.t... |
// Template begins
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <stdio.h>
#include <stack>
#include<queue>
#include <map>
#include <cmath>
#include<cstring>
using namespace std;
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define e... | #include <iostream>
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll r=998244353;
int main() {
// your code goes here
ll a,b,c;
cin>>a>>b>>c;
ll a2=(a*(a+1))/2;
ll b2=(b*(b+1))/2;
ll c2=(c*(c+1))/2;;
ll ab=((a2%r)*(b2%r))%r;
ll abc=((ab%r)*(c2%r))%r;
cout<<abc;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string(string(s)); }
string to_string(bool b) { return to_string(int(b)); }
string to_string(vector<bool>::reference b) { return to_string(int(b)); }
string to_stri... | #include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
int a[3][3],dp[1005][3],n;
int x = -1;
int power(int p)
{
int ans = 1;
while(p)
{
ans = ((ans%mod) * (2%mod))%mod;
p--;
}
return ans;
}
int solve(int i,int last)
{
if(i == n)
{
if(x==1 && last ==... |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <string>
#include <cassert>
using namespace std;
typedef long long llint;
const int INF = 0x3f3f3f3f;
const llint INFLL = 0x... | #include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <algorithm>
#include <math.h>
#include <iomanip>
#include <sstream>
#include <map>
#define INF 100000000
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using p = pair<int, int>;
vector<vector<str... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... | //#include <bits/stdc++.h>
//using namespace std;
//typedef long long ll;
//typedef pair<int, int> pi;
//typedef pair<ll, ll> pll;
//
//vector<int> V[100001], odd[100001];
//
//int f[100001], sz[100001];
//
//void dfs(int pos) {
// f[pos] = -1, sz[pos] = 1;
//
// int sum = 0;
// for (int w : V[pos]) {
// dfs(w); sz[po... |
#include <bits/stdc++.h>
#define int long long
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const int N = 55, MOD = 998244353;
int dsu[N], sz[N];
int find(int u){
return dsu[u]==u ? u : dsu[u] = find(dsu[u]);
}
void unite(int u, int v){
u = find(u), v = find(v);
if(... | #include <bits/stdc++.h>
using namespace std;
#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
using ll = long long;
using ull = unsigned long long;
#define rep(i, m, n) for(ll i = (ll)(m); i < (ll)(n); ++i)
#define rep2(i, m, n) for(ll i = (ll)(n)-1; i >= (ll)(m); --i)
#define REP(i, n) rep(i, 0, n)
#d... |
#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 ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long
#define vl vector<ll>
#define vs vector<strin... | #include <bits/stdc++.h>
#include <iostream>
#include <stdlib.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vl vector<ll>
#define vb vector<bool>
#define vpi vetor<pii>
#define vpl vector<pll>
#define pb push_back
#define all(v) v.begin()... |
/*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
*$* WRITER:kakitamasziru/OxOmisosiru *$*
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <stdio.h>
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorit... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N, A, B;
cin >> N >> A >> B;
cout << N - A + B << endl;
return 0;
} |
#include<iostream>
#include<math.h>
#include<string>
#include<stack>
using namespace std;
int solvea(){
long long int ans=0;
long long int s;
cin>>s;
for(long long int i=1LL;i<=s;i++){
long long int hoge=0LL;
for(long long int j=1LL;j*j*i<=s;j++){
long long int temp=(s/(i*j));
hoge+=temp;
... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <iomanip>
#include <climits>
#include <functional>
#include <cassert>
using namespace std;
typedef long long ll;
typedef pair<int,int> ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define mp(a, b) make_pair(a, b)
const int maxn = 1000 + 10;
const ll mod = 1e9 + 7;
char s[4][10];
int tr[4];
ll f[maxn], g[maxn];
ll powMod(ll a, ll k)
{
ll ret = 1;
while(k > 0)
{
if(k & 1) ret = ret * a % mod;
a... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9+7;
int main(){
int N; cin >> N;
vector<ll> A(N), sum(N+1);
for(int i=0; i<N; i++){
cin >> A[i];
sum[i+1] = sum[i]+A[i];
}
vector<vector<int>> dp(N+2,vector<int>(N+2));
dp[1][0]++;
int ans =... |
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/priority_queue.hpp>
//#include <ext/pb_ds/hash_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii... | #include <bits/stdc++.h>
using namespace std;
#define sp(x) cout<< setprecision(x);
#define all(a) (a).begin(), (a).end()
#define inf INT64_MAX*0.99
#define pi 3.141592653589793238;
#define int long long
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
typedef pair<int, int> P;
signed main(){... |
// Problem: A - Three Dice
// Contest: AtCoder - AISing Programming Contest 2021（AtCoder Beginner Contest 202）
// URL: https://atcoder.jp/contests/abc202/tasks/abc202_a
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Author: abhidot
#include <bits/stdc++.h>
#define int long long
#define IOS std::ios::sync_with_stdi... | #include <bits/stdc++.h>
using namespace std;
using i128 = __int128_t;
using u128 = __uint128_t;
using u64 = uint64_t;
//define
#define int long long
#define ll int
#define trav(i,v) for(auto i: v)
#define rep(i,n) for(int i=0;i<n;i++)
#define repu(i,k,n) for(int i=k;i<=n;i++)
#define repd(i,k,n) for(int i=k;i>=... |
#include<bits/stdc++.h>
using namespace std;
template <typename T>
inline void read(T &x){
x=0;char ch=getchar();bool f=false;
while(!isdigit(ch)){if(ch=='-'){f=true;}ch=getchar();}
while(isdigit(ch)){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
x=f?-x:x;
return ;
}
template <typename T>
inline void write(T x){
if(x<0)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T>
class fenwick {
private:
vector <T> sum;
vector <T> cnt;
int size;
public:
fenwick(int _n) : size(_n) {
sum.assign(size + 1, 0);
cnt.assign(size + 1, 0);
}
void upd_sum(int i, T v) {
for(; i <= size; i += i&-i) {... |
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
const ll LINF=1LL<<60;
const int IN... | #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 ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define codeWizard ios_base::sync_with_stdio(0);cin... |
#include <bits/stdc++.h>
#define ls (rt<<1)
#define rs (rt<<1|1)
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int N=4e5+10;
const int INF=0x3f3f3f3f;
int a[N],n;
pii pa[N];
int mx[N<<2],lazy[N<<2];
int main() {
auto push_down=[&](int rt){
if(lazy[rt]){
lazy[ls]+=la... | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... |
#include <bits/stdc++.h>
using namespace std;
// (setq-default c-basic-offset 2)
int main() {
int n;
cin >> n;
vector<long long> a(n);
vector<long long> b(n);
for (long long& ai : a) {
cin >> ai;
}
for (long long& bi : b) {
cin >> bi;
}
long long dot = 0;
for (int i = 0; i < n; ++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;
typedef long long ll;
typedef long double ld;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll... |
#include<bits/stdc++.h>
#include<algorithm>
#define int long long
using namespace std;
signed main(){
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
//MessageBox(GetForegroundWindow(),"标题","内容",MB_YESNO);
int a,b,x,y;
cin>>a>>b>>x>>y;
int sum=0;
if(x+x<y){
y=x+x;
}
if(a>b){
sum=(a-b-1)*y;
sum+... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define isin(x,l,r) ((l) <= (x) &&... |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define reps(i,s,n) for(int i=s;i<n;++i)
using namespace std;
using ll = long long;
using P = pair<ll, int>;
using T = tuple<int,int,int>;
int main()
{
int n, m;
cin >> n >> m;
vector<vector<T>> g(n);
rep(i, m)
{
ll a, b,c,d;
... | // #pragma GCC target ("avx,avx2")
// #include <bits/extc++.h>
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> // Common file
// #include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#define f first
#define s second
using namespace std;
// using namespace __gnu_pbds;... |
#include <bits/stdc++.h>
using namespace std;
struct edge{
long long v;
long long c;
long long d;
};
long long f(long long x, long long y){
long long l = x, r = y+1;
while(l<r){
long long m1 = (r-l+1)/3 + l, m2 = (r-l+1)*2/3 + l;
long long c1 = y/(m1+1) + m1 - x, c2 = y/(m2+1) + m2 - x;
if(c1<c2... | /*input
*/
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#inclu... |
/*
皮卡丘冲鸭！
へ ／|
/＼7 ∠＿/
/ │ ／ ／
│ Z ＿,＜ ／ /`ヽ
│ ヽ / 〉
Y ` / /
ｲ● ､ ● ⊂⊃〈 /
() へ | ＼〈
>ｰ ､_ ィ │ ／／
/ へ / ﾉ＜| ＼＼
ヽ_ﾉ (_／ │／／
7 |／
＞―r￣￣`ｰ―＿
*/
#include <iostream>
#define For(i,x,y) for(int i=(x); i<=(y); i++)
#define fori(i,x,y) for(int i=(x); i<(y); i++)
#def... | #include <bits/stdc++.h>
using namespace std;
#define nl "\n"
#define nf endl
#define ll long long
#define pb push_back
#define _ << ' ' <<
#define INF (ll)1e18
#define mod 998244353
#define maxn 110
ll i, i1, j, k, k1, t, n, m, res, flag[10], a, b;
string s;
int main() {
ios::sync_with_stdio(0);
cin.tie(0)... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define repp(i, n, m) for (int i = m; i < int(n); ++i)
//alias g++='g++ -I/mnt/c/Users/Owner/Desktop/ac-library'
using ll = long long;
using ld = long double;
using P = pair<int, int>;
... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
//#define ACL
#ifdef ACL
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#if __has_include("acl-all.h")
#include "acl-all.h" //on Wandbox
using namespace atcoder;
#endif
#endif //#ifdef ACL
typedef long... |
#include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define forn(i,n) for(int i = 0; i < (int) n; i++)
#define ios ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
using namespace std;
typedef long long ll;
ll stars3(ll x) {
return (x + 2) * (x + 1) / 2;
}
ll n;
// a + b + c = x
// 0 <= a,b,c < n
ll co... | #include <bits/stdc++.h>
using namespace std;
int N;
long long K, dp[4][3000001];
int main() {
scanf("%d %lld", &N, &K);
memset(dp,0,sizeof(dp));
dp[0][0] = 1;
for (int i = 1; i <= 3; ++i) {
long long x = 0;
for (int j = 0; j <= N*i; ++j) {
dp[i][j] = x, x += dp[i-1][j];
... |
#include <algorithm>
#include <iostream>
using namespace std;
using ll = long long;
int a[100001];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
fill(a + 1, a + n + 1, 2);
for(int i = 2; i + i <= n; i++) {
for(int j = i + i; j <= n; j += i) {
a[j] += a... | #include <cstdio>
#include <vector>
using namespace std;
int main (){
bool notprime[100001] = {};
int N;
int v[100001] = {};
vector<int> prime;
scanf("%d", &N);
notprime[1] = true;
for (int i = 2; i <= N; i++)
if (!notprime[i]){
prime.push_back(i);
for (long long j = (long long) i * i; j <= N; j += i)
... |
#include <bits/stdc++.h>
using namespace std;
#define watch(x) cerr << (#x) << ": " << (x) << endl
typedef long long LL;
const int N = 100009;
int n, l, a[N], b[N];
LL ans;
void nope() {
cout << -1 << endl;
exit(0);
}
LL rgt(int i, int j) {
LL ret = 0;
int prevadd = 0;
int cur = i+1;
for(... | /*
“The only way that we can live is if we grow.
The only way we can grow is if we change.
The only way we can change is if we learn.
The only way we can learn is if we are exposed.
And the only way that we are exposed is if we throw ourselves into the open.”
*************************************** *************... |
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <array>
#include <numeric>
//#include <atcoder/all>
using namespace std;
//... | #include <bits/stdc++.h>
using namespace std;
template <typename T> T my_gcd(T a, T b) {
if (b == 0) {
return a;
}
else {
return my_gcd(b, a%b);
}
}
int main() {
int n;
cin >> n;
vector<int> x(n);
for (int i = 0; i < n; i++) {
cin >> x.at(i);
}
set<int> s;
for (int i = 0; i < n; i+... |
#include <iostream>
using namespace std;
int main(){
int a,b,c,d;
cin>>a>>b>>c>>d;
cout<<-(b*c-a*d);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define pi 3.1415926535
#define endl "\n"
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define ll long long
#define setbits(x) __builtin_popcountll(x)
#define pb push_back
#define mp make_pair
#define sz(x) (int)x.size()
#define f(i,a,n) for(int i = a ; i < n ; i++... |
#include <bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(0);cin.tie(0);
#define ll long long int
#define INFL 1e18L
#define INF 2e9
#define nl '\n'
#define ld long double
#define precision(x) fixed << setprecision(x)
const ll mod = 998244353;
ll gcd(ll a, ll b) {
if (b == 0) retur... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define endl "\n"
#define mod 1000000007
#define rep(i,n) for(int i=0;i<n;i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
int main() {
ios_base::sync_with_stdi... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#define rep(i,begin, end) for (ll i = begin; i < (ll)(end); i++)
using namespace std;
using ll = long long;
template<typename T>
using vec2 = vector<vector<T>>;
template<typename T>
using vec3 = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for(int i=0; i<n; i++)
#define REPi(i, a, b) for(int i=int(a); i<int(b); i++)
#define MEMS(a,b) memset(a,b,sizeof(a))
#define mp make_pair
#define MOD(a, m) ((a % m + m) % m)
template<class T>bool chm... |
/**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
const bool ready = [](){
ios_base::sync_with_stdio(false); cin.tie(0);
cout << fixed << setprecision(12);
return true;
}();
using ld=long double;
const ld PI = acos((ld)-1);
using ll= ... | #include<bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x...) do { cout << "\033[33;1m " << #x << " -> "; err(x); } while (0)
void err() { cout << "\033[39;0m" << endl; }
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x) { for (auto v: a) cout << v << ' ';... |
#include<bits/stdc++.h>
using namespace std;
const int N=505;
char pic[N][N];
int book[N][N];
const int mod=998244353;
vector<char> c[N*2];
int n,m;
struct node
{
int x,y,d;
};
queue<node> q;
int check(int p)
{
int b,r,d;
b=r=d=0;
for (int i=0;i<c[p].size();i++)
{
char x=c[p][i];
//p... | #include <bits/stdc++.h>
#define int long long int
#define all(x) x.begin(), x.end()
#define send ios_base::sync_with_stdio(false);
#define help cin.tie(NULL)
#define inf (int)(1e17+1)
#define mod (int)(998244353)
#define N (int)(2e5+5)
#define fi first
#define se second
#define endl "\n"
#define double long double
#de... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.