code_file1 stringlengths 87 4k | code_file2 stringlengths 82 4k |
|---|---|
#include<iostream>
#include<iomanip>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<deque>
#include<set>
#include<stack>
#include<numeric>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
struct Ed... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
long long powl(long long x, long long n) {
long long ret = 1;
while (n > 0) {
if (n&1) ret = ret * x % MOD;
x = x * x % MOD;
n >>= 1;
}
return ret;
}
int main() {
long long N, P;
cin >> N >> P;
long long ans = P-1;
a... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
ll Modpow(ll k,ll n,ll m){
if(n==0){
return 1;
}else if(n%2==0){
ll t=Modpow(k,n/2,m);
return (t*t)%m;
}else{
return (Modpow(k,n-1,m)*k)%m;
}
}
int main() {
ll n,m;
cin >> n ... | #include <bits/stdc++.h>
using namespace std;
long long n, m;
vector<long long> ten;
vector<vector<long long>> memo, sum;
int main() {
cin >> n >> m;
ten.push_back(10 % m);
for (int i = 0; i < 62; ++i) {
long long now = ten.back() * ten.back() % m;
ten.push_back(now);
}
memo.assign(62, vector<long l... |
#include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
char S1 = S[0];
char S2 = S[1];
char S3 = S[2];
cout << S2 << S3 << S1<< endl;
} | //
// Created by Abhishek Bansal on 3/28/2021
//
//#pragma GCC optimize ("O3")
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,mmx,tune=native")
#include <bits/stdc++.h>
#define ll long long
#define ld long double
using namespace std;
clock_t startTime;
double ge... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
const ll MAX = 1000000000000000000LL;
const ll md = 998244353;
#define FAST_IO ios_base::sync_with_stdio(false); cin.tie(NULL)
ll pw(ll a, ll n)
{
ll result = 1;
while (n)
{
if (n&1) result = (result... | /*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).be... |
#include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
using vl = vector<ll>;
#define ice(i, a, b) for (int (i) = (a); (i) < (b); ++(i))
#define fire(i, a, b) for (int (i) = (b) - 1; (i) >= (a); --(i))
ll n;
ll get(vl& w, ll idx) {
ll s = 0;
while (idx > 0) {
s += w[idx];
idx -= ... | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0;i < (n);i++)
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
const ll MOD = 1000000007;
const ll MOD3 = 998244353;
const ll INFl = 10000000000000000;
... |
#include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define st first
#define nd second
#define pii pair<int,int>
#define mp make_pair
#define pll pair<long long,long long>
using namespace std;
const int nax = 5e5 + 5;
char a[nax];
ll f[nax];
ll inv[nax];
ll nk(ll n, ll k){
if(n < k) return 0;... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=(int)(x);i<(int)(y);i++)
#define print(A,x,n) rep(i,0,n){cout<<(i ? " ":"")<<A[i]x;}cout<<endl;
#define pprint(A,y,m,n) rep(j,0,m){print(A[j],y,n);}
const long mod=1e9+7;
const int siz=4e5;
const int inf=1e9;
int fact[siz+1];
int three_count(int ... |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define ALL(v) v.begin(), v.end()
using ll = long long;
const int LIGHT = 1;
const int BLOCK = -1;
const int BLANK = 0;
const int LIT = 2;
int main()
{
i... | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
int main() {
ll H,W,N,M;
cin>>H>>W>>N>>M;
vector<vector<ll>> vec(H,vector<ll> (W,0));
for(ll i=0;i<N;i++) {
ll A,B;
cin>>A>>B;
A--;
B--;
vec[A][B]=1;
}
for(ll i=0;i<M;i++) {
ll C,D;
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using pll = pair<ll, ll>;
using vpl = vector<pll>;
#define fi first
#define se second
#define pb push_back
#define mkp make_pair
#define mkt make_tuple
#define rep2(i, m, n) for... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
if (a + b >= 15 && b >= 8) cout << 1 << endl;
else if (a + b >= 10 && b >= 3) cout << 2 << endl;
else if (a + b >= 3) cout << 3 << endl;
else cout << 4 << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
void chmax(int& a, int b){
a = max(a, b);
}
int main(){
int H, W;
cin >> H >> W;
vector<string> S(H);
for(int i=0; i<H; i++) cin >> S[i];
vector<vector<int>> dp(H, vector<int>(W, -1e9));
dp[H-1][W-1] = 0;
for(int i=H-1; i>=0; i--) for(int ... | #include<bits/stdc++.h>
using namespace std;
const int N=2010;
int f[N][N];
int n,m;
int opt[N][N];
int main(){
scanf("%d%d",&n,&m);
char s;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++){
cin>>s;
if(s=='+')f[i][j]=1;
else f[i][j]=-1;
}
for(int i=n;i>=1;i--)
for(int j=m;j>=1;j--){
if(i+1>n&&j+1>m)continue;
... |
#include<bits/stdc++.h>
using namespace std;
int read() {
char c=getchar(); int x=0,f=1;
while (c<'0' || c>'9') {
if (c=='-') f=-1;
c=getchar();
}
while (c>='0' && c<='9') {
x=x*10+c-'0';
c=getchar();
}
return x*f;
}
int dp[200005][20];
char s[200005];
int N[200005],used[20];
const int p=1e9+7;
void add(i... | #include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
int main()
{
int n ,ans = 0;
scanf("%d",&n);
vector <int> a(n);
for(int&i : a){
scanf("%d",&i);
ans = (ans + 1LL*i*i%mod)%mod;
}
sort(a.begin() ,a.end());
int bef = a[0];
for(int i=1; i<n; i++){
... |
#include<ctime>
#include<cstdio>
#include<cctype>
#include<algorithm>
#define ll long long
using namespace std;
const ll N=2e5+7;
ll read() {
char c;
ll x=0,f=1;
while(!isdigit(c=getchar()))
f-=2*(c=='-');
while (isdigit(c)){
x=x*10+(c-48)*f;
c=getchar();
}
return x;
}
ll n,x,c,las,l[N],r[N],f[N][2];
int ma... | //ABC_197_E_
//
#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;
cin >> n;
vector<P> cx;
vector<ll> L = {0},R = {0};
rep(i,n)
{
int c,x;
... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
int main(){
int n;
cin >> n;
vector<double> dp(n+1,0.0);
for(int i = n-1; i >= 1; i--) dp[i] = dp[i+1] + (double)n/(double)(n-i);
printf("%.9lf\n",dp[1]);
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int T;
cin >> T;
while(T--){
ll n;
cin >> n;
if(n&1) cout <<"Odd\n";
else{
if(n%4 == 0) cout <<"Even\n";
else cout <<"Same\n";
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, k, n) for (int i = k; i < (int)(n); i++)
#define repd(i, n) for (int i = n-1; i >= 0; i--)
#define rrepd(i, k, n) for (int i = n-1; i >= (int)(k); i--)
#define all(x) (x).begin(),(x).end()
#define chmax(x,y... | #include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
typedef long long ll;
const int maxn=1e6+10;
#define mod 1000000007
int main(){
fast;
ll n,m; cin>>n>>m;
vector<vector<char>> a(n,vector<char>(m,' '));
vector<vector<ll>> b(n,vector<ll>(m,0));
for(auto ... |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define setIO(x) freopen(x".in", "r", stdin), freopen(x".out", "w", ... | #include <bits/stdc++.h>
using namespace std;
#define fr(i,n) for(int i = 0; i<n; i++)
#define sz(v) (int)(v.size())
#define prin(a) cout << #a << " = " << a << endl
#define prinv(v) cout << #v << " = "; for(auto it : v) cout << it << ", "; cout << endl
#define all(v) (v).begin(),(v).end()
typedef long long ll;
#def... |
/* これを翻訳している間、あなたはあなたの人生のいくつかの貴重な瞬間を無駄にしました */
#include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define S(x) (int)(x).size()
#define L(x) ... | #include <bits/stdc++.h>
using namespace std;
#ifndef aa
#define trace(...)
#define endl '\n'
#endif
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define fi first
#define se second
#define int long long
typedef long long ll;
typedef long double ld;
#define pii pair<int,int>
#define pdd pair<doubl... |
//wtrl,everybody hangbeat me
#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<sstre... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;
int main() {
int k;
string s, t;
cin >> k >> s >> t;
int p[10];
for (int i = 1; i <= 9; i++) {
p[i] = k;
}
f... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repp(i, st, en) for (ll i = (ll)st; i < (ll)(en); i++)
#define repm(i, st, en) for (ll i = (ll)st; i >= (ll)(en); i--)
#define all(v) v.begin(), v.end()
int m... | #include<bits/stdc++.h>
#include<stdio.h>
#define int long long
#define pb push_back
#define fo(i,a,n) for(int i=a;i<n;i++)
#define foo(i,a,n) for(int i=a;i>=n;i--)
#define sn s.length()
#define get(n) cin>>n
#define put(n) cout<<n
using namespace std;
signed main()
{
int t=1;
//cin>>t;
... |
#include <bits/stdc++.h>
#define pb push_back
#define SZ(x) ((int)(x.size()))
#define FOR(i,s,n) for (ll i = (s); (i) < (n); ++i)
#define FORD(i,s,l) for (ll i = (s); (i) >= l; --i)
#define F first
#define S second
#define TC int __tc; cin >> __tc; FOR(case_num,1,__tc+1)
#define TEST(x,i) ((x)&(1ll<<(i)))
#define SET(x... | #include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define ll long long
#define PI 3.1415926535897932384626
#define si(x) scanf("%d", &x)
#define sl(x) scanf("%lld", &x)
#define ss(s) scanf("%s", s)
#define pi(x) printf("%d\n", x)
#define pl(x) printf("%lld\n", x)
#define ps(s) printf("%s\n", s)
#... |
//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pint;
typedef pair<ll,ll> pll;
typedef pair<int,pint> ppint;
typedef pair<ll,pll> ppll;
typedef vector<int> vint;
typedef vector<ll> vll;
const double pi=3.141592653589793;
const int INF10 = 1000000001;
const ll INF15 = 1e15... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,l,r) for(i=(l);i<=(r);++i)
#define per(i,l,r) for(i=(l);i>=(r);--i)
#define REP(i,l,r) for(i=(l);i< (r);++i)
#define PER(i,l,r) for(i=(l);i> (r);--i)
typedef long long ll;
const int N=105;
struct man{
int a,b;
}A[N];
int D[N],F[N<<1];
int main(){
//freopen("a... |
#include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1e9+7;
void add(int64_t& a, int64_t b){
a = (a+b) % MOD;
}
void mul(int64_t& a, int64_t b){
a = a*b % MOD;
}
int64_t extgcd(int64_t a, int64_t b, int64_t& x, int64_t& y){
int64_t d = a;
if(b != 0){
d = extgcd(b, a%b, y, x);
... | /* stuff you should look for
* int overflow, array bounds, uppercase/lowercase
* special cases (n=1?)
* do sth. instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
*/
#include<cstdio>
const int mod=1e9+7;
int n,cnt,deg[105];
int h[105],to[20005],ver[20005];
struct matrix {
i... |
// Problem: A - Rock-paper-scissors
// Contest: AtCoder - AtCoder Beginner Contest 204
// URL: https://atcoder.jp/contests/abc204/tasks/abc204_a
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//code by: Ravi Khatri
#include<bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define vll vector<ll>
#define F f... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,x,y) for(int i=(int)(x);i<(int)(y);i++)
#define print(A,x,n) rep(i,0,n){cout<<(i ? " ":"")<<A[i]x;}cout<<endl;
#define pprint(A,y,m,n) rep(j,0,m){print(A[j],y,n);}
const long mod=1e9+7;
const int siz=3e5;
const int inf=1e9;
int main(){
int N,M; cin>>N>>M;
int... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,ans=1;
vector<ll> v[31];
int main(void){
v[2]={2};
v[3]={3};
v[4]={2};
v[5]={5};
v[6]={1};
v[7]={7};
v[8]={2};
v[9]={3};
v[10]={1};
v[11]={11};
v[12]={1};
v[13]={13};
v[14]={1};
v[15]={1};
... | #include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> count(31,0);
for(int i = 2; i <= n; i++) {
vector<int> counter(31,0);
int tmp = i;
for(int j = 2; j<= i; j++) {
if(tmp < j) break;
while(tmp % j == 0) {
counter[j] ++;
tmp /= j;
}
}
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
string s;
cin >> s;
if (s.size() <= 3) {
sort(s.begin(), s.end());
do {
if (stoi(s) % 8 == 0) {
cout << "Yes\n";
return 0;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << ((n % 2 == 0) ? "White" : "Black") << endl;
return 0;
} |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string S;
cin >> S;
int N = S.size();
vector<int> cnt(10);
rep(i, N) { ++cnt[S[i] - '0']; }
if (N >= 3) {
for (int i = 14; i * 8 <... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s;
cin >> s;
int n = s.length();
if (n == 1) {
if ((s[0] - '0') % 8 == 0)
cout << "Yes\n";
else
cout << "No\n";
return 0;
}
if (n ... |
#include <bits/stdc++.h>
using namespace std;
// #define LOCAL // 提出時はコメントアウト
#define DEBUG_
typedef long long ll;
const double EPS = 1e-9;
const ll INF = ((1LL<<62)-(1LL<<31));
typedef vector<ll> vecl;
typedef pair<ll, ll> pairl;
template<typename T> using uset = unordered_set<T>;
template<typename T, typename U> usi... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).begin(), (x).end()
#define fp(a,i,c) for(int (a) = (i); (a) < (c... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
#define LL long long
#define pii pair <int,int>
#define fi first
#define se second
#define pb push_back
#define mpr make_pair
using namespace std;
const LL MOD=1e9+7;
int n,m,dist[2010][2010],dx[4]={1,-1,0,0},dy[4... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int t;
// cin >> t;
t = 1;
while (t--)
{
int n, m;
cin >> n >> m;
char arr[n + 1][m + 1];
vector<vector<int>> vis(n + 1, vector<int>(m + 1, 0));
unordered_map<char, vector<pair<int, int>>> map;
... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll cnt[26];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin>>s;
s = '#' + s;
ll ans = 0;
int n = s.length();
cnt[s[n-1]-'a']++;
ll total = 1;
for(int i=n-2; i>=1; i--){
cnt[s[i]-'a']++;
total++;
if(s[i]==... | #include<bits/stdc++.h>
using namespace std;
#define SZ(v) ((int)(v).size())
#define zero(v) memset(v,0,sizeof(v))
#define rep(i,n) for(int i=0;i<(n);i++)
#define foreach(it,c) for(__typeof(c.begin()) it=c.begin();it!=c.end();it++)
#define all(v) (v).begin(),(v).end()
template<typename T>inline bool chkmin(T &a,const T... |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cassert>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define For(i, l, r) for (i = int64(l); i <= int64(r); i++)
#define Fo(i, n) For(i, 1, n)
#define Rof(i, r, l) for (i = int64(r); i >= int64... | #include <bits/stdc++.h>
#define fast ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define ll long long int
#define ld long double
using namespace std;
ll mod = 1000000007;
void solve()
{
ll n;
cin >> n;
if (n == 1)
{
cout << 0 << endl;
return;
}
cout << n - 1 << endl;
}
int m... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string T;
cin >> N >> T;
long long ans=10000000000;
if (N==1) {
if (T!="0") ans*=2;
}
else if (N==2) {
if (T=="00") ans=0;
else if (T=="01") ans--;
}
else if (N==3) {
if (T=="101" || T=="011") ans-... | #include <bits/stdc++.h>
using Int = long long; // clang-format off
#define REP_(i, a_, b_, a, b, ...) for (Int i = (a), lim##i = (b); i < lim##i; i++)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define RREP_(i, a_, b_, a, b, ...) for (Int i = Int(b) - 1, low##i = (a); i >= low##i; i--)
#def... |
#include <bits/stdc++.h>
typedef long long LL;
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define RALL(X) (X).rbegin(), (X).rend()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define RI(X) scanf("%d", &(X))
#define RII(X, Y) scanf("%d%... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll x, ll y){
if(x%y == 0){
return y;
}else{
return gcd(y, x%y);
}
}
int main(){
int N; cin >> N;
int ans;
for(int i=0; i<N; i++){
int a; cin >> a;
if(i==0){
ans = a;
}else{
ans = gcd(ans, a);
}
}
cout << ans << endl;
... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define f(i,l,n) for(int i=l;i<n;i++)
#define E "\n"
#define fast ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define F first
#define S second
#define all(c) (c).begin(),(c).end()
#define sz(v) (int)(v).size()
#define vi(typ) vector<typ>
#de... | #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 <iostream>
using namespace std;
const int INF = 10000000;
int d[2005][2005];
int main()
{
int h, w;
cin >> h >> w;
string a[2005];
for(int i = 0; i < h; i++) cin >> a[i];
for(int i = 0; i < h; i++){
for(int j = 0; j < w; j++){
if((i + j) % 2) d[i][j] = INF;
... | #pragma region head
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using pi = pair<int, int>;
using pll = pair<ll, ll>;
template <class T>
using vv = vector<vector<T>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (in... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i = 1; i < (int)(n+1); ++i)
const long long INF = 1LL<<60;
const int MAX = 510000;
const long long MOD = 9982443... | // D - Opposite
#include <bits/stdc++.h>
using namespace std;
using C = complex<double>;
C in(){ double r,i; cin>>r>>i; return C(r,i); }
int main(){
int n; cin>>n;
C p0 = in(), ph = in();
C o = (p0 + ph) / 2.0;
double PI = acos(-1), t = PI*2/n;
C r(cos(t), sin(t));
C ans = (p0 - o)*r + o;
cout<<setprecision(11)... |
#include<bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
cout << s.at(1) << s.at(2) << s.at(0) << endl;
}
| /*
このコード、と～おれ!
Be accepted!
∧＿∧
（｡･ω･｡)つ━☆・*。
⊂ ノ ・゜+.
しーＪ °。+ *´¨)
.· ´¸.·*´¨) ¸.·*¨)
(¸.·´ (¸.·'* ☆
*/
#include <cstdio>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstring>
#include <vector>
#include <numeric>
#include <iostream>
#include <random>
#include <map... |
#include<bits/stdc++.h>
#define ll long long
#define dbg(x) cout<<#x<<": "<<x<<endl;
#define N 300005
#define M 1000000007
#define pii pair<ll,ll>
#define fast ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
main()
{
string s;
cin>>s;
bool f=1;
for(int i=0;i<s.size();i++)
{
if(... | /**
* created: 08.11.2020 21:02:19
**/
#ifdef _LOCAL_
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// #include <boost/math/tools/minima.hpp>
// #include <boost/range/irange.hpp>
using namespace std;
#define int long long
#define name(x) #x
#define dump(x) cout <<... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int h, w, a, b;
//vector<vector<vector<int>>>dp;
int calc(int x, int y, int rem_a, int rem_b, int mask){
if(x==h && y==0) return mask==0 && rem_a==0 && rem_b==0;
if(y==w) return calc(x+1, 0, rem_a, rem_b, mask);
//if(x==h) cout << y <<... | #include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define pf push_front
#define sz(x) (int)(x).size()
#define lb lower_bound
#define ub upper_bound
#define mp make_pair
#define fi first
#define se second
#define setbits(x) __builtin_popcount(x)
#define zerobits(x)... |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
#include <bitset>
using namespace std;
typedef lon... | // YATIN KWATRA
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize ("Ofast")
#define ll long long
#define ar array
#define sz(v) (int)(v.size())
#define inf ... |
#include<bits/stdc++.h>
using namespace std;
int N, L, A[100010], B[100010];
long long ans;
vector<int> E;
bool seen[100010], added[100010];
int main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> N >> L;
A[0] = 0; B[0] = 0;
A[N+1] = L+1; B[N+1] = L+1;
for(int i = 1; i <= N; i++) cin >> A[i]; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#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 REP(i, n) FOR(i, 0, (n)-1)
#define sqr(x) ((x) * (x))
#define all(x) (x).begin(), (x).end()
#de... |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <numeric>
#include <queue>
using namespace std;
int64_t min(int64_t a,int64_t b) {
if (a > b)
{
return b ;
}else
{
return a ;
}
}
int64_t gcd(int64_t a,int64_t b){
if(a < b)
... | #include <iostream>
#include <iomanip>
#include <vector>
#include <cmath>
#include <algorithm>
#include <deque>
#include <set>
#include <limits>
#include <string>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <numeric>
#include <bitset>
using namespace std;
using ll = long l... |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
for(int i = (int)s.length() - 1; i >= 0; i--) {
if(s[i] == '6') {
cout << "9";
}
else if(s[i] == '9') {
... | #include <bits/stdc++.h>
using namespace std;
int main(){
string a,b;
char c;
b = "";
a = "";
cin >> a;
int d = a.size();
for(int i = 0;i<d;i++){
c = a.at(i);
if(c == '0'){b += '0';}
if(c == '1'){b += '1';}
if(c == '6'){b += '9';}
if(c == '8'){b += '8';}
if(c == '9'){b += '6';}
}
for(int ... |
#define _DEBUG
//ヘッダー
#include<bits/stdc++.h>
using namespace std;
//型定義
typedef long long ll;
//定数
const ll INF=1e+18;
const int MOD=1e+9+7;
//デバッグ
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x
#define debug1(x1) cout<<#x1<<": "<<x1<<endl
#define debug2(x1,x2) cout<<#x1<<": "<<x1<<", "#x2<<": ... | #include<bits/stdc++.h>
using namespace std;
using u64 = uint_fast64_t;
using u32 = uint_least32_t;
using u16 = uint_least16_t;
using u8 = uint_least8_t;
int main(void) {
u32 mod = 1000000007;
u16 H, W;
cin >> H >> W;
u32 dp;
vector<u32> vdp(W);
u32 hdp;
vector<u32> ddp(W);
for(u16 i=0; i<H; ++i) {
u32 t... |
#include <bits/stdc++.h>
#define REP(i, n) for(ll i = 0; i < (n); i++)
#define REP1(i, n) for(ll i = 1; i <= (n); i++)
#define REPD(i,a,b) for (ll i=(a);i<=(b);i++)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
typedef double d;
typedef long double ld;
typedef vector<string> vs;
typed... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n; cin>>n;
vector<ll>v1,v2;
while(n)
{
v1.push_back(n%10);
n/=10;
}
int n1=v1.size(); ll sum=0;
for(auto it:v1)
{
sum+=it;
if(it%3!=0)
v2.push_back(it);
}
... |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define mod 1000000007
#define ad(a,b) a=(a+b)%mod;
ll po(ll x,ll y){
ll res=1;
for(;y;y>>=... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,p;
string s;
vector<char> v;
char c;
cin>>n>>s;
for(int i=0;i<n;i++){
v.push_back(s[i]);
p=v.size();
if(p>2){
if(v[p-3]=='f'&&v[p-2]=='o'&&v[p-1]=='x'){
for(int j=0;j<3;j++){
v.pop_back();
}
}
... |
#include <iostream>
#include <algorithm>
#include <queue>
#include <string>
#include <limits>
#include <cstring>
#define int long long
int const INF = std::numeric_limits<int>::max();
int const NINF = std::numeric_limits<int>::min();
int const N = 50;
int const M = N;
struct Obj {
int weight;
int value;
bool opera... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
const int INF = int (1e9) + int (1e5);
const ll INFL = ll(2e18) + ll(1e10);
const ui MOD = 1E9 ... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define N 500005
#define INF 0x3f3f3f3f
int n,cs=0,ct=0,ps[N],pt[N];
char s[N],t[N];
ll ans=0;
int main(){
//freopen("b.in","r",stdin);
//freopen("b.out","w",stdout);
scanf("%d%s%s",&n,s,t);
for(int i=0;i<n;++i){
if(s[i]=='1') ps[++cs]=i;
if(t[... | #include <bits/stdc++.h>
#define LL long long
using namespace std;
int k, ans;
string s;
bool C(int x) {
bool b[10] = {};
b[x % 10] = b[x / 10 % 10] = b[x / 100 % 10] = b[x / 1000] = true;
for (int i = 0; i <= 9; i++) {
if (s[i] == 'o' && !b[i] || s[i] == 'x' && b[i]) {
return false;
}
}
retu... |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<char> vc;
typedef queue<ll> ql;
typedef deque<ll> dql;
typedef priority_queue<ll> pql;
typedef set<ll> sl;
typedef pair<ll, ll> pl;
ty... | #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 fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<... |
#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> data(n, vector<int>(3));
for (int i = 0; i < n; i++) {
for (int j = 0; j < 3; j++) {
cin >> data.at(i).at(j);
}
}
int res = -1;
int price = data.at(... | #include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >>N;
vector<long long>A(N);
vector<long long>P(N);
vector<long long>X(N);
vector<long long>l(N);
for(int i = 0;i<N;i++){
cin>>A[i]>>P[i]>>X[i];
}
for(int i = 0;i<N;i++){
if(A[i] < X[i]){
l[i] = P[i];
}
else{
l[i] = 1000000001;
}
}... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int V,T,S,D;
cin >> V >> T >> S >> D;
if(D < V*T || D > V*S ){
cout << "Yes" << endl;
}
else{
cout << "No" << endl;
}
} | #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;
template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define oset_find(k) find_by_order(k)
#define oset_o... |
#include <bits/stdc++.h>
using namespace std;
#define rng(x) x.begin(), x.end()
#define maxi(x, y) x = max(x, (y))
#define mini(x, y) x = min(x, (y))
#define pb push_back
#define F first
#define S second
#define el '\n'
#define int long long
#define SZ(x) ((int)(x).size())
template<typename T>
istream&operator>>(ist... | #include <iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
#include<map>
#include<queue>
#include<set>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i,n) for(int i = 1;i <= n; i++)
#define rrep(i,n) for(ll i = n-1;i >= 0;i--)
#define ALL(obj) beg... |
#include <iostream>
#include <cstring>
#include <vector>
#include <algorithm>
#include <map>
#define endl '\n'
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll INF=1e10+1;
int main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
//freopen("input... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()
template<typename A, size_t N, typename T>
void... |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long ll;
using namespace std;
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
int cnt = 0;
ll miz = a, red = 0;
while (miz > red * d && cnt <= 1e9) {
miz += b;
red += c;
cnt++;
}
... | #include <bits/stdc++.h>
#define int long long
#define Nanase_Kurumi_aka_menhera_chan_is_mine ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define pi pair<int, int>
#define BE(i) i.begin(),i.end()
#define fi first
#define se second
#define INF 2147483647
#define mkp make_pair
#define ist ins... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main() {
string a,b;
cin>>a>>b;
int sa=0,sb=0;
rep(i,a.size()) sa+=a[i]-'0';
rep(i,b.size()) sb+=... | #include <bits/stdc++.h>
using namespace std;
int main(){
int a, b;
cin >> a >> b;
int ans = 4;
a += b;
if(15 <= a && 8 <= b)ans = 1;
else if(10 <= a && 3 <= b)ans = 2;
else if(3 <= a)ans = 3;
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
using ll = long long;
template<typename T> bool chmax(T &a, const T b) {
if (a < b) {a = b; return true;} else return false; }
template<typename T> bool chmin(T &a, const T b) {
if (a > b) {a = b; return true;} else return false; }
int m... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 1e9
#define linf 1e18
#define BASE 1000000
#define EPS 1e-10
#define PI acos(-1)
#define pii pair<int,int>
#define piii pair<int, pair<int,int>>
#define pli pair<long long, int>
#define pll pair<long long, long long>
#define pdi pair<doubl... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(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(),a.rend()
#define isin(x,l,r) ((l) <= (x) &&... | #include <iostream>
#include <vector>
//#include <string>
//#include <algorithm>
//#include <math.h>
//#include <queue>
//#include <stack>
//#include <iomanip>
// sometimes used
//#include <set>
//#include <map>
//#include <numeric>
//#include <list>
//#include <deque>
//#include <unordered_map>
typedef long long L... |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
#define inf 1e9+18
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define mod 998244353
#define f1(i,n) for(i=1;i<=n;i++)
#define f0(i,n) for(i=0;i<n;i++)
#define w(x) while(x--)
const int maxn=2000... | #include<bits/stdc++.h>
using namespace std;
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
/* // Ordered Set
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T>
typedef tree<T, null_typ... |
// clang-format off
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define mp make_pair
#define fst first
#define snd second
#define forn(i,n) for (int i = 0; i < int(n); i++)
#define forn1(i,n) for (int i = 1; i <= int(n); i++)
#define popcnt __builtin_popcountl... | #include <bits/stdc++.h>
using namespace std;
int n, m, k;
vector<long long> a, nxt;
long double solve();
bool check(long double e);
int main() {
cin >> n >> m >> k;
a.resize(k);
for (auto &p : a) cin >> p;
cout << fixed << setprecision(10);
auto res = solve();
if (res < 0)
cout << "-1" << endl;
el... |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0; i<(n);++i)
using ll = long long;
int main(){
double X,Y,Z,ans;
double price_per_gram;
cin >> X >> Y >> Z;
ans = 1000001.0;
price_per_gram = (double) (Y/X);
while (1){
if((double)(ans/Z)>=price_per_gram){
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,s,t) for(int i = (int)(s); i < (int)(t); i++)
using p = pair<int,int>;
ll func(int n, int k){
return max(0, min(k - 1, 2*n + 1 - k));
}
int main(){
int n,k;
cin >> n >> k;
ll ans = 0;
rep(i,2,2*n+1){
ans += fu... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int x,y;
cin>>x>>y;
cout<<(x+y)/2<<' '<<(x-y)/2<<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#include <map>
typedef long long ll;
#define REP(i, n) for(ll i = 0; i < n; i++)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOR(i, m, n) for(ll i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using Graph = vector<vector... |
#pragma region
#include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, l, r) for(size_t i = (l); i < (r); ++i)
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = (n)-1; i >= 0; --i)
#define ull unsigned long long
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
string n;
int k;
cin>>n>>k;
string s{n},r{};
for(int i=0;i<k;i++)
{
sort(s.begin(),s.end());
r=s;
reverse(r.begin(),r.end());
s=to_string(stoi(r)-stoi(s));
... |
#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 <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define chmin(x,y) x = min((x),(y))
#define chmax(x,y) x = max((x),(y))
#define popcount(x) __builtin_popcount(x)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
const int INF = 1e9;
const ... |
#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);
long double X,Y,R; cin >> X >> Y >> R;
R = nextafter(R, INFINITY);
ll ans = 0;
for(ll x = ceil(X - R); x <= floor(X + R); x++){
... | #include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include<bits/stdc++.h>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define pf ... |
#include <bits/stdc++.h>
#include <iomanip>
#define M 100005
#define MAX 100000000000000001
#define MIN -10000000000000000
#define mod 1000000007
#define ss second
#define ff first
#define ll long long int
#define pb push_back
#define ld long double
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL)
using name... |
// Problem: D - increment of coins
// Contest: AtCoder - AtCoder Beginner Contest 184
// URL: https://atcoder.jp/contests/abc184/tasks/abc184_d
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#define int long long
#define max3(a,b... |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define pb push_back
#define f(i,n) for(int i=0; i<n; ++i)
#define fi(i,st,n) for(int i=st; i<=n; ++i)
#define veci vector<int>
#define vecp vector<pair<int,int> >
#define vecl vector<ll>
int prime[100000+10];
ll lcm(ll ... | #include<iostream>
#include<string>
#include<iomanip>
#include<set>
#include<queue>
#include<cmath>
#include<algorithm>
#include<vector>
#include<limits.h>
#include<math.h>
#include<map>
#include<cstring>
using ll = long long;
int main(){
std::ios_base::sync_with_stdio(0);
std::cin.tie(0);
int n;
std::cin >> n;
s... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include <boost/multiprecision/cpp_ll.hpp>
//typedef boost::multiprecision::cpp_ll ll;
typedef long double dd;
#define i_7 (ll)(1E9+7)
//#define i_7 998244353
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
return c+i_7;
}
t... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
using uint=unsigned int;
using ull=unsigned long long;
const ll LL_MAX=LLONG_MAX;
class union_find{
private:
vector<ll> par;
vector<ll> siz;
public:
union_find(ll n) : par(n),siz(n,1LL){
for (ll i=0;i<n;i++) par[i]=i;
}
ll root(ll x)... |
#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
#define type(x) ((siz[x] & 1) ? 2 : (f[x] <= (siz[x] - f[x]) ? 1 : 3))
const int maxn = 1e5 + 50;
int n,x,last[maxn],siz[maxn],f[maxn],p[maxn];
struct Edge{
int v,nxt;
}e[maxn];
int read(){
int x = 0;
char c = getchar();
while(c < '0' |... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
const int MOD = 998244353, N = 2e5 + 5;
int two[N];
int add(int x, int y)
{
x += y;
while (x >= MOD)
x -= MOD;
while (x < 0)
x += MOD;
return x;
}
int mul(int x, int y)
{
return (x * 1ll * y) ... |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
int n;
cin >> n;
vector<vector<ll>> c(n, vector<ll>(n));
vector<ll> a(n), b(n)... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
using ld = long double;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vpii = vector<pii>;
using vpll =... |
#include <bits/stdc++.h>
#include <map>
#include <algorithm>
#include <vector>
#include <string.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <chrono>
#include <thread>
#include <string.h>
#define rep(i,n) for(ll i=0;i<n;i++)
#define repu(i,k,n) for(ll i=k;i<=n;i++)
#define repd(i,k,n) for(ll... | #include <bits/stdc++.h>
#ifdef LILY
#include "Debug.h"
#else
#define var(...) (0)
#define dbg(...) (0)
#endif
using int32 = int;
using int64 = long long;
using namespace std;
class Solution
{
#define int int64
#define sfor(i, n) for (int i = 1; i <= (n); ++i)
#define tfor(i, n) for (int i = 0; i < (n); ++i)
#define I... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define all(c) (c).begin(),(c).end()
#define endl "\n"
#define ff first
#define ss second
#define allr(c) (c).rbegin(),(c).ren... | #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 <iostream>
#include <stdint.h>
using namespace std;
int main()
{
long long minn = 1e18+1;
long long n;
cin>>n;
for(uint64_t b = 0;(uint64_t)(1ULL<<b) <= n;b++)
{
// cout<<b<<" ";
uint64_t second = (1ULL<<b);
long long a = n / second;
long long c = n % (a*second);
if(a+b+c<minn) minn = a + b + c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<pll> vpll;
typedef vector<vpll> vvpll;
typedef vector<bool> vbl;
typedef vector<vector<bool>> vvbl;
void INX(){}
template<typenam... |
/**
▂▃▅▇█▓▒░۩۞۩ ۩۞۩░▒▓█▇▅▃▂
In the name of Allah
_ _
/ / \ \
/ / _ _ _ \ \
< < (_) (_) (_) > >
\ \ / /
\_\ /_/
Nerede Gitsen Çukur Orda
**/
#include<bits/stdc++.h>
#include<fstream>
///#include<conio.h>
///#include "windows.h"
#define ll l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
string s; cin>>s;
int n = s.length();
string ans = "Yes";
for(int i=0; i<n; i++){
if... |
#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... | // include
#include <algorithm>
#include <complex>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
//型短縮
#define ll long long
//マクロ定義
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, M, T;
cin >> N >> M >> T;
int originN = N;
int A = 0, B = 0;
bool flag... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define ... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
// template {{{ 0
// using {{{ 1
using ll = long long int;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<pii>;
using vll = vector<pll>;
// }}} 1
// definition {{{ 1
// scaning... |
#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 <cassert>
#in... | #include <bits/stdc++.h>
using namespace std;
#define FasterIO ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ll long long
#define ff first
#define ss second
#define pi pair<int, int>
const int MX=1e3+10;
const ll mod=1e9+7;
int d[MX][MX], vis[MX][MX], ad[MX][MX];
vector<int>g[MX][26];
void bfs(i... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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++)
int main() {
ll A, B;
cin >> A >> B;
ll N = 2 * A + 100 - B;
if(N < 0) {
N = 0;
}
cout << N;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int A,B;
cin>>A>>B;
int follow = 2 * A + 100;
cout<<follow - B<<endl;
return 0;
} |
//Author : Krishan Kant Agnihotri
#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;
//ordered_set
template<class T> using oset =tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update> ;
#defi... | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <set>
#include <queue>
#include <cmath>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<vector<long long>> vvll;
typedef pair<int,int> pi... |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define pb push_back
#define vi vector<int>
#define all(a) (a).begin(),(a).end()
#define F first
#define S second
#define endl "\n"
#define fast i... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main(){
int a,b;
cin>>a>>b;
cout<<(a+a+100)-b;
} |
#include<bits/stdc++.h>
#define int long long
using namespace std;
using ld=long double;
signed main(){
int N; cin>>N;
if(N==1)return puts("Yes"),0;
vector<int> A(N),B(N),C(N),D(N);
for(int i=0;i<N;i++)cin>>A[i]>>B[i];
for(int i=0;i<N;i++)cin>>C[i]>>D[i];
for(int i=0;i<N;i++){
vector<pair<ld,ld>> v1,v2;... | #include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
typedef long long ll;
typedef std::pair<ll, ll> pll;
const ll INF = (1LL << 60);
struct segtree {
int i, j;
ll val;
segtree *l, *r;
segtree(std::vector<pll> &ar, int _i, int _j) : i(_i), j(_j) {
if (i == j) {
val = ar[i].s... |
// Etavioxy
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#define il inline
#define ll long long
#define rep(i,s,t) for(register int i=(s);i<=(t);i++)
#define rev_rep(i,s,t) for(register int i=(s);i>=(t);i--)
#define each(i,u) for(int i=head[... | #include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const double EPS = 0.0000001;
struct point{
double x, y;
point(){
}
point(double x, double y): x(x), y(y){
}
point operator +(point P){
return point(x + P.x, y + P.y);
}
point operator -(point P){
return point(x - P.x, y -... |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fore(b,c) for(int val0=b;val0<c;val0++)
#define forr(k,c,s) for(int k=c;k<s;k++)
#define pb push_back
#define mmp make_pair
#define oset(T) tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_updat... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define task "asd"
#define pll pair<ll, ll>
#define pii pair<pll, ll>
#define fi first
#define se second
using namespace std;
const ll mod = 1e15+7;
const ll N = 2e5+5;
const int base = 313;
ll n, m, t, k, T, ans, siz, tong, a[N], b[N], d[N], c[N], h[N... |
#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
ll power(ll a, ll b) { //a^b
ll res = 1;
a = a % MOD;... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#include <set>
using namespace std;
// typdef
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPD(i, n) for (int i = n - 1; i > 0; i--)
#define FOR(... |
/*
Author:Atul Pandey
*/
#include <bits/stdc++.h>
typedef long long int ll;
#define pll pair <ll, ll>
#define pii pair <int, int>
#define f first
#define s second
#define pb push_back
#define vll vector <ll>
#define mll map <ll ,ll>
#define prtq priority_queue <long long>
#define all(c) c.begin(), c.end()
#define rep(a... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define SPEED ios_base::sync_with_stdio(false); cin.tie(NULL);
#define FOR(i, a, b) for (ll i = a; i < b; ++i)
#define RFOR(i, b, a) for (ll i = b; i >= a; --i)
#define ALL(x) x.begin(), x.end()
#define DEBUG(args...)... |
#include<bits/stdc++.h>
#define ll unsigned long long
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
using namespace std;
const int N=2e5+10;
const double eps=1e-8;
bool ban[N];
double k[N],b[N];
int main()
{
int n,m,K;
scanf("%d%d%d",&n,&m,&K);
for(in... | #pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
// #include<boost/multiprecision/cpp_int.hpp>
// nam... |
#include <bits/stdc++.h>
//#include <atcoder/all>
#include <unordered_map>
using namespace std;
//using namespace atcoder;
typedef long long ll;
typedef unsigned long long ull;
using P = pair<ll, ll>;
using V = vector<ll>;
using VV = vector<V>;
using SV = vector<string>;
#define rep(i, n) for(ll i=0;i<(ll)(n);i++)
#d... | #include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>... |
#include<bits/stdc++.h>
#define ll long long
#define re register
#define INF 2147483647
using namespace std;
inline int read()
{
int f=1,x=0;char s=getchar();
while(s<'0'||s>'9')
{
if(s=='-') f=-1;
s=getchar();
}
while(s>='0'&&s<='9')
{
x=x*10+s-48;
s=getchar();
}
return f*x;
}
int gcd(int a,int b)
{
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i,n,m) for(int i=(n);i<(m);i++)
#define REP(i,n) for(int i=0;i<(n);i++)
#define REPR(i,n) for(int i=(n);i>=0;i--)
#define all(vec) vec.begin(),vec.end()
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
us... |
#include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define ff first
#define ss second
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int oo = 1e9 +100;
const int maxn = 1e5+10;
int main(){
int n, m;
cin >> n >> m;
... | #include <bits/stdc++.h>
using namespace std;
#define f0r(a, b) for (long long a = 0; a < b; a++)
#define f1r(a, b, c) for (long long a = b; a < c; a++)
#define f0rd(a, b) for (long long a = b; a >= 0; a--)
#define f1rd(a, b, c) for (long long a = b; a >= c; a--)
#define ms(arr, v) memset(arr, v, sizeof(arr))
#define... |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 1e5 + 5;
inline int read()
{
int w = 0, f = 1;
char ch = getchar();
while (ch < '0' or ch > '9')
{
if (ch == '-')
f = -f;
ch = getchar();
}
while (ch >= '0' and ch <= '9')
w =... | #include <bits/stdc++.h>
using namespace std;
#define int long long
void read (int &x) {
char ch = getchar(); int f = 0; x = 0;
while (!isdigit(ch)) { if (ch == '-') f = 1; ch = getchar(); }
while (isdigit(ch)) x = x * 10 + ch - 48, ch = getchar(); if (f) x = -x;
} const int N = 2020, mod = 1e9 + 7;
int n, ... |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, x, y;
cin >> a >> b >> x >> y;
if (a<=b){
cout << min(x+(b-a)*y, (b-a)*2*x+x) << endl;
return 0;
}
else{
cout << min(x+(a-b-1)*y, (a-b-1)*2*x+x) << endl;
return 0;
}
} | #include <bits/stdc++.h>
#define PB push_back
#define MP std::make_pair
#define FI first
#define SE second
typedef long long ll;
typedef long double ld;
typedef std::pair <int, int> pii;
const int mod = 998244353;
int n, K;
ll ans;
int read() {
char c = getchar(); int ans = 0;
while (c < '0' || c > '9') c = getchar()... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
string s, ans;
int x[n];
map<string, int> mp;
for(int i = 0; i < n; i++){
cin >> s;
cin >> x[i];
mp[s] = x[i];
}
sort(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
for(int i=0; i<n; i++){
cin >> a.at(i);
b.at(i) = i+1;
}
sort(a.begin(), a.end());
int x = 1;
for(int i=0; i<n; i++){
if(a.at(i) != b.at(i)){
x = 0;
}
}
if(x == 1... |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define faster ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define read freopen("in.txt", "r", stdin)
#define write freopen("out.txt", "w", stdout)
#define mem(x, n) memset(x, n,... | #include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
using P = pair<ll, ll>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, -1, 0, 1};
string char_to_string(char val) {
return string(1, val);
}
int ... |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std... | #include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
using namespace std;
const int N = 20 + 5;
typedef long long LL;
struct Edge
{
int to, nxt;
}line[N * N * 2];
int fist[N], idx;
int n, m;
LL ans = 1;
bool vis[N];
int col[N];
vector<int> v;
void add(int x, int y)
{
line[idx] ... |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a; i < n; i++) //iをaからn
#define per(i, n, a) for (int i = a - 1; i >= n; i--) //iをnからa
#define db(x) cout << #x << " = " << x << endl
#define db2(x, y) cout << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")\n"; //デバッグ用
#def... | #include<bits/stdc++.h>
using namespace std;
typedef int64_t ll;
typedef long double ld;
const ll MOD=1000000007;
const ll MODA=998244353;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
long long gcd(long long a,long long b){
ll gcdmax=max(a,b);
ll gcdmin=min(a,b);
while(true){
if(gcdmax%gcdmin==0)break... |
#include <bits/stdc++.h>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
#define me0(a) memset(a,0,sizeof(a))
#define me1(a) memset(a,-1,sizeof(a))
#define op freopen("in.txt", "r", stdin)
#define pii pair<int,int>
#define Please return
#define AC 0
using namespace std;
const int INF = ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll sizeofS = 30000000000;
int main() {
int n;
cin >> n;
string t;
cin >> t;
ll ans;
if (t == "1") {
ans = sizeofS * 2 / 3;
} else if ... |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(v) v.begin(), v.end()
template<class T>bool chmax(T& a, const T& b) { if (a<b) { a=b; return 1;} return 0;}
template<class T>bool chmin(T& a, const T& b) { if (b<a)... | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
ll mod=1000000007;
int main(){
vector<string> S(3);
for(int i=0;i<3;i++){
cin >> S[i];
}
map<char,ll> P;
for(int i=0;i<3;i++){
ll X=1;
if(i==2){
X=-1;
}
for(int j=S[i].size()-1;j>-1... |
#include <bits/stdc++.h>
using namespace std;
long long divceil(long long a, long long b) {
if(a % b == 0) return a / b;
return a / b + 1;
}
int main(void) {
long long N, M;
cin >> N >> M;
if(M == 0) {
cout << "1\n";
return 0;
}
vector<long long> A;
for(int i = 0; i < M; ++i) {
long long a;
cin >> a... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define cvector vector<char>
#define svector vector<string>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll,lvector,greater<ll>>
#define P pair<ll,ll>
#define ALL(a) a.begin(),a.end()
#d... |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <climits>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(... | // CPP code for Longest Palindromic substring
// using Palindromic Tree data structure
#include <bits/stdc++.h>
using namespace std;
#define fl(n) for(long long int i=0;i<n;i++)
#define sz(a) int((a).size())
#define tr(c,i) for(auto i = (c).begin(); i != (c).end(); i++)
#define trr(c,... |
// #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <bits/stdc++.h>
#define ll long long int
#define vi vector<int>
#define vvi vector<vector<int>>
#define vll vector<long long>
#define vs vector<string>
#define vc vector<char>
#de... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll MOD = 1000000007;
ll add(ll a, ll b){
return (a+b)%MOD;
}
ll mul(ll a, ll b){
return (a*b)%MOD;
}
const ll MAXN = 3000;
ll dpp[MAXN+5];
ll dp[MAXN+5];
ll ima[MAXN+5];
ll a[MAXN+5];
int main(){
ios_ba... |
#include<bits/stdc++.h>
using namespace std;
#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 length size()
#define int long long
#define ll long long
#include <cstdint>
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << end... |
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<int>data(3);
for(int i=0;i<3;i++){
cin>>data[i];
}
sort(data.begin(),data.end());
if(data[0]-data[1]==data[1]-data[2]){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
} | #include<stdio.h>
#define Swap(a,b) do{typeof(a) T=(a);a=b;b=T;}while(0)
static inline int Min(int a,int b){return a<b?a:b;}
static inline int IN(void)
{
int x=0,f=1,c=getchar();while(c<48||c>57){if(c==45){f=-f;}c=getchar();}
while(c>47&&c<58){x=x*10+c-48,c=getchar();}return f*x;
}
int main(void)
{
int A=IN(),B=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 Q = tuple<int,int,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';
r... | #include <iostream>
#include <vector>
#include <cmath>
#include <iomanip>
#include <algorithm>
#include <queue>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(x) (x).begin(), (x).end()
int main() {
int n,ans,cnt=0;
cin>>n;
string s;
cin>>s;
if(s[0]!=s[n-1])ans=1;
els... |
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
long long int manhd = 0;
long long eud = 0;
long long int chebd = 0;
while(n--){
long long x;
cin>>x;
x = abs(x);
manhd += x;
eud += (x*x);
chebd = max(chebd, x);
}
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.