code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double pi = acos(-1);
const double eps = 1e-8;
const ll mod = 1e9 + 7;
const ull base = 131;
const ull mod1 = 1e9 + 9;
const ull mod2 = 1610612741;
const int maxn = 2e5 + 10;
int n, m, k;
bool vis[maxn];
double d... | #pragma GCC optimize("O3") //
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, b, a) for(int i = b - 1; i >= a; i--)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int... |
#include <iostream>
#include <iomanip>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <string>
#include <algorithm>
#include <bitset>
#include <queue>
using namespace std;
#define ll long long
#define MOD 1000000007
#define rep(i, n) for( int i = 0; i < (n); i++ )
int main(){
int n;
cin >> n;... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int N;
cin >> N;
vector<int> A(N), B(N);
for(int i = 0; i < N; i++)cin >> A[i];
for(int i = 0; i < N; i++)cin >> B[i];
int Bmin = 10000, Amax = 0;
for(int i = 0; i < N; i++){
Bmin = min(B[i], Bmin);
... |
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
#define all(v) v.begin(), v.end()
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep_up(i, a, b) for (ll i = a; i < b; ++i)
#define rep_down(i, a, b) for (ll i... | #include<bits/stdc++.h>
using namespace std;
# define ll long long
# define read read1<ll>()
# define Type template<typename T>
Type T read1(){
T t=0;
char k;
bool vis=0;
do (k=getchar())=='-'&&(vis=1);while('0'>k||k>'9');
while('0'<=k&&k<='9')t=(t<<3)+(t<<1)+(k^'0'),k=getchar();
return vis?-t:t;
}
# define fre(k... |
#include <bits/stdc++.h>
#define For(i,a,b) for(int i=a;i<=b;i++)
#define Rev(i,a,b) for(int i=a;i>=b;i--)
#define clr(a,val) memset(a,val,sizeof(a))
//#define int long long
using namespace std;
const int N=3e3+5;
int n,m,head[N],to[N],nxt[N],edge[N],tot;
int dis[N],ins[N];
void add(int x,int y,int w)
{
nxt[++tot]=... | #include <bits/stdc++.h>
#define inf 1e9
using namespace std;
const int N = 2e3 + 101;
struct Edge{
int nex, to, dis;
}edge[N*2];
int tot, head[N], dis[N];
int dist[N][N], ans[N], vis[N];
struct node{
int u, dis;
bool operator < (const node &a) const{
return dis > a.dis;
}
};
priority_queue<node>q;
int n, m;
... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
#define F(type, i, a, b, incr) for (type i = a; i <= (type)(b); i += (type)(incr))
#define pb push_back
#define ppb pop_back
#define ff first
#define ss second
#define iter(it, s) for (auto it = s.begin(); it != s.end(); it++)
... | #include<bits/stdc++.h>
using namespace std;
struct node{int n,i;node(int n,int i):n(n),i(i){}};
int n,t,a;
bool b[203];
vector<int>f[203];
vector<node>s;
map<int,vector<node> >all;
void dfs(int x){
if(x==n){
int ps=0;
vector<node>y;
for(int i=0;i<n;++i)if(b[i])y.push_back(s[i]),ps+=s[i].n;
ps%=200;
if(y.siz... |
#include<bits/stdc++.h>
using namespace std;
int main() {
long n,ans,k;
cin>>n;
ans=0;
vector<long> vec(n);
vector<long> fibo(n+2);
for(long i=0; i<n; i++){
cin>>vec.at(i);
vec.at(i)=vec.at(i)%1000000007;
}
fibo.at(0)=0;
fibo.at(1)=1;
for(long i=2; i<n+2; i++){
fibo.at(i)=fibo.at(i-1)+fi... | #include <cstdio>
typedef long long LL;
const int Mod = 1000000007;
int N;
int main() {
int A = 0, B = 0, C = 0, D = 0;
scanf("%d%d", &N, &A);
C = 1;
for (int i = 2; i <= N; ++i) {
int x;
scanf("%d", &x);
int nA = (int)(((LL)(C + D) * x + A + B) % Mod);
int nB = (int)(((LL)(Mod - C) * x + A) % Mod);
int... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i,n,k) for(int i=(n);i<(k);i++)
#define ALL(a) (a).begin(),(a).end()
ll ans = 0;
void Main(){
int n;
cin >> n;
vector<int> p(n+1), place(n+1, 0), v;
vector<bool> used(n, false);
For(i,0,n) {
cin >> p[i+1];
... | #include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long int
#define pb push_back
#define mp make_pair
unordered_map<ll,int> um;
ll binpow(ll a, ll n){
if(n==0) return 1;
ll res = binpow(a, n/2);
if(n%2 != 0) return res*res*a;
else return res*res;
}
void solve(){
ll n; cin>>n;
... |
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using ull = unsigned long long;
using vll = vector<ll>;
using vi = vector<int>;
using vchar = vector<char>;
using vstr = vector<string>;
using pll = pair<ll,ll>;
const ll mod = 100000... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, N) for(int i = 0; i < (long int)N; i++)
int main(){
long int N;
cin >> N;
set<long int> s;
rep(i, 2*sqrt(N))
if(N % (i+1) == 0){
s.insert(i+1);
s.insert(N / (i+1));
}
for(auto x : s) cout << x << end... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD int(1e9+7)
#define INF int(1e9+7)
#define LINF ll(1e18+7)
#define PI acos(-1)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<ll,ll>
#define chmax(x,y) (x = max(x,y))
#define chmin(x,y) (x = min(x,y))
int h,w;
char grid... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, m;
cin >> n >> m;
vector<string> s(n);
for (int i = 0; i < n; ++i) cin >> s[i];
int ans = 0;
for (int j = 1; j < m; ++j)
if (s[0][j - 1] != s[0][j])
++... |
#include<bits/stdc++.h>
using namespace std ;
int main()
{
std::ios::sync_with_stdio(false) , cin.tie(0) ;
// [n - i + 1 , n + i]
int n ;
cin >> n ;
vector<int> a(2 * n + 1) ;
for(int i = 1 ; i <= 2 * n ; i ++) cin >> a[i] ;
long long ans = 0 ;
for(int i = 1 ; i <= 2 * n ; i ++) ans +=... | // Author: Vinay Khilwani
// Language: C++
// @vok8: Codeforces, AtCoder, LeetCode, HackerEarth, TopCoder, Google, FB, CSES, Spoj, GitHub
// @vok_8: CodeChef, GFG
// @vok8_khilwani: HackerRank
// Never Stop Trying.
// Trying to be Better than Myself.
// while(true)
// {
// if(AC)
// {
// break;
// ... |
#include<bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define M (L+R)/2
#define N 500009
#define inf 99999999999
#define ll long long
#define mod 1000000007
#define sz size();
using namespace std;
ll n,x,y,ans,sum;
string s;
int main(){
ios::sync_with_stdio(0);
cin>>n;
cin>>s;
for(int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< "... |
#define rep(i, n) for(int i=0; i<(n); ++i)
#define rrep(i, n) for(int i=(n-1); i>=0; --i)
#define rep2(i, s, n) for(int i=s; i<(n); ++i)
#define ALL(v) (v).begin(), (v).end()
#define memr(dp, val) memset(dp, val, sizeof(dp))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
te... | #include<bits/stdc++.h>
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define all(v) v.begin(), v.end()
using ll = long long;
using namespace std;
int main(){
int n;cin>>n;
vector<int> a(n),b(n);
int ans=1e10;
rep(i,n)cin>>a[i]>>b[i];
rep(i,n){
rep(j,n){
if(i==j)ans=min(ans,a[i]+b[j]... |
#include <iostream>
#include <cmath>
using namespace std;
int main() {
int N, X0, Y0, XN2, YN2;
cin >> N >> X0 >> Y0 >> XN2 >> YN2;
double xo, yo;
xo = (double)(X0 + XN2) / 2;
yo = (double)(Y0 + YN2) / 2;
double X0d, Y0d;
X0d = X0 - xo;
Y0d = Y0 - yo;
double pi = 3.1415926535;
... | #line 2 "/Users/tiramister/CompetitiveProgramming/Cpp/CppLibrary/Graph/dijkstra.hpp"
#line 2 "/Users/tiramister/CompetitiveProgramming/Cpp/CppLibrary/Tools/heap_alias.hpp"
#include <queue>
template <class T>
using MaxHeap = std::priority_queue<T>;
template <class T>
using MinHeap = std::priority_queue<T, std::vector... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define scan(a,n) for(long long int index=0;index<n;index++) cin>>a[index];
#define print(a,n) for(long long int index=0;index<n;index++) cout<<a[index]<<" ";cout<<endl;
... | //author : ainunsy1
#include <bits/stdc++.h>
#define forn(i,a,b) for(int i=a; i<=b; i++)
#define ford(i,a,b) for(int i=a; i>=b; i--)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;... |
#include<bits/stdc++.h>
using namespace std;
#define fastIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long int
#define fi first
#define se second
#define pub push_back
#define pi pair<int,int>
#define all(v) (v).begin(), (v).end()
#define rep(i, l, r) for(int i=(int)(l);i<(int)(r);... | #include <bits/stdc++.h>
using namespace std;
int solve() {
int n;
string s;
cin >> n >> s >> s >> s;
cout << string(n, '0') << string(n, '1') << "0\n";
return 0;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int T = 1;
cin >> T;
while (T--) {
solve();
}
return 0;
}
|
#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";
using ll = long long;
using ld = long double;
using ii = pair<int,... | // Artur Kraska, 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,P... |
#include <iostream>
#include <vector>
using namespace std;
struct cond {
int X, Y, Z;
};
bool IsOneBit(long long bits, int i) {
return (bits & (1ll << i)) > 0;
}
int main() {
int N, M;
cin >> N >> M;
vector<cond> Cond(M);
for (auto& [X, Y, Z] : Cond) cin >> X >> Y >> Z;
int PN = 1 << N;
vector<long long> DP(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... |
#include<bits/stdc++.h>
using namespace std ;
#define FASTIO ios::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0) ;
#define int long long
#define mod ((int)1e9 + 7)
void solve(){
int n , ans = 0 ; cin >> n ;
vector<int> a(n) ;
for(int& i : a) cin >> i ;
for(int i = 0 ; i < n ; ++i){
... | #include <bits/stdc++.h>
using namespace std;
using i64 = unsigned long long;
#define rep(i, n) for (i64 i = 0; i < (n); i++)
#define IN_i64(n) \
i64 n; \
cin >> n;
#define IN_veci64(a, n) \
vector<i64> a((n)); \
rep(i, n) cin >> a[i];
constexpr i64 INF64 = 1LL << 62LL;
inline i64 modpow(i64, i64, i64 =... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sp(y) fixed<<setprecision(y)
#define w(t) int t;cin>>t;while(t--)
//#define pi 2*acos(0.0)
#define bg begin()
#define en end()
#define all(x) x.begin(),x.end()
#define sortarr(x) sort(x,x+arrsize(x))
#define arrsize(x) sizeof(x)/sizeof(x[0])
#d... | #include <iostream>
#include <cmath>
#include <iostream>
namespace {
int solve(const int a, const int b, const int c, const int d) {
int tmp = c * d - b;
if (tmp > 0) {
return static_cast<int>(std::ceil(static_cast<double>(a) / tmp));
}
return -1;
}
} // namespace
int main() {
int a, b, c, d;
std:... |
// #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
#define ll long long int
#define vi vector<int>
#define vvi vector<vector<int>>
#define vll vector<long long>
#define vs vector<string>
#define vc vector<char>
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int MAXN = 1e6, M = 1e9+7, inf = -2e9;
// #define runcase LOL
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ull> vul;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
typedef vector<array<int, 2>... |
// RAKSHIT KADAM
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// #define ordered_set tree< int , null_type , less<int> , rb_tree_tag , tree_order_statistics_node_update>
// find_by_order returns iterator to element pre... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define BE(x) x.begin(), x.end()
int main() {
double x, y, z;
cin >> x >> y >> z;
double a = y*z / x;
a -= 0.001;
int ans = a;
cout << ans << endl;
} |
#include <bits/stdc++.h>
#include <cstring>
using namespace std;
typedef long long ll;
#define F0R(i, x, y) for (int i = x; i < y; i++)
#define FOR(i, n) F0R(i, 0, n)
#define F0RD(i, x, y) for (int i = y - 1; i >= x; i--)
#define FORD(i, n) F0RD(i, 0, n)
#define F first
#define S second
int mp(int x, int c) {
... | #include <bits/stdc++.h>
using namespace std;
int h,w;
string s[1003];
int f[2003];
int F(int x){
return f[x]==x?x:f[x]=F(f[x]);
}
int main(){
cin>>h>>w;
for(int i=0;i<h;i++)cin>>s[i];
s[0][0]=s[0][w-1]=s[h-1][0]=s[h-1][w-1]='#';
for(int i=0;i<h+w;i++)f[i]=i;
for(int i=0;i<h;i++)for(int j=0;j<w;j++)
if(s[i][j]=... |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
int n,m,ans;
vector<int> adj[400001];
vector<int> cur;
bool vis[400001];
void dfs(int x){
vis[x]=true;
cur.pb(x);
for (auto i:adj[x]){
if (vis[i]) continue;
dfs(i);
}
}
int main(){
ios_base::sync_... | /*BISMILLAH
THE WHITE WOLF
NO DREAM IS TOO BIG AND NO DREAMER IS TOO SMALL*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<long long> vll;
typedef vector<int> vi;
#define io ios_base::sync_with_s... |
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//namespace mp=boost::multiprecision;
//#define mulint mp::cpp_int
//#define mulfloat mp::cpp_dec_float_100
struct __INIT{__INIT(){cin.tie(0);ios::sy... | #include <bits/stdc++.h>
using namespace std;
#define N 100005
#define MOD 1000000007
#define fo(i, b, n) for (long i = b; i < n; ++i)
#define rfo(i, b, n) for (long i = b; i >= n; --i)
#define all(ar) ar.begin(), ar.end()
#define rall(ar) ar.rbegin(), ar.rend()
#define mem(ar, val) memset(ar, val, sizeof(ar))
#defin... |
#include "bits/stdc++.h"
using namespace std;
//#include "testlib.h"
#define ff first
#define ss second
#define all(v) v.begin(),v.end()
#define int long long
#define ll long long
#define M 1000000007
#define MM 998244353
#define inputarr(a,n) for(int i=0;i<n;++i) cin>>a[i]
#define GCD(m,n) __gcd(m,n)
#define LCM(m,n) ... | #pragma GCC optimize("Ofast")
#if 1
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
using db = double;
using ld = long double;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vpii = ... |
#include <iostream>
#include <vector>
using namespace std;
#include <iostream>
#include <cassert>
template<long long mod>
class modint{
private:
using T = long long;
T a;
public:
constexpr modint(const long long x = 0) noexcept : a((x%mod+mod)%mod) {}
constexpr T& value() noexcept { return a; }
constexpr co... | #include<bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
#define db double
#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);
const int mod=1e9+7;
#define eps 1e-8
#define zero(x) (((x)>0?(x):-(x))<eps)
using name... |
#include<iostream>
#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<>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long
#define FOR(i,a,b) for(ll i=a;i<... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstre... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 5e3+5,mod = 998244353;
int n,m,powm[maxn][maxn],ans;
int main(){
scanf("%d %d",&n,&m);
powm[0][0] = 1;
for(int i=1;i<=m;++i){
powm[i][0] = 1;
for(int j=1;j<=n;++j)powm[i][j] = 1ll*powm[i][j-1]*i%mod;
}
ans = 1ll*n*powm[m][n]%mod;
for(int i=1;i<n;+... |
#include <bits/stdc++.h>
using namespace std ;
#define i64 int64_t // typecast using i64(x)
#define int int64_t
#define ld long double
#define endl "\n"
#define f(i,a,b) for(int i=int(a);i<int(b);++i)
#define pr pair
#define ar array
#define fr first
#define sc second
#define vt vector
#define pb push_back
#define... | // Skyqwq
#include <iostream>
#include <cstdio>
using namespace std;
typedef long long LL;
const int N = 2e5 + 5, P = 998244353;
int n, m, K;
int inline power(int a, int b) {
int res = 1;
while (b) {
if (b & 1) res = (LL)res * a % P;
a = (LL)a * a % P;
b >>= 1;
}
return res;
}
int ans;
int main() {
sc... |
#include<stdio.h>
#include<iostream>
#include<cstring>
#define ll long long
using namespace std;
ll x,y,a,b,g;
int main(){
cin>>x>>y>>a>>b;
while((double)a*x<=x+b && a*x<y){
x*=a;
g++;
}
cout<<g + (y-1-x)/b<<endl;
return 0;
}
| #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); (i)++)
#define per(i, n) for (ll i = n - 1; i >= 0; (i)--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define ROF(i, a, b) for (ll i = (b) - 1; i >= (a); i--)
#define ALL(x) std::begin(x), std... |
#include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if(a > b) {
a = b;
return 1;
}
return 0;
}
#define DEBUG
#ifdef DEBUG
templ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
double x1,x2,y1,y2,d;
cin>>x1>>y1>>x2>>y2;
d=(y1*x2+y2*x1);
d=d/(y2+y1)*1.00;
cout<<fixed<<setprecision(10);
cout<<d<<endl;
}
|
#include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define rep(i,n) repi(i,0,n)
#define repi(i,a,n) for(ll i=a;i<(ll)n;++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
using namespace std;
using ll = long long;
usin... | #include <bits/stdc++.h>
using namespace std;
const int N = 100000 + 1;
int coins[N], sub[N];
vector<int> adj[N];
void dfs(int u) {
sub[u] = 1;
for (auto c : adj[u]) {
dfs(c);
sub[u] += sub[c];
}
coins[u] = 1;
vector<array<int, 2>> children;
for (auto c : adj[u]) {
if (sub[c] % 2 == 0) {
... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define set_bits(a) __builtin_popcount(a)
#define pb push_back
#define pf push_front
#define mod 1000000007
#define M 998244353
#define fi first
#define se second
#define endl '\n'
#define INF 1e18
#define PI 3.14159265358979323846
#define fast ios_b... | #include <bits/stdc++.h>
#define loop(n,i) for(int i=0;i<n;i++)
using namespace std;
int main(){
int n;
cin >> n;
cout << n-1 << endl;
return 0;
} |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using LL = long long;
using P = pair<int,int>;
using vv = vector<vector<int>>;
const int INF = (int)1e9;
const LL LINF = (LL)1e18;
long long const mod = 998244353;
struct mint{
long long val;
mint(long long val = 0): va... | #include<bits/stdc++.h>
#define pb push_back
#define fast ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define f first
#define s second
#define int long long
#define sz(x) (ll)(x.size())
using namespace std;
const int mod = 1e9+7;
in... |
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << e... | #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... |
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,avx512f")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vect... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define fo(i,n) for(ll i=0;i<n;i++)
#define fo1(i,n) for(ll i=1;i<=n;i++)
#define loop(i,a,b)for(ll i=a;i<=b;i++)
#define loopr(i,a,b)for(ll i=b;i>=a;i--)
#define all(x... |
#include <bits/stdc++.h>
#define int long long
using namespace std;
inline int read(){
int s=0,w=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-')w=-1;ch=getchar();
}
while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
return s*w;
}
inline bool read(int& a){
int s=0,w=1;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0; i<ll(n); i++)
#define FOR(i,m,n) for(ll i=ll(m); i<ll(n); i++)
#define ALL(obj) (obj).begin(),(obj).end()
#define VI vector<int>
#define VP vector<pair<ll,ll>>
#define VPP vector<pair<int,pair<int,int>>>
#define VLL vecto... |
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#defi... | #include<bits/stdc++.h>
#define X first
#define Y second
#define ll long long
#define sz(a) (int)a.size()
using namespace std;
const int maxn =2e5 + 100;
const int mod = 998244353;
signed main()
{
// ifstream cin("rt.txt.txt");
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k;
cin ... |
#include<bits/stdc++.h>
#define ll long long
#define db double
using namespace std;
void solve()
{
int a,b,c,d,r;
cin>>a>>b>>c>>d;
r=(d*c)-b;
if(r<=0)
cout<<-1;
else
{
db s=ceil(db(a)/db(r));
cout<<int(s);
}
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repx(i, x, n) for (ll i = (ll)(x); i < (ll)(n); i++)
#define repr(i, n) for (ll i = ((ll)(n)-1); i >= 0; i--)
#define reprx(i, x, n) for (ll i = ((ll)(n)-1); i >= (ll)(x); i--)
#define all(x) ... |
#include<iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <map>
#include <complex>
#include <iomanip>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#define ll long long
#define ld long double
#define HS ios_base::sync_with_stdio(0);ci... | #include <iostream>
#include <string>
using namespace std;
int main(){
int n; cin >> n;
long sum = 0;
for ( int i = 0; i < n; i++ ){
int a, b; cin >> a >> b;
for ( int j = a; j <= b; j++ ){
sum = sum + j;
}
}
cout << sum;
} |
#include <bits/stdc++.h>
const int MAX=1e6+10;
const int mod=1e9+7;
typedef long long ll ;
#define int ll
#define endl '\n'
#define cwk freopen("D:\\workplace\\CLion\\in.in","r",stdin),freopen("D:\\workplace\\CLion\\out.out","w",stdout)
using namespace std;
vector<int>a;
void solve(){
int n,m,x;
cin>>n>>m;
... | #include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
// #define int long long
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps... |
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#define rg register
const int maxn=1e5+5;
int a[maxn],n,mmax;
int main(){
scanf("%d",&n);
for(rg int i=1;i<=n;i++){
scanf("%d",&a[i]);
mmax=std::max(mmax,a[i]);
}
rg int cnt=0,jl;
for(rg int i=2;i<=mmax;i++){
rg int ncnt=0;
for(rg int j... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
int main(void)
{
ll n, k, distance = 0;
cin >> n >> k;
// friends[i] = {친구의 위치, 친구가 가지고 있는 돈}
vector<pair<ll, ll> > friends(n);
for (int i = 0; i < n; i++)
{
cin >> friends[i].first >> friends[i].second;
}
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<int> a;
a.push_back(0);
a.push_back(n + 1);
rep(i, m) {
int temp;
cin >> temp;
a.push_back(temp);
}
sort(a.begin(), a.end());
// 差... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define M 1000000007
#define N 100001
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
ll n, arr[N];
int mulMod(ll, ll); int addMod(int, int);
void readArray(ll *, int); void printArray(int *, int);
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> pi;
#define FAST ios_base::sync_with_stdio(0);cin.tie(0);
#define f first
#define s second
int n;
int32_t main() {
cin >> n;
int Y = 0;
for (int i =0;i<n;i++) {
int x; cin >> x;
Y = __gcd(Y,x);
}
cout << Y;
}
|
//compiledef
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0;i<(n);i++)
#define per(i, n) for(int i=(n);i>0;i--)
#define repx(i, n, x) for(int i=(x);i<(n);i++)
#define xper(i, n, x) for(int i=(n);i>(x);i--)
#define pback push_back
//c++def
using namespace std;
typedef long long int ll;
typedef unsigned long lon... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
cout << a * d - b * c << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define set_precision(ans,l) cout << fixed << setprecision(l)<<ans;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repb(i, a, b) for (int i = a; i >= b; i--)
#define vi vector<int>
#define vl vector<long long int>
#define Vi vector<vector<int>>
#define vpi vector... | #include <iostream> // cout, endl, cin
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <vector> //vector
using namespace std;
#define _LIBCPP_DEBUG 0
#define rep(i, n) for(int i = 0; i < (int)n; i++)
typedef long long ll;
int main(){
ll n, t;
cin >> t >> n;
cout <<... |
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#def... | #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;
#define co(n) cout<<n<<endl;
const double eps=1e-10,pi=3.1415926535898;
const int mod=1e9+7,maxn=2e5+10;
int T,n,m,k,x,y,a,b;
int main(int argc, char const *argv[]) {
scanf("%d %d %d %d", &a, &b, &x, &y);
if (y>2*x) y = 2*x;
if (a > b) {
if ((a-b)&1) {
printf("%d\... | #include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
#define endl "\n"
struct edge {
int v;
long long w;
edge() {}
edge(int v, long long w) : v(v), w(w) {};
};
vector<long long> dijkstra(int n, vector<vector<edge> >& G, int s) {
vector... |
///In the name of GOD
//#pragma GCC optimize("O2")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MXN = 2e5 + 10;
const ll INF = 1e18;
const ll LOG = 20;
ll n, k;
ll h[MXN], dis[MXN], Jad[LOG][MXN];
vector<ll> adj[MXN], Ver;
void DFS(ll u, ll par, ll d, ll m){
if(d > m || d >= dis[u]) ... | #include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
// using mint = modint1000000007;
// // using mint = modint998244353;
typedef int64_t Int;
#define all(x) (x).begin(), (x).end()
const double EPS = 1e-10;
const Int INF = 1e18;
const int inf = 1e9;
const Int mod = 1e... |
#include <iostream>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
cout<<a-b+c;
return 0;
}
|
#define ll long long
#include<bits/stdc++.h>
using namespace std;
int findeven(std::vector<int> v)
{
for(int i=0;i<v.size();i++)
{
if(v[i]%2==0)
return i;
}
return -1;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define vpii vector<pair<int,int>>
#define vpll vector<pair<ll,ll>>
#define fr(i,k,n) for (int i = k; i < n; ++i)
#define fri(i,k,n) for (int i = k; i >= n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int inf = 1e9;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
using pint = pair<ll, ll>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
//snukeさんの答え
int main() {
... |
#include<iostream>
#include<bits/stdc++.h>
#define forf(i,start,n,increment) for(int i = start;i<n;i+=increment)
#define all(i) i.begin(),i.end()
#define traverse(container,it) for(typeof(container.begin()) it = container.begin();it != container.end();it++)
using namespace std;
int main()
{
ios_base::sync_with_stdi... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c; cin >> a >> b >> c;
if((a >= b && b >= c) || (b >= a && a >= c) ) cout << a + b << endl;
else if((a >= c && c >= b) || (c >= a && a >= b) ) cout << a + c << endl;
else if((c >= b && b >= a) || (b >= c && c >= a) ) cout << b + c << e... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define maxn 1005
int n,k,tot,tt;
int a[maxn][maxn];
int vis[maxn][maxn];
int sum[maxn][maxn];
int you[maxn][maxn];
int num[maxn*maxn];
map<int,int>to,to1;
bool check(int x)
{
memset(sum,0,sizeof(sum));
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)... | #include <bits/stdc++.h>
using namespace std;
map<vector<int>, long long> dp;
long long gcd(long long x, long long y) {
while (y) {
long long t = x;
x = y;
y = t % y;
}
return x;
}
bool coprime[80][80];
long long f(vector<int> idxs) {
if (idxs.size() == 0) return 1;
if (dp.find(idxs) != dp.end... |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define rng(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); --i)
#define per(i, b) gnr(i, 0, b)
#define all(obj) begin(obj), end(obj)
#define allr(ob... | #include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <iomanip>
#include <functional>
#include <bitset>
#include <limits>
#include <cstdio>
#include <cmath>
#include <cassert>
#include <ra... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll one = 1;
const ll INF = 9223372036854775807; //10^18
const int inINF = 2147483647; //10^9
const ll MO... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define rep(i,n) repi(i,0,n)
#define repi(i,a,n) for(ll i=a;i<(ll)n;++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define Show(val) cout<<(val)<<" "
#define Showl... |
#include<iostream>
#include<array>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#incl... | #include <iostream>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
ll x;
cin >> n >> x;
vector<ll> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
unordered_map<ll, ll> v;
v[x] = 1;
ll ans = 0;
for (int i = 0; i < n; ++i) {
unordered_... |
#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;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define fast ios_base::sync_with_stdio(0);ci... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int N,T;
int a[45];
cin>>N>>T;
for(int i=0; i<N; i++) cin>>a[i];
vector<ll> p(1<<N/2),q(1<<(N-N/2));
for(int i=0; i<1<<(N/2); i++) {
for(int j=0; j<N/2; j++)
{
if( i & 1<<j ) {
p[i]+=a[j];
}
}
}
for(int i=0; i<1<<... |
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <iostream>
#include <string>
#include <array>
#include <random>
#in... | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <un... |
#include <iostream>
using namespace std;
typedef long double ld;
int a[100],ok[100010] = {};
ld dp[100010],sum[200010];
int main(){
cout.precision(20);
int i,j,n,m,k;
cin >> n >> m >> k;
for(i=0;i<k;i++){
cin >> a[i]; ok[a[i]] = 1;
}
for(i=0;i<k;i++){
for(j=i;j<k;j++){
... | #include <bits/stdc++.h>
#define double long double
using namespace std;
#define debug(x) cerr << #x << " = " << x << endl
#define boost ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); istream_iterator<... |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <random>
#include <fstream>
using ll = long long int;
using P = std::pair<ll, ll>;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);
const int TT = 157;
const int SS = 5;
#define l_ength size
void mul_mo... | #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<int>>;
int main(){
int N; cin >> N;
int x[N],y[N],r[N],a[N],b[N],c[N],d[N];
vector<tuple<int,int,int,int>> order;
//set<P> used;
//vecto... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << end... | #include<bits/stdc++.h>
//#include<atcoder/all>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
//using namespace atcoder;
//using namespace boost::multiprecision;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#de... |
#include<bits/stdc++.h>
#define ll long long int
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vpii vector< pii >
#define vpll vector< pll >
#define mpii map<int,int>
#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--)
#de... | /*-------------必要なときに使うもの------------------*/
//#define _GLIBCXX_DEBUG
/*#include<atcoder/modint>
#include<atcoder/math>
using namespace atcoder;
using mint=modint1000000007;
using MINT=modint998244353;*/
/*#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-l... |
#include <bits/stdc++.h>
#include <numeric>
#include <iomanip>
#define ll long long
#define intm INT_MAX
#define llm LLONG_MAX
using namespace std;
typedef array<ll, 2> P;
const int mod = 1e9 + 7;
//const ll mod = 1e9 + 7;
const int mxN = 2e5 + 9;
const int INF = 2e9;
/*
(x1,y1) (x,0) (x2,y2)
y1/(x-x1) = y2/(x2-x... | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <list>
#include <ctime>
#include <sstream>
#include <queue>
#include <stack>
#include <random>
#include <bitset>
#include <numeric>
#include <cassert>
using namespace s... |
#include <algorithm>
#include <cassert>
#include <cstdio>
#include <vector>
using namespace std;
int main() {
int l;
scanf("%d", &l);
// Answer is C(l - 1, 11)
long long ans = 1;
for (int i = 1; i <= 11; i++) {
ans *= l - i;
ans /= i;
}
printf("%lld\n", ans);
return 0;
}
| #include <iostream>
#include <cstring>
#include <string>
#include <queue>
#include <algorithm>
using namespace std;
using ll = long long;
int l;
ll dp[201][201];
ll memo(int idx, int leng);
int main()
{
memset(dp, -1, sizeof dp);
cin.tie(0);
ios::sync_with_stdio(false);
cin >> l;
cout << memo(... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i++) {
cin >> a[i];
}
int max = -1;
for(int l = 0; l < n; l++) {
int min = a[l];
for(int r = l; r < n; r++) {
if(a[r] < min) {
min = a[r];
}
if... |
// code by lynmisakura. wish to be accepted!
#include<bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i = 0;i < N;i++)
#define rng(i,a,b) for(int i = a;i < b;i++)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define lmd(func) auto func = [&]
#define mp make_pair
#defin... |
#include <bits/stdc++.h>
#define N 5015
#define mod 998244353
using namespace std;
typedef long long ll;
int n, m;
ll sum[N], power[N][N];
ll ksm(int a, int b) {
return power[a][b];
}
void Init() {
for (int i = 0; i <= m+2; i++) {
power[i][0] = 1;
for (int j = 1; j <= n+2; j++) {
power[i][j] = (power[i][j... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define forin(in ,n) for(ll i=0; i<n; i++) cin>>in[i]
#define forout(out) for(ll i=0; i<(ll)out.size(); i++) cout<<out[i]<<endl
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep_up(i, a, n) for (ll i = a; i < n; ++i)
#define rep_down(i, a, n) fo... |
#include <bits/stdc++.h>
using namespace std;
template<class t> inline t read(t &x){
char c=getchar();bool f=0;x=0;
while(!isdigit(c)) f|=c=='-',c=getchar();
while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
if(f) x=-x;return x;
}
template<class t,class ...A> inline void read(t &x,A &...a){
read(x);read(a...);... | #include <bits/stdc++.h>
#define ll long long
#define map unordered_map
#define set unordered_set
#define l_l pair<ll, ll>
#define P pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
#define mp make_pair
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define endl '\n'
ll dp[105][2];
int main(){
ios_base::sync_with_stdio(false);
ll a, b, x, y;
cin >> a >> b >> x >> y;
if(a == b) cout << x, exit(0);
else {
if(a > b) swap(a, b), b--;
i... | #include <iostream>
#include <vector>
#include<math.h>
#include<algorithm>
#include <float.h>
#include <iomanip>
#include<string>
using namespace std;
int main()
{
int N, x_0, y_0, x_N, y_N;
cin >> N >> x_0 >> y_0 >> x_N >> y_N;
double R_x, R_y;
R_x = ((double)x_0 + (double)x_N) / 2;
R_y = ((double)y_0 + (double... |
#include<iostream>
#include<cstring>
using namespace std;
typedef long long LL;
LL b[300];
int p = 200;
int main()
{
int n, a;
cin >> n;
memset(b, 0, sizeof b);
for(int i = 0; i < n; i++){
cin >> a; a = a % p;
b[a]++;
}
LL ans = 0;
for(int i = 0; i < 205; i++){
if(b... | #include <bits/stdc++.h>
using namespace std;
#define mnto(x, y) x = min(x, (__typeof__(x)) y)
#define mxto(x, y) x = max(x, (__typeof__(x)) y)
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define MP make_pair
#define... |
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <chrono>
#include <queue>
#include <tuple>
#include <set>
using namespace std;
long long seed = std::chrono::high_resolution_clock::now().time_since_epoch().count();
unsigned int rx = seed, ry = seed >> 12, rz = seed >> 24;
inline unsig... | // #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex... |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <vector>
using namespace std;
typedef long long LL;
struct Tree {
int _size;
vector<vector<int>> _edges;
vector<int> _done;
... | /**
* author:
* created: 16.11.2020 06:42:51
**/
#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<bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL N=2e5+10;
const int inf=0x7fffffff;
vector<int> adj[N];
vector<int> mst;
LL n,m,k;
int fa[N],arr[N];
int findfa(int x)
{
if(fa[x]==x) return fa[x];
else return fa[x]=findfa(fa[x]);
}
void merge(int x,int y)
{
int fx=findfa(x),fy=... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i,a,b) for (int i = a; i <= b; i++)
#define ALL(c) c.begin(), c.end()
#define T... |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef pair<int, int> pi;
const int maxn = 2e5 + 5;
int n;
ll a[2 * maxn];
int main(){
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
c... | #include <bits/stdc++.h>
constexpr int MOD = 1e9 + 7;
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N + 1, 0);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
long long ans = 1;
for (int i = 0; i < N; i++) {
ans *= A[i + 1] - A[i] + 1;
... |
#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 LETS_GET_SCHWIFTY ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ff first
#de... | //@formatter:off
#include<bits/stdc++.h>
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(i,n) for (ll i = 0; i < ll(n); ++i)
#define rep2(i,s,n) for (ll i = ll(s); i < ll(n); ++i)
#define rep3(i,s,n,d) for(ll i = ll(s); i < ll(n); i+=d)
#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)
#defi... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define endl "\n"
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x.size())
int powmod(int a,int l, int md){a%=md; int res=1;while(l){if(l&1)res=res*a%md;l/=2;a=a*a%md;}return res;}
int binpow(int a,int l){... | #include <bits/stdc++.h>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
int max(ll a, ll b) {
if (a > b) return a;
return b;
}
int min(ll a, ll b) {
if (a < b) return a;
return b;
}
int main() {
ll N;
cin >> N;
ll min = 1000, max = 0;
for (int i = 0; ... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, k;
string s;
cin >> n >> k >> s;
while(k > 0){
k -= 1;
if(n % 2 == 1){
s += s;
n *= 2;
}
//cout << s << endl;
string ns = "";
for(int i=0; 2*i+1<n; i++){
... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 123;
const int mod = 998244353;
#define int long long
string s;
int n, k;
char w[200][200];
int d[200][200];
char lmao(char a, char b) {
if(a == b) return a;
else if(a == 'R') {
if(b == 'P') return b;
else return a;
}else if(a == 'P') {
if... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[10][10],num[10];
int main()
{
ll n,k,res=0;
cin>>n>>k;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
cin>>a[i][j];
for(int i=1;i<=n;i++)
num[i]=i;
do
{
ll last,now,sum=0;
for(int i=1;i<n;i++)
{
last=num[i];
now=num[i+1];
... | #include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<cstdlib>
#include<string>
#include<ctime>
#include<map>
#include<set>
#include<bitset>
#include<queue>
#include<deque>
#include<vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef un... |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define S second
#define F first
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define vll vector<long long int>
#define pll pair<long long int,long long int>
#define mod 1000000007
#define mod2 998244353
#define ll long long int
... | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (long long i = (s); i < (long long)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ld = long double;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
using Pll = pair<ll, ... |
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<algorithm>
#include<utility>
#include<map>
#include<tuple>
#include<deque>
using namespace std;
const int mod = 1000000007;
const int INF = 1001001001;
const long long LINF = 1001002003004005006;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<vs> vvs;
#define rep(i, n) fo... |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int X;
cin >> X;
int genzai = X / 100;
//cout << "genzai " << genzai << endl;
int ans = (genzai + 1)*100 - X;
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
#include<iostream>
#define ll long long
#define rep(i,a) for(int i=0;i<a;i++)
#define int long long
#define di(a) int a;cin>>a;
#define dia di(a)
#define dix di(x)
#define diy di(y)
#define diz di(z)
#define dib di(b)
#define din di(n)
#define db double
#define all(x) x.begin(),x.end()
#define f... |
#include <bits/stdc++.h>
using namespace std;
using llong = long long;
using ldbl = long double;
using lpair = pair<llong, llong>;
#define ALL(x) x.begin(), x.end()
constexpr llong mod = 1e9+7;
constexpr llong inf = mod * mod;
struct point {
int h;
int w;
point() = default;
point(int h, int w):
h(h),
... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define vi vector<int>
#define mk make_pair
#define vll vector<long long >
#define loop(i,a,b) for(int i=a;i<=b;i++)
#define loopr(i,a,b) for(int i=b;i>=a;i--)
#define vii ve... |
#include<bits/stdc++.h>
using namespace std;
const int inf = 5e8;
int dp[20][150000];
int adj[20][20];
int n;
int no[20][3];
int dist(int u, int v){ //u -> v
return abs(no[u][0]-no[v][0])+abs(no[u][1]-no[v][1]) + max(0,no[v][2]-no[u][2]);
}
int tcp(int u, int mask){
if(mask == (1<<n) - 1)return adj[u][0];
if(dp[u]... | //翻标签不犯规！
//数据范围如此别出心裁。。。
#include<cstdio>
#include<cstring>
#define int long long
#define noti(x,i) x&~(1<<i)
int n;
int f[262155][20];
struct node{int x,y,z;}a[20];
int abs(int x){return x>=0?x:-x;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
int dist(int x,int y){
node c=a[x],d=a[... |
#include<cstdio>
#include<algorithm>
#define N 300010
#define db double
#define ll long long
#define fo(x,a,b) for(int x=(a);x<=(b);x++)
#define fd(x,a,b) for(int x=(a);x>=(b);x--)
using namespace std;
struct node{ll x; int id;}a[N];
int n,t[4],tot1=0,tot2=0,tot3=0,tot4=0;
ll b[N],c[N],d[N],e[N];
ll ans=(1ll<<50),ans1=... | #include <iostream>
#include <vector>
#include <math.h>
#include <algorithm>
using namespace std;
// Aの中でvalに最も近い値を二分探索で探し、差の絶対値を返す
long long findClosestVal(vector<long long> *A, long long val)
{
long long lb, ub;
lb = 0;
ub = A->size() - 1;
while (lb + 1 < ub)
{
long long mid = (lb + ub) ... |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll read()
{
char c;
ll w=1;
while((c=getchar())>'9'||c<'0')if(c=='-')w=-1;
ll ans=c-'0';
while((c=getchar())>='0'&&c<='9')ans=(ans<<1)+(ans<<3)+c-'0';
return ans*w;
}
struct node
{
ll a,b;
bool operator<(const node&w)const
{
... | #include <bits/stdc++.h>
using namespace std;
int main () {
int N;
cin >> N;
int temp = N;
vector<int> vec;
for(int i = 0; i < 10; i++) {
vec.push_back(temp % 10);
temp = temp / 10;
if(temp == 0) {
break;
}
}
int count = 0;
for(int i = 0; i < vec.size(); i++) {
if(vec.at... |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
using namespace std;
using ll = long long;
using P = pair<in... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
ll n,x=0;
cin>>n;
vector<ll>a(n);
vector<ll>b(n);
vector<ll>p(n);
for(ll i=0;i<n;i++){
cin>>a[i]>>b[i];
x+=a[i];
p[i]=2*a[i]+b[i];
}
sort(p.rbegin(),p.rend());
ll i=0;
while(x>=0){
x-=p[i];
i++;
}
cout<<i<<endl;
}
|
#include <bits/stdc++.h>
#define LL long long
#define ULL unsigned long long
#define pb push_back
#define st first
#define nd second
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
template <class T> T read(T &a) {
a=0;char x=getchar();bool f=0;
for(;x<'0'||x>'9';x=getchar())f|=x=='-';
for(;x>='0'&&x<='... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int k;
cin>>k;
int count = 0;
for( long long i = 1; i <= k; i++ )
{
for( long long j = 1; j <= k/i; j++ )
{
for( long long m = 1; m <= k/(i*j); m++ )
{
if( i*j*m <= k )
... |
#include <iostream>
#include <sstream>
#include <cmath>
#include <functional>
#include <vector>
#include <map>
#include <queue>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<int, int>;
int main() {
i... | #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 indexed_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
//find_by_order = returns pointer to element at that pos
//order_o... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define chmin(x,y) x = min((x),(y));
#define chmax(x,y) x = max((x),(y));
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
const int INF = 1e9;
const long long LINF = 1e17;
const int MOD = 1... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(i64 i=0; i<n; i++)
#define all(v) v.begin(),v.end()
#define pp pair<int,int>
using Graph=vector<vector<int>>;
using i64=int64_t;
int main() {
int si,sj;cin>>si>>sj;
vector<vector<int>> t(50,vector<int>(50));
rep(i,50) {
rep(j,50) {
... |
#include <iostream>
using namespace std;
int main(void){
// Your code here!
int N;
cin >> N;
cout << (N - 1) / 100 + 1 << endl;
}
|
/* CODER::==>ARYAN KANSAGARA
CF HANDLE:=>Good_Devil
-----------------------------------------------*/
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
int32_t main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("er... |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <bitset>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#include <algorithm>
#include <random>
#include <cmath>
#include <cassert>
#include <climi... | #include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:... |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int T;
long long n;
int main(){
for(cin>>T;T;T--){
cin>>n;
int cnt=0;
while(n%2ll==0)cnt++,n>>=1ll;
if(cnt==0)puts("Odd");
else if(cnt==1)puts("Same");
else puts("Even");
}
} | #include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define MOD99 998244353
int main(){
int n;
cin >> n;
long long a,man = 0,che = 0,all = 0;
double euc;
for(int i = 0;i < n;i++){
cin >> a;
a = abs(a);
man += a;
all += a * a;
che = max(che,... |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
#define drep(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
inline int read() {
int x=0,f=1;char c=getchar();
while(c<48||c>57){if(c=='-')f=-1;c=getchar();}
while(c>=48&&c<=57)x=(x<<1)+(x<<3)+(c^48),c=getchar();
return x*f;
}
using namespac... | #include <bits/stdc++.h>
using namespace std;
#define MS(a, b) memset(a, b, sizeof(a))
#define REP(a, b, c) for (register int a = b, _n = c; a <= _n; ++a)
#define DREP(a, b, c) for (register int a = b, _n = c; a >= _n; --a)
#define FOR(a, b, c) for (register int a = b, _n = c; a < _n; ++a)
#define EREP(a, b) for (reg... |
#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... | /*
/\ In The Name Of Allah /\
Author : Jawahiir Nabhan
*/
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
typedef long long ll;
const char nl = '\n';
int main()
{
ll N,K; cin>> N >> K;
for(int i = 0;i < K;i++){
if(N % 200 == 0) N /= 200;
else N = N*1000 + 200;
}
... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+5;
int n,m;
ll d;
pair<ll,ll> exgcd(ll a,ll b){
if(!b){
d=a;
return {1,0};
}
pair<ll,ll> ret,ans=exgcd(b,a%b);
ret.first=ans.second;
ret.second=ans.first-(a/b)*ans.second;
return ret;
}
int main(){
ll i,j;
int T;cin>>T;
whil... | #include <bits/stdc++.h>
using namespace std;
#define fr(i,n) for(int i = 0; i<n; i++)
#define sz(v) (int)(v.size())
#define prin(a) cout << #a << " = " << a << endl
#define prinv(v) cout << #v << " = "; for(auto it : v) cout << it << ", "; cout << endl
#define all(v) (v).begin(),(v).end()
typedef long long ll;
#def... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <utility>
#include <tuple>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{... | #include<bits/stdc++.h>
#define ll long long
#define in insert
#define pb push_back
#define endl '\n'
#define ub upper_bound
#define lb lower_bound
#define pf pop_front
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);sran... |
// execute g++ main.cpp -std=c++14 -I C:\Users\naoya\Desktop\code\Atcoder
#include<bits/stdc++.h>
//#include<atcoder/all>
typedef long long ll;
typedef long double ld;
using namespace std;
//using namespace atcoder;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
//ordered_set 重複不可
#include <ext/pb_ds/assoc_con... | #include<bits/stdc++.h>
using namespace std;
#define int long long
const int maxn=5005;
const int mod=998244353;
int n,m;
int dp[15][maxn];
int C[maxn][maxn];
void init() {
C[0][0]=1;
for(int i=1 ; i<maxn ; i++) {
for(int j=0 ; j<=i ; j++) {
if(!j||j==i) C[j][i]=1;
else C[j][i]=C[j-1][i-1]+C[j][i-1];
if(C... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int tt = 1;
//cin >> tt;
while(tt--) {
int x, y;
cin >> x >> y;
int a=min(x, y);
int b = max(x, y);
if(a+3 > b) {
cout << "Yes\n";
} else {
cout << "No\n";
}
}
retu... | /*
ID: jerrywcy
LINK:
TITLE:
LANG: C++
STATUS:
*/
#include <bits/stdc++.h>
#define DEBUG
#define init(array,x) memset(array,x,sizeof(array))
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
ll sx,sy,gx,gy;
double ans;
int read(){
int f=1,x=0;
char ss=getchar();
while(ss<'0'||ss>'9... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define len(x) (int)(x).size()
#define pb push_back
#define em emplace_back
#define ... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC loop-opt(on)
#define rep(i, a, b) for(int i = a; i <= b; i++)
#define rrep(i, a, b) for(int i = b; i >= a; i--)
#define print(x) cout << #x <<" = " << x <<"\n"
#define pprint(x) cout << #x <<" = (" << x.first <<", " << x.second <<")\n"
#define all(x) x... |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
using namespace std;
const int R=2e5 + 5;
const int N=1e5 + 3;
const int M = 2e3 + 3;
const int INF=0x3f3f3f3f;
struct edge{
int v,w,next;
}e[R*2];
int dis[N],head[2*N],cnt=0;
int a[M][M];
struct node{
int u,d;
bool operator <(const node&rhs) co... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define ll long long
using namespace std;
using P = pair<int, int>;
struct E {
int to, co;
E(int to=0, int co=0):
to(to), co(co) {}
};
int main(){
int n, m;
cin >> n >> m;
vector<vector<E>> g(n);
rep(i, m){
int a... |
#include <bits/stdc++.h>
using namespace std;
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << '(' << p.first << ',' << p.second << ')';
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << '{';
f... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<pair<int, int> > g[n];
int ans[n];
ans[0] = 1;
for(int i = 0; i<m; i++){
int u, v, c;
cin >> u >> v >> c;
g[u - 1].push_back({v - 1, c});
g[v - 1].push_back({u - 1, c});... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.