code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include <bits/stdc++.h>
#define fi first
#define se second
#define gc getchar() //(p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<20,stdin),p1==p2)?EOF:*p1++)
#define mk make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define IT iterator
#define V vector
#define TP template <class o>
#define TP... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
using namespace std;
#define rep(i, n) for(long long i = 0; i < (long long)(n); i++)
#define rrep(i, n) for(long long i = (long long)(n - 1); i >= 0; i--)
#define all(x) (x).... |
#include<iostream>
using namespace std;
int main()
{
int n,i,a[1001],sum=0;
cin >> n;
for(i=0;i<n;i++)
{
cin >> a[i];
}
for(i=0;i<n;i++)
{
if(a[i]>10)
{
sum+=a[i]-10;
}
}
cout << sum;
return 0;
} | //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,avx512f")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vect... |
#include<bits/stdc++.h>
#define inf INT_MAX
#define sc(a) scanf("%d",&a)
#define scc(a,b) scanf("%d %d",&a,&b)
#define sccc(a,b,c) scanf("%d %d %d",&a,&b,&c)
#define lsc(a) scanf("%lld",&a)
#define lscc(a,b) scanf("%lld %lld",&a,&b)
#define lsccc(a,b,c) scanf("%lld %lld %lld",&a,&b,&c)
#define pf(a) printf("%d",a)
#def... | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#define dlog(str) cout << "====" << str << endl;
#else
#define dlog(str)
#endif
#define INF 999999999
#define MOD 1000000007
#define LLI long long int
#define REP(i, n) for(LLI i = 0, i##_l = (n); i < i##_l; i++)
#define FOR(i, s, e) for(LLI i = s, i##_l = (e)... |
/*Jai Shree Ram*/
// Never Give Up
#include<bits/stdc++.h>
#include<unordered_map>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi ... | // generated by oj-template v4.7.2 (https://github.com/online-judge-tools/template-generator)
#include <bits/stdc++.h>
#define overload3(_1, _2, _3, name, ...) name
#define rep1(i, n) for(i64 i = 0LL; i < (n); ++i)
#define rep2(i, a, b) for(i64 i = (a); i < (b); ++i)
#define rep(...) overload3(__VA_ARGS__, rep2, rep1)(... |
#include <iostream>
using namespace std;
int main(){
char a,b,c;
cin >> a >> b >> c;
if(a == b && b == c) cout << "Won" << endl;
else cout << "Lost" << endl;
} | #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;
using cd = complex<double>;
#define ll long long
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define LB lower_bound
#define UB upper_boun... |
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int a,b,c,d;
cin>>a>>b>>c>>d;
int arr[4]={a,b,c,d};
sort(arr,arr+4);
// maxi=arr[3];
if(arr[3]==arr[0]+arr[1]+arr[2]){
cout<<"Yes";
}
else if(arr[3]+arr[0]==arr[1]+arr[2]){
cout<<"Yes";
}
else if(arr[3]+arr[0... | #include <bits/stdc++.h>
#include <math.h>
#include <chrono>
using namespace std;
#pragma GCC optimize("-O3")
#define endl "\n"
#define mp make_pair
#define st first
#define nd second
#define pii pair<int, int>
#define pb push_back
#define _upgrade ios_base::sync_with_stdio(0), cout.setf(ios::fixed), cout.precision(10)... |
#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 chmax(x,y) (x = max(x,y))
#define chmin(x,y) (x = min(x,y))
#define FOR(i,x,n) for(int i=x;i<(n);i++)
using ll = long long;
using PAIR = pair<int, int>;
using PAIRLL = pair<ll,ll>;
using vi... | #include <bits/stdc++.h>
using namespace std;
const int N=510;
int a[N],c[N][N],d[N][N];
int main()
{
int n;
cin>>n;
memset(a,0x3f,sizeof(a));
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
cin>>c[i][j];
a[i]=min(a[i],c[i][j]);
d[i][j]=c[i][j]-c[i][1];
}
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j+... |
#include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
using ll = long long;
using ld = long double;
const int mod = 998244353;
const double pi = acos(-1.0);
const int inf = INT_MAX;
template<const int M>
struct ModInt {
int val;
ModInt(): val(-1) {}
ModInt(ll x) : val(x % M) { if (val < 0)... | #include <stdio.h>
#include <bits/stdc++.h>
#define ll long long int
#define inf 1000000000000
#define mod 998244353
#define sz(x) (int)x.size()
#define all(v) v.begin(), v.end()
#define fi first
#define se second
#define ps(x, y) fixed << setprecision(y) << x
using namespace std;
void solve()
{
ll n, kl;
cin >> n >... |
#include <cmath>
#include <vector>
#include <iostream>
#include <iomanip>
#include <fstream>
#include <algorithm>
#include <set>
#include <queue>
#include <string>
#include <map>
#include <stack>
#include <climits>
#include <array>
#include <unordered_set>
#include <unordered_map>
#include <memory>
#include <functional... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#pragma GCC optimize ("-O3")
#define int long long
#define ld long double
#define endl "\n"
#define rep(i,begin,end) for (__typeof(end) i=begin-(begin>end); i!=(end)-(begin>end); i+=1-2*(begin>end))
#defin... |
#include <bits/stdc++.h>
#define Mod 998244353
using namespace std;
typedef long long ll;
inline int read() {
int out = 0;
bool flag = false;
register char cc = getchar();
while (cc < '0' || cc > '9') {
if (cc == '-') flag = true;
cc = getchar();
}
while (cc >= '0' && cc <= '9') {
out = (out << 3)... | #include<bits/stdc++.h>
using namespace std;
#define fo(i,a,n) for(i=a;i<n;i++)
#define ll long long
#define deb(x) cout << #x << "=" << x << endl
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<pair<int,int>> A(2*N);
for(int i=0;i<2*N;i++){
int a;
cin >> a;
A[i] = make_pair(a,i);
}
sort(A.begin(),A.end());
vector<int> c(2*N);
for(int i=0;i<N;i++) c[A[i].second] = 1;
for(int i=0;i<N;i++) c[A[N+i].sec... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
#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) ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
string S, T;
cin >> S >> T;
int sc = 0, tc = 0;
vector<int> P(N + 1, N - 1);
for (int i = N - 1; i > -1; i--) {
if (S[i] == '1') {
P[i] = i;
sc++;
} else if ... | // “Alhamdulillah for Everything”
#include<bits/stdc++.h>
using namespace std;
#define pai acos(-1)
#define ff first
#define ss second
#define ll long long
#define pb push_back
#define mp make_pair
#define... |
#include <stdio.h>
#include <assert.h>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <vector>
#include <numeric>
#include <iomanip>
#define ll long long
#define mint modint<MOD>
#define rep2(i,a,b) for(int i=a;i<=b;++... | #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... |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll N;
cin>>N;
ll n=sqrt(N);
ll ans=N;
vector<bool> vec(n,false);
for(ll i=2;i<=n;i++) {
if(vec[i-1]) {
continue;
}
ll k=i;
ans++;
while(k<=N) {
ans--;
if(k<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001
#define mod 1000000007
#define mod2 998244353
#define pi acos(-1)
#define all(v) v.begin(),v.end()
#define vi vector<int>
#de... |
// Template
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <tuple>
#include <utility>
#include <queue>
#include <set>
#include <map>
#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 (i... | #include <bits/stdc++.h>
int main(){
int N, M;
std::cin >> N >> M;
std::vector< std::pair< int, std::pair< int, int > > > XYZ(M);
for(int i=0; i<M; i++){
std::cin >> XYZ[i].first >> XYZ[i].second.first >> XYZ[i].second.second;
//XYZ[i].first--;
XYZ[i].second.first--;
}
... |
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+5;
inline int read()
{
int x=0,f=1;
char c=getchar();
while(c<'0' || c>'9')
{
if(c=='-') f=-1;
c=getchar();
}
while(c>='0' && c<='9')
{
x=x*10+c-'0';
c=getchar();
}
return x*f;
}
int n,a[N],b[N],c[N*2],re[N*2],len=0;
inline int Find(int x)... | #include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int n, x;
string s;
cin >> n >> x;
cin >> s;
int cnt=x;
for(int i=0; i<s.size(); i++)
{
if(s[i]=='x' && cnt>0)cnt--;
else if(s[i]=='o')cnt++;
}
cout << cnt;
}
| #include <bits/stdc++.h>
//#include "/home/amal/basic.h"
using namespace std;
#define ll long long
#define boost ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define loop(i,n) for(ll i=0;i<n;i++)
#define tc() int t;cin>>t;while(t--)
int main()
{
boost
#ifndef Amal
// freopen("/home/amal/Desktop/progra... |
#include <bits/stdc++.h>
#define INF 1000000000000
#define MOD 1000000007 //10^9+7:合同式の法
#define MOD2 1000007
using namespace std;
typedef long long ll;
/*
0のアスキー "48"
*/
//マクロ
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define F... | #include <bits/extc++.h>
using namespace std;
using namespace __gnu_cxx;
template<typename T>
int ex(T p){
T a = 1;
if(p == 0){
return a;
}
else{
for(T i = 1; i <= p; i++){
a = a*i%1000000007;
}
return a;
}
}
template<typename T>
int eq(T p, T q){
T r,s = 0,nextp,prevp = 0,prev2p = ... |
/*
Problem Name:Graph Smoothing
algorithm tag:矩阵快速幂
*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int INF... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x)... |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll mod = 1e9 + 7;
void dfs(ll i, ll p, vector<vector<pair<ll,ll>>>& adj,vector<ll>& xors)
{
for(auto t : adj[i])
{
if(t.first!=p)
{
xors[t.first] = xors[i]^t.second;
dfs(t.first,i,adj,xors);
}... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int i = 0; i < (n); ++i)
#define DREP(i,s,n) for(int i = (s); i < (n); i++)
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}ret... |
#include <bits/stdc++.h>
#define ft first
#define sc second
#define pt(sth) cout << sth << "\n"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
template<class T>bool chmax(T &a, const T &b) {if(a<b) {a=b; return 1;} return 0;}
template<class T>bool chmin(T &a, const T &b) {if(b<a) {a=b; return 1;} ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<ll> ten = { 1,10,100,1000,10000,100000 };
int solve(vector<int> a, vector<int> b) {
ll sa = 0, sb = 0;
for (ll i = 1; i < 10; i++) {
sa += i * ten[a[i]];
sb += i * ten[b[i]];
}
return sa > sb;
}
int main() {
... |
// Problem: A - Vanishing Pitch
// Contest: AtCoder - AtCoder Beginner Contest 191
// URL: https://atcoder.jp/contests/abc191/tasks/abc191_a
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Parsed on: 06-02-2021 17:32:16 IST (UTC+05:30)
// Author: Kapil Choudhary
// ***************************************************... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e6 + 5, mod = 1e9 + 7;
int fact[N], inv[N];
int mul(int a, int b){
a = (a + mod) % mod;
b = (b + mod) % mod;
return 1ll * a * b % mod;
}
int add(int a, int b){
a = (a + mod) % mod;
b = (b + mod) % mod;
return (... |
//For higher stack size use g++ -O2 -std=c++11 -Wall -Wl,--stack=268435456 a.cpp -o a.exe in cmd
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#define ll long long
#define ld long double
... | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#define vll vector<long long>
#define vi vector<int>
#define ll long long
#define mp make_pair
#define p push
#define pb push_back
#define np next_permutation
#define mpl map<ll,ll>... |
#include<bits/stdc++.h>
#include<vector>
#include<math.h>
#include<string.h>
using namespace std;
#define MOD 1000000007
#define MAX 200005
#define PMAX 55
#define EPS 0.000001
#define INF 2000000000000000000
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(NULL)
#include <ext/pb_ds/assoc_container.hpp>
#include... | #include <bits/stdc++.h>
// #include <atcoder/all> // NOTE: AtCoderライブラリ
using namespace std;
// using namespace atcoder; // NOTE: AtCoderライブラリ
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define dbg(x) cerr << #x << ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int T;
cin >> T;
while (T--) {
string S;
cin >> S;
string SS = S;
sort(SS.rbegin(), SS.rend());
if (SS < "atcoder") {
cout << -1 << endl;
continue;
}
int ans = 1005;
... | #include <iostream>
using namespace std;
int ans[1000];
int main()
{
int n;
cin>>n;
string t,s="atcoder";
for(int i=0;i<n;i++)
{
cin>>t;
int cnt=0;
if(t>s){ans[i]=0;continue;}
for(int j=0;j<t.size();j++)
{
if(t[j]!='a')
{
if(t[j]>'t')cnt--;
break;
}
cnt++;
}
if(cnt==t.size())ans[... |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0 ; i < (n); ++i)
using namespace std ;
typedef long long ll ;
const int mod=1000000007;
const int N=1e3 ;
void solve(){
int x,y ;
cin>>x>>y ;
if(abs(x-y)<3){
cout<<"Yes" ;
}
else{
cout<<"No" ;
}
}
int main(){
#ifndef ONLINE_JUDGE
freopen("i... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
cout<<((2*a)+100)-b<<endl;
return 0;
}
|
#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;
ll ceildiv(ll a, ll b) { return (a+b-1)/b; } // 切り上げ
ll floordiv(ll a, ll b) { return a/b; } // 切り下げ
int show_mat... | #include<bits/stdc++.h>
using namespace std;
#define D(x) cout<<__LINE__<<" : "<<#x<<" = "<<x<<endl
int t, n, _max, m, x, y, tc;
int main() {
//freopen("input.txt","r",stdin);
cin>>n>>m;
puts(m%n == 0 ? "Yes" : "No");
return 0;
}
|
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ub upper_bound
#define lb lower_bound
#define isrt insert
#define clr clear
#define rsz resize
#define ff first
#define ss... | #include<bits/stdc++.h>
#define pb push_back
#define sz(x) (int)(x.size())
#define all(x) x.begin(), x.end()
#define int long long
#define pii pair<int, int>
#define inf 0x3f3f3f3f
#define ar array
#define mod 998244353
#define F first
#define S second
#define wopen(x) freopen((x),"w",stdout)
#define ropen(x) freopen((... |
#include <bits/stdc++.h>
//#define DEBUG
#define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
typedef long long ll;
typedef unsigned long long ull;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3fLL;
const int M = 2e5 + 100;
using namespace std;
inline ll read() {
ll x = 0, f = 1; char ch = ge... | #include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int n, m; cin >> n >> m;
int c0 = 0, c1 = 0;
for (int i = 0; i < n; i++) {
string s; cin >> s;
int c = 0;
for (int j = 0; j < m; j++)
if (s[j] == '1')
c++... |
#include<bits/stdc++.h>
#define N 105
#define P 1000000007
using namespace std;
int n,m,k,t[N],ni,a[N];
void Add(int &x,int y){
x+=y;
if(x>=P)x-=P;
}
int fpow(int a,int b){
int res=1;
while(b){
if(b&1)res=1ll*res*a%P;
a=1ll*a*a%P,b>>=1;
}return res;
}
struct S{
int A[N][N];
S operator *(const S &_)const{
S... | //#include<math.h>
#include<algorithm>
#include<stdlib.h>
#include<time.h>
#include<stdio.h>
#include<string.h>
#define un unsigned
#define srd srand(time(0))
#define ll long long
#define con continue
#define gtc getchar()
#define ptc putchar
#define dou double
#define eps 0.00000000001
#define opr operator
#define cl(... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 998244353;
const int N = 5007;
int n, m, fn[30];
long long fac[2000006]; // 阶乘表
long long qpow(long long x, long long n) {
long long res = 1;
for (; n; n >>= 1, x = x * x % mod)
if (n & 1) res = res * x % mod;
return res;
}
... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
#define pi (3.141592653589)
#define mod 1000000007
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define beastslayer ios_base::sync_with_stdio(false), cin.tie(NULL);
//t... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ios_base::sync_with_stdio(false);cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
cin>>n;
if(n%2==0){
cout<<"White";
}
else{
cout<<"Black";
}
return 0;... | #include <bits/stdc++.h>
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define rep(i, n) repd(i, 0, n)
using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
const ul mod = 1000000007;
int main() {
ios_base::syn... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 35;
ll dp[N][N],a,b,k;
string dfs(ll a,ll b,ll k){
if (a==0) return string(b,'b');
if (b==0) return string(a,'a');
if (dp[a-1][b]>=k){
return "a"+dfs(a-1,b,k);
} else {
return "b"+dfs(a,b-1,k-dp[a-1][b]);
}
}
int main(){
cin... | #include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#define rep(i,n) for(ll i=0;i<(n);++i)
#define rep2(i,n) for(ll i=1;i<=(n);++i)
#define rep3(i,i0,n) for(ll i=i0;i<(n);++i)
#define rrep(i,n) for(ll i=((n)-1); i>=0; --i)
#define rrep2(i,n) for(ll i=(n); i>0; --i)
#define pb push_back
#define mo... |
#include <bits/stdc++.h>
#define ll long long
#define vec vector
#define pii pair<int, int>
using namespace std;
const long long MAXVAL = (long long) 1e18 + 1;
//const long long MOD = 1000000007ll;
const long long MOD = 998244353ll;
const int INF = 1000000001;
long long poww(int x, long long pow) {
if (pow == 0l... | #include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> ... |
#include<iostream>
#include<vector>
#include<string>
#include<queue>
#include<tuple>
#define rep(i, start, end) for (int i = (int)start; i < (int)end; ++i)
#define rrep(i, start, end) for (int i = (int)start - 1; i >= (int)end; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
templa... | #include<bits/stdc++.h>
#define ll long long
#define N 400005
using namespace std;
int read() {
int x=0,f=1;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while('0'<=c&&c<='9'){x=x*10+c-'0';c=getchar();}
return x*f;
}
int n,m,K,cnt,h[N],c[N],fp[N];
struct Edge {
int to,next;
}a[N*2];
void Add(i... |
//Bismillahir Rahmanir Rahim
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<pair<int, int>> vpi;
#define pb push_back... | //OM TAT SAT
#include<bits/stdc++.h>
#define N 100010
using namespace std;
int a[N],b[N];
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a[i]>>b[i];
}//cout<<aa<<bb<<endl;
int ans=10000000,p;
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
//a... |
#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
const int N = 3010;
int f[N][N];
int main(){
#ifndef ONLINE_JUDGE
freopen("E:\\in.txt","r", stdin);
#endif
int n, k;
cin >> n >> k;
f[0][0] = 1;
for(int i = 1; i <= n; i++){
for(int j = n; j >= 1; j--){
f[i][j] = f[i-1][j-1];
if(i >= ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < (n); ++i)
#define FOR(i, m, n) for(ll i = m; i < (n); i++)
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
using vi = vector<int>;
using vii = vector<vi>;
using pii = pair<int, int>;
using vl = vector<ll... |
//Somos insignificantes. Por mais que você programe sua vida, a qualquer momento tudo pode mudar.
// If you have God on your side,everything becomes clear
#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 tr... | #include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
int gcd(int x, int y)
{
if (x == ... |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
#include <cstdint>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
const... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i, n) rep2(i, 0, n)
#define re... |
// by googol_S0
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=998244353;
ll P[5050][5050];
int main(){
ll M,N;
cin>>M>>N;
for(ll i=0;i<=N;i++)P[i][0]=1;
for(ll i=0;i<=N;i++){
for(ll j=0;j<M;j++){
P[i][j+1]=P[i][j]*i%mod;
}
}
ll ANS=0;
for(ll x=1;x<=N;x++){
... | #include <iostream>
constexpr int N = 200005;
constexpr int p = 998244353;
int add(int x, int y) { return (x += y) >= p ? x - p : x; }
int mul(int x, int y) { return (long long)x * y % p; }
int power(int x, int y) { int ans = 1; for (; y; y >>= 1) { if (y & 1) ans = mul(ans, x); x = mul(x, x); } return ans; }
int n,... |
# include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
if (b/c >= d) {
cout << -1 << '\n';
} else {
ll y = (d*c)-b;
ll x = (a/y);
if (((b*x)+a) <= (d * x * c)) {
cout << x << '\n';
} else {
... | #include<bits/stdc++.h>
using namespace std;
template <typename T>
void read(T &x)
{
T f = 1; x = 0;
char ch = getchar();
for (; !isdigit(ch); ch = getchar()) if (ch == '-') f = -1;
for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';
x *= f;
}
template <typename T>
void write(T x)
{
if (x < 0)
{
putchar... |
#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<util... | #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 ... |
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define iso ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int32_t main() {
int n;
cin >> n;
cout<<n/100+(n%100==0?0:1)<<endl ;
} | // #include <bits/stdc++.h>
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // in... |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define test() int t;cin>>t;for(int test=1;test<=t;test++)
#define pb pus... | #include <iostream>
using namespace std;
int A, B;
double W;
int isin(double N) {
if(N >= A and N <= B) {
return true;
} else {
return false;
}
}
int main() {
cin >> A >> B >> W;
int max = 0;
int min = 0;
for (int i = 1; i <= W * 1000; i++) {
double pre = W * 1000 ... |
#include <bits/stdc++.h>
#define ll long long
#define ls id << 1
#define rs id << 1 | 1
#define mem(array, value, size, type) memset(array, value, ((size) + 5) * sizeof(type))
#define memarray(array, value) memset(array, value, sizeof(array))
#define fillarray(array, value, begin, end) fill((array) + (begin), (array) +... | #include <bits/stdc++.h>
#define fi first
#define se second
#define DB double
#define U unsigned
#define P std::pair
#define LL long long
#define LD long double
#define pb push_back
#define MP std::make_pair
#define SZ(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define F... |
/* Author : Mychecksdead */
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define for0(i, n) for(ll i = 0; i < n; i++)
#define for1(i, n) for(ll i = 1; i <= n; i... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main() {
ll N,M,T; cin>>N>>M>>T;
ll n = N, l=0;
rep(i, M){
ll A,B; cin>>A>>B;
n = max(n-(A - l), (ll)0);
if(n <= 0){
cout << ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
//constexpr ll MOD = 1e9 + 7;
constexpr ll MOD = 998244353;
//constexpr ll MOD = ;
ll mod(ll A, ll M) {return (A % M + M) % M;}
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return tru... | // We can calculate the number of inversions in the original array in a number of ways, such as with a Fenwick tree or with merge sort.
// Now, notice that each of the resulting sequences essentially remove the first element of the previous sequence and insert it at the end of it.
// This changes the number of inversi... |
/*
／＞ フ
| _ _|
／`ミ _x 彡
/ |
/ ヽ ?
／￣| | | |
| (￣ヽ＿_ヽ_)_)
＼二つ
*/
#include <queue>
#include <vector>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define MP make_pair
#define ll long long
#define fi first
#define se second
using namespace std;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < n; ++i)
ll gcd(ll a, ll b){
if(a%b == 0) return b;
else return gcd(b,a%b);
}
ll lcm(ll a, ll b){
return a*b / gcd(a,b);
}
int main(){
int h,w,x... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
ty... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
vector<bool> seen;
vector<int> color;
vector<int> ans;
vector<int> c;
Graph G;
void dfs(const Graph &G, int v) {
// cout << "v = " << v <... |
#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<algorithm>
using namespace std;
int main()
{
int t,i,arr[4];
for(i=0;i<4;i++)
cin>>arr[i];
sort(arr,arr+i);
cout<<arr[0]<<"\n";
return 0;
}
|
// Parasparopagraho Jīvānām
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
using namespace __gnu_pbds ;
using namespace __gnu_cxx ;
using namespace std ;
typedef long long ll ;
t... | #include <bits/stdc++.h>
using namespace std;
bool flg[100][100];
int main() {
int n; cin >> n;
for(int i = 0; i < n; ++i) {
for(int j = 0; j < n; ++j) {
char c; cin >> c;
flg[i][j] = (c == '1');
}
flg[i][i] = true;
}
for(int k = 0; k < n; ++k) {
for(int i = 0; i < n; ++i) {
for(int j = 0; j < n; ... |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,mmx,avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define PB push_back
#define MP make_pair
#define endl "\n"
#define fst first
#define snd second
const int UNDEF = -1;
co... | // 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>
#... |
#pragma region templates
//#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;
t... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,m;
cin >> n >> m;
vector<int> vec (n);
for(int i=0; i<n; i++){
int x;
cin >> x;
vec.at(i) = x;
}
for(int i=0; i<m; i++){
int x;
cin >> x;
vec.push_back(x);
}
sort(vec.begin()... |
#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define pii pair<int,int>
#define fastIO ios_bas... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long ll;
ll c[32][32];
signed main(){
rep(i,31){
c[0][i]=1;
}
rep(i,31){
c[i][0]=1;
}
rep(i,31) rep(j,31){
if(i==0||j==0) continue;
c[i][j]=c[i-1][j]+c[i][j-1];
}
ll a,b,k;
cin>>a>>b>>k;
... |
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
typedef long long ll;
using namespace std;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };... | #include <iostream>
#include <string>
#include <vector>
//#include <math.h> /* tan */
#include <cmath>
#include <algorithm> // std::max
using namespace std;
int main(){
int N;
long D;
long H;
cin >> N >> D >> H;
vector<vector<long>> q(N,vector<long>(2));
for(int i = 0; i < N; i++){
cin >> q[... |
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std ;
typedef long long ll ;
const int mod=1000000007 ;
void solve(){
int r,c ;
cin>>r>>c ;
char arr[r][c] ;
rep(i,r){
rep(j,c){
cin>>arr[i][j] ;
}
}
ll count=0 ;
rep(i,r){
rep(j,c-1){
if(arr[i][j]=='.' && ar... | #include<bits/stdc++.h>
using namespace std;
char a,b;
int main(){
cin>>a>>b;
if(a=='Y'&&b=='a')cout<<"A";
if(a=='Y'&&b=='b')cout<<"B";
if(a=='Y'&&b=='c')cout<<"C";
if(a=='Y'&&b=='A')cout<<"A";
if(a=='Y'&&b=='B')cout<<"B";
if(a=='Y'&&b=='C')cout<<"C";
if(a=='N'&&b=='a')cout<<"a";
if(a=='N'&&b=='b')cout<<"b";... |
#include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#include <limits.h>
using namespace std;
typedef long long ll;
template<class T>
inline bool chmax(T &a, T b) {
if(a < b) {
a = b;
return true;
}
return false;
}
... | #include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <iterator>
#include <algorithm>
constexpr int N = 100005;
int n;
std::vector<long long> a[3];
std::string s;
int main() {
std::ios::sync_with_stdio(false), std::cin.tie(nullptr);
std::cin >> n;
for (int i = 1; i <= n << 1; ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using pll = pair<ll, ll>;
#define sz(x) (int)(x).size()
template <typename T> bool ckmin (T& a, T b) { return (b < a) ? a = b, 1 : 0; }
template <typename T> bool ckmax (T& a, T b) { return (b > a) ? a = b, 1 : 0; }
#ifde... | #include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 100005;
int n, d;
int a... |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<int> C(N);
for (int i = 0; i < N; i++) {
char c;
cin >> c;
if (c == 'B') C[i] = 0;
else if (c == 'W') C[i] = 1;
else C[i] = 2;
}
vector<vector<int>> ncr = {
{1,... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define vi vector<int>
#define mk make_pair
#define vll vector<long long >
#define loop(i,a,b) for(int i=a;i<=b;i++)
#define loopr(i,a,b) for(int i=b;i>=a;i--)
#define vii ve... |
#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define m_k make_pair
using namespace std;
const int N=1e5+100;
int T,n,a[N],b[N],w,t[N];
signed main()
{
scanf("%d",&T);
while (T--)
{
scanf("%d",&n);
for (int i=1;i<=n;i++) scanf("%d",&a[i]),b[i]=a[i];
if (n==1)
{
printf("Second\n");
continue;
}
sor... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef long double ld;
#define F first
#define S second
const int MOD = 1e9 + 7;//XXX
const int C = 26;//XXX
void add(int &x, int y){
x += y;
while (x >= MOD) x -= MOD;
while (x < 0) x += MOD;
}
int fix(int x)... |
//雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se seco... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
int main(void){
int h,w,ans=0;
cin >> h >> w;
char m[h][w];
rep(i,h)rep(j,w) cin >> m[i][j];
rep(i,h)rep(j,w){
if(m[i][j]=='#') continue;
rep... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << end... | #include <bits/stdc++.h>
using namespace std;
void init(void)
{
cin.tie(0) ;
cin.sync_with_stdio(0) ;
}
int main()
{
init() ;
int n , temp ;
bool flag = true ;
cin >> n;
int a[n] , b [n] ;
for(int i = 0 ; i< n ;i++) cin >> a[i] ;
for(int i = 0 ; i< n ;i++) cin >> b[i] ;
pair<int,int> minmax ;
minmax... |
#include<bits/stdc++.h>
#define maxn 2000000
#define int long long
using namespace std;
int n,t,a[45];
vector<int> c[2];
void dfs(int now,int r,int s,int k)
{
if(s>t) return;
if(now==r+1)
{
c[k].push_back(s);
return;
}
dfs(now+1,r,s+a[now],k);
dfs(now+1,r,s,k);
}
signed main()
{
ios::sync_with_stdio(0)... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using ll = long long;
using namespace std;
int main(){
int n, T;
cin >> n >> T;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<ll> s, t;
s = t = {0};
rep(i,n){
for (int j = s.size()-1; j >= 0; --j){
s... |
#include "bits/stdc++.h"
using namespace std;
#define int long long int
int N=1e9+7;
int32_t main()
{
int n;
cin>>n;
vector<int> a(n);
for(int i=0;i<n;i++)
{
cin>>a[i];
}
sort(a.begin(),a.end());
int ans=1;
int prev=0;
for(int i=0;i<n;i++)
{
int mine=a[i]-... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co... |
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("unroll-loops")
#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(n... | #include <iostream>
using namespace std;
struct Interval {
int tip;
int left;
int right;
};
int const NMAX = 2000;
Interval v[1 + NMAX];
bool isIntersect(Interval a, Interval b) {
if(a.right == b.left){
if((a.tip == 1 || a.tip == 3) && (b.tip == 1 || b.tip == 2)){// ] and [
return true;
}
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int N = (int)2e5 + 77;
const ll mod = (ll)1e9 + 7;
const ll inf = (ll)1e18;
int main()
{
ll n, ans = 1, sp[33] = {0}, cnt[33] = {0};
cin >> n;
for (int i = 2; i <= n; i++)
{
for (int j = i; j <= n; j += i)
... | #include <bits/stdc++.h>
using namespace std;
#define faster ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pi acos(-1.0)
#define nl '\n'
/**-------Library-------*/
#define mem(a,b) memset(a,b,sizeof(a))
#define all(a) a.begin(),a.end()
#define Sort(x) sort(x.... |
#include <bits/stdc++.h>
#define fi first
#define se second
//#define ivorysi
#define enter putchar('\n')
#define space putchar(' ')
#define pii pair<int,int>
typedef long long int64;
using namespace std;
template<class T>
void read(T &res) {
res = 0;T f = 1;char c = getchar();
while(c < '0' || c > '9') {
if(c =... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<ll>
#define rep(i,a,b) for(ll i=a; i<b; ++i)
#define pb push_back
#define endl '\n'
#define sa(x) sort((x).begin(), (x).end());
#define int long long
#define test cout<<"hello\n";
#define disp(a) trav(a) cout<<x<<" "; cout<<endl;
tem... |
#include <bits/stdc++.h>
#define isNum(a) (a >= '0' && a <= '9')
#define SP putchar(' ')
#define EL putchar('\n')
#define File(a) freopen(a ".in", "r", stdin), freopen(a ".out", "w", stdout)
template <typename T>
void read(T &);
template <typename T>
void write(const T &);
typedef unsigned uint;
typedef long long ll... | #pragma GCC optimize(2)
#include <bits/stdc++.h>
#define all(n) (n).begin(), (n).end()
#define se second
#define fi first
#define pb emplace_back
#define mp make_pair
#define sqr(n) ((n)*(n))
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
#define precision(a)... |
#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;
}... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main(void)
{
ll ans = 0;
int n, m;
cin >> n >> m;
ll even = 0, odd = 0;
rep (i, n){
string s;
cin >> s;
ll score = 0;
rep (j, m){
... |
#include <bits/stdc++.h>
using namespace std;
#ifdef Dhiraj
#include "D:/dhiraj/Programming/debug.h"
#else
#define d(...) 11
#define cerr if(0) cerr
#endif
#define ll long long int
#define endl '\n'
template <typename T, typename U>
inline istream& operator >> (istream& in, pair<T, U>& a) {
in >> a.f... | #include <bits/stdc++.h>
using namespace std;
#define closeSync ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
typedef long long ll;
typedef pair<int,ll> pil;
const int MAXN = 100005;
const ll MOD = 1e9+7;
const ll INF = 1e18;
vector<pil> mp[MAXN];
ll dis[MAXN];
int vis[MAXN];
ll ans[MAXN];
struct Edge{
int u,v... |
#include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
bool solve() {
int n = ri();
int id[2 * n];
for (auto &i : id) i = -1;
int paired[2 * n];
for (auto &i : paired) i = -1;
for (int i = 0; i < n; i++) {
int a = ri() - 1;
int b = ri() - 1;
if (a != -2 && b != -2 && a >= b) return fal... | #include <bits/stdc++.h>
using namespace std;
#define fr(i,n) for(int i = 0; i<n; i++)
#define sz(v) (int)(v.size())
#define prin(a) cout << #a << " = " << a << endl
#define prinv(v) cout << #v << " = "; for(auto it : v) cout << it << ", "; cout << endl
#define all(v) (v).begin(),(v).end()
typedef long long ll;
#def... |
#include <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>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
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; } return 0; }
template<class T>
ostream &operator<<(... |
#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
typedef long long ll;
int n;
int g[21];
bool memo... | #include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <stack>
#include <cassert>
#include <map>
#include <numeric>
#include <cstring>
#include <set>
#include <ctime>
#include <queue>
#include <cmath>
#include <iomanip>
#include <iterator>
#include <bitset>
using namespace std;
clock_t... |
/*
author: Kamal Kant Bhardwaj
date:
*/
#include<bits/stdc++.h>
using namespace std;
#define N 3005
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
... | #include <bits/stdc++.h>
using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;
class rep {
struct Iter {
usize itr;
constexpr Iter(const u... |
#include <iostream>
#include <cassert>
using namespace std;
const int K = 4;
int main() {
int N; string s;
cin >> N >> s;
for (int i = 0; i < N; ++i) {
if (s[i] == 'W') s[i] = '1';
if (s[i] == 'R') s[i] = '2';
if (s[i] == 'B') s[i] = '3';
}
int p3 = 1;
while (p3 < N) p3 *= 3;
p3 /= 3;
for (; p3 >= 1;... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef pair <int,int> Pii;
#define reg register
#define mp make_pair
#define pb push_back
#define Mod1(x) ((x>=P)&&(x-=P))
#define Mod2(x) ((x<0)&&(x+=P))
#define rep(i,a,b) for(int i=a,i##end=b;i<=i#... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (n); ++i)
using ll = long long;
const ll inf = 1e18;
ll solve() {
int n; cin >> n;
vector<vector<ll>> r(3);
rep(i, 2 * n) {
ll a; char c;
cin >> a >> c;
r[string("RGB").find(c)].push_back(a);
}
... | #include<cstdio>
#include<algorithm>
#define N 300010
#define db double
#define ll long long
#define fo(x,a,b) for(int x=(a);x<=(b);x++)
#define fd(x,a,b) for(int x=(a);x>=(b);x--)
using namespace std;
struct node{ll x; int id;}a[N];
int n,t[4],tot1=0,tot2=0,tot3=0,tot4=0;
ll b[N],c[N],d[N],e[N];
ll ans=(1ll<<50),ans1=... |
#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include<stdio.h>
#include<algorithm>
constexpr unsigned long long MOD = 998244353;
constexpr unsigned long long IM = 18479187003;
constexpr unsigned long long MOD32 = 665496236;
char f[5000][5000];
unsigned long long... | #include <bits/stdc++.h>
using namespace std;
#define INF 1020304050607080901
long long steps(long long left, long long t) {
map<long long,long long> m;
m[left] = 0;
queue<long long> q;
long long td = 1LL<<t;
q.push(left);
while (!q.empty())
{
long long now = q.front();
q.pop();
for (long l... |
#include <bits/stdc++.h>
using namespace std;
#define bolt \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define test \
int tt; \
cin >> tt; \
while (tt--)
#define ll long long
#define ld long double
#define vi vector<ll>
#define pb push_back
#define F... | #include <iostream>
using namespace std;
int main(void)
{
double v, t, s, d;
cin >> v >> t >> s >> d;
if(d/v-s > 1e-7 || 1e-7 < t-d/v) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} |
//tt89 ;)
#include<bits/stdc++.h>
using namespace std;
//typedef long long ll;
#define int long long
#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define clock cerr<<"\n"<<(float)clock()/CLOCKS_PER_SEC*1000<<" ms"<<endl;
#define ff first
#define ss second
void testcase(int t) { cout<<... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false);cin.tie(0);
const double EPS = 1e-9;
const double PI = acos(-1);
const int knightDir[8][2] = {{-2,-1},{-2,1},{-1,2},{1,2},{2,-1},{2,1},{-1,-2},{1,-2}};
//const int dx[]={0,0... |
#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 <iostream>
#include <vector>
#include <algorithm>
#include <functional>
using namespace std;
void rotate(string &s , int x) {
string t = s;
for (int i = 0; i < s.size(); i++) {
t[(i + x) % s.size()] = s[i];
}
s = t;
return;
}
int main() {
ios_base::sync_with_stdio(false);
... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, s) for (int i = 0; i < s; ++i)
#define ALL(v) (v).begin(), (v).end()
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define DEBUG
//#define... | #include <bits/stdc++.h>
typedef unsigned long long ull;
using namespace std;
const double maxv = 1e100;
ull n, k, money, ans, ai, bi;
vector <vector <long long> > ab;
int main() {
cin >> n >> k;
money = k;
for(int i = 0; i < n; i++) {
cin >> ai >> bi;
vector <long long> abi;
abi.push_back(ai);
abi.push_back... |
#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <queue>
#include <fstream>
#include <stdio.h>
#include <bitset>
#include <set>
#include <iomanip>
#include <random>
#include <iterator>
#include <map>
using namespace std;
typedef long long ll;
typ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); cerr << '\n'; }
void err(istream_iterator<string> it) {}
template<typename T, typename... Ar... |
#include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define forn(i,n) for(int i = 0; i < (int) n; i++)
#define ios ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
using namespace std;
int main() {
int a, b, x, y;
cin >> a >> b >> x >> y;
if (a == b) {
cout << x << "\n";
return 0;
}
int... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
#define rep(i,n) for(int i=0; i<(int)n; i++)
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) //sortしてから使う
#define INF 2147483647
#define LLINF 9223372036854775807LL
int main(){
int n; cin>>n;
ll ans = 0;
re... |
#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#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 Clear(a) a = decltype(a)()
#define all(a) a.begin(),a... | #include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
using namespace std;
using ll = long long;
#define N 1005
int dp[N][N];
vector<int> a, b;
int n, m;
int solve(int i, int j) {
if (i >= n) return abs(m-j);
if (j >= m) return abs(n-i);
int& curr = dp[i][j]... |
#include<map>
#include<ctime>
#include<cstdio>
#include<cctype>
#include<string>
#define ll long long
const ll N=1e3+10;
const ll HgS=1e9+7;
using namespace std;
ll read() {
char c;
ll x=0,f=1;
while(!isdigit(c=getchar()))
f-=2*(c=='-');
while (isdigit(c)){
x=x*10+(c-48)*f;
c=getchar();
}
return x;
}
ll n,f... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll one = 1;
const ll INF = 9223372036854775807; //10^18
const int inINF = 2147483647; //10^9
const ll MO... |
#include <bits/stdc++.h>
#include <random>
using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef pair<lint, lint> plint; typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(begin),... | //wtrl,everybody hangbeat me
#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<sstre... |
#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <algorithm>
#define M 100001
#define inf 2147483647
typedef long long ll;
int max(int a, int b) { return a > b ? a : b; }
int min(int a, int b) { return a < b ? a : b; }
inline void read(int &T) {
int x = 0; bool f = 0; char c = g... | #include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//#define ordered_set tree<int, null_type, less<int >,rb_tree_tag, tree_order_statistics_node_update>
//using namespace __gnu_pbds;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimiza... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x)... | #include <stdio.h>
#include <vector>
std::pair<int,int> next[1010][1010];
std::pair<int,int> find(std::pair<int,int> P)
{
if(next[P.first][P.second]==P) return P;
else return next[P.first][P.second] = find(next[P.first][P.second]);
}
char x[1010][1010];
int check[1010][1010];
int main()
{
int a,b;
scanf("%d%d",&a... |
#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++) {
... | // Artur Kraska, II UWr
#include <bits/stdc++.h>
#define forr(i, n) for(int i=0; i<n; i++)
#define FOREACH(iter, coll) for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll) for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,R,P... |
/****************************************************************************************************************************/
/************************************* My Template Start *************************************/
/*****************************************************************... | #include<bits/stdc++.h>
//Everything is theoretically impossible untill it is done
#define ll long long
#define vecto vector<int>
#define set set<int>
#define stack stack<int>
#define io ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define pp pair<int,int>
#define mk make_pair
#define mod 10000007
#define MAX INT_... |
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ub upper_bound
#define lb lower_bound
#define isrt insert
#define clr clear
#define rsz resize
#define ff first
#define ss... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define REP(a,b) for(int a=0;a<(b);++a)
#define REP1(i,n) for(int i=1;i<=(n);++i)
#define debug(x) cerr<<#x<<": "<<x<<'\n'
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define YES() printf("YES\n")
#define NO()... |
#include <iostream>
#include <vector>
#include <map>
#include <tuple>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define FastIO ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
typedef long long ll;
int main(){
FastIO;
ll n,x;
cin>>n;
int c=0;
string s,s1,sf;
for(ll i=1;i<=1000000;i++){
s=to_string(i);
s1=to_string(i);
sf=s+s1;
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
//bool vis[1000];
int x[]={1,-1,0,0};
int y[]={0,0,1,-1};
//int f=0;
//int t[500000];
//int ll[500000];
//"'';
int main(){
int r,c,n,m;
cin>>r>>c>>n>>m;
int dp[r][c][4];
memset(dp,0,sizeof(dp));
vector<vector<int> > v(r,vect... | #include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(int i=0;i<n;i++)
#define Fo(i,k,n) for(int i = k ;i<=n;i++)
#define FOR(i,n,k) for(int i = n;i>=k;i--)
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define p... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define fore(i_in,a) for (auto& i_in: a)
#define sz(x) (int)x.... | #include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define fi first
#define se second
const int maxn=100000;
typedef pair<int,int> P;
vector<P>g[maxn+5];
int vis[maxn+5];
int pr[maxn+5];
int col[maxn+5];
void dfs(int x,int pre,int c)
{
vis[x]=1;
pr[c]=1;
if(col[pre]!=c)
col[x]=c;
... |
#include <bits/stdc++.h>
using namespace std;
// a + (a+1) + ... + b
long sum(const long &a, const long &b) { return (a + b) * (b - a + 1) / 2; }
int main() {
int T;
cin >> T;
while (T--) {
long L, R;
cin >> L >> R;
const long minC = L;
const long maxC = R - L;
if (minC > maxC) {
cout... | //コンパイラ最適化
#pragma GCC optimize("Ofast")
//インクルードなど
#include<bits/stdc++.h>
using namespace std;
//エイリアス
using ll = long long;
using ld = long double;
using Graph = vector<vector<ll>>;
//イテレーション
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define ff(i,n) for(i=0;i<n;++i)
#define fff(i,a,b) for(i=a;i<b;++i)
#define pb push_back
#define mp make_pair
#define N 1000050
ll lpf[N], mobius[N];
ll fre[N];
// Function to calculate least
// prime factor of each numbe... | //GIVE ME AC!!!!!!!!!!!!!!!!!
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#define ll int
#define ld long double
#define floatset() fixed<<setprecision(15)
#define all(n) n.begin(),n.end()
#define rall(n) n.rbegin(),n.rend()
#define rep(i, s, n) for (... |
// #include <bits/stdc++.h>
// #include <atcoder/all>
#include <iostream>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <math.h>
#include <string>
#include <cctype>
#include <map>
#include <queue>
#include <limits>
#include <iomanip>
#include <sstream>
#include <cstdlib>
#include <locale>
using n... | #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>
/**
******************* Author:Bisnu sarkar ****************************
**/
/*
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
*/
//PBDS
/*
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu... | #include <bits/stdc++.h>
using namespace std;
#define stp(var, init, end) for (auto var = init; var < end; ++var)
#define stpe(var, init, end) for (auto var = init; var <= end; ++var)
#define ll long long
int main(void)
{
int n;
ll input;
cin >> n;
vector<ll> a(n + 1);
a[0] = 0;
stp(i, 1, n + ... |
// God put a smile upon your face <3
#include <bits/stdc++.h>
#define slld(longvalue) scanf("%lld", &longvalue)
#define ll long long
#define ull unsigned long long
#define pll pair < long long, long long >
#define fastio ios_base:: sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define pb push_back
#define bug ... | #include <bits/stdc++.h>
using namespace std;
long long exgcd(long long a, long long b, long long &x, long long &y)
{
if (!b)
{
x = 1, y = 0;
return a;
}
long long ans = exgcd(b, a % b, y, x);
y -= a / b * x;
return ans;
}
long long solve(long long a, long long b, long long c)
{
long long x, y, z;
z = exgc... |
//#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define P... | #include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int n, m, c[10], dl[10], vis[10], ans = 0x3f3f3f3f, lx[10], db[10];
struct judge {
int l;
int v;
};
judge a[100010];
bool tmp(judge x, judge y)
{
if (x.l != y.l) return x.l < y.l;
else return x.v > y.v;
}
int findl(int x)
{
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.