code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()
template<typename A, size_t N, typename T>
void... | #include <bits/stdc++.h>
#define pb push_back
#define ss second
#define ff first
#define all(x) x.begin(), x.end()
#define INF 3000000000000001 // 3e15
#define ll_max 9000000000000000000
#define PI 3.14159265358979323846L
#define fill(a, n, x) for(int i = 0; i < n; i++) a[i] = x;
#define fast ios_base::sync_with_stdio(... |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | #include <bits/stdc++.h>
#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 sp(n) cout << fixed << setprecision(n)
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... |
//https://atcoder.jp/contests/arc108/tasks/arc108_a
//A - Sum and Product
//从 1 到 sqrt(P) 中枚举是否存在 N 和 M。
#include <bits/stdc++.h>
using namespace std;
//如果提交到OJ，不要定义 __LOCAL
//#define __LOCAL
int main() {
#ifndef __LOCAL
//这部分代码需要提交到OJ，本地调试不使用
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#en... | #include <iostream>
#include <cstdio>
#include <cstring>
#define int long long
using namespace std;
inline int read()
{
int res = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9')
{
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
{
... |
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <deque>
#include <set>
#include <sstream>
#include <stack>
#include <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,k,m;
cin >> n >> k >> m;
int sum=0;
vector<int>a(n-1);
for(int i=0;i<n-1;i++) {
cin >> a.at(i);
sum+=a.at(i);
}
int x=m*n-sum;
if(x>k) {
cout << -1 << endl;}
else if (x<=k && x>=0) {
cout << x << endl;}
else {
cou... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int V, T, S, D;
cin >> V >> T >> S >> D;
string ans = "Yes";
if(V*T <= D){
if(V*S >= D){
ans = "No";
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<int> vi;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define mapi map<int, int>
#define mapl map<ll, ll>
#define pb push_back
#define fast_cin() \
ios_base::sync_with_stdio(false); \
... |
#include <bits/stdc++.h>
#define int long long
#define MOD 1000000007
using namespace std;
vector<vector<int>> binoms(17,vector<int>(17,-1));
int binom(int n, int r){
if(binoms[n][r] != -1) return binoms[n][r];
int ans = 1;
for(int i = 0; i < r; i ++){
ans *= n-i;
ans /= i+1;
}
ret... | //in the name of god//
// SOBHET BEKHEIR JOOOOOOON E DEL
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mem(x,s) memset(x,s,sizeof(x))
#define all(x) x.begin(),x.end()
#define _ ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL);
#define F first
#define S second
#define endi re... |
#include <bits/stdc++.h>
using namespace std;
using P = pair<int64_t, int64_t>;
int64_t my_abs(int64_t a) { return max(a, -a); }
int64_t gcd(int64_t a, int64_t b) {
while (b != 0) {
int64_t tmp = a % b;
a = b;
b = tmp;
}
return a;
}
P calc(int64_t a, int64_t b) {
int64_t aa = my_abs(a);
int64_... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<map>
#include<queue>
#include<deque>
#include<iomanip>
#include<tuple>
#include<cassert>
#include<set>
#include<complex>
#include<numeric>
#include<functional>
using namespace std;
typede... |
//@formatter:off
#include<bits/stdc++.h>
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(i,n) for (ll i = 0; i < ll(n); ++i)
#define rep2(i,s,n) for (ll i = ll(s); i < ll(n); ++i)
#define rep3(i,s,n,d) for(ll i = ll(s); i < ll(n); i+=d)
#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)
#defi... | #include <complex>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int main() {
int N, M, K;
cin >> N >> M >> K;
vector< complex< double > > means(N);
rep(i, K) {
int a;
cin >> a;
means[a].imag(1);
}
compl... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
using P=pair<ll, ll>;
#define MAX 110
int gcd(int a, int b)
{
if (b == 0) return a;
return (gcd(b, a % b));
}
int a[MAX];
signed main(void)
{
int n, ans, max, cnt;
cin >> n;
rep(i, n) cin>>a[i];
... | // includes
#include <bits/stdc++.h>
using namespace std;
// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
... |
#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())
char t[300005];
void solve(){
ll n;
string s;
cin>>n>>s;
if(s=="1"){
cout<<ll(2*pow(10,10));
return;
... | // #pragma GCC optimize(2)
// #include <random>
// #include <windows.h>
// #include <ctime>
#include <algorithm>
#include <iostream>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cctype>
#include <bitset>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++){
cin >> p[i];
}
set<int> st;
for (int i = 0; i <= 200000; i++){
st.insert(i);
}
for (int i = 0; i < N; i++){
if (st.count(p[i])){
st.erase(p[i]);
}
cout <<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// --------------------------------------------------------
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; }
#define ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long i64;
typedef unsigned long long ui64;
typedef vector<i64> vi;
typedef vector<vi> vvi;
typedef pair<i64, i64> pi;
#define pb push_back
#define sz(a) i64((a).size())
#define all(c) (c).begin(), (c).end()
#define REP(s, e, i) for(i=(s); i < (e); ++i)
inlin... | #include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
long long arr[n][n];
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cin>>arr[i][j];
}
}
int dif[n];
int min=arr[0][0],minindex=0;
for(int i=1;i<n;i++){
if(arr[i][0]... |
#include<bits/stdc++.h>
using namespace std;
typedef double db;
int main()
{
int n,dm,hm;
cin>>n>>dm>>hm;
int d,h;
db ans=1.0*hm/dm;
while(n--)
{
scanf("%d %d",&d,&h);
ans=min(ans,1.0*(hm-h)/(dm-d));
}
printf("%.15lf",hm-dm*ans);
return 0;
} | // DeNsE - EcLiPsE //
// WHAT is DEAD may NEVER die //
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <unordered_map>
#include <cmath>
#include <iomanip>
#include <set>
#include <cstring>
#include <stack>
#include <sstream>
#include <queue>
#include <unordered_set... |
#include<bits/stdc++.h>
using namespace std;
bool check(long long k, long long middle, vector<vector<long long>> &b){
if(k >= b[middle][2]){return (true);}
else{return (false);}
}
int main(){
int n, q; cin >> n >> q;
vector<long long> a(n+1), k(q);
for(int i = 0; i < n; ++i){cin >> a[i];}
a[n] = 1LL<<60;
... | #include <bits/stdc++.h>
using namespace std;
// https://www.geeksforgeeks.org/ordered-set-gnu-c-pbds/
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define rep(i,s,e) for(int i=s ; i < e ; i++)
#define rrep(i,s,e) for(int i=s ; i > e ; i--)
#define srep(i,s,e,j) for(int i=s ; i < e ; i+=j)
#defi... |
#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)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n,w;
cin>>n>>w;
ll curr [200005];
memset( curr , 0 , sizeof(curr ) );
for(int i=0;i< n;i++)
{
ll s , t, p;
cin>>s>>t>>p;
curr[s] += p;
curr[t] += -p;
}
for(int i=0;i<20... |
#include<bits/stdc++.h>
using namespace std;
#define int long long //delete if causing problems
#define F first
#define dbg(x) cout<<#x<<" "<<x<<endl;
#define S second
#define setbit(n) __builtin_popcount(n)
#define all(x) x.begin() , x.end()
#define clr(x) memset(x,0,sizeof(x))
#define fast ios_base::sync_with_stdio... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < (ll)(n); ++i)
#define FOR(i, a, b) for(ll i=(a); i < (ll)(b); ++i)
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=... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
int main() {
ll A, B;
cin >> A >> B;
vector<int> primes = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71};
int K = primes.size();
vector<ll> from(1<<K, 0), to(1<<K, 0);
from[0] = 1;
for (ll i... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline void read(T &x) {
x= 0;
char c= getchar();
while(!isdigit(c)) c= getchar();
while(isdigit(c)) x= x * 10 + (c & 15), c= getchar();
}
#define N 74
int n, prime[]= {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71}, p[N];... |
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int n,i,a=0,b=1001,t;
cin >> n;
for(i=0;i<n;i++){
cin >> t;
if(t>a) a=t;
}
for(i=0;i<n;i++){
cin >> t;
if(t<b) b=t;
}
cout << max(b-a+1,0) << endl;
return 0;
} | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define ull unsigned long long
#define mp make_pair
#define si short int
#define speed ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define pill pair<ll,ll>
#define f first
#define s second
#define pilc pair<ll,char>
#define all(a) (a).begin(),(a... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define cin std::cin
#define cout std::cout
#define endl "\n"
#define mod 1000000007
#define pi 3.141592653589793238462643
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define ff first
#define ss seco... | #include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
cout << n / 100 + (n % 100 != 0) << endl;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)
int popcount(int a){
a = (a&0x55555555) + ((a>>1)&0x55555555);
a = (a&0x33333333) + ((a>>2)&0x33333333);
a = (a&0x0f0f... | #include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// 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 rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rrep1(i, n) for (int i = n; i >= 1; i--)
#define all(x) x.begin(),... |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cstdlib>
#include<iomanip>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int A, B;
double ans;
cin >> A >> B;
ans = (double)A * (double)B / 100;
cout << ans << endl;
} | #include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
#define all(v) v.begin(), v.end()
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep_up(i, a, b) for (ll i = a; i < b; ++i)
#define rep_down(i, a, b) for (ll i... |
#include <bits/stdc++.h>
#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 rrep(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define rrep1(i, n) for (int i = (int)(n); i > 0; --i);
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define R... | #include <iostream>
#include <vector>
#include <utility>
#include<algorithm>
#include <string>
#include <map>
#include <cmath>
#include <random>
#include <tuple>
#include <set>
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main(){
ll n;
ll m;
cin >> n;
cin ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define N 214514
const ll mod = 1e9 + 7;
const ll inf = 1000000000000000000;
ll a[N], b[N];
ll par[N], num[N];
bool used[N];
int main() {
ll n;
cin >> n;
vector<vector<ll>> v(n + 1);
for (int i = 1; i < n; i++) ... | #include <bits/stdc++.h>
using namespace std;
//using namespace atcoder;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i,a,b) for(ll i=a;(i)<(b);++(i))
#define RFOR(i,a,b) for(ll i=a;(i)>=(b);--(i))
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,n,0)
#define ALL(v) v.begin(), v.end()
#define UNIQ(v) sort(ALL(v)); v.erase(unique(ALL(v))... | #include<iostream>
using namespace std;
int A, B;
int main(void){
cin >> A >> B;
if( A + B >= 15 ){
if( B >= 8 ){
cout << 1 << endl;
}
else if( B >= 3 ){
cout << 2 << endl;
}
else{
cout << 3 << endl;
}
}
else if( A + B >= 10){
if( B >= 3 ){
cout << 2 << endl;... |
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define print(x) cout << (x) << endl
typedef long long ll;
using P = pair<ll,ll>;
using Graph = vector<vector<int>>;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
int main(){
int a, b, c; cin >> a >> b >> c;
string ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
ull INF = 1000000000000000001;
int main(){
int A, B, C;
cin >> A >> B >> C;
vector<vector<vector<double>>> dp(101, vector<vector<double>> (101, vector<double> (101, 0.0)));
double sum;
double pa, pb, pc;
... |
#pragma region header
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n)for(int i=0;i<(n);i++)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define int ll
#define each(i, a) for (auto &&i : (a))
using ll = long long;
using ld = long double;
using vi = v... | #include <bits/stdc++.h>
#include <vector>
#include<math.h>
#include<string.h>
using namespace std;
#define MAX 300005
#define MOD 1000000007
#define INF 1000000007
#define EPS 0.0000000001
#define CHAINS 18
#define FASTIO ios_base::sync_with_stdio(false);cin.tie(NULL)
#include <ext/pb_ds/assoc_container.hpp>
#include ... |
#include <bits/stdc++.h>
#define rep(i, end) for (auto i = 0; i < end; ++i)
#define ALL(a) a.begin(), a.end()
using namespace std;
using ll = long long int;
const int MOD_NUM = 1e9 + 7;
vector<int> bits_to_indexes(const bitset<8>& bits) {
vector<int> indexes;
rep(i, 8) if (bits[i]) indexes.emplace_back(i);... | #include<bits/stdc++.h>
using namespace std;
int n,a[205];
int f[205][205],pre[205][205];
int main(){
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i],a[i]%=200;
for(int i=1;i<=n;i++){
f[i][a[i]]=1;
for(int j=0;j<=200;j++){
for(int k=1;k<i;k++){
if(f[k][(j-a[i]+200)%200]){
pre[i][j]=k;
f[i][j]=1;
}
... |
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const... | #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 main() {
int H, W, N, M;
cin >> H >> W >> N >> M;
int mat[H][W];
rep(i, H) rep(j, W) {
mat[i][j] = 0;
}
vector<P> light;
rep(i, N) {
in... |
#pragma GCC optimize("O2")
#pragma GCC target("avx")
#include <cstdio>
#include <functional>
#include <queue>
#include <tuple>
#include <vector>
using namespace std;
using ll = long long;
#define shift 30
inline int get_digit() {
int x = 0, f = 1;
char c = getchar();
while(c > '9' || c < '0') {
if(... | #include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp make_pair
#define pb push_back
#define sz(v) (int)(v).size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define re... |
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std; //using namespace atcoder;
template<typename T> using ve=vector<T>;
using ll=long long; using ld=long double; using str=string; using pint=pair<ll,ll>;
using vll=ve<ll>; using vd=ve<ld>; using vs=ve<str>; using vll2=ve<ve<ll>>;
#define whole(f,x,... | #include<iostream>
#include<cstring>
using namespace std;
int a,b;
int x[100010];
int main()
{
cin>>a>>b;
if(a==b)
{
for(int i=1;i<=a;i++) x[i]=i;
for(int i=1+a;i<=a+b;i++) x[i]=-(i-a);
}else if(a>b)
{
for(int i=1;i<=a;i++) x[i]=i;
for(int i=1+a;i<=a+b-1;i++) x[i]=-(i-a);
int sum=0;
for(... |
/*ver 7*/
#include <bits/stdc++.h>
using namespace std;
void init() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(15);}
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<bool>;
using vvl = vector<vector<ll>>;
... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx")
#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) ... |
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
using namespace std;
template<class t> inline t read(t &x){
char c=getchar();bool f=0;x=0;
while(!isdigit(c)) f|=c=='-',c=getchar();
while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
if(f) x=-x;return x;
}
template<... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int mod = 998244353;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << set... |
/*
"An anomaly, I'm Muhammad Ali
Cause I know one day I'm gonna be the"
- Greatest, Eminem
*/
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#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;
typ... | //#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 << " = " <<... |
// atcoder/arc106/B/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto& i : c)
#define unless(cond) if (!(cond))
using namespace std;
template<typename P, typename Q> ostream& operator << (ostream& os, pair<P, Q> p) { os << "(" << p.first << ... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
int32_t main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, m; cin >> n >> m;
vector<int> initial(n), final(n);
for(int &i : initial) cin >> i;
for(int &i : final) cin >> i;
vector< vector<int> > adj(n);
f... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
const ll INF_L = 1LL << 60;
const int INF_I = 1 << 30;
const int MOD = (int)1e9 + 7;
c... | #include <iostream>
#include <string>
#include <algorithm>
#include <utility>
#include <iomanip>
#include <functional>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cctype>
#include <cstdio>
#include <bitset>
#include <complex>
#define ll long long
#define... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define endl "\n"
#define pb push_back
#define fi first
#define se second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (long long i = 0; i < (n); i++)
using ll = long long;
int main() {
ll n; cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<ll> cnt(405);
rep(i, n) {
cnt[a[i]+200]++;
}
ll ans = 0;
for (int i = -200; i <= 2... |
#line 1 "main.cpp"
#include <iostream>
#include <algorithm>
#include <numeric>
#include <vector>
using namespace std;
void solve() {
int n;
cin >> n;
vector<int> xs(n), ys(n), ps(n);
for (auto& x : xs) cin >> x;
for (auto& y : ys) cin >> y;
for (auto& p : ps) {
cin >> p;
--p;
... | #include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
using ll = long long;
const int maxn = 1e6 + 5;
struct bit {
vector<ll> a;
int n;
void init(int _n) {
n = _n;
a.resize(n+10);
... |
// Hail god Yato
#include <bits/stdc++.h>
using namespace std;
#define hs ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = 1e18;
const ll MAX = 100001;
//
//
void solve(){
int n;
cin>>n;
vector<ll> fst(n), snd(n);
for(int i = 0; i < n... | #include <bits/stdc++.h>
using namespace std;using ll=long long;using vi=vector<int>;using vvi=vector<vi>;using vl=vector<ll>;using vb=vector<bool>;using vvb=vector<vb>;using vvl=vector<vl>;using P=pair<int,int>;using PL=pair<ll,ll>;using vp=vector<P>;using vpl=vector<PL>;
#define all(v)(v).begin(),(v).end()
#define... |
#include <bits/stdc++.h>
using namespace std;
int main(void){
// Your code here!
int n,k;
cin>>n>>k;
int town[n][n];
vector<int> v(n-1);
for(int i=0;i<n-1;i++) v[i] = i+1;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cin>>town[i][j];
}
}
int p = 0;
... | #include <bits/stdc++.h>
#define st first
#define nd second
#define PQ priority_queue
using ll = long long ;
using namespace std;
using pii = pair<int,int>;
const int N = 3e5 + 10;
const int MOD = 0;
int a[N];
int main(){
int n, k;
scanf("%d %d", &n, &k);
for(int i =1; i <= n;i ++){
int x;
scanf("%d", &x);
... |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mk make_pair
#define fi first
#define se second
#define mset(a, b) memset(a, b, sizeof(a))
#define DBG(x) cout << "[" << #x << "]: " << x << endl
using ll = long long;
using pii = pair<int, int>;
mt19937 rng(chrono::stea... | #include <iostream>
#include <stdio.h>
#include <vector>
#include <map>
#include <stack>
#include <cstring>
#include <set>
#include <utility>
#include <iostream>
#include <iomanip>
#include <list>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cctype>
//#include <boost/multiprecision/cpp_int.hpp>
#inc... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0 ; i < (n) ; i++)
#define rep1(i,n) for(int i = 1 ; i <= (n) ; i++)
#define rrep(i,n) for(int i = (n) - 1 ; i >= 0 ; i--)
#define rrep1(i,n) for(int i = (n) ; i > 0 ; i--)
#define MOD 1000000007
using ll = int64_t;
using P = pair<int, int>;
usi... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
set<int> s;
s.emplace(n);
int m;
cin >> m;
map<int, vector<int>> mp;
for (int i = 0; i < m; ++i) {
int x, y;
cin >> x >> y;
mp[x].push_back(y);
}
for(auto [x, v] : mp) {
... |
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <cstdio>
#inc... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> //Policy Based Data Structure
using namespace __gnu_pbds; //Policy Based Data Structure
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds; //Policy Based Data Structure
#define p... |
#include<bits/stdc++.h>
using namespace std;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define SZ(a) (int)(a.size())
#define ALL(a) a.begin(),a.end()
#define SET(a,b) memset(a,b,sizeof(a))
#define off ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
typedef pair<int,int> II;
typ... | #include<bits/stdc++.h>
#define M 1005
typedef long long ll;
using namespace std;
int stp[M][M][27];
int n,m;
int to[2*M],nxt[2*M],hd[M][26],cnte;
void adde(int u,int v,int c){
to[++cnte]=v;
nxt[cnte]=hd[u][c];
hd[u][c]=cnte;
}
struct node{int x,y,c;};
queue<node> Q;
int BFS(){
int x,y,c;
while(!Q.empty()){
x=Q.... |
#include <bits/stdc++.h>
using namespace std;
// clang-format off
using ll = int64_t;
template <class T>
istream& operator>>(istream& is, vector<T>& v) {
for (auto& a : v) cin >> a;
return is;
}
template <class T>
istream& operator>>(istream& is, vector<pair<T, T>>& v) {
for (auto& a : v) cin >> a.first >> ... | #include<iostream>
#include<iomanip>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<queue>
#include<algorithm>
using namespace std;
int A,B,C;
double f[105][105][105];
int main()
{
scanf("%d%d%d",&A,&B,&C);
f[A][B][C]=1;
for(int len=A+B+C;len<=300;len++)
{
for(int i=A;i<=99;i++)
for(int j=B;j<=99;j... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
const ll INF = 1e17;
int main(){
int n, m;
cin >> n >> m;
ll w[n], l[m], v[m], a[n];
rep(i,n) a[i] = i;
rep(i,n) cin >> w[i];
rep(i,m) cin >> l[i] >> v[i];
rep(i,n) {
rep(j,m) {
... | /**
* @FileName c.cpp
* @Author kanpurin
* @Created 2020.10.11 23:04:57
**/
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
template<typename T>
struct Bellman_Ford {
private:
struct edge { int to; T cost; };
int V;
vector<vector<edge>> G;
vector<T> d;
public:
con... |
#include <iostream>
int getNum(int x) {
return 7 - x;
}
int main() {
int a, b, c;
std::cin >> a >> b >> c;
int result = getNum(a) + getNum(b) + getNum(c);
std::cout << result << std::endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define rep(i,j,n) for(int i=j;i<n;i++)
#define readvec(v,n) for(int i=0;i<n;i++){cin>>v[i];}
#define MOD 1000000007
int main()
{
int a,b,c;
cin>>a>>b>>c;
cout<<21-(a+b+c)<<"\n";
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define fastIO std::ios_base::sync_with_stdio(false); std::cin.tie(0); std::cout.tie(0)
#define Local
#ifdef Local
#define dbg(args...) do { cout << #args << " -> "; err(args); } while (0)... | #include <iostream>
#include <vector>
#include <array>
#include <algorithm>
#include <math.h>
#include <iomanip>
#include <climits>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
ull gcd (ull a, ull b) {
if(b == 0) return a;
return gcd(b, a % b);
}
ull lcm (ul... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ub upper_bound
#define lb lower_bound
const int M=1e9L+7;
const ll k=1e12L+7;
const ll MM=1e18L;
unordered_set<ll>s;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n;
cin>>n;
ll an... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <complex>
#define ll long long
#define inf 1e9 + 8
#define sinf 1e17 + 500
#define ld long double
#define ull unsigned long long
#define poll complex<double>
#define line pair<poll, poll>
#define pi acos(-1)
#define lp(a, b, c, d) for (ll a = b; a < c; a += d... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define inf (int)1e18+7
signed main() {
ios_base :: sync_with_stdio(false);
cin.tie(0);
int a[3];
for (int i = 0; i < 3; i ++) {
cin >> a[i];
}
sort(a, a + 3);
if (a[0] == a[1]) cout << a[2] << endl;
else if ... | #include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T> using ordered_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define sim template < class c
#defi... |
#define IOS ios::sync_with_stdio(false);
#define rep(i, a, n) for(ll i=a;i<=n;i++)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl "\n"
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const int N = 1e6 + 10;
ll n, m, t, k, ans, cnt, sum, flag;
ll arr[N], vis[N];
char s[N], c;
in... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
signed main(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
cin >> n;
//string s[n];
set <string> s;
map <st... |
#pragma GCC target ("avx2")
//#pragma GCC optimize "trapv"
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_nod... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define reps(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define uniq(a) (a).erase(unique(all(a)), (a).end())
#define bit(n) (1LL << (n))
#define dump(a) cerr << #a "... |
#include <bits/stdc++.h>
#define rei register int
#define int long long
using namespace std;
const int N=2e3+100,mod=1e9+7;
int n,m,a[N];
inline int read(){
int sum=0,sign=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-') sign=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9'){
... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
long long pow_log(long long x,int y)
{
if (!y)
return 1;
long long ret=pow_log(x,y/2);
ret=(ret*ret)%mod;
if (y%2)
ret=(ret*x)%mod;
return ret;
}
int main()
{
int n,m;
scanf("%d%d",&n,&m);
m+=n;
int sum=n;
for (int i=0;i<n;i++)
{
int a;... |
#include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
ll fact[200005];
ll mod_pow(ll x,ll n){
ll res=1;
while(n>0LL){
if(n&1LL){
res=res*x%MOD;
}
x=x*x%MOD;
n>>=1LL;
}
return res;
}
ll extgcd(ll a,ll b,ll& x,ll& y){
ll d=a;
if(b!=0LL){
... | #include<bits/stdc++.h>
#define For(i,a,b) for(register int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(register int i=(a);i>=(b);--i)
//#define int long long
using namespace std;
inline int read()
{
char c=getchar();int x=0;bool f=0;
for(;!isdigit(c);c=getchar())f^=!(c^45);
for(;isdigit(c);c=getchar())x=(x<<1... |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <functional>
#include <stdio.h>
#include <ctype.h>
#include <random>
#include <string.h>
#include <unordered_map>... | #include<bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define all(v) (v).begin(),(v).end()
using ll=long long;
using ld=long double;
using pii=pair<int, int>;
using vi=vector<int>;
using vii=vector<vector<int>>;
const ll LINF=1LL<<60;
const int INF=1<<29;
const ll MOD=1e9+7;
template<typename T> bool ... |
#include <stdint.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <math.h>
using namespace std;
int main()
{
string s;
cin >> s;
for(auto i = 0; i < s.size() && s[i] != '.'; ++i) {
cout << s[i];
}
cout << endl;
return 0;
}
| // Jai Shree Ram
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<n;i++)
#define ll long long
#define int long long
#define pb push_back
#define all(v) v.begin(),v.end()
#define endl "\n"
#define x first
#define y ... |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main () {
std::ios::sync_with_stdio(false); std::cin.tie(0);
int n;
cin >> n;
string s;
cin >> s;
string t;
cin >> t;
reverse(s.begin(), s.end());
reverse(t.begin(), t.end());
set<int> pre, cur;
cur.emplace(0);
int p ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
//#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC targe... |
#include <iostream>
using namespace std;
int main()
{
int n;
double x;
cin >> n >> x;
x *= 100;
for (int i = 0; i < n; i++)
{
int v, p;
cin >> v >> p;
x -= v * p;
if (x < 0)
{
cout << i+1; return 0;
}
else {if (i == n-1)
{
cout << -1; retu... | #include <cstdio>
#include <vector>
using namespace std;
int main(int argc, char** argv)
{
char c, s[200005];
int len = 0;
while((c = getchar()) != '\n');
while((c = getchar()) != '\n')
{
s[len++] = c;
if(len >= 3 && s[len - 3] == 'f'
&& s[len - 2] == 'o'
&& s[len - 1] == 'x')
len -= 3;
}
print... |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_set>
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
int y=(a-b)/2;
cout<<b+y<<" "<<y;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using st = string;
using Pii = pair<int, int>;
#define rep2(i, m, n) for(int i = m; i < n; i++)
#define rep(i, n) rep2(i, 0, n)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define INF (ll)1e9
const int mod = 1e9 + 7;
const int... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int v,t,s,d,a,s1,flag=0;
cin>>v>>t>>s>>d;
a=v*t;
for(int i=t; i<=s; i++)
{
if((d>=(v*i)&&(d<=(v*s))))
{
flag=1;
break;
}
}
if(flag==1)
{
cout<<"No"<<endl;
}
else
... |
#include<iostream>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
int x=(a+b)/2;
cout<<x<<" "<<a-x<<endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void){
int a,b;
cin >> a >> b;
a = a / b;
cout << a << endl;
}
|
#include<bits/stdc++.h>
#define N 100005
#define ll long long
using namespace std;
template<class T>void read(T&x) {
T f=1;x=0;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();}
x*=f;
}
template<class T>void print(T x,char c) {
if(x<0)putchar('-'),x=... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n ;
int sum = 0;
for(int i=0;;i++){
sum += i;
if(sum >= n){
cout << i << endl;
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
//vector <long long> v[1000001];
//stack <long long> s, s2;
//bbbbaaaa
//queue <long long> s, s2;
long long int z[1], x[1][3], y[1][2], m, szu, wy[100][100];
char s[10000000];
long long nwd(long long a, long long b)
{
while(a*b)
{
if(a>b)swap(a, b);
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define F first
#define S second
#define PB push_back
#define MP make_pair
typedef vector<int> vi;
typedef pair<int,int> pi;
#define REP(i,a,b) for (int i = a; i <= b; i++)
void solve(){
int a,b,c;
cin>>a>>b;
if(a == b){cout<<a;return;}
if(a==0){
... |
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
constexpr int INF = 168430090;
int x[17], y[17], z[17], dist[17][17], dp[17][131072];
int main()
{
memset(dp, 10, sizeof(dp));
dp[0][1] = 0;
int N; scanf("%d", &N);
for(i... | #include<bits/stdc++.h>
using namespace std;
long int min=-1;
void find_min(long int m)
{
if(::min==-1)
{
::min=m;
return;
}
if(m<(::min))
::min=m;
}
int main()
{
long int n,**a,i;
cin>>n;
a=new long int*[n];
for(i=0;i<n;i++)
{
a[i]=new long int[3];
cin>>a[i][0]>>a[i][1]>>a[i][2];
... |
// #pragma GCC optimize("O3") // (code on steroids)
# include <bits/stdc++.h>
using namespace std;
typedef long long ll;
# define int ll
# define fastio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
# define len(x) (ll((x).size()))
# define print(x) cout<<(x)<<"\n"
# define P0(x) cout<<(x)<<' '
# d... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ephsilon 1e-9
#define int long long int
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const long long mod = 1e9+7;
const long long mod1 = 998244353;
const int maxN = 2e5+1;
const int mx = 1e5+1;
int32_t main()... |
#include <iostream>
#include <vector>
#include <queue>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <map>
#include <string>
#include <algorithm>
#include <tuple>
#include <array>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
typedef long long ll;
int main()... | #include<iostream>
#include<cmath>
using namespace std;
int main()
{
long long int n;
cin>>n;
long long int c=0,x=0;
long long int h=1e10,l=0;
long long int m=0;
while(h-l>1)
{
m=l+(h-l)/2;
if(m*(m+1)/2<=n+1)
{
l=m;
}
else
{
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll k, n, m;
cin >> k >> n >> m;
vector<ll> a(k);
for (int i = 0; i < k; i++)
{
cin >> a[i];
}
vector<ll> b(k);
vector<pair<ll, ll>> d(k);
ll sum = 0;
for (int i = 0; i < k; i++)
{
... | #include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
//#define MOD 998244353
#define INF 1000000010
#define EPS 1e-9
#define F first
#define S second
#define debug(x) cout<<x<<endl;
#define repi(i,x,n) for(int i=x;i<n;i++)
#define rep(i,n) repi(i,0,n)
#define lp(i,n) repi(i,0,n)
#define repn(i,n) for(in... |
#define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#i... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e6 + 1, inf = 1e9, mod = 998244353;
ll modpow(ll x, ll p){
ll ans = 1;
for (ll i = p; i; i >>= 1, x = x * x % mod) if (i & 1) ans = ans * x % mod;
return ans;
}
int main(){
ios::sync_with_stdio(0), cin.tie(0);
int n;
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
#define F(index,start,end) for(ll index=start;index<end;++index)
#define IA(array,size) F(index,0,size) cin >> array[index]
#define IA2(array,height,widt... | #include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1001001001
#define LINF 1001001001001001001
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define bit(n) (1LL<<(n))
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> LLP;
int main() {
ll N, W;
cin >> N >> W;
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using P = pair<int, int>;
using P3 = pair<int,P>;
using PP = pair<P, P>;
constexpr int INF32 = 1 << 29;
constexpr ll INF64 = 1LL << 61;
constexpr ll MOD = 1000000007;
// constexpr ll MOD = 998244353;
constexpr ... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll cnt[3];
// ll solve(ll a, ll b, ll c){
// if (a>4) return 0;
// if (a==4) return 24;
// if (a==3){
// if (c==0) return 81-solve(1,b,1)-solve(1,b,2);
// else return solve(a,b,0)+24*c;
// }
// if (a==2){
// ... |
#include <iostream>
#include <string>
#include <vector>
#include <iomanip>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
long long calc_score(string s)
{
long long score = 0;
for (char c = '1'; c <= '9'; c++)
{
int cn... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef pair<int, int>pi;
typedef pair<long long, long long>pl;
#define F first
#define S second
#define pb push_back
#define all(x) x.begin() , x.end()
#define m... |
#include <bits/stdc++.h>
#define SZ(x) (int)(x).size()
#define ALL(x) (x).begin(),(x).end()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
using namespace std;
typedef double DB;
typedef long double LD;
typedef long long LL;
typedef unsigned long long ULL;
typedef p... | /*Name-Dipesh
Location-Somewhere in interstellar
W/A is inevitable*/
#include <algorithm>
#include <array>
#include <cassert>
#include<bits/stdc++.h>
#include <chrono>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include<unordered_map>
#include <numeri... |
//The moment you giveup , is the moment you let someone else win!!!
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
#define PI (3.141592653589)
#define seal(x,y) ((x+y-1)/y)
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define fast ios_base::s... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <climits>
#include <queue>
#include <map>
#include<stack>
#include <cmath>
using namespace std;
char judge(string Input){
if(Input=="RP" || Input=="PR"||Input =="PP")return 'P';
if(Input=="RS" || Input=="SR"||Input =="RR")retu... |
#include<iostream>
using namespace std;
int main(){
int n;cin>>n;
int xy[110][2]={0};
bool f=false;
for(int i=0;i<n;++i)cin>>xy[i][0]>>xy[i][1];
for(int i=0;i<n-1;++i){
for(int j=i+1;j<n-1;++j){
for(int k=j+1;k<n;++k){
int x1=xy[i][0]-xy[k][0];
in... | #include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define pf printf
#define ff first
#define ss second
#define sef second.first
#define ses second.second
#define PI 3.14159265 /// tan inverse = atan(value)*(180/PI)
#define ms(a,b) memset(a, b, sizeof(a))
#define lp(i,a,b)... |
#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <limits>
#include <list>
#include <numeric>
#inclu... | //#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#define int long long
using namespace std;
typedef long long ll;
//template<class T>T ABS(T x) {return x<0?-x:x;}
//int ksm(int x,int y) {int r=1;wh... |
//#define _GLIBCXX_DEBUG
//#include <atcoder/all>
#include <bits/stdc++.h>
#include <chrono>
#include <random>
using namespace std;
//using namespace atcoder;
#define rep(i,n) for (int i = 0;i < (int)(n);i++)
using ll = long long;
const ll MOD=1000000007;
//const ll MOD=998244353;
//using mint = modint998244353;
//us... | /*
Author : Xinyuan
*/
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef long long int ll;
const int INF... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using... | #include <iostream>
#include <string>
#include <iomanip>
#include <sstream>
#include <istream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
int max(int, int);
int min(int, int);
int positiveNum(int);
unsigned long long factorial(int);
unsigned long long combination(int, int);
long long... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
using namespace std;
using ll = long long int;
using P = pair<int, int>;
const ll INF_L = 1LL << 60;
const int INF_I = 1 << 30;
const int MOD = (int)1e9 ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> x(3,0),y(3,0);
cin >> x[0] >> y[0];
cin >> x[2] >> y[2];
vector<double> O(2,0);
O[0] = (x[0]+x[2])/2.0;
O[1] = (y[0]+y[2])/2.0;
vector<double> xO(3,0),yO(3,0);
for(int i=0;i<3;i++) {
xO[i] = x[i] - O[0];
y... |
#include <bits/stdc++.h>
#define ln '\n'
#define all(dat) dat.begin(), dat.end()
#define loop(i, to) for (int i = 0; i < to; ++i)
#define cont(i, to) for (int i = 1; i <= to; ++i)
#define circ(i, fm, to) for (int i = fm; i <= to; ++i)
#define foreach(i, dat) for (__typeof(... | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)
//#define ATCODER
#ifdef ATCODER
#include<atcoder/all>
using namespace atcoder;
#endif
#include <algorithm>
#include <utility>
#include <vector>
#include <limits.h>
#include <math.h>
#inclu... |
#include <iostream>
#include <math.h>
#include <vector>
#include <string>
#include <numeric>
#include <unordered_set>
using namespace std;
int main(){
int h,w; cin >> h >> w;
vector<vector<int> > block(h,vector<int>(w));
int min_block;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
template <class T>
bool chmin(T& a, T b)
{
if (a > b)
{
a = b;
return true;
}
else
return false;
}
int main()
{
int h, w;
cin >> h >> w;
int ans = 0;
int mx = 101;
... |
#include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define endl "\n";
#pragma GCC optimize "trapv"
#define sz(v) ((int)(v).size())
const int INF = 1e9;
const int mx =1e6+100;
const int mod =1e9+7;
#define MAX 100005
using namespace std;
typedef long long int ll;
// for policy ba... | #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<string> S;
for (int i = 0; i < N; i++) {
string s;
cin >> s;
if (s[0] == '!') {
s = s.substr(1, s.size() - 1) + '!';
}
S.push_back(s);
}
sort(S.begin(), S.end());
for (int i = 1;... |
#include <bits/stdc++.h>
//#include <iostream>
//#include <vector>
//#include <string>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const ll M = 998244353;
ll sum(ll mn, ll mx) {
return (mx - mn + 1)*(mn + mx) / 2;
}
int main() {
int t, l, r;
cin >> t;
rep(i, t) {
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int t; cin>> t;
for (int i=0; i<t; i++) {
long long l, r;
cin>> l >> r;
if (r >= 2*l) {
cout << (r + 2 - 2 * l) * (r + 1 - 2 * l) / 2 << endl;
}
else {
cout << 0 << endl;
}
}
... |
//****************************Template Begins****************************//
// Header Files
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<utility>
#include<set>
#include<unordered_set>
#include<list>
#include<iterator>
#include<deque>
#include<queue>
#include<stack>
#include<set>
#... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vpl = vector<pair<ll, ll>>;
using pll = pair<ll, ll>;
#define rep(i, k, n) for(ll i = k; i < n; i++)
#define pb push_back
#define mp make_pair
int main(){
string s; cin >> s... |
#include <bits/stdc++.h>
using namespace std;
#define MS(a, b) memset(a, b, sizeof(a))
#define REP(a, b, c) for (register int a = b, _n = c; a <= _n; ++a)
#define DREP(a, b, c) for (register int a = b, _n = c; a >= _n; --a)
#define FOR(a, b, c) for (register int a = b, _n = c; a < _n; ++a)
#define EREP(a, b) for (r... | #include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
#define rep(i, n) for(int i = 0, i##_len=(n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define len(x) ((int)(x).size())
void _cin() {} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... ... |
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
#include<t... | #include <vector>
#include <algorithm>
#include <map>
#include <cstdio>
#include <cstdlib>
template <class E> struct FenwickTree {
int _n;
std::vector<E> data;
FenwickTree(int n) : _n(n), data(n) { }
void add(int p, E x) {
++p;
while (p <= _n) {
data[p - 1] += x;
... |
#include<cstdio>
#include<algorithm>
const int Q=200005;
typedef long long ll;
#define rg register int
//char buf[1<<21],*p1=buf,*p2=buf;
//#define gc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
#define gc() getchar()
inline bool ig(char c){return c>=48&&c<=57;}
inline void read(int &oi){char c;... | #line 2 "/home/defineprogram/Desktop/Library/template/template.cpp"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(ll i=0;i<n;i++)
#define REP(i,n) for(ll i=1;i<n;i++)
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#define all(v) v.begin(),v.end()
#define P pair<ll,ll>
#define len(s) (l... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i,n,k) for(int i=(n);i<(k);i++)
#define ALL(a) (a).begin(),(a).end()
ll ans = 0;
void Main(){
using P = pair<int, int>;
int a, b, x, y;
cin >> a >> b >> x >> y;
a--;
b--;
vector<vector<P>> graph(200);
For(i,0,100... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#define mk make_pair
#define pp pair<int, int>
ll MOD = 1000000007;
ll mod = 998244353;
int inf = 2000001000;
ll INF = 1e18 + 5;
int main(... |
#pragma warning (disable:4996)
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <time.h>
#define ll long long
#define REP(i, n) for(ll i = 0; i < n; i++)
#define SET(a) ll a = 0; (void)scanf("%lld", &a);
/*
ll cutLog(ll);
ll sum(ll);
*/
ll cutLogNew(ll);
int main() {
SET(n);
if (n == 1 || n == 2... | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long double PI = (acos(-1));
const long long MOD = 1000000007;
static const int MAX_INT = std::numeric... |
#include<iostream>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<cmath>
#include<map>
using namespace std;
#define rep(i,N) for(ll i=0;i<N;i++) //0から
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key){
ll right = n, left = -1;
ll md = (right + left) / 2;
while(righ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,A,B;
cin>>N>>A>>B;
cout<<N-A+B<<endl;
} |
// Problem: B - Special Subsets
// Contest: AtCoder - AtCoder Regular Contest 114
// URL: https://atcoder.jp/contests/arc114/tasks/arc114_b
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
// By AmmarDab3an - Aleppo University
#include "bits/stdc++.h"
using namespac... | #pragma GCC optimize("O3") //
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, b, a) for(int i = b - 1; i >= a; i--)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define FORA(i,I) for(const auto& i:I)
#define ALL(x) x.begin(), x.end();
#define... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
int sum=0;
cin >> n;
for(int i=1; ;i++){
if(((i*i+i)/2)>= n){
cout << i<<endl;
break;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define fori(i , a ,b) for (int q = i ; q < a; q +=b )
#define vi vector<int>
typedef long long ll;
const int maxc = 1e9;
void solve() {
//ifstream fin("breedflip.in");
//ofstream fout("breedflip.out");
int a=0, b=0;
cin >> a >> b;
int aa =0, bb=0;
... | #include <bits/stdc++.h>
using namespace std;
inline int S(string n) {
return (n[0] - '0') + (n[1] - '0') + (n[2] - '0');
}
int main() {
string A, B;
cin >> A >> B;
cout << max(S(A), S(B)) << '\n';
return 0;
}
|
#include<cstdio>
#include<algorithm>
#include<cctype>
#include<set>
using namespace std;
#define G getchar()
int read()
{
int x=0; char ch=G;
for (;!isdigit(ch);ch=G);
for (;isdigit(ch);ch=G) x=(x<<3)+(x<<1)+(ch^48);
return x;
}
#undef G
typedef long long ll;
int n,L; //[0,L]
int w[100010],t[100010];
set<int> st;... | #include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#define ll long long int
#define ld long double
#define vll vector<ll>
#define vvll vector<vector<ll>>
#define vpll vector<pair<ll,ll>>
#define prqueue pr... |
#include<iostream>
#include<iomanip>
#include<vector>
#include<string>
#include<cmath>
#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;
temp... | #include <bits/stdc++.h>
using namespace std;
#define LOCAL
#pragma region Macros
typedef long long ll;
#define ALL(x) (x).begin(),(x).end()
const long long MOD=1000000007;
// const long long MOD=998244353;
const int INF=1e9;
const long long IINF=1e18;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
const char dir[4]={'D'... |
//Bismillah Hir Rehmanir Rahim
//Allah knows best
#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;
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <iomanip>
#include <cmath>
#i... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long i, n;
cin>>i>>n;
int d=0;
int c=0;
long long r=(n*100)/i;
if((n*100)%i==0) r--;
r+=n;
cout<<r;
} |
/**So..a**/
#include<bits/stdc++.h>
using namespace std;
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define B_ begin()
#define E_ end()
#define all(a) a.begin(), a.end()
#define NL_ "\n"
#define F first
#define S second
#define FF first.first
#define FS first.second
#de... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define mod 1000000007
#define PI 3.1415926535
#define maxn 100005
#define all(x) x.begin(),x.end()
#define speedUp ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
void _SSGJ_()
{
string s;
cin>>s;
int n= s.length();
int cnt[26]={0};
int... |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <s... | #include <bits/stdc++.h>
using namespace std;
const int max_n = 111, inf = 1000111222;
int n, f[max_n][max_n];
string s;
int main() {
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> s;
for (int j = 0; j < n; ++j... |
/**
* created: 09/01/2021, 14:56:06
**/
#include <bits/stdc++.h>
using namespace std;
const int max_n = 111, inf = 1000111222;
const int max_m = max_n * max_n;
int n, m, a[max_n], from[max_m], to[max_m], ans[max_m];
vector<pair<int, int>> g[max_n];
int h[max_n];
void dfs(int v) {
for (auto p : g[v]) {
... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC loop-opt(on)
#define rep(i, a, b) for(int i = a; i <= b; i++)
#define rrep(i, a, b) for(int i = b; i >= a; i--)
#define print(x) cout << #x <<" = " << x <<"\n"
#define pprint(x) cout << #x <<" = (" << x.first <<", " << x.second <<")\n"
#define all(x) x... |
#include<bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x...) do { cout << "\033[32;1m " << #x << " -> "; err(x); } while (0)
void err() { cout << "\033[39;0m" << endl; }
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x) { for (auto v: a) cout << v << ' ';... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(pow(2, n) / 2);
vector<int> b(pow(2, n) / 2);
for (int i = 0; i < pow(2, n) / 2; i++) {
cin >> a[i];
}
for (int i = 0; i < p... |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
int main() {
int n;
long a[22]... | #include <bits/stdc++.h>
using namespace std;
int n,a[210],dp[210][210],pi[210][210];
void output(int n,int m,int len)
{
if(n==0)
{
cout<<len<<" ";
return;
}
output(pi[n][m],((m-a[n])%200+200)%200,len+1);
cout<<n<<" ";
}
bool check(int i)
{
for(int j=1;j<n;j++)
for(int k=j+1;k<... |
#include <bits/stdc++.h>
#define fi first
#define se second
#define sz(a) (int)(a).size()
#define all(a) (a).begin(), (a).end()
#define reset(a,v) memset((a), v, sizeof(a))
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
co... | #include "bits/stdc++.h"
#define MOD 998244353
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DUM... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.