code_file1 stringlengths 87 4k | code_file2 stringlengths 85 4k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, l, r) for (int i = l; i <= r; ++i)
const int N = 2e6 + 5;
const int Mod = 1e9 + 7;
int n, m, k, fac[N], inv[N];
int Inc (int a, int b) { return (a += b) >= Mod ? a - Mod : a; }
int Dec (int a, int b) { return (a -= b) < 0 ? a + Mod : a; }
int Mul (int a, int... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n';
#define faster ios_base::sync_with_stdio(0);
int main()
{
faster
int a,b,c;
cin>>a>>b>>c;
if(a*a+b*b<c*c)
cout<<"Yes"<<endl;
if(a*a+b*b>=c*c)
cout<<"No"<<endl;
return 0;
}
|
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
#define rep(i,n) for(ll i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rrep(i,n) for(ll i=n-1; i>=0; i--)
#define fi first
#define se second
long long mo = 1000000007;
typedef long long ll;
typedef long double ld;
typedef ... | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int m=0;
int vis[109],pm[109];
int sm[109];
ll f[2][1050009];
void init()
{
for(int i=2;i<=72;i++)
{
if(!vis[i])
pm[++m]=i;
for(int j=1;j<=m&&i*pm[j]<=72;j++)
vis[i*pm[j]]=1;
}
}
int main()
{
ll a,b;
scanf("%lld%lld",&a,&b);
init();
int ... |
#include <iostream>
#include <math.h>
#include <numeric>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <queue>
#include <queue>
#include <stack>
#include <sstream>
#include <set>
typedef long long ll;
const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};
cons... | #include <bits/stdc++.h>
using namespace std;
template<int M>
struct static_mint {
static_assert(0 < M, "Module must be positive");
int val;
static_mint(): val() {}
static_mint(long long x) : val(x % M) { if (val < 0) val += M; }
static_mint pow(long long n) const { static_mint ans = 1, x(*this); while (n) { if ... |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define fo(i,s,e) for( i=s;i<e;i++)
#define rfo(i,s,e) for(i=s;i>e;i--)
#define LL long long int
const LL MOD=1e9+7;
#define pb push_back
#define pob pop_back()
#define sp " "
#define ff first
#define ss second
#define TIME cerr<<"Time Taken:"<<(float)clo... | #include <bits/stdc++.h>
typedef long long int lli;
using namespace std;
lli digits(lli n)
{
lli cnt = 0;
while(n)
{
cnt++;
n = n / 10;
}
return cnt;
}
int main()
{
lli i,j,t,n,sum,m,x1,x2,y1,y2,ans,num,a,b,c,d,cnt = 0,l,odd=0,even=0,diff,x,mini,k,maxi,y;
cin >> n;
for(i=1;;i++)
{
if(stoll(to_string(i) +... |
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
int main()
{
ll n;
cin >> n;
vector<pair<int, int> > v;
for (int i = 0; i < n; i++)
{
ll x, y;
cin >> x >> y;
v.push_back(make_pair(x, y));
}
vector<pair<int, int> >::iterator it;
ll result = 0... | // JG GAP GG
#include <iostream>
#include <cstring>
#include<vector>
#include <algorithm>
#include<cstdlib>
#include<set>
#include<math.h>
#include<map>
#include<unordered_map>
#include<iomanip>
#include<queue>
#include<bitset>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const ll MOD... |
#include<bits/stdc++.h>
using namespace std;
int n , m;
bool palindrome(string s) {
string t = s;
reverse(s.begin() , s.end());
return s == t;
}
void solve(int testCase){
string s;
cin >> s;
for(int i = 0 ; i < 100 ; i ++) {
if(palindrome(s)) {
print... | //#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cos... |
#include <bits/stdc++.h>
#define int long long
#define INF 9223372036854775806
#define cignore cin.ignore(numeric_limits<streamsize>::max(), '\n');
using namespace std;
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string s[n];
for(int i = 0; i < n; ++i)
cin... | #include<bits/stdc++.h>
#define y1 y3647
#define earse erase
#define INF 1000000000
#define LL long long
using namespace std;
inline void read(int &x)
{
x=0;int f=1;
char ch=getchar();
while(ch!=45&&(ch>'9'||ch<'0'))ch=getchar();
if(ch==45){f=-1,ch=getchar();}
while(ch<='9'&&ch>='0'){x=x*10+ch-48;ch=getchar();}
x... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int main(){
ll N; cin >> N;
unordered_set<ll> s;
for(ll a=2; a*a <= N; a++){
ll x = a*a;
while(x <= N){
s.insert(x);
x *= a;
}
}
ll ans = N - s.size();
... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long n,i,m,ans;
cin>>n;
vector<long long> a;
i=2;
ans=0;
while (i*i<=n)
{
m=pow(i,2);
while (m<=n)
{
a.push_back(m);
m*=i;
}
i++;
}
sort(a.begin(),a.end())... |
//Author: Xzirium
//Time and Date: 17:04:30 21 March 2021
//Optional FAST
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native")
//Required Libraries
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.... | //Making love with his ego Ziggy sucked up into his mind
#include<bits/stdc++.h>
using namespace std;
#define sz(x) int(x.size())
#define pb push_back
#define ff first
#define ss second
#define ter(x) cerr << #x << " = " << x << endl
typedef long long ll;
typedef pair<ll,ll> ii;
const int N=1e5+100;
int mm[N];
int her... |
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#define endl "\n"
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define vvi vector < vi >
#define pii pair<... | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define forn(i,n) for(int i=0;i<n;i++)
#define free(i,a,b) for(int i = a; i < b; i++)
#define sf(n) scanf("%d", &n)
#define sff(a,b) scanf("%d %d", &a, &b)
#define sfff(a,b,c) scanf("%d %d %d", &a, &b, &c)
#define pfn(n) printf("%d\n", n)
#define pfs(n) ... |
#include<bits/stdc++.h>
using namespace std;
int main(){
string S; cin >> S;
int ans = 0;
for(int i=0; i<=9999; i++){
vector<bool> flag(10);
int X = i;
for(int j=0; j<4; j++){
flag[X%10] = true;
X /= 10;
}
bool flag2 = true;
for(int j=... | #include <bits/stdc++.h>
#define endl '\n'
#define fi first
#define se second
#define MOD(n,k) ( ( ((n) % (k)) + (k) ) % (k))
#define forn(i,n) for (int i = 0; i < n; i++)
#define forr(i,a,b) for (int i = a; i <= b; i++)
#define all(v) v.begin(), v.end()
#define pb push_back
using namespace std;
typedef long long ll... |
#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 codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yes(ans) if(ans)p... | #include<bits/stdc++.h>
using namespace std;
void solve();
int main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL);
solve();
cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
return 0;
}
void solve()
{
int arr[4];
for (int i = 0; i < 4; i++) {
cin >> arr[i];
}
sort(arr,... |
# include<bits/stdc++.h>
using namespace std;
# define l long long
# define db double
# define rep(i,a,b) for(l i=a;i<b;i++)
# define vi vector<l>
# define vvi vector<vi>
# define vsi vector<set<l> >
# define pb push_back
# define mp make_pair
# define ss second
# define ff first
# define pii pair<l,l>
# define trvi... | #include <bits/stdc++.h>
/* #include <atcoder/all> */
#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)
using namespace std;
/* using namespace atcoder; */
using ll = long long;
usin... |
#include<bits/stdc++.h>
#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)
#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)
#define foreach(i, n) for(auto &i:(n))
#define all(x) (x).begin(),... | #include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long long N;
cin >> N;
unsigned long long at = -1, bt = -1, ct = -1;
unsigned long long sum = 1ll << 63;
for (unsigned long long b = 0; b < 63; b++) {
unsigned long long a = N / (1ll << b);
unsigned long long c = N % (1ll << b... |
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
static const int MOD = 1000000007;
using ll = long long;
using uint = unsigned;
using ull = unsigned long long;
using namespace std;
template<class T> constexp... | // This code wrote by chtholly_micromaker(MicroMaker)
#include <bits/stdc++.h>
#define reg register
#define int long long
#define ALL(x) (x).begin(),(x).end()
#define mem(x,y) memset(x,y,sizeof x)
#define sz(x) (int)(x).size()
#define ln std::puts("")
#define lsp std::putchar(32)
#define pb push_back
#define MP std::ma... |
#include <bits/stdc++.h>
#include <limits.h>
#include <math.h>
#define mod 1000000007
#define pi 3.14159265
// sin((deg*pi)/180.0);
using namespace std;
long long int ans = 0;
// map<int,int> m;
vector<int> m(31,0);
vector<vector<int>> dx;
vector<bool> vis(31,true);
void rec(int i,vector<int> cnt,vector<int> x... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define maxn 200005
int a[maxn];
double n;
signed main()
{
cin>>n;
n*=1.08;
n=floor(n);
if(n<206) puts("Yay!");
if(n==206) puts("so-so");
if(n>206) puts(":(");
return 0;
} |
#include<iostream>
using namespace std;
int main()
{
int a,b;
cin>>b>>a;
int c=a+b;
if(c>=15&&a>=8)
cout<<1;
else if(c>=10&&a>=3)
cout<<2;
else if (c>=3)
cout<<3;
else
cout<<4;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
int main() {
int n, m;
cin >> n >> m;
if (n == 1) {
cout << ((m == 0) ? "1 2\n" : "-1") << endl;
return 0;
}
if (m < 0 || ... |
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cassert>
#include <stdio.h>
#include <stack>
#include <queue>
#include <list>
#include <sstream>
#include <utility>
#include <cctype>
#include <climits>
#include <unordered_set>
#include <unordered... | #include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
template <class T>
inline void chmin(T &a, const T &b) { a = min(a, ... |
#include <bits/stdc++.h>
using namespace std;
int fastio() { ios_base::sync_with_stdio(false); cout << fixed << setprecision(10); cin.tie(nullptr); return 0; }
int __fastio = fastio();
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {ce... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i,s,n) for(int i = s; i < (int)(n); i++)
#define Rep(i,s,n) for(int i = n; i >= (int)(s); i--)
int n, x[3030][5];
int getmask(int i, int lim) {
int res = 0;
rep(j, 0, 5) if (lim <= x[i][j]) res += 1 << j;
retu... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i,n,k) for(int i=(n);i<(k);i++)
#define ALL(a) (a).begin(),(a).end()
ll ans = 0;
void Main(){
double sx, sy, gx, gy;
cin >> sx >> sy >> gx >> gy;
sy = -sy;
cout << fixed << setprecision(8) << sx - sy * (gx - sx) / (gy - sy) ... | #include<bits/stdc++.h>
#define RT register
#define ll long long
#define ull unsigned long long
#define lowbit(x) (x&(-x))
using namespace std;
template<typename T>
inline void read(T &x){
x=0; bool f=0;char ch=getchar();
while(ch<'0'||ch>'9'){f|=ch=='-';ch=getchar();}
while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<... |
// |--------------------------------------------|
// | User - Kunal Kumar |
// |--------------------------------------------|
#include <bits/stdc++.h>
#define pb push_back
#define mk make_pair
#define pf push_front
#define ppf pop_front
#define pii pair<int,int>
#define ll long long
#define ld... | // #MerinoNoMeRepresenta
#include<bits/stdc++.h>
#define fp(x,a,b) for(ll x=a; x<b; x++)
#define fn(x,a,b) for(int x=a; x>b; x--)
#define f(x, m) for(auto x : m)
#define cpu() ios::sync_with_stdio(false); cin.tie(nullptr)
#define pb push_back
#define pii pair<int,int>
#define pll pair<ll, ll>
#define vi vector<int>
#d... |
#include <stack>
#include <queue>
#include <set>
#include <vector>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <string>
#include <utility>
#include <climits>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <cstring>
#include <iostream>
#include <fstream>
#include <iomanip... | #include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using namespace std;
using ll = long long;
struct Edge
{
ll to;
ll cost;
};
using Graph = vector<vector<Edge>>;
using P = pair<ll, ll>;
#define mp make_pair
#define REP(i, n) for (int i = 0; i < (n);... |
#include <bits/stdc++.h>
#include <iostream>
#include <utility>
#include <algorithm>
#include <assert.h>
#include <unordered_map>
//using namespace __gnu_pbds;
using namespace std;
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(0);
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
#define... | #include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
#pragma GCC optimize("Ofast")
using namespace std;
#define int long long
#define double long double
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL);... |
#include <iostream>
using namespace std;
int main(){
double value, currentValue;
double discount;
cin >> value;
cin >> currentValue;
discount = ((value - currentValue) / value)*100;
cout << discount;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rep(i,n) for(LL i=0;i<(n);i++)
int main()
{
double a, b;
cin >> a >> b;
b = a - b;
a = b/a;
a *= 100;
printf("%.10lf",a);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
/* ループ処理 0からnまで*/
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int N;
cin >> N;
int sum = 0;
vector<int> av, bv;
rep(i, N)
{
int A;
cin >> A;
av.push_back(A);
}
rep(i, N)
{
int B;
cin >> B;
bv.push_back(B);
}... | // dp[i][0] ---> no. of ways of x[0...i] to get y[i] = 0
// ---> decision on x[i]
// dp[i][1] ---> no. of ways of x[0...i] to get y[i] = 1
// ---> decision on x[i]
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int n; cin >> n;
vector<vector<ll>> dp(n+1, vector<ll>(... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
using namespace std;
template <class T = int>
using V = vector<T>;
template <class T = int>
using VV = V<V<T>>;
using ll = lo... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5+10;
int sz[MAXN];
int main() {
int n, x;
cin >> n >> x;
for(int i=0; i<n; i++) {
cin >> sz[i];
}
for(int i=0; i<n; i++) {
if(sz[i]!=x){
cout << sz[i] << " ";
}
}
cout << endl;
return 0;
} |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define pb push_back
#define pf push_front
#define F first
#define S second
#define MOD 1000000007
#define MAXN 1000001
#define MODA 998244353
#define all(a) (a).begin(),(a).end()
#define allr(a) (a).rbegin(),(a).re... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a,b,c;
cin >>a>>b>>c;
int ans=0;
ans = max(a+b,ans);
ans = max(a+c,ans);
ans = max(b+c,ans);
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int n, q, flip = 0;
string s;
cin >> n >> s >> q;
while (q --)
{
int t, a, b;
cin >> t;
cin >> a >> b;
a --;
b --;
if (t == 2)
flip = 1 - flip;
e... |
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> l_l;
typedef pair<int, int> i_i;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = numeric_limits<ll>::max() / 4;
const ll MOD = 1e9+7;
// using mint = atcoder::modint10000... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) begin(x),end(x)
#define F(i,n) for (int i = 0; i < n; ++i)
#define F1(i,n) for (int i = 1; i <= n; ++i)
#define dbg(x) cerr << #x << " = " << x << endl
#define dbgg(x) cerr << #x << " = " << x << ' '
#de... |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define PI 2*acos(0.0)
const int mod = 1e9 + 7;
const int sz = 1e7;
#define all(x) x.begin(),x.end()
#define gcd(x,y) __gcd(x,y)
#define lcm(x,y) (x/gcd(x,y))*y
using namespace std;
#define optimize... | #include<bits/stdc++.h>
#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)
#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)
#define foreach(i, n) for(auto &i:(n))
#define all(x) (x).begin(),... |
#include <iostream>
using namespace std;
int main() {
double a, b;
cin >> a >> b;
int c = a - b;
cout << (c / a)*100;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define rep(i,n) for(LL i=0;i<(n);i++)
int main()
{
double a, b;
cin >> a >> b;
b = a - b;
a = b/a;
a *= 100;
printf("%.10lf",a);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=0;i<(int)(n);i++)
#define si(c) ((int)(c).size())
#define forsn(i,s,n) for(int i = (int)(s); i<((int)n); i++)
#define dforsn(i,s,n) for(int i = (int)(n)-1; i>=((int)s); i--)
#define all(c) (c).begin(), (c).end()
#define D(a) cerr << #a << "=" <... | #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... |
//Author: A_S_M_M@sud_P@rvez
#include<bits/stdc++.h>
using namespace std;
#define MP ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define For(i,n) for(int i=0;i<n;i++)
#define Forn(i,n) for(int i=1;i<=n;i++)
#define Fors(i,s) for(int i=0;i<s.size();i++)
#define all(v) v.begin(),v.end()
#defin... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define printV(v) for(int i=0;i<(int)v.size();i++){cout << v[i]<< " ";} cout << endl
#define printRev(v) for(int i=(int)v.size()-1;i >= 0;i--){cout << v[i] << " ";} cout << endl
... |
#include<bits/stdc++.h>
using namespace std;
#define PB push_back
#define ll long long
int main(){
int T;
int n;
cin>>n;
vector<ll> a(n);
ll ta=0,tb=0;
for(int i=0;i<n;i++){
ll x,y;
scanf("%lld%lld",&x,&y);
ta+=x;
a[i]=x+y+x;
}
sort(a.begin(), a.end(),greater<ll>() );
int res=0;
while(tb<=ta){
tb+=... |
// Problem: D - Choose Me
// Contest: AtCoder - AtCoder Beginner Contest 187
// URL: https://atcoder.jp/contests/abc187/tasks/abc187_d
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
usi... |
#include "iostream"
#include "vector"
#include "queue"
#include "stack"
#include "algorithm"
#include "string"
#include "cstring"
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
if (n % 100 == 0) {
cout << n / 100 << endl;
}
else {
cout << n / 100 + 1 << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll ;
typedef long double lld;
#define all(x) (x).begin(), (x).end()
#define inarr(a,n) for(int i=0;i<n;i++) cin>>a[i];
#define outarr(a,n) for(int i=0;i<n;i++) cout<<a[i]<<" "; cout<<endl;
int main(){
int N;
cin>>N;
if(N%100==0)
co... |
#include<iostream>
using namespace std;
int main()
{
int a, b, c;
cin>>a>>b>>c;
int A, B, C;
A=7-a;
B=7-b;
C=7-c;
cout<<A+B+C;
} | #include<bits/stdc++.h>
using namespace std;
int main() {
long long A,B,C,kekka;
cin >> A >> B >> C;
A=A%998244353;
B=B%998244353;
C=C%998244353;
kekka=((A*(A+1)/2%998244353)*(B*(B+1)/2%998244353)%998244353*(C*(C+1)/2%998244353)%998244353);
cout << kekka << endl;
} |
#include <bits/stdc++.h>
using namespace std;
const int N = 505;
int n, m, a[N][N], b[N][N];
struct info { int x, y, p; };
queue <info> q;
bool inq[N][N][2];
int dis[N][N][2];
inline void spfa()
{
memset(dis, 0x3f, sizeof(dis));
dis[1][1][0] = 0; q.push( (info) { 1, 1, 0 } ); inq[1][1][0] = 1;
int x, y, p;
... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define V vector
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), ... |
#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 int long long int
#define ld long double
#define pb push_back
#define MOD 10... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define w(x) int x; cin>>x; while(x--)
#define mii map<int,int>
#define endl ("\n")
#define vi vector<int>
#define pii p... |
// Problem: C - Comma
// Contest: AtCoder - Panasonic Programming Contest (AtCoder Beginner Contest 195)
// URL: https://atcoder.jp/contests/abc195/tasks/abc195_c
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Date: 2021-03-13 22:42:44
// --------by Herio--------
#include<bits/stdc++.h>
using namespace std;
typede... | #include <fstream>
#include <numeric>
#include <unordered_set>
#include <sstream>
#include <cassert>
#include <tuple>
#include <iomanip>
#include <random>
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
vector<ll>v[3];
int sz[3];
int baad;
ll calc(int c1,int c2,bool check=false)
{
ll ansmin = 1e18;
ll a1,a2;
int pos, anspos = -1,i;
for(i=0;i<sz[c1];i++)
{
a1 = v[c1][i];
pos = upper_bound(v[c2].begin(), v[c2].end(), ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second
#define pii pair <int,int>
#define pll pair <ll,ll>
#define testcase() int t; cin>>t; while(t--)
#define forn(i,n) for(int i=0;i<n;i++)
#define forn1(i,n)... |
#include<iostream>
int n;
int main(){
std::cin >> n;
int ans = 0;
while(true){
ans++;
if((ans-1)*100+1<=n&&n<=ans*100){
std::cout << ans << std::endl;
break;
}
}
return 0;
} | #include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;
template<class T> constexpr... |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define il inline
#define rg register
il int read()
{
int re=0,k=1;char ch=getchar();
while(ch>'9'||ch<'0'){if(ch=='-')k=-1;ch=getchar();}
while(ch<='9'&&ch>='0'){re=re*10+ch-48;ch=getchar();}
return re*k;
}
il void write(int x)
{
if(x<0)return ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if (abs(a-b)<3) cout<<"Yes";
else cout<<"No";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define SZ(v) ((int)(v).size())
#define abs(x) ((x) > 0 ? (x) : -(x))
typedef long long LL;
const LL mod = 1000000000 + 7;
LL n, p;
void solve() {
cin >> n >> p;
LL b = n - 1, a = (p - 2) % mod;
LL res = 1;
for (; b; b >>= 1) {
... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>... |
#include<bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ll long long
#define ull unsigned long long
#define db double
#define pii pair<int,int>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define pll pair<ll,ll>
#define ti3 tuple<int,int,int>
#define mat vector<vector<int>>
const int inf = 1 <... | #include <cstdio>
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <tuple>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cassert>
#inc... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;
int main(void){
long long N;
long long X=1;
long long x=1000000000;
cin>>N;
set<long long> Ax;
for(long long n=0;n<N;n++){
long long a;
cin>>a;
if(X<a)X=a;
if(x>a)x=a;
Ax.insert(a);
}
whil... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using vi = vector<int>;
constexpr char newl = ... |
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
int main(int argc, const char * argv[]) {
// cinを高速にするためのおまじない
cin.tie(0);
ios::sync_with_stdio(false);
int n, x;
cin >> n;
cin >> x;
int hai = 0;
int alSum = 0;
int arr[n][2];
... | #include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
void solve(){
ll N,c;
cin >> N >> c;
vector<pll> v;
ll a;
vll cs(N+1);
... |
#include <bits/stdc++.h>
using namespace std;
//vector <long long> v[1000001];
//stack <long long> s, s2;
//queue <long long> s, s2;
long long int z[1000000], x[102][127502], y[1000000], m, szu, wy;
//char s[10000000];
int main()
{
long long int d, e, f, i, j, q, t, k, a, n, b, c, w, p, aa, bb, cc, dd, nn, kk... | #include<bits/stdc++.h>
using namespace std;
using LL = long long;
int N, K, M;
constexpr int maxn = 1000000;
int arr[maxn << 1], *dp;
void add(int& X, int Y){
X += Y;
if(X >= M) X -= M;
}
void sub(int& X, int Y){
X -= Y;
if(X < 0) X += M;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullp... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define pii pair<int,int>
#define vi vector<int>
#define vpii vector<pii>
#define pll pair<ll,ll>
#define vll vector<long long>
#define f first
#define s second
long long mod = 1e9+7;
int diry[] = {-1,0,0,1,1,-1,-1,1};
i... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cstring>
#include <functional>
using namespace std;
typedef long long ll;
typedef ... |
#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;
cin >> N;
vector<P> xy(N);
rep(i,N) cin >> xy[i].first >> xy[i].second;
int M;
cin >> M;
vector<vector<ll>> state(M+1, vector<ll>(4));//x, y, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define x1 gdsfdsf
#define y1 fgdfgdfg
#define endl '\n'
const ll DIM = 2E5+7;
pair<ll,ll> A[DIM],Q[DIM];
vector<pair<ll,ll> > V[DIM];
pair<ll,ll> ans[DIM];
pair<ll,ll> F(pair<ll,ll> a,ll rot){
if (rot==0){
return a;
}
if (rot==1){... |
#include <bits/stdc++.h>
#include <unordered_set>
#include <algorithm>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vs = vector<string>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repll(i,n)... | #include<bits/stdc++.h>
using namespace std;
int n,m,x[101010],y[101010];
long long ans=0;
map<pair<int,int>,int>mp;
string s;
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++)
{
cin>>s;
for(int j=0;j<m;j++)
{
if(s[j]=='0')
{
x[i]++;
}
else
{
y[i]++;
}
}
mp[make_pair(x[i],y[i])]++;
}... |
#include <bits/stdc++.h>
#define ll long long
#define sz(x) (int)(x).size()
using namespace std;
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//uniform_int_distribution<int>(1000,10000)(rng)
ll binpow(ll a, ll b)
{
ll res = 1;
while (b > 0)
{
if (b & 1)
res = r... | #include<cstdio>
#include<vector>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
using namespace std;
// #define NDEBUG
#include<cassert>
#define rep(i, l, r) for(int i=(l), i##_end_=(r); i<=i##_end_; ++i)
#define drep(i, l, r) for(int i=(l), i##_end_=(r); i>=i##_end_; --i)
#define fi first
#... |
#include <bits/stdc++.h>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <vector>
#define loop(i,a,b) for (int i = (a); i <= (b); i++)
#define loopr(i, a, b) for(int i = (a); i >= (b); i--)
#define pb(a) push_back(a)
#define pf(a) push_front(a)
#define mp(a,b)... | #include <bits/stdc++.h>
#define LOCAL
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
#define mem(a, b) memset(a, b, sizeof(a))
#define REP(i, a) for (int i = 0; i < a; ++i)
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define ALL(a) a.begin(), a.end()
inline void quickread() {
ios:... |
#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 f(i,a,b) for( ll i = a; i < b ; i++ )
#define af(i,a,b) for( ll i = a; i >= b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < b ; i+= k )
#define arep(i,a,... | #include <iostream>
using namespace std;
int H, W, A, B, ans = 0;
void dfs(int i, int bit, int A, int B){
if(i == H * W) return (void)ans++;
if(bit & 1 << i) return dfs(i + 1, bit, A, B);
if(B) dfs(i + 1, bit | 1 << i, A, B - 1);
if(A){
if(i % W != W - 1 && ~bit & 1 << (i + 1)) dfs(i + 1, bit |... |
#include <bits/stdc++.h>
using namespace std;
//ofstream cout("output.out");
#define fast() {ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);}
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define mii map<int, int>
#define pii pair<int, int>
#define qii prio... | #include <bits/stdc++.h>
#define fo(i, k, n) for (ll i = k; i < n; i++)
#define rfo(i, k, n) for (ll i = k; i >= n ; i--)
#define ll long long
#define ld long double
#define que queue
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define vl vector<ll>
#define gcd(m,n) __gcd( m, n)
#define sq(x) ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(auto i=(a); i<(b); ++i)
#define trav(a,x) for(auto& a: x)
#define all(x) begin(x),end(x)
#define sz(x) (int)size(x)
#define PB push_back
using ll = long long;
using ld = long double;
using pii = pair<int,int>;
using vi = vector<int>;
using vll = vect... | #include <bits/stdc++.h>
#include <ctime>
using namespace std;
#define ll long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define P pair<int,int>
using Graph = vector<vector<int>>;
int main() {
int N; cin >> N;
string S,T; cin >> S >> T;
vector<int> s1,t1;
rep(i,N){
if(S[i]=='1') s1.pus... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, S, D;
cin >> N >> S >> D;
int X[N], Y[N];
for (int i = 0; i < N; i++) {
cin >> X[i] >> Y[i];
}
bool res = false;
for (int i = 0; i < N; i++) {
if (X[i] < S) {
if (Y[i] > D) {
res = true;
break;
}
... | // g++ -std=c++11 a.cpp
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<random>
#... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl "\n"
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);
ll decimaltoOctal(ll deciNum)
{
// initializations
ll octalNum = 0, countval = 1;
ll dNo = deciNum;
while (deciNum != 0) {
// decimals remai... | // 問題の URL を書いておく
//
#include <bits/stdc++.h>
using namespace std;
//#define ENABLE_PRINT
#if defined(ENABLE_PRINT)
#define Print(v) \
do {\
cout << #v << ": " << v << endl; \
}while(0)
#define PrintVec(v) \
do {\
for(int __i = 0; __i < v.size(); ++__i) \
{ \
cout << #v << "[" << __i << "]: "... |
#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
long long A[10010];
int main()
{
int N;
scanf("%d",&N);
for(int i=0;i<N;i++)
scanf("%lld",&A[i]);
long long ans=A[0];
for(int i=0;i<N;i++)
{
long long minimum=A[i];
for(int j=i;j<N;j++)
... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define irep(i,a,b) for(int i=int(a);i<(int)b;++i)
#define rrep(i,a,b) for(int i=int(a);i>=(int)b;--i)
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vvp vector<vector<pair<ll,ll>>>
#... |
// Author: old_school
// Created: 18.04.2021 17:30:11
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
using namespace std;
#define lld long long int
#define ld long double
#define pb push_bac... | #include<bits/stdc++.h>
#define ll long long int
#define fab(a,b,i) for(int i=a;i<b;i++)
#define db double
#define endl "\n"
#define f first
#define se second
#define MOD 1000000007
#define quick ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
ll add(ll x, ll y) {ll res = x + y; return (res >= MOD ? res -... |
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define deb(a,b,c) cout<<#a<<" = "<<(a)<<", "<<#b<<" = "<<(b)<<", "<<#c<<" = "<<(c)<<endl;
typedef long long int ll;
typedef string str;
ll power(ll x, ll y, ll p)
{
ll res = 1;
x = x % p;
while (y)
... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using pp=pair<int,int>;
const ll INF=1e9;
const ll mod=1e9+7;
int main() {
int N;
string s;
cin >> N >> s;
stack<int> ss, res;
int m=0;
int i=0;
while (i<N) {
if (i+2<N && s[i]=='f' && s[i+1]=='o' && s[i+2]=='x') {
m++;
... |
#include <bits/stdc++.h>
/*
// using ASL (use make)
#include <atcoder/all>
using namespace atcoder;
*/
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
// 1次元 vector print
template <class T>
ostream &operator<<(ostream &s, vector<T> vec) {
for (int i = 0; i... | //デバッグ用オプション：-fsanitize=undefined,address
//コンパイラ最適化
#pragma GCC optimize("Ofast")
//インクルードなど
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
//マクロ
//forループ
//引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
//Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
//FORAは範囲for文(使いにくかったら消す)
#define re... |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 1; i <= (n); i++)
using namespace std;
const int MOD = 998244353;
int f[200002];
int find(int x) {
return f[x] == x ? f[x] : f[x] = find(f[x]);
}
int main() {
int n; cin >> n;
REP(i, n) f[i] = i;
REP(i, n) {
int x; cin >> x;
f[find(x)] = find(i);
}
int... | #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <map>
#define amax(a, b) a = std::max(a, b)
#define amin(a, b) a = std::min(a, b)
using ll = long long;
std::pair<int, int> log3(int n) {
int i;
// std::cerr << ": " << n << std::endl;
for (i=0; n % 3 =... |
#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()
... | //Codeforcesで128bit整数を使いたいとき
//→__int128_tを使う&GNU C++17 (64)で提出する
//インクルードなど
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tu... |
#include <bits/stdc++.h>
using namespace std;
#define show(a) for(auto e:a)cout<<e<<" ";cout<<endl
#define size(a) static_cast<int>((a).size())
int main(){
long long n, maxb, powb, ans = LLONG_MAX, a, c;
cin >> n;
maxb = log(n) / log(2);
if(n == 1){
cout << 1 << endl;
return 0;
}
for(int b = 0; b <... | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef vector<double> Vec;
typedef vector<Vec> Mat;
typedef pair<ll,ll> P;
typedef pair<double,ll> Pd;
typedef pair<double,double> PD;
typedef priority_queue<P,vector<P>,greater<P> >... |
#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define test() int t; cin>>t; while(t--)
#define all(v) v.begin(),v.end()
#define st(v) sort(all(v))
#define stA(arr,n) sort(arr,arr+n)
#define dps(n,c) vector<vector<ll>> dp(n,vector<ll>(c,0))
#define vc(v,n,f) vector<ll> v(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;
using ll = long long;
using ld = long double;
template <typename T>
using orderedSet = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
te... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a;
cin>>a;
if(a%2==0)
cout<<"White";
else
cout<<"Black";
} | //g++ t.cpp -o t && t < p.txt
//d>p.txt&&t<p.txt&&t2<p.txt
#include <iostream> // プログラムの耳と口
#include <vector> // 超有能配列秘書
#include <algorithm> // みんな大好きソートと二分探索
#include <queue> // きゅーちゃん、だいすき
#include <string> // to_string
#include <functional> // 関数を変数に入れる子
#include <set> // 値の取得・挿入・削除を高速に
#include <map> // setの妹 これま... |
#include<bits/stdc++.h>
#include<cstdlib>
#include <algorithm>
#include <string>
using ll = long long;
using ull = unsigned long long;
using namespace std;
constexpr int inf = 1<<30;
constexpr int mo = 1e9+7;
constexpr ll infl = 1ll<<60;
int main(){
cin.tie(nullptr);
std::ios::sync_with_stdio(false);
... | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,mmx,avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define PB push_back
#define MP make_pair
#define endl "\n"
#define fst first
#define snd second
const int UNDEF = -1;
co... |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define rep(i,n) for(int i = 0; i < n ; ++i)
#define REP(i,a,b) for(int i = a ; i <= b ; ++i)
#define filei freopen("input.txt", "r", s... | #pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << '(' << ... |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
auto read = [&](){
int x; cin >> x;
return x;
};
vector<int> a(4);
for(int & v : a) v = read();
sort(a.begin(), a.end());
if(a[0] + a[3] == a[1] + a[2] || a[3] == a[0] + a[1] + a[2]) cout << "Yes\n";
else cou... |
#include <iostream>
using namespace std;
int main()
{
string x;
cin >> x;
int i=0;
for(int i=0; i<x.length(); i++){
if( ( (i%2!=0)&&(x[i]>='a')&&(x[i]<='z') ) || ( (i%2==0)&&(x[i]>='A')&&(x[i]<='Z') ) ) {
cout << "No";
return 0;
}
}
cout << "Yes";
... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
ll a,b,x,y;
cin >> a >> b >> x >> y;
ll ans=0;
if(a>b){
if(2*x>y){
ans=x;
for(int i=0;i<a-b-1;i++){
ans+=y;
}
}else{
ans=x;
a--;
... | #include<bits/stdc++.h>
using namespace std;
long long a[200005],b[200005];
int main()
{
int k,n,m;
cin>>k>>n>>m;
for (int i=1;i<=k;i++){
cin>>a[i];
}
priority_queue<pair<long long,int> > q;
long long cn=m;
double c=1.0*m/n;
for (int i=1;i<=k;i++){
b[i]=(int)(c*a[i]);
c... |
/*Allah Vorosha*/
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define ull unsigned long long
#define pb push_back
#define n_p next_permutation
#define p_p prev_permutation
#define in insert
#define rev reverse
#define pf push_front
#define pob pop_back
#define uniq(v) v.resize(distance(v... | #include<bits/stdc++.h>
using namespace std;
map<string, int> m;
int main(){
int n;
cin >> n;
string ans = "satisfiable";
for(int i = 0; i < n; i++){
char a[20];
cin >> a;
if(a[0] == '!'){
if(m[a+1] == 1){
ans = a+1;
}
else{
m[a+1] = 2;
}
}
else{
... |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
int n;
int a[MAXN << 1];
priority_queue<int,vector<int>,greater<int> > taken;
int main()
{
scanf("%d",&n);
for (int i = 1;i <= n * 2;i++)
scanf("%d",&a[i]);
for (int i = n;i >= 1;i--)
{
int u = a[i],v = a[2 * n - i + 1];
if (u < v)
... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
#define Bit(x, k) (((x) >> (k)) & 1)
#define Xor(x, k) ((x) ^ (1 << (k)))
signed main() {
// freopen("in" , "r", stdin );
cin.tie(0)->sync_with_stdio(0);
int n; cin >> n;
vector<int> a(n);
for (auto &i : a) cin >> i;
int... |
#include <iostream>
#pragma GCC optimize("O3")
#define int unsigned long long
using namespace std;
bool check(int n,int x){
if(x%n!=1)return 1;
return 0;
}
int gcd(int a,int b){
if(a%b==0){
return b;
}
return gcd(b,a%b);
}
signed main(){
int n;
cin>>n;
int sum=1;
for(int i... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define deb(x) cout << #x << " " << x << endl;
#define debtwo(x,y) cout << x << ", " << y << endl;
#define mod 1000000007
#define N 1000001
void solve() {
ll n; cin >> n;
ll res = 1;
vector<bool> primes(31, true);
for (int i = 2; i <= 5; i+... |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <tuple>
#include <utility>
#include <set>
#include <numeric>
#include <queue>
#include <sstream>
#include <map>
#include <unordered_map>
#include <cmath>
// #include <boost/numeric/ublas/vector.hpp>
// #include <boost/numeric/ublas/m... | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
#include <iomanip>
using namespace std;
#define intmax INT_MAX
#define lmax LON... |
#include<bits/stdc++.h>
using namespace std;
int h,m;
int main()
{
scanf("%d %d",&m,&h);
if(h%m==0) printf("Yes");
else printf("No");
} | #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, w;
cin >> n >> w;
cout << n / w;
return 0;
} |
#include<iostream>
using namespace std;
int main()
{
int n;
int min = 100000;
for (int i = 1; i <= 4;i++){
cin >> n;
if(n<min)
min = n;
}
cout << min;
return 0;
} | #include <bits/stdc++.h>
#include <string>
#include <cmath>
using namespace std;
#define ll long long int
#define pb push_back
#define RONALDO ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pii pair<ll, ll>
#define ff first
#define ss second
#define mod 1000000007
#define vi vector<ll>
#define mi map<ll, ll>
... |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <iomanip>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <bitset>
#include <chrono>
#include <random>
#define rep(... | #pragma GCC optimize ("O2")
#pragma GCC target ("avx")
//#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;
#include<iostream>
#include<cstring>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
map<ll, ll> mp;
for(int i=0; i<s.size(); i++) {
int x = s[i] - '0';
mp[x]++;
}
if(s == "8") {
cout << "Yes" << endl;
return 0;
}
if(s.size() == 2) {
... | #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... |
//ABC_199_
//
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;++i)
#define reps(i,s,n) for(int i=s;i<n;++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main()
{
int n,m;
cin >> n >> m;
vector<int> X(m),Y(m),Z(m);
rep(i,m) cin >> X[i] >> Y[i] >> Z[i];
vector<ll>... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
constexpr ll MOD = 1000000007;
#ifndef ONLINE_JUDGE
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " (" << x.first << " : " ... |
#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) <<... | /*
* TheMartian0x48
*/
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
// clang-format off
#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 t... |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#define f(i,a,b) for(ll i = a; i < (ll) b ; i++ )
#define af(i,a,b) for(ll i = a; i >= (ll) b ; i--)
#define rep(i,a,b,k) for(ll i = a; i < (ll) b ; i+= k )
#define arep(i,a,b,k) for(ll i = a; i >= (ll) b ; i-= k)
#define f... | #define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(...) begin(__VA_ARGS__) , end(__VA_ARGS__)
#define boost {ios_base::sync_with_stdio(false); cin.tie(); cout.tie();}
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long... |
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#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<st... | // #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,mmx,avx,avx2")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define lld long double
#define w(x) ll x;cin>>x;while(x--)
#define all(x) x.begin(), x.end()
#define lb ... |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,ans=0;
double x[2010][5];
cin>>n;
for(int i=0;i<n;i++)
for(int j=0;j<3;j++){
cin>>x[i][j];
if(x[i][0]==2)
x[i][2]-=0.1;
if(x[i][0]==3)
x[i][1]+=0.1;
if(x[i][0]==4){
x[i][1]+=0.1;
x[i][2]-=0... | // Daniel Grzegorzewski15
// while (clock()<=69*CLOCKS_PER_SEC)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
#define MP make_pair
#define PB push_back
#define ST first
#define ND second
usi... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
cout<<(2*a+100)-b<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
#define MOD 1000000007
#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 reps(i, s, n) for (int i = s; i < (int)(n); ++i)
template <typename T>... |
#include <iostream>
#include <algorithm>
#include <vector>
#include <cstring>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <iomanip>
#include <math.h>
#include <limits.h>
#include <string>
#include <bitset>
#include <numeric>
using namespace std;
#define pb... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define vll vector<ll>
#define vvll vector<vll>
#define mll map<ll,ll>
#define f(i,m,n) for(i=m;i<n;i++)
#define ee endl
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define take(v,n) for(i=0;i<n;i++) cin>>v[i];
#def... |
#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>
using namespace std;
int main(){
int x, y;
int a, b;
cin >> a >> b;
x = (a + b)/2;
y = (a-b)/2;
cout << x << " " << y << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
const int MD = 1000000007;
long long inv(int n) {
return n == 1 ? 1 : inv(n - MD % n) * (MD / n + 1) % MD;
}
long long choose(int n, int k) {
return n < k ? 0 : k == 0 ? 1 : choose(n - 1, k - 1) * n % MD * inv(k) % MD;
}
int main() {
int n, m, k; cin... | #include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll=long long;
using ld=long double;
using pll=pair<ll, ll>;
//using mint = modint1000000007;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
#define PI acos(-1)
#define oo 2e18
template<typenam... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int MAXN = 1e5 + 5;
char s[MAXN];
int main(void)
{
int n;
scanf("%d%s",&n,s+1);
if(s[1] != s[n]) return printf("1"), 0;
for(int i=1; i<n; ++i)
if(s[i] != s[1] && s[i+1] != s[1])
return printf("2"), 0;
print... | /*CP is fun!*/
#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define int long long
using namespace std;
const int MAXN=2e5+5;
const int MOD=1e9+7;
const int MAX=205;
ll powerm(ll a,ll b,ll m) { //m-> mod
if(b==0) {
return 1;
}
... |
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<vector<int> > v;
for(int i = 0 ; i < n ; i++) {
vector<int> temp(5);
for(int i = 0 ; i < 5 ; i++) {
cin >> temp[i];
}
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
using vec_int = vector<int>;
using P = pair<int,int>;
using T = tuple<int,int,int>;
using ll = long long;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int charToInt(char c){
char zero_num = '0';
return (int)c - (int)zero_num;
}
int sear... |
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast")
using namespace __gnu_pbds;
using namespace std;
#define int long long int
#define endl '\n'
#define mod 1000000007
//#define mod 998244353
#define inf 1e18
#define PI 3.14159265
#define ff ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
vector<int> A(N), B(N);
vector<vector<int>> G(N);
for (int i = 0; i < N - 1; i++) {
int a, b;
cin >> a >> b;
a--, b--;
A[i] = a;
B[i] = b;
G[a].emplace_back(... |
#include <iostream>
using namespace std;
int main(int argc, const char * argv[]) {
int A=0,B=0,C=0;
cin>>A>>B>>C;
cout<<(B*C-1)/A<<endl;
return 0;
}
| // RAKSHIT KADAM
#include <bits/stdc++.h>
// #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<int> , rb_tree_tag , tree_order_statistics_node_update>
// find_by_order returns iterator to element pre... |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii ... | #include<bits/stdc++.h>
#include<iostream>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<queue>
#include<vector>
#include<stack>
#include<sstream>
#include<algorithm>
#define... |
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#include<vector>
#include<cmath>
using namespace std;
const int M=2e5+5;
const int N=1e3+5;
#define int long long
int Max(int x,int y){return x>y?x:y;}
int Min(int x,int y){return x>y?y:x;}
int Abs(int x){return x>0?x:-x;}
void write (int x) {
if (... | // atcoder/abc186/F/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto& i : c)
#define unless(cond) if (!(cond))
using namespace std;
template<typename P, typename Q> ostream& operator << (ostream& os, pair<P, Q> p) { os << "(" << p.first << ... |
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vld;
typedef ... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author aajisaka
*/
#include<bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef pair<int, int>pi;
typedef pair<long long, long long>pl;
#define F first
#define S second
#define pb push_back
#define all(x) x.begin() , x.end()
#define m... | #include<bits/stdc++.h>
#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)
#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)
#define foreach(i, n) for(auto &i:(n))
#define all(x) (x).begin(),... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int A, B, W;
cin >> A >> B >> W;
int mi = INT_MAX, ma = INT_MIN;
for (int i = 1; i <= 1000000; i++) {
if (A * i <= 1000 * W && 1000 * W <= B * i) {
mi = min(mi, i);
ma... | #include <bits/stdc++.h>
using namespace std;
int main() {
long double a, b, r;
cin >> a >> b >> r;
r = nextafter(r, INFINITY);
int lx = ceil(a - r), rx = floor(a + r);
long long ans = 0;
for (int x = lx; x <= rx; ++x) {
long double dy = sqrt(r * r - (x - a) * (x - a));
int... |
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define m 2147483647
#define mn -2147483647
int main()
{
lli i,j,n,k,add=0,add1;
cin>>n>>k;
for(i=1;i<=n;i++)
{
for(j=1;j<=k;j++)
{
add+=100*i+j;
}
}
cout<<add<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i = 0; i < (int) N; i++)
int main() {
int N,K;
cin >> N >> K;
cout << 50*N*(N+1)*K+N*K*(K+1)/2 << endl;
} |
/*Jai Shree Ram*/
// Never Give Up
/*自分を信じない人にとっては、一生懸命働くことは無意味です*/
#include<bits/stdc++.h>
#include<unordered_map>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii ... | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define int long long
#define ll long long
#define ld long double
#define all(v) v.begin(), v.end()
#define endl "\n"
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const ll MAX ... |
#include<bits/stdc++.h>
using namespace std;
#define N 2
#define NN 205
#define For(i,x,y)for(i=x;i<=(y);i++)
int f[NN][NN][N][N][N],val[NN][NN][N][N][N],a[NN],used[NN];
pair<pair<int,int>,pair<bool,pair<bool,bool> > >pre[NN][NN][N][N][N];
int main()
{
int n,i,j,k,p,tot=0,l,u,v;
pair<pair<int,int>,pair<bool,pair<bool... | #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>
using namespace std;
int main()
{
int n;
cin>>n;
int ans=0;
while(n--)
{
int x;
cin>>x;
if(x>10)
ans+=x-10;
}
cout<<ans;
return 0;
} | /*Created By:---- Dibas Behera*/
#include<bits/stdc++.h>
using namespace std;
#define db(x) cout<<x<<'\n'
#define db1(x) cout<<#x<<"="<<x<<'\n'
#define db2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<'\n'
#define db3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<'\n'
#define repi(i,n) for(int i=0;i<(n);++i)
/... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.