code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll p[20] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71};
vector< ll > nums;
ll dp[(1 << 20) + 10][73];
bool can(int i, int msk, int &sub){
auto num = nums[i];
for(int i = 0 ; i < 20 ; i++){
... |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define db double
#define pint pair<int,int>
#define mk make_pair
#define pb push_back
#define eb emplace_back
#define ins insert
#define fi first
#define se second
#define Rep(x,y,z) for(int x=y;x<=z;x++)
#define Red(x,y,z) for(int x=y;x>=z;x--)
using... | #include <cstdio>
#include <cmath>
#include <iostream>
#include <set>
#include <algorithm>
#include <vector>
#include <map>
#include <cassert>
#include <string>
#include <cstring>
#include <queue>
using namespace std;
#define rep(i,a,b) for(int i = a; i < b; i++)
#define S(x) scanf("%d",&x)
#define S2(x,y) scanf("%d%... |
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
typedef unsigned long long int ull;
typedef long int li;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define test ll t; cin >> t; while(t--)
#define print_tc(t, c) cout << "Case #" << t << ": " << c << "\n"; ... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
const int mod=1e9+7,N=3e6+5;
vector<ll> fact(N);
inline ll exp(ll x, ll n, ll m = mod) {
ll r = 1;
while(n) {
if(n & 1) r = r * x % m;
x = x * x % m, n >>= 1;
}
return r;
}
ll ncr(int n,int r){
if(n<r || r<0 || n<0)
r... |
# include <algorithm>
# include <cstdio>
# include <cstring>
# include <vector>
using namespace std;
using LL = long long;
const int kMaxN = 2e5 + 21;
LL res = 0;
int n, m, k, flag;
vector<int> v[kMaxN];
int column[kMaxN], row[kMaxN], tr[kMaxN];
int LowBit(int x) { return x & -x; }
void Add(int x, int v) {
for (... | #include <cmath>
#include <cstdio>
#include <set>
#include <vector>
using namespace std;
int N, M;
vector<long> a;
vector<vector<int>> graph;
vector<bool> pass;
vector<int> record;
vector<bool> computedMax;
long min_ele = -999999999;
long res = min_ele;
long dfs(int x);
void init();
int main() {
#ifdef LOCAL
fre... |
#include<bits/stdc++.h>
using namespace std;
#define _ 0
const int maxn=1e6+5;
const int inf=0x3f3f3f3f;
const int mod=998244353;
int f[maxn],vis[maxn];
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
int n,ans=1;
ci... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
#define int long long
const int MOD=1e9+7;
template<typename T>
void fin(T a){
cout<<a<<endl;
exit(0);
}
int pw(int n,int k){
assert(k>=0);
int res=1;
while(k){
if(k&1)(res*=n)%=MOD;
... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int A, B, C;
cin >> A >> B >> C;
if( A == B )
{
if( C == 0 )
cout << "Aoki" << endl;
else
cout << "Takahashi" << endl;
}
else if( A > B )
cout << "Takahashi" << endl;
else
co... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define uint unsigned
#define pii pair<int,int>
#define pll pair<ll,ll>
#define IT iterator
#define PB push_back
#define fi first
#define se second
#define all(a) a.begin(),a.end()
#define mid ((r+l)>>1)
#define lson p<<1,l,mid
#define rson p<<1|1,mi... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define endl "\n"
#define print(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
const ll mod = 1e9 + 7;
// const ... | #include<bits/stdc++.h>
using namespace std;
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args&&... args) {
const ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repr(i, n) for (ll i = (n-1); i >= 0; i--)
#define Rep(n) for (ll _ = 0; _ < (ll)(n); _++)
template <class S>S sum(vector<S>& a) {return accumulate(all(a), S(... | #include <iostream>
#include <vector>
using namespace std;
int main(){
vector<int> a(4);
int sum = 0;
for(int i = 0; i < 4; i++){
cin >> a.at(i);
sum += a.at(i);
}
for(int bit = 0; bit < (1<<4); bit++){
int eat = 0;
for(int i = 0; i < 4; i++){
if(bit &... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll calc(vector<ll> v) {
ll count = 0;
for (int i = 1; i <= 9; i++) {
count += i * pow(10, v.at(i - 1));
}
return count;
}
int main() {
int K;
cin >> K;
//場のカードを管理
vector<ll> card(9, K);
string S, T;
vector<ll> taka(9, 0), ao(9... | #ifdef _DEBUG
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define all(v) v.begin(), v.end()
#define rep(i, begin, end) for(int i = begin; i < (int)(end); i++)
#define contains(v, x) (find(all(v), x) != v.end())
template<class T> bool chmin(T& a, T b){ if (a > b){ a = b;... |
#include <iostream>
#include <string>
#include <vector>
struct Query {
int T;
int A;
int B;
};
std::istream& operator>>(std::istream& is, Query& q) {
return std::cin >> q.T >> q.A >> q.B;
}
int main() {
int N;
std::cin >> N;
std::string S;
std::cin >> S;
int Q;
std::cin >> Q;
std::vector<Que... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,m,n) for(int i=m;i<n;i++)
using ll=long long;
int main(){
ll n;
string s;
cin>>n>>s;
ll q;
cin>>q;
string sub1=s.substr(0,n);
string sub2=s.substr(n,n);
//cout<<sub1<<" "<<sub2<<endl;
ll tcount=0;
rep(i,0,q){
ll t;
ll a;
ll... |
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int n,m;
int ans;
int a[500005];
int main()
{
cin>>n>>m;
for(int i=1;i<=m;i++)
cin>>a[i];
sort(a+1,a+m+1);
int k=1e9+7;
int lst=0;
a[++m]=n+1;
for(int i=1;i<=m;i++)
{
if(a[i]-lst-1!=0)
k=min(k,a[i]-lst-1);
l... | #include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define Pii pair<int,int>
#define Pll pair<long long,long long>
... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define hcf __gcd
#define test cout<<"hello";
#define pie 3.14159265358979323846
#define maxa(v) *(max_element(all(v))
#define mina(v) ... | #include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//#define ordered_set tree<int, null_type, less<int >,rb_tree_tag, tree_order_statistics_node_update>
//using namespace __gnu_pbds;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimiza... |
#include <iostream>
#include <string>
#include <algorithm>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int ans = 0;
rep(i, n)
rep(j, k)
ans += (100*(i + 1) + (j + 1));
cout << ans << endl;
} | #include <iostream>
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
cout << n * k * (n * 100 + k + 101) / 2 << "\n";
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
solve();
return 0;
}
|
#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
#define db double
#define el "\n"
#define ld long double
#define rep(i,n) for(int i=0;i<n;i++)
#define rev(i,n) for(int i=n;i>=0;i--)
#define r... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vll = vector<long long>;
using vb = vector<bool>;
using vd = vector<double>;
using vc = vector<char>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long>>;
using vvc = ... |
#include<bits/stdc++.h>
using namespace std;
int main(){
double a,b;
cin>>a>>b;
cout<<(1-b/a)*100;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(a) a.begin(),a.end()
using namespace std;
using ll=long long;
using P=pair<int,int>;
template<typename T>
using v=vector<T>;
template<typename T>
using vv=vector<v<T>>;
template<typename T>
using vvv=vector<vv<T>>;
int main(){
int n;... |
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 120;
int a[N][N];
int b[N];
int main()
{
int H,W,Minn=200;;
cin>>H>>W;
for(int i = 1;i<=H;++i){
for(int j = 1;j<=W;++j){
cin>>a[i][j];
if(a[i][j]<Minn) Minn = a[i][j];
}
}
int ans=0;
for(int i = 1;i<=H;++i){
for(int j = 1;j<=W;... | /*#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
*/
#include<bits/stdc++.h>
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 l... |
#include<bits/stdc++.h>
using namespace std;
int main(){
char ch1 = getchar();
char ch2 = getchar();
char ch3 = getchar();
if(ch1 == ch2 && ch2 == ch3)
puts("Won");
else
puts("Lost");
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
if(s[0]==s[1] && s[0]==s[2]){
cout << "Won" << endl;
}else{
cout << "Lost" << endl;
}
return(0);
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define PI acos(-1)
#define vi vector<int>
const int kMod = 1e9 + 7;
const int kInf = (~(1 << 31)) / 2 - 500;
const ll kInfL = (~(1LL << 63)) / 2 - 2000;
int main() {
int N, K;
cin >> N >> K;
vector<vector<int>> A(N, vector<int>(N));
for (int i... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
long long N, M; cin >> N >> M;
long long H[N], W[M];
for (int i = 0; i < N; i++) cin >> H[i];
for (int i = 0; i < M; i++) cin >> W[i];
long long dp[(N + 1) / 2][2];
for (int i = 0; i < (N + 1) / ... |
#include<bits/stdc++.h>
using namespace std;
long long int mod=1e9+7;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
map<long long int,long long int> mp1,mp2;
for(int i=0;i<n;i++)
{
int x;
cin>>x;
mp1[x]++;
}
long long int arr[n+1];
for(int i=1;i<=n;i++)
{
cin>... | #include<bits/stdc++.h>
using namespace std;
//#include <atcoder/modint>
//using namespace atcoder;
//using mint = modint998244353;
//using mint = modint1000000007;
#pragma region template
using ll = long long;
using PII = pair<int, int>;
using PLL = pair<ll, ll>;
template <class T> using V = vector<T>;
template <class... |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main(){
long double x,y,r; cin>>x>>y>>r; r = nextafter(r,INFINITY);
ll ans=0;
for(ll i=ceil(x-r);i<=floor(x+r);i++){
long double p = sqrt(pow(r,2) - pow(i-x,2));
ans += floor(y+p) - ceil(y-p) + 1;
}
cout << ans <... | #include <bits/stdc++.h>
#ifdef LILY
#include "./DebugOutput.h"
#else
#define dbg(...) (0)
#endif
using int32 = int;
using int64 = long long;
using namespace std;
class Solution
{
#define int int64
#define sfor(i, n) for (int i = 1; i <= n; ++i)
#define tfor(i, n) for (int i = 0; i < n; ++i)
int x, y, r, res = 0;... |
/*
بِسْمِ اللَّهِ الرَّحْمَٰنِ الرَّحِيمِ
لَا إِلَٰهَ إِلَّا ٱللَّٰهُ مُحَمَّدٌ رَسُولُ ٱللَّٰهِ
*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define sort(v) sort(v.begin(),v.end())
#define rev(v) reverse(v.begin(),v.end())
#define pb push_back
ll mod= 1000000007;
vector<ll>sv;... | #include<bits/stdc++.h>
using namespace std;
int n;
int f[100100],num[100100];
vector<int> qwq;
bool flag[100100];
void work1(){
for(int i=2;i<=n;i++){
if(flag[i]) continue;
qwq.push_back(i);
for(int j=i+i;j<=n;j+=i) flag[j]=1;
}
}
void work(int x){
for(int i=0;i<qwq.size();i++) {
if(x%qwq[i]==0){
num[x]... |
#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, m;
cin >> n >> m;
vector<pair<int, int>> cond(m);
for (auto &[a, b] : cond) cin >> a >> b;
int k;
cin >> k;
vector<pair<int, int>> choice(k);
fo... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... |
#include <bits/stdc++.h>
#define ll long long
#define maxi(a, b) (a > b ? a : b)
#define mini(a, b) (a < b ? a : b)
#define MOD 1000000007
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
//freopen("test_input.txt","r",stdin);
ll t = 1;
//cin >> ... | #include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#define ll long long
#define MAXN 200005
#define uns unsigned
#define MOD 998244353ll
#define INF 0x7f7f7f7f
using namespace std;
inline ll read(){
ll x=0;bool f=1;ch... |
//雪花飄飄北風嘯嘯
//天地一片蒼茫
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se seco... | #include <bits/stdc++.h>
//#include <atcoder/all>
#define rep(i, n) for (int i=0; i < (n); i++)
using namespace std;
//using namespace atcoder;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
const int INF = 1 << 30;
const ll LINF = 1LL << 61;
const int NIL = -... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long ;
ll a[4][3000006] ;
ll get(ll cnt , ll n) ;
int main() {
ios::sync_with_stdio(false) ;
cin.tie(0) ;
cin.tie(0) ;
ll n , k ;
cin >> n >> k ;
for(int i = 1 ; i <= n ; i++) a[1][i] = 1;
for(int i = 2 ;i <= 3 ; i++) {
... | #include <iostream>
#include <vector>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll=long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// union by size + path having
class UnionFind {
public:
vector <ll> par; // 各元の親を表す配列
vec... |
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <unordered_map>
#include <set>
#include <algorithm>
#include <utility>
#include <cmath>
using namespace std;
typedef long long llong;
typedef unsigned long long ullong;
// -2.1e-9 <= int <= 2.1e9
// -9... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define maxn 200010
const int MOD = 1000000007;
void solve() {
int n, m, t;
cin >> n >> m >> t;
int pre = 0, bat = n;
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
bat -= a - pre;
... |
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse4")
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); --i)
#define SZ(a) (int)((a).size())
#define ALL(a) a.begin(), a.end()
typedef long long LL;
typedef pai... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9+7;
//const long long MOD = 998244353;
const long long INF_LL = 1e18+11; const int INF_int = 1e9+11;
#define ll long long
#define mp std::make_pair
#define rep(i,n) for(int i = 0;i<n;i++)
#define lrep(i,n) for(long long i = 0;i<n;i++)
#define All(a)... |
#include<iostream>
#include<vector>
#include<cstdio>
using namespace std;
int main(void)
{
int N,D,H; cin>>N>>D>>H;
vector<double> d(N),h(N);
double max=0;
double buf;
for(int i=0;i<N;i++){cin>>d[i]>>h[i];}
for(int i=0;i<N;i++){
buf=(H-h[i])/(D-d[i]);
buf=(H+h[i])-buf*D-buf*d[i];
buf/=2.0;
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n , s , d;
cin >> n >> s >> d;
int a[n][2];
bool b=0;
for(int i = 0 ; i<n ; i++){
cin >> a[i][0]>> a[i][1];
if(a[i][0]<s && a[i][1]>d)
{
b=1;
}
}
if(b==1){
cout << "Yes";
return 0;
}
cout << "No";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vll = vector<vl>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
const ll INF = 1LL << 60;
const double pi =... | #include<bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define eps 1e-9
#define rep(i,l,r) for(int i=l;i<r;i++)
#define rrep(i,r,l) for(int i=r-1;i>=l;i--)
typedef long long ll;
const int maxn=2e5+5;
int n;
char t[maxn];
void solve()
{
if(n==1){
if(t[0]=='1') printf("20000000000\n");
else printf("1000... |
#include <bits/stdc++.h>
using namespace std;
#define int int64_t
#define double long double
#define all(v) (v).begin(),(v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vii vector<pii>
const int MOD=998244353;
const int INF=1e18;
void io(string s1="input.txt",string s2="output.t... | #include <bits/stdc++.h>
using namespace std;
int a, b, c, d, x, y;
int main(){
cin >> a >> b >> c >> d ;
x = max({a, b});
y = min({c, d}) ;
cout << x - y;
}
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int a,b,c;
cin>>a>>b>>c;
cout<<21-a-b-c<<endl;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <cmath>
using namespace std;
typedef long long ll;
int main() {
int a,b,c;cin>>a>>b>>c;
if(c%2==0){
if(fabs(a)> fabs(b)) cout<<">"<<endl;
else if(fabs(a)< fabs(b)) cout<<"<"<<endl;
else cout<<"="<<en... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long long LINF = 1LL << 60;
const long long LMINF = 1LL << 63;
const int INF = 1 << 30;
#define REP(i,n) for(int i = 0;i < n;++i)
#define REPS(i,x) for(int i = 1;i <= (int)(x);i++)
#define RREP(i,x) for(int i=((int)(x)-1);i >= 0;i--)
#define RR... |
#include <bits/stdc++.h>
using namespace std ;
#define int long long
int n, a[21] ;
int fun(int idx, int orr, int xr) {
if (idx > n) {
return (xr^orr) ;
}
int cur = fun(idx+1, orr|a[idx], xr) ;
cur = min(cur, fun(idx+1, a[idx], xr^orr)) ;
return cur ;
}
signed main() {
ios_... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=105;
const int mod=998244353;
int n,ans;
int w[maxn];
ll fac[maxn];
const int B=15000;
const int Q=40000;
int main() {
fac[0]=1ll;
for(ll i=1;i<=100;i++) fac[i]=fac[i-1]*i%mod;
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);... | /*
problem :
algorithm :
created : Programmer_juruo
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define N 2000005
#define M 2005
#define lowbit(x) x & (-x)
#define F1(i, n) for(int i = 1; i <= n; i++)
#define F(i, a, n) for(int i = a; i <= n; i++)
#define F0(i, n) for(int i = 0; i < n; i++)... |
#include <iostream>
using ll = long long;
int const nmax = 100000;
int const modulo = 1000000007;
std::pair<int,int> dp[5 + nmax][2];
int v[5 + nmax];
std::pair<int,int> add(std::pair<int,int> f1, std::pair<int, int> f2) {
return {(f1.first + f2.first) % modulo,
(f1.second + f2.second) % modulo};
}
std:... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define rng(i,l,r) for (int i=l; i<r; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define endl "\n"
#define INF 1000000007 // 1e9+7
#define LINF 1152921504606846976 // 1LL<<60
using namespace std;
using ll = long long;
usi... |
#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 n,m;
cin>>n>>m;
vector<int> v(n),w(m);
rep(i,n)cin>>v[i];
rep(i,m)cin>>w[i];
int j=0;
rep(i,n){
while(j<m&&w[j]<v[i]){
cout<<w[j]<<" ";
... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=(int)(x);i<(int)(y);i++)
#define print(A,x,n) rep(i,0,n){cout<<(i ? " ":"")<<A[i]x;}cout<<endl;
#define pprint(A,y,m,n) rep(j,0,m){print(A[j],y,n);}
const long mod=1e9+7;
const int siz=3e5;
const int inf=1e9;
int main(){
int N,M; cin>>N>>M;
int... |
#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 fast { ios :: sync_with_stdio(false); cin.tie(0); cout.tie(0); }
#define pb push_back
#define ll long long
#define v... | #include <cstdio>
#include <iostream>
using namespace std;
#define mod 1000000007
#define ll long long
#define maxn 1005
ll f[maxn], g[maxn];
int n;
char cAA, cAB, cBA, cBB;
int main() {
scanf( "%d", &n );
cin >> cAA >> cAB >> cBA >> cBB;
if( n == 2 ) return ! printf( "1\n" );
f[1] = 2, f[0] = g[0] = 1;
for( int ... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define inF freopen("input.txt", "r", stdin);
#define outF freopen("output.txt", "w", stdout);
#define endl '\n'
#define mm(arr) memset(ar... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
set<int> s;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
s.insert(x);
}
if (s.size() == n && *s.begin() == 1 && *s.rbeg... |
#pragma region head
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n,s,d,x,y;
cin>>n>>s>>d;
for(int i=0;i<n;i++)
{
cin>>x>>y;
if(d<y && s>x)
{
cout<<"Yes";
return 0;
}
}
cout<<"No";
return 0;
} |
/*
LANG:C++
PROB:
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iostream>
// #define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
namespace IO{
inline char ch(){
static char s[1<<16],*S,*T;
return (S == T)&&(T = (S = s)+
fread(s,1,1<<16,stdin),S == T)?EOF:*S++;
}
template<typename T> void read(T &x){
x = 0; int f(1); char c = ch();
for(;!isdigit(c);c = ... |
/*-------------必要なときに使うもの------------------*/
//#define _GLIBCXX_DEBUG
/*#include<atcoder/modint>
#include<atcoder/math>
using namespace atcoder;
using mint=modint1000000007;
using MINT=modint998244353;*/
/*#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-l... | // #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex... |
#include <bits/stdc++.h>
#define rep(i, l, r) for (int i = (l); i < (r); i++)
#define max(p, q) ((p) > (q) ? (p) : (q))
#define min(p, q) ((p) < (q) ? (p) : (q))
#define ALL(a) (a).begin(), (a).end()
#define INF ((1LL << 62) - (1LL << 31))
#define MOD 1000000007
using namespace std;
using ll = long long;
using ld = lon... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
sort(a.begin(), a.end());
ll prefix_sum = 0, ans = 0;
for (int i = 0; i < n; ++i) {
ans +=... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a... | #include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); i++)
#define R(i, j, k) for(int i = (j); i >= (k); i--)
#define ll long long
#define sz(a) ((int) a.size())
#define vi vector<int>
using namespace std;
const int N = 2e5 + 7;
int n, a[N], b[N], r1[N], r2[N];
ll sum;
int main() {
ios::sync_with_stdio... |
#include <bits/stdc++.h>
using namespace std;
#define nl '\n'
#define debug(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T(&t)[N]) { return N; } template<typename T> int SIZE(const T& t) { return t.size(); } string to_string(const str... | #include<bits/stdc++.h>
#define int long long
using namespace std;
int get() {
int x = 0, f = 1; char c = getchar();
while(!isdigit(c)) { if(c == '-') f = -1; c = getchar(); }
while(isdigit(c)) { x = x * 10 + c - '0'; c = getchar(); }
return x * f;
}
const int N = 2e5 + 5;
int n, m, q, a[N], b[N], ans, len, bin[N... |
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
const int maxn = 1000010, inf = 1e9 + 233;
struct edge{int too, pre;}e[maxn << 1];
int n, m, tot;
int last[maxn];
char s[maxn];
bool vis[maxn];
inline void add(int x, int y) {e[++tot] = (edge){y, last[... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#includ... |
#include<iostream>
#include<vector>
#include<algorithm>
#include<chrono>
using namespace std;
int main()
{
int pre_score;
for (int i = 0; i < 1000; i++) {
int si,sj,ti,tj;
cin >> si >> sj >> ti >> tj;
string ans="";
if (si-ti<0) {
for (int j = 0; j < ti-si; j++) ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define pi 3.14159265359
#define all(i) i.begin(),i.end()
using namespace std;
const long long INF=1e9+7;
const string alp="abcdefghijklmnopqrstuvwxyz"; //26
const string ALP="ABCDEFG... |
#include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#include <bits/stdc++.h>
using namespace std;
#define lson 2*i
#define rson 2*i+1
#d... | #include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((... |
#include<bits/stdc++.h>
using namespace std;
int main () {
int n;
string s;
cin>>s;
int f=0;
for (int i=0;i<s.size();i++) {
if (i%2==0&&s[i]>='a'&&s[i]<='z') continue;
if (i%2==1&&s[i]>='A'&&s[i]<='Z') continue;
f=1;
}
if (f)
printf("No\n");
else
printf("Yes\n");
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int L;
cin>>L;
long long ans =1;
for(int i=1;i<=11;i++){
ans*=L-i;
ans/=i;
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
return (ull)rng() % B;
}
int n,m;
string s[15];
int sz;
bool not_front[10];
ll res=0;
vector<int> VV;
void cal(){
vect... | //#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
#define rep2(x,fr,to) for(int x=(fr);x<(to);x++)
#define rep(x,to) for(int x=0;x<(to);x++)
#define repr(x,fr,to) for(int x=(fr);x>=(to);x--)
#define all(c) c.begin(),c.end()
#define sz(v) (int)v.size()
typedef long long ll; typedef vector<int> ... |
#include <iostream>
#include <vector>
using namespace std;
#define int long long
signed main(){
int N; cin >> N;
vector<int> W(N);
int S = 0;
for (int i=0; i<N; i++){
cin >> W[i];
S += W[i];
}
if (S % 2 != 0){
cout << 0;
}
else{
int s_ = S/2; int n_ = N/2;
vector<vector<int>> states;
for (int i=... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define rng(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); --i)
#define per(i, b) gnr(i, 0, b)
#define all(obj) begin(obj), end(obj)
#define allr(ob... |
#include <bits/stdc++.h>
#define ALL(x) (x).begin(),(x).end()
#define PB push_back
#define MP make_pair
#define Mod 998244353
#define MOD 1000000007
using namespace std;
using lint = long long;
using vi = vector<lint>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<lint, lint>;
lint modpow(lint a, ... | #include <iostream>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <deque>
#include <algorithm>
#include <cmath>
#include <string>
#include <numeric>
#include <float.h>
using namespace std;
using ll = long long;
#define canDbg 0
#define dbg(x) if(canDbg) cout << x << endl;
#define rep(n,... |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define fi first
#define se second
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define pb push_back
template<class T,class U>
inline bool chmax(T &a,U b){
if(a<b){
a=b;
return true;
}
return false;
}... | #include <bits/stdc++.h>
using namespace std;
const int kmax = 1003;
struct Node {
int x, y;
} q[kmax * kmax];
struct O {
int to;
char c;
} o[kmax];
int ans = 1e9;
bool l[kmax][kmax];
int n, m, d[kmax][kmax], h = 1, t;
vector<O> p[kmax];
char c;
void E(int x, int y, int z) {
if (d[x][y]) {
return;
}... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< "... | #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>>;
#define FOR(i,a,n) for(int i=(a);i<(n);++i)
#define eFOR(i,a,n) for(int i=(a);i<=(n... |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i = (a); i <= (b); i++)
#define rng(a) a.begin(), a.end()
#define ina(n,a) cin >> n; for(int i = 1; i <= n; i++) cin >> a[i]
#define sz(x) (int)(x).size()
#define se second
#define fi first
#define prev coyhhhhhhyoc
#define next sdNNNmNNNNNNNmd... | //
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
typedef long long ll;
typedef long double ld;
const ll mod = 1e9 + 7;
int main ()
{
ios_base::sync_with_stdio (0); cin.tie (0); cout.tie (0);
ll n, m, q;
cin >> n >> m >> q;
pair<ll, ll> a[n], b[m];
for (auto& x : a)... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forin(in) for(ll i=0; i<(ll)in.size(); i++) cin>>in[i]
#define forout(out) for(ll i=0; i<(ll)out.size(); i++) cout<<out[i]<<" "
#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... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
int main(){
double r,x,y;
ll hosu = 0;
cin >> r >> x >> y;
if(sqrt(x * x + y * y) / r < 1){
hosu = 2;
}
else{
hosu = ceil(sqrt(x * x + y * y) / r);
}
cout << hosu;
} |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <utility>
#include <tuple>
#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{... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef const int ci;
typedef vector<int> vi;
typedef pair<ll, ll> pll;
#define INF (2e12)
#define fori(i, s, e) for(int i = s; i < ((int)e); ++i)
#define forj(i, s, e) for(int i = s; i >= ((int)e); --i)
#define all(s) (s).begin(), (s).end()
#define ... |
#include<bits/stdc++.h>
using namespace std;
namespace mymtx{
const int dim = 3;
template<class T> array<array<T,dim>,dim> mult(array<array<T,dim>,dim> a, array<array<T,dim>,dim> b){
array<array<T,dim>,dim> ret{};
for(int i=0;i<dim;i++) for(int j=0;j<dim;j++) for(int k=0;k<dim;k++)
ret[i][j] += a[i][... | //yukicoder@cpp14
//coder:luckYrat(twitter:@luckYrat_)
//競技プログラミングから逃げるな
//https://www.youtube.com/watch?v=z_B9iJ8r4ic
//せんげん！
#include <iostream>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <bit... |
#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"
using namespace std;
#define int long long
#define eb emplace_back
#define mp make_pair
typedef pair<int,int> pii;
#define f first
#define s second
#define min(a,b) ((a<b)?a:b)
//const int mod=1000000007;
bool debug=0;
vector<int> adjl[200005];
int dis[200005],prevv[200005];
pii fur;
void f... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
ll t;
cin >> n >> t;
ll a[n];
for (int i = 0; i < n; i++) cin >> a[i];
vector<ll> sum1, sum2;
ll sum;
for (ll bit = ((ll)1 << (n / 2)) - 1; bit >= 0; bit--) {
sum = 0;
for (int i = 0; bit >> i; i++) {
... | #include "bits/stdc++.h"
using namespace std;
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim... |
//#include <bits/stdc++.h>
#include <queue>
#include <iostream>
#include <iomanip>
#include <math.h>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <string>
#define F(i, a, b) for(register int i = a, i##end = b; i <= i##end; i++)
#define UF(i, a, b) for(register int i = a, i##end = ... | //#include<bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <queue>
#include <deque>
#include <bitset>
#include <iterator>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <functional>
#include <numeric>
#include <utility>
#in... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,c,d,ans;
cin>>a>>b>>c>>d;
ans = max(a-c, max(a-d, max(b-c, b-d)));
cout<<ans;
return 0;
} | #include<bits/stdc++.h>
#define int long long
#define REP(i,a,n) for(int i=a;i<(n);i++)
#define REP_sz(i,s) for(int i=0;i<s.size();i++)
#define gcd(a,b) __gcd(a,b)
#define RE return
#define FILL(a,b) memset(a,b,sizeof(a))
#define SO(a) sort(all(a))
#define all(a) a.begin(),a.end()
#define pb push_back
#define sz(a) a.s... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF=1e8;
int n,m,res=0,cnt=0,tot=0;
int b[300005];
ll pp[300005],qq[300005];
int h[300005],to[600005],ver[600005];
inline int read() {
register int x=0,f=1;register char s=getchar();
while(s>'9'||s<'0') {if(s=='-') f=-1;s=getchar();}
while(s... | #include<bits/stdc++.h>
#define Re register
using namespace std;
const int N=10,M=100005;
struct Node {
int L,V;
bool operator <(const Node& b) const {
return L==b.L ? V<b.V : L<b.L;
}
bool operator <(const int& b) const {
return V<b;
}
}b[M];
int n,m;
int Max;
int c[N];
int p[N];
int f[N];
int Maxx[M];
int... |
#include <bits/stdc++.h>
using namespace std;
#define INF 1111111111111111
typedef long long ll;
struct gogo
{
ll to,nt,st;
};
ll n,m,x,y,a,b,t,k,d[101010];
vector<gogo> vec[101010];
void bfs()
{
queue<ll>que;
que.push(x);
while(!que.empty())
{
int from=que.front();
que.pop();
... | #include "bits/stdc++.h"
using namespace std;
typedef long long li;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
const li n = 4;
vector<li> xs(n);
for (int i = 0; i < n; ++i) {
cin >> xs[i];
}
const li sum = accumulate(xs.begin(), xs.end(), 0LL);
bool ok = false;
... |
#include <iostream>
using namespace std;
int main() {
int v, t, s, d; cin >> v >> t >> s >> d;
cout << (d <= (s * v) && d >= (t * v) ? "No" : "Yes") << '\n';
cin.ignore(2); return 0;
} | //Code Written by Pinaki Bhattacharjee
#include<bits/stdc++.h>
using namespace std;
// typedef
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
// #define
#define LOCAL
#define INF 1e18
#define MAX 10000
#define PI 2*acos(0.0)
#define endl "\n"
#define pb push_b... |
#include<bits/stdc++.h>
using namespace std;
void __print(int x) {cout << x;}void __print(long x) {cout << x;}void __print(long long x) {cout << x;}void __print(unsigned x) {cout << x;}void __print(unsigned long x) {cout << x;}void __print(unsigned long long x) {cout << x;}void __print(float x) {cout << x;}void __print... | //#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx2,tune=native")
#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(), (v).end()
#define sz(a) ((long long)(a).size())
#define X first
#define Y second
using ll = long long;
using ull = unsigned long long;
using dbl = long doubl... |
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int n,m,num[105][105],ans=0;
char s[105][105];
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
{
scanf("%s",s[i]);
for(int j=1;j<=m;j++)
{
if(s[i][j-1]=='#')continue;
if(i>1&&s[i][j-1]==... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x)... |
#include "bits/stdc++.h"
using namespace std;
long long ncr(long long a,long long b)
{
long long m=1;
for(int i=a;i>b;i--)
{
m*=i;
m/=a-i+1;
}
return m;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
long long a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, m = 0, n =... | #include <iostream>
#include <string>
constexpr int MAX = 30;
long long dp[MAX + 1][MAX + 1];
std::string find_kth(int A, int B, long long K) {
if (A == 0) {
return std::string(B, 'b');
}
if (B == 0) {
return std::string(A, 'a');
}
if (K <= dp[A - 1][B]) {
return std::string(... |
#include <bits/stdc++.h>
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC target("fpmath=387") //extra precision
#define debug_inp... | #include <bits/stdc++.h>
#define rep(i, l, r) for (int i = (l); i < (r); i++)
using namespace std;
typedef long long ll;
map<vector<int>, ll> mp;
ll MOD = 1e9 + 7;
ll mod_pow(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) res = res * x % mod;
x = x * x % mod;
n >>= 1;
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 998244353;
using graph = vector<vector<int>>;
bool can_reach(const graph &g, const int s, const int t, vector<bool> &visited){
if(s==t)return true;
if(!visited[s]){
visited[s] = true;
for(const auto u: g[s]){... | #define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#defi... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,a,n) for(ll i=a;i<n;i++)
#define rev(i,n,a) for(ll i=n-1;i>=a;i--)
#define f first
#define s second
#define vll vector<ll>
#define vvll vector<vector<ll>>
#define vpii vector<pair<int,int>>
#define vpll vector<pll>
#define pll pair<ll,ll>
... | #include<bits/stdc++.h>
using namespace std;
#define fi(a,b) for(int i=a;i<b;i++)
#define fj(a,b) for(int j=a;j<b;j++)
#define ff first
#define ss second
#define ll long long
#define ld long double
#define ull unsigned long long
#define bp(x) __builtin_popcount(x)
#define pr(x) for(auto it: x) cout<<... |
// E - Throne
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// 拡張ユークリッド互除法
// (g,x,y): ax+by=g
tuple<ll,ll,ll> extgcd(int a, int b){
if(b==0) return {a, 1, 0};
auto[g, x, y] = extgcd(b, a%b);
return {g, y, x-a/b*y};
}
int solve(int n, int s, int k){
auto[g, x, y] = extgcd(k, n);
if(s%g) ret... | #include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
#include<map>
#include<cassert>
using namespace std;
#define ll long long
#define reps(i, a, b) for(int i = a; i < b; i++)
#define rreps(i, a, b) for(int i = a-1; i >= b; i--)
#def... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
... | //BY: YASH JAIN, CF: BitSane
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
#define May_the_fork_be_with_... |
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define ... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
using namespace std;
const int N = 2e5 + 5, mod = 998244353;
int fact[N], inv[N];
vector<int> primes[N];
int mul(int a, int b){
return 1ll * a * b % mod;
}
int add(int a, int b){
return (a + b) % mod;
}
int fp(int b, int p){
if(!p) r... |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
int p[102][2];
int q[102][2];
int main(){
int n,m;
cin>>n>>m;
for(int i=1;i<=m;i++){
cin>>p[i][0]>>p[i][1];
}
int k;
cin>>k;
for(int i=0;i<k;i++){
cin>>q[i][0]>>q[i][1];
}
int ans = 0;
for(... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<int> a(n), b(n);
int ans = INT_MAX;
for(int i = 0; i < n; i++){
cin >> a[i] >> b[i];
}
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
if(i == j) ans = min(ans, a[i] + b[j]);
else ans = min(ans, ma... |
#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<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define int long long int
#define endl "\n"
#define ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
// 1-indexed
const int N = 1000010;
ve... |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define rep(i, n) for(int i=0;i<(int)(n);i++)
#define rep2(i, j, n) for(int i=j;i<(int)(n);i++)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<int, int>;
map<int, ll> table;
int main(){
int N;
cin >> N;
ll C;
cin ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2e5+5,M=2e4+5,inf=0x3f3f3f3f,mod=1e9+7;
#define mst(a,b) memset(a,b,sizeof a)
#define PII pair<int,int>
#define fi first
#define se second
#define pb push_back
#define lx x<<1
#define rx x<<1|1
map<int,ll>mp;
int main(){
int n,C;
scanf("%d... |
#include <bits/stdc++.h>
using namespace std;
#define ar array
#define ll long long
#define For(i,k,n) for(int i=k;i<n;i++)
#define Forll(i,k,n) for(long long int i=k;i<n;i++)
#define Forull(i,k,n) for(long long int i=k;i<n;i++)
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
void solve(){
int a,b,c;
cin>>a>>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define mii map <int, int>
#define mll map <ll, ll>
#define pii pair <int, int>
#define pll pair <ll, ll>
#define vi vector <int>
#define vd vector <double>
#define vll vector <ll>
#define fi first
#define se second
#define si set ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define sz(v) v.size()
#define INF 10000000000000000 //10^16
template <typename T>
bool chmax(T &a, const T& b... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using LL = long long;
using P = pair<int,int>;
const long double INF = 2e12;
const long double eps = 1e-12;
int N, M, K;
vector<int> A;
long double solve(long double ans){
vector<long double> dp(N + 1), sum(N + 1);
rep... |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pint = pair<int,int>;
const int D = 100000;
int main()
{
int N; cin >> N;
vector<int> a(N);
vector<vector<bool>> dp(N + 1, vector<bool>(D + 1, false));
dp[0][0] = true;
for(auto &i : a) cin >> i;
for(int i = 0; i < N; i++) {
for(int j =... | #include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define pii pair<int,int>
#define fastIO ios_bas... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> P(M);
for (int i = 0; i < M; i++) cin >> P.at(i).first >> P.at(i).second;
sort(P.begin(), P.end());
set<int> S;
S.insert(N);
int l = 0;
while (l < M) {
vector<int> A, B;
int r = l;
w... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(long long i=0; i<n; i++)
#define pii pair<long long,long long>
#define vi vector<long long>
#define vii vector<pii>
#define ll long long
long long par[200001],sizeT[200001],sizeP[200001],sizeX[200001],N,M;
void Initialize(){
for(long long i=1; i<=N... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(c) (c).begin(), (c).end()
void solve() {
int N;
cin >> N;
vector <pair <int, int> > time(N);
for (auto &el : time) cin >> el.first >> el.second;
int ans = INT_MAX;
for (int i = 0; i < N; i++) {
ans = m... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a=100000;
int b=100000;
int aa=0;
int N=0;
int ans=0;
cin>>N;
vector<int>A(N),B(N);
for(int i=0; i<N; i++){
cin>>A.at(i)>>B.at(i);
}
for(int i=0; i<N; i++){
if(A.at(i)<a){
a=A.at(i);
aa=i;
}
}
for(int j=0; j<N;... |
#pragma GCC optimize("O2")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MXN = 3e3 + 10;
ll H, W, Par[MXN], Sz[MXN];
vector<ll> R[MXN], C[MXN];
string s[MXN];
ll f1, f2, f3;
ll Find(ll x){
return (x == Par[x] ? x : Par[x] = Find(Par[x]));
}
bool Union(ll u, ll v){
u = Find(u), v =... | #include<bits/stdc++.h>
using namespace std;
vector<string> unique(vector<string> vec){ //あんまり値渡しは良くない気がするけど一回ならいいか。
//12文字ならKMPとかするまでもないね。
sort(vec.begin(),vec.end(),[](auto const& l,auto const& r){
if(l.size()==r.size())return l>r;
return l.size()>r.size();
});//文字列長い順にsort
vector<pair... |
#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
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) <<... | //#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using db = double;
using ld = long double;
template <typename T> usin... |
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
#include <cctype>
#include <bitset>
#include <cmath>
#include <queue>
#include <list>
#include <map>
#include <set>
#include <unordered_map>
using namespace std;
typedef long long ll;
int n;
int gcd(int a,int b){
return b=... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for( int i=0; i<(n); i++)
int main(){
ll n; cin >> n;
map<ll, ll> mp;
for(int i = 0; i < n; i++){
int a; cin >> a;
mp[a] += 1;
}
ll res = 0;
auto begin = mp.begin(), end = mp.end();
for(au... |
#pragma GCC optimize(2)
#include <bits/stdc++.h>
#define INF 1000000000
#define LINF 1000000000000000000
#define MOD 1000000007
#define INF63 1061109567
#define INF127 9187201950435737471
#define UINF 18446744073709551615
#define F first
#define S second
#define ll long long
using namespace std;
ll mod;
ll ksm(ll x,ll ... | #include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 4000000000000000000 //オーバーフローに注意
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
ll mod_pow(ll x,ll count, ll mod){
if(count == 0)return 1;
ll ret = mod_pow((x*x)%m... |
#include <bits/stdc++.h>
#define rep(i,N) for(int i=0; i<(N); i++)
using namespace std;
int main() {
string s;
cin >> s;
cout << s.at(1) << s.at(2) << s.at(0) <<endl;
} | #include <bits/stdc++.h>
const long long INF = 1e9;
const long long MOD = 1e9 + 7;
//const long long MOD = 998244353;
const long long LINF = 1e18;
using namespace std;
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Yes" : "No" ) << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIB... |
#include<bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; i++)
#define repo(i, n) for(int i=1; i<=n; i++)
#define ssort(a) sort(a.begin(), a.end())
#define INF 1001001001
#define INFll 10010010010010010
// debug用
#define PrintVec(x) for (auto elementPrintVec: x) { cout << elementPrintVec << " "; } cout << endl;
usin... | #define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
using namespace std;
const int N = 1e8 + 10;
typedef long long ll;
int main(){
int t,n,m;
cin>>n>>m;
int ans1=0,ans2=0;
while(n){
ans1+=n%10;
n/=10;
}
while(m){
ans2+=m%10;
m/=10;
}
cout<<max(ans1,ans2)<<endl;
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
/*
find my code templates at https://github.com/galencolin/cp-templates
also maybe subscribe please thanks
*/
#define send {ios_base::sync_with_stdio(false);}
#define help {cin.tie(NULL);}
#define f first
#define s second
#define getunique(v) {sort(v.begin(), v.end())... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
int main() {
string s, t;
int n;
cin >> n;
cin >> s >> t;
vector<int> szero;
vector<int>... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define mod 1000000007
int main() {
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif
ios_... | #include <bits/stdc++.h>
using namespace std;
#define io ios_base::sync_with_stdio(false); cin.tie(nullptr);
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b... |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> ans(n);
for (int i = 1; i <= n; i++) {
multiset<int> st;
int now = i;
for (int j = 2; j * j <= n; j++) {
while (now % j == 0) {
st.insert(j);
... | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define DEBUG
#ifdef DEBUG
inline void debug_print() { cerr << endl; }
template <typename T1, typename... T2> void debug_print(const T1 a, const T2 &... b) { cerr << a << ' '; debu... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll dp[65][3];
ll n;
vector<ll>v;
void ctdp()
{
dp[0][0]=1;
dp[0][1]=1;
for(ll i=1;i<=n;i++){
if(v[i-1]==0){
dp[i][0]=dp[i-1][0];
dp[i][1]=dp[i-1][0]+(2*dp[i-1][1]);
}else{
dp[i][0]=(2*dp[i... | #include <bits/stdc++.h>
using namespace std;
const int N=4e5+2;
int stk[N],top;
int n,m,p,e,a[N],b[N];
int main()
{
scanf("%d",&n);
m=n<<1;
for(int i=1;i<=m;++i)
{
scanf("%d",&a[i]);
b[i]=a[i];
}
sort(b+1,b+m+1);
for(int i=1;i<=m;++i)
if(a[i]<b[n])++p;
else if(a[i]>b[n])++e;
for(int i=1;i<=m;++i)
{
... |
// Problem: C. The Sports Festival
// Contest: Codeforces - Codeforces Round #715 (Div. 2)
// URL: https://codeforces.com/contest/1509/problem/C
// Memory Limit: 256 MB
// Time Limit: 1000 ms
//
// Powered by CP Editor (https://cpeditor.org)
/*
authored by
aden_frost
on 07-03-2021
Go Corona Corona Go... | #include<stdio.h>
#define reg register
#define ri reg int
#define rep(i, x, y) for(ri i = x; i <= y; ++i)
#define nrep(i, x, y) for(ri i = x; i >= y; --i)
#define DEBUG 1
#define ll long long
#define il inline
#define swap(a, b) ((a) ^= (b) ^= (a) ^= (b))
#define max(i, j) (i) > (j) ? (i) : (j)
#define min(i, j) (i) < ... |
#include<bits/stdc++.h>
#define lint long long int
#define rep(i,n) for(int i=0;i<int(n);i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define arep(i,a,n) for(int i=a;i<n;i++)
#define sort(a) sort(a.begin(),a.end())
#define reverse(a) reverse(a.begin(),a.end())
#define fill(a,x) fill(a.begin(),a.end(),x)
#define eb(dat... | #include<bits/stdc++.h>
#define int long long
#define N 200010
using namespace std;
int n,m;
int a[N];
vector<int> v[N];
int dp[N],ans[N],res=-1e18;
signed main(){
scanf("%lld%lld",&n,&m);
for(int i=1;i<=n;i++)
scanf("%lld",&a[i]);
for(int i=1;i<=m;i++){
int x,y;
scanf("%lld%lld",&x,&y);
v[x].push_back(y);
... |
#include <bits/stdc++.h>
using namespace std;
// template {{{
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define range(i, l, r) for (i64 i = (i64)(l); i < (i64)(r); (i) += 1)
#define rrange(i, l, r) for (i64 i = (i64)(r) - 1; i >= (i64)(l); (i) -= 1)
#define w... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll S, P; cin >> S >> P;
for (ll i = 1; i * i <= P; i++) {
if (P % i) continue;
if (i + P / i == S) {
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} |
#include <iostream>
using namespace std;
int main()
{
int a,b,c,result;
cin>>a >>b>>c;
if((a*a)+(b*b) < (c*c))
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
} | #include<iostream>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<vector>
#include<map>
#include<stdio.h>
#include<set>
#include<queue>
#include<stack>
#include<cstring>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <sstream>
//#include<bits/stdc++.h>
#define FILE_NAME "... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define get(a) ll a ; cin >> a ;
#define show(a) cout << a << endl;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
double a, b, w;
cin >> a >> b >> w;
int lower = int(ceil(1000*w/b)) ;
int upper = int(floor(1000*w/a));
... | #include <iostream>
using namespace std;
int A, B;
double W;
int isin(double N) {
if(N >= A and N <= B) {
return true;
} else {
return false;
}
}
int main() {
cin >> A >> B >> W;
int max = 0;
int min = 0;
for (int i = 1; i <= W * 1000; i++) {
double pre = W * 1000 ... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using tii = ... | #include <iostream>
#include <cmath>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll = long long;
int in(){
double x;
cin >> x;
x*=10000;
return round(x);
}
bool ok(ll dx,ll dy,ll z){
return dx*dx+dy*dy <= z*z;
}
ll f(ll x,ll y,ll z,ll lim){
int l=0,r=1;
ll res = 0;
for(int i=1e... |
// 状压表示点的集合
// 每次尝试加入一个点，看能不能构成一个完全图
// 若能，则这个点集的完全图数为1
// 否则采用环形DP的方法求最小完全图数
// 太菜了，写不出来QAQ
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#define INF 0x3f3f3f3f
using namespace std;
const int maxn = 18;
int n, m;
int grap[maxn + 1][maxn + 1];
int f[1 << maxn], good[1 << maxn];
int ma... | #include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using PP = std::pair<ll,P>;
#define REP(i,b,e) for(int i=b; i<e; i++)
#define PRINT(vec) {printf("[ ");for(auto &i:vec)printf("%ld ",i);puts("]");}
#define fi first
#define se second
const int MOD = 1e9+7;
int dx[] = {0, 1, 0, -1, 1, 1, -1, ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr long long MOD = 1e9 + 7;
/*
実行時MODint :
template <int& MOD = 1000000007>
static ... | #include<bits/stdc++.h>
#include <iterator>
#include <iostream>
#include <numeric>
#include <math.h>
#define ll long long
#define ull long
#define mpa make_pair
#define pb push_back
#define ff first
#define pii pair<ll,ll>
#define dd double
#define trace(x) cerr << #x << " : " << x << endl
#define ss second
#define boo... |
#include <algorithm>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <thread>
#include <tuple>
#include <type_traits>
#include <vector>
#define rep(i, n) for (i... | //Bismillah Hir Rehmanir Rahim
//Allah knows best
using namespace std;
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include<bits/stdc++.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime... |
#include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
typedef long long ll;
#define test ll t;cin>>t;while(t--)
#define f first
#define s second
#define pb push_back
#define pop pop_back
#define int long long int
#define all(x) x.begin(), x.e... | #include<bits/stdc++.h>
using namespace std;
int main(void)
{
int a,b;
cin>>a>>b;
if(b%a==0) cout<<"Yes\n";
else cout<<"No\n";
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.