code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
//wtrl,everybody hangbeat me
#pragma GCC optimize(3)
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctim... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007;
constexpr long long INF = 1000000000 + 100;
constexpr long long LINF = 1000000000000000000 + 100;
constexpr double EPS = 1e-9;
#define all(v) v.beg... |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
using ll = long long;
int main()
{
string N;
cin >> N;
int k = N.length();
vector<int> v(10, 0);
REP(i, k)
{
v.at(N.at(i) - '0')++;
}
vector<... | #include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358979323
#define ll long long int
#define vi vector <int>
#define vl vector <ll>
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define ff first
#define ss second
#define MOD 1000000007
const ll mod = 1e9 + 7;
ll power(ll a, ll b) { //a^b
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//イテレーション
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define FORA(i,I) for(const auto& i:I)
//x:コンテナ
#define ALL(x) x.begin... | #line 1 "main.cpp"
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
void solve() {
int n, s, d;
cin >> n >> s >> d;
while (n--) {
int x, y;
cin >> x >> y;
if (x < s && y > d) {
cout << "Yes\n";
return;
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<ll> x(n);
for (int i = 0; i < n; ++i) {
cin >> x[i];
}
vector<ll> p { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47 };
int m = p.size();
l... | /*Practice.Practice.Practice.
Created: SAADxENCIPHERER*/
#include <bits/stdc++.h>
using namespace std;
#define fast_io ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define int long long
#define pb push_back
#define VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c)... |
#include<bits/stdc++.h>
#define IONAME "cttf"
typedef long long ll;
int n;
std::set<std::string> x,y;
std::string ss[222000];
void marota(){
std::cin>>n;
for (int i=1;i<=n;i++){
std::string s;
std::cin>>s;
ss[i]=s;
if (ss[i][0]=='!') ss[i]=ss[i].substr(1,(int)ss[i].size()-1);
... | ///OM
///SUVOM SHAHA
///AUST CSE 39
#include<bits/stdc++.h>
#define loo(i, n) for(int i = 0; i < n; i++)
#define modo 1000000007
#define pb push_back
#define ff first
#define sc second
#define ii pair<int, int>
#define vi vector<int>
#define vii vector<ii>
#define ll long long int
#define inf 1000000000
#define mpch m... |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define countSetBits(x) __builtin_popcountll(x)
#define trailz(x) __builtinctzll(x)
#define leadz(x) __builtinclzll(x)
#define endl '\n'
#define integer int
#define int ... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define REP(i, start, end) for (ll i = start, i##Len = (end); i < i##Len; ++i)
#define REPR(i, start, end) for (ll i = start, i##Len = (end); i > i##Len; --i)
using ll = long long;
using namespace std;
int main()
{
cin.tie(nullptr);
ios::sync_with_stdio(false)... |
#include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#define ll long long
void fillPrefixSum(int arr[], int n, int prefixSum[]) // a[i-1,j-1] = a[j-1] - a[i-2];
{
prefixSum[0] = arr[0];
// Adding present element
// with previous... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
//using Graph = vector<... |
#include <bits/stdc++.h>
using namespace std;
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) { }
void init(int n) { par.assign(n, -1); }
int root(int x) {
if (par[x] < 0) return x;
else return par[x] = root(par[x]);
}
bool issame(int x, int y) {... | #include<bits/stdc++.h>
#define pb push_back
#define pdd pair<ld, ld>
#define int long long
#define ff first
#define pii pair<int,int>
#define ss second
#define pp make_pair
#define rep(i,n) for((i)=0;(i)<(int)(n);(i)++)
#define PI 3.1415926535
#define mst(v, x) memset(v, x, sizeof v);
#define all(v) v.begin(), v.end(... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
const int N = 1e5 + 10;
const ll mod = 1e9 + 7;
ll a, b, c;
ll fast_pow(ll p, ll q, ll MOD) {
ll ans = 1;
while (q) {
if (q & 1) {
ans = ans * p % MOD;
}
p = p * p % MOD;
... | #include <bits/stdc++.h>
using namespace std;
int64_t power(int64_t base, int64_t exponent, int64_t mod) {
base %= mod;
int64_t result = base ? 1 : 0;
while (exponent) {
if (exponent & 1) {
result *= base;
result %= mod;
}
base *= base;
base %= mod;
exponent >>= 1;
}
return res... |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
#define rep(i, n) for(int i=0;i<n;i++)
#define all(i, v) for(auto& i : v)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double pi = 3.141592653589793;
typedef unsigned long long ull;
typedef long double ldouble;
const ll INF = 1e18;
#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 ALL(v) (v).be... |
#include<bits/stdc++.h>
using namespace std;
const int MaxN=2e5;
const int MaxQ=3e5;
char ss[MaxN+1<<1];
int main(){
int N, Q, T, A, B;
scanf("%d\n%s\n%d\n",&N,ss,&Q);
int base=0;
int L=N<<1; //L=2*N;
while(Q-->0){
scanf("%d %d %d",&T,&A,&B);
if(T==2){
base^=N;
}else{// T==1
A=(A-1+base)%L;
... | #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
const int MOD=1000000007;
const int INF=0x3f3f3f3f;
const ll INFL=0x3f3f3f3f3f3f3f3f;
class UnionFind {
vector<int>par, sz;
vector<int>ed;
public:
UnionFind() {}
UnionFind(int n) {
... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type , less<ll> , rb_tree_tag , tree_order_statistics_Node_update>
#define ll long long
#define ull unsigned long long
#define pb... | #include<bits/stdc++.h>
using namespace std;
int main(){
double res;
double x1,y1,x2,y2;
cin>>x1>>y1>>x2>>y2;
printf("%.10f",(y1*x2+x1*y2)/(y1+y2));
return 0;}
|
// Problem: A - Maxi-Buying
// Contest: AtCoder - AtCoder Beginner Contest 206（Sponsored by Panasonic）
// URL: https://atcoder.jp/contests/abc206/tasks/abc206_a
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
/*input
*/
#include <algorithm>
#include <bitset>
#include ... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#incl... |
#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;
}
constexpr ll mod=998244353;
ll mod_pow(ll a,ll b){
a%=mod;
if(b==0)return 1;
if(b=... | #include<iostream>
#include <vector>
#include <algorithm>
#include <utility>
#define NO_MOD 998244353
using namespace std;
using ll = long long;
using ll = long long;
struct matrix{
long long a,b,c,d;
matrix operator*(matrix);
matrix(ll,ll,ll,ll);
};
template<ll MOD= 1000000007>
struct modint{
ll value... |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>
#include<queue>
#include<vector>
#include<set>
#include<map>
using std::cin;using std::cerr;
using std::max;using std::min;
#define N 10
#define M 100005
#define inf 1e9
#define ll long long
#def... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main(){
ios::sync_with_stdio(0),cin.tie(0);
int n,m,ans=1e18,mx=0;
cin >> n >> m;
int w[n],p[n];
for(int i=0;i<n;i++){
cin >> w[i];
p[i]=i;
mx=max(mx,w[i]);
}
pair <int,int> v[m];
for(int i=0;i<m;... |
/****Bismillahir rahmanir rahim****/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
#define All(a) a.begin(),a.end()
template <typename T>
void get_vect... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define Erep(i,n) for(int i = 0; i <= (n); ++i)
#define repS(i,s,n) for(int i = s; i < (n); ++i)
#define ErepS(i,s,n) for(int i = s; i <= (n); ++i)
#define Sort(a) sort(a.begin(), a.end())
#de... |
#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;
#define ordered_set tree<ll, null_type, less<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define ittr(x,v) for(auto x=v.begin();x!=v.end();x++)
#define itpr(... | /* header file */
#include <bits/stdc++.h>
/* config */
namespace config {
__attribute__((constructor)) void _setup_ () noexcept {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout << std::fixed << std::setprecision(10);
}
} // namespace setup
/* iostream */
template<class Tp> std::istream &operator... |
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include<stdio.h>
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<string.h>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define NDEBUG
#define eprintf(...) do {} while (0)
#endif
#include<cassert>
using ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using VI = vector<int>;
using VL = vector<ll>;
using VVI = vector<VI>;
using VVL = vector<VL>;
using VS = vector<string>;
using VC = vector<char>;
using Q = queue<int>;
using P = pair<int, int>;
using llP = pair<ll, ll>;
#define pb push_back
#defi... |
/* dotp.cpp
*
*
*/
//#include "dotp.h"
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <list>
#include <deque>
#include <cmath>
using namespace std;
int main()
{
int n ;
cin >> n ;
vector<int> x(n, 0), y(n, 0) ;
for(int i = 0; i < n; i++) cin >> x[i] ;
... | // Best practice
#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define pf emplace_front
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define pii pair<int,int>
#define psi pair<string,int>
#define vi vector<int>
#define vp... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <cstdint>
#include <numeric>
#define INF 1000000000
#define LLINF 2000000000000000
#define MOD 1000000007
using namespace std;
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define LOOP(i,N) fo... | #include<bits/stdc++.h>
using namespace std;
template <typename T>
inline void read(T &x){
x=0;char ch=getchar();bool f=false;
while(!isdigit(ch)){if(ch=='-'){f=true;}ch=getchar();}
while(isdigit(ch)){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
x=f?-x:x;
return ;
}
template <typename T>
inline void write(T x){
if(x<0)... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dbl;
typedef float flt;
#define for0(i, n) for(ll i=0; i<n; i++)
#define for1(i, n) for(ll i=1; i<=n; i++)
#define forab(i, a, b) for(ll i=a; i<=b; i++)
#define clr0(a) memset(a, 0, sizeof(a))
ll Subseq... | #define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
#include<t... |
#include<bits/stdc++.h>
using namespace std;
#define make_it_fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define mp make_pair
#define pb push_back
#define pob pop_back
#define all(x) (x).begin(),(x).end()
#define ll long long
#define ld long double
#define endl "\n"
#define ff first
#define ss ... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <cassert>
using namespace std;
vector<int> opos(const string& s) {
int n = s.length();
vector<int> ps;
for (int i = 0; i < n; ++i) {
if (s[i] == '1') ps.push_back(i);
}
return ps;
}
void s... |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <iomanip>
#include <functional>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <map>
#include <set>
#include <unordered_set>
using namespace std;
typedef long long ll;
#define rep(i,n) f... | #include<bits/stdc++.h>
#define ff first
#define ss second
#define ll long long
#define pb push_back
using namespace std;
const int maxn=2e5+10;
const int mb=60;
vector<pair<int,ll> >vect[maxn];
ll dp[maxn][mb][2],rez,mod=1e9+7;
void go(int x,int prv){
for(int i=0;i<vect[x].size();i++){
int id=vect[x][i... |
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define rep2(i, s, n) for(long long i=(s);i<(long long)(n);i++)
#define repi(i, n) for(int i=0;i<(int)(n);i++)
#define rep2... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int sz = 2e5+5;
ll int arr[sz]={0},arr1[sz]={0},arr2[sz]={0}, id[sz];
char arrc[205][205];
int arrtd[205][205] = {0};
bool visited[50000],visited1[50000];
int prime[10005]= {0};
vector <ll int> vec,vec1,vec2,vecc[sz];
vector<pair<ll int, ll int>> ... |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include<cmath>
using namespace std;
int main(void){
vector<double> start(2);
vector<double> goal(2);
double ans;
cin >> start[0];
cin >> start[1];
cin >> goal[0];
cin >> goal[1];
ans = start[0] + (goal[0] - start[0])*start... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i = (int)(n) - 1 ; i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (int)(b); i++)
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
using namespace std;
using ll = long long;
const ll MOD = 1000000... |
#include <bits/stdc++.h>
using namespace std;
const int M=1e9+7;
int n;
double fi, x, man, euc, che;
int main() {
cin >> n;
while (n--) {
cin >> x;
fi=abs(x);
man+=fi;
euc+=fi*fi;
che=max(che, fi);
}
cout << fixed << setprecision(10) << man << endl << sqrt(euc) << endl << che;
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define all(a) a.begin(), a.end()
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<ll,int> pli;
typedef pair<int,int> pii;
#define rep(i,a,b) for(ll i=a ; i<b ; i++)
#define qrep(que, ite)... |
#include <bits/stdc++.h>
#define clog(x) std::clog << (#x) << " is " << (x) << '\n';
using LL = long long;
const int N = 2002;
struct Edge {
int to;
LL c, d;
Edge(int x, LL y, LL z) : to(x), c(y), d(z) {}
};
const LL INF = 1e18;
int main() {
//freopen("in", "r", stdin);
std::cin.tie(nullptr)->sync_with_stdio(fals... | #include<bits/stdc++.h>
#include<algorithm>
#include<cmath>
#include<climits>
using namespace std;
typedef long long int lli;
typedef vector<int> vi;
typedef vector<long long int> vlli;
typedef pair<int,int> pii;
typedef pair<long long int,long long int> plli;
typedef vector< vi > vvi ;
typedef vector< vlli > vvlli ;
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i, a, b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
int main() {
int K;
string N;
cin... | #include <iostream>
using namespace std;
int main(){
long long n;
int k;
cin >> n >> k;
for(int i=0; i<k; i++){
if(n%200==0){
n /= 200;
}else{
n = n*1000 + 200;
}
}
cout << n << endl;
} |
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep1(i, n) for(int i = 1; i <= (int)(n); i++)
#define INF 1000000000000 //10^12:∞
#define MOD 1000000007
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class... | #include<algorithm>
#include<array>
#include<bitset>
#include<cassert>
#include<climits>
#include<cmath>
#include<cstring>
#include<deque>
#include<functional>
#include<iostream>
#include<iomanip>
#include<map>
#include<numeric>
#include<optional>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int nax=2e5+100;
vector<int> g[nax];
int cnt,res,n,k,md;
int dfs(int s,int pp)
{
int p=0;
for(auto it:g[s])
if(it^pp)
{
int q=dfs(it,s);
if(q<p)
swap(p,q);
if(p<=0 and q>0 and q-p<=md)
p=q;
... | #include<bits/stdc++.h>
#define fgx cerr<<"-----------------------"<<endl
#define LL long long
#define DB double
#define pb push_back
using namespace std;
inline int read(){
int nm=0,fh=1; char c=getchar();
for(;!isdigit(c);c=getchar()) if(c=='-') fh=-1;
for(;isdigit(c);c=getchar()) nm=nm*10+c-'0';
return nm*fh;
}
... |
#include<iostream>
#include<cmath>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
using namespace std;
#define function function2
#define int long long int
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
int k=0;
cin>>n;
int temp=n;
vector<int> vec;
wh... | #include<bits/stdc++.h>
#define endl '\n'
using ll = long long;
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
int n = s.length();
int sum = 0;
int ones = 0, twos = 0;
for(char c : s) {
int d = c-'0';
sum += d;
if(d % 3 == 1) ones++;
i... |
#include <bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define fo(i,a,b) for(int i = a; i<b ; i++)
#define FIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define pb push_back
#define M 1000000007
int mod(int x){
return ((x%M + M)%M);
}
int add(int a,int b){
return mod(mod(a)+mod(b)... |
#include <bits/stdc++.h>
#include <ext/numeric>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
template<class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_up... | #pragma GCC target ("avx2")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("O3")
#include "bits/stdc++.h"
#include <unordered_set>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
constexpr ll MOD = 1'000'000'007LL; /*998'244'353LL;*/
#de... |
#include<bits/stdc++.h>
using namespace std;
long long t,n;
long long read()
{
long long num=0;bool flag=1;
char c=getchar();
for(;c<'0'||c>'9';c=getchar())
if(c=='-')flag=0;
for(;c>='0'&&c<='9';c=getchar())
num=(num<<1)+(num<<3)+c-'0';
return flag?num:-num;
}
int main(){
t=read();
whi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef complex<double> point;
#define endl '\n'
#define F first
#define S second
#define dbg(x) cerr<<#x<<" = "<<x<<endl
#define dbg2(x,y) cerr<<#x<<" = "<<x<<", "<<#y<<" = "<<y<<endl
#define dbg3(x,y,z) cerr<<#x<<" = "... |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll h,w;
cin>>h>>w;
vector<vector<ll>> a(h,vector<ll>(w));
for(ll i=0;i<h;i++){
for(ll j=0;j<w;j++){
char u;
cin>>u;
if(u=='-') a.at(i).at(j)=-1;
else a.at(i).at(j)=1;
}
}
vector<vector<ll>> ... | #include <bits/stdc++.h>
using namespace std;
int n,m,a[1005],b[1005],dp[1005][1005];
int main() {
memset(dp,0x3f,sizeof(dp));
dp[0][0]=0;
cin>>n>>m;
for (int i=0; i<n; ++i) cin>>a[i];
for (int i=0; i<m; ++i) cin>>b[i];
a[n]=-1,b[m]=-2;
for (int i=0; i<=n; ++i)
for (int j=0; j<=m; ++j) {
dp[i+1][j]=min(dp[... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,n;
cin>>a>>b>>n;
n*=1000;
a=n/a;
if(n%b==0)
b=n/b;
else
b=n/b+1;
if(a<b)
cout<<"UNSATISFIABLE"<<endl;
else
cout<<b<<" "<<a<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin >> a >> b >> c;
if(c){
if(a >= b){
cout << "Takahashi";
}
else
cout << "Aoki";
}
else{
if(b >= a)
cout << "Aoki";
else
cout << "Takahashi"... |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <iomanip>
typedef long long ll;
using namespace std;
const int maxn = 2e5 + 79;
vector<vector<int> > g(maxn);
vector<int> d(maxn, 0), p(maxn, -1);
void dfs(int u, int pr... | #include <bits/stdc++.h>
#define rep(i, l, r) for (register int i = l; i <= r; i++)
#define per(i, r, l) for (register int i = r; i >= l; i--)
#define srep(i, l, r) for (register int i = l; i < r; i++)
#define sper(i, r, l) for (register int i = r; i > l; i--)
#define erep(i, x) for (register int i = h[x]; i; i = e[i].... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool ll_sqrt(ll x, ll& lower_bound, ll& upper_bound)
{
constexpr ll ll_max = numeric_limits<ll>::max();
bool first_boost = true;
lower_bound = 0;
upper_bound = x;
while (upper_bound - lower_bound > 1)
{
if (first_boost)
{
ll guess = ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x... |
//I still luv you Kashish <3
#include <bits/stdc++.h>
using namespace std ;
#define int long long
#define pb push_back
#define F first
#define S second
#define P push
#defin... | #include <iostream>
using namespace std;
bool chek[200001];
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int ret = 0, temp;
for (int i = 0; i < n; i++) {
cin >> temp;
chek[temp] = true;
while (chek[ret])ret++;
if (i) cout << "\n";
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,a,b) for(int i = (a); i < (b); i++)
#define per(i,a,b) for(int i = (a); i > (b); i--)
#define repl(i,a,b) for(ll i = (a); i < (b); i++)
#define perl(i,a,b) for(ll i = (a); i > (b); i--)
const ll MOD = 1000000007... | #include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;
struct UnionFind {
UnionFind(int n) : p(n, -1) {}
int root(int u) {
return p[u] < 0 ? u : p[u] = root(p[u]);
}
int size(i... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... |
#include <bits/stdc++.h>
using namespace std;
const long long mod1 = 1000000007;
using ll = long long;
using pq = priority_queue<ll>;
vector<int> dx = {0,1,0,-1};
vector<int> dy = {-1,0,1,0};
long long pow(long long x,long long n){
long long ans = 1;
while(n != 0){
long long a = x;
long long z ... | #include <bits/stdc++.h>
#define INF 1e9
#define INFLL 1ull<<60u
using namespace std;
#define REPR(i,n) for(int i=(n); i >= 0; --i)
#define FOR(i, m, n) for(int i = (m); i < (n); ++i)
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define ALL(a) (a).begin(),(a).end()
#define endl "\n"
template<class T>b... |
#define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#i... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(i... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
const int MAX_N = (int)(2e2 + 5);
int n;
int a[MAX_N];
int dp[MAX_N][200];
vector<vector<int>> candidates;
int get_valid_modulo() {
if (dp[n][0] >= 3) return 0;
for (int i =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
#define sz(a) int((a).size())
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(... |
//CODE YOUR WAY ;) -->>
//template owner shivyyy_21
#include<bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long int
const ll MOD=1e9+7;
#define Loopi for(ll i=0;i<n;i++)
#define Loopj for(ll j=0;j<m;j++)
#define LoopLR(l,r) for(ll i=l;i<=r;i++)
#define pb push_back
#define Umap unordered_... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define ALL(x) (x).begin(),(x).end()
template<class T>bool umax(... |
#include <iostream>
#include <vector>
#include <iomanip>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <functional>
using ll = long long;
using vll = std::vector<ll>;
using namespace std;
#define REP(i, x, n) for(int i = x; i < (n); i++)
#define rep(i, n) REP(i, 0, n)
int main() {
... | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <algorithm>
#include <vector>
#include <queue>
#include <cctype>
#include <cmath>
#include <cstring>
#include <stack>
#include <tuple>
#include <numeric>
#include <iomanip>
#include <assert.h>
#include <bits/stdc++.h>
#define forn(i, n) for(int i = 0; ... |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n,s,d;
int main(void){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n >> s >> d;
bool ans = false;
for(int i=0;i<n;i++){
int x,y;
cin >> x >> y;
if(x<s&&y>d) ans ... | #include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define N 110
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n,s,d,flag=0;
int x,y;
cin >> n >> s >> d;
RE... |
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
// #pragma optimization_level 3
// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
/... | #pragma GCC optimize ("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i=(a); i<(b); i++)
#define FORD(i, a, b) for (int i=(a); i>(b); i--)
#define PPC(x) __builtin_popcount(x)
#define MSB(x) (63 - __builtin_clzll(x))
#define SZ(x) ((int)(x).size())
#define HASK(S, x) (S.find(x)... |
#include<bits/stdc++.h>
using namespace std;
//to insert pair use eb or { }
#define int int64_t
typedef pair<int,int> pii;
const int X=1e9+7;
const int inf=1e18;
#define lld int
#define pqu priority_queue
#define eb emplace_back
#define mp make_pair
#define fi first
#define se... | #include<bits/stdc++.h>
using namespace std;
int main(){
long long s,p;
cin>>s>>p;
int ans=0;
for(int i=1;i<=sqrt(p);i++)if(p%i==0 && i+p/i==s)ans=1;
cout<<(ans ? "Yes" : "No")<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define gcd __gcd
#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 pb(x) push_back(x)
#define ALL(x) x.begin(), x.end()
#define RALL(x) x.rbegin(), x.rend()
#define sz(x) ((int)x.size())
#... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
void prepare(){
}
void solve(){
int n;cin>>n;
int a[n];
for(int i=0;i<n;i++)cin>>a[i];
sort(a,a+n);
int y=a[n/2],ans=0;
for(int i=0;i<n;i++)ans+=(y+2*a[i]-min(2*y,2*a[i]));
cout<<setprecision... |
#include<bits/stdc++.h>
using namespace std;
int main()
{
double a;
cin>>a;
if((int)a%100==0) cout<<100<<endl;
if((int)a%100!=0) cout<<(ceil((double)a/100)*100)-a<<endl;
}
| #include<iostream>
#include<algorithm>
#include<math.h>
#include<cstring>
#include<queue>
#include<vector>
#include<map>
#include<set>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int x[40];
long long int y[40];
long long int m3= 0, m5 = 0;
x[0] = 1; y[0] = 1;
long long int i;
for (i... |
#include <bits/stdc++.h>
#define maxn 1003
using namespace std;
int n,m;
int a[maxn];
int b[maxn];
int dp[maxn][maxn];
int main() {
scanf("%d%d",&n,&m);
for( int i = 1 ; i <= n ; i++ )
scanf("%d",&a[i]);
for( int j = 1 ; j <= m ; j++ )
scanf("%d",&b[j]);
for( int i = 0 ; i <= n ; i++ )
for( int j = 0 ; j <=... | #include<bits/stdc++.h>
using namespace std;
namespace Sakurajima_Mai{
#define ms(a) memset(a,0,sizeof(a))
#define repi(i,a,b) for(int i=a,bbb=b;i<=bbb;++i)//attention reg int or reg ll ?
#define repd(i,a,b) for(int i=a,bbb=b;i>=bbb;--i)
#define reps(s) for(int i=head[s],v=e[i].to;i;i=e[i].nxt,v=e[i].to)
#define... |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n, m = 0, c = -1, x;
double e = 0.0;
cin >> n;
for(int i = 0; i < n; i++){
cin >> x;
x = abs(x);
m += x;
c = max(c, x);
e += (double)x * x;
}
printf("%lld\n%.15f\n%lld\n", m, sqrt(e), c);
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... |
/* AUTHOR: julianferres */
#include <bits/stdc++.h>
using namespace std;
// neal Debugger
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_cont... | #include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <map>
#include <vector>
#include <cmath>
#include <iomanip>
#include <set>
using namespace std;
void c_neq_min2(void) {
int n;
cin >> n;
vector<int>ans;
int p;
int min_val = 0;
vector<bool>p_map(200001, false);
for (int i = ... |
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
int h,w;
cin >> h >> w;
vector<string> s(h);
for(int i=0;i<h;i++){
cin >> s.at(i);
}
int count=0;
for(int i=0;i<h;i++){
for(int j=0;j<w-1;j++){
if(s.at(i).at(j) == '.' && s.a... | #include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <nume... |
#include<bits/stdc++.h>
using namespace std;
#define INF 1e9
#define MOD 1000000007
#define foru(i,a,b) for(int i=(a); i<(b); i++)
#define forue(i,a,b) for(int i=(a); i<=(b); i++)
#define forb(i,n) for(int i=n-1; i>=0; i--)
#define forall(it,v) for(auto it=v.begin();it!=v.end();++it)
#define pb push_back
#define fst fi... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
long long n,m;
cin >> n >> m;
vector<long long> a(m+2);
for (long long i = 0; i < m; i++){
cin >> a[i];
}
a[m] = 0;
a[m+1] = n+1;
sort(a.begin(),a.end());
long long k = 1000000000;
vector<long long> whit... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define pb push_back
typedef long long ll;
typedef long double ld;
const ll INF = 9223372036854775807;
const ll MOD = 1000000007;
const long double PI = acos(-1);
#define mp make_pair
#define all(v) v.begin(), v.end()
#define F first
#... | #include <bits/stdc++.h>
typedef long long int ll;
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define mset(arr) memset(arr, 0, sizeof(arr))
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define mod 1000000007
using namespace std;
ll powrmod(ll a, ll b, ll m)
{
... |
#include <stdio.h>
#include <string.h>
int main() {
char x[203];
scanf("%s", x);
char *dot_pos = strchr(x, '.');
if (dot_pos) *dot_pos = '\0';
puts(x);
return 0;
}
| #include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
using namespace std;
const long double PI = (acos(-1));
const long long MOD = pow(10, 9) + 7;
bool DEBUG = false;
// long long MOD(long long
int main()
{
string S, T = {};
cin >> S;
for (int i = 0; i < ... |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pop_b pop_back
#define pf push_front
#define pop_f pop_front
#define mt make_tuple
#define eb emplace_back
#define sf(x) sizeof(x)
#define len(x) x.length()
... | #include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
using ll=long long;
using Graph=vector<vector<int>>;
#define MAX 1000000
#define MOD 1000000007
#define INF 1000000000000000000
vector<map<int,int>> m;
vector<int> parent;
int find(int x){
int y=parent[x];
if(y!=paren... |
#ifdef LOCAL
//#define _GLIBCXX_DEBUG
#endif
//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> PP;
#define MOD 1000000007
//#define MOD 998244353
#define INF 2305843009213693951
//#define INF 810114514
#define PI 3.141592653589
#define setdouble setprecision
#define REP(i,n) for(ll i=0;i<(n);++i)
#define OREP(i,n) for(ll i=1;... |
#include<bits/stdc++.h>
#define rep(i, n) for(long long i = 0; i < n; ++i)
#define rrep(i, n) for(long long i = n-1; i >= 0; --i)
#define fi first
#define se second
using namespace std;
using ll = long long;
using ui = unsigned int;
using ul = unsigned long long;
using ld = long double;
using v1i = vector<int>;
using v... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
ll merge(vector<int>&arr1,vector<int>&arr2,int s,int e)
{
int mid=(s+e)/2;
ll cnt=0;
int i=s,j=mid+1,k=s;
while(i<=mid && j<=e){
if(arr1[i]>arr1[j]){
cnt+=(mid-i+1);
arr2[k++]=arr1[j++];
}
else{
arr2[k++]=arr1[i++];... |
#include<iostream>
#include<vector>
#include<cstring>
#include<map>
#include<bitset>
#include<assert.h>
#include<algorithm>
#include<iomanip>
#include<cmath>
#include<set>
#include<queue>
#include<sstream>
#include<unordered_map>
#include<unordered_set>
#include<chrono>
#include<stack>
#include<deque>
#include<random>
... | #include<bits/stdc++.h>
using namespace std;
void read(int &x) {
x=0;int f=1;char ch=getchar();
for(;!isdigit(ch);ch=getchar()) if(ch=='-') f=-f;
for(;isdigit(ch);ch=getchar()) x=x*10+ch-'0';x*=f;
}
void print(int x) {
if(x<0) putchar('-'),x=-x;
if(!x) return ;print(x/10),putchar(x%10+48);
}
void ... |
#include<iostream>
#include<vector>
using namespace std;
int win(int a,int b){
if((b-a+3)%3==2)return b;
else return a;
}
int main(){
int n,k,size;
string s,u;
vector<int> v[102];
cin>>n>>k>>s;
for(int i=0;i<n;i++){
if(s[i]=='R')v[0].push_back(0);
else if(s[i]=='S')v[0].push_back(1);
else if(s[i]=='P')v[0]... | #include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
vector<int> a(4);
... |
/* _
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
... | #include <bits/stdc++.h>
#define debug(var) do{std::cout << #var << " :";std::cout << std::endl;view(var);}while(0)
template<typename T> void view(T e){ std::cout << e << std::endl;}
template<typename T> void view(const std::vector<T>& v){ int c = v.size(); std::cout << "{"; for(const auto& e : v){ std::cout << e; if... |
#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
bool ok(long long N, std::string &S, std::vector<long long> &A, int m) {
rep (i, m) {
vector<ll> tmp(N+1);
rep(j, N+1) {
... | #define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#i... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=(0);i<(n);i++)
using namespace std;
typedef long long ll;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
ll chk(ll x){
ll cnt = 0;
... | #include<bits/stdc++.h>
using namespace std;
#define lli long long int
#define endl "\n"
#define pb push_back
void input()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
}
const long long mod=1e18;
void solve()
{
lli n;
... |
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#inc... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
int main()
{
int n,k,m;
cin >> n >> k >> m;
ll sum = 0;
rep(i,n-1){
int t;
cin >> t;
sum += t;
}
int est = n*m - sum;
... |
#include <iostream>
#include <cmath>
long long n;
int main() {
std::ios::sync_with_stdio(false), std::cin.tie(nullptr);
std::cin >> n;
std::cout << n - (long long)std::ceil((std::sqrt((n + 1) * 8 + 9) - 3) / 2) + 1 << '\n';
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
int l=s.size();
if(s[0]=='.')cout<<0<<endl;
else{
for(int i=0;i<l;i++)
{
if(s[i]=='.')break;
else
{
cout<<s[i];
}
}
cout<<endl;
}
}
|
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstring>
#include <cctype>
#include <cmath>
#include <vector>
#include <set>
#include <bitset>
#include <map>
#include <stack>
#include <queue>
#include <ctime>
#include <cassert>
#define _for(i,... | #include<bits/stdc++.h>
#define st first
#define nd second
#define pb(x) push_back(x)
#define pp(x) pop_back(x)
#define mp(a, b) make_pair(a, b)
#define all(x) (x).begin(), (x).end()
#define rev(x) reverse(all(x))
#define sor(x) sort(all(x))
#define sz(x) (int)(x).size()
#define rsz(x) resize(x)
using namespace std;
... |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i < (n);i++)
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
int main() {
int t;
cin >> t;
while(t--) {
int n;
cin >> n;
string s1, s2, s3;
cin >> s1 >> s2 >> s3;
rep(i, n) cout << '1';
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
int min = 0;
set<int> numSet;
for (int num : p) {
numSet.insert(num);
while(numSet.count(min)) {
min++;
}
cout << min << endl;
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
cout << max(x, 0) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main()
{
long long n;
cin >> n;
set< long long > ans;
for(long long i=1;i*i<=n;i++){
if(n%i == 0){
ans.insert(i);
ans.insert(n/i);
}
}
for(auto x : ans ) cout << x << endl;
return 0;
}
|
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define rep(i, n) for (int i=0; i<n; i++)
#define pb push_back
#define int long long
typedef pair<int, int> P;
int N;
int A[10010];
signed main() {
//ループ変数が被っていないか?
//制約を確認しているか?
//変数のtypoがないか?
cin.tie(0)... | #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;
int main(){
long long n;
cin >> n;
string c;
cin >> c;
int a[n+1];
for(int i=0;i<n;i++){
if(c[i] == 'R'){
a[i] = 0;
}
if(c[i] == 'B'){
a[i] = 1;
}
if(c[i] == 'W'){
a[i] = 2;
}
}
int ord3[n+1];
or... | #include <bits/stdc++.h>
#define int int
#define maxn 800005
#define mod 3
using namespace std;
int n;
char r[maxn];
char get_char(){
char ch = getchar();
while(ch != 'W' && ch != 'B' && ch != 'R') ch = getchar();
return ch;
}
int jc[maxn], inv[maxn];
int qpow(int a, int b, int p){
if(b == 0) retu... |
/*
Another source code by:
_ _ _ _ _ _____ _
| \ | (_) | (_) / ____| | |
| \| |_| |_ _ _ __ | | __ _ __ | |_
| . ` | | __| | '_ \| | |_ | '_ \| __|
| |\ | | |_| | | | | |__| | |_) | |_
|_| \_|_|\__|_|_| |_|\_____| .__/ \__|
| |
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fastio ios_base::sync_with_stdio(0);cin.tie(0)
#define fp(i,a,b) for(ll i=a ; i<b ; i++)
#define fn(i,a,b) for(int i=a ; i>=b ; i--)
#define ones(x) __built... |
#include<iostream>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<cmath>
#include<map>
using namespace std;
#define rep(i,N) for(ll i=0;i<N;i++) //0から
typedef long long ll;
ll binary_search(vector<ll> a, ll n, ll key){
ll right = n, left = -1;
ll md = (right + left) / 2;
while(righ... | #include <bits/stdc++.h>
using namespace std;
int main(){
long int n;
cin >> n;
set<long int> l;
for(long int i=1; i*i<=n; i++){
if(n%i == 0){
l.insert(i);
l.insert(n/i);
}
}
for(auto x : l) cout << x << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int mod = 1e9+7;
#define vi vector<int>
#define pb push_back
#define ff first
#define ss second
#define pi pair<int,int>
#define all(v) (v).begin(),(v).end()
#define mk(arr,n,type) type *arr=new type[n];
#define rrep(i, n) for(int i=n-1;i>=0;i--)
#def... | #include<iostream>
#include<algorithm>
#include<cmath>
#include<string>
#include<set>
#include<vector>
using namespace std;
int main(){
int64_t n;
int64_t k;
cin >> n;
cin >> k;
vector<pair<int64_t, int64_t> > ab(n);
int64_t a;
int64_t b;
for(int64_t i=0; i<n; i++){
cin >> a;
... |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
typedef long int li;
typedef long long int lli;
typedef vector<int> vi;
typedef vector<long long int> vlli;
typedef vector<double> vd;
typedef vector<char> vc;
typedef vector<vector<int>> vvi;
typedef vector<vector<double>> vv... | #include <bits/stdc++.h>
#define mod 1000000007
#define point complex<long double>
#define pi acos(-1)
typedef long long ll;
typedef long double ld;
using namespace std;
void Fastio()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
bool runTestCase() {
int n; cin >> n;
ll res = 0;
for (int i = 0; i < n;... |
//𝓒𝓸𝓭𝓮 𝓦𝓻𝓲𝓽𝓽𝓮𝓷 𝓫𝔂 𝓟𝓲𝓷𝓪𝓴𝓲 𝓑𝓱𝓪𝓽𝓽𝓪𝓬𝓱𝓪𝓻𝓳𝓮𝓮
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
#define LOCAL
#define MAX 10000
#define PI 2*acos(0.0)
#define pb push_back
#define all(x) (x).be... | #include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int A,B,C,D;cin>>A>>B>>C>>D;
cout<<min({A,B,C,D})<<endl;
} |
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <stack>
#include <cassert>
#include <map>
#include <numeric>
#include <cstring>
#include <set>
#include <ctime>
#include <queue>
#include <cmath>
#include <iomanip>
#include <iterator>
#include <bitset>
#include <unordered_map>
#incl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fr(i, a, b) for (int i=a; i<(b); i++)
#define FOR(i, a) for (int i=0; i<(a); i++)
#define bck(i,a,b) for (int i = (b)-1; i >= a; i--)
#define BACK(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a,x) for (auto... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
int N,L;
vector<int> A(1e5+10), B(1e5+10), C, high(1e5+10), low(1e5+10);
main() {
cin >> N >> L;
C.push_back(0);
for (int i = 1; i <= N; i++) {
cin >> A[i];
C.push_back(A[i]-i);
}
C.push_back(L-N);
int ... | #pragma GCC target ("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>
#define owo(i,a, b) for(int i=(a);i<(b); ++i)
#define uwu(i,a, b) for(int i=(a)-1; i>=(b); --i)
#define senpai push_back
#define ttgl pair<int, int>
#define ayaya cout<<"ayaya~"<<endl
using namespace... |
#include <bits/stdc++.h>
using namespace std;
typedef int64_t i64;
typedef long long ll;
typedef long double ld;
typedef unsigned long long Ull;
#define endl "\n"
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
void read(int &sum) {sum = 0; char c = getchar( ); bool f = 0; w... | // かります！ごめんなさい!
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
//---------------------------------... |
// Problem: F - Shift and Inversions
// Contest: AtCoder - AtCoder Beginner Contest 190
// URL: https://atcoder.jp/contests/abc190/tasks/abc190_f
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#defi... | #pragma GCC optimize("Ofast")
//#pragma GCC target ("sse4")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#i... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define p_ary(ary,a,b) do { cout << "["; for (int count = (a);count < (b);++count) cout << ary[count] << ((b)-1 == count ? "" : ", "); cout << "]\n"; } while(0)
#define p_map(map,it) do {cout << "{";for (auto (it) = map.begin(... | #include "bits/stdc++.h"
#define int long long
#define endl '\n'
using namespace std;
typedef long long ll;
typedef long double ld;
#define db(x) cerr << #x << ": " << x << '\n';
#define read(a) int a; cin >> a;
#define reads(s) string s; cin >> s;
#define readb(a, b) int a, b; cin >> a >> b;
#define readc(a, b, c) i... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <utility>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#include <limits>
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
using namespace std;
template<clas... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vint = vector<int>;
using vvint = vector<vint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vchar = vector<char>;
using vvchar = vector<vchar>;
using vp = vector<P>;
using vpp = vector<pair<P, P>>;
using vvp ... |
#include <bits/stdc++.h>
using namespace std;
#define int int64_t
#define rep(i, a, b) for(int i = a; i < b; ++i)
int debug = 0;
const int N = 60;
int mod = 998244353;
int n, k, sz = 0, cnt, a[N][N], fac[N], was[N];
vector <int> g[N];
void dfs(int v) {
if (was[v]) return;
was[v] = 1;
sz++;
for (int ... | #include <bits/stdc++.h>
#define rep(i,a,b) for (int i = a; i <= b; i++)
using namespace std;
int n, a[111000];
long long res = 1;
int main() {
cin >> n;
rep(i,1,n) cin >> a[i];
sort(a+1, a+n+1);
rep(i,1,n) res = res * (a[i] - a[i-1] + 1) % 1000000007;
cout << res << "\n";
return 0;
}
|
// A
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i = 0; i < n; ++i)
vector<vector<pair<int,int>>> graph(250001);
vector<ll> d_d;
void Dijkstra(int start, int goal, ll t_max){
d_d.assign(graph.size(), t_max);
d_d[start] = 0;
priority_queue<pair<ll,int>, vecto... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
//template
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(v) (v).begin(),(v).end()
using ll=long long int;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
template<typename T>inline bool ch... |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i] += i;
}
for (int i = 0; i < n; i++) {
cin >> b[i];
b[i] += i;
}
vector<int> c = a;
vector<int> d = ... | #include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define rep(i,a,b) for(int i = a; i <= b; i++)
#define rrep(i,a,b) for(int i = a; i >=b; i--)
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define sq(a) (a)*(a)
#defi... |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mod 998244353
#define F first
#define S second
#define all(v) (v).begin(),(v).end()
#define np next_permutation
#define lp(i,n) for(int i=0;i<n;i++)
#define lps(i,j,n) for(int i=j;i<n;i++)
#define vii vector<vi>
#define vb vector<bool>
#define p... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 998244353;
using P=pair<ll,ll>;
const ll inf = 1ll<<60;
int main() {
ll h,w;
cin >> h >> w;
vector<vector<char>>mp(h,vector<char>(w));
for(ll i=0;i<h;i++){
for(ll j=0;j<w;j++) cin >> mp[i][j];
}
vector<ll>... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main()
{
ll n, num = 0, hyp = 1;
cin >> n;
while (1)
{
string hikaku = to_string(hyp) + to_string(hyp);
if (stoll(hikaku) <= n)
{
... | #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)
using namespace std;
using ll = long long;
ll a,b,c,i,j,k,n,m,l,x,y,z,result,chk,tmp,sum;
int main() {
cin >> n;
ll a[n];
rep(i,n){
cin >> a[i];
}
sort(a,a+n);
for(i=n-1;i>... |
#include <cstdio>
#include <cctype>
#define FOR(i,j,k) for(int i=j; i<=k; ++i)
inline int read (void) {
int x = 0, f = 1, ch = getchar();
while(!isdigit(ch)) { if(ch == '-') f = -f; ch = getchar(); }
while(isdigit(ch)) { x = x * 10 + ch - '0'; ch = getchar(); }
return x * f;
}
int main (void) {
int a = read(), b =... | #include<bits/stdc++.h>
using namespace std;
#define INF 1234567890
#define ll long long
int A, B, C;
int N, M, K;
string s;
int main()
{
ios::sync_with_stdio(0); cin.tie(0);
cin.exceptions(ios::badbit | ios::failbit);
cin >> A >> B >> C;
if (A*A + B*B < C*C) cout << "Yes";
else cout << "No";
return 0;
} |
#include <bits/stdc++.h>
#define pb push_back
typedef unsigned long long ll;
using namespace std;
double lg;
ll m;
ll calculate(string x, ll d) {
ll sum = 0;
ll temp = 1;
for (int i = x.size() - 1; i >= 0; --i) {
ll c = x[i] - '0';
if (log2(c) + log2(temp) > lg)
return 0;
sum += c * temp;
if (sum > m)
... | #include <bits/stdc++.h>
#define ll long long
#define X first
#define Y second
#define sz(x) (int)((x).size())
#define all(x) x.begin(), x.end()
#define pii pair<ll, int>
#define pi pair<int, pair<int, int>>
using namespace std;
typedef vector<int> vi;
typedef vector<unsigned int> vui;
typedef vector<ll> vll;
typedef... |
#include <bits/stdc++.h>
int n;
struct node {
int v, t, x;
}a[100010];
bool cmp(node a, node b) {
return a.v < b.v;
}
int main() {
scanf("%d", &n);
for(int i=1;i<=n;i++) scanf("%d%d%d", &a[i].t, &a[i].v, &a[i].x);
std::sort(a + 1, a + n + 1, cmp);
for(int i=1;i<=n;i++) {
if(a[i].x - a[i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll INF_L = 1LL << 60;
const int INF_I = 1 << 30;
const int MOD = (int)1e9 + 7;... |
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <vector>
using namespace std;
typedef long double LD;
typedef pair<int64_t, int64_t> II;
typedef pair<int64_t, II> III;
static c... | #include "bits/stdc++.h"
using namespace std;
//wierd debugging stuff
#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) {... |
#include <bits/stdc++.h>
#define int long long
using namespace std;
int32_t main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n,k;
cin>>n>>k;
vector<pair<int,int>>v(n);
for(int i=0;i<n;i++){
int a,b;
cin>>a>>b;
v[i].first=a;
v[i].second=b;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i <= (n); ++i)
#define debug(a) cout << #a << " = " << a << endl;
using namespace std;
typedef long long ll;
int main()
{
ll n, now; cin >> n >> now;
map<ll, ll> mp;
rep(i, n) {
ll a, b; scanf("%lld %lld", &a, &b);
mp[a] += b;
... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long double ld;
typedef pair<ll, ll> pll;
#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 ms memset
#define pb p... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll; //int:2*10**9
typedef long double ld;
typedef pair<ll,ll> P;
#define REP(i,n) for(ll i = 0; i<(ll)(n); i++)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)
#define vec2(name,i,j,k) vector<vector<ll>> name(i,vect... |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define endl "\n";
#define rep(i, a, b) for (int i=a; i<b; i++)
#define pre(i, a, b) for (int i=a; i>=b; i--)
const int MAX_N = 1e5+5;
const int MOD = 1e9 + 7;
const i... | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <iostream>
#include <cstdio>
#include <stdio.h>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set... |
/* Jai Shree Ram 🚩🚩🚩 */
#include "bits/stdc++.h"
#define ll long long int
#define oo 1000000000000000000
#define forr(i,n) for(int i=0;i<n;i++)
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define all(x) x.begin(),x.end()
#define unique(v) sort(all(v)); v.resize(distance(v.begin(),unique(a... | #include<bits/stdc++.h>
#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define F first
#define S second
#define mp make_pair
#define vi vector<int>
#define pb push_back
using namespace std;
const int N=2e5+5;
ll dp[N*4][2];pii p[N];int n,useless;
map<int,int>m,M;int cnt;vi v[N*4];
int main()
{
... |
# include <bits/stdc++.h>
# ifndef ngng628_library
# define ngng628_library
# define int long long
# define float long double
# define fi first
# define se second
# define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
# define reps(i,n) for(int i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i,n) for(int i=((int)... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
int N; cin >> N;
vector<ll> X(N);
rep(i,N) cin >> X[i];
vector<ll> P = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47};
... |
#include <bits/stdc++.h>
#include <functional>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <stdio.h>
#inclu... | #include <bits/stdc++.h>
using namespace std;
long long mod=1e9+7;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t=1;
// cin>>t;
while(t--){
long long n;
cin>>n;
set <long long> divs;
for(long long i=1;i*i<=2*n;i++){
if((2*n)%... |
#include<bits/stdc++.h>
#include<iostream>
#include<stack>
#include<queue>
using namespace std;
#define ll long long
#define pb push_back
#define ph push
// vector definition
#define vi vector<int>
#define vf vector<float>
#define vll vector<long long>
// set definition
#define si set<int>
#define sf set<float>
void s... | #include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int S,P;cin>>S>>P;
for(int i=1;i*i<=P;i++)if(P%i==0&&i+P/i==S)return puts("Yes"),0;
puts("No");
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.