code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int p=998244353;
vector<int> a(200100);
vector<int> b(200100);
int powk(int k,int n){
int ans=1,m=k;
while(n){
if(n%2) ans=1ll*ans*m%p;
m=1ll*m*m%p; n/=2;
}
return ans;
}
int comb(int n,int k){
int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
const int M = 998244353;
int rep(int x) {
x %= M;
if (x < 0) x += M;
return x;
}
int add(int a, int b) {
return rep(a + b);
}
int mul(int a, int b) {
return rep(a * b);
}
int pw(int a, int b) {
int r = 1;
while (b) {... |
#include <bits/stdc++.h>
#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 MP make_pair
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int MOD = 998244353;
int N, a[105];
LL d[105], dp[10005][105];
int main()
{
scan... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
//*
int N;
cin>>N;
vector<int> W(N);
for (int &w: W)
cin>>w;
/*/
int N = 100;
vector<int> W(N, 100);
//*/
long long M = 998244353;
vector<vector<long long>> T(N+1, vector<lo... |
#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <list>
#define ll long long int
#define ull unsigned long long int
#define ld long double
using namespace std;
int main() {
long double N;
cin >> N;
... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VP... |
#include <iostream>
#include <algorithm>
#include <unordered_set>
#include <set>
#include <vector>
#include <queue>
#include <map>
#include <numeric>
#include <math.h>
#include <complex>
using namespace std;
#define rep(i, n) for (long long int i = 0; i < (long long int)(n); i++)
#define irep(i, n) for (long long int... | /*Bismillahi-r-Rahmani-r-Rahim*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pi acos(-1.0)
#define mod 1000000007
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
#define vi vector<int>
#define vl vector<ll int>
#define ... |
#include<bits/stdc++.h>
#define LL long long
#define pb push_back
#define SZ(x) ((int)x.size()-1)
#define ms(a,b) memset(a,b,sizeof a)
#define F(i,a,b) for (int i=(a);i<=(b);++i)
#define DF(i,a,b) for (int i=(a);i>=(b);--i)
using namespace std;
inline int read(){
char ch=getchar(); int w=1,c=0;
for(;!isdigit(ch);ch=g... | #include <bits/stdc++.h>
#include <bits/extc++.h>
#define FAST_IO ios::sync_with_stdio(false); cin.tie(0), cout << setprecision(15);
#define ll long long int
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rrep(i, k, n) for (ll i = k; i>=n; i--)
#define repp(i, k, n) for (ll i = k; i < (n); i++)
#define pb push... |
#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;
struct condition {
int x,y,z;
};
bool cmp(condition& a, condition& b) {
return a.x < b.x;
}
int main()
{
int n, m;
scanf("%d%d", &n, &m);
vector<condition> con(m);
for (int i=0; i<m; ++i)
scanf("%d%d%d", &c... | /*** author: yuji9511 ***/
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
using vll = vector<ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);... |
#include <bits/stdc++.h>
using namespace std;
// template {{{
#define range(i, l, r) for (int i = (int)(l); i < (int)(r); (i) += 1)
#define rrange(i, l, r) for (int i = (int)(r) - 1; i >= (int)(l); (i) -= 1)
#define whole(f, x, ...) ([&](decltype((x)) container) { return (f)( begin(container), end(container), ## ... | //clear adj and visited vector declared globally after each test case
//check for long long overflow
//while adding and subs check if mod becomes -ve
//while using an integer directly in a builtin function add ll
//Mod wale question mein last mein if dalo ie. Ans<0 then ans+=mod;
//Dont keep array name as size or any o... |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = 1e9 + 7;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int a,b;
cin >> a >> b;
int ans;
for(int i=b; i>=1; --i){
int low = (a+i-1)/i;
int high = b/i;
if (high - low + 1 >= 2){
... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#d... |
#include <bits/stdc++.h>
using namespace std;
int n,m,t;
int a[1005],b[1005];
int main() {
scanf("%d %d %d",&n,&m,&t);
for(int i=1;i<=m;i++) {
scanf("%d %d",&a[i],&b[i]);
}
int x=n;
for(int i=1;i<=m;i++) {
n-=(a[i]-b[i-1]);
if(n<=0) {
printf("No");
return 0;
}
n+=(b[i]-a[i]);
n=min(x,n);
}
n-=... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
#define reps(i, n) for (int i = 1; i <= (int) (n); i++)
#define all(a) (a).begin(), (a).end()
#define uniq(a) (a).erase(unique(all(a)), (a).end())
#define dump(a) cerr << #a " = " << (a) << endl
us... |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <unordered_set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
type... |
#pragma GCC optimize ("-O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
typedef pair<double,double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typed... |
// |--------------------------------------------|
// | User - Kunal Kumar |
// |--------------------------------------------|
#include <bits/stdc++.h>
#define pb push_back
#define mk make_pair
#define pf push_front
#define ppf pop_front
#define pii pair<int,int>
#define ll long long
#define pl... | #include "bits/stdc++.h"
#include<sstream>
using namespace std;
typedef long long ll;
#define _USE_MATH_DEFINES
#include <math.h>
#define NIL = -1;
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const long long inf = 1e18;
const ll INFL = 1e18;
const ll MOD = 1e9 + 7;
int digit(ll x) {
int digits = 0;
... |
#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#d... | #include <bitset>
#include <deque>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <algorithm>
#include <functional>
#include <iterator>
#include <locale>
#include <memory>
#include <stdexcept>
#include <utility>
#include <string>
#include <fstream>
#include <i... |
#include <iostream>
using namespace std;
typedef long long ll;
ll dp[110][110][5010],mod = 998244353,w[110],f[110];
int main(){
int i,j,k,n; cin >> n;
ll sum = 0;
for(i=0;i<n;i++){
cin >> w[i]; sum += w[i];
}
if(sum&1){
cout << 0 << endl;
return 0;
}
dp[0][0][0] = 1;... | #include "bits/stdc++.h"
#include <chrono>
#include <random>
#define lli long long int
using namespace std;
#define mod 1000000007
#define mod1 998244353
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define INF 1000000000
#define common cout << "Case #" << w+1 << ": "
#define maxn 20... |
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using ll = long long;
using vl = vector<long long>;
using vi = vector<int>;
int main(){
int n; cin >> n;
set<string> s1,s2;
string ans = "satisfiable";
vector<string> ss(n);
for(int ix=0;ix<n;ix++) cin >> ss.at(ix);
for(int i... | #include <bits/stdc++.h>
#define INF INT_MAX
#define ll long long
#define ull unsigned long long
#define rep(i,n) for(ll i=0; i<n; ++i)
#define FOR(i, s, e) for(ll i=s; i<e; ++i)
#define MOD 1000000007
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if(a>b) {a=b; return true;} return false;}
temp... |
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("avx,avx2,fma")
#include <string>
#include <bits/functexcept.h>
#include <iosfwd>
#include <bits/cxxabi_forced.h>
#include <bits/functional_hash.h>
#pragma push_macro("__SIZEOF_LONG__")
#pragma push_macro("__cplusplus")
#defin... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#include <limits>
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
using namespace std;
template<clas... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=1e6+7;
const int inf=INT_MAX;
const ll inff=1e18;
const ll mod=1e9+7;
#define pii pair<int,int>
#define mkp make_pair
#define F first
#define S second
#define pb push_back
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(),(v).... | /*
I love the sound you make when you shut up.
*/
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
/*----typedefs--------*/
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
using ll = long long;
using pi =... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long double R,x,y;
cin>>R>>x>>y;
long double d=sqrt((x*x)+(y*y));
long long ans=1;
long long s=ceil(d/R);
if(s==1&&d!=R)
{
ans++;
}
else if(s>1)
{
ans=s;
}
cout<<ans;
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <fstream>
#include <stack>
#include <vector>
#include <cctype>
typedef long long LL;
typedef unsigned long long uLL;
using namespace std;
const int int_INF = 0x7fffffe0;
const L... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
vector<pair<int, int>> p(n);
for(auto& [x, y] : p) cin >> x >> y;
for(int i = n; i--; ) for(int j = i; j--; ) for(int k = j; k--; ){
auto [x1, y1] = p[i];
auto [x2, y2] = p[j];
auto [x3, y3] = p[k];
... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<queue>
#include<set>
//#include<bits/stdc++.h>
#define int long long
constexpr long long mod = 1000000007;
#define for0(i, n) for(int i = 0; i < (n); i++)
#define for1(i, n) for(int i = 1; i <= (n);i++)
#define mp make_pair
#define all(x)... |
#include<bits/stdc++.h>
using namespace std;
double PI=acos(-1.0);
#define ll long long
#define pii pair<ll,ll>
const ll mod=998244353;
int a[500007];
int b[500007];
int main()
{
ios::sync_with_stdio(0);
int n;
cin>>n;
string s1,s2;
cin>>s1>>s2;
ll ans=0,ans1=0;
int num1=0,num2=0;
for(in... | //#include <bits/stdc++.h>
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define mod 998244353
#define pb push_back
#define S second
#define F first
#define inf 1e18
#define all(v) v.begin(), v.end()
#define deb(x) cerr << "\n" \
<< #x << "=" << x << "\n";
#define deb2(x, y) cerr << "\n" \
... | #include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <b... |
#include <bits/stdc++.h>
using namespace std;
vector<int> MODS = {int(1e9+7), 998244353};
template <int id>
struct Modular {
int value;
static int MOD() {return MODS[id];}
Modular(long long v = 0) { value = v % MOD(); if (value < 0) value += MOD();}
Modular(long long a, long long b) : value(0) { *this += a;... | #include<bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/detail/standard_policies.hpp>
// using namespace __gnu_pbds;
#pragma GCC optimize("O3")
#ifdef LOCAL
#include "/Users/lbjlc/Desktop/coding/debug_utils.h"
#else
#define print(...) ;
#define printn(...) ;
#de... |
// Problem: B - Do you know the second highest mountain?
// Contest: AtCoder - Mynavi Programming Contest 2021（AtCoder Beginner Contest 201）
// URL: https://atcoder.jp/contests/abc201/tasks/abc201_b
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include... | #include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long int
#define ld long double
using namespace std;
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
int main(){
fast;
int n;
cin >> n;
string s[n];
map<string, bool> mp;
for(int i = 0; i < n; ++i){
... |
#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>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
using ll = long long;
constexpr ll mod = 998244353;
bool solve() {
int n, m, t;
cin >> n >> m >> t;
int x = n, cur = 0;
rep(i, 0, m) {
int a, b;
cin >> a >> b;
if (x <= a - cur) return false;
x... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define faster ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define read freopen("in.txt", "r", stdin)
#define write freopen("out.txt", "w", stdout)
#define mem(x, n) memset(x, n, si... | #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>
struct node
{
char c;
node *pre, *suf;
node(char c) : c(c), pre(NULL), suf(NULL) {}
};
int main()
{
std::string s;
std::cin >> s;
node *hd = NULL, *tl = NULL, *cur = NULL;
bool dir = 0;
for (std::string::iterator it = s.begin(); it != s.end(); ++it)
{
... | /* Piyush Sharma*/
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main()
{
ll testcase = 1;
// ll testcase;
// cin >> testcase;
while (testcase > 0)
{
string s;
cin >> s;
deque<char> myqueue;
bool rev = false;
for (int i = 0; ... |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
#include<queue>
#include<cmath>
#include<cstdlib>
using namespace std;
#define LL long long
#define LD long double
#define DB double
int read(){
char ch=getchar();int x=0,fl=1;
for(;!isdigit(ch);ch=getchar())if(ch=='-')fl=-1;
... | #include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <cstdio>
#include <string>
#include <cmath>
#include <queue>
#include <tuple>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <random>
#include <set>
#include <sta... |
#include <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;
string s, t;
cin>>n>>s>>t;
vector<int> si, ti;
rep(i, n) if(s[i]=='0') si.push_back(i);
rep(i, n) if(t[i]=='0') ti.push_back(i);
int ans=-1;
if(si.siz... | #include <bits/stdc++.h>
using namespace std;
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
vector<string> vec_splitter(string s) {
s += ',';
vector<string> res;
while(!s.empty()) {
res.push_back(s.substr(0, s.find(',')));
s = s.substr(s.find(',') + 1);
}
return res;
}
void deb... |
// SmartCoder
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace __gnu_pbds;
using namespace std;
#define sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(), (c)... | #include <bits/stdc++.h>
int mod = 1e9 + 7;
int main(){
int N;
std::string Caa, Cab, Cba, Cbb;
std::cin >> N >> Caa >> Cab >> Cba >> Cbb;
std::map< std::string, int > cur;
std::map< std::string, int > next;
cur["AB"] = 1;
for(int i=2; i<5; i++){
for(auto itr=cur.begin(); ... |
#include <bits/stdc++.h>
//----***やべーやつら***----
using namespace std;
//----***型定義***----
using ll = long long;
using P = pair<ll,ll>;
//----***Like a Pythonista***----
#define REP(ii,jj,nn) for (ll ii=jj;ii<(nn);ii++)
#define RREP(ii,nn,jj) for (ll ii = nn; jj<ii;ii--)
#define each(i,...) for (auto&& i:__VA_ARGS__)
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#defin... |
#include <iostream>
#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>
#in... | #include <bits/stdc++.h>
#define MAX_N (200000 + 5)
#define LL long long
using namespace std;
const int mod = 998244353;
int n, m;
int inv[MAX_N];
int p[MAX_N], tot;
bool is[MAX_N];
int pw[MAX_N], f[MAX_N];
int main() {
scanf("%d%d", &n, &m);
inv[1] = 1;
for (int i = 2; i <= m; ++i) inv[i] = (LL)(mod - mod / i) * in... |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define lp(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
typedef long double ld;
using namespace std;
int sum(const string &a) {
int ret = 0;
for (int i = 0; i < 3; i++) {
ret += a[i] - '0';
}
return ret;
}
int main() {
ios_base:... | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#define code \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define int long long
#define endl '\n'
#define MM(a, b) memset(a, b, sizeof(a))
using namespace s... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
const string kAtcoder = "atcoder";
for (int i = 0; i < t; ++i) {
string s;
cin >> s;
const int n = static_cast<int>(s.size());
if (kAtcoder < s) {
cout << 0 ... | #define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include... |
#include <bits/stdc++.h>
using namespace std;
int main(){
float a,b,c;
float avg;
cin>>a>>b>>c;
avg=(a+b+c)/3;
if(avg==a || avg==b || avg==c){cout<<"Yes"<<endl;}
else{cout<<"No"<<endl;}
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define mod 1000000007
#define pie 3.14159265
#define int long long int
#define fr(i,a,n) for(int i=a;i<n;i++)
#define vi vector<int>
#define vlli vector<ll>
#define pb push_back
#define ppb pop_back
#define all(v) v.begin(),v.end()
#define fv(i,a) for(auto i:a)
void so... |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (long long i = (a); i < (long long)(b); i++)
#define IFOR(i, a, b) for (long long i = (a); i <= (long long)(b); i++)
using namespace std;
using VL = vector<long long>;
using ll = int64_t;
ll mod(ll x,ll m){ll y=x%m;re... | #include <cstdio>
#include <algorithm>
using namespace std;
int cm;
int g;
int jl;
int m1;
long long zm;
long long get(int x,int y){
if((y-x)%g!=0)
return 4e18;
int tmp=(y-x)/g;
long long tmpans=(1ll*jl*tmp%cm+cm)%cm;
return (1ll*tmpans*m1+x)%zm;
}
void exgcd(int a,int b,int &g,int &x,int &y){
if(!b){
x=1;
y... |
/*
Crimson coagulates
Severed head bouquet
Body incomplete
Sealer of your fate
Crimson calligraphy
Written on the trees
Creature from the grave
Headless and hellbent for me!
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ty... | #include <bits/stdc++.h>
using namespace std;
#define N 1000010
#define ll long long
ll n, a[N], rk[N], vis[N], ans[N];
inline void solve() {
scanf("%lld", &n);
int flag = 1, r = 0;
for (int i = 1; i <= n; ++i)scanf("%lld", &a[i]), rk[a[i]] = i;
for (int i = 1; i <= n; ++i) {
if (!flag)break;
... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,k;
string s;
int power(int l){
int m=1;
for(int i=1;i<=l;i++){
m*=2;
}
return m;
}
int revi(char a,char b){
if(a=='P'&&b=='R'){
return a;
}
if(a=='P'&&b=='S'){
return b;
}
if(a=='S'&&b=='P'){
return a;
}
if(a=='S'&&b=='R'){
re... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define repn(i,n) for(int i=1;i<=n;++i)
#define LL long long
#define pii pair <LL,LL>
#define fi first
#define se second
#define pb push_back
#define mpr make_pair
using namespace std;
const LL MOD=1e9+7;
LL n,q,a[200010],b[200010],depth[200010],st[2000... |
//In The Name Of Allah
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define F first
#define S second
//#pragma GCC optimize("Ofast")
const int maxn = 1000 + 5;
int n;
string s[maxn][2];
string inv(string ss)
{
for(int i = 0; i < ss.size(); i++)
ss[i] = (ss[i] == 'A' ? '... | #include <bits/stdc++.h>
#include <unordered_set>
#include <cmath>
#include <algorithm>
// #include <atcoder/all>
// URL:
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (int)(a); i++)
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
typedef long long ll;
template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const vec... | #include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rr... |
#include<bits/stdc++.h>
#include<math.h>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<vector>
#include<string>
#define MAXN 100005
#define Endl '\n'
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define up upper_bound
#define ll long long int
#define pii pair<ll,ll>
#define a... | #include <bits/stdc++.h>
#define ft first
#define sc second
#define pt(sth) cout << sth << "\n"
#define moca(a, s, b) a=((a)s(b)+MOD)%MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
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 ... |
#pragma GCC optimize ("-O2")
#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;
typedef tree<pair<int,int>, null_type, less<pair<int,int>>,
rb_tree_tag,
tree_order_statistics_node_update> ... | #include<bits/stdc++.h>
#define mxn 200005
#define ld long double
using namespace std;
ld res[mxn], deno[mxn];
bool vis[mxn];
int ara[12];
int main()
{
int n, m, k;
scanf("%d %d %d", &n, &m, &k);
for(int i=0; i<k; i++)
scanf("%d", &ara[i]), vis[ ara[i] ]= 1;
int mx= 0;
for(int i=0; i<=n; i++)
... |
#include<bits/stdc++.h>
#define mod 998244353
using namespace std;
int f[5001];
int inv[5001], fact[5001], invfact[5001];
int C(int a, int b) {
return 1ll*fact[a]*invfact[b]%mod*invfact[a-b]%mod;
}
int main() {
int n, m;
cin >> n >> m;
inv[1] = 1;
for (int i = 2; i <= n; i++) inv[i] = 1ll*(mod-mod/i)*inv[mod%i]%mo... | #include <bits/stdc++.h>
#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##_len=(b);i<i##_len;++i)
#define MSVC_UNKO(x)x
#define rep(...)MSVC_UNKO(_overload3(__VA_ARGS__,repi,_rep,_rep)(__VA_ARGS__))
#define all(c)c.begin(),c.end()
#define write(x)cout<<(x)<<'... |
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll N, ai;
cin >> N;
vector<ll> A(N, 0), B(N, 0), C(N, 0);
for (ll i = 0; i < N; i++) {
cin >> ai;
A[ai - 1]++;
}
for (ll i = 0; i < N; i++) cin >> B[i];
for (ll i = 0; i < N; i++) cin >> C[i];
vector<ll> BC(N, 0... | //インクルードなど
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
//イテレーション
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define FORA(i,I) for(const auto& i:I)
//x:コンテナ
#define ALL(... |
#include <bits/stdc++.h>
using namespace std;
// vtqi6hy80o@email.edu.pl
#define rep(i, a, b) for(lli i = a; i < b; i++)
#define lli long long int
#define ld long double
#define all(v) v.begin(), v.end()
#define hell 1000000000000000
#define pb push_back
#define pf push_front
#define vi vector<lli>
#define vip vector<p... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
template<class T> void chmin(T& a, T b) {
if (a > b) {
a = b;
}
}
int main(){
ll N;
cin >> N;
vector<ll> T(N);
for(int i = 0; i < N; i++){
cin >> T.at(i);
}
sort(T.begin(), T.end());
do... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<int, ll> il;
typedef vector<ii> vii;
typedef vector<il> vil;
typedef vector<li> vli;
#define F first
#define S ... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#define F first
#define S second
#define all(x) begin(x), end(x)
#define allr(x) rbegin(x), rend(x)
using ll = long long;
using ull = unsigned long long;
using ld = long double;
constexpr ll INF = 2e18;
const... |
#include <bits/stdc++.h>
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define ld long double
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define mkpr make_pair
#define fi(i,a,b) for ... | #include <iostream>
#include<string>
#include <math.h>
#include<vector>
#include<algorithm>
#include <iomanip>
#include<map>
using ll = long long;
using namespace std;
int main() {
int n, k; cin >> n >> k;
int ans = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= k; j++) {
int x = i * 100 + j;
ans +=... |
/*
// editorial used
author : aryan57
created : 22-May-2021 21:32:36 IST
*/
#include <bits/stdc++.h>
using namespace std;
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typenam... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <map>
#define amax(a, b) a = std::max(a, b)
#define amin(a, b) a = std::min(a, b)
using ll = long long;
int dfs(int i, std::vector<int> &depth, std::vector<std::vector<int>> &tree, std::vector<int> &in, std::vector... |
#include <bits/stdc++.h>
#include <cmath>
#define fl(i,a,b) for(long long i=a;i<b;i++)
#define test long long t_c;cin>>t_c;for(long long ks=1;ks<=t_c;ks++)
#define pb push_back
#define vi vector<int>
#define all(x) x.begin(),x.end()
#define cy cout<<"YES\n";
#define cn cout<<"NO\n";
#define nl cout<<endl;
#define ca... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
int n,q;cin>>n>>q;
vector<ll>a(n);
for(int i=0;i<n;i++)cin>>a.at(i);
sort(a.begin(),a.end());
for(int i=0;i<q;i++){
ll k;cin>>k;
ll old=(ll)(lower_bound(a.begin(),a.end(),k+1)-a.begin());
ll kk=k+old;
ll now=(ll)(lowe... |
#include <vector>
#include <set>
#include <iostream>
#include <algorithm>
#include <string>
#include <utility>
#define mod % 998244353
#define MAX 998244353
#define ll long long
using namespace std;
int main() {
int high,wide,k;
cin >> high;
cin >> wide;
cin >> k;
ll ans = 0;
if(high == wide and high == 1... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
typedef long long ll;
using pint = pair<int,int>;
ll mod = 1000000007,mod2 = 998244353;
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1;... |
#include<bits/stdc++.h>
using namespace std;
typedef struct Point {
int x,y,z;
}Point;
int f(Point a ,Point b){
int v1 = abs(a.x - b.x);
int v2 = abs(a.y - b.y);
int v3 = max(0,b.z - a.z);
return v1+v2+v3;
}
int main(){
int n; cin>>n;
Point a[n];
int x,y,z;
for(int i=0;i<n;i++) { cin>>x>>y>>z; a[i]={x,y,z}; ... | //---------------------------------------------------------------
#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 (ll i = 0... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#ifdef ENABLE_DEBUG
#define dump(a) cerr<<#a<<"="<<a<<endl
#define dumparr(a,n) cerr<<#a<<"["<<n<<"]="<<a[n]<<endl
#else
#define dump(a)
#define dumparr(a,n)
#endif
#... | #include <bits/stdc++.h>
#define random mt19937 r(chrono::steady_clock::now().time_since_epoch().count())
#define S second
#define F first
#define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define pb push_back
#define all(x) x.begin(),x.end()
#define int long long
#define txin ifstream cin("input.... |
#line 1 "B.cpp"
#include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = std::int_fast64_t;
using std::cout;
using std::cerr;
using std::endl;
using std::cin;
template<typename T> std::vector<T> make_v(size_t a, T b){return std::vector<T>(a, b);}
template<typename... Ts> auto make_v(size_t ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(x, a, b) for (int x = a; x <= b; x++)
#define FOD(x, a, b) for (int x = a; x >= b; x--)
#define REP(x, a, b) for (int x = a; x < b; x++)
#define RED(x, a, b) for (int x = a; x > b; x--)
void solve() {
int n, m, t, s, e = 0;
cin >> n >> m >> t;
in... |
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
constexpr int MOD = 1000000007;
constexpr int INF = numeric_limits<int>::max() / 2;
typedef pair<int,int> P;
using Graph = vector<vector<int>>;
template<class T> inline bool chmax(T& a, T b) { if (a ... | #include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define print(x) cout << (x) << endl
typedef long long ll;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
using namespace std;
using Graph = vector<vector<int>>;
int main(){
int n; cin >> n;
int ma, mi;
mi = 0;
vector<int> c(200001,... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define int ll
const int MAX = 2e5 + 10;
const int modn = 1e9 + 7;
const int INF = 0x3f3f3f3f3f3f;
int a[MAX];
int n;
void init(){
int ans=1;
for(int i=n-1;i>=0;i--){
a[i]=ans%7;
ans=(ans*10)%7;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define d long double
#define scf(n) scanf("%d",&n)
#define lscf(n) scanf("%lld",&n)
#define dscf(n) scanf("%Lf",&n)
#define pri(n) printf("%d ",(int)n)
#define lpri(n) printf("%lld ",n)
#define dpri(n) printf("%Lf ",n)
#define prin(n) printf("%d\n",(... |
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> VI;
typedef vector<VI> VVI;
typedef pair<ll, ll> P;
#define FOR(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(i,n) FOR(i,0,n)
#define PRINT(V) for (auto v : (V)) cout << v << " "
#define ALL(n) begin(n),end(n)
struct cww{cww(){ios:... |
#include<bits/stdc++.h>
using namespace std;
#define pi 3.1415926535
#define int long long
#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 sz(x) (int)x.size()
#define f(i,a,n) for(int i = a ; i < n ; i+... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend... |
#include <iostream>
#include <algorithm>
using namespace std;
int primer[] = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29 };
int cnt[10];
int main() {
int n;
cin >> n;
for (int i = 2; i <= n; ++i) {
int x = i;
for (int j = 0; j < 10; ++j) {
int c = 0;
while (x % primer[j] =... | #include<stdio.h>
#include<math.h>
#include<string.h>
#define ni(n) ((n) * (n))
#define rep(i,n) for(i=0;i<n;i++)
#define N 100050
int main(void){
int a;
int i;
int sum = 0;
rep(i,2){
scanf("%d",&a);
sum += a;
}
if(sum == 0) printf("0");
else if(sum == 4) printf("2");
else printf("%d",3-sum);
return 0;
... |
#include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define input_output freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
template <typename Arg1>
void prn(Arg1&& arg1) { cout<<arg1<<"\n";}
temp... | #include <bits/stdc++.h>
using namespace std;
// #define LOCAL // 提出時はコメントアウト
#define DEBUG_
typedef long long ll;
const double EPS = 1e-9;
const ll INF = ((1LL<<62)-(1LL<<31));
typedef vector<ll> vecl;
typedef pair<ll, ll> pairl;
template<typename T> using uset = unordered_set<T>;
template<typename T, typename U> us... |
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
#include <bitset>
us... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define all(x) (x).begin(),(x).end()
using namespace std;
constexpr int INF = 1e9, MOD = 1e9 + 7;
constexpr int64_t LINF = 5e18, LMOD = 998244353;
// #include <atcoder/all>
// using namespace atcoder;
// const int dy[]={0,-1,0,1,1,-1,-1,1};
// const int dx[... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rrep(i, n) for (ll i = 1; i < (ll)(n + 1); i++)
int digsum(ll N){
bool a=true;
ll ans=0;
while(a==true){
if(0<N){
ans+=N++;
N... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
bool cmp(pair<ll,ll>a,pair<ll,ll>b){
ll suma = 2*a.first+a.second;
ll sumb = 2*b.first+b.second;
return suma > sumb;
}
int main(){
ll n,k;
cin>>n;
vector<pair<ll,ll>>vp;
ll d=0,t=0,cnt;
for(int i=0;i<n;i++)
{
ll a,b;... |
#include <bits/stdc++.h>
#define fo(a,b,c) for (a=b; a<=c; a++)
#define fd(a,b,c) for (a=b; a>=c; a--)
#define ll long long
//#define file
using namespace std;
int n,m,i,j,k,l;
char f[101][101];
char a[101];
char work(char c1,char c2)
{
if (c1==c2) return c1;
if (c1=='R')
{
if (c2=='S') return c1;
return c2;
... | #include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define db(a) cout << fixed << #a << " = " << a << endl;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<char, char> pcc;
char solve(string S, int k) {
assert(!S.empty());
if (k == 0) return S[0];
if ((int) S.size() % 2... |
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using PP = std::pair<ll,P>;
#define REP(i,b,e) for(int i=b; i<e; i++)
#define PRINT(vec) {printf("[ ");for(auto &i:vec)printf("%ld ",i);puts("]");}
#define fi first
#define se second
const int MOD = 1e9+7;
int dx[] = {0, 1, 0, -1, 1, 1, -1, ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n,m;
cin >> n >> m;
vector<int> a(n);
vector<int> b(m);
for (int i=0;i<n;i++) cin >> a[i];
for (int i=0;i<m;i++) cin >> b[i];
vector<int> nums(1001,0);
for (int i=0;i<n;i++) {
nums[a[i]]++... |
/*
#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;
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);
#define int long long
#define ll long long
#define ld long dou... | #include<bits/stdc++.h>
//#include<atcoder/all>
using namespace std;
//using namespace atcoder;
int main(){
int N,M,K;
cin>>N>>M>>K;
set<int> A;
int Aa[N];
for(int i=0;i<N;i++) Aa[i]=0;
for(int i=0;i<K;i++){
int Ain;
cin>>Ain;
Aa[Ain]=1;
A.insert(Ain);
}
... |
#include <bits/stdc++.h>
using namespace std;
#ifndef aa
#define trace(...)
#define endl '\n'
#endif
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define fi first
#define se second
#define int long long
typedef long long ll;
typedef long double ld;
#define double long double
#define pii pair<int,... | #include <bits/stdc++.h>
using namespace std;
//#define MULTITEST
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define sqr(a) ((a) * (a))
#define sz(a) int(a.size())
#define all(a) a.begin(), a.end()
#define forn(i, n) for(int i = 0; i < int(n); i++)
#define fore(i, l, r) for(int i ... |
#include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define st first
#define nd second
#define pii pair<int,int>
#define mp make_pair
using namespace std;
const int nax = 5e5 + 5;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int n; cin>>n;
string s,t; cin>>s>>t;
int bal ... | #include <bits/stdc++.h>
using namespace std;
const int N = 500005;
int n;
char s[N], t[N];
int solve() {
scanf("%d", &n);
scanf("%s", s);
scanf("%s", t);
vector<int> v1, v2;
for (int i = 0; i < n; ++i) {
if (s[i] == '1') v1.push_back(i);
if (t[i] == '1') v2.push_back(i);
}
long long ans = 0;... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <cmath>
#include <set>
//#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define all(v) v.begin(), v.end()
#define front(v) *v.begin()
#define back(v) *(--v.end())
#define len(v) v.size()
#define int long long
using lo... | #include<stdio.h>
#include <iostream>
#include <string>
#include<vector>
using namespace std;
int main()
{
long A, B;
cin >> A;
cin >> B;
long sum = 0;
vector<long> Ea, Eb;
int C;
if (A<B)
{
for (int i = 1; i <= B; i++)
{
Eb.push_back(i*-1);
i... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << " , " << #y << "=" << y << endl
typedef pair<int, int>ii;
typedef pair<ll, ll>pl;
typedef vector<int>vi;
typedef vector<ll>vl;
typedef... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = int64_t;
#define rep(i, j, n) for (int i = j; i < (n); ++i)
#de... |
#include <bits/stdc++.h>
#define int long long
using namespace std;
long long n, ans;
int judge(int x, int s) {
if(x * s * 10 + x <= n) return 1;
else return 0;
}
signed main() {
scanf("%lld", &n);
long long tmp = n, len = 0;
while(tmp) len ++, tmp /= 10;
for(int i = 2;i <= len; i += 2) {
... | #include <bits/stdc++.h>
#define forloop(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define ll long long int
#define ld long double
#define pb emplace_back
#define ravi ios_base::sync_with_stdio(false);
#define parmar2002 cin.tie(NU... |
//BELIEVE IN YOURSELF
//next_permutation
#include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define pb push_back
#define pob pop_back
#define vi vector<ll>
#define mp make_pair
#define sz size()
#define rep1(i,n) for(ll i=1;i<=n;i++)
#define rep(i,n) for(ll i=0;i<n;i++)
#define fast ios::sync_wi... | #include<bits/stdc++.h>
#define rep(i,n) for(int i = 0 ; i < (n); ++i)
using namespace std ;
typedef long long ll ;
const int mod=1000000007;
const int INF=1e5 ;
pair<int,int> dir[4]={{0,1},{1,0},{-1,0},{0,-1}};
void solve(){
int h,w ;
cin>>h>>w ;
vector<string> s(h) ;
rep(i,h){
cin>>s[i] ;
}
queue<pair<i... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
int n;
cin>>n;
int a[n];
int b[n];
ll ans = 100000000000000 ;
for(int i = 0 ; i < n ; i++){
cin>>a[i]>>b[i];
ll ch = a[i]+b[i] ;
ans = min(ans,ch);
}
for(int i = 0 ; i < n ; i++... | #include <bits/stdc++.h>
using namespace std;
// a + (a+1) + ... + b
long sum(const long &a, const long &b) { return (a + b) * (b - a + 1) / 2; }
int main() {
int T;
cin >> T;
while (T--) {
long L, R;
cin >> L >> R;
const long minC = L;
const long maxC = R - L;
if (minC > maxC) {
c... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin >> a >> b;
int y=(b-a)/2;
y=-y;
int x=a-y;
cout << x << " " << y << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<ll(n);i++)
int main() {
ll a, b;
cin >> a >> b;
cout << (a+b)/2 << ' ' << (a-b)/2 << endl;
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define ll long long
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
int ma = 0;
rep(i,n){
cin >> a[i];
ma = max(ma, a[i]);
}
vector<int> ans(ma+1);
rep(i,ma+1){
rep(j,n)... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(void){
vector< int > usd(10001, 0);
vector< int > a = {6, 10, 15};
usd[6] = usd[10] = usd[15] = 1;
for(int i = 6; i <= 10000; i++){
if(usd[i] == 1) continue;
if((i%2==0) + (i%3==0) + (i%5==0) >= 2){... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define eps 1e-9
#define INF 2000000000 // 2e9
#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)
#define all(x) (x).begin(), (x).end()
#define sq(x) ((x) * (x))
#ifndef LOCAL
#define dmp(...) ;
#else
#d... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int x = 2 * i, y = x + 1;
while (x > n) x -= n;
while (y > n) y -= n;
cout << x << " " << y << '\n';
}
} |
#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include... | //ki-ence A
#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main(){
ll n;
cin >> n;
vector<vector<ll>> kusa(2,vector<ll>(n));
rep(i,2){
rep(ii,n){
cin >> kusa.at(i).at(ii);
}
}
ll max1 = ku... |
#include <bits/stdc++.h>
#pragma GCC target("arch=skylake-avx512")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<long, int>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rrep(i, n) for (int i = 1; i < (int)... | #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) begin(v), end(v)
#define sz(v) v.size()
#define INF 1e18+9
#define EPSILON 1e-14
template <typename T>
bool chmax(T &a, const T& ... |
//Codeforcesで128bit整数を使いたいとき
//→__int128_tを使う&GNU C++17 (64)で提出する
//インクルードなど
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tu... | #pragma GCC optimize(2)
//#include <bits/stdc++.h>
#include <iostream>
#include <set>
#include <cmath>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
#include <vector>
#include <utility>
#include <map>
#define rush() int T; while(cin>>T) while(T--)
#define ms(a,b) memset(a,b,sizeof ... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int, int>;
using T = tuple<int,int,int>;
using T2 = tuple<int,int,int, int>;
using Q = tuple<int,int,int, int, int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
void cout_line(v... | #include <iostream>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <tuple>
#include <string>
#include <list>
#include <map>
using namespace std;
long long int min(long long int a,long long int b){
if(a>b){
return b;
}else{
r... |
//ABHISHEK AGRAWAL,BIT mesra//
//Author: Abhishekagrawal
//Date: 30/05/2021
//Time: 15:57:20
#include<bits/stdc++.h>
using namespace std;
#define booga cout << "booga" << endl
#define int long long int
#define pb push_back
#define f first
#define s second
#define mod 10... | #include <iostream>
using namespace std;
int main(void){
//prayer
int M, H;
cin >> M >> H;
if (H % M == 0){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define range(a) a.begin(), a.end()
#define endl "\n"
#define Yes() cout << "Yes" << endl
#define No() cout << "No" << endl
#define MP make_pair
using P = pair<int, int>;
const... | #include<bits/stdc++.h>
using namespace std;
int main(){
int h,w;
cin>>h>>w;
//(i,j)から a[i][j][k]にいける
vector<vector<vector<pair<int,int>>>>go(h,vector<vector<pair<int,int>>>(w,vector<pair<int,int>>(0)));
go.push_back(vector<vector<pair<int,int>>>(26,vector<pair<int,int>>(0)));
pair<int,int>S,G;
vector<... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define pb push_back
#define mp make_pair
#define sz(s) (int)s.size()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(a) a.begin(),a.end()
#define allr(a) a.rbegin(),a.rend()
#define rep(i,a,b) for(int i = a; i... | #include<iostream>
#include<vector>
#include<cmath>
using namespace std;
#define ll long long
ll maxn[200005];
ll minn[200005];
ll dp[200005][2];
ll n;
int main(){
cin>>n;
for (int i=0;i<200005;i++) {
maxn[i]=-1e10;
minn[i]=1e10;
}
for (int i=0;i<n;i++){
ll x,c;cin>>x>>c;
... |
#include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(ll i = 0;i < (ll)n;++i)
#define rrep(i,n) for(int i=int(n-1);i>=0;i--)
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define coy cout... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
const int MX = 1505;
bool visited[MX][MX];
bool memo[... |
#include<bits/stdc++.h>
#define pb push_back
#define int long long
using namespace std;
int tt,n,p=200001;
void solve(){
cin>>n;
int ax[n],ay[n];
for(int i=0;i<n;i++){
cin>>ax[i]>>ay[i];
ax[i]*=p;ax[i]+=i;
ay[i]*=p;ay[i]+=i;
}
sort(ax,ax+n);sort(ay,ay+n);
set<int> s;
s.insert((ax[n-1]%p+p)%p);
s.insert((a... | /*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 r... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
ll a,b,c,d;
cin >> a >> b >> c >> d;
ll ans=0;
if(b>=c*d){cout << -1 <<endl;return 0;}
ll e=0;
while(a>e*d){
a+=b;
e+=c;
ans++;
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
for( int i = 0; i < 1000; i++ ) {
int si, sj, ti, tj;
cin >> si >> sj >> ti >> tj;
string ans;
if( si < ti ) {
ans += string( ti - si, 'D' );
}
else if( si > ti ) {
ans += string( si - ti, 'U' );
}
if( sj < tj ) {
ans += string( tj -... |
#include<bits/stdc++.h>
#include<unordered_map>
#include<unordered_set>
#include<iomanip>
#define IOS cin.tie(0), ios::sync_with_stdio(false)
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N ... | // Arti1990, II UWr
#include <bits/stdc++.h>
#define forr(i, n) for(int i=0; i<n; i++)
#define FOREACH(iter, coll) for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll) for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,R,PRED)... |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S, numero;
unordered_map<char,int> frequencia;
int fator, tamanho, r;
cin>>S;
tamanho = S.size();
if(tamanho==1){
if(S[0]=='8'){
printf("Yes");
}
else{
printf("No");
}
... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
int main() {
string S; cin >> S;
if (S.size() == 1) {
if (S == "8" || S == "0") cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}... |
#include <bits/stdc++.h>
using namespace std;
#define endl ("\n")
#define pi (3.141592653589)
#define mod 1e9+7
#define int long long
#define float double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(c) c.begin(), c.end()
#define min3(a, b, c) min(c, min(a, b))
#define min4(a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int m = 0;
cin >> N;
vector<tuple<int, int, int>> av(N);
int a, p, x;
priority_queue<int, vector<int>, greater<int>> bv;
for(int i = 0; i < N; i++) {
cin >> a >> p >> x;
av.at(i) = make_tuple(x, p, a); }
for(int i = 0; i < N; i+... |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define endl "\n";
#define mod 1000000007
#define loop(i,s,n) for(ll i=s;i<n;i++)
#define test ll t; cin>>t; while(t--)
#define p push_back
#pragma GCC target ("avx2")
#pragma GCC optimization ... | #include<bits/stdc++.h>
#define ll long long int
#define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define mod 1000000007
#define N 100100
using namespace std;
ll power(ll x,ll y)
{
ll res = 1;
while(y)
{
if(y&1) res = (res*x)%mod;
y=y/2;
x=(x*x)%mod;
}
retu... |
#include<bits/stdc++.h>
#define N 105
#define M 100005
using namespace std;
int n,t[N],m,f[M]={1};
int main(){
cin>>n;
for(int i=1;i<=n;i++)cin>>t[i],m+=t[i];
for(int i=1;i<=n;i++)
for(int j=m;j>=t[i];j--)f[j]|=f[j-t[i]];
for(int i=(m+1)/2;i<=m;i++)
if(f[i])cout<<i<<endl,exit(0);
return 0;
} | /* CREATED BY
STREAM_CIPHER
dec-2020
*/
#include<bits/stdc++.h>
using namespace std;
void __print(long long x) {cerr << x;}void __print(unsigned long long x) {cerr << x;}void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}void __print(const char *x) {cerr << '\"' << x << '... |
/*One cannot escape the feeling ... that these mathematical formulae have
an independent existence and an intelligence of their own ... that they
are wiser than we are, wiser even than their discoverers ... that we get
more out of them that was originally put into them.
*/
#include<bits/stdc++.h>
using namespace std;
... | // -----------------------------------
// author : MatsuTaku
// country : Japan
// created : 11/08/20 20:48:16
// -----------------------------------
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr); ios::sync_with_stdio(false);
int n; cin>>n;
ll x; cin>>x;... |
#include<bits/stdc++.h>
#define L(i, j, k) for(int i = j, i##E = k; i <= i##E; i++)
#define R(i, j, k) for(int i = j, i##E = k; i >= i##E; i--)
#define ll long long
#define ull unsigned long long
#define db double
#define pii pair<int, int>
#define mkp make_pair
#define push_back psb
using namespace std;
void Min(int ... | #include <bits/stdc++.h>
#include <numeric>
// #include <atcoder/modint>
using namespace std;
// using namespace atcoder;
// using mint = long double;
// using mint = modint998244353;
// using mint = modint1000000007;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> T;
typedef pair<ll, vector<ll> > P... |
#include <iostream>
#include <vector>
#include <stdio.h>
#include <climits>
using namespace std;
typedef long long ll;
ll ans = 0;
int countway(int i, int j, vector<vector<bool>> tMb, vector<vector<int>> T,int N) {
//(i,j)のまわりのマップtMbのfalseのマス目を返す
int ans = 0;
if (i - 1 > -1 && !tMb.at(i - 1).at(j)&& T.at(i).at(j)!... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int mex(const vector<int> &a, const int i, const int m){
for(int ret=0; ret<100; ++ret){
bool has_value = false;
for(int j=i; j<i+m; ++j){
if(a[j] == ret){
has_value = true;
break;
... |
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
#define maxn 3e5+50
using namespace std;
typedef long long ll;
typedef unsi... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) fo... |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
int n;
cin>>n;
int a[(1<<n)];
int maxi = -1,ind;
for(int i=0;i<(1<<n);i++) {
cin>>a[i];
if(maxi<a[i]){
maxi=a[i];
ind=i;
}
}
if(ind >= (1<<(n-1)) ){
maxi=-1;
... | #include <bits/stdc++.h>
using namespace std;
#define fr(i,a,b) for(int i=a;i<b;i++)
#define pb push_back
#define speed ios::sync_with_stdio(false), cin.tie(0) , cout.tie(0)
#define fillm(m,r,c,k) fr(i,0,r)fr(j,0,c)m[i][j]=k;
#define prm(m,r,c) fr(i,0,r){fr(j,0,c){cout<<m[i][j]<<" "; }cout<<endl;}
#define pr(a,n)fr(... |
// #define ONLINE_JUDGE
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifndef ONLINE_JUDGE
# define dbg(x) cerr << '#' << #x << ' ' << x << endl
# define TIME cerr << "RuningTime: " << clock() << "ms\n", 0
#else
# define dbg(x)
# define TIME 0
#endif
#define mem(a,b) memset(a,b,sizeof(a))
... | #pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
#include <bits/stdc++.h>
#include<set>
#include <array>
using namespace std;
#define ll long long
#define endl '\n'
#define mod 998244353
#define pb push_back
#define ff first
#define ss second
#define con continue
#define ub upper_bound
#define lb lower_bou... |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
const int maxn = 500 + 10;
const int M_MAX = 10 * maxn * maxn;
const int mod = 1e9 + 7;
const LL INF = 0x3f3f3f3f;
const double eps = 1e-6;
struct edge {
int to, cost, next;
}e[5000010];
int... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>... |
#include <bits/stdc++.h>
#include <cmath>
using ll = long long;
const ll INF = 1LL<<60;
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
if(a > 0 && b > 0) {
if(a > b) {
cout << ">" << endl;
} else if(a < b) {
cout << "<" << endl;
} else ... | #include <bits/stdc++.h>
using namespace std;
// Athor : Roshan Mitra 😎
// Language: C++
// College: Symbiosis Institute Of Technology
// Practice is the only key to success
// Always push ur limits
typedef pair<int, int> pii;
#define endl "\n"
#define set_bits(a) __builtin_popcountll(a)
#define f0(i, n) for (int i =... |
#include <bits/stdc++.h>
using namespace std;
using namespace chrono;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
int main()
{
int x, y;
cin >> x >> y;
if (x == y)
{
cout << x << endl;
}
else
{
cout << (0 ^ 1 ^ 2 ^ x ^ y) << endl;
}
return 0;
} | #include<stdio.h>
int main(void)
{
int x, y;
int z;
scanf("%d %d", &x, &y);
if(x == y){
z = x;
}
else if(x != y){
z = 3 - (x+y);
}
printf("%d",z);
return(0);
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,ans=0;
set<pair<ll,ll>> e,o;
pair<ll,ll> w,x,y,z;
int main(){
cin>>n;
ll a[n],b[n];
for(int i=0;i<n;i++)cin>>a[i];
for(int i=0;i<n;i++)cin>>b[i];
for(int i=0;i<n;i++){
if(i%2==0)e.insert({a[i]-b[i],i});
else o.insert({a[i]-b[i],i});
}
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
#define fastIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define rep(i, n) for(ll i = 0; i < (n); ++i)
#define rep1(i,n) for(ll i = 1;i <= (n); ++i)
#define pb push_back
#define noofones(a) _... |
#include <bits/stdc++.h>
using namespace std;
const int mod=998244353;
char s[5010][5010];
int n,m,k,dp[5010][5010],ksm[5010],r[5010][5010],d[5010][5010];
void qmo(int &x){
x+=(x>>31)&mod;
}
int main(){
scanf("%d%d%d",&n,&m,&k);
for(int i=1,x,y;i<=k;i++){
scanf("%d%d",&x,&y);
scanf(" %c",&s[x][y]);
}
dp[1][1]=... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 10;
#define ll long long
#define lowbit(i) ((i) & -(i))
struct Fenwick {
vector<int>a;
int n;
Fenwick (int n):a(n),n(n){}
void update(int x,int w)
{
for (int i = x;i < n;i += lowbit(i))
a[i] += w;
}
i... |
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstd... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (long long i = 0; i < (n); i++)
using ll = long long;
const int INF = (1 << 30) - 1;
const ll LINF = (1LL << 60) - 1;
const double PI = acos(-1);
int main() {
ll h, w; cin >> h >> w;
vector<string> s(h);
rep(i, h) cin >> s[i];
vector... |
// EXPLOSION!
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<... | #pragma GCC optimize("Ofast")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(0); cin.tie(0);
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define ff first
#define ss second
#define ins insert
#define sz(x) (int)x.size... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.