code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include<bits/stdc++.h>
#define rep(i,a,b) for(ll i=(a);i<=(b);i++)
#define per(i,a,b) for(ll i=(a);i>=(b);i--)
#define lc(x) (x<<1)
#define rc(x) (lc(x)|1)
#define lowbit(x) (x&-x)
#define Max(a,b) (a>b?a:b)
#define Min(a,b) (a<b?a:b)
#define next Cry_For_theMoon
#define il inline
#define pb(x) push_back(x)
#define ma... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pt;
#define MOD 1000000007
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> ans(N, 2);
ans[0] = 1;
for(int i = 2; i <= N; i++) {
for(int j = 2; i * j <= ... |
/**
* author: shu8Cream
* created: 26.04.2021 09:06:13
**/
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
#define rep(i,n) for (int i=0; i<(n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using P = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
using namespa... | #include <bits/stdc++.h>
using namespace std;
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
// types
int debug;
struct Input {
int si, sj, num;
vector<vector<int>> t, p;
vector<int> sum_score;
Input(istr... |
#include <bits/stdc++.h>
using namespace std;
char str[4][30],q[20];
int cnt;
int mymap[30];
bool st[30];
bool jdg[20];
long long temp[10];
bool dfs(int s){
if(s>cnt){
for(int i=1;i<=3;i++){
if(mymap[str[i][1]-'a']==0) return false;
}
temp[1]=temp[2]=temp[3]=0;
for(int i=... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <tuple>
#include <cstdio>
#include <bitset>
#include <sstream>
#include <iterator>
#include <numeric>
#include <map>
#include <cstring>
#include <set>
#include <functional>
#include <... |
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<queue>
#include<map>
#include<stack>
#include<iomanip>
#include<cmath>
#include<complex>
#include<math.h>
using namespace std;
#define pb push_back
#define ll long long int
# define pii pair<int ,int>
# define pll pair<ll,ll>
# define fio io... | /*
#pragma GCC optimize(2)
#pragma GCC optimize(3,"Ofast","inline")
*/
#include<bits/stdc++.h>
#define ALL(x) (x).begin(),(x).end()
#define ll long long
#define db long double
#define ull unsigned long long
#define pii_ pair<int,int>
#define mp_ make_pair
#define pb push_back
#define fi first
#define se second
#define ... |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cstdio>
#include <cmath>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
using namespace std;
int n, m;
vector<int... | //12252024832524
#include <cstdio>
#include <cstring>
#include <algorithm>
#define TT template<typename T>
using namespace std;
typedef long long LL;
const int MAXN = 18;
const int MAXM = 105;
int n,m;
LL dp[1 << MAXN],pre[MAXN];
LL Read()
{
LL x = 0,f = 1;char c = getchar();
while(c > '9' || c < '0'){if(c == '-')f... |
#include"bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
typedef priority_queue... | /*
author : TAPAN SAVANI
codeforces : savanitapan2001
codechef : savanitapan17
*/
/*
------------------------------------------------------------------------
โโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโ... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int digit_sum(int n) {
if (n < 10) return n;
return digit_sum(n/10) + n%10;
}
int main() {
int a, b;
cin >> a >> b;
int sum_a = digit_sum(a), sum_b = digit_sum(b);
... | #define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2")
#define IOS ios::sync_with_stdio(false);cin.tie(0)
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define LLIN... |
//#define _GLIBCXX_DEBUG
//#include "atcoder/all"
//using namespace atcoder;
#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
#define Dump(x) \
if (dbg) { \
cerr << #x << " = " <<... | #include <iostream>
#include <cmath>
using namespace std;
typedef unsigned long long ll;
ll check(string ip, ll base, ll m){
ll ans =0;
ll curr = 0;
for(int i =ip.length()-1;i>=0;i--){
if(ans<0 || pow(base,curr)>m) return m+1;
ans+= (ll)((int)ip[i]-'0')*pow(base,curr);
curr++;
... |
/*/ Author: _Math.man /*/
#include<bits/stdc++.h>
using namespace std;
/*/---------------------------Defines-----------------------------------------/*/
#pragma GCC optimize("Ofast")
#define int long long
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define eb emplace_back
#... | //Bismillahir Rahmanir Rahim
// Rabbana Afrig Alayna Sabrao Wa Taffaiyana Muslimin
#include<bits/stdc++.h>
using namespace std;
#define int long long int
int i,j,k;
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 all(a)a.begin(),a.end()
#define rall(a)a.rbegin(),a.rend()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
const int mod2=998244353;
using P = pair<int,int>;
using Pl= pair<ll,ll>;
using ld=long double;
using V=vector<i... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeo... |
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i = (a); i < int(b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
const int MAX = 200000;
int N, Q;
vector<int> G[MAX + 1], qs[MAX + 1];
int depth[MAX + 1], in[MAX + 1], out[MAX + 1];
void d... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;//2,3,5,7,11//6,10
//6,10,15,
int A[N];
A[0]=6;A[1]=10;A[2]=15;
int j=-1;
for (int i=3; i<N; i++) {
A[i]=6*(i-1);
if (A[i]>10000) {
j=i;break;
}
}
int jj=-1;
if (j>0) {
int k=2;
for (... | //็บขๅคช้ณzhouakngyang txdy!
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
#define Macesuted cout<<"kawaii"<<endl
#define MatrixCascade cout<<"npsl"<<endl
#define Karry5307 cout<<"nmsl"<<endl
using namespace std;
#define int long long
inline int read()
{
int su... |
// Created at 2021/02/06 20:47
// {TODO}WA, {TODO}min, {TODO}diff
// goal: {TODO}min
#include <bits/stdc++.h>
//#include <atcoder/all>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i, n) for (lint i = 0, i##_len = n; i < i##_len; i++)
#define rep2(i, n) for (lint... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
void solve()
{
int a,b,c,d;
cin >> a >> b >> c >> d;
cout << a*d-b*c << "\n";
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int tt=1;
///cin >> tt;
while(tt--)
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,K,M;
cin >> N >> K >> M;
vector<int> A(N-1);
int sum=0;
for(int i=0;i<N-1;i++){
cin >> A.at(i);
sum += A.at(i);
}
if(N*M-sum <= K && N*M-sum >=0) cout << N*M-sum << endl;
else if(sum >= N*M) cout << 0 << endl;
else cout << -1 << ... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define all(v) v.begin(), v.end()
#define sz size()
#define mp make_pair
#define pb push_back
#define rep(p, a, b) for (ll p = a; p < b; p++)
#define F first
#define S second
using namespace std;
typedef vector<ll> vll;
typedef vector<ld> vld;
typede... |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cctype>
#define N 201000
template<typename T> inline void read(T &x) {
x = 0; char c = getchar(); bool flag = false;
while (!isdigit(c)) { if (c == '-') flag = true; c = getchar(); }
while (isdigit(c)) x = x * 10 + (c ^ 48), c = ... | #include<bits/stdc++.h>
//Ctrl + B
using namespace std;
#define endl '\n'
#define nitro {std::ios_base::sync_with_stdio(false); std::cin.tie(NULL);}
#define pi 3.141592653589793
#define mod 1000000007
#define lb lower_bound
#define ub upper_bound
#define all(v) v.begin(), v.end()
#define dbg(x) cout << x << '\n';
#defi... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pint = pair<int,int>;
using p = complex<double>;
void f(vector<p>& B) {
int N = B.size();
double x = 0, y = 0;
for(auto u : B)x += u.real(), y += u.imag();
x /= N, y /= N;
for(auto&u : B) {
u = {u.real() - x, u.imag() - y};
}
sort(B.be... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD int(1e9+7)
#define INF int(1e9)
#define LINF ll(1e18)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<ll,ll>
int n,t,half1,half2;
ll a[45];
ll f[1<<21];
ll nibutan(ll former){
ll latter=t-former;
int ok=0; int ng=(... |
#include <bits/stdc++.h>
#define ll long long
#define lll long long
#define mp make_pair
#define pb push_back
ll inf = 1000000000000000000;
#define deci(n) fixed << setprecision(n)
#define vll vector<ll>
#define vpll vector<pair<ll, ll>>
#define umll unordered_map<ll, ll>
#define mll map<ll, ll>
//#define f first
//#de... | ///Bismillahir Rahmanir Rahim
#include "bits/stdc++.h"
#define ll long long
#define int ll
#define fi first
#define si ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define Rrep(i,n) for (ll i = n - 1; i >= 0;i--)
#define ll long long int
#define INF 1000000007
#define llINF 1000000000000000007
#define v(i) vector<i>
#define vv(i) vector<vector<i>>
// int num = atoi(string.c_str()); ๆๅญๅใฎๆดๆฐๅค... | /*
Author: Zcus
Blog: cnblogs.com/Zcus
*/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define debug(x) cout << #x << " = " << x << endl
#define For(i, x, y) for (int i = x; i <= y; i++)
#define Rep(i, x, y) for ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ll long long
#define pp pair<ll,ll>
#define ld long double
#define all(a) (a).begin(),(a).end()
#define mk make_pair
int inf=1000001000;
ll INF=2e18;
ll mod=1000000007;
ll MOD=998244353;
int main() {
vector<int> a(4)... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define ll long long int
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
int main(){
int n, k, m ;
scanf("%d %d %d", &n, &k, &m);
vi v(n-1);
int sum = 0;
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long N; cin >> N;
vector<long> used(200000);
for(long i = 0; i < N; i++){
used[i] = 0;
}
long now_min = 0;
for(long i = 0; i < N; i++){
long p; cin >> p;
used[p] = 1;
if(p == now_min){
whil... | #include<bits/stdc++.h>
using namespace std;
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> p2;
#define sz(a) ll(a.size())
void solve(){
ll n;
cin>>n;
set<ll> s;
for(ll i=0;i<n+10;i++)
s.insert(i);
for(ll i=0;i<n;i++){
ll x;... |
#include <cstdlib>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ii pair<int,int>
#define vi vector<int>
#define vii vector<ii>
#define vc vector<char>
#define vs vector<string>
#define vd vector<double>
#define vll vector<ll>
#define vvi vector<vi>
#define vvii vector<vii>
#define vvc vect... | #include <bits/stdc++.h>
using namespace std;
#define M1 1000000007
#define M2 998244353
#define INF 1e18
#define ll long long
#define pll pair<ll,ll>
#define REP(i,a,b) for(ll i=a;i<b;i++)
#define REPR(i,a,b) for(ll i=b-1;i>=a;i--)
#define forr(i,n) for(ll i=0;i<n;i++)
#define F first
#define S second
#define pb push... |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define endl "\n"
#define REP(i, s, n) for (int i = (s); i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
#define CHECK(a) cout << #a << " " << a << endl;
#define CHECK_VEC(V) REP (i, 0, V.size()) cout << i << " " << V[i] << ... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;++i)
int main(){
long long n,a,s=0,ans=0;
cin>>n;
rep(i,n){
cin>>a;
ans+=a*a*n;
s+=a;
}
ans-=s*s;
cout<<ans<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int n;
inline bool check(int x) {
int u=x;
while(u) {
if(u%10==7) return false;
u/=10;
}
u=x;
while(u) {
if(u%8==7) return false;
u/=8;
}
return true;
}
int main() {
cin>>n;
int sum=0;
for(int i=1;i<... | // 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 min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
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_wi... | #include<bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int a,b;
// 3 1
cin>>a>>b;
int i,j;
for (i=-100;i<=100;i++){
for( j=-100;j<=100;j++){
if(i+j == a && i-j==b){
cout<<i<<" "<<j<<endl;
return 0;
... |
#include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>
#define endl '\n'
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const ll INF=1e10+1;
int main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
//freopen("input.txt","r",stdin);
ll n;
cin>>n;... | #include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<map>
#include<vector>
#include<math.h>
#include<stdio.h>
#include<stack>
#include<queue>
#include<tuple>
#include<cassert>
#include<set>
#include<bitset>
#include<functional>
#include <fstream>
//#include<bits/stdc++.h>... |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <random>
#include <queue>
#include <stack>
#include <bitset>
#include <cassert>
#include <unordered_map>
#include <iomanip>
typedef long long ll;
#define double long double
#define rep(i,... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
cout<<n-1;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
long long int a,b,c;
cin>>a>>b>>c;
if(c%2==0)
{
if(abs(a)==abs(b))
cout<<"=";
else if(abs(a)>abs(b))
cout<<">";
else
cout<<"<";
}
else
{
if(a>b)
cout<<">";
els... | #include <bits/stdc++.h>
#define int long long
#define f first
#define s second
#define rep(i,a,b)for(int i=a;i<b;i++)
#define pb push_back
const int mod = 1e9 + 7;
const int INF = 1e18;
const int SIZE = 1e6 * 5 + 5;
using namespace std;
void solve() {
int a[3];
cin >> a[0];
cin >> a[1];
cin >... |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define repx(i, x, n) for (ll i = (ll)(x); i < (ll)(n); i++)
const double PI = 3.1415926535897932;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int,int>;
int main(){
int a,b;
cin >> a >> b ;
... | /*
Auth: Loxilante
Time: 2020/10/03
Prog: ARC104-A
Lang: cpp
*/
#include <bits/extc++.h>
#define rep(i, l, r) for(int i = l; i < r; i++)
#define hrp(i, l, r) for(int i = l; i <= r; i++)
#define rev(i, r, l) for(int i = r; i >= l; i--)
#define ms(n, t) memset(n, t, sizeof(n))
#define pb push_back
#define int ll
#ifn... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define deb(x) cout<< #x << " " << x << "\n";
#define MAX 9223372036854775807
#define MIN -9223372036854775807
#define PI 3.141592653589
#define setbits(n) __builtin_popcountll(n)
#define mkunique(a) a.resiz... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define N 2114514
const ll mod = 998244353;
const ll inf = 1000000000000000000;
bool used[N];
void jk(ll s, ll d[], vector<vector<pair<ll, P>>>& v, ll n) {
priority_queue<P, vector<P>, greater<P>> que;
for (int i = 1; i... |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define REP(i, n) for (ll i = 0; i < ll(n); i++)
#define FOR(i, a, b) for (ll i = a; i <= ll(b); i++)
#define ALL(x) x.begin(), x.end()
typedef long long ll;... | //
// Created by K R, Siva Kumar on 23/01/21 at 6:24 PM.
//
#include <bits/stdc++.h>
using namespace std;
const double pi = 2 * acos(0.0);
const int mod = 1e9 + 7;
class Solver {
int n;
vector<int> a;
public:
void solve() {
cin >> n;
a.assign(n, 0);
map<int, int> mp;
for (int i = 0; i < n; i++... |
#pragma GCC optimize("Ofast", "unroll-loops")
#pragma GCC terget("avx2")
#include <bits/stdc++.h>
struct UnionFind{
std::vector<int> data;
/* constructor */
UnionFind() : data(0) {}
UnionFind(int sz){ data.assign(sz, -1); }
/* merge the set to which x belongs and the set to which y belongs */
... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
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; } re... |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
typedef long long ll;
using namespace std;
using P=pair<int,int>;
vector<vector<bool>> dp(101,vector<bool>(100001,false));
int main()
{
int n;
cin>>n;
vector<int> t(n);
rep(i,n) cin>>t[i];
int sum=0;
rep(i,n) sum+=t[i];
dp[0][0]... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#include <functional> // for less
#include <iostream>
usin... |
#include <bits/stdc++.h>
#define int long long
using namespace std;
struct R {
double x, y;
R(double _x, double _y) {
x = _x;
y = _y;
}
R() {}
};
struct Line {
double A, B, C;
Line (R a, R b) {
A = b.y - a.y;
B = a.x - b.x;
C = a.y * b.x-a.x * b.y;
}
Line (double _A, double _B, dou... | #include<bits/stdc++.h>
#define IMAX 1<<29
#define PI 3.14159265359
using namespace std;
template <class T>
using Graph = vector<vector<T>>;
/******** Utility ***************/
int bsize(int bits, int _max){
int c = 0;
for(int ix=0; ix!=_max; ++ix)
if((bits&(1<<ix)) !=0){
++c;
}
return c;
}
lon... |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include <functional>
#include <iomanip>
#include<cmath>
#include<deque>
#include <math.h>
#include <queue>
#include <sstream>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265359
using namespac... | //#define _GLIBCXX_DEBUG
//#include "atcoder/all"
//using namespace atcoder;
#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
#define Dump(x) \
if (dbg) { \
cerr << #x << " = " <<... |
#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))
#define popcount(x) __builtin_popcount(x)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
const int INF = 1e9;
const ... | #include <bits/stdc++.h>
using namespace std;
int n, m;
vector<vector<int>> adj;
long long ans=1;
long long comp_ans[25];
int color[100];
vector<vector<int>> component;
int visited[25] = {};
void discover(int vertex, int cid=-1) {
if (cid==-1) {
cid = component.size();
component.push_back(vecto... |
#include <bits/stdc++.h>
#define int long long
#define ri register int
using namespace std;
int n,m,ans,s[2];
char ch[25];
template <typename T> inline void read(T &x) {
register T f=0,c=getchar();
for (; c<48||57<c; c=getchar()) if (c=='-') f=1;
for (x=0; 48<=c&&c<=57; c=getchar()) x=(x<<3)+(x<<1)+(c&15);
if (f) x... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vp... |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep2(i,k,n) for (int i = k; i < (n); ++i)
#define ll unsigned long long
using namespace std;
using P = pair<int,int>;
int ceil(int x, int d) {
return (x+d-1) / d;
}
void solve() {
int n, m;
cin >> n >> m;
vector<int> A;
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
const ll inf=pow(2,31)-1;
int main()
{
int n,m;cin>>n>>m;
int k=99999999,ans=0,a[m+5];a[0]=0;
for(int i=1;i<=m;i++) cin>>a[i];
sort(a+1,a+1+m);
a[m+1]=n+1;
for(int i=1;i<=m+1;i++)
{
if(a[i]-a[i-1]>1)
{
k=min(k,a[i]-a[i-1]-1);
}
}
//... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#ifdef _DEBUG
#define show(x) \
cerr << #x << " : "; \
showVal(x)
template <typename T>
void showVal(const T &a) { cerr << a << endl; }
template <typename T>
void showVal(const vector<T> &a) {
for (const T &v : a) cerr << v << " ";
cerr <<... | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define ff first
#define ss second
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define all(x) begin(x), end(x)
#define endl "\n"
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, -1, 1};
... |
#include <iostream>
#include <fstream>
#include <cstdlib>
#include <bitset>
#include <map>
#include <iomanip>
#include <string>
#include <vector>
#include <cmath>
#include <queue>
#include <algorithm>
#include <sstream>
#include <unordered_set>
using namespace std;
#define ll long long
#define vecll vector<long long>... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,ans=0;
cin>>n;
int a[n+1];
for(int i=1;i<=n;i++)
cin>>a[i];
for(int l=1;l<=n;l++)
{
int x=a[l];
for(int r=l;r<=n;r++){
x=min(x,a[r]);
ans=max(ans,x*(r-l+1));}
}
cout<<ans;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define Mod(x) (x>=P)&&(x-=P)
#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)
#define erep(i,a) for(int i=hd[a];i;i=nxt[i])
typedef long long ll;
void Max(int &x,int y){(x<y)&&(x=y);}
void Min(int &x,int y){(x>... | #include <iostream>
#include <iomanip>
#include <fstream>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <algorithm>
#include <numeric>
#include <utility>
#include <random>
#include <chrono>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) ... | #include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rep1(i,n) for (int i = 1; i <= (n); ++i)
#define bit(n,k) ((n>>k)&1) //nใฎkใbit็ฎ
#define vec(T) vector<T>
#define vvec(T) vector<vector<T>>
using ll = long long;
using ... |
#include<bits/stdc++.h>
using namespace std;
const int N=1E5+5;
typedef long long ll;
int n,m;
ll a[N],ans[N];
struct hzy{int id;long long x;}q[N];
bool mycmp(hzy a,hzy b){return a.x<b.x;}
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++){
scanf("%lld",&a[i]);
}
for(int i=1;i<=m;i++){
scanf("%lld",&q[i].x)... | #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>... |
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimization ("Ofast")
// #pragma GCC optimization ("unroll-loops")
#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 o_s... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for(int (i) = 0; (i) < (n); ++(i))
#define REPR(i, n) for(int (i) = (n); (i) >= 0; --(i))
#define FOR(i, n, m) for(int (i) = (n); (i) < (m); ++(i))
constexpr int INF = 1e9;
constexpr ll INFL = 1LL<<61;
constexpr ll mod = 1e9+7;
int... |
#include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int,int> II;
typedef tuple<int,int,int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
// minmax
te... | #include <bits/stdc++.h>
#include <ctime>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int i = 1; i<=n; ++i)
#define all(x) begin(x),end(x)
#define show(obj) for(auto x:obj)cout<<x<<' ';cout<<endl;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,ll> lp;
typedef pai... |
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define pii pair<int, int>
#define endl '\n'
#define vi vector<int>
#define vvi vector<vi>
#define vl vector<ll>
#define vvl vector<vl>
#define vld vector<ld>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vpii vector<pii>
#defi... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()
void dbg_out() { cerr << "\b\b]\n"; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T){ cerr << H << ", "; dbg_out(T...);}
#define watch(...) cerr ... |
//YashS
#include <bits/stdc++.h>
using namespace std;
#define test int T;cin>>T;while(T--)
#define int long long
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)((x).size())
#define fr first
#define sc ... | #include <bits/stdc++.h>
// #include <atcoder/all>
// #include "icld.cpp"
using namespace std;
using ll = long long int;
using pii = pair<int,int>;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using ss = string;
using db = double;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,... |
#include <iostream>
using namespace std;
int main()
{
long long n, k;
cin >> n >> k;
for(int i=1; i<=k; ++i)
{
if(n%200 == 0)
n/=200;
else
{
n *= 1000;
n += 200;
}
}
cout << n << endl;
return 0;
} | #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 <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=2e5+10;
map<int,int>ma;
int n,x[maxn],b[205];
int main () {
cin>>n;
ll ans=0;
for(int i=0;i<200;i++) b[i]=0;
for(int i=0;i<n;i++) {
cin>>x[i];
int tmp=x[i]%200;
ans+=b[tmp];
b[tmp]++;
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
using vll = vector<ll>;
using vvll = vector<vll>;
template <typename T> constexpr int inof(const T x) {
return static_cast<int>(x);
}
template <typename T> constexpr ll l... |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <set>
#include <map>
#include <list>
#include <cstdlib>
#include <queue>
#include <stack>
#include <bitset>
using namespace std;
#define MOD 1000000007
#define... | #include<bits/stdc++.h>
using namespace std;
const int N=3e5+5;
int n,a[N],tr[N];
long long ans;
void add(int x)
{
for (;x<=n;x+=x&-x) tr[x]++;
}
int get(int x)
{
int l=0;
for (;x;x-=x&-x) l+=tr[x];
return l;
}
int main()
{
scanf("%d",&n);
for (int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
a[i]++;
ans+=i-1-get... |
#include<bits/stdc++.h>
using namespace std;
const int N=5005,mod=998244353;
int n,m,ans,f[N][2],g[N][2];
inline int add(int a,int b){
a+=b;
return a<mod?a:a-mod;
}
inline int dec(int a,int b){
a-=b;
return a<0?a+mod:a;
}
inline int mul(int a,int b){
return 1LL*a*b%mod;
}
int main(){
scanf("%d%d",&n,&m);
for(int... | #include <stdio.h>
long long p = 998244353;
long long n, m;
long long d[5001];
long long r[5001];
long long inv[5001];
void makeinv(void) {
long long arraynumber = sizeof inv / sizeof inv[0];
inv[1] = 1;
for (int invcount = 2; invcount < arraynumber; invcount++) {
inv[invcount] = p - inv[p % invcount] * (p / invc... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string X;
ll M;
bool solve(ll mid) {
ll res = 0;
ll multiply = 1;
for(ll i = X.length() - 1; i >= 0; i--) {
ll x = (X.at(i) - '0');
if(multiply > (1e18 / x)) {
return false;
}
if(res > 1e18 - x * multip... | #include<bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
int s,p,i;
cin>>s>>p;
for(i=1;i*i<=p;i++)
if(i*(s-i)==p)
{
cout<<"Yes";
return 0;
}
cout<<"No";
return 0;
} |
/*input
3
aba
*/
#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 tree<long long,null_type,less_equal<long long>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("O2","unroll-lo... | #include<bits/stdc++.h>
int main(){
using namespace std;
unsigned long N;
cin >> N;
string S;
cin >> S;
if(S[0] != S.back())return 0 & puts("1");
for(unsigned long i{1}; i < N; ++i)if(S[0] != S[i - 1] && S[i] != S.back())return 0 & puts("2");
puts("-1");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define sz(a) (ll)a.size()
#define deb(x) cerr<<#x<<' '<<x<<endl;
const long long mod = 1000000007;
void _a_b_c_d_e_f_g_h_i_j_k_l_m_n_o_p_q_r_s_t_u_v_w_x_y_z()
{
ll n, k, q = 0, c = 0;
string s;
cin >> n;
ll i = 0;
whi... | #include<bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(int i=a;i<b;i++)
int main(){
int n;
cin>>n;
bool flag=true;
int i;
unordered_map<int,int>dic;
REP(i,0,n){
int ele;
cin>>ele;
if(ele>=1&&ele<=n){
if(dic[ele]>=1)
flag=false;
dic[ele]++;
}
... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int gcd(int a,int b) {return b==0?a:gcd(b,a%b);}
const int maxn = 1000005;
int prime[maxn],np[maxn],mu[maxn],tot=0;
void init(int n) {
np[1]=mu[1]=1;
for(int i=2;i<=n;++i) {
if(!np[i]) prime[++tot]=i,mu[i]=-1;
for(int j=1;j<=tot;++j... | #include<bits/stdc++.h>
#define _USE_MATH_DEFINES
using namespace std;
#define ll long long int
#define pb push_back
#define eb emplace_back
#define rep(i , j , n) for(ll i = j ; i < n ; i++)
#define pre(i , j , n) for(ll i = j ; i >= n ; i--)
#define all(x) x.begin(), x.end()
typedef pair<int, int> pii;
typedef ... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int x,y;
cin >> x >> y;
if(x == y)
cout << x << endl;
else
cout << 3-(x+y) << endl;
return 0;
} | #include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int x, y;
cin >> x >> y;
if (x == y)
cout << x;
if (x != y) {
if (x != 1 && y != 1)
cout << 1;
else
if (x != 2 && y != 2)
cout << 2;
else
if (x != 0 && y != 0)
cout << 0;
}
return 0;
} |
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;
template<class T> constexpr... | #include <bits/stdc++.h>
using namespace std;
int X[111], Y[111], fa[111];
int ffa(int x) {
if (x == fa[x]) return x;
return fa[x] = ffa(fa[x]);
}
void merge(int x, int y) {
x = ffa(x);
y = ffa(y);
fa[x] = y;
}
struct NODE {
int a, b;
double d;
NODE(int a1 = 0, int a2 = 0, double a3 = 0) : a(a1), b(a2),... |
#include<iostream>
#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<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utilit... | #include<iostream>
#include<algorithm>
using namespace std;
long long n,a[200010],b[200010],p[200010],k,ans,m;
long long f[200010];
int main(){
cin >> n;
for(int i=1;i<=n;i++)
{
cin >>a[i];
p[i]=max(a[i],p[i-1]);}
f[1]=2*a[1];b[1]=f[1];
for(int i=2;i<=n;i++)
{
f[i]=a[i]+i*(p[i]-p[i-1])+b[i-1]+f[i-1];
b[i]... |
#pragma GCC optimize("-Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
// #include <atcoder/all>
// #include <bits/stdc++.h>
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <ran... | #include <iostream>
#include <queue>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int64_t K, N, M;
cin >> K >> N >> M;
vector<int64_t> A(K);
rep(i, K) cin >> A[i];
vector<int64_t> B(K);
int64_t sumB = M;
rep(i, K) ... |
#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>
// #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 <iostream>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <tuple>
#include <math.h>
#include <set>
#include <cassert>
#include <stack>
#include <bitset>
#include <map>
#include <queue>
#include <random>
#include <unordered_set>
#include <unordered_map>
#define DEBUG
#de... | #include <bits/stdc++.h>
using namespace std;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define rep1(a, b, c) for(int a = (b); a < (c); ++a)
#define each(a, b) for(auto& a : b)
#define sz(x) (int)(x).size()
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(), (a).rend()
#d... |
// Problem: E - Unique Color
// Contest: AtCoder - AtCoder Beginner Contest 198
// URL: https://atcoder.jp/contests/abc198/tasks/abc198_e
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#inclu... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define V vector
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define mp make_pair
#define sz(x) int(x.size()... |
#include <vector>
#include <array>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#inc... | #include<bits/stdc++.h>
using namespace std;
#define rep(x, L, R) for(int x = (L), _x = (R); x <= _x; x++)
#define per(x, R, L) for(int x = (R), _x = (L); x >= _x; x--)
#define broken fprintf(stderr, "running on %s %d\n", __FUNCTION__, __LINE__)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define SZ(v) (int)(v).s... |
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define mp make_pair
#define pb push_back
typedef long long ll;
const ll MOD = 1e9+7;
const ll INF = 1e18+5;
pair <ll, char> p[200005];
multiset <ll> r;
multiset <ll> g;
multiset <ll> b;
ll solve1(multiset <ll> a, multiset<ll> b) {
ll... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define inf 1e18
// 1000000007 , 998244353
// cout<<"? "<<endl for interactive
#define mod 998244353
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define clr(x,y,z) (x).clear(),(x).resize((y),(z))
... |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std... | #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#includ... |
#include<cstdio>
#include<iostream>
#define ll long long
using namespace std;
int main(){
long long n,t;
cin>>t>>n;
long long l=0,r=100000000000000,mid;
while(l<r){
mid=(l+r)/2;
if(
(((100+t)*mid)/100<n+mid)
){
l=mid+1;
}
else{
r=mid;
}
}
cout<<1+((100+t)*(l-1))/100;
// cin>>n;
} | /*Bismillahir Rahmanir Rahim*/
#include<bits/stdc++.h>
#define ll long long int
#define pb push_back
#define mp make_pair
#define PI acos(-1.0)
using namespace std;
int main()
{
ios_base :: sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
double r,x,y,a=0,b=0,s,cnt=0;
cin>>r>>x>>y;
s=sqrt(x*x+y*y);
... |
/*
#pragma GCC optimize("Ofast")
#pragma GCC target("avx", "avx2", "fma")
#pragma GCC optimization("unroll-loops")
*/
#include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define IOS ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
#define fi first
#define se second
#define pf push_front
#define pb pus... | #pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
#define all(x) x.begin(),x.end()
#define lun(x) (int)x.size()
typ... |
#include<bits/stdc++.h>
using namespace std ;
#define vt vector
#define all(c) (c).begin(), (c).end()
#define sz(x) (int)(x).size()
#define ll long long
#define ld long double
#define ar array
#define inf() ifstream cin("d.txt")
#define onf() ofstream cout("test.txt")
#define mod 1000000007
#define pb push_back
#def... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define BE(x) x.begin(), x.end()
int main() {
ll n, m, t;
cin >> n >> m >> t;
vector<ll> a(m), b(m);
for (int i = 0; i < m; i++) cin >> a[i] >> b[i];
ll bat = n;
for (int i = 0; i < m; i++) {
bat -= (i > 0) ? (a[i] - b... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a>>b>>c;
if(a*a + b*b < c*c) cout<<"Yes";
else cout<<"No";
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,i1,n) for(int i=(int)(i1);i<(int)(n);i++)
#define ll long long
#define vi vector<int>
#define vll vector<long long>
using graph = vector<vector<int>>;
int main() {
int a,b,c=0;
cin>>a>>b>>c;
if(a*a+b*b<c*c){
cout<<"Yes";
}else{
cout<<"No";
}... |
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define FastIO() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define read() freopen("... | #include <bits/stdc++.h>
#include <bits/extc++.h>
#define double long double
#define rbtree __gnu_pbds::tree<int,__gnu_pbds::null_type,less<int>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>
#define int ll
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);
#define pb push_back
#define ALL... |
#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
// Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools
int main(){
// Failed to predict input format
int H, W;
cin >> H ... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <stack>
#include <numeric>
#include <cassert>
#define endl '\n'
#define sp ' '
#define pb push_... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int mod = 1000 * 1000 * 1000 + 7;
const int INF = 1e9 + 100;
const ll LINF = 1e18 + 100;
#ifdef DEBUG
#define dbg(x) cout << #x << " = " << (x) << endl << flush;
#define dbgr(s, f) { cout <<... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using ll = int64_t;
using ull = uint64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<... |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace st... | // Copyright 2021 Nikita Golikov
#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using ui64 = uint64_t;
template <class A, class B>
bool smin(A &x, B &&y) {
if (y < x) {
x = y;
return true;
}
return false;
}
template <class A, class B>
bool smax(A &x, B &&y) {
if (x < y) {
x... |
#include<bits/stdc++.h>
#pragma GCC optimize(3)
#define ll long long
#define int long long
using namespace std;
const int maxn=200005;
const int inf=1ll<<60;
int a[maxn];
int b[maxn];
int val[maxn];
int f[105][10005];
int vis[105][10005];
signed main() {
ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
int n,... | #include <bits/stdc++.h>
using namespace std;
/*
Fix k.
For this k, we will:
Compute the maximum possible sum of k items that is equal to X modulo k.
We will do this by using a DP approach. We go through the items one by one and decide IN ORDER whether we use them.
Our DP state is (# items used, current sum % k, it... |
// time-limit: 2000
// problem-url: https://atcoder.jp/contests/abc202/tasks/abc202_e
#include <bits/stdc++.h>
using namespace std;
#define nl "\n"
#define big int
#ifdef DEBUG
#define ds(statement) cerr << statement << endl
#define dv(var) cerr << (#var) << ": " << var << endl
#else
#define ds(statement)
#define dv(... | // g++ -std=c++11 a.cpp
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<random>
#... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll P=1000000007;
ll pow(ll x,ll n){
if(n==1)return x;
ll half=pow(x,n/2),ret=half*half%P;
if(n%2)ret=ret*x%P;
return ret;
}
ll inv(ll x){
return pow(x,P-2);
}
vector<vector<ll>> matmul(const vector<vector<ll>> &a,const vec... | //
// mod.cpp
//
//
// Created by Sagar Singh on 17/12/20.
//
#include <iostream>
#include <iomanip>
#include <fstream>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <ctime>
#include <algorithm>
#include <numeric>
#include <sstream... |
#define LOCAL
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,s,n) for (int i = (ll)s; i < (ll)n; i++)
#define rrep(i,n,e) for (int i = (ll)n; i > (ll)e; i--)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace... | #include "bits/stdc++.h"
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
for (int i = 0; i < k; i++) {
if (n % 200 == 0) {
n /= 200;
}
else {
n *= 1000;
n += 200;
}
}
cout << n << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int into;
int main()
{ int h,w,x,y;
cin>>h>>w>>x>>y;
x--;y--;
string s[h];
for(int i=0;i<h;i++)
cin>>s[i];
int ans=0;
for(int i=x+1;i<h;i++)
{ if(s[i][y]=='#')
break;
else ans++; }
for(int i=x-1;i>=0;i--)
{ if(s[i]... | #include <bits/stdc++.h>
using namespace std;
#define reps(i, a, n) for (int i = (a); i < (n); ++i)
#define rep(i, n) reps(i, 0, n)
#define deps(i, a, n) for (int i = (a); i >= (n); --i)
#define dep(i, n) deps(i, n, 0)
int si, sj;
int t[52][52];
int p[52][52];
int c[52][52];
int score;
vector<char> ans;
int cnt;
void... |
#include <bits/stdc++.h>
#define fo(a,b,c) for (a=b; a<=c; a++)
#define fd(a,b,c) for (a=b; a>=c; a--)
#define min(a,b) (a<b?a:b)
#define ll long long
//#define file
using namespace std;
int a[100002],b[100002],n,L,i,j,k,l,sum;
ll ans;
void Exit() {printf("-1\n");exit(0);}
int main()
{
#ifdef file
freopen("c.in","... | #include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = std::vector<int>;
using Vl = std::vector<ll>;
using Pii = std::pair<int, int>;
using Pll = std::pair<ll, ll>;
constexpr int I_INF = std::numeric_limits<int>::max();
constexpr ll L_INF = std::numeric_limits<ll>::max();
templ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define loop(i, a, n) for (int i = a; i < n; i++)
#define loope(i, b, n) for (int i = b; i <= n; i++)
#define loopit(a) for (auto it = a.begin(); it != a.end(); it++)
#define ms(a, b) memset(a, b, sizeof(a))
#define pb(a) push_back(a)
#define MP make_p... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
#define ll long long
vector<bool>vis ( 2e5+10 ,false);
vector<int>adj[200009];
void dfs ( int a){
if(vis[a]==false)return;
vis[a]=false;
for ( int x : adj[a]){
dfs(x);
}
}
void solve()
{
i... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fo(i,a,b) for(int i = a; i<b ; i++)
#define FIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define pb push_back
#define M 1000000007
int mod(int x){
return ((x%M + M)%M);
}
int add(int a,int b){
return mod(mod(a)+mod(b)... | #include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<vector>
#include<algorithm>
#include<utility>
#include<set>
using namespace std;
#define int long long
#define endl "\n"
constexpr long long INF = (long long)1e18;
constexpr long long MOD = 1'000'000'007;
struct fast_io {
fast_io(){
... |
#include<bits/stdc++.h>
using namespace std;
string s = "";
map<char, char> mp;
int main(){
mp['0'] = '0' ; mp['1'] = '1' ; mp['6'] = '9' ; mp['8'] = '8' ; mp['9'] = '6' ;
cin >> s;
for(int i = s.length() - 1 ; i >= 0 ; i --) cout << mp[s[i]];
return 0;
}
| #include <bits/stdc++.h>
#include <chrono>
#include <math.h>
using namespace std;
using ll = long long;
using ld = long double;
using namespace std::chrono;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define fo(i,z,n) for(int i = z;i<n;i++)
#define rfo(i... |
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl;
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].... | #include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<queue>
#include<vector>
#include<stack>
#include<sstream>
#include<algorithm>
/******... |
#include <bits/stdc++.h>
using namespace std;
//#define int long long
template <int mod = 1000000007>
struct modint{
int x;
modint(int y = 0) : x((y % mod + mod) % mod) { }
friend modint operator^(modint a, long long b) {
modint r = 1;
for(; b; b >>= 1, a *= a) if(b & 1) r *= a;
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 998244353;
vector<ll> fac(300001); //n!(mod mod)
vector<ll> ifac(300001); //k!^{M-2} (mod mod)
//a,bใฎ็ฏๅฒ็ใซใใใ ใ้
ๅใ็จๆใใฆใใใฐๅๅ
ll mpow(ll x, ll n){ //x^n(mod mod) โๆฎ้... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#include <limits>
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
using namespace std;
template<clas... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M=105;
int a[M],n;ll dp[M][M][M],m;
int main(){
// freopen("n.txt","r",stdin);
cin>>n>>m;ll ans=1e18+5;
for(int i=1;i<=n;i++)cin>>a[i];
// for(int i=1;i<=n;i++)for(int j=)
for(int K=1;K<=n;K++){
memset(dp,0,sizeof(dp));
for(int i=0;i<=n... |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>
using ... | #include<bits/stdc++.h>
using namespace std;
int n,m;
int a[1010],b[1010];
int dp[1010][1010];
int main(){
cin>>n>>m;
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=1;i<=m;i++)
cin>>b[i];
for(int i=0;i<=n;i++)
for(int j=0;j<=m;j++)
dp[i][j]=1e9;
dp[0][0]=0;
for(int i=0;i<=n;i++)
for(int j=0;j<=m;j++){
... |
#include "bits/stdc++.h"
using namespace std;
#define FAST cin.tie(nullptr)->sync_with_stdio(false);
#define PRECISE cout << fixed << setprecision(19);
#define ONE int tc = 1;
#define GO for (int i = 0; i < tc; ++i) { solve(); }
void solve() {
int a, b, c; cin >> a >> b >> c;
cout << (a * a + b * b < c * c ? ... | #include <iostream>
#include "bits/stdc++.h"
using namespace std;
int main()
{
int a, b, c;
cin >> a >> b >> c;
string winner;
if (c == 0)
{
if (b < a)
{
winner = "Takahashi";
}
else
{
winner = "Aoki";
}
}
else
{
... |
#include <iostream>
using namespace std;
using ll = long long;
int main(){
double A, B;
cin >> A >> B;
cout << 100-100*B/A<<endl;
} | #include <bits/stdc++.h>
using namespace std;
// type alias
typedef long long LL;
typedef pair<int,int> II;
typedef tuple<int,int,int> III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
// minmax
te... |
#include<ctime>
#include<cstdio>
#include<cctype>
using namespace std;
const int N=1e5+10;
int read() {
char c;
int x=0,f=1;
while(!isdigit(c=getchar()))
f-=2*(c=='-');
while (isdigit(c)){
x=x*10+(c-48)*f;
c=getchar();
}
return x;
}
int n,x,a[N],b[N];
int main() {
#ifndef ONLINE_JUDGE
freopen("B.in","r",... | // KNOW NOTHING!
#include <bits/stdc++.h>
#define ll long long int
#define F(i,j,k,in) for(int i=j;i<k;i+=in)
#define DF(i,j,k,in) for(int i=j;i>=k;i-=in)
#define feach(it,l) for (auto it = l.begin(); it != l.end(); ++it)
#define fall(a) a.begin(),a.end()
#define sz(x) (int)x.size()
#define szs(x) (int)x.length()
#defi... |
#include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
#define ll long long
#define pi 3.1415926535897932384626
#define MX 1e5 + 5
#define MOD 1000000007
#define ll long long
#define int long long
#define ull unsigned long long
#define ld long double
#define pb push_back
#define mp make_pair
#define d... | //in dp prefix suffix sum helps..
#include<iostream>
#include<vector>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<cmath>
#include<stack>
#include <iterator>
#include <map>
#include<list>
#include <fstream>
#include<unordered_map>
#include<set>
#include<queue>
#define int long long
#define double ... |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int,int>;
template <class T> int sgn(T x) { return (x > 0) - (x < 0); }
template<class T>
struct TPoint {
typedef TPoint P;
T x, y;
static constexpr T eps = static_cast<T>(1e-9);
explicit TPoint(T x=0, T y=0) : x(x), y(y) {}... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
template <class T>
using... |
#include <bits/stdc++.h>
//end
int main() {
long long int g;
std::cin >> g;
double rez = std::sqrt((double)2) * std::sqrt((double)(g + 1));
long long int maz = (long long int)rez + 1;
for (long long int u = maz; u >= 1; u--) {
if ((u + 1) * u / 2 <= g + 1) {
std::cout << g - u +... | #include<bits/stdc++.h>
#define int long long
using namespace std;
int n,m;
signed main(){
cin>>n;
int x=sqrt((n+1)<<1);
if(x*(x+1)>((n+1)<<1)) x--;
cout<<n-x+1<<endl;
return 0;
} |
#include<iostream>
#include<vector>
#include<string>
#include<cstdio>
#include<algorithm>
#include<iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll LLMAX = (1llu<<(sizeof(ll)*8-1)) - 1;
const int IMAX = (1llu<<(sizeof(int)*8-1)) - 1;
const ull Nmax = 2 * 100000 + 100;
ull... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0;i<(n);i++)
void chmax(ll& a, ll b) {if (b>a) a=b;}
int main() {
int N;
cin >> N;
vector<int> a(N), b(N);
rep(i,N) cin >> a[i];
rep(i,N) cin >> b[i];
ll ans = 0, maxa = 0;
rep(i,N) {
chmax(maxa, a[i]);
... |
#include<bits/stdc++.h>
using namespace std;
#define INF 1000000009
using ll=long long;
struct salesman{
// ้ ็นๆฐNใฎใปใผใซในใใณ 0ในใฟใผใ
ll N;
vector<vector<ll>> g;
ll MAXN=17;
vector<vector<ll>> dp;
ll ans=INF;
salesman(ll n){
N=n;
g.resize(n);
dp.resize(1<<N);
for ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N; cin >> N;
vector<double> a(N),b(N),c(N),d(N);
for(int _=0; _<2; _++){
for(int i=0; i<N; i++) cin >> a[i] >> b[i];
int x = 0, y = 0;
for(int i=0; i<N; i++){
x += a[i];
y += b[i];
a[i] ... |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>
using ... | #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=1000000007;
constexpr ll INF=1e18;
struct Q{
int a;
int b;
int i;
bool ... |
#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(ll i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
constexpr ll MOD=998244353;
constexpr ll INF=2e18;
VVI g(300000);
VI in(300000,0);
VI ans(300000,0);
VI k... | #include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1005,mod=1e9+7;
int n,f[N];
char AA,AB,BA,BB;
int qp(int a,int b)
{
int ans=1;
while(b)
{
if(b&1)
ans=ans*a%mod;
a=a*a%mod;
b>>=1;
}
return ans;
}
signed main()
{
ios::sync_with_stdio(false);
cin>>n>>AA>>AB>>BA>>BB;
if(n==2)... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll solve(vector<ll> &A1, vector<ll> &A2, ll &T) {
bitset<20> bs;
vector<ll> B;
ll res=0;
for(ll i=0; i<pow(2,A1.size()); ++i) {
ll count=0; bs=i;
for(ll j=0; j<A1.size(); ++j) if(bs.test(j)) count+=A1[j];
B.push_back(count);
}
... | #include <math.h>
#include <assert.h>
#include <algorithm>
#include <set>
#include <iostream>
#include <vector>
#include <iomanip>
#include <queue>
#include <map>
#include <string>
#include <cstring>
#include <functional>
#include <stack>
#include <array>
#include <random>
#include <chrono>
#include <climits>
#include ... |
#include<bits/stdc++.h>
using namespace std;
string dfs(int n,string s){
if(n == 1)return s;
while(n%3!=1){
string t;
for(int i=1;i<n;i++){
if(s[i]==s[i-1])t+=s[i];
else {
int x = 'R'+'W'+'B';
x -= s[i] + s[i-1];
t += (cha... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL mod = 998244353;
LL f[3010][6010], s[6010];
int n, k;
int main() {
cin >> n >> k;
f[0][0] = 1;
s[0] = 1;
for (int i = 1; i <= n; i++)
for (int j = i; j >= 1; j--) {
f[i][j] = s[i * 2 - j * 2];
s[i * 2 - j] = (s[i * 2 - j] + f[i]... |
#include<iostream>
#include<sstream>
#include<iomanip>
#include<cstdlib>
#include<algorithm>
#include<vector>
#include<map>
#include<cmath>
#include<string>
#include<numeric>
#include<queue>
#define rep(i,p) for(long long int i=0;i<p;i++)
#define reep(i,p) for(long long int i=1;i<=p;i++)
#define ll long long
#define ... | #include<bits/stdc++.h>
using namespace std;
#define ERR(...) fprintf(stderr,__VA_ARGS__);
#define rep(i,l,r) for(i=(l);i<=(r);++i)
#define per(i,l,r) for(i=(l);i>=(r);--i)
#define REP(i,l,r) for(i=(l);i< (r);++i)
#define PER(i,l,r) for(i=(l);i> (r);--i)
typedef long long ll;
priority_queue<int> Queue;
const int MAXN=2... |
#include <bits/stdc++.h>
#define loop(s, e, i) for (int i = s; i < e; ++i)
#define print(s) cout << s << endl;
#define DIV 1000000007
#define ll long long
using namespace std;
const int INF = 1e9+7;
int show_matrix(vector<vector<int>> &dp) {
loop(0, dp.size(), i) {
loop(0, dp[i].size(), j) {
cout << d... | #include<bits/stdc++.h>
using namespace std;
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
for(ll i = 0; i < n; i++) cin >> a[i];
sort(a.rbegin(), a.rend());
vector<ll> pref(n, 0);
pref[0] = a[0];
for(ll i = 1; i < n; i++) {
pref[i... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define MOD 1000000007
int main() {
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
int ans = 0;
if (r1 == r2 && c1 == c2)... | #include<bits/stdc++.h>
#define int long long
using namespace std;
int x,y,a,b;
signed main()
{
scanf("%lld%lld%lld%lld",&x,&y,&a,&b);
if(x<a)
swap(x,a),swap(y,b);
if(x==a&&y==b)
{
puts("0");
return 0;
}
if(x+y==a+b||x-y==a-b||abs(x-a)+abs(y-b)<=3)
{
puts("1");
return 0;
}
if((a+b)%2==(x+y)%2||(abs(b... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.