code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
#define CEIL(a, b) ((a - 1) / b + 1)
void solve() {
i... | //#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 cos... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(int _t)
{
int n; cin >> n;
while (n && n % 10 == 0)
n /= 10;
string s = to_string(n);
if (equal(s.begin(), s.end(), s.rbegin()))
cout << "Yes";
else
cout << "No";
}
int main()
{
ios_base::sync... | #include <bits/stdc++.h>
using namespace std;
//Macros
#define ll long long
#define nl "\n"
#define gl " "
#define pf(x) for(auto a:x) cout<<a.first<<gl<<a.second<<nl;
#define af(x) for(auto a:x) cout<<a<<gl;
//functions
int check_palindrome(string s);
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
... |
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define pb push_back
#define ll long long
#define all(x) x.begin() , x.end()
const int N = 3e5 + 99 ;
int seg[4*N] , a[N] , n , q;
void build(int idx = 1 , int l = 0 , int r = n - 1){
int lf = (idx << 1) , mid = (l + r) >> 1 , ri = lf ... | #include <bits/stdc++.h>
using namespace std;
#define R register
#define LL long long
inline int read() {
int x = 0, f = 1; char a = getchar();
for(; a > '9' || a < '0'; a = getchar()) if(a == '-') f = -1;
for(; a <= '9' && a >= '0'; a = getchar()) x = x * 10 + a - '0';
return x * f;
}
const int N = 20;
int n, ... |
#include <bits/stdc++.h>
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n, k;
cin >> n >> k;
int t[n][n];
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
cin >> t[i][j];
}
vector<int> p(n);
for (int i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<pair<int, int>>> X(N + 1);
rep(i, M) {
int x, y, z;
cin >> x >> y >> z;
X[x].push_back({y, z});
}
int n ... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <cmath>
#include <stack>
#include <map>
#include <functional>
#include <queue>
#include <set>
using namespace std;
int64_t min(int64_t a,int64_t b) {
if (a > b)
{
return b ;
}else
{
... | #include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
const int MOD = 998244353;
const int INF = 1e18;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
signed main(){
int A, B;
cin >> A >> B;
int C = 2*A+100;
if( B < C ) cout << C-... |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
const int N = 2005, mod = 1e9 + 7;
char c[N][N];
int h, w, s, p[N*N], d[N][N], r[N][N], l[N][N], u[N][N], ans;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
p[0] = 1;
for(int i = 1; i < N*N; i++) p[i] = p[i-1] * 2 % mod;
cin >... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
template<int M>
class ModInt {
public:
ll value;
constexpr ModInt(ll v = 0) { value = v % M; if (value < 0) value += M; }
c... |
#include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#in... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, a, b;
cin >> n >> a >> b;
cout << n - a + b << "\n";
return 0;
} |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#include <random>
#include <chrono>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 1010;
int a[N], b[N], n, m, t;
set<int> odd, even;
int res[N * N], cnt;
void swa(int x) {
res[cnt ++] = x;
int l = a[x], r = a[x + 1];
swap(a[x], a[x + 1]);
swap(b[l], b[r]);
t ^= 1;
}
void sol(int x, int y) {
... |
// * Author : Debapriya010 : DEBAPRIYA CHANDRA
// * Jalpaiguri Government Engineering College
#include<algorithm>
#include<bits/stdc++.h>
#define ll long long int
#define dbl long double
#define loop(i,n) for(int i=0;i<n;i++)
#define test(t) int t;cin>>t;while(t--)
#define debo ios_base::sync_... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep_up(i, a, n) for (ll i = a; i < n; ++i)
#define rep_down(i, a, n) for (ll i = a; i >= n; --i)
#define P pair<ll, ll>
#define all(v) v.begin(), v.end()
#define fi first
#define se second
#define v... |
/*
Author: Zcus
Blog: https://cnblogs.com/zcus
*/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define debug(x) cout << #x << " = " << x << endl
#define For(i, x, y) for (int i = x; i <= y; i++)
#define Rep(i, x,... | #include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define FastIO() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define read() freopen("... |
//============================================================================
// Name : B.cpp
// Author : NewtonGn
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include... | #include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
#include<numeric>
using namespace std;
using ll = int64_t;
using Graph = vector<vector<int> >;
cons... |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int mod = 998244353;
const int N = 3000 + 10;
LL dp[N][N];
LL f(LL n, LL k) {
if(n < k) return 0;
if(n == k) return 1;
if(!n) return 0;
if(!k) return 0;
if(dp[n][k] != -1) return dp[n][k];
return dp[n][k] = (f(n - 1, k - 1) + f(n, 2 * k))... | #include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<pair<long long int, long long int>, null_type,less<pair<long long int, long long int> >, rb_tree_tag,tree_order_statistics_node_update>
#def... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int index = 0;
long long n,count = 0;
cin>>n;
long long tem = n;
while(n>0){
index++;
n/=1000;
}
long long base = 1;
for (int i=1;i<index;i++) base *=1000;
base--;
count = (tem-base)*(index-1);
switch (index){
case 1:case 2: break;
case 3: co... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n; cin >> n;
int n_digits = to_string(n).size();
long long ans = 0;
for (int d = 1; d < n_digits; d++) {
ans += (d - 1) / 3 * 9 * pow(10, d - 1);
}
ans += (n_digits - 1) / 3 * (n - pow(10, n_digits - 1) + 1);
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int h,w,a,b;
long long dp[(1 << 17) + 10][20];
long long f(int mask, int da) {
if(da == a)
return 1;
long long &ans = dp[mask][da];
if(ans != -1) return ans;
ans = 0;
for (int i = 0; i < h; ++i) {
for (int j = 0; j < w; ++j) ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define S second
#define F first
#define f(i,n) for(int i=0;i<n;i++)
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define vi vector<int>
#define pii pair<int,int>
#define all(x) x.begin(),x.end()
#define ordered_set tree<int, nu... |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair <int, int>;
using pll = pair <ll, ll>;
#define FIO() ios_base::sync_with_stdio(0);cin.tie(NULL);
#define endl '\n'
const ll MOD = 1e9 + 7;
const int mx = 2009;
string g[mx];
int h, w;
ll val[mx][mx][3];
ll dp[mx][mx];
ll solve(i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
const int INF = int (1e9) + int (1e5);
const ll INFL = ll(2e18) + ll(1e10);
const ui MOD = 1E9 ... |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using vpii=vector<pair<int,int>>;
using vpll=vector<pair<ll,ll>>;
using vs=vector<string>;
using vvc=vector<vector<char>>;
const ll INF=1e18;
const int inf=1e9;
cons... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
using ll = int64_t;
#define rep(i, j, n) for (int i = j; i < (n); ++i)
#define rrep(i, j, n) for (int i = (n)-1; j <= i; ... |
#include <iostream>
#include <algorithm>
#include <math.h>
#include <map>
#include <set>
#include<vector>
#include<random>
#include<string>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
using lli = long long int;
int main(){
lli n;
cin>>n;
ll ans=0;
if(n>=1000) ans+=n-... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, n) for(int (i)=0; (i)<(n); (i)++)
#define FOR1(i, n) for(int (i)=1; (i)<=(n); (i)++)
#define FORI(i, n) for(int (i)=n-1; (i)>=0; (i)--)
template<class T, class U> void umin(T& x, const U& y){ x = min(x, (T)y)... |
#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define PI acos(-1)
#define int long long
bool gt(string s,string t){
vector<int>cnt1(10,0),cnt2(10,0);
for(auto u:s)cnt1[u-'0']++;
int a=0;
for(int i=1;i<=9;i++)a+=i*pow(10,cnt1[i]);
for(a... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O0")
typedef long long ll;
typedef long double ld;
const ll mod = 1e9+7;
const ll INF = 1e18;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
#define Rep(i,a,n) for (ll i = (a); i < (n); ++i)
#define All(a) (a).begin(),(a).end()
#define Pi acos(-1)
using... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<vector<int>> t(n, vector<int>(n));
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> t.at(i).at(j);
}
}
int ans = 0;
vector<int> order(n);
for (int i = 0; i < n; i++) order.at(i)... | //
// main.cpp
//
#include <algorithm>
#include <array>
#include <assert.h>
#include <complex>
#include <iomanip>
#include <iostream>
#include <limits>
#include <inttypes.h>
#include <map>
#include <math.h>
#include <memory>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#inclu... |
#include<bits/stdc++.h>
#define pb push_back
using namespace std;
typedef unsigned long long ull;
typedef unsigned uint;
typedef long long ll;
#define G getchar()
int read()
{
int x=0; bool flg=false; char ch=G;
for (;!isdigit(ch);ch=G) if (ch=='-') flg=true;
for (;isdigit(ch);ch=G) x=(x<<3)+(x<<1)+(ch^48);
return ... | #include<iostream>
#include<cstdio>
#include<queue>
#define ll long long
struct P{
ll to,next;
}e[400005];
int s = 0,t;
int out[200005],in[200005];
int cnt,head[200005];
int vis[200005];
void add(int a,int b){
e[++cnt].to = b;
e[cnt].next = head[a];
head[a] = cnt;
}
ll n,ans = 1;
bool last[200005];
ll dcnt... |
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = "... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int sz = 105, mod = 1e9+7;
struct matrix {
int n, v[sz][sz];
matrix(int n) : n(n) {
memset(v, 0, sizeof(v));
}
matrix operator *(const matrix &b) {
matrix ans = matrix(n);
for(int k=0; k<n; k++) {
for(int... |
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string(string(s)); }
string to_string(bool b) { return to_string(int(b)); }
string to_string(vector<bool>::reference b) { return to_string(int(b)); }
string to_stri... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
typedef long long LL;
string s;
LL dp[N][20], v[N];
LL const mod = 1e9 + 7;
int k;
int main() {
cin >> s >> k;
for (int i = 0; i < s.size(); i++) {
if (s[i] >= '0' && s[i] <= '9')
v[i] = s[i] - '0';
else
... |
#include<iostream>
#include<vector>
#include<queue>
using namespace std;
int func(int v,vector<vector<int>>& T,vector<bool>& F) {
priority_queue<int> q1,q2,q3;
int i;
F[v] = true;
for(i=0;i<T[v].size();i++) {
int temp = func(T[v][i],T,F);
if(F[T[v][i]])q2.push(temp);
else if(temp > 0)q1.push(temp);... | #include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
return (int)c - (int)zero_num;
}
signed ... |
#include <stdio.h>
#include <utility>
#include <vector>
#include <numeric>
int ri() {
int n;
scanf("%d", &n);
return n;
}
int main() {
int n = ri();
std::vector<int> a(1 << n);
for (auto &i : a) i = ri();
std::vector<int> remaining(1 << n);
std::iota(remaining.begin(), remaining.end(), 0);
for (int i = 1... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int64_t num = 1 << N;
vector<int> A(num), B(num);
for(int i=0; i<num; i++){
cin >> A[i];
B[i] = i;
}
for(int i=1; i<N; i++){
int split = 1 << (i-1);
for(int j=(1<<i); j<=num; j+=(1<<i)... |
#include <bits/stdc++.h>
using namespace std;
const long double EPS = 1e-8;
long double eq(long double a, long double b){
return fabs(a - b) < EPS;
}
struct point {
long double x, y;
point(long double _x=0, long double _y=0) :
x(_x), y(_y) {}
bool operator == (point &o) const {
return eq(x, o.x) a... | #include <bits/stdc++.h>
#define fi first
#define se second
#define DB double
#define U unsigned
#define LL long long
#define LD long double
#define pb emplace_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 FOR(i,a,b) for(int... |
#include <cmath>
#include <deque>
#include <algorithm>
#include <iterator>
#include <list>
#include <tuple>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <stack>
#include <string>
#include <vector>
#include <fstream>
#include <iostream>
#include <functional>
#... | #include <bits/stdc++.h>
using namespace std;
void solve(){
int n;
cin>>n;
vector<int> a(n);
for(int i=0;i<n;i++)cin>>a[i];
vector<int> ans;
for(int t=0;;t++){
bool up=true;
for(int i=0;i+1<n;i++) if(a[i]>a[i+1]) up=false;
if(up) break;
int s=t%2;
while(s+1<n && a[s]<a[s+1]) s+=2;
if(s+1>=n){
ans.... |
#include <bits/stdc++.h>
#define FOR(i, j, k) for(int i = j; i < k; i ++)
#define FORE(i, j, k) for(int i = j; i <= k; i ++)
#define FORD(i, j, k) for(int i = j; i >= k; i --)
#define mp make_pair
#define ll long long
//#define f first
//#define s second
#define int long long
using namespace std;
const int MOD=1e9+7;
... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#include<cstring>
#include<algorithm>
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 <= (... |
#include<bits/stdc++.h>
#include <iostream>
#include <ctype.h>
#include <math.h>
#include <set>
#include<string.h>
#include<stdio.h>
using namespace std;
#define boost std::ios::sync_with_stdio(false);
typedef long long ll;
int t;
const int mod = 1000000007;
const int N = 1e3 + 6;
const int MOD = 2019;
int GCD(... | #include "bits/stdc++.h"
using namespace std;
int main() {
string x, ans;
cin >> x;
for (int i = 0; i < x.length(); i++) {
if (x[i] == '.') {
break;
}
else {
ans += x[i];
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ff first
#define ss second
#define mp make_pair
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b, ll& x, ll &y) {
if(b == 0) {
x = 1;
y = 0;
return a;
}
ll x1, y1;
ll g = gcd(b, a%b, x1, y1);
x = y1;
y = x1 - (a/b)*y1;
... | #include<iostream>
#include<vector>
#include<algorithm>
#include<random>
#include<map>
long long int realOdometer = 0;
long long int manhattanOdometer = 0;
long long int generalAverage = 0;
using namespace std;
int main(){
pair<int, int>s, t;
map<pair<pair<int, int>, pair<int, int>>, pair<int, int>>distance;
int ... |
/*_____________________
|Author : canhnam357|
|___________________|
*/
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector <int> vi;
typedef vector <ll> vll;
typedef vector <string> vS;
typedef vector <vector <int... | #include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
//const int mod=998244353;
using P = pair<int,int>;
using Pl= pair<ll,ll>;
using ld=long double;
using V=vector<int>;
using Vl=vector<ll>;
using VV... |
#include <algorithm>
#include <iomanip>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <sstream>
#include <unordered_map>
#in... | #include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 3e5+5;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n;
int main... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
using graph = vector<VI>;
template<class T = ll> using w_graph = vector<vector<pair... | #include <iostream>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <queue>
#include <iomanip>
#include <numeric>
#include <cmath>
using namespace std;
int main() {
string n;
cin >> n;
int k;
cin >> k;
int nn = n.si... |
#include<bits/stdc++.h>
using namespace std;
#define ld long double
#define lli long long int
#define vi vector<int>
#define vlli vector<lli>
#define vvi vector<vi >
#define vvl ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
typedef long long ll;
const ll INF = (1LL << 62) - (1LL << 31); /*オーバーフローしない程度に大きい数*/
const ll MOD = 1000000007;
using namespace std;
ll gcd(ll a, ll b) {
if (a % b == 0) return ... |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mkp make_pair
#define vi vector<int>
#define pii pair<int,int>
#define FI(n) FastIO::read(n)
#define FO(n) FastIO::write(n)
#define ull unsigned long long
#define mst(a,b) memset(a,b,sizeof(a))
#define foR(i,k,j) for(int i=(k);i>=(j);i--)
#define... | //Author : RISHABH (still under construction)
//Don't give up if you can't solve problem !
//TIPS : //copied from Benq
/*
--> check out for integer overflows
--> special cases like n==1
--> do something instead of just sitting and fooling around
--> write everything before you forget
--> think of various approac... |
#include<bits/stdc++.h>
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define ROF(i,a,b) for(int i=(a);i>=(b);i--)
#define sz(x) (int)(x).size()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
#define ll long long
#define pi (3.141592653589)
#define mod 1000000007
#define float double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(c) c.begin(), c.end()
#define min3(a, b, c) min(c, m... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return ... |
// Problem: F - Silver Woods
// Contest: AtCoder - AtCoder Beginner Contest 181
// URL: https://atcoder.jp/contests/abc181/tasks/abc181_f
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namesp... |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
int n;
cin >> n;
vector<ll> a(n);
for (ll &i : a)
cin >> i;
sort(a.begin(), a.end());
ll ans = 0;
for (int i = 0; i != n; i++)
ans += i * a[i] - (n - (i + 1)) * a[i];
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define pi pair<lli,lli>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define FOR(i,a,b) for(lli i=a;i<b;i++)
#define all(x) x.begin(), x.end()
const lli inf=100000000000... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> veca(n);
vector<int> vecb(n);
int cost = 1000000;
int costt = 1000000;
for (int i = 0; i < n; i++) {
cin >> veca.at(i) >> vecb.at(i);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if ... |
#include <bits/stdc++.h>
using namespace std;
const int max_n = 100000;
const long long inf = 2e18;
#define ll long long
#define PLI pair<ll, int>
int n, m;
ll dis[max_n + 15];
struct E {
int v;
ll c, d;
E () {}
E (int v, ll c, ll d) : v(v), c(c), d(d) {}
};
vector<E> edges[max_n + 15];
priority_queue<P... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constex... |
/*
* A.cpp
*
* Created on: Feb 6, 2021
* Author: jrantor
*/
#include<bits/stdc++.h>
using namespace std;
int main(){
double v,t,s,d;
cin >> v >> t >> s >> d;
double x = d/v;
if(x >= t && x <= s){
cout << "No";
}
else cout << "Yes";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned ll;
using ld = long double;
using pi = pair<int, int>;
using pii = pair<ll, ll>;
using vi = vector<int>;
using vii = vector<ll>;
using vip = vector<pair<int, int>>;
const int MAX_N = 1e5 + 1;
const ll mod = 1e9 + 7;
const ll ... |
#include<cstdio>
#define ll long long
using namespace std;
int main(){
ll a,b,c,d;
scanf("%lld %lld\n%lld %lld",&a,&b,&c,&d);
ll ans = 0;
ans = b-c;
printf("%lld\n",ans);
return 0;
} | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a,b;
cin>>a>>b;
cout<<(2*a+100)-b<<endl;
}
|
#include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <algorithm>
#include <iomanip>
#include <string.h>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
typedef long long lint;
usi... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define INF 1000000000000
typedef long long ll;
int main()
{
int a, b, c, ans = 0;
cin >> a >> b >> c;
if (a ... |
#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;
typedef long long int ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<ll, ll> Pair;
typedef vector<Pair> VP;
typedef vector<string> VS;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, n... |
#include <bits/stdc++.h>
using namespace std ;
const int MAX = 1000 + 10 ;
char arr[MAX][MAX] ;
int n , m ;
int par[MAX] , sz[MAX] ;
void init()
{
for(int i = 0 ; i < max(n , m) ; ++i)
par[i] = i , sz[i] = 1 ;
}
int root(int node)
{
if(par[node] == node)
return node ;
return (par[node] = root(par[node])) ;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
int h, w, p[2005];
char c;
int find(int x){return (p[x] < 0 ? x : p[x] = find(p[x]));}
set<int> hh, ww;
void uni(int x, int y){
x = find(x); y = find(y);
if(x != y){
if(p[x] > p[y]) swap(x, y);
p[x] += p[y];
p[y] = x;
}
}
i... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,a,b) for(int i=a; i<=b; i++)
#define all(v) v.begin(), v.end()
#define F first
#define S second
#define INF 2147483647
#define INFLL 1000000000000
#define MOD 998244353
#define PI 3.14159265359
#define dij priority_qu... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, k, n) for (int i = k; i < (int)(n); i++)
#define repd(i, n) for (int i = n-1; i >= 0; i--)
#define rrepd(i, k, n) for (int i = n-1; i >= (int)(k); i--)
#define all(x) (x).begin(),(x).end()
#define chmax(x,y... |
///////////////////////Loading Payloads.......////////////////////////////
#include<bits/stdc++.h>
#define f(i,a,b) for(int i = a; i < b; i++)
#define fd(i,a,b) for(int i = a; i > b;i--)
#define fld(i,a,b) for(ll i = a ; i > b;i--)
#define ll long long
#define fl(i,a,b) for(ll i = a; i < b; i++)
#define VI vector<int>
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<vs> vvs;
typedef vector<bool>... | #include<bits/stdc++.h>
using namespace std;
#define int long long
template<typename T> void read(T &x) {
x=0;int f=1;
char c=getchar();
for(;!isdigit(c);c=getchar())if(c=='-') f=-1;
for(;isdigit(c);c=getchar())x=x*10+c-'0';
x=x*f;
}
const int mod=1e9+7;
int n,p;
/*
(p-1)(p-2)^(n-1)
*/
int qpow(int a,int b){
int... |
#include<iostream>
#include<algorithm>
#include<math.h>
#include<cstring>
#include<vector>
#include<queue>
#define ll long long
const int N=2e5+10;
const ll mod=1e9+7;
ll read(){
ll s = 0, f = 1; char ch = getchar();
while(!isdigit(ch)){
if(ch == '-') f = -1;
ch = getchar();
}
while(isdi... | #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <set>
#include <queue>
#include <stack>
using namespace std;
typedef long long int ll;
typedef pair<int,int> Pai;
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { re... |
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
using namespace std::chrono;
#define ll long long
#define ld long double
#define sz(c) ((ll)c.size())
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,t... | #include<bits/stdc++.h>
using namespace std;
long long dp[15][205];
int L;
int main(){
scanf("%d",&L);
dp[0][0] = 1;
for(int i=1;i<=12;i++)
for(int j=1;j<=L;j++){
for(int k=L;k>=max(j,i);k--){
dp[i][k] += dp[i-1][k-j];
}
}
printf("%lld\n",dp[12][L]... |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll p=998244353;
ll n,m,ans,jc[500010],ny[500010];
ll ksm(ll x,ll y){
ll xlh=1;
while(y){
if(y&1)xlh=xlh*x%p;
x=x*x%p;
y/=2;
}
return xlh;
}
ll C(ll x,ll y){
return jc[x]*ny[y]%p*ny[x-y]%p;
}
int main(){
ll i,j,x,y,xlh;
scanf("%lld%lld"... | #include<string>
#include<iostream>
#include <algorithm>
#include<vector>
#include<functional>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <numeric>
#include <math.h>
#define ll long long
#define PI 3.14159265358979323846
#define rep(i,n) for(ll i=0;i<(ll)n;i++)
#define rep1(x,n) for(ll x=1;x<(ll)n... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
#include<iostream>
#include<cstring>
//#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(... | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define rep(i,n) repi(i,0,n)
#define repi(i,a,n) for(ll i=a;i<(ll)n;++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define Show(val) cout<<(val)<<" "
#define Showl... |
// Problem: E - Train
// Contest: AtCoder - AtCoder Beginner Contest 192
// URL: https://atcoder.jp/contests/abc192/tasks/abc192_e
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <clim... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ss second
#define ff first
#define all(a) a.begin(), a.end()
#define All(a) a.rbegin(), a.rend()
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.precision(10), cout << fixed
const int N = 2e5 + 5;
ll cost[N], n, m;
ll inf = 1e18;
stru... |
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,k,mod,buf[2000005],buf2[2000005],*f=buf+1000000,*g=buf2+1000000;
int val=500000,tans[100005];
inline int addmod(int x)
{
return x>=mod?x-mod:x;
}
inline int submod(int x)
{
return x<0?x+mod:x;
}
int fpow(int x,int y)
{
int ans=1;
whil... | #include<iostream>
#include<cstdio>
using namespace std;
long long n,k,sum,f[101][1000001],mod,ans;
int main(){
scanf("%lld%lld%lld",&n,&k,&mod);
sum=((n*(n-1ll))/2ll)*k;
f[0ll][0ll]=1ll;
for(long long i=1ll;i<=n;i++){
for(long long j=0ll;j<=sum;j++){
f[i][j]=f[i-1ll][j];
if(j>=i)f[i][j]=(f[i][j]+f[i][j-i]... |
/*
may God of speed-forces be with us !!
--problem isnt, life is empty;
--problem is, life is full of emptiness;
a non-strugling pupil coder !!
*/
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define F first
#define S second
//#define biGinf 9e+18
#define all(v) v.begin(),v.end()
#define ra... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i < (n); ++i)
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int main(){
int n, m; cin >> n >> m;
vector<int> a(m+2);
rep(i,m) cin >> a[i+1];
a.back() = n+1;
sort(a.be... |
/*Created By:---- Dibas Behera*/
#include<bits/stdc++.h>
using namespace std;
#define db(x) cout<<x<<'\n'
#define db1(x) cout<<#x<<"="<<x<<'\n'
#define db2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<'\n'
#define db3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<'\n'
#define repi(i,n) for(int i=0;i<(n);++i)
/... | #include <bits/stdc++.h>
using namespace std;
// clang-format off
#define range(i, l, r) for ( int i = (int)(l); i < (int)(r); (i) += 1 )
#define rrange(i, l, r) for ( int i = (int)(r)-1; i >= (int)(l); (i) -= 1 )
#define debug(x) cerr << "(" << __LINE__ << ") " << #x << ": " << (x) << endl;
template <typename T1, typ... |
#include <bits/stdc++.h>
using namespace std;
int read()
{
int x , f = 1;
char ch;
while( ( ch = getchar() ) < '0' || ch > '9' )
if( ch == '-' ) f = -1;
x = ch ^ 48;
while( ( ch = getchar() ) >= '0' && ch <= '9' )
x = ( x << 3 ) + ( x << 1 ) + ( ch ^ 48 );
return x * f;
}
int a , b , c;
int main()
{
a = r... | #include <bits/stdc++.h>
#include <unordered_map>
#define fast_io \
ios::sync_with_stdio(false); \
cin.tie(... |
/*
_______ _______ _______
/ _____ \ / _____ \ / _____ \
/ / \_\ _ __ _ / / \ \ _ __ _ / / \_\
| | | | | | | | | | | | | | | | | | | |
| | | ... | /*---------changeable---------*/
const int big=1000000007;
//const int big=998244353;
const double EPS=1e-8; //適宜変える
//#include <atcoder/all>
//using namespace atcoder;
#pragma region template
#ifdef LOGX
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
/*---------macro---------*/
#define r... |
/* Sat-Chitta-Ananda */
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define inf (int)1e9
#define f first
#define s second
int readInt() { int x; cin >> x; return x; }
char readChar() { char x; cin >> x; return x; }
int readDouble() { double x; cin >> x; return x; }
s... | #include <bits/stdc++.h>
//#include <atcoder/modint>
//#include <atcoder/math>
//#include <boost/multiprecision/cpp_int.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPP(i, n) for(int i = 1; i <= n;... |
#include <bits/stdc++.h>
// #include <atcoder/all>
// using namespace atcoder;
using namespace std;
using ll = long long;
bool v_cmp(pair<int, vector<int>> &p, pair<int, vector<int>> &q) {
return p.first < q.first;
}
// sort(v.begin(), v.end(), v_cmp); // small to large
int main() {
ios::sync_with_stdio(fal... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define Pr pair<ll,ll>
#define Tp tuple<ll,ll,ll>
using Graph = vector<vector<int>>;
ll mod = 1000000007;
int main() {
ll N; cin >> N;
ll dp[N+1][200]; ll A[N];
rep(i,200){
rep(j,N+1) d... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
const int N=101;
const ll mod=1e9+7;
int n;
bool a[N][N];
int main(){
ios::sync_with_stdio(false);
cin >> n;
for(int i=1; i<=n ;i++){
for(int j=1; j<=n ;j++){
char c;cin >> c;
if(c=='1') a[i][j]=1;
}
a[i... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
ll s,d,m,n,x;
s=d=0;
m=0;
cin >> n;
while(n--)
{
cin >> x;
s+=abs(x);
d+=x*x;
m=max(m,abs(x));
}
cout << s << '\n';
cout << setprecision(15) << fixed << (double)sqrt(d) << '\n';
cout << m;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
return (int)c - (int)zero_num;
}
signed ... | #include <bits/stdc++.h>
#include <iomanip>
#define ll long long
#define lli long long int
#define ms0(x) memset(x, 0, sizeof(x))
using namespace std;
long long MAXN = 1e9;
long double pi = 3.1415926536;
long long mod = 1e9;
bool secgreat(pair<pair<lli, lli>, lli> a, pair<pair<lli, lli>, lli> b)
{
pair<lli, lli>... |
#include<bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
template <class T> bo... | #include <bits/stdc++.h>
using namespace std;
struct PQItem{
int d,x,y;
bool jump;
bool operator<(const PQItem& other)const{
return d>other.d;
}
};
int main() {
int r,c;
cin>>r>>c;
vector<vector<int>> a(r,vector<int>(c-1)),b(r-1,vector<int>(c));
for(auto &row:a)
for(int... |
#include<bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
// typedef tree<pair<int,int>, null_type, less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define ll long long
#define scn(n)... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
//const ll MAX = 4e5;
//const int MOD = 3;
void fast_io() {
cin.tie(NULL);
ios_base::sync_with_stdio(false);
}
//int bf[MAX + 1], bg[MAX + 1];
char colorOnTop(char c0, char c1) {
if (c0 == c1) return c0;
if (c0 == 'W' && c1 == 'B') retu... |
/* *****fireice**** */
#include<bits/stdc++.h>
#define ll long long int
#define ld long double
#define vi vector<int>
#define vc vector<char>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define pii pair<int,int>
#define pb push_back
#define eb emplace_back
#define el '\n'
#... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll mod = 1000000007;
const ll mod9 = 998244353;
const ll INF = 1001001001;
const ll LINF = 1001001001001001001;
void prvec(vector<ll> vec){
ll n =... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define FOR(i, n) for(int (i)=0; (i)<(n); (i)++)
#define FOR1(i, n) for(int (i)=1; (i)<=(n); (i)++)
#define FORI(i, n) for(int (i)=n-1; (i)>=0; (i)--)
template<class T, class U> void umin(T& x, const U& y){ x = min(x, (T)y)... | #include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <functional>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <bitset>
#include <math.h>
#include <random>
#include <chrono>
#include <assert.h>
using namespace std ;
using... |
#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
#define N 200005
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,a[N],vst[17],tot;
char s[N];
ll f[N][17];
int m... | #include <iostream>
#include <algorithm>
#include <string>
using namespace std;
constexpr int Z = 1e9+7;
void add(int cnt[], int &ccnt, int x) {
cnt[x]++;
if (cnt[x] == 1) {
ccnt++;
}
}
void sub(int cnt[], int &ccnt, int x) {
cnt[x]--;
if (cnt[x] == 0) {
ccnt--;
}
}
int main... |
#include <bits/stdc++.h>
#define IO_OP std::ios::sync_with_stdio(0); std::cin.tie(0);
#define F first
#define S second
#define V vector
#define PB push_back
#define MP make_pair
#define EB emplace_back
#define ALL(v) (v).begin(), (v).end()
#define debug(x) cerr << "Line(" << __LINE__ << ") -> " << #x << " is " << x << ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int n,m;
int vdnsddk;
cin>>n>>m;
vector<pair<int,int>>a(m);
for(int i=0;i<m;i++)
{
cin>>a[i].first>>a[i].second;
}
int k;
cin>>k;
vector<pair<int,int>>b(k);
for(int j=0;j<k;j++)
{
... |
#include<algorithm>
#include<iostream>
#include<cstdio>
#define int long long
int t;
std::string st,goal="atcoder";
bool can(int len){
for(int i=0;i<st.length()-len;i++){
std::swap(st[i],st[len+i]);
if(st>goal)return true;
std::swap(st[i],st[len+i]);
}
return false;
}
signed main(){
scanf("%lld",&t);
for(int... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define rep(i, n) for (int i = 0; i < (int)(n); ++ i)
int main() {
auto solve = [&] () {
static char s[1005];
scanf("%s", s);
int n = strlen(s);
cons... |
//ABC_199_
//
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define reps(i,s,n) for(int i=s;i<n;++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int mod = 1e9 + 7;
class mint
{
public:
long long x;
mint(long long x = 0) :x((x% mod + mod) % mod) {}
mint operato... | #include<bits/stdc++.h>
#define int long long
#define N 100
#define P 1000000007
#define inf 999999999999999999
using namespace std;
int n,m,K,d[N+1],dq[N+1],g[N+1][N+1],ny2,ans[N+1],p,q;
int ksm(int x,int y){int nans=1;for(;y;y>>=1,x=x*x%P)if(y&1)nans=nans*x%P;return nans;}
int qny(int x){return ksm(x,P-2);}
struct ma... |
#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
#define int long long
using namespace std;
inline int read()
{
bool flag=1;
int x=0;
char c=getchar();
while(c<'0'||c>'9')
{
if(c=='-')
flag=0;
c=getchar();
}
while(c>='0'&&c<='9')
{
x=(x<<1)+(x<<3)+c-'0';
c=getchar();
}
return (flag?x:~(x-1));... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define fi first
#define se second
const int N = 2e5 + 5;
const int INF = 2e9;
const ll LINF = 9e18;
const int MOD = 1e9 + 7;
int n;
int a[N], dp[N];
int add(int x, int y) { return (x + 0ll + y) % MOD; }
int mul(int x, int y) { return x * 1ll * y ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if(n%2==0) cout << "White" << endl;
else cout << "Black" << endl;
} | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned lon... |
#include<bits/stdc++.h>
using namespace std;
#define dd double
#define ll long long int
#define light ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int main()
{
#ifndef ONLINE_JUDGE
freopen("input1.txt","r",stdin);
freopen("output1.txt","w",stdout);
#endif
light;
dd x1,y1,x2,y2;
cin>>x1>>y1>>x2>>y2;
co... | // Problem: D - Opposite
// Contest: AtCoder - AtCoder Beginner Contest 197（Sponsored by Panasonic）
// URL: https://atcoder.jp/contests/abc197/tasks/abc197_d
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include<bits/stdc++.h>
using namespace std;
#define fastio io... |
#include <bits/stdc++.h>
using namespace std;
#define rep(a,b,c) for(int a=b;a<=c;a++)
#define per(a,b,c) for(int a=b;a>=c;a--)
#define pii pair<int,int>
#define mp make_pair
#define fi first
#define se second
const int N=1e3+5;
const int inf=0x3f3f3f3f;
template<class T>inline void read(T &x) {
T f=1;x=0;char s=getch... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define LOL cout << '\n';
#define kill(x) {cout << (x) << '\n'; return;}
#define sz(x) ((int)x.size())
#define INF LONG_L... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
cout << N - A + B;
}
| #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define rrep(i,n) for(int i=n-1;i>=0;--i)
#define yesno(flg) if(flg){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define MAX_N 100001
#define i197 1000000007
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P1;
typedef pair<int,int> Pi;
typedef... |
#include <bits/stdc++.h>
using namespace std ;
using ll = long long ;
int T ;
int main(){
cin >> T ;
vector<ll> val ;
for(int i = 0 ; i < T ; i++){
ll R , L ;
cin >> L >> R ;
ll tmp = 2 * L ;
if(R < tmp){
val.push_back(0) ;
continue ;
}
ll res = R - tmp + 1 ;
ll ans = res... | // Jai Shree Ram
#include<bits/stdc++.h>
typedef long long int ll;
#define pb push_back
#define max2(a,b) (a>b)?a:b
#define mi2(a,b) (a<=b)?a:b
#define fori(i,n) for(ll i=0;i<(ll)n;i++)
#define ford(i,n) for(ll i=n;i>=0;i--)
#define pll pair<ll,ll>
#define MOD 998244353
#define ff first
#define ss second
using namespac... |
#include <cstdio>
#include <cstring>
using namespace std;
#define rei register int
#define rep(i, l, r) for(rei i = l, i##end = r; i <= i##end; ++i)
#define per(i, r, l) for(rei i = r, i##end = l; i >= i##end; --i)
inline void chmax(int &x, const int y) { if(x < y) x = y; }
const int N = 105;
inline int read() {
int... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define pb push_back
#define vi vector<int>
#define all(a) (a).begin(),(a).end()
#define F first
#define S second
#define endl "\n"
#define fast i... |
#include <bits/stdc++.h>
using namespace std;
long long L = 10000000000;
int main(){
long long N;
string T;
cin >> N >> T;
if(N==1){
if(T=="0") cout << L << endl;
else cout << L*2 << endl;
}
else if(N==2){
if(T=="00") cout << 0 << endl;
else if(T=="01") cout << L-1 << endl;
else cou... | #include<iostream>
#include<algorithm>
#include<map>
#include<cstdio>
#include<cstring>
#include<cmath>
#define ll long long
#define lson (rt<< 1)
#define rson (rt<< 1 | 1)
#define gmid ((l+r)>> 1 )
using namespace std;
const int maxn=20000050;
string s;
char a[4];
int main()
{
ll k=10000000000;
int n;
cin>>n;
a... |
/* _____________________
|Author : canhnam357|
|___________________|
*/
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef vector <int> vi;
typedef vector <ll> vll;
typedef vector <string... | #include<bits/stdc++.h>
using namespace std;
#define me(a,x) memset(a,x,sizeof(a))
#define sc scanf
#define pr printf
#define IN freopen("in",stdin);
#define OUT freopen("out","w",stdout);
typedef long long ll;
typedef unsigned long long ull;
const int N=1e7+6;
const int mod=1e9+7;
int O(){putchar('\n');return 0;}templ... |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
//const ll mod=998244353;
const ll mod=1000000007;
ll GCD(ll a,ll b) {retur... | #include<bits/stdc++.h>
using namespace std;
//#include<atcoder/all>
//using namespace atcoder;
using ll = long long;
#define For(i,n,k) for(int i=(n);i<(k);i++)
#define ALL(a) (a).begin(),(a).end()
auto canMove = [](int cnt, int idx){return (cnt + idx) % 2 == 0;};
void Cout(vector<int> &ans){
cout << ans.size() <<... |
//clear adj and visited vector declared globally after each test case
//check for long long overflow
//Mod wale question mein last mein if dalo ie. Ans<0 then ans+=mod;
//Incase of close mle change language to c++17 or c++14
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define int long lo... | // #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(a) a.begin(), a.end()
#define sz(x) x.size()
#define yn(p) cout << (p?"Yes":"No") << endl;
using namespace std;
using ll = long long;
us... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int,int>;
int main() {
int a,b,c,d;
cin >> a >> b >> c >> d;
int n=0;
if (a <= n*d*c) {
cout << n << endl;
return 0;
}
n++;
if (d*c-b <= 0) {
cout << -1 << endl;
return 0;
}... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl '\n'
typedef pair<int, int> P;
typedef long long ll;
class Combination
{
vector<long long> fact;
vector<long long> factinv;
long long MOD = 1e9 + 7;
long long modpow(long long a, long long n)
... |
#include<bits/stdc++.h>
using namespace std;
inline int read(){
int res=0;
bool zf=0;
char c;
while(((c=getchar())<'0'||c>'9')&&c!='-');
if(c=='-')zf=1;
else res=c-'0';
while((c=getchar())>='0'&&c<='9')res=(res<<3)+(res<<1)+c-'0';
if(zf)return -res;
return res;
}
signed main(){
int n=read();
string s;cin>>s;... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int n,a,minv=1<<30,maxv,T,b,q,num;
string s,t,tt;
char tmp1,tmp2;
signed main()
{
cin>>n>>s>>q;
for(int i=1;i<=q;i++)
{
scanf("%lld%lld%lld",&T,&a,&b);
if(T==1)
{
if(num==1)
{
if(a>n)
a-=n;
else
a+=n;
if(b>n)
... |
#include <bits/stdc++.h>
#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
#include <numeric>
usin... | #include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
using namespace std;
#pragma GCC optimize("O3","unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC target("avx2")
#define sync ios_base::sync_with_stdio(0); ci... |
#include <bits/stdc++.h>
using namespace std;
mt19937 rand_mt(42);
const int N = 20;
class Genome{
public:
Genome(const vector<string>& S): sequences(S){
// auto dna = init_random();
auto dna = init_bf();
for(int i=0; i<N; i++){
dna_w[i] = dna[i];
for(int j=0; j... | #include <bits/stdc++.h>
using namespace std;
class Timer {
public:
Timer() { start_time_ = std::chrono::steady_clock::now(); }
int64_t elapsedMilliSeconds() const {
auto elapsed = std::chrono::steady_clock::now() - start_time_;
return std::chrono::duration_cast<std::chrono::milliseconds>(elaps... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long n;
cin>>n;
vector<long long> a(n),b(n),v(1000,0);
for(int i=0;i<n;i++) cin>>a[i];
for(int i=0;i<n;i++) cin>>b[i];
for(int i=0;i<n;i++)
{
for(int j=0;j<a[i]-1;j++)v[j]=1;
for(int j=b[i];j<1000;j++)v[j]=1;
}
int count=0;
for(int i=0;i<1000... | #include<bits/stdc++.h>
using namespace std;
#define sz(x) (int)x.size()
#define pb push_back
#define mp make_pair
#define ll long long
#define mod 1000000007
#define mod2 998244353
void fast(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
}
int main() {
fast();
int n;
cin>>n;
int a[n];
int b[n];... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long int
#define fast ios_base::sync_with_stdio(false)
#define fast_input cin.tie(NULL)
#define fast_output cout.tie(... | #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>... |
#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) ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using V = vector<int>;
using VV = vector<V>;
using VVV = vector<VV>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
template<class T> using VE = vector<T>;
template<class T> using P = pair<T, T>;... |
/*
／＞ フ
| _ _|
／`ミ _x 彡
/ |
/ ヽ ?
／￣| | | |
| (￣ヽ＿_ヽ_)_)
＼二つ
*/
#pragma GCC optimize("Ofast","inline","-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define pf push_front
#define F first
#define S s... | //#define MULTICASES
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(i=(a);i<=(b);++i)
#define per(i,a,b) for(i=(a);i>=(b);--i)
#define REP(i,a,b) for(i=(a);i< (b);++i)
#define PER(i,a,b) for(i=(a);i> (b);--i)
#define ERR(...) fprintf(stderr,__VA_ARGS__)
template<class T>inline... |
//#pragma GCC target ("avx2")
//#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>
//using namespace __gnu_pbds;
#define eps 1e-9
#define eq(x,y) (fabs((x)-(y)) < eps)
using namespace std;
... | #include <bits/stdc++.h>
#include <fstream>
#include <bitset>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF=2147483647;
// 9,223,372,036,854,775,807
const ll INFL = 9223372036854775807;
int main(){
ll n;
cin >> n;
vector<pair<string,int>> s(n);
for(int i=0;i<n;i++... |
#line 1 "main_b.cpp"
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#i... | #include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
#include<math.h>
#include<iostream>
#include<cmath>
#include<queue>
#include<vector>
#define IOS ios::sync_with_stdio(false);cin.tie();cout.tie(0)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pll;
c... |
#include <bits/stdc++.h>
typedef long long ll;
const int P = 998244353;
const int N = 200000;
const int IV2 = (P + 1) >> 1;
inline int norm(int x) {if( x >= P ) x -= P; return x;}
int pw2[N + 5], ipw2[N + 5];
int a[N + 5], n;
int main() {
scanf("%d", &n);
for(int i=1;i<=n;i++) scanf("%d", &a[i]); std::sort(a + ... | #include <bits/stdc++.h>
using namespace std;
#define clr(a) memset(a, 0, sizeof(a))
#define full(a) memset(a, 0x3f, sizeof(a))
#define mset(a, b) memset(a, b, sizeof(a))
#define cpy(a,b) memcpy(a, b, sizeof(a))
#define fornext(x, i) for(signed i = hd[x], y = ver[i]; i; i = nxt[i], y = ver[i])
#define Rep(i, a, b) for(... |
#include<bits/stdc++.h>
using namespace std;
int a[65540];
template<class T>inline void read(T &x){
x=0;register char c=getchar();register bool f=0;
while(!isdigit(c))f^=c=='-',c=getchar();
while(isdigit(c))x=(x<<3)+(x<<1)+(c^48),c=getchar();
if(f)x=-x;
}
int main(){
int n,t;
cin>>n;
int min1=-INT_MA... | #include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a),i##END=(b);i<=i##END;i++)
#define Rof(i,b,a) for(int i=(b),i##END=(a);i>=i##END;i--)
#define go(u) for(int i=head[u];i;i=nxt[i])
using namespace std;
inline int read(){
int x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar()... |
#include<bits/stdc++.h>
using namespace std;
const int N=3005,mod=998244353;
inline void add(int &a,int b){a+=b;if(a>=mod)a-=mod;}
int dp[N][N];
int main()
{
int n,k;
scanf("%d%d",&n,&k);
dp[0][0]=1;
for(int i=1;i<=n;i++)
{
for(int j=n;j>=1;j--)
{
if(j) add(dp[i][j],dp[i-1][j-1]);
if(j*2<=n) add(dp[i][j]... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{... |
// Author: old_school
// Created: 20.02.2021 17:30:29
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
using namespace std;
#define lld long long int
#define ld long double
#define pb push_bac... | #pragma GCC optimize("Ofast", "unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
using pos = pair<int, int>;
bool canMoveWith1Move(const pos& from, const pos& to){
return (
(from.first + from.second == to.first + to.second) ||
(from.fir... |
#include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define test int t;cin>>t;while(t--)
#define REP(i,n) for (int i = 1; i <= n; i++)
#define MOD 1000000007
#define MOD2 998244353
#define ll long long
#define ld long double
#define int ll
#define pb push_... | #include<iostream>
#include<cstring>
#include<cmath>
#include<stack>
#include<queue>
#include<vector>
#include<unordered_set>
#include<set>
#include<unordered_map>
#include<map>
#include<algorithm>
#include<climits>
#include<iomanip>
#include<cstdio>
using namespace std;
#define ll long long int
#define ull unsigned l... |
#include <bits/stdc++.h>
using namespace std;
//A.at(i) = iの約数の個数 = Π(素因数の乗数+1)
//しかし1から10^5まで全て因数分解するのはたぶん間に合わない
//☆違う
//例えば6の約数の個数は4だが、A.at(2) = A.at(3) = 2なのでA.at(6) = 3
//つまり「A.at(n) = A.at(nの約数iのうち、A.at(i)がもっとも大きいもの) + 1
//DP?
int main() {
int N;
cin >> N;
vector<int> A(N + 1, 2);
A.at(1) = 1;
... | #include <bits/stdc++.h>
#define LL long long
#define PII pair<int,int>
#define PIL pair<int,LL>
#define PLI pair<LL,int>
#define PIII pair<int,PII>
#define PLL pair<LL,LL>
#define PLII pair<LL,PII>
#define VI vector<int>
#define VVI vector<VI>
#define VL vector<LL>
#define VVL vector<VL>
#define VPII vector<PII>
#defi... |
#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<math.h>
using namespace std;
typedef long long int ll;
#define vec vector<int>
#define pb push_back
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freop... | #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 a, b, c, d;
cin >> a >> b >> c >> d;
cout << a * d - b * c << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.sync_with_stdio(false);
ll n,k;
cin>>n>>k;
ll cnt[n];
memset(cnt,0,sizeof(cnt));
ll i,j;
for(i=0;i<n;i++) {
ll x;
cin>>x;
cnt[x]+=1;
}
ll boxes[k];
memset(boxes,-1,sizeof(b... | #include<bits/stdc++.h>
#define N 300005
#define ll long long
#define rep(i, l, r) for(int i=l; i<=r; ++i)
#define per(i, r, l) for(int i=r; i>=l; --i)
using namespace std;
int n, k;
int a[N], c[N];
int main(){
scanf("%d%d", &n, &k);
rep(i, 1, n){
scanf("%d", &a[i]);
++c[a[i]];
}
c[0]=min(c[0], k);
int ans=c[0... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin>>s;
bool ok=true;
for ( int i=0; i<s.size(); i++ ) {
if ( isupper(s[i]) ) {
if ( i%2==0 ) ok=false;
} else {
if ( i%2 ) ok=false;
}
}
if ( ok ) cout<<"Yes\n";
els... | #include <bits/stdc++.h>
#define ios ios::sync_with_stdio(false), cin.tie(0);
#define et cout<<endl;
using namespace std;
typedef pair<int, int> PII;
typedef long long ll;
typedef unsigned long long ull;
inline int read()
{
int x=0,f=1;char ch=getchar();
while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
... |
#include <bits/stdc++.h>
using namespace std;
// rep
#define rep(i,n) for(decltype(n) i = 0; i < (n) ; ++i)
#define orep(i,n) for(decltype(n) i = 1; i <= (n); ++i) // one rep
#define drep(i,n) for(auto i = (n)-1; i >= static_cast<decltype(i)>(0); --i) // down rep
#define srep(i,s,t) for(auto i = (s); i < (t)... | #include <iostream>
using namespace std;
int main(void) {
int V, T, S, D;
cin >> V >> T >> S >> D;
if (D > V*S || T*V > D)
{
cout << "Yes";
}
else
{
cout << "No";
}
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.