code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#define _USE_MATH_DEFINES
#include <iomanip>
#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <tuple>
#include <climits>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef vector<double> VD;
t... | // #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> // in... |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl '\n'
//#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define boostIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define rep(i, b) for (int i = 0; i < b; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define rrep(i, b, a) for ... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pb push_back
//#define mp make_pair
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, r, l) for(int i = r; i >= l; i--)
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, i... |
#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;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#defin... | //#include <atcoder/all>
#include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, ma... |
#include <iostream>
#include <string>
using namespace std;
int main()
{
int H, W;
cin >> H >> W;
string S[100];
for (int i = 0; i < H; i++)
{
cin >> S[i];
}
int answer = 0;
for (int i = 0; i < H; i++)
{
for (int j = 0; j < W; j++)
{
if (j != W ... | #include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007LL
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define SHIFT(n) (1LL<<((ll)n))
#define ALL(a) (a).begin(),(a).end()
#define Max(a) (*max_eleme... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template < typename T_cont... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... |
#include <iostream>
#include <map>
#include <vector>
#include <set>
#include <cmath>
#include <algorithm>
#include <utility>
#include <limits.h>
#include <cstring>
using namespace std;
const int N = 200005;
int n, s[N], e[N], tim = 1;
vector<int> adj[N];
vector<int> lvl[N];
int cnt(int idx, int l, int r)
{
return u... | #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, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_... |
/**
* author:
* created: 15.11.2020 22:52:52
**/
#pragma region Macros
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using P = pair<int,int>;
using ll = long long;
const int INF = 1001001001;
const int di[] = {-1,0,1,0}, dj[] = {0,-1,0,1};
typedef vector<int> vi;
typedef vector<vi> v... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include<cmath>
#define ll long long
using namespace std;
int main(void){
ll num,pro;
cin >> num;
cin >> pro;
bool ans = true;
vector<ll> start(num);
vector<ll> end(num);
vector<ll> use(num);
for(int i = 0;i < num;i ++){
... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
return (int)c - (int)zero_num;
}
void co... | #include<stdio.h>
using ll=long long;
constexpr int mod=1000000007;
int N,M,K,inv[2000000]={1,1};
int main(){
for(int i=2;i<2000000;++i)inv[i]=ll(inv[mod%i])*(mod-mod/i)%mod;
for(int i=2;i<2000000;++i)inv[i]=ll(inv[i])*inv[i-1]%mod;
scanf("%d %d %d",&N,&M,&K);
ll p=1;
for(int i=2;i<=N+M;++i)(p*=i)%=mod;
i... |
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<sstream>
#include<cstring>
#include<cstdio>
#include<string>
#include<deque>
#include<cmath>
#include<queue>
#include<set>
#include<map>
using namespace std;
std::set<long long> numSet;
bool isPrime(long long num) {
if (num == 2)
return true;
if ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <stdlib.h>
#include <functional>
#include <cmath>
#include <unordered_set>
using namespace std;
int main()
{
long N;
cin >> N;
unordered_set<long> s;
for(long i = 2; i*i <= N; i++){
long exp = i*i;
while(exp <= N){
... |
#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 <atcoder/all>
//using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(int i=0; i<n; i++)
#define REPR(i, n) for(int i=n-1; i>=0; i--)
#define FOR(i, m, n) for(int i=m; i<n; i++)
#define ALL(v) v.begin(), v.end()
#define bit(n) (1LL<<(n))
#define FI... |
#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 PI 3.141592653589793238462
#define eps 1e-20
#define fi first
#define se second
using namespace std;
using cd = complex<double>;
typedef long long ll;
typedef long double db;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<db,db> pdd;
struct ppp{ll t,x,y;}c[200005];
ll a... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int v, t, s, d;
cin >> v >> t >> s >> d;
if (v * t <= d && d <= v * s) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
}
| #include <iostream>
#include <bits/stdc++.h>
#include <cstdio>
#include <stack>
#include<algorithm>
using namespace std;
int main() {
int X, Y;
cin >> X >> Y;
if (max(X, Y) < min(X, Y) + 3) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
|
#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <string>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const ll M = 998244353;
long long myMod(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a%... | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1e9 + 7;
const int64_t MOD2 = 998244353;
const int INF = 1e9;
const long long inf = 1LL<<60;
int main() {
long long a, b, c;
cin >> a >> b >> c;
a %= 10;
long long num = a;
vector<int> A(10, 0);
vector<int> loopA;
A.at(num) = 1;
loopA.p... |
#include <bits/stdc++.h>
using namespace std;
#define mod (int)(1e9+7)
#define num 100007
#define ll long long int
#define endl '\n'
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define test0 ;
#define test1 int t;cin>>t;for(int i=1;i<=t;i++)
#define test2 int t;cin>>t;for(int i=1;i<=t;i++) cout<<"Case... | #include <iostream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <algorithm>
#include <math.h>
#include <cassert>
#define rep(i,n) for(int i = 0; i < n; ++i )
using namespace std;
using ll = long long;
int main() {
int n;
cin ... |
#include<bits/stdc++.h>
#define pb emplace_back
#define pf first
#define ps second
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define Endl '\n'
#define codejam cout<<"Case #"<<t<<": ";
#define pl pair<ll,ll>
#define mod 1000000007
#define INF 1000000001
#define forn(i,n) for(ll i=0;i<n;i++)
#d... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <utility>
#include <tuple>
#include <cmath>
#include <numeric>
#include <set>
#include <map>
#include <array>
#include <complex>
#include <iomanip>
#include <cassert>
#include <random>
using ll = long long;
using std:... |
#include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph= vector<vector<int>>;
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll i=n;i<=m;i++)
#define rep3(i,n,m) for(ll i=n;i>=m;i--)
#define p... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#defin... |
// #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#define int long long
#define all(a) a.begin(), a.end()
#define vi vector<int>
#define pii pair<int, int>
#define fe(i, a, b) for (int i = a; i <= (b); ++i)
#define fr(i, a, b) for (in... | #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 <cstdio>
#include <cstring>
#include <cmath>
#include <cassert>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <iostream>
#include <numeric>
/* debug macros */
#ifdef WAFDAYO
#define DBG_LINE() {std::cerr<<"\e[2m[L"<<__LINE__<<... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_set>
... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll is_valid(double x1, double y1, double x2, double y2) {
if(y1 >= x2 && x1 <= x2) {
return 1;
}
if(x1 <= y2 && x2 <= x1) {
return 2;
}
if(x1 <= x2 && y1 >= y2) {
return 3;
}
if(x2 <= x1 && ... | #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<ll, null_type, less<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long
#define ld long double
#define ull unsigned ... |
#include <iostream>
#include <vector>
using namespace std;
void solve() {
int n;
cin >> n;
vector<pair<int, int>> ps(n);
for (auto& [l, r] : ps) {
int t;
cin >> t >> l >> r;
l *= 2, r *= 2;
if (t > 2) ++l;
if (t % 2) ++r;
}
int ans = 0;
for (int i ... | //Codeforcesで128bit整数を使いたいとき
//→__int128_tを使う&GNU C++17 (64)で提出する
//インクルードなど
#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... |
#include <bits/stdc++.h>
#include<cmath>
#include<string>
#define pb push_back
#define x first
#define y second
#define fast ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define all(x) x.begin(),x.end()
#define int long long
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
//... | #include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int,int> II;
typedef tuple<int,int,int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
// minmax
te... |
/*
*/
#include<bits/stdc++.h>
#define _USE_MATH_DEFINES
using namespace std;
#define ll long long int
#define ld double
#define pb push_back
#define eb emplace_back
#define rep(i , j , n) for(ll i = j ; i < n ; i++)
#define pre(i , j , n) for(ll i = j ; i >= n ; i--)
#define all(x) x.begin(), x.end()
typedef ... | #include <iostream>
#include <string>
#include <vector>
#include <utility>
#include <cmath>
#include <map>
#include <algorithm>
#include <set>
#include <queue>
using ll=long long;
using namespace std;
using pii = pair<int,int>;
int main(){
int N,Q;
cin>>N;
vector<pii> E;
vector<vector<int>> G(N);
... |
#include<iostream>
#include<vector>
#include<map>
#include<stack>
#include<stdlib.h>
#include<math.h>
#include<string>
#include<string.h>
#include<set>
#include<algorithm>
#define Doura() ios_base::sync_with_stdio(false),cin.tie(NULL), cout.tie(NULL)
#define ll long long
using namespace std;
int main()
{
Doura();
... | /*
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>
using namespace std;
#define rep(i,n) for (int i =0;i<(n);++i)
using ll = long long;
using P = pair<int, int>;
int A[2000][2000];
int score[2000][2000];
int H,W;
const int INF = 1001001001;
int calc(int i,int j,int t){
if(i==H-1&&j==W-1)return 0;
else if(score[i][j]!=INF)return score... | #include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;
template<class T> constexpr... |
//BISMILLAHIR RAHMANIR RAHIM
//INNALLAHA_MA_AS_SABIRIN
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define __ <<" "<<
#define loop(m,n) for(m=0;m<n;m++)
#define loop1(m,n) for(m=1;m<=n;m++)
#define rloop... | #include <iostream>
using namespace std;
int main(){
int T;
long c;
cin >> T;
for(int t=0; t<T; t++){
cin >> c;
if(c%2!=0){
cout << "Odd" << endl;
} else if(c%4!=0){
cout << "Same" << endl;
} else{
cout << "Even" << endl;
}
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
return (ull)rng() % B;
}
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n; cin >> n;
ll X; cin >> X;
v... | #include<bits/stdc++.h>
using namespace std;
#define _rep(i, x, y) for(int i = (int)x; i < (int)y; ++i)
#define _dep(i,x,y) for(int i = (int)x; i > (int)y; i--)
#define PII pair<int,int>
#define eb emplace_back
#define pb push_back
#define fi first
#define se second
#define PQ priority_queue
#define lb lower_bound
#def... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for (long long i = 0; i < (n); ++i)
#define INF LONG_MAX/3
//#define DIV 1000000007
//#define DIV 998244353
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, con... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
//#include <atcoder/convolution>
//#incl... |
#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep1(i,n) for (int i = 1; i <= (n); ++i)
#define bit(n,k) ((n>>k)&1) //nのk bit目
#define vec(T) vector<T>
#define vvec(T) vector<vector<T>>
using ll = long long;
using ... | #include<bits/stdc++.h>
typedef long long ll;
#define int long long
using namespace std;
const int p=1e4;
int read(){
string s;cin>>s;
int t=4;
int f=0;
int ans=0;
for(auto i:s){
if(i=='.'){
f=1;
continue;
}else{
ans=ans*10+(i-'0');
if(... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
const ll INF=0x3f3f3f3f3f3f3f;
const double pi=3.1415926535897932384626;
inline ll read(){
ll x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-') f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9'){
x=(x<<1)+(x<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin>> n >> m;
vector<pair<int, int>> a(m);
for (auto& [A, B] : a) cin>> A >> B;
int k; cin>> k;
vector<pair<int, int>> b(k);
for (auto& [C, D] : b) cin>> C >> D;
int ans = 0;
for (int bit=0; bit<(1<<k); bit++)... |
#include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
using namespace std;
// #pragma GCC optimize("O3","unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC target("avx2")
using namespace __gnu_pbds;
template... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin>>S;
int cnt=0;
for(int i=0;i<9;i++){
string T=S.substr(i,4);
if(T=="ZONe") cnt++;
}
cout<<cnt<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f1 first
#define s2 second
#define fastio ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define debug(x...) cerr << "[" << #x << "]: " << x << "\n";
typedef long long ll;
typedef long double ld;
typedef pair<int, in... | #include<bits/stdc++.h>
//#define int long long int
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define loop(i,n) for(int i=0;i<(int)(n);i++)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fastm_fast ios_base::sync_with_stdio(false);cin.tie(NULL); cout.tie(NULL)
#define pb push... |
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,m;
int main()
{
scanf("%d%d",&n,&m);
if(n==1&&m==0)
{
printf("1 2\n");
return 0;
}
if(m<0||m>=n-1)
{
printf("-1\n");
return 0;
}
m++;
printf("1 %d\n",2*m+2);
for(int i=1;i<=m;i++)
printf("%d %d\n",i*2,i*2+1);
for(int ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int N,L;
vector<int> A(1e5+10), B(1e5+10), C, high(1e5+10), low(1e5+10);
main() {
cin >> N >> L;
C.push_back(0);
for (int i = 1; i <= N; i++) {
cin >> A[i];
C.push_back(A[i]-i);
}
C.push_back(L-N);
int ... |
#include<bits/stdc++.h>
using namespace std;
int to_int(char c){ return c-'0'; }
string s[3];
int n;
void solve(){
bool flag=1;
for(int i=0;i<3;++i)
if(to_int(s[i][0])+to_int(s[i][n+n-1])==2) flag=0;
if(flag){
for(int i=1;i<=n;++i) putchar('1');
putchar('0');
for(int i=1;i<=n;++i) putchar('1');
}else{
put... | #include <bits/stdc++.h>
using namespace std;
const int N = 100000 + 9;
char s[5][N];
void solve(){
int n; scanf("%d", &n);
scanf("%s %s %s", &s[1][1], &s[2][1], &s[3][1]);
for (int i = 1; i <= n; ++i) putchar('1');
for (int i = 1; i <= n; ++i) putchar('0');
putchar('1'); putchar('\n');
}
int ma... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e6+5;
ll v[N],p[N],a[N];
int main()
{
ll n;cin>>n;
for(int i=1;i<=n;i++) cin>>a[i];
ll ans=0;
for(int i=1;i<=n;i++)
{
ll sum=0;ll pos=a[i];
for(int j=i;j<=n;j++)
{
if(a[j]>=pos) sum+=pos;
else break;
}
for(int j... | #include <bits/stdc++.h>
using namespace std;
const int N = 510;
int n;
int a[N][N];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n;
int mn_idx = 1;
bool ok = true;
for (int i = 1; i <= n; ++i) {
for (int j = 1, del; j <= n; ++j) {
cin >> a[i][j];
if (i > 1) {
if (j == 1)... |
#include<bits/stdc++.h>
using namespace std;
long long n,x,a;
int main()
{
cin>>n>>x;
for(int i=1;i<=n;i++)
{
cin>>a;
if(a!=x)
{
cout<<a<<" ";
}
}
return 0;
} | //----------BHAVIK DIWANI(PICT_COMP)---------------
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define test ll t; cin>>t; while(t--)
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define mod 1000000007
#define ll long long
#define int long... |
#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)) f|=ch=='-',ch=getchar();
while(isdigit(ch)) x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
x=f?-x:x;
}
template <typename T>
inline void print(T x){
if(x<0) putc... | #include<iostream>
#include<vector>
#include<bits/stdc++.h>
#define mod 1000000007
#define pi 3.14159265358979
#define PRE(x,p) cout<<setprecision(x)<<p;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define endl "\n"
#define high INT_MAX
#define low INT_MIN
#define ll lon... |
#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<(n); i++)
#define reps(i,s,n) for(int i=(s); i<(n); i++)
#define all(v) v.begin(),v.end()
#define outve(v) for(auto i : v) cout << i << " ";cout << endl
#define outmat(v) for(auto i : v){for(auto j : i) cout << j << " ";cout << endl;}
#define in(n,v) for(int i=0;... |
#include<bits/stdc++.h> //---------------------------------------------------------------
# define ll long long
# define mod 1000000007
# define MAX 100005
# define PI 3.141592653589793238 ... | #include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<queue>
#include<vector>
#include<stack>
#include<sstream>
#include<algorithm>
#define... |
#include<bits/stdc++.h>
using namespace std;
const int p = 31;
const int m = 1e9 + 7;
typedef long long ll;
typedef int in;
#define ff first
#define ss second
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsi... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll maxn=3e5+10;
const ll mod=1e9+7;
const ll m2=1e9+7;
const ll INF64 = ll(1e18);
const ll max2=10500000;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
//long long t... |
#include<bits/stdc++.h>
#define ll long long int
#define pll pair<ll,ll>
#define vpll vector< pll >
#define mpll map<ll,ll>
#define MOD 1000000007
#define all(v) v.begin(),v.end()
#define s(v) v.size()
#define test ll t;cin>>t;while(t--)
#define vec vector<ll>
#define read0(v,n) for(int i=0;i<n;i++)cin>>v[i];
#define r... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... |
#include <bits/stdc++.h>
#define int long long
#define double long double
#define ff first
#define ss second
#define endl '\n'
#define ii pair<int, int>
#define mp make_pair
#define mt make_tuple
#define DESYNC \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.ti... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
template<class T> bool chmin(T& a,T b){if(a>b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a,T b){if(a<b) {a = b; return true;} return fa... |
/*
ll fastmod(ll x,ll y)
{
ll res=1;
if(x%mod==0)
return 0;
while(y>0)
{
if(y&1)
res=(res*x)%mod;
y=y>>1;
x=(x*x)%mod;
}
return res;
}
}*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fo(i,n) for(ll i=0;i<n;i++)
#define Fo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll N;
cin >> N;
unordered_set<ll> s;
for(ll a = 2; a * a <= N; a++){
ll x = a * a;
while(x <= N){
s.insert(x);
x *= a;
}
}
cout << N - s.size() << endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define FOR(i, n) for(int (i)=0; (i)<(n); (i)++)
#define FOR1(i, n) for(int (i)=1; (i)<=(n); (i)++)
#define FORI(i, n) for(int (i)=n-1; (i)>=0; (i)--)
template<class T, class U> void umin(T& x, const... | #include <bits/stdc++.h>
using namespace std;
constexpr int mod = 1000000007;
long long dp[3005][3005],sum[3005][3005],tmp[3005][3005];
int main() {
int N;
cin >> N;
vector<long long>A(N);
for(int i = 0; i < N; i++) {
cin >> A[i];
}
for(int i = 0; i < N; i++) {
long long tmp2 ... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;
const int N = 2e5 + 10;
int n, ans[N], timer;
bool diametr[N];
vector <int> g[N];
pair<int, int> dfs1(int u, int p) {
pair<int, int> tmp = {0, u}, cur;
for (int to : g[u]) {
if (to == p) continue;
cur =... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constex... |
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
using namespace std;
typedef long long LL;
typede... | #include<bits/stdc++.h>
using namespace std;
namespace Sakurajima_Mai{
#define ms(a) memset(a,0,sizeof(a))
#define repi(i,a,b) for(int i=a,bbb=b;i<=bbb;++i)//attention reg int or reg ll ?
#define repd(i,a,b) for(int i=a,bbb=b;i>=bbb;--i)
#define reps(s) for(int i=head[s],v=e[i].to;i;i=e[i].nxt,v=e[i].t... |
/*
AUTHOR: nit1n
CREATED: 23.01.2021 22:00:57
*/
#include<bits/stdc++.h>
#define int long long
using namespace std ;
const int N = 65 ;
vector<string> a(N) ;
int dp[N][2][2] ,n ;
int solve(int idx , bool flag){
if(idx > n){
return ((flag)?1 : 0) ;
}
if(dp[idx][flag][0] != -1 && dp[idx][... | #define taskname "test"
#include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
#define fi first
#define se second
typedef long long lli;
typedef pair<int, int> pii;
const int maxn = 1e5 + 5;
int n;
int a[maxn], b[maxn];
void read_input()
{
cin >> n;
for(int i = 1; i <= n; ++i)
... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
#define int long long
signed main(){
int n;cin>>n;
vector<int> x(n),y(n);
REP(i,n)cin>>x[i]>>y[i];
int m;cin>>m;
vector<int> a(m+1),b(m+1),c(m+1),d(m+1),e(m+1),f(m+1);
a[0]=e[0]=1;
b[0... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define sz(a) ((int)a.size())
#define re return
#define all(a) a.begin(),a.end()
#define int long long
#define Type int
#define rept(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,a) rept(i,0,a)
using namespace std;
const int dx[4]={-1,1,0,0};
const int ... |
#pragma GCC optimize("O3", "unroll-loops")
#pragma GCC target("avx2")
#include <iostream>
#include <iomanip>
constexpr int HeighestDim = 505000;
int n, m, k;
long long int res[101];
int dim_a = 0, dim_b = 0;
int A[HeighestDim + 1], B[HeighestDim];
void mult_a(int v){
for(int i = dim_a, j = i - v; j >= 0; --i, --... |
#include <bits/stdc++.h>
#define ll long long
#define sz(x) ((int) (x).size())
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
#define pii pair<int, int>
#define rep(i, a, b) for(int i = (a); i < (b); i++)
using namespace std;
template<typename T>
using minpq = priority_queue<T, vector<T>, greater<T>>;
... |
#include<bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
#define mod 1000000007
#define rep(i,be,en) for(int i=be;i<=en;i++)
const int INF = 0x3f3f3f3f;
const ll inf=0x3f3f3f3f3f3f3f3f;
//const double pi=acos(-1);
using namespace std;
const int N=2e5+7;
const int M=1e6+7;
inline int read(){
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using ll = long long;
int main() {
int n;
cin >> n;
cout << (n % 2 == 0 ? "White" : "Blac... |
#include <iostream>
using namespace std;
typedef long long ll;
int main()
{
ll s, p;
cin >> s >> p;
for(ll i = 1; i * i <= p; i++){
if(p % i == 0 && i + p / i == s){
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, w;
cin >> n >> w;
cout << n / w << endl;
return 0;
} |
//#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cos... | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
using ll=long long;
using P = pair<int,int>;
int main(){
int N;
cin >> N;
int vec[N];
for(int i=0;i<N;i++){
cin >> vec[i];
}
int x,X;
while(1){
sort(vec,vec+N);
x=vec[0],X=vec[N-1];
... |
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
double r, x, y;
double p;
inline bool check()
{
double c = p / r;
if(int(c) * r == p) return 0;
return 1;
}
int main()
{
scanf("%lf%lf%lf", &r, &x, &y);
p = 1.0 * sqrt(x * x + y * y);
if (check()) printf("%d\n", int((p - r) / r) + 2)... | #include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
// using T = tuple<int,int,int>;
using P = pair<int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
return (int)c - (int)zero_num;
}
sig... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define deb(...) cerr << "[" << #__VA_ARGS__ << "] : [", DBG(__VA_ARGS__)
void DBG() { cerr << "]\n";}
template<typename T, typename ...Args> void DBG(T first, Args... args)
{cerr << first; if(sizeof...(args))cerr<<", "; DBG(args...); }
void solve(){... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <random>
#include <chrono>
#include <tuple>
#include <random>
#include <cmath>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fastInp cin.tie(0); cout.tie(0)... |
#include "bits/stdc++.h"
#include <iomanip>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define int ll
typedef pair<int,int> pii;
#define fi first
#define se second
#define Sort(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; i++)
#define REP(i,n) for(int i = 0;i < (n) ; i++... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
const int MAX = 2e5;
vector<map<int,int>> mp(MAX);
class Union_Find{
vector<int> par; vector<int> rank; vector<int> num;
public:
Union_Find(int n) {
par = vector<int>(n); rank = vector<int>(n,0... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<n;i++)
using P = pair<int,int>;
using Edge = struct { int to; int cost; };
const int INF = 1e9;
vector<int> a,b,c;
int n,m;
// s: スタート位置, g: 隣接リストグラフ
vector<int> dijkstra(int s, vector<vector<Edge>> g) {
vector<int> dist(g.size(), INF);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define REP2(i, x, n) for (ll i = x; i < (n); i++)
#define PR(x) cout << (x) << "\n"
#define PS(x) cout << (x) << " "
#define PRYES(x) PR((x) ? "Yes" : "No")
const lo... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,x,man=0,che=0;
double eu=0;
int main(){
cin>>n;
for(int i=0;i<n;i++){
cin>>x;
man+=abs(x);
eu+=abs(x*x);
che=max(che,abs(x));
}
eu=sqrt(eu);
printf("%ld",man);
cout<<endl;
printf("%.15lf",eu);
cout<<endl;
printf(... | #include<bits/stdc++.h>
#define ll long long int
const ll MOD = 1e9+7;
const ll inf = 1e18+5;
using namespace std;
#define debug() for(ll l=0;l<50;l++){}
#define fast cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
ll bs(ll arr[], ll l, ll r, ll x){
ll mid=0;
if (r >= l){
if (arr[mid] == x) return mid;
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvl = ... | #include <bits/stdc++.h>
using namespace std;
#define show(a) for(auto e:a)cout<<e<<" ";cout<<endl
#define size(a) static_cast<int>((a).size())
int main(){
const long long mod = 1e9 + 7;
int n;
cin >> n;
vector<long long> a(n);
for(int i = 0; i < n; ++i) cin >> a.at(i);
vector<vector<long long>> dp(4, vect... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
ll mod_pow(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
int popcount(int x) {
in... | #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; cin >> N;
vector<int> A(N, 0);
REP(i, 0, N) {
int a; cin >> a;
A[--a] = 1;
}
if (... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
string s[n];
map< string , int > mp;
for(int i = 0 ;i < n ;i++){
cin >> s[i];
if(s[i][0] == '!') mp[s[i].substr(1)]++;
}
for(int i = 0 ; i < n ; i++){
if(s[i][0] != '!' && mp.find(s[i]) != mp.end()){
cout << s[i] << endl;... | //-- In the name of ALLAH --
// We're nothing and you're everything.
// Ya Ali!
#include<bits/stdc++.h>
using namespace std;
#define pai acos(-1)
#define ff first
#define ss second
#define ll long long
#define pb push_back
#d... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define drep(i,n) for (int i = (n)-1; i >= 0; --i)
#define dup(x,y) (((x)+(y)-1)/(y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const l... | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
int main(){
int a[3];
cin >> a[0] >> a[1] >> a[2];
int b, c, d;
sort(a, a+3);
cout << a[1] + a[2] << endl;
} |
//void __(){
// _(int,n);
// rep(i,1,n){
// print (i*2-1)%n+1, (i*2+1-1)%n+1;
// }
//}
//
//
#include <iomanip>
#include <vector>
#include <utility>
#include <iostream>
#include <string>
#define REP_INT(i,l,r) for(int i = (l); i <= (r); ++i)
#define GET_REP_MACRO(_1,_2,_3,_4,NAME,...) NAME
#define rep(.... | #include "bits/stdc++.h"
using namespace std;
// 定義
typedef long long ll;
typedef pair<ll, ll> P;
#define ALL(x) (x).begin(),(x).end()
#define REP(i, n) for(ll i = 0 ; i < (ll)n ; ++i)
#define REPN(i, m, n) for(ll i = m ; i < (ll)n ; ++i)
#define VL vector<ll>
#define... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
int n;
cin >> n;
vector<ll> a(n);
rep(i,n)cin >> a[i];
ll ans=LLONG_MAX;
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define REP(i,n) for(ll i=0;i<(n);i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORC(i,a,b,c) for(ll i=(a);i<(b);i+=(c))
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define f... |
#include <bits/stdc++.h>
using namespace std;
int a,b=105;
int main()
{
cin>>b;
for(int i=1;i<=3;i++)
cin>>a,b=min(b,a);
cout<<b<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N ,S,T,U,U2,T2,V;
cin >> N ;
U = 0;
V = 0;
T2 = 0;
vector<long long> vec1(N);
for (long long i = 0 ; i < N ; i++){
cin >> vec1.at(i);
T = vec1.at(i) * vec1.at(i) * (N - 1 - i);
T2 ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, c) for (int i = 0; i < (int)c; i++)
using ll = long long;
const ll mod = 998244353;
ll func(ll n) { return (n * (n + 1) / 2) % mod; }
int main() {
ll A, B, C;
cin >> A >> B >> C;
ll ans = ((func(A) * func(B)) % mod) * func(C);
cout << ans % mo... | #include <bits/stdc++.h>
using namespace std;
#define FastIO ios_base::sync_with_stdio(false),cin.tie(NULL);
#define endl "\n"
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define irep(i,a,b) for(int i=a;i>=b;i--)
#define ip(V,n) vector<float> V(n); for(int _i=0;_i<n;_i++) cin>>V[_i]
#define op(V,sep) for(int _i=0;_i<V.siz... |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
inline int read () {
int ret = 0, t = 1;
char c = getchar();
while ((c < '0' || c > '9') && c != '-') c = getchar();
if (c == '-') t = -1, c = getchar();
while (c >= '0' && c <= '9') ret = ret * 10 + c - '0', c = g... | #include <bits/stdc++.h>
using namespace std;
#ifdef _DEBUG
#include "_DEBUG.hpp"
#endif
#define int long long
const long long inf = 2e18;
const int mod = 1e9 + 7;
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (T &in : v) is >> in;
return is;
}
template <class T>
vector<T> make_vec(s... |
#include <bits/stdc++.h>
using namespace std;
#define INF (int)1e9
#define MOD 1000000007
#define PI 3.1415926535897932384626433832795
//
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<string> vstr;
typedef vector<pii> vpii;
typedef vector<vint> vvi;
t... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
void get(int n, vector<int>& oct) {
vector<int> vec1(100);
int k = 0;
while (n != 0) {
vec1[k] = n % 8;
n = n / 8;
k++;
}
for (int j = k - 1; j >= 0; j--) oct.push_back(vec1[j]);
}
int main() {
ios:... |
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+1e3+7;
int T,n,fa[N];
int find(int x)
{
return x==fa[x]?x:fa[x]=find(fa[x]);
}
signed main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
fa[i]=i;
for(int i=1;i<=n;i++)
{
int x;
scanf("%d",&x);
fa[find(x)]=fi... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define P pair<ll,ll>
using Graph = vector<vector<P>>;
//累乗 aのb乗、正しmを法として求める
long long pw(long long a,int b,int m){
if(b==0) return 1;
else if(b%2==0){
long long x = pw(a,b/2,m);
ret... |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define print(x) cout << (x) << endl
typedef long long ll;
using P = pair<int,int>;
using Graph = vector<vector<int>>;
//const ll MOD = 1000000007;
const ll MOD = 998244353;
void solve() {
int h, w, a, b; cin >> h >> w >> a >> b;
... | #include<bits/stdc++.h>
#include<fstream>
using namespace std;
#pragma GCC optimize ("Ofast")
#define all(x) x.begin() , x.end()
#define mp make_pair
#define gcd __gcd
typedef long long int ll;
typedef pair<ll , ll> pll;
typedef pair<int , int> pii;
typedef long double db;
typedef pair<ll , pll> plll;
typedef pair<... |
#include<bits/stdc++.h>
#define ll long long
#define mod 998244353
using namespace std;
int n;
int calc(int x, int m){
if (x >= (m << 1)) x -= m << 1;
if (x >= n) x -= m;
return x + 1;
}
int main(){
scanf("%d", &n);
int m;
for (m = 1; (m << 1) <= n; m <<= 1);
for (int i = 0; i < n; i++)
... | #include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
//#define int long long
//const int N = ;
inline int read()
{
int X=0;bool flag=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')flag=0;ch=getchar();}
while(ch>='0'&&ch<='9'){X=(X<<1)+(X<<3)+ch-'0';ch=getchar();}
if... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, x, y;
cin >> a >> b >> x >> y;
int Q, R, S;
Q = x * 2;
//同じ階の場合
if(a == b) cout << x << endl;
//下りの場合
else if(a > b){
R = a - b - 1;
cout << min(R * y + x, R * Q + x) << endl;
}
//上りの場合
else{... | #include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
long long power(long long base, long long val)
{
int ans = 1;
for (long long i = 0; i < val; ++i) {
ans *= base;
}
return ans;
}
long long count_point(long... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 0x3f3f3f3f;
const int mod = 998244353;
const int N = 15e5 + 5;
map<int,int> mp;
int a[N];
int main()
{
int n,m;
cin >> n >> m;
int minn = 0;
for(int i = 1; i <= n; i++){
cin >> a[i];
if(i <= m){
mp[a[i]]++;
}
}
for(int i... | #ifdef __LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using PIL = pair<int,ll>;
using PLI = pair<ll,int>;
using PLL = pair<ll,ll>;
using Graph = vector<vector<int>>;
using Cost_Graph = vector<vector<PIL>>;
template<class T> bool chmin(... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<vector<ll>> memo(31, vector<ll>(31, -1));
ll f(int a, int b) {
if (memo[a][b] != -1) return memo[a][b];
if (a == 0) {
return 1;
}
if (b == 0) {
return 1;
}
ll va = f(a - 1, b);
ll vb = f(a, b - 1);
memo[a][b] = va + vb;
return va + ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FOR(i, a, b) for(int i = (int)a; i <= (int)b; i++)
#define DEC(i, a, b) for(int i = (int)a; i >= (int)b; i--)
typedef pair<int, int> pi;
typedef pair<pi, int> pii;
typedef pair<pi, pi> pipi;
#define f first
#define s sec... |
#include <bits/stdc++.h>
using namespace std;
signed main(){
int N;
scanf("%d", &N);
if(N % 2 == 0){
printf("White\n");
}
else{
printf("Black\n");
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
long long l;
cin >> l;
long long ans =1;
for(int i = 1; i<=11; i++){
ans *= l-i;
ans /= i;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
#define getbit(n, i) (((n) & (1LL << (i))) != 0)
#define setbit0(n, i) ((n) & (~(1LL << (i))))
#define setbit1(n, i... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
double ans = 0;
for (int i = 1; i <= n; ++i) {
ans += 1.0 / i;
}
ans = n * ans - 1;
cout << fixed << setprecision(12) << ans << '\n';
return 0;
}
|
//Relive your past life.
//Face your demons.
//The past is never dead,it is not even past.
//The memories are not only the key to the past but...also to the future.
//coded in Rusty Lake
#include<cmath>
#include<math.h>
#include<ctype.h>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<c... | #include<iostream>
#include<vector>
#include<set>
#include<queue>
#include<map>
#include<algorithm>
#include<cstring>
#include<string>
#include<cassert>
#include<cmath>
#include<climits>
#include<iomanip>
#include<stack>
#include<unordered_map>
#include<bitset>
#include<limits>
#include<complex>
#include<array>
#includ... |
#include<bits/stdc++.h>
using namespace std;
#define int int64_t
#define all(v) v.begin(),v.end()
#define mp make_pair
#define space ' '
#define INF (1LL<<60)
#define graph vector<vector<edge>>
template<class T>int chmin(T &a,const T &b){if(b<a){a=b;return 1;}return 0;}
struct edge{int to;int cst;edge(int to,int cst):t... | #include <bits/stdc++.h>
using namespace std;
/* エイリアス */
#define ll long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define endl '\n'
#define fi first
#define se second
#define pb push_b... |
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
using namespace std;
ll n , m , cnt, ans , sum;
ll x , y , z;
ll a , b , c;
string s , s1;
char ch;
vector<string>v;
int main(){
ll arr[4];
for( int i = 0;i < 4;i ++ )
cin >> arr[i];
sort( arr , arr + 4 );
cout <<... | // 2020-12-13 21:00:20
// clang-format off
#include <bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i =... |
#include<bits/stdc++.h>
using namespace std;
int read() {
char c=getchar(); int x=0,f=1;
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;
}
vector<pair<int,int> > odd[100005],even[100005];
vector<int> G[100005];
int a[100005],b[1... | #include <algorithm>
#include <iostream>
#include <queue>
using namespace std;
struct Tree
{
int n;
int r;
int l;
std::vector<std::vector<int>> prit;
std::vector<std::vector<int>> t;
std::vector<int> par;
std::vector<int> dpt;
std::vector<int> tour;
std::vector<std::vector<int>> app... |
#include<cstdio>
#include<cctype>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#define LL long long
using namespace std;
template <class I>
inline void read(I &z)
{
z=0;
char c=getchar();int base=1;
while (... | #include<bits/stdc++.h>
#define int int64_t
#define pb push_back
#define endl '\n'
#define pll pair<int,int>
#define vll vector<int>
#define all(a) (a).begin(),(a).end()
#define x first
#define y second
#define sz(x) (int)x.size()
#define hell ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
typedef long double ld;
typedef pair<int,int> pii;
#define x first
#define y second
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
set<string> yes,no;
while(n--)
... |
#include<bits/stdc++.h>
using namespace std;
#define vec vector<int>
#define vecp vector<pair<int,int>>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define fr first
#define sc second
#define fr1(i,a,b) for(int i=a;i<b;i++)
#define fr2(i,a,b) for(int i=a;i>=b;i--)
#define fr3(i,a,b) for(int... |
#ifdef _DEBUG
#include "../../../library/src/debug_template.hpp"
#define DMP(...) dump(#__VA_ARGS__, __VA_ARGS__)
#else
#define DMP(...) ((void)0)
#endif
#include <cassert>
#include <cstdio>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <set>
#include <map>
#inclu... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
class Graph{
int V;
list<int> *adj;
int *exist;
public:
Graph(int N){
V=N;
adj=new list<int> [N];
exist= new int [N];
memset(exist,0,sizeof(exist));
}
void AddEdge(int x,int y){
... |
///****In the name of ALLAH, most Gracious, most Compassionate****//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <ll, ll> pii;
const int N=2e5+5;
pii x[N];
#define func(xi) (2*xi.first + xi.second)
inline bool cmp( pii x, pii y)
{
return func(x) < func(y);
}
int32_t ma... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n, s) for (int i = (s... |
#include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using V = vector<int>;
int main()
{
int x, y, z;
cin >> x >> y >> z;
int a = 0;
while (x*a < y*z) {
++a;
}
--a;
cout << a << endl;
... | #include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const long long MOD = 1000000007;
ll n,... |
/// hhoangcpascal
#include <iostream>
#include <algorithm>
#define llong long long
using namespace std;
const llong mod = 1e9+7;
llong prefix[3006], dp[3006][3006], tmp[3006];
int n;
int main() {
ios_base::sync_with_stdio(0); cin.tie(NULL);
cin >> n;
for(int i = 1; i <= n; ++i) {
llong a; cin >... | //AUTHOR: RAVAN_2070
//PUNE INSTITUTE OF COMPUTER TECHNOLOGY
/*
I ♥ CLARICE STARLING...
EXPLAINATION BELOW->
*/
#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull... |
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("O2")
//#pragma GCC optimize("O3")
////#pragma GCC optimize("unroll-loops")
////
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define allp(x) (x)->begin(), (x)->end()
#d... | #include<bits/stdc++.h>
using namespace std;
#define N 100005
struct ji{
int nex,to,len;
}edge[N<<2];
int E,n,m,x,y,z,head[N],vis[N],pd[N],ans[N];
void add(int x,int y,int z){
edge[E].nex=head[x];
edge[E].to=y;
edge[E].len=z;
head[x]=E++;
}
void dfs(int k){
vis[k]=1;
for(int i=head[k];i!=-1;i=edge[i].nex)
if (... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define F first
#define S second
#define Tsetso ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define pr pair < int , int >
const int N = 2e5+10,NN = 1005, length = 25 , mod = 1e9+7, inf = 1e9;
vector < int > g[N];
int co... |
//================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<iostream>
#include<algorithm>
#include <cmath>
#include <string>
using namespace std;
int main()
{
int n, x;
string s;
cin >> n >> x;
cin >> s;
for (int i = 0; i < n; i++)
{
if (s[i] == 'o')
{
x++;
}
if (s[i] == 'x')
{
if (x == 0)
{
continue;
}
else
{
x--;
}
}
}
... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
#define int long long int
#define pb push_back
#define mp make_pair
#define pll pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
#define setbits(x) __builtin_popcountll(x)
#define md (ll)1e9 + 7
#define inf ... |
#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>;
using vvi = vector<vector<int>>;
using vi = vector<int>;
const ll MOD = 1e9 + 7;
const int INF = 1001001001;
const double PI = 3.14159265358979323846;
int V;
int G[20][20];... | //#define LOCAL
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 500;
const int inf = 1 << 29;
const int N = 17;
int n;
int dp[N][1<<N];
int dis[N][N];
int pos[N][3];
int dfs(int city, int state) {
if(state == (1 << n) - 1) {
return dis[city][0];
}
if(dp[city][state] != -1) r... |
#include <bits/stdc++.h>
using namespace std;
void solve(vector<int> &a, vector<int> &b, vector<int> &c) {
sort(a.begin(), a.end());
int64_t ans = 0;
for (auto &&i : c) {
int value = b[i - 1];
ans += upper_bound(a.begin(), a.end(), value) - lower_bound(a.begin(), a.end(), value);
}
... | #include<algorithm>
#include<iostream>
#include<cstring>
#include<bitset>
#include<cstdio>
#include<string>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;
#define int long long
#define uint unsigned int
#define reg register
#define db double
#define il inline
#define gc... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=998244353;
ll dp[3005][3050],cnt;
ll dfs(int n,int k){
// cout<<n<<" "<<k<<endl;
if(n<k) return 0;
if(dp[n][k]>0) return dp[n][k];
if(n==0) return dp[n][k]=1;
if(k==0) return dp[n][k]=0;
ll ret=(dfs(n-1,k-1)+dfs(n,k<<1))%mod;
return... | #include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ub upper_bound
#define lb lower_bound
#define isrt insert
#define clr clear
#define rsz resize
#define ff first
#define ss... |
#include <bits/stdc++.h>
using namespace std;
int a[11], k, cnt;
int main() {
int aa = 0;
char c;
while((c = getchar()) != ' ') a[++cnt] = c - 48;
for(int i = 1; i <= cnt; i ++) aa = aa * 10 + a[i];
cin >> k;
int ne = aa;
for(int i = 1; i <= k; i ++) {
sort(a + 1, a + cnt + 1);
int b = 0, e = 0;
fo... | #include<bits/stdc++.h>
#define fp(x,a,b) for(ll x=a; x<b; x++)
#define fn(x,a,b) for(int x=a; x>b; x--)
#define f(x, m) for(auto x : m)
#define cpu() ios::sync_with_stdio(false); cin.tie(nullptr)
#define pb push_back
#define pii pair<int,int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#defi... |
#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a... | #include <cstdio>
#include <cstring>
#include <iostream>
#include <cmath>
#include <string>
using namespace std;
#define debug(x) std::cerr << #x << '=' << x << '\n'
#define rep(a, b, c) for (int a = b; a <= c; a++)
typedef long long LL;
typedef unsigned long long ULL;
const int N = 212345;
int n, m;
void work_be... |
#include <bits/stdc++.h>
//#include <chrono>
//#pragma GCC optimize("O3")
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
using ll = long long;
using ve... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i=0; i<(int)(n); ++(i))
#define rep3(i, m, n) for (int i=(m); (i)<(int)(n); ++(i))
#define repr(i, n) for (int i=(int)(n)-1; (i)>=0; --(i))
#define rep3r(i, m, n) for (int i=(int)(n)-1; (i)>=(int)(m); --(i))
#define all(x) ... |
#include<bits/stdc++.h>
using namespace std;
int a,b,c,d,e,i,j,ii,jj,zx,xc,f[1500009],pas;
multiset <int> s,h;
multiset <int>::iterator it,tt;
void ins(int q){
it=h.lower_bound(q);
if(it!=h.end()&&(*it)==q){
h.erase(it);
}
s.insert(q);
}
void er(int q){
it=s.lower_bound(q);
s.erase(it);
it=s.lower_bound(q);
i... | #include <bits/stdc++.h>
#define ld long double
#define endl "\n"
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define ms(v,x) memset(v,x,sizeof(v))
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define rep(i, a, b) for(int... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<=b;i++)
using LL = long long;
const int Nmax=509, INF=1e9+10;
int N,C[Nmax][Nmax],B[Nmax],A[Nmax],chk,Bm=INF,Am=INF,Delta;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin>>N;
REP(i,1,N) {
REP(j,1,N) {
... | /*
Krishnakant Tiwari
Problem Link:
*/
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
using namespace std;
typedef long long ll;
#define _cin ios_base::sync_with_stdio(0); cin.tie(0);
#define endl "\n"
#define pb push_back
... |
#include <bits/stdc++.h>
using namespace std;
#define LL long long
//#define MOD 1000000007
#define MOD 998244353
#define INF 1000000000000000000
#define VE vector
#define VL vector<LL>
#define VVL VE<VL>
#define VVVL VE<VVL>
#define LD long double
#define PB push_back
#define POB pop_back
#define FOR(i,a,k) for(LL i=a... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N, A, P, X, x = 1000000000;
cin >> N;
for(int i = 0; i < N; i++){
cin >> A >> P >> X;
if(X - A > 0){
x = min(P, x);
}
}
if(x == 1000000000) cout << -1 <<endl;
else cout << x << endl;
return 0;
} |
//#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cos... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T,class U> using P = pair<T,U>;
template<class T> using vec = vector<T>;
template<class T> using vvec = vector<vec<T>>;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
int main(){
ll n;
cin >> n;
ll l, r;
l = 0, r = 2e9;... |
#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... | /**
* Written by : Ujjawal Pabreja [cuber_coder]
* Email : ujjawalpabreja99@gmail.com
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
#define endl "\n"
const int mod = 1e9 + 7;
const int MAX = 2e5 + 1;
int n;
vector <pair <ld, ld>> a;
vector <int> P... |
#include<bits/stdc++.h>
using namespace std;
int a[3050][6], n;
bool check(int x){
int vis[35] = {0};
for(int i = 1; i <= n; i ++){
int tmp = 0;
for(int j = 0; j < 5; j ++){
if(a[i][j] >= x) tmp |= (1 << j);
}
vis[tmp] = 1;
}
int t = 1 << 5;
for(int i = 0;... | #pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define test int tt; cin>>tt; while(tt--)
#define ff first
#define ss second
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
int main()
{
ios_base::sync_w... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.