code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author tatsumack
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#define int long long
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (... | #include <bits/stdc++.h>
#include <map>
#include <algorithm>
#include <vector>
#include <string.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <chrono>
#include <thread>
#include <iomanip>
#include <typeinfo>
//define
#define trav(i,v) for(auto i: v)
#define rep(i,n) for(int i=0;i<n... |
#include <bits/stdc++.h>
using namespace std;
#define endl ("\n")
#define int long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(c) c.begin(), c.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N), B(N), C(N), BC(N), count(N+1);
for (int i=0; i<N; i++) cin >> A[i];
for (int i=0; i<N; i++) cin >> B[i];
for (int i=0; i<N; i++) cin >> C[i];
for (int j=0; j<N; j... |
#include <iostream>
namespace wxy{
const int mod = 998244353;
int f[15][5050],fac[5050],invfac[5050];
inline void init(){
fac[0]=invfac[0]=invfac[1]=1;
for(int i=1;i<=5000;i++)fac[i]=(long long)fac[i-1]*i%mod;
for(int i=2;i<=5000;i++)invfac[i]=(long long)(mod-mod/i)*invfac[mod%i]%mo... | #include <bits/stdc++.h>
#define lc (o<<1)
#define rc ((o<<1)|1)
#define PB push_back
#define MK make_pair
using namespace std;
#define DebugP(x) cout << "Line" << __LINE__ << " " << #x << "=" << x << endl
const int maxn = 5000 + 5;
const int modu = 998244353; // 1e9 + 7
const int inf = 0x3f3f3f3f;
const double eps = ... |
#include <bits/stdc++.h>
#include <map>
#include <algorithm>
#include <vector>
#include <string.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <chrono>
#include <thread>
#include <iomanip>
#include <typeinfo>
//define
#define trav(i,v) for(auto i: v)
#define rep(i,n) for(int i=0;i<n;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define endl '\n'
#define all(x) (x).begin(),(x).end()
const int INF=1000000000+5;
const int N=300+5;
const ll oo=1e18+5;
const ll mod=998244353;
ll inv2;
ll mul(ll a, ll b){
return a*b%mod;
}
ll poww(ll a,ll b){
ll... |
#include<bits/stdc++.h>
using namespace std;
void __print(int x) {cout << x;}void __print(long x) {cout << x;}void __print(long long x) {cout << x;}void __print(unsigned x) {cout << x;}void __print(unsigned long x) {cout << x;}void __print(unsigned long long x) {cout << x;}void __print(float x) {cout << x;}void __print... | #include <iostream>
#include <algorithm> // for next_permutation
#include <vector>
#include <bits/stl_numeric.h>
#include <queue>
#include <regex>
#define DEBUG 0
#define REP(i, n) for (long long i = 0; i < (n); i++)
typedef long long ll;
static const ll MOD = 1000000007;
static const ll INF = 10000000000000000... |
/* @author: saran
* Git: https://github.com/abhisheksaran
* LinkedIn: https://www.linkedin.com/in/abhishek-saran-2900b/
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vecto... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
const int N = 1e5 + 5;
typedef long long LL;
int main() {
#ifdef LOCAL
//freopen("input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false); cin.tie(0);
int n;
cin >> n;
map <int,int> cnt;
for (int i = 1; i <= n... |
#pragma GCC optimize("Ofast")
#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 = vector... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef long double ld;
typedef tree<pii,null_type,le... |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
struct query{int time,type;ll p;int idx;};
bool operator<(const query &a,const query &b){
return a.time<b.time;
}
int main(){
cin.tie(0);ios::sync_with_st... | #include <iostream>
#include <algorithm>
#include <queue>
#include <bitset>
#include <string>
#include <cstring>
#include <limits>
#include <cmath>
#include <cstdlib>
#define int long long
int const INF = std::numeric_limits<int>::max();
int const NINF = std::numeric_limits<int>::min();
int const N = 200000;
int const... |
#include <bits/stdc++.h>
using namespace std;
int BIG = 9999999;
vector<int> interests;
vector<int> vinterests;
vector<int> kapairs;
int nums[400001];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t, a, b, c, d, n, ans = 0;
long long int w, x, y, z;
cin >> n;
d = 0;
kapairs.r... | //Shinchan Loves Coding :))
#include<bits/stdc++.h>
using namespace std;
#define night_rider ios::sync_with_stdio(false);cin.tie(NULL);
#define double long double
#define int long long int
#define en "\n"
#define fi first
#define se second
#define PB push_back
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin... |
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
typedef unsigned long long int ull;
typedef long int li;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define test ll t; cin >> t; while(t--)
#define print_tc(t, c) cout << "Case #" << t << ": " << c << "\n"; ... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
#include <cstdint>
#include <string>
#include <sstream>
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 ... |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0, length = n; i < length; 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... | #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 <bits/stdc++.h>
#define ll long long
#define V vector<long long>
#define VV vector<vector<long long>>
#define VVV vector<vector<vector<long long>>>
#define P pair<ll,ll>
#define rep(i,n) for(ll (i)=0;(i)<(n);++(i))
using namespace std;
template<typename T>
struct segment_tree{
function<T(T,T)> f = [](T a,... | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
const int MAX = 200000;
template<class T> class segtree{
public:
T *tree;
T u;
int height,treeSize,dataSize;
segtree(long long int length,T unit){
long long int pre = 1;
height=1;
u=unit;
while(pre<length){
pre*=2;
height++... |
#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<string.h>
#include<string>
using namespace std;
int shu1,shu2,shu3,shu4;
int shu;
int main()
{
cin>>shu1>>shu2>>shu3>>shu4;
shu=min(shu1,min(shu2,min(shu3,shu4))) ;
cout<<shu;
} | #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int h, w, a, b;
... |
#include <bits/stdc++.h>
using namespace std;
#define eni(x) template < class c > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
template < class c > struct rge { c b, e; };
template < class c > rge<c> range(c i, c j) { return rge<c>{i, j}; }
template < class c > auto dud(c* x) -> decltype... | //go to line 53 for some useful code.
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dbg(...) 47
#define dbgm(...) 47
#endif
// refer https://codeforces.com/blog/entry/66279
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-... |
#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;
#define rep(i,n) for (int i=0;i<(int)(n);i++)
int main()
{
int n,x;
cin >> n >> x;
vector<int> a(n), b(n);
int i = 0;
rep(i,n){
cin >> a[i];
if(a[i] != x)
{
b[i] = a[i];
cout << b[i] << " ";
}
}... |
#include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
// 最大公約数gcd
// 最小公倍数lcm=m*n/gcd
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n !=... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
// --------------------------------------------------------
template<class T> bool chmax(T& a, const T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T b) { if (b < a) { a = b; return 1... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define vll vector<ll>
#define vvll vector<vll>
#define mll map<ll,ll>
#define f(i,m,n) for(i=m;i<n;i++)
#define ee endl
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define take(v,n) for(i=0;i<n;i++) cin>>v[i];
#def... | #include <iostream>
using namespace std;
int main(){
int n, t=0, x; double s;
cin >> n >> s;
s = (int)s*100;
int a[n+1]={0}, b[n+1]={0};
for (int i=1; i<=n; i++)
cin >> a[i] >> b[i];
for (int i=1; i<=n; i++){
x = a[i]*b[i];
t += x;
if (t > s){
cout << i << endl; return 0;
}
}
cout << -1 << ... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x) cerr << "Line " << __LINE__ << ": " << #x << " = " << (x) << "\n";
#define spa << " " <<
#define fi first
#define se second
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
using ld =... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define debug(var) do{cout << #var << " : "; view(var);}while(0)
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;ret... |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
template<class T,class U>
inline bool chmax(T &a,U b){
if(a<b){
a=b;
return true;
}
return false;
}... | /***
Bismillahir Rahmanir Rahim
Rabbi Zidni Ilma
Author : Saidur Rahman
Department of CSE, City University, Bangladesh.
***/
#include<bits/stdc++.h>
using namespace std;
#define ... |
//ABHISHEK AGRAWAL,BIT mesra//
//Newbie......You have to be odd to be no. ONE :)//
//Authhor: Abhishekagrawal
//Date: 20/02/2021
//Time: 17:30:13
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld ... | #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)++)
ll M = 998244353;
ll mpow(ll x, ll n){ //x^n(mod M) ←普通にpow(x,n)では溢... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ll long long
#define ull unsigne... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define ... |
#include <iostream>
#include <algorithm>
#include <vector>
#define int long long
using namespace std;
vector<pair<int,int>>x, y;
signed main()
{
int N;
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> N;
int i;
for (i = 0; i < N; i++)
{
int a, b;
cin >> a >> b;
x.push_back({ a,i });
y.push_back({ ... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<int,int,int> tp;
int main(){
int n; cin >> n;
set<int> house;
vector<P> h(n);
vector<int> X(4);
X[0] = X[1] = -1e9;
... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
int a,b,c,d;
bool check(int a,int b,int c,int d)
{
if(a + b == c + d || a - b == c - d || abs(a-c) + abs(b-d) <= 3) return true;
return false;
}
signed main()
{
cin >> a >> b >> c >> d;
if(a == c && b == d) {puts("0"); return 0;}
els... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
long long r1,r2,c1,c2, a, b;
cin >> r1 >> c1;
cin >> r2 >> c2;
int x;
a=abs(r2-r1); b=abs(c2-c1);
if(a==0&&b==0){x=0;cout<< x <<endl;return 0;}
if((a+b)<4||a-b==0){x=1;cout<< x <<endl;return 0;}
if((a+b)%2==0||ab... |
#include <bits/stdc++.h>
using namespace std;
const int64_t INF = INT64_C(1) << 60;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
int64_t X;
cin >> X;
vector<int64_t> A(N);
for (auto &&e : A) {
cin >> e;
}
int64_t res = INF;
for (int k = 1; k < N + 1; k++) {
... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define rep(i, n) for(int i=0;i<(int)(n);i++)
#define rep2(i, j, n) for(int i=j;i<(int)(n);i++)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<int, int>;
map<int, ll> table;
int main(){
int N;
cin >> N;
ll C;
cin ... |
#include <bits/stdc++.h>
inline int read( ) {
int x = 0;
char c = getchar( );
while ( !isdigit( c ) ) c = getchar( );
while ( isdigit( c ) ) {
x = x * 10 + ( c ^ 48 );
c = getchar( );
}
return x;
}
const int N = 107, mo = 1e9 + 7;
inline int qp( int b, int p ) {
int ret = 1;
while ( p ) {
if ( p & 1 ) ret... | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0, length = n; i < length; 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... |
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.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 ll long long
#define rep(i,j,n)... | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define REP(i,j) for(int i=0;i<j;i++)
#define REPA(i,j) for(int i=1;i<=j;i++)
#define FORN(i,j,k) for(int i=j;i<k;i++)
#define vi vector<int>
#define vvi vector<vi >
#define p... |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<queue>
#include<vector>
#define IL inline
#define re register
#define LL long long
#define ULL unsigned long long
#ifdef TH
#define debug printf("Now is %d\n",__LINE__);
#else
#define debug
#en... | #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> ;
const int mod=1000000007;
const int N=1e5 ;
const int INF=1001001001;
void solve(){
string s ;
cin>>s;
int n=s.length() ;
//cout<<n<<"\n" ;
ll ans=0 ;
map<char,int> mp ;
mp[s.ba... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int64_t> a(n), b(n);
for (auto &ai : a) {
cin >> ai;
}
for (auto &bi : b) {
cin >> bi;
}
int64_t mxa = a[0];
int64_t c = a[0] * b[0];
cout << c << '\n';
for ... | #include<bits/stdc++.h>
using namespace std;
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define ll long long int
// #define int ll
#define vi vector<ll>
#define vvi vector<vi>
#define pii pair<int, int>
#define vii vector<... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string str;
cin >> str;
int n = str.length() - 1;
char ch = ' ';
long long ans = 0;
for (int i = 0; i <=n; i++)
{
if (i !=n &&str[i]!=ch&& str[i] == str[i + 1] && str[i] != str[i + 2])
{
ans += n - i -1;
... | #include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stri... |
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false); cin.tie(0);
int a, b, c;
cin >> a >> b >> c;
if(c % 2 == 0) {
a = abs(a);
b = abs(b);
}
if(a == b) cout << "=";
else cout << (a > b ? ">" : "<");
} |
#include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
vector<int> vec(3);
for (int i = 0; i < 3; i++) {
cin >> vec[i];
}
sort(vec.begin(), vec.end(), greater<int>());
cout << vec[0]... | ///////////////////////Loading Payloads.......////////////////////////////
#include<bits/stdc++.h>
#define f(i,a,b) for(int i = a; i < b; i++)
#define fd(i,a,b) for(int i = a; i > b;i--)
#define fld(i,a,b) for(ll i = a ; i > b;i--)
#define ll long long
#define fl(i,a,b) for(ll i = a; i < b; i++)
#define VI vector<int>
... |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
void solve(long long X, long long Y, long long A, long long B) {
ll exp_a = 0;
while (true) {
if (X > Y / A) break;
if (X * A >= X + B) break;
if (X * A >= Y)... | #include <bits/stdc++.h>
#define int long long int
#define ll long long int
#define ld long double
#define getFaster ios_base::sync_with_stdio(false), cin.tie(nullptr)
#define rep(i, init, n) for (int i = init; i < (int)n; i++)
#define rev(i, n, init) for (int i = (int)n; i >= init; i--)
#define MOD1 1e9 + 7
#define MO... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define vec vector
#define rep(i,n) for (int i=0; i<(n); i++)
#define print(a) cout << a << endl
#define fix(n) fixed << setprecision(n)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define Yes "Yes"
#d... | /*author - Ashutosh Chitranshi*/
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,... |
/*AUTHOR - LAKSHYA JAIN*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define vl vector<long long>
#define vll vector<pair<long long,long long>>
#define vii vector<... | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... |
/*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).be... | #include <iostream>
#include <cstring>
#include <cstdio>
#include <map>
#define N 200008
using namespace std;
int a[N],f[N];
map<int,int>mp[N];
int find(int);
int main()
{
map<int,int>::iterator k;
int i,n,q,typ,x,y;
scanf("%d %d",&n,&q);
for(i=1;i<=n;++i)
{
scanf("%d",&a[i]);
f[i]=i;mp[i][a[i]]=1;
}
while(q... |
#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
long long n;
unordered_set<long long> st;
int main()
{
long long ans = 0;
cin >> n;
for (int i = 2; ; ++i)
{
if ((long long)round(pow(i, 2)) > n)
break;
for (int j = 2; ; ++j)
{
if ((... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ff first
#define ss second
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define d(a,b,c) cout<<a<<" "<<b<<" "<<c<<'\n'
#define IO ios_base::sync_with_stdio(0);cin.tie(0);
int main()
{
IO;
string s; cin >> s;
char lstc... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)
const int INF = 1001001001;
int N;
vector<int> A;
vector<pair<int,int>> X;
vector<int> Side;
vector<int> Stacks[2];
string a... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(),(x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#d... | //Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//#define int long long
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P... |
#include <cstdio>
#include <cstdlib>
using namespace std;
#define ll long long
const ll MAXN = 400011;
struct fhqTreap {
ll tot, rt;
ll val[MAXN], sum[MAXN], sz[MAXN], ls[MAXN], rs[MAXN], rd[MAXN];
void pushup(ll u) {sz[u] = sz[ls[u]] + sz[rs[u]] + 1; sum[u] = sum[ls[u]] + sum[rs[u]] + val[u];}
void split(ll u, ... | #include <bits/stdc++.h>
using namespace std;
struct BIT {
vector<int64_t> t;
BIT (int n) : t(n, 0) {}
void update(int i, int64_t x) {
for (; i < int(t.size()); i |= i + 1) {
t[i] += x;
}
}
int64_t query(int i) {
int64_t res = 0;
for (; i > 0; i &= i - 1)... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
constexpr ll MOD=998244353;
constexpr ll INF=2e18;
int main(){
int n; cin >> n;
vector<P> p(n);
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=n... |
#include <bits/stdc++.h>
using namespace std;
typedef long long i64;
typedef unsigned long long ui64;
typedef vector<i64> vi;
typedef vector<vi> vvi;
typedef pair<i64, i64> pi;
#define pb push_back
#define sz(a) i64((a).size())
#define all(c) (c).begin(), (c).end()
#define REP(s, e, i) for(i=(s); i < (e); ++i)
inlin... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author tatsumack
*/
#include <iostream>
#include <fstream>
#include <bits/stdc++.h>
#define int long long
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (... |
#include <bits/stdc++.h>
#define union Union
#define rank rank228
#define tm tm228
#define hash hash228
#define matr vector < vector < int > >
#define int long long
#define pii pair < int, int >
#define papa pair < node*, node* >
#define all(v) v.begin(), v.end()
#define endl "\n"
#define pb push_back
#define PI 3.1415... | #include<bits/stdc++.h>
using namespace std;
#define asll unsigned long long
#define ll long long
#define ld long double
#define imt int
#define pii pair<int,int>
#define st first
#define nd second
#define psbk(x) push_back(x);
#define For(x,a,b) for(int x=(a);x!=(b+((b-a)/abs(b-a)));x+=(b-a)/abs(b-a))
#define FOR(x,n... |
// Code for A - twiblr
#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,x,y) for(ll i=x;i<(ll)(y);i++)
#define MOD 1000000007
#define mod(x) ( (x) % MOD + MOD ) % MOD
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
te... | #pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << '(' << ... |
#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<LL,int>;
using vv = vector<vector<int>>;
const int INF = (int)1e9;
const LL LINF = (LL)1e18;
struct edge{
int to;
LL c, d;
edge(int to, LL c, LL d): to(to), c(c), d(d) {}
};
v... | #include <bits/stdc++.h>
using namespace std;
typedef long long i64;
typedef unsigned long long ui64;
typedef vector<i64> vi;
typedef vector<vi> vvi;
typedef pair<i64, i64> pi;
#define pb push_back
#define sz(a) i64((a).size())
#define all(c) (c).begin(), (c).end()
#define REP(s, e, i) for(i=(s); i < (e); ++i)
inlin... |
#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;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define reset(x) memset(x... | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
#define ll long long
const long long llINF = 1LL << 60;
const int iINF = 0x20000000;
template<class T> inline bool chmin(T& a, T b) { if (b < a) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; r... |
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
long long r1, c1, r2, c2, x, y;
int main() {
cin >> r1 >> c1 >> r2 >> c2;
x = abs(r1 - r2);
y = abs(c1 - c2);
if (r1 == r2 && c1 == c2) {
cout << 0;
} else if (y == x || x + y <= 3) {
cout << 1;
} else if ((x + y) % 2 == ... | #include <bits/stdc++.h>
#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 REP_R(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) ::std::begin(x), ::std::en... |
#include <bits/stdc++.h>
using namespace std;
const long long maxN = 6e5+10;
long long a[maxN],temp[maxN];
long long N;
long long tree1[maxN],tree2[maxN];
long long lowbit(int x){return x&(-x);}
void add(long long tree[],long long x,long long k){for(;x<=N*2;x+=lowbit(x))tree[x]+=k;}
long long pre(long long tree[],lon... | //I'll always miss you like a darling.
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define LD long double
#define ull unsigned long long
#define x first
#define y second
#define pb push_back
#define pf push_front
#define mp make_pair
#define Pair pair<int,int>
#define pLL pair<LL,LL>
#define pii... |
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int32 int32_t
#define int long long
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int did[202020];
vector<int> ret;
int main() {
int n;
cin>>n;
vector<int> p(n),r(n);
rep(i,n){
ci... |
#include<iostream>
#include<cstdio>
#include<queue>
#define ll long long
using namespace std;
struct node{
int num,id;
};
int n,x,Q,u,d;
int edgenum,NIL=-1,head[200005],nex[400005],vet[400005];
int h[200005],fa[200005],Size[200005],son[200005];
int Num[200005],t[200005];
bool vis[200005];
queue<node> q[200005];
void a... | #include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setpre... |
#include<iostream>
#include<set>
#include<vector>
using namespace std;
typedef long long li;
#define rep(i,n) for(int i=0;i<(n);i++)
#define df 0
template<class T> void print(const T& t){ cout << t << "\n"; }
template<class T, class... Ts> void print(const T& t, const Ts&... ts) { cout << t; if (sizeof...(ts)) cout << ... | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std;
void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long ... |
/*
* Author: Moon-light
*/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define lowbit(x) ((x)&(-x))
#define sz(x) ((int)x.size())
#define fr(x) freopen(x,'r',stdin)
#define fw(x)... | #include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define rep(i,n) for(int i = 0; i < n ; ++i)
#define REP(i,a,b) for(int i = a ; i <= b ; ++i)
#define filei freopen("input.txt", "r", s... |
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ll long long int
#define vi vector<int>
#define pb push_back
#define pop pop_back
using namespace std;
int main(){
ll n,k;
cin>>n>>k;
vector<pair<ll,ll>>v;
while(n--)
{
ll x,y;
cin>>x>>y;
v.pb({x,y});
}
sort(v.begin... | #include<bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define ll long long
#define mset(A,val) memset(A,val,sizeof(A))
#define fi(a,b) for(int i=a;i<=b;++i)
#define fj(a,b) for(int j=a;j<=b;++j)
#define all(x) x.begin(),x.end()
#define vi vector<int>... |
#include<bits/stdc++.h>
#define re register
using namespace std;
inline int read(){
re int t=0;re char v=getchar();
while(v<'0')v=getchar();
while(v>='0')t=(t<<3)+(t<<1)+v-48,v=getchar();
return t;
}
const int M=998244353;
inline void add(re int &x,re int y){(x+=y)>=M?x-=M:x;}
inline int ksm(re int x,re int y){
re... | #include <sstream>
#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <array>
#include <deque>
#include <numeric>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <list>
#include <cassert>
#include <cmath>
#include <climits>
#include <map>
#include <queue>
... |
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define inf 1e17
#define precise(x,y) fixed<<setprecision(y)<<x
#define int long long
#define float double
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define f(n) for(int i=0;i<n;i++)
#define fa(n) int a[n];for(int i=0;... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define isin(x,l,r) ((l) <= (x) &&... |
// C headers
#include <cassert>
#include <cctype>
// #include <cerrno>
#include <cfloat>
// #include <ciso646>
#include <climits>
// #include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#i... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
long long s = 0;
for (int i = 1; i <= n; i++){
if (s >= n){
cout << i - 1;
return 0;
}
s += i;
}
if (n == 1){
cout << 1;
}
else if (n == 2){
cout ... |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
ll N;
cin >> N;
vector<pair<ll, ll>> edge(N - 1);
vector<vector<ll>> g(N);
for (ll i = 0; i < N - 1; i++)
{
ll a, b;
cin >> a >> b;
a--;
b--;
g[a].push_ba... | #include <iostream>
#include <climits>
#include <utility>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <algorithm>
#include <chrono>
#include <array>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <numeric>
using namespace ... |
#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>;
const int inf = INT_MAX;
int main() {
int n, x; cin >> n >> x;
vector<int> ans; rep(i, n) {
int a; cin >> a; if (a == x)continue;
ans.push_back(a);
}for (int i : ans)cout ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <unordered_set>
#include <cstdlib>
#include <cmath>
#define ll long long
using namespace std;
int main(){
ll i,j,n,x,a,flag=0;
cin >> n >> x;
for (i = 0; i < n; i++) {
cin >> a;
if (a != x) {
if (flag == 1) {
cout << " ";
}
cout ... |
#include<bits/stdc++.h>
using namespace std;
const long long mod=998244353,INF=1e18;
#define ll long long
#define pll pair<ll,ll>
#define x first
#define y second
#define p_all(arr) for(auto i:arr){cout<<i<<" ";}cout<<"\n";
vector<ll> par,sze;
ll root(ll a)
{
if(a==par[a])
return a;
return par[a]=root(par[a... | using namespace std;
#include "bits/stdc++.h"
// add your library with double quotation #include"" here.
// #include "atcoder/all"
// using namespace atcoder;
// define your macros here.
// #define REP(a,b) for(long long a = 0;a < b;++a)
using namespace std;
typedef string::const_iterator State;
#define eps 1e-8L
#d... |
#line 1 "/workspaces/compro/lib/template.hpp"
#line 1 "/workspaces/compro/lib/io/vector.hpp"
#include <iostream>
#include <vector>
#ifndef IO_VECTOR
#define IO_VECTOR
template <class T> std::ostream &operator<<(std::ostream &out, const std::vector<T> &v) {
int size = v.size();
for (int i = 0; i < size; i++) {
... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
long long A, B, C;
cin >> A >> B >> C;
if (A % 10 == 0) {
cout << 0 << endl;
return 0;
}
vector<int> number;
{
long long x = A % 10;
number.push_back(x);
for ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef pair<int,int> P;
typedef tuple<int,int,int> tpl;
#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).e... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define Mp make_pair
#define pb push_back
using ll = long long;
using db = double;
using pii = pair<int, int>;
using vi = vector<int>;
mt19937 mrand(time(0));
ll get(ll r) { return ((ll)mrand() * mrand() % r + r) % r; }
ll get(ll l, ll r)... |
// Template
#include "bits/stdc++.h"
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep3(i, l, r) for (int i = (int)(l); i < (int)(r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define per(i, n) for (ll i = (ll)(n) - 1; i >= 0; ... | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
//using namespace boost::multiprecision;
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> P;
#define PI 3.141592653589793
#define MOD 1000000007
//#define MOD 998244353
#define ALL(obj) (obj).begin(),(obj).e... |
#include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(int i=0;i<(n);i++)
#define REP1(i,n) for(int i=1;i<(n);i++)
#define REP2(i,d,n) for(int i=(d);i<(n);i++)
#define RREP(i,n) for(int i=(n);i>=0;i--)
#define CLR(a)... | #include<bits/stdc++.h>
using namespace std;
#define INF 9999999999999999
template<class T>
bool chmin(T& a,T b)
{
if(a > b)
{
a = b;
return true;
}
else
{
return false;
}
}
struct Edge
{
long long to;
long long weight;
long long time;
};
long long calc(long long nowminute,long... |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include ... | //#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using db = double;
using ld = long double;
template <typename T> usin... |
// 問題の URL を書いておく
//
#include <bits/stdc++.h>
using namespace std;
//#define ENABLE_PRINT
#if defined(ENABLE_PRINT)
#define Print(v) \
do {\
cout << #v << ": " << v << endl; \
}while(0)
#define PrintVec(v) \
do {\
for(int __i = 0; __i < v.size(); ++__i) \
{ \
cout << #v << "[" << __i << "]: "... | #include <iostream>
#include <array>
#include <algorithm>
#include <vector>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define reps(i,s,n) for (int i = (int)(s); i < (int)(n); i++)
#define prl(a) cout << (a) << endl
#define allrange(a) a.begin(),a.end()
bool solve_translated(vector<pair<i... |
#include<bits/stdc++.h>
#define X first
#define Y second
#define eb emplace_back
#define pb push_back
#define print1d(x) for(auto i : x){ cout << i << " ";} cout << '\n'
#define print2d(x) for(auto u : x){ print1d(u);} cout << "------" << '\n'
#define CLR(x, y) memset(x, y, sizeof(x))
#define ALL(X) X.begin(), X.end()
... | #include <bits/stdc++.h>
using namespace std;
long long c[64][64];
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
c[0][0] = 1;
for (int i = 1; i < 64; i++) {
c[i][0] = c[i][i] = 1;
for (int j = 1; j < i; j++) {
c[i][j] = c[i - 1][j - 1] + c[i - 1][j];
}
}
int a, b;
long long k;
cin >> a >> b >> ... |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using ll = long long; using ull = unsigned long long;
using pii = pair<int, int>; using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>;
using pll = pair<ll, ll>; using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
double dp[105][105][105];
double dfs(int a,int b,int c,int cnt){
if(a==100||b==100||c==100){
return cnt;
}
if(dp[a][b][c]) {
return dp[a][b][c];
}
dp[a][b][c]=(a*dfs(a+1,b,c,cnt+1)+b*dfs(a,b+1,c,... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll a;
cin >> a;
ll b;
cin >> b;
ll c;
cin >> c;
if((a*a+b*b)<c*c) {
cout << "Yes" <<'\n';
} else {
cout << "No" <<'\n';
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll; //int:2*10**9
typedef long double ld;
typedef pair<ll,ll> P;
#define REP(i,n) for(ll i = 0; i<(ll)(n); i++)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)
#define vec2(name,i,j,k) vector<vector<ll>> name(i,vect... |
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
#define int long long
unordered_map <int, int> dp, seen;
int x;
int go(int y) {
if(x >= y) return abs(x-y);
if(... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typed... |
#include<bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(),v.end()
#define puts(i) cout << i << endl
#define INF INT_MAX
#define INFL LLONG_MAX
typedef long long ll;
using namespace std;
int main(){
ll n;
cin >> n;
string s;
cin >> s;
char d... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
string a, b, c, p;
set<char> st;
char mp[26];
ll str_to_num(string s) {
ll res = 0;
for (char x : s) res = 10*res + mp[x-'a'];
return res;
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(nullptr);
cin>>a>>b>>c;
for (char x : a) st... |
#include<iostream>
#include<vector>
#include<string>
#include<sstream>
#include<functional>
#include<algorithm>
#include<map>
#include<queue>
#include<stack>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<long long>> a(n, vector<long long>(n)),coma(n,vector<long long>(n)), comb(n, vector<long long>... | // template
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
struct Input
{
int id;
int x;
int y;
int r;
int sx,sy,gx,gy;
};
bool compare_pos(Input a, Input b)
{
if (a.x == b.x)
{
return a.y < b.y;
}
else
{
return a.x < b.x;
}
}
bool compare_id(Input a, Input b)... |
#include <bits/stdc++.h>
#define f(a, n) for (int a = 0; a < n; a++)
#define F(a, n) for (int a = 1; a <= n; a++)
using namespace std;
struct Student{
map<int, int> mp;
int sz = 1;
Student* par = this;
};
Student* find(Student* a){
if (a->par == a) return a;
return a->par = find(a->par);
}
void join(Student* a... | //#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h> ... |
#include <bits/stdc++.h>
#define endl '\n'
#define modulo 1000000007
#define int long long
#define PI acos(-1)
#pragma GCC optimize("-Ofast")
#pragma GCC optimize("trapv")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx2,tune=native")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fun... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef pair<long long, long long> pl;
#define rep(i, a, b) for (int i = a; i < b; i++)
void solve()
{
ll a, b;
cin >>a >> b;
ll sa = 0;
while(a > 0){
... |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long x, y, a, b;
long long s;
cin >> x >> y >> a >> b;
s = 0;
while ( x*a <= x+b && x*a < y && x < x*a) {
x *= a;
s++;
}
s += ( (y-x-1) / b < 0 ? 0 : (y-x-1) / b );
cout << s << endl;
r... | #include<bits/stdc++.h>
using namespace std;
#define arep(i,x,n) for(int i=int(x);i<(int)(n);i++)
#define rep(i,n) for(long long i = 0;i < n;++i)
#define rrep(i,n) for(int i=int(n-1);i>=0;i--)
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define coy c... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n,m,q;
cin >> n >> m >> q;
vector<int> w(n);
vector<int> v(n);
for (int i=0;i<n;i++) cin >> w[i] >> v[i];
vector<int> x(m);
for (int i=0;i<m;i++) cin >> x[i];
for (int i=0;i<q;i++) {
int l,r... | //@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;
typedef long long ll;const int mod = 1000000007;
//const int mod = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x=0):x((x%mod+mod)%mod){}
mint operator-() const { return mint(-x);}
mint& operator+=(const mint a) {
if ((x += a.x)... | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<tuple>
#include<cmath>
#include<iomanip>
using namespace std;
typedef long long ll;
typedef vector<ll> v;
typedef vector<vector<ll>> vv;
#define MOD 1000000007
#define INF 10... |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
constexpr ll MOD = 998244353;
#ifndef ONLINE_JUDGE
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " (" << x.first << " : " ... | #include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<set>
#include<iterator>
#include <map>
#include<cmath>
#include <list>
#include<string>
#include <stdlib.h>
#include<ctime>
#include<cstring>
#define fastIO ios_base::sync_with_stdio(false);cin.tie(NULL);
#define line cout<... |
#include<bits/stdc++.h>
using namespace std;
const int maxn=5e5+100;
int read()
{
int ans=0;bool f=0;char ch=getchar();
while(ch<'0' or ch>'9'){if(ch=='-')f=1;ch=getchar();}
while(ch>='0' and ch<='9'){ans=(ans<<1)+(ans<<3)+(ch^48);ch=getchar();}
return f?~ans+1:ans;
}
int n,ans,nx[maxn],per[maxn];
char s1[maxn],s2[... | #pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
#pragma GCC optimize(3 , "Ofast" , "inline")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <unordered_map>
#include <... |
#pragma GCC optimize "trapv"
#include<iostream>
#include <bits/stdc++.h>
using namespace std;
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define l... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=2e5+5;
int mod=1e9+7;
int gcd(int x,int y)
{
if(y==0)
{
return x;
}
return gcd(y,x%y);
}
int power(int a,int n)
{
int res=1;
while(n)
{
if(n%2)
{
res=(res*a)%mod;
}
... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double d;
typedef long double ld;
inline int read()
{
register int s=0,f=0;
register char ch=getchar();
while(!isdigit(ch)) f|=(ch=='-'),ch=getchar();
while(isdigit(ch)) s=(s<<1)+(s<<3)+(... |
#include <iostream>
#include <iomanip>
#include <vector>
#include <array>
#include <stack>
#include <queue>
#include <tuple>
#include <algorithm>
#include <unordered_set>
#include <cmath>
using ull = unsigned long long;
using ll = long long;
#define REP(i, n) for(ll i=0;i<(ll)n;i++)
#define REPab(i,a,b)for(ll i=(ll)... |
#include <bits/stdc++.h>
#include <math.h>
#include <string.h>
#include <stdlib.h>
#include <list>
#define eps 10e-14
//cout<<fixed<<setprecision(15)<<
//s=to_string(100);
//vector<vector<char>>c(h,vector<char>(w));
//next_permutation(orig.begin(),orig.end());
using namespace std;
int gcd(int x,int y){
while(y>0){
... | #include <iostream>
#include <vector>
#include <set>
using namespace std;
typedef long long ll;
const ll INF = 1e18 + 2000;
ll mdist (const set<pair<ll, int>> &A, const set<pair<ll, int>> &B) {
ll ans = INF;
for (auto it = A.begin(); it != A.end(); it++) {
auto oth = B.lower_bound(*it);
if (oth != B.end... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
void check(long long &a, vector<int> &v, vector<int> &c, int i, int &lc){
if(c.at(i) == lc){
a++;
return;
}
if(c.at(i) != -1){
return;
}
c.at(i) = lc;
check(a, v, c, v.at(i), lc);
}
int main(){
... | #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 <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <b... | #include<bits/stdc++.h>
#define int long long
#define ll long long
#define speed ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define fs first
#define sd second
#define rept(x,n) for(int i=x;i<n;i++)
#define rrept(n,x) for(int i=n-1;i>=x;i--)
#define all(v) v.begin(),v.end()
#define mpit map<int,int>::... |
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
#define double long double
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef vector<pii> VP;
t... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <c... |
#include<iostream>
#include<iomanip>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<deque>
#include<set>
#include<stack>
#include<numeric>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
struct Ed... | #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 int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC targe... |
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+5;
int a[N],b[N];
bool visited[N];
vector<int>adj[N];
long long add,sub;
void DFS(int cur)
{
if(visited[cur])return;
visited[cur]=1;
if(a[cur] > b[cur])sub+=a[cur]-b[cur];
else add+=b[cur]-a[cur];
for(int it : adj[cur])DFS(it);
}
int m... | //#undef DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll llinf = (1ll<<61)-1;
const char lf = '\n', splf[] = " \n";
#define sz(a) int(a.size())
#define all(x) begin(x), end(x)
#define TCC template<class C
#define OSO ostream &operator<<(ostream &os, const
#ifdef DEBUG
const int DEBUG_... |
#include "bits/stdc++.h"
#pragma GCC optimize "03"
using namespace std;
#define int long long int
#define double long double
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
#define rep(i,a,b) for (int i = a; i < b; ++i)
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL);
#ifn... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
struct Lucas {
vector<vector<long long>> table;
long long p;
Lucas(long long _p) : p(_p) { init(p); }
void init(long long p) {
table.assign(p, vector<long long> (p));
table... |
#include<bits/stdc++.h>
using namespace std;
//#include <atcoder/scc>
//using namespace atcoder;
//using mint = modint998244353;
//using mint = modint1000000007;
#pragma region template
using ll = long long;
using PII = pair<int, int>;
using PLL = pair<ll, ll>;
template <class T> using V = vector<T>;
template <class T>... | #include<iostream>
using namespace std;
#include<bits/stdc++.h>
typedef long long int ll;
void dfs(int i,vector<vector<int>>&adj,int vis[]){
vis[i]=1;
for(int child:adj[i]){
if(vis[child]==0)
dfs(child,adj,vis);
}
}
int main(){
int n,m;
cin>>n>>m;
vector<vector<int>>adj(n+1);
int u,v;
for(int ... |
//BY: YASH JAIN, CF: BitSane
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
#define May_the_fork_be_with_... | #include <iostream>
using namespace std;
int main()
{
int n,k;
long long res=0;
cin>>n>>k;
for (int i=1;i<=n;i++)
for (int j=1;j<=k;j++)
{
res+=100*i+j;
}
cout<<res;
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
long long x,y,a,b;
cin >> x >> y >> a >> b;
long long ans=0;
while((double)a*x<=2e18 && a*x<=x+b && a*x<y){
x*=a;
ans++;
}
cout << ans+(y-1-x)/b << endl;
}
| #include <bits/stdc++.h>
#define rep(i,n) for (int i = (0); i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define limit(x,l,r) ma... |
// 解き直し.
// https://atcoder.jp/contests/abc191/editorial/610
// C++(GCC 9.2.1)
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; ... | #include<bits/stdc++.h>
using namespace std;
#define endline '\n'
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll,ll>
#define pi pair<int,int>
#define pb push_back
#define fr(i,a,b) for(int i=a;i<(int)b;i++)
#define rfr(i,a... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define repA(i,k,n) for(int i=k;i<=(n);++i)
#define repD(i,k,n) for(int i=k;i>=(n);--i)
#define endl '\n'
#define print(b) for(auto a:b) cout<<a<<' ';
#define printN(b) for(auto a:b) cout<<a<<endl;
#define fin freopen("C:\\Users\\Nazmul Rahul\\D... | //FEARLESS
//Fear is the path to the dark side.
//Fear leads to anger. Anger leads to hate.
//Hate leads to suffering. - Master Yoda
// Templates
// 1. tempgeo.cpp
// 2. tempunion.cpp
#include <bits/stdc++.h>
using namespace std;
#define ll int64_t
#define pb push_back
#define pii pair <int, int>
#define pll pair <l... |
#include<bits/stdc++.h>
using namespace std;
#define fast {ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);}
typedef long long int ll;
typedef string S;
#define M 1e18
#define AS 250005
#define sp cout<<' '
#define nw cout<<endl
#define rt return
#define __ template<typename T, typename... Types>
void in() {rt;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,k,m,sum,z;
sum=0;
cin >> n >> k >> m;
vector<int> A(n-1);
for (int i=0;i<n-1;i++)cin >> A.at(i);
for (int j=0;j<n-1;j++)sum+=A.at(j);
if(sum+k<n*m)cout << "-1" <<endl;
else{
z=n*m-sum;
if(z<=0)cout << 0 <<endl;
else cou... |
#include <iostream>
using namespace std;
int main() {
// your code goes here
int a,b,c;
cin>>a>>b>>c;
if(a==b)
cout<<c;
else if(a==c)
cout<<b;
else if(b==c)
cout<<a;
else
cout<<"0";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C;
cin >> A >> B >>C;
if(A*A+B*B<C*C) printf("Yes");
else printf("No");
}
|
#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() {
ll n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
sort(a.rbegin(), a.rend());
ll ans = 0;
ll b = n - 1;
rep(i, n) {
ans += a[i] * b;
b ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n; cin >> n;
long long a[n];
long long b[n] = {};
for (int i = 0; i < n; ++i) cin >> a[i];
sort(a, a + sizeof(a)/sizeof(a[0]));
for(int i = 0; i < n-1; ++i) {
if(i == 0){
b[n-1] = a[n-1]-a[n-2];
} else {
b[n-1-i] = b[n-i... |
#include<bits/stdc++.h>
#define pl(a) " [" << #a << ": " << (a) << "] "
#define pts(a) " [" << #a << ": { first: " << (a.first) << ", second: " << (a.second) << "}] "
#define all(vi) vi.begin(), vi.end()
#define endl "\n"
#define ll long long
using namespace std;
pair<int, int> n4[4] { {1, 0}, {-1, 0}, {0, 1}, {0, ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<pair<long long, long long> > prime_factorize(long long N) {
vector<pair<long long, long long> > res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0) continue;
long long ex = 0;
while (N % a == 0) {
... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, q;
cin >> n >>q;
vector<long long> a(n), c(n);
long long x;
for (int i=0; i <n; i++){
cin >> x;
if (i == 0){
a.at(i) = x;
c.at(i) = x-1;
}
else{
a.at(i) = x;
... | #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;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/detail/standard_policies.hpp>
// using namespace __gnu_pbds;
#pragma GCC optimize("O3")
#ifdef LOCAL
#include "/Users/lbjlc/Desktop/coding/debug_utils.h"
#else
#define print(...) ;
#define printn(...) ;
#de... | /*
after dusk passed,
there is a starry sky.
*/
#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define m_k make_pair
using namespace std;
const int N=2*1e5+100;
int n,a[N],b[N],p[N],vi[N],wh[N];
vector <pair<int,int> > ans;
priority_queue <pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > > q;
inline int re... |
#include <bits/stdc++.h>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
#define me0(a) memset(a,0,sizeof(a))
#define me1(a) memset(a,-1,sizeof(a))
#define op freopen("in.txt", "r", stdin)
#define op1 freopen("C:\\acm\\Cproj\\in.txt","r",stdin);
#define pr freopen("C:\\acm\\Cproj\\out.t... | #include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define dl double long
using namespace std;
const int N = 1e4 + 7;
const long long mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n;
string s = "AB";
map < char , map < char , char > > c;
int ... |
#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 main() {
int h,w,n,m;
cin >> h >> w >> n >> m;
vector<int> a(n), b(n);
vector<vector<int>> done(h, vector<int>(w,0));
rep(i,n){
cin >> a[i] >> b[i];
a[i]--; ... | #include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x <<... |
#include <bits/stdc++.h>
using namespace std;
int n,m;
int dist[2010][2010];
int dp[2010][2010];
vector<int> v[2010];
int main()
{
cin>>n>>m;
for(int i=0;i<m;i++)
{
int x,y,z;
cin>>x>>y>>z;
if(!dist[x][y]||dist[x][y]>z)
dist[x][y]=z;
}
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
if(dist[i][j])
v[i... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define FOR(i,s,n) for(int i = (s); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) for(int i = (n); i >= 0; i--)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.