code_file1
stringlengths 87
4k
| code_file2
stringlengths 82
4k
|
|---|---|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pll;
typedef vector<pll> vpll;
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define fr(i,n) for(ll i = 0; i < n; ++i)
#define frs(i,s,n) for(ll i = s; i < n; ++i)
#define frb(i,s,e) for(ll i = s; i <= e; ++i)
#define rfr(i,n) for(ll i = n-1; i >= 0; i--)
#define frbr(i,e,s) for(ll i = e; i >= s; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
#ifdef LOCAL
#include <debugger.h>
#else
#define dbg(x...) {}
#define dbg_arr(a,n) {}
#define dbg_mat(m,r,c) {}
#define dbg_time() {}
#endif
const ll MOD = 1e9+7; // 998244353;
const ll INF = 1e18;
const ll MAX = 100100;
void pre()
{
// factorizer::sieve();
// prepare_factorials();
}
void solve()
{
ll a, b; cin >> a >> b;
ll s1 = 0, s2 = 0;
while(a > 0)
{
s1 += (a % 10);
a /= 10;
}
while(b > 0)
{
s2 += (b % 10);
b /= 10;
}
cout << max(s1, s2) << "\n";
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
// cout << fixed << setprecision(15);
pre();
ll _t = 1;
// cin >> _t;
frb(CASE, 1, _t)
{
// cout << "Case #" << CASE << ": ";
// dbg(CASE);
solve();
}
dbg_time();
return 0;
}
| #include <bits/stdc++.h>
using ll = long long;
using namespace std;
int sum(int d)
{
int sum = 0;
while (d > 0)
{
sum += d % 10;
d /= 10;
}
return sum;
}
void solve()
{
int a, b;
cin >> a >> b;
cout << max(sum(a), sum(b)) << endl;
}
int main()
{
int t = 1;
//cin >> t;
while (t--)
{
solve();
}
return 0;
}
|
#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <vector>
#include <complex>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <iterator>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <regex>
#include <limits>
#include <time.h>
#include <cstdint>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <limits.h>
using namespace std;
using pii = pair<int,int>;
using ll=long long;
using ld=long double;
#define pb push_back
#define mp make_pair
#define sc second
#define fr first
#define stpr setprecision
#define cYES cout<<"YES"<<endl
#define cNO cout<<"NO"<<endl
#define cYes cout<<"Yes"<<endl
#define cNo cout<<"No"<<endl
#define rep(i,n) for(ll i=0;i<(n);++i)
#define Rep(i,a,b) for(ll i=(a);i<(b);++i)
#define rrep(i,n) for(ll i=n-1;i>=0;i--)
#define rRep(i,a,b) for(ll i=a;i>=b;i--)
#define crep(i) for(char i='a';i<='z';++i)
#define psortsecond(A,N) sort(A,A+N,[](const pii &a, const pii &b){return a.second<b.second;});
#define ALL(x) (x).begin(),(x).end()
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define endl '\n'
int ctoi(const char c){
if('0' <= c && c <= '9') return (c-'0');
return -1;
}
ll gcd(ll a,ll b){return (b == 0 ? a : gcd(b, a%b));}
ll lcm(ll a,ll b){return a*b/gcd(a,b);}
constexpr ll MOD=1000000007;
constexpr ll INF=1000000011;
constexpr ll MOD2=998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS=10e-8;
template <class T, class U> inline bool chmax(T& lhs, const U& rhs) { if (lhs < rhs) { lhs = rhs; return 1; } return 0; }
template <class T, class U> inline bool chmin(T& lhs, const U& rhs) { if (lhs > rhs) { lhs = rhs; return 1; } return 0; }
template<typename T> istream& operator>>(istream& is,vector<T>& v){for(auto&& x:v)is >> x;return is;}
template<typename T,typename U> istream& operator>>(istream& is, pair<T,U>& p){ is >> p.first; is >> p.second; return is;}
template<typename T,typename U> ostream& operator>>(ostream& os, const pair<T,U>& p){ os << p.first << ' ' << p.second; return os;}
template<class T> ostream& operator<<(ostream& os, vector<T>& v){
for(auto i=begin(v); i != end(v); ++i){
if(i !=begin(v)) os << ' ';
os << *i;
}
return os;
}
int main(){
ll T;cin >> T;
rep(QQQ,T){
ll N;cin >> N;
map<ll,ll> M;
rep(i,N){
ll X;cin >> X;
M[X]++;
}
if(N%2==1){
cout << "Second" << endl;
continue;
}
ll Z=0;
for (auto P : M){
if(P.sc%2==1){
Z=1;
}
}
if(Z){
cout << "First"<< endl;
}
else{
cout << "Second" << endl;
}
}
} | #include <iostream>
#include <vector>
#include <numeric>
#include <queue>
#include <iomanip>
using namespace std;
typedef double ld;
vector<pair<int, int>> v; int n;
struct DSU {
vector<int> rank, parent;
DSU(int _n) : rank(_n, 1), parent(_n) {
iota(parent.begin(), parent.end(), 0);
}
int find(const int& u) { return parent[u] == u ? u : (parent[u] = find(parent[u])); }
int size(int u) { return rank[find(u)]; }
bool merge(int u, int v) {
u = find(u); v = find(v);
if (u == v) { return false; }
if (rank[u] < rank[v]) { swap(u, v); }
rank[u] += rank[v]; parent[v] = u;
return true;
}
};
bool intersect(int x1, int y1, int x2, int y2, ld r) {
int dx = x1 - x2; dx *= dx;
int dy = y1 - y2; dy *= dy;
return dx + dy < 4 * r * r;
}
bool check(ld r) {
DSU dsu(n + 2);
for (int i = 0; i < n; i++) {
int& xi = v[i].first, & yi = v[i].second;
if (yi + r > 100 - r) { dsu.merge(i, n); }
if (yi - r < -100 + r) { dsu.merge(i, n + 1); }
for (int j = i + 1; j < n; j++) {
int& xj = v[j].first, & yj = v[j].second;
if (intersect(xi, yi, xj, yj, r)) dsu.merge(i, j);
}
}
return dsu.find(n) != dsu.find(n + 1);
}
ld findMaxRadius() {
ld l = 0.0, r = 100.0;
while (r - l > 1e-6) {
ld mid = (r + l) / 2;
check(mid) ? l = mid : r = mid;
}
return l;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
cin >> n; v.resize(n);
for (auto& x : v) cin >> x.first >> x.second;
cout << fixed << setprecision(10) << findMaxRadius() << '\n';
cin.ignore(2); return 0;
} |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<string.h>
#include<cstring>
#include<string>
typedef long long ll;
using namespace std;
const int MAX=0x3f3f3f;
const int MIN=-0x3f3f3f;
const int N=3e5+5;
ll a[N];
ll cnt[N];
int main()
{
int n,k;
cin >> n >> k;
ll minc=MAX;
ll maxc=MIN;
for(int i=1;i<=n;i++){
cin >> a[i];
cnt[a[i]]++;
//maxc=max(maxc,cnt[a[i]]);
//minc=min(minc,cnt[a[i]]);
}
ll res=0;
if(cnt[0]!=0){
while(k--){
int i=0;
while(cnt[i]){
cnt[i]--;
i++;
}
if(i){
res=res+i;
}
}
}
cout << res <<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
enum Direction{
BACKWARD,
FORWARD,
UNDIRECTED
};
struct Edge{
int v, u, direction;
int other(int x){
if(x == u)
return v;
return u;
}
void set_source(int x){
if(x == u)
direction = FORWARD;
else
direction = BACKWARD;
}
};
void dfs(int node, vector<bool>& vis, vector<vector<int>>& adj, vector<Edge>& edges, vector<int>& c){
vis[node] = true;
for(auto out : adj[node]){
int ne = edges[out].other(node);
if(c[node] == c[ne]){
if(edges[out].direction == UNDIRECTED)
edges[out].set_source(node);
if(!vis[ne]){ // forward edge
dfs(ne, vis, adj, edges, c);
}
}
}
}
void solve(vector<vector<int>>& adj, vector<Edge>& edges, vector<int>& c){
int n = adj.size();
for(auto &edge : edges){
if(c[edge.v] < c[edge.u])
edge.direction = FORWARD;
else if(c[edge.v] > c[edge.u])
edge.direction = BACKWARD;
}
vector<bool> vis(n);
for(int i = 0;i < (int)adj.size();i++){
if(!vis[i])
dfs(i, vis, adj, edges, c);
}
}
int main(){
int n, m;
cin >> n >> m;
vector<vector<int>> adj(n);
vector<Edge> edges(m);
vector<int> c(n);
for(int i = 0;i < m;i++){
cin >> edges[i].u >> edges[i].v;
edges[i].u -= 1;
edges[i].v -= 1;
edges[i].direction = UNDIRECTED;
adj[edges[i].u].push_back(i);
adj[edges[i].v].push_back(i);
}
for(int i = 0;i < n;i++){
cin >> c[i];
}
solve(adj, edges, c);
for(int i = 0;i < (int)edges.size();i++){
if(edges[i].direction == FORWARD)
cout << "->\n";
else if(edges[i].direction == BACKWARD)
cout << "<-\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
using ll = long long;
const int INF = 1001001001;
const ll LINF = 1002003004005006007ll;
void solve(){
int n;cin >> n;
ll k; cin >> k;
vector<pair<ll,ll> > a(n);
ll aa,bb;
rep(i,n){
cin >> aa >> bb;
a[i]=make_pair(aa,bb);
}
sort(all(a));
ll inde = 0;
rep(i,n){
if((k-(a[i].first-inde))<0){
cout << k + inde << endl;
return;
}
else {
k -= a[i].first-inde;
k += a[i].second;
inde = a[i].first;
}
}
cout << inde + k << endl;
return;
}
int main(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(16);
solve();
return 0;
} | // E - Count Descendants
#include <bits/stdc++.h>
using namespace std;
#define vec vector
using vi = vec<int>;
using vvi = vec<vi>;
using ll = int64_t;
using PR = pair<ll,ll>;
#define all(x) (x).begin(),(x).end()
#define rp(i,s,e) for(int i=(s);i<(e);++i)
#define irp(i,s,e) for(int i=(s);i>(e);--i)
#define sz(a) int(a.size())
#define rep(i,e) for(int i=0;i<(e);++i)
vec<vi> adj, T;
vi I, O;
int dfs(int d, int p, int t){
T[d].push_back(t);
I[p] = t;
for(int&c:adj[p]) t = dfs(d+1, c, t+1) + 1;
O[p] = t;
return t;
}
int main(){
int n; cin>>n;
adj.resize(n);
rep(i, n-1){
int p; cin>>p;
adj[p-1].push_back(i+1);
}
T.resize(n);
I.resize(n);
O.resize(n);
dfs(0, 0, 0);
int q; cin>>q;
while(q--){
int u, d; cin>>u>>d;
int r = upper_bound(all(T[d]), O[u-1]) - T[d].begin();
int l = lower_bound(all(T[d]), I[u-1]) - T[d].begin();
cout<< r - l <<endl;
}
}
|
#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 << '(' << p.first << ',' << p.second << ')';
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << '{';
for(int i = 0; i < (int)v.size(); i++) {
if(i) { os << ','; }
os << v[i];
}
os << '}';
return os;
}
void debugg() { cerr << endl; }
template <class T, class... Args>
void debugg(const T &x, const Args &... args) {
cerr << " " << x;
debugg(args...);
}
#define debug(...) \
cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = (1<<30)-1;
const ll linf = 1LL<<61;
const int MAX = 510000;
int dy[8] = {0,1,0,-1,1,-1,-1,1};
int dx[8] = {-1,0,1,0,1,-1,1,-1};
const double pi = acos(-1);
const double eps = 1e-9;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
if(a>b){
a = b; return true;
}
else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
if(a<b){
a = b; return true;
}
else return false;
}
template<typename T> inline void print(T &a){
int sz = a.size();
for(auto itr = a.begin(); itr != a.end(); itr++){
cout << *itr;
sz--;
if(sz) cout << " ";
}
cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){
cout << a << " " << b << "\n";
}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
cout << a << " " << b << " " << c << "\n";
}
void mark() {cout << "#" << "\n";}
ll pcount(ll x) {return __builtin_popcountll(x);}
const int mod = 1e9 + 7;
//const int mod = 998244353;
int main(){
ll n; cin >> n;
ll ans = n;
for(int b=0; b<=62; b++){
ll B = 1LL<<b;
if(n < B) break;
ll a = n / B;
ll c = n - a*B;
chmin(ans,a+b+c);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define fr(i,n) for(int i = 0; i<n; i++)
typedef long long ll;
#define rmin(a,b) a = min<ll>(a,b)
//solves https://atcoder.jp/contests/abc193/tasks/abc193_e
ll div(ll a, ll b, bool ceil){
ll ans = abs(a/b);
bool pos = (a<0)==(b<0);
if(a%b and ceil==pos) ans++;
if(!pos) ans*=-1;
return ans;
}
ll gcd_ext(ll a, ll b, ll &xo, ll &yo){
if(b==0){
xo = 1, yo = 0;
return a;
}
ll x1, y1;
ll g = gcd_ext(b,a%b,x1,y1);
xo = y1;
yo = x1-(a/b)*y1;
return g;
}
/*
Retorna qual o menor x positivo que satisfaz
a*x + b*y = c (obviamente o y correspondente eh negativo)
(ou -1 se nao existe)
Util em CRT para achar menor r positivo que
r = ra (mod a)
r = rb (mod b)
->
a*x-b*y = rb-ra
r = a*x + ra
*/
ll qual_sol(ll a, ll b, ll c){
ll xo, yo;
ll g = gcd_ext(a,b,xo,yo);
if(c%g!=0) return -1;
c/=g, a/=g,b/=g;
xo*=c,yo*=c;
ll k = div(-xo,b,b>0);
return xo+k*b;
}
/*
Return minimun r such that:
r = ra (mod a)
r = rb (mod b)
Or -1 if no such r
*/
ll solve_crt(ll ra, ll a, ll rb, ll b){
ll minx = qual_sol(a,-b,rb-ra);
if(minx==-1) return minx;
return a*minx+ra;
}
int main(){
ios::sync_with_stdio(0); cin.tie(0);
ll t; cin >> t;
fr(tt,t){
ll X, Y, P, Q; cin >> X >> Y >> P >> Q;
ll t1 = P+Q, t2 = 2*X+2*Y;
ll ans = LLONG_MAX;
fr(i,Q) fr(j,Y){
ll cand = solve_crt(P+i,t1,X+j,t2);
if(cand!=-1) rmin(ans,cand);
}
if(ans<LLONG_MAX){
cout << ans << "\n";
} else{
cout << "infinity\n";
}
}
} |
#include <iostream>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
for (ll i = 1; ; i++) if (stoll(to_string(i) + to_string(i)) > N) {
cout << i - 1 << endl;
return 0;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
scanf("%lld", &n);
int ans = 0;
for(int i = 1; ; i++) {
string s = to_string(i);
s += s;
if(stoll(s) <= n) {
ans++;
}
else break;
}
printf("%d\n", ans);
}
|
#include <cstdio>
#include <cstring>
#include <string>
#define min(a, b) ((a) < (b) ? (a) : (b))
using namespace std;
static constexpr int cm = 1 << 17;
char cn[cm], *ci = cn + cm, ct;
inline char getcha() {
if (ci - cn == cm) {
fread(cn, 1, cm, stdin);
ci = cn;
}
return *ci++;
}
inline int getint() {
int A = 0;
while ((ct = getcha()) >= '0') A = A * 10 + ct - '0';
return A;
}
static struct FastOutput {
static constexpr int BUF_SIZE = 1 << 20;
char buf[BUF_SIZE];
size_t buf_pos = 0;
static constexpr int TMP_SIZE = 1 << 20;
char tmp[TMP_SIZE];
FILE* out = stdout;
inline void put_char(char c) {
buf[buf_pos++] = c;
if (buf_pos == BUF_SIZE) {
fwrite(buf, 1, buf_pos, out);
buf_pos = 0;
}
}
~FastOutput() { fwrite(buf, 1, buf_pos, out); }
inline FastOutput& operator<<(char c) {
put_char(c);
return *this;
}
inline FastOutput& operator<<(const char* s) {
while (*s) {
put_char(*s++);
}
return *this;
}
inline FastOutput& operator<<(const string& s) {
for (int i = 0; i < (int)s.size(); i++) {
put_char(s[i]);
}
return *this;
}
template <typename T>
inline char* integer_to_string(T n) {
// beware of TMP_SIZE
char* p = tmp + TMP_SIZE - 1;
if (n == 0) {
*--p = '0';
} else {
bool is_negative = false;
if (n < 0) {
is_negative = true;
n = -n;
}
while (n > 0) {
*--p = (char)('0' + n % 10);
n /= 10;
}
if (is_negative) {
*--p = '-';
}
}
return p;
}
template <typename T>
inline typename enable_if<is_integral<T>::value, char*>::type stringify(T n) {
return integer_to_string(n);
}
#if !defined(_WIN32) || defined(_WIN64)
inline char* stringify(__int128 n) { return integer_to_string(n); }
#endif
template <typename T>
inline typename enable_if<is_floating_point<T>::value, char*>::type stringify(T n) {
sprintf(tmp, "%.17f", n);
return tmp;
}
template <typename T>
inline FastOutput& operator<<(const T& n) {
auto p = stringify(n);
for (; *p != 0; p++) {
put_char(*p);
}
return *this;
}
} fast_output;
#define cout fast_output
static constexpr int mx = 400000;
int p[mx], cnt[mx], siz[mx];
inline int get(int x) { return p[x] == -1 ? x : p[x] = get(p[x]); }
int main() {
int n = getint();
memset(p, -1, sizeof(p));
while (n--) {
int a = get(getint() - 1), b = get(getint() - 1);
if (a != b) {
p[b] = a;
cnt[a] += cnt[b];
}
cnt[a]++;
}
for (int i = 0; i < mx; i++) {
siz[get(i)]++;
}
int ans = 0;
for (int i = 0; i < mx; i++) {
if (get(i) == i) {
ans += min(cnt[i], siz[i]);
}
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i,n) for(ll i=1;i<=(ll)(n);i++)
const int mod = 1e9+7;
template< int mod >
struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if((x += p.x) >= mod) x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if((x += mod - p.x) >= mod) x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int) (1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while(b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(int64_t n) const {
ModInt ret(1), mul(x);
while(n > 0) {
if(n & 1) ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const ModInt &p) {
return os << p.x;
}
friend istream &operator>>(istream &is, ModInt &a) {
int64_t t;
is >> t;
a = ModInt< mod >(t);
return (is);
}
static int get_mod() { return mod; }
};
using modint = ModInt< mod >;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n,m;
cin >> n >> m;
vector<int> a(n);
rep(i,n) cin >> a[i];
ll s=0;
rep(i,n) s+=a[i];
modint ans = 1;
rep(i,n+s){
ans *= m+n-i;
ans /= (i+1);
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include<algorithm>
#include<iomanip>
#include<cstdio>
#include<cmath>
#include<string>
#include <cstring>
#include<queue>
#include<set>
#include<stack>
#include <numeric>
using namespace std;
typedef long long ll;
ll x, y, a, b;
int main()
{
cin >> x >> y >> a >> b;
ll ans = 0;
while ((a - 1) * x <= b&&a*x<y&& (double)a * x <= 2e18)
{
x *= a;
ans++;
}
cout << ans + (y - 1 - x) / b << endl;
} | // Problem : D - Takahashi Unevolved
// Contest : AtCoder - AtCoder Beginner Contest 180
// URL : https://atcoder.jp/contests/abc180/tasks/abc180_d
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
/*ヽ｀、ヽ｀｀、ヽ｀ヽ｀、、ヽ ｀ヽ 、ヽ｀🌙｀ヽヽ｀ヽ、ヽ｀
ヽ｀、ヽ｀｀、ヽ 、｀｀、 ｀、ヽ｀ 、｀ ヽ｀ヽ、ヽ ｀、ヽ｀｀、
ヽ、｀｀、｀、ヽ｀｀、 、ヽヽ｀、｀、、ヽヽ、｀｀、 、 ヽ｀、
ヽ｀｀、 ヽ｀ヽ｀、、ヽ ｀ヽ 、 🚶ヽ｀｀｀｀ヽヽヽ｀、、ヽ｀、、ヽ*/
// #pragma GCC optimize ("O3")
// #pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,b,a) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a,x) for (auto& a : x)
#define bug(x) cout<<#x<<"="<<x<<endl;
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define ins insert
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ld pii=3.14159265359;
const int MOD = 1000000007;
const char nl = '\n';
const int MX = 200001; //check the limits, dummy
int main()
{
//binary search lag skta kya?
ios_base::sync_with_stdio(0); cin.tie(0);
ll X,Y,A,B;
cin>>X>>Y>>A>>B;
ll ans=0;
while(X<Y)
{
if(X<B/(A-1))
X*=A,ans++;
else
break;
}
if(X>=Y)
{
cout<<ans-1;
return 0;
}
ll val=(Y-X+B-1)/B;
ans+=val-1;
X+=val*B;
cout<<ans<<nl;
return 0;
}
// read the question correctly (ll vs int)
// template by bqi343 |
#pragma GCC optimize ("-O2")
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define deb(x) cout<< #x << " " << x << "\n";
#define MAX 9223372036854775807
#define MIN -9223372036854775807
#define setbits(n) __builtin_popcountll(n)
#define mkunique(a) a.resize(unique(a.begin(),a.end())-a.begin());
const ll mod=1e9+7;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll T=clock();
ll t;
cin>>t;
while(t--){
ll n;
cin>>n;
string s1, s2, s3;
cin>>s1>>s2>>s3;
string ans;
for(ll i=0;i<n;i++) ans+='1';
for(ll i=0;i<n;i++) ans+='0';
ans+='1';
cout<<ans<<"\n";
}
cerr<<"\n\nTIME: "<<(double)(clock()-T)/CLOCKS_PER_SEC<<" sec\n";
T = clock();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define ll long long
#define rep(i,n) for(ll i = 0; i < (n); ++i)
#define REP(i,x,n) for(ll i = (x); i < (n); ++i)
#define P pair<ll,ll>
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
const ll mod = 1e9+7;
const ll INF = 1e18;
const double pi = acos(-1);
//const ll mod = 998244353;
template<class T> inline bool chmin(T& a, T b){ if(a > b) { a = b; return true;} return false; }
template<class T> inline bool chmax(T& a, T b){ if(a < b) { a = b; return true;} return false; }
ll lcm(ll a, ll b) { return a / __gcd(a, b) * b; }
int main(void)
{
ll n, ans = 0, sum = 0, pos = 0, m = 0;
cin >> n;
rep(i,n){
ll a;
cin >> a;
sum += a;
m = max(sum, m);
ans = max(ans, pos + m);
pos += sum;
}
cout << ans << endl;
return 0;
} |
/**
* author: otera
**/
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60;
#define rep(i, n) for(int i = 0; i < n; ++ i)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
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; return 1; } return 0; }
void solve() {
int n; cin >> n;
vector<int> a(n), b(n), p(n);
rep(i, n) {
cin >> a[i];
}
rep(i, n) {
cin >> b[i];
}
vector<int> rp(n);
rep(i, n) {
cin >> p[i]; -- p[i];
rp[p[i]] = i;
}
vector<bool> ok(n, 0);
rep(i, n) {
if(p[i] != i and a[i] <= b[p[i]]) {
cout << -1 << "\n";
return;
}
if(p[i] == i) ok[i] = 1;
}
vector<int> ids(n);
iota(all(ids), 0);
sort(all(ids), [&](int i, int j){ return b[i] > b[j];});
vector<P> ans;
auto f = [&](int i, int j) {
ans.push_back({i, j});
int pi = p[i], pj = p[j];
p[i] = pj, p[j] = pi;
rp[pj] = i, rp[pi] = j;
};
rep(i, n) {
int id = ids[i];
if(rp[id] == id) continue;
f(rp[id], id);
}
// rep(i, n) cerr << p[i] << " \n"[i == n - 1];
cout << (int)ans.size() << "\n";
rep(i, (int)ans.size()) {
cout << ans[i].fr + 1 << " " << ans[i].sc + 1 << "\n";
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
//cout << fixed << setprecision(20);
//int t; cin >> t; rep(i, t)solve();
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define M1 1000000007
#define M2 998244353
#define INF 1e18
#define ll long long
#define pll pair<ll,ll>
#define REP(i,a,b) for(ll i=a;i<b;i++)
#define REPR(i,a,b) for(ll i=b-1;i>=a;i--)
#define forr(i,n) for(ll i=0;i<n;i++)
#define F first
#define S second
#define pb push_back
#define DB pop_back
#define mp make_pair
#define MT make_tuple
#define V(a) vector<a>
#define vi vector<int>
#define vlli vector <long long>
#define endl '\n'
#define ce(ele) cout<<ele<<' '
#define cs(ele) cout<<ele<<'\n'
#define CASE(t) ll t; cin>>t; while(t--)
/********************************************************************/
const double pi = 3.1415926535;
/********************************************************************/
//FAST IO//
void FAST() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
/********************************************************************/
int main()
{
FAST();
ll int n,p; cin>>n>>p;
ll int ans=p-1;
ll ans2=1;
//calculate (p-2)^(n-1)
ll int x=n-1;
ll temp=p-2;
while (x>0)
{
if (x&1)
{
ans*=temp;
ans%=M1;
}
temp= temp*temp;
temp%=M1;
x/=2;
}
cout<<ans<<endl;
} |
#define _USE_MA_DEFINES
#include <iostream>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <cstring>
#include <cmath>
#include <stack>
#include <iomanip>
#include <tuple>
#include <functional>
#include <cfloat>
#include <map>
#include <set>
#include <array>
#include <stdio.h>
#include <string.h>
#include <random>
#include <cassert>
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using namespace std;
#define int long long
#define CONTAINS_VEC(v,n) (find((v).begin(), (v).end(), (n)) != (v).end())
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
#define ARY_SORT(a, size) sort((a), (a)+(size))
#define REMOVE(v,a) (v.erase(remove((v).begin(), (v).end(), (a)), (v).end()))
#define REVERSE(v) (reverse((v).begin(), (v).end()))
#define ARY_REVERSE(v,a) (reverse((v), (v)+(a)))
#define REP(i, n) for (int (i)=0; (i) < (n); (i)++)
#define REPE(i, n) for (int (i)=0; (i) <= (n); (i)++)
#define CONTAINS_MAP(m, a) ((m).find((a)) != m.end())
#define CONTAINS_SET(m, a) ((m).find((a)) != m.end())
void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; exit(0); }
void Yes() { cout << "Yes" << endl; exit(0); }
void No() { cout << "No" << endl; exit(0); }
int OFFSET = 10000;
//---------- にぶたん[f,f,f,f,'t',t,t,t] ----------
template <typename BSFunc>
int binary_search(int l, int r, BSFunc isOK)
{
int left = l - 1;
int right = r;
while ((right - left) > 1)
{
int mid = left + (right - left) / 2;
if (isOK(mid))
right = mid;
else
left = mid;
}
return right;
}
int func(double Xf, double Yf, double Rf)
{
int Xd, Yd, Rd;
Xd = llround(Xf * OFFSET);
Yd = llround(Yf * OFFSET);
Rd = llround(Rf * OFFSET);
int rx = floor(Xf + Rf);
int lx = ceil(Xf - Rf);
int ans = 0;
for (int x = lx; x <= rx; x++)
{
int target_x = Xd - (x * OFFSET);
int sy = ceil(Yf);
int ty = binary_search(sy, 300000LL, [&](int index)
{
if ((index * OFFSET - Yd) * (index * OFFSET - Yd) > Rd * Rd - target_x * target_x)
{
return true;
}
return false;
});
ty--;
if ((Yd - ty * OFFSET) * (Yd - ty * OFFSET) <= Rd * Rd - target_x * target_x)
{
int by = binary_search(-300000LL, ty, [&](int index)
{
if ((Yd - index * OFFSET) * (Yd - index * OFFSET) <= Rd * Rd - target_x * target_x)
{
return true;
}
return false;
});
ans += (int)(ty - by) + 1;
}
}
return ans;
}
signed main()
{
long double Xf, Yf, Rf;
cin >> Xf >> Yf >> Rf;
cout << func(Xf, Yf, Rf);
}
| #include <bits/stdc++.h>
using namespace std;
typedef int_fast32_t int32;
typedef int_fast64_t int64;
const int32 inf = 1e9+7;
const int32 MOD = 1000000007;
const int64 llinf = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE\n" : "IMPOSSIBLE\n" )
#define ANS(n) cout << (n) << "\n"
#define REP(i,n) for(int64 i=0;i<(n);++i)
#define FOR(i,a,b) for(int64 i=(a);i<(b);i++)
#define FORR(i,a,b) for(int64 i=(a);i>=(b);i--)
#define all(obj) (obj).begin(),(obj).end()
#define rall(obj) (obj).rbegin(),(obj).rend()
#define fi first
#define se second
#define pb(a) push_back(a)
typedef pair<int32,int32> pii;
typedef pair<int64,int64> pll;
template<class T> inline bool chmax(T& a, T b) {
if (a < b) { a = b; return true; } return false;
}
template<class T> inline bool chmin(T& a, T b) {
if (a > b) { a = b; return true; } return false;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int64 k,n,m;
cin >> k >> n >> m;
vector<int64> a(k);
REP(i,k)cin >> a[i];
priority_queue<pll> que;
vector<int64> b(k);
int64 s = 0;
REP(i,k){
b[i] = m * a[i] / n;
s += b[i];
que.emplace(m * a[i] % n, i);
}
REP(i,m-s){
b[que.top().se]++;
que.pop();
}
REP(i,k){
if(i != 0)cout << " ";
cout << b[i];
}
cout << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
using int64 = long long;
// const int mod = 1e9 + 7;
const int mod = 998244353;
const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
}
} iosetup;
template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
os << p.first << " " << p.second;
return os;
}
template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
is >> p.first >> p.second;
return is;
}
template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
for(int i = 0; i < (int) v.size(); i++) {
os << v[i] << (i + 1 != v.size() ? " " : "");
}
return os;
}
template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
for(T &in : v) is >> in;
return is;
}
template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
template< typename T = int64 >
vector< T > make_v(size_t a) {
return vector< T >(a);
}
template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}
template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
t = v;
}
template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
for(auto &e : t) fill_v(e, v);
}
template< typename F >
struct FixPoint : F {
FixPoint(F &&f) : F(forward< F >(f)) {}
template< typename... Args >
decltype(auto) operator()(Args &&... args) const {
return F::operator()(*this, forward< Args >(args)...);
}
};
template< typename F >
inline decltype(auto) MFP(F &&f) {
return FixPoint< F >{forward< F >(f)};
}
int main() {
int N, M;
cin >> N >> M;
int x = 0;
for(int i = 0; i < N; i++) {
string s;
cin >> s;
x += count(begin(s), end(s), '1') % 2;
}
cout << 1LL * (N - x) * x << "\n";
} | #include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mkp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define sz(v) (int)v.size()
typedef long long LL;
typedef double db;
template<class T>bool ckmax(T&x,T y){return x<y?x=y,1:0;}
template<class T>bool ckmin(T&x,T y){return x>y?x=y,1:0;}
#define rep(i,x,y) for(int i=x,i##end=y;i<=i##end;++i)
#define per(i,x,y) for(int i=x,i##end=y;i>=i##end;--i)
inline int read(){
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=0;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f?x:-x;
}
#define mod 998244353
inline void fmod(int&x){x-=mod,x+=x>>31&mod;}
inline int qpow(int n,int k){
int res=1;
for(;k;k>>=1,n=1ll*n*n%mod)
if(k&1)res=1ll*n*res%mod;
return res;
}
const int N=200005;
int n,m,cnt[25],fac[N],ifc[N],ans,dp[N][25],f[N];
int dfs(int val,int num){
if(num>n)return 0;
if(dp[val][num])return dp[val][num];
int res=0;
fmod(res+=f[num]);
rep(i,!num?1:2,m){
if(val*i>m)break;
fmod(res+=dfs(val*i,num+1));
}
return dp[val][num]=res;
}
void initfac(const int&n=N-1){
fac[0]=1;
rep(i,1,n)fac[i]=1ll*i*fac[i-1]%mod;
ifc[n]=qpow(fac[n],mod-2);
per(i,n-1,0)ifc[i]=1ll*(i+1)*ifc[i+1]%mod;
}
inline int comb(int n,int m){return n<m?0:1ll*fac[n]*ifc[m]%mod*ifc[n-m]%mod;}
signed main(){
cin>>n>>m;
initfac();
rep(i,1,20)f[i]=comb(n-1,i-1);
cout<<dfs(1,0)<<'\n';
} |
/*
你指尖跃动的电光，是我此生不变的信仰，唯我超电磁炮永世长存！
君指先跃动の光は、私の一生不変の信仰に、唯私の超電磁砲永世生き！
唯我超电磁炮永世长存
我心所属依旧超电磁炮
超凡入圣吾炮任可再战
电闪雷鸣炮姐征战天下
磁轨炮学园最强电击使
炮姐震古烁今吾炮赛高
永无止境炮党头顶青天
世人皆知唯我哔哩哔哩
长驱直入最强电击公主
存二次元此生无悔入炮
我炮还能再战100年
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1000005;
struct IO_Tp {
const static int _I_Buffer_Size = 2 << 22;
char _I_Buffer[_I_Buffer_Size], *_I_pos = _I_Buffer;
const static int _O_Buffer_Size = 2 << 22;
char _O_Buffer[_O_Buffer_Size], *_O_pos = _O_Buffer;
IO_Tp() { fread(_I_Buffer, 1, _I_Buffer_Size, stdin); }
~IO_Tp() { fwrite(_O_Buffer, 1, _O_pos - _O_Buffer, stdout); }
IO_Tp &operator>>(ll &res) {
ll f=1;
while (!isdigit(*_I_pos)&&(*_I_pos)!='-') ++_I_pos;
if(*_I_pos=='-')f=-1,++_I_pos;
res = *_I_pos++ - '0';
while (isdigit(*_I_pos)) res = res * 10 + (*_I_pos++ - '0');
res*=f;
return *this;
}
IO_Tp &operator<<(ll n) {
if(n<0)*_O_pos++='-',n=-n;
static char _buf[10];
char *_pos = _buf;
do
*_pos++ = '0' + n % 10;
while (n /= 10);
while (_pos != _buf) *_O_pos++ = *--_pos;
return *this;
}
IO_Tp &operator<<(char ch) {
*_O_pos++ = ch;
return *this;
}
} IO;
ll n,k,cnt[3*N],cnt2[3*N],cnt3[3*N];
int main(){
IO>>n>>k;
for(ll i=1;i<=n;i++)cnt[i]=1;
for(ll i=1,sum=0;i<=n*2;i++){
cnt2[i]+=sum;
if(i<=n)sum+=cnt[i];
else sum-=cnt[i-n];
}
for(ll i=1,sum=0;i<=n*3;i++){
cnt3[i]+=sum;
if(i<=2*n)sum+=cnt2[i];
if(i>n)sum-=cnt2[i-n];
}
for(ll i=3;i<=n*3;i++)if(k<=cnt3[i]){
for(ll j=1;j<=i-2;j++)if(k<=cnt2[i-j]){
ll a=j;
for(ll t=1;t<=i-j-1;t++){
ll b=t,c=i-a-b;
if(c<=n)k--;
if(!k){IO<<a<<' '<<b<<' '<<c<<'\n';return 0;}
}
}else k-=cnt2[i-j];
}else k-=cnt3[i];
return 0;
}
| #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<queue>
#include<vector>
#include<limits.h>
#define IL inline
#define re register
#define LL long long
#define ULL unsigned long long
#ifdef TH
#define debug printf("Now is %d\n",__LINE__);
#else
#define debug
#endif
using namespace std;
const int N=1005;
int k;
int que[N],len;
long long n,a,b;
IL bool cmp(int x,int y){return x>y;}
IL void work(LL &x)
{
len=a=b=0;
re int mid=x;
for(;mid;mid/=10)
que[++len]=mid%10;
sort(que+1,que+len+1);
for(int i=1;i<=len;i++) a=a*10+que[i];
for(int i=len;i>0;i--) b=b*10+que[i];
x=b-a;
}
int main()
{
cin>>n>>k;
while(k--) work(n);
cout<<n;
return 0;
}
|
//#pragma GCC optimize ("O2")
//#pragma GCC optimize ("Ofast")
// IN THE NAME OF GOD
#include <bits/stdc++.h>
using namespace std;
typedef pair <int, int> pii;
template <typename Head>
inline void dout(Head in) {
cerr << in << '\n';
}
int main() {
ios::sync_with_stdio(false), cin.tie(NULL);
int n;
cin >> n;
vector<vector<int>> a(n, vector<int> (n));
vector<int> tmp(n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> a[i][j];
}
}
for (int i = 0; i < n; i++) {
bool ok = true;
tmp = a[i];
for (int j = 0; j < n; j++) {
int cnt = 0;
for (int k = 0; k < n; k++) {
cnt += tmp[j] <= a[k][j];
}
ok &= cnt == n;
}
if (ok) {
break;
}
}
// cout << "tmp: ";
// for (int i = 0; i < n; i++) {
// cout << tmp[i] << ' ';
// }
bool exist = true;
vector<int> ans(n);
for (int i = 0; i < n; i++) {
int ith = a[i][0] - tmp[0];
bool ok = true;
for (int j = 1; j < n; j++) {
if (a[i][j] - tmp[j] != ith) {
ok = false;
}
}
if (ok) {
ans[i] = ith;
}
else {
exist = false;
break;
}
}
if (exist) {
cout << "Yes\n";
for (int i = 0; i < n; i++) {
cout << ans[i] << ' ';
}
cout << '\n';
for (int i = 0; i < n; i++) {
cout << tmp[i] << ' ';
}
}
else {
cout << "No";
}
return 0;
} | #include <cstdio>
#include <cmath>
#include <iostream>
#include <set>
#include <algorithm>
#include <vector>
#include <map>
#include <cassert>
#include <string>
#include <cstring>
#include <queue>
using namespace std;
#define rep(i,a,b) for(int i = a; i < b; i++)
#define S(x) scanf("%d",&x)
#define S2(x,y) scanf("%d%d",&x,&y)
#define P(x) printf("%d\n",x)
#define all(v) v.begin(),v.end()
#define FF first
#define SS second
#define pb push_back
#define mp make_pair
typedef long long int LL;
typedef pair<int, int > pii;
typedef vector<int > vi;
const int N = 200005;
int A[N], B[N];
map<int, vi > idx;
map<int, vi >::iterator it;
class BinaryIndexTree {
vector<int > BIT;
int sz;
public:
BinaryIndexTree(int _sz) {
sz = _sz;
BIT.resize(_sz+1, 0);
}
void update(int idx, int val) {
for(int i = idx; i < sz; i += i & -i) {
BIT[i] += val;
}
}
int query(int idx) {
int res = 0;
for(int i = idx; i; i -= i & -i) {
res += BIT[i];
}
return res;
}
};
BinaryIndexTree bit(N);
int main() {
int n;
S(n);
rep(i,0,n) {
S(A[i]);
A[i] += i;
idx[A[i]].pb(i + 1);
}
for(it = idx.begin(); it != idx.end(); it++) {
reverse(all(it->SS));
}
LL ans = 0;
rep(i,0,n) {
S(B[i]);
B[i] += i;
if(idx.find(B[i]) == idx.end() || idx[B[i]].size() == 0) {
P(-1);
return 0;
}
int num = idx[B[i]].back();
idx[B[i]].pop_back();
ans += i - bit.query(num);
bit.update(num, 1);
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < n; i++)
#define REP(i,s,n) for(int i = s; i < n; i++)
#define all(x) (x).begin(),(x).end()
typedef long long ll;
using Graph = vector<vector<int>>;
const int INF = 1000000007;
int main(){
int n;
cin >> n;
vector<pair<int,int>>xy(n);
rep(i,n)cin >> xy[i].first >> xy[i].second;
rep(i,n)REP(j,i + 1,n)REP(k,j + 1,n){
auto [x1,y1] = xy[i];
auto [x2,y2] = xy[j];
auto [x3,y3] = xy[k];
x1 -= x3;
x2 -= x3;
y1 -= y3;
y2 -= y3;
if(x1 * y2 == x2 * y1){
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
return 0;
}
| // CTRL+ALT+M
#include <bits/stdc++.h>
using namespace std;
#define M 1000000007
#define int long long int
#define vi vector<int>
#define vb vector<bool>
#define vc vector<char>
#define vpi vector<pair<int,int>>
#define pii pair<int,int>
#define pb push_back
#define inf 1e18
#define ff first
#define ss second
#define deb(x) cout<<#x<<" "<<x<<endl;
#define all(x) x.begin(),x.end()
#define endl "\n"
const int maxn=1e5;
//*! look for binary search see if dp can fit or dp with bs
//*? Set or Priority_queue
//*! Number is upto 10^5 check if a[maxn] gives something
//*? Graph Question depedencies Topo sort
//todo For a Tree its shortest Path in dfs is same as in bfs if it is acyclic
// *! Bridge Detection:: From Backedge we take low[u]=min(low[u],tin[x])
// *! Bridge Detection:: From Child we take low[u]=min(low[u],low[x])
// *! Bridge Detection:: this is a bridge if(low[x]>tin[u])
// vi adj[maxn];
// int visited[maxn];
bool good(pii a,pii b,pii c)
{
if((a.ff==b.ff && c.ff==b.ff)||(a.ss==b.ss && b.ss==c.ss))
{
return true;
}
int a1=b.ss-a.ss;
int a2=b.ff-a.ff;
int b1=c.ss-b.ss;
int b2=c.ff-b.ff;
if(a1*b2==a2*b1)
{
return true;
}
return false;
}
void runcases(int T)
{
int n;
cin>> n;
vpi v(n);
for(int i=0;i<n;i++){
cin>>v[i].ff;
cin>>v[i].ss;
}
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
for(int k=j+1;k<n;k++)
{
bool f= good(v[i],v[j],v[k]);
if(f)
{
cout<<"Yes\n";
return;
}
}
}
}
cout<<"No\n";
return;
//cout<<"Case #"<<T<<": ";
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int T = 1;
//cin >> T;
for (int t=1;t<=T; t++) {
runcases(t);
}
return 0;
}
|
#include <bits/stdc++.h>
#include <cassert>
#define rep(i, N) for (int i = 0; i < (N); ++i)
#define rep2(i, a, b) for (ll i = a; i <= b; ++i)
#define rep3(i, a, b) for (ll i = a; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define nl '\n'
#define endl '\n'
#define all(c) begin(c), end(c)
#define ok() puts(ok ? "Yes" : "No");
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 (a > b) {
a = b;
return true;
}
return false;
}
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvll = vector<vll>;
using ii = pair<int, int>;
using vvi = vector<vi>;
using vii = vector<ii>;
using vs = vector<string>;
using P = pair<ll, ll>;
using gt = greater<P>;
using minq = priority_queue<P, vector<P>, gt>;
using vP = vector<P>;
template <class T> void takeUnique(vector<T> &v) {
auto last = std::unique(v.begin(), v.end());
v.erase(last, v.end());
}
template <class T> void print(const initializer_list<T> &il) {
for (auto x : il) {
cout << x << " ";
}
cout << "\n";
}
inline void priv(vi a) {
rep(i, (int)a.size())
printf("%d%c", a[i], i == (int)a.size() - 1 ? '\n' : ' ');
}
const ll LINF = 1e18L + 1;
const int INF = 1e9 + 1;
int dx[] = {0, 1, 0, -1};
int dy[] = {1, 0, -1, 0};
int dxx[] = {0, 1, 1, 1, 0, -1, -1, -1};
int dyy[] = {1, 1, 0, -1, -1, -1, 0, 1};
// clang++ -std=c++11 -stdlib=libc++
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int N, M, Q;
cin >> N >> M >> Q;
vi W(N);
vi V(N);
vii I(N);
vi X(M);
rep(i, N) cin >> I[i].fi >> I[i].se;
rep(i, M) cin >> X[i];
sort(all(I));
while (Q--) {
int L, R;
cin >> L >> R;
// dp[i][j][k]:=max value s.t., seen i items, j th box has k space
L--, R--;
vi B;
rep(i, M) {
if (i <= R and i >= L)
continue;
B.pb(X[i]);
}
sort(all(B));
int p = 0;
priority_queue<int> valq;
ll ans = 0;
rep(i, B.size()) {
while (p < N and I[p].fi <= B[i]) {
valq.push(I[p].se);
p++;
}
if (valq.empty())
continue;
int v = valq.top();
valq.pop();
ans += v;
}
cout << ans << endl;
}
return 0;
}
| // テスト
#include<ctime>
#include<cmath>
#include<queue>
#include<cstdio>
#include<cctype>
#include<algorithm>
#define ll long long
using namespace std;
const ll N=2e5+7;
const ll INF=1ll<<55;
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;
}
struct edge{
ll to,c,d,nxt;
edge(ll to=0,ll c=0,ll d=0,ll nxt=0):to(to),c(c),d(d),nxt(nxt){}
}e[N];
ll n,m,a,b,c,d,tot,head[N],dis[N],vis[N];
void add(ll u,ll v,ll c,ll d){
e[++tot]=edge(v,c,d,head[u]);
head[u]=tot;
}
struct node{
ll i,d;
node(ll i=0,ll d=0):i(i),d(d){}
friend bool operator <(node a,node b){
return a.d>b.d;
}
};
ll dijkstra(){
priority_queue<node>q;
for(ll i=1;i<=n;++i)
dis[i]=INF;
dis[1]=0;
q.push(node(1,0));
while(!q.empty()){
node u=q.top();
q.pop();
ll x=u.i;
if(vis[x])
continue;
vis[x]=1;
for(ll i=head[x];i;i=e[i].nxt){
ll y=e[i].to;
ll c=e[i].c;
ll d=e[i].d;
ll t=sqrt(d);
if(dis[x]<=t-1){
for(ll j=-3;j<=3;++j){
if(t+j<=0)
continue;
dis[y]=min(dis[y],(t+j)+d/(t+j)+c-1);
}
q.push(node(y,dis[y]));
}
if(dis[y]>dis[x]+c+d/(dis[x]+1)){
dis[y]=dis[x]+c+d/(dis[x]+1);
q.push(node(y,dis[y]));
}
}
}
if(dis[n]==INF)
return -1;
return dis[n];
}
int main() {
#ifndef ONLINE_JUDGE
freopen("E.in","r",stdin);
freopen("E.out","w",stdout);
#endif
clock_t t1=clock();
//--------
n=read();
m=read();
for(int i=1;i<=m;++i){
a=read();
b=read();
c=read();
d=read();
add(a,b,c,d);
add(b,a,c,d);
}
printf("%lld",dijkstra());
//--------
clock_t t2=clock();
fprintf(stderr,"time:%0.3lfs",1.0*(t2-t1)/CLOCKS_PER_SEC);
return 0;
} |
//#include <atcoder/all>
#include <bits/stdc++.h>
//using namespace atcoder;
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// 最大公約数
ll gcd(ll a, ll b)
{
if(b == 0) return a;
return gcd(b, a % b);
}
// mod m におけるa の逆元
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
// 素因数分解
vector<pair<ll, ll>> prim;
void pf(ll n)
{
ll s = sqrt(n);
ll r = 0;
for(ll i = 2; i <= s; i++) {
if((n % i) == 0) {
r = 0;
do {
r++;
n = n / i;
} while((n % i) == 0);
prim.push_back({i, r});
}
}
if(n > s) {
prim.push_back({n, 1});
}
}
void solve()
{
ll N, M; cin >> N >> M;
if(M < 0 || (M > N - 2 && N != 1)) {
cout << -1 << endl;
return;
}
rep(i, N - 1) {
cout << (i + 1) * 10 << " " << (i + 1) * 10 + 5 << "\n";
}
if(M > 0) {
cout << "7 " << (M + 1) * 10 + 8 << "\n";
} else {
cout << "7 8\n";
}
}
int main(void)
{
// ll t; cin >> t; rep(i, t)
solve();
}
| #include <bits/stdc++.h>
using namespace std;
int main(void){
long long int n,q,i,ng,ok,mid;
cin >> n >> q;
vector<long long int> a(n+1),k(q),c(n+1);
a.at(0) = 0;
c.at(0) = 0;
for(i=1; i<=n; i++){
cin >> a.at(i);
c.at(i) = a.at(i) - i;
}
for(i=0; i<q; i++){
cin >> k.at(i);
}
for(i=0; i<q; i++){
if(c.at(n) < k.at(i)){
cout << a.at(n) + k.at(i) - c.at(n) << endl;
}else{
ok = 0;
ng = n;
while(abs(ok - ng) > 1){
mid = (ok + ng) / 2;
if(k.at(i) > c.at(mid)){
ok = mid;
}else{
ng = mid;
}
}
cout << a[ok] + k[i] - c[ok] << endl;
}
}
return 0;
} |
#include "bits/stdc++.h"
using namespace std;
#define for_(i, s, e) for (int i = s; i < (int) e; i++)
#define for__(i, s, e) for (ll i = s; i < e; i++)
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
#define endl '\n'
// if two adjacent nodes have same reachability, then they are in SCC
// now we have a DAG to solve with
// if two adjacent nodes have different reachability, then their direction is easily found
// reduced to making graph SCC by directing edges
// read CF blog post for details on how to do that (is-this-fft)
int n, m;
vector<vector<ii>> adj;
vector<ii> ans;
vi vis;
int dfs(int p, int parent) {
if (vis[p]) return 1;
vis[p] = 1;
for (auto i: adj[p]) if (i.first != parent and ans[i.second].first == -1) {
int v = dfs(i.first, p);
// cout << "going edge " << p << " - " << i.first << " ... " << v << endl;
ans[i.second] = {i.first, p};
// if (v) ans[i.second] = {p, i.first};
}
vis[p] = 2;
return 0;
}
int main() {
#ifdef mlocal
freopen("test.in", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
vector<ii> edges(m);
adj.resize(n); ans.resize(m, {-1, -1}); vis.resize(n);
for_(i, 0, m) {
int a, b; cin >> a >> b;
a -= 1; b -= 1;
adj[a].push_back({b, i}); adj[b].push_back({a, i});
edges[i] = {a, b};
}
vi reach(n);
for_(i, 0, n) cin >> reach[i];
for_(i, 0, m) if (reach[edges[i].first] != reach[edges[i].second]) {
ans[i] = {edges[i].first, edges[i].second};
if (reach[edges[i].first] < reach[edges[i].second]) ans[i] = {edges[i].second, edges[i].first};
}
for_(i, 0, n) if (!vis[i]) dfs(i, i);
for_(i, 0, m) {
if (edges[i] == ans[i]) cout << "->";
else cout << "<-";
cout << endl;
}
return 0;
} | #include <bits/stdc++.h>
typedef long long int ll;
#define INF 1e18
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
ll x;
cin >> n >> x;
vector<int> arr(n);
for(int i=0;i<n;i++){
cin >> arr[i];
}
ll res=INF;
for(int k=1;k<=n;k++){
vector<vector<int>> dp(k+1,vector<int> (k,-1));
dp[0][0]=0;
for(int i=1;i<=n;i++){
for(int j=k;j>=1;j--){
for(int r=0;r<k;r++){
if(dp[j-1][r]==-1){
continue;
}
int next=dp[j-1][r]+arr[i-1];
dp[j][next%k]=max(dp[j][next%k],next);
}
}
}
// cout << "k= " << k << " " << dp[k][x%k] << "\n";
if(dp[k][x%k]!=-1){
res=min(res,(x-dp[k][x%k])/k);
}
}
cout << res << "\n";
return 0;
} |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B, C;
string win;
cin >> A >> B >> C;
if( C == 0) {
while(1) {
A--;
if( A < 0 ) {
win = "Aoki";
break;
}
B--;
if( B < 0 ) {
win = "Takahashi";
break;
}
}
} else if(C == 1) {
while(1) {
B--;
if( B < 0 ) {
win = "Takahashi";
break;
}
A--;
if( A < 0 ) {
win = "Aoki";
break;
}
}
}
cout << win << endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include<bits/stdc++.h>
using namespace std;
int solve(int a,int b,int c)
{
if(a==b)
return c;
else if(a==c)
return b;
else if(b==c)
return a;
return 0;
}
int main(){
int a,b,c;
cin>>a>>b>>c;
cout<<solve(a,b,c);
}
|
#include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define FORR(i, n) for(ll i = (ll)n - 1LL; i >= 0LL; i--)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using ll = long long;
constexpr ll Mod = 998244353;
constexpr ll mod = 1e9 + 7;
constexpr ll inf = 1LL << 60;
const double PI = acos(-1);
template <typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
/*-------------------------------------------*/
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
string s;
cin >> s;
int a = count(ALL(s), 'o');
int b = count(ALL(s), 'x');
int c = count(ALL(s), '?');
ll cnt = 0;
const int ar[5] = {0, 1, 14, 36, 24};
rep(i, 1 << c) {
int t = __builtin_popcount(i);
if(a + t <= 4) cnt += ar[a + t];
}
cout << cnt << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <utility>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)
int main(){
string S; cin >> S;
int ans = 0;
rep(i,10000){
int K[4] = {i/1000,i/100%10,i/10%10,i%10};
int C[10] = {}; rep(t,4) C[K[t]] = 1;
bool ok = true;
rep(d,10) if(C[d] == 0 && S[d] == 'o') ok = false;
rep(d,10) if(C[d] == 1 && S[d] == 'x') ok = false;
if(ok) ans++;
}
cout << ans << "\n";
return 0;
}
struct ios_do_not_sync{
ios_do_not_sync(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
}
} ios_do_not_sync_instance;
|
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n;
cin >> n;
set<long long> ans;
long long lpn = min(n, 10000000ll);
for(int i = 1; i <= lpn; i++){
if(n%i == 0){
ans.insert(i);
ans.insert(n/i);
}
}
while(!ans.empty()){
cout << *begin(ans) << endl;
ans.erase(*begin(ans));
}
} | #include<iostream>
using namespace std;
int main(){
int n;
cin >> n;
cout << n - 1 << endl;
} |
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <complex>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC optimization("unroll-loops, no-stack-protector")
//#pragma GCC target("avx,avx2,fma")
int gcd(int a, int b)
{
while (b != 0) {
int t = b;
b = a % b;
a = t;
}
return a;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n, i, j, k, MAXX = 10000, gg;
set<int> a;
vector<int> ans, aa;
for (i = 1; 2 * 3 * i < MAXX; i++) a.insert(2 * 3 * i);
for (i = 1; 5 * 3 * i < MAXX; i++) a.insert(5 * 3 * i);
for (i = 1; 2 * 5 * i < MAXX; i++) a.insert(2 * 5 * i);
a.erase(11 * 2 * 5);
a.erase(13 * 3 * 5);
for (auto p : a) aa.push_back(p);
cin >> n;
for (i = 0; i < n - 2; i++) ans.push_back(aa[i]);
ans.push_back(11 * 2 * 5);
ans.push_back(13 * 3 * 5);
for (auto p : ans) cout << p << " ";
cout << "\n";
gg = ans[0];
for (i = 0; i < n; i++) {
gg = gcd(gg, ans[i]);
for (j = i + 1; j < n; j++) {
int g = gcd(ans[i], ans[j]);
if ((ans[i] == ans[j]) || (g == 1))
break;
}
}
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
using li = long long;
const char newl = '\n';
template <class T> vector<vector<T>> vv(const unsigned int n, const unsigned int m, const T x) { return vector<vector<T>>(n, vector<T>(m, x)); }
template <class T> vector<vector<vector<T>>> vvv(const unsigned int n, const unsigned int m, const unsigned int k, const T x) { return vector<vector<vector<T>>>(n, vv(m, k, x)); }
template <class T> bool contains(const set<T>& s, const T& v) { return s.find(v) != s.end(); }
template <class T> bool contains(const unordered_set<T>& s, const T& v) { return s.find(v) != s.end(); }
template <class K, class V> bool contains_key(const map<K, V>& m, const K& v) { return m.find(v) != m.end(); }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
li n;
cin >> n;
vector<li> as(n), bs(n), ps(n);
for (int i = 0; i < n; ++i) {
cin >> as[i];
}
for (int i = 0; i < n; ++i) {
cin >> bs[i];
}
for (int i = 0; i < n; ++i) {
cin >> ps[i];
ps[i]--;
}
vector<li> wants(n);
for (int i = 0; i < n; ++i) {
wants[ps[i]] = i;
}
vector<bool> vis(n);
vector<li> is, js;
for (int i = 0; i < n; ++i) {
if (vis[i]) {
continue;
}
vector<li> cycle;
li pos = i;
while (!vis[pos]) {
vis[pos] = true;
cycle.emplace_back(pos);
pos = wants[pos];
}
if (cycle.size() <= 1) {
continue;
}
li light = bs[ps[pos]];
li light_arg = 0;
for (int j = 0; j < cycle.size(); ++j) {
li c = cycle[j];
if (light > bs[ps[c]]) {
light = bs[ps[c]];
light_arg = j;
}
}
for (auto c : cycle) {
if (as[c] <= bs[ps[c]]) {
cout << -1 << endl;
return 0;
}
}
for (int j = 0; j < cycle.size() - 1; ++j) {
is.emplace_back(cycle[(light_arg + j) % cycle.size()]);
js.emplace_back(cycle[(light_arg + j + 1) % cycle.size()]);
}
}
vector<li> qs = ps;
cout << is.size() << newl;
for (int i = 0; i < is.size(); ++i) {
cout << is[i] + 1 << " " << js[i] + 1 << newl;
swap(qs[is[i]], qs[js[i]]);
}
// for (int i = 0; i < n; ++i) {
// cout << qs[i] << " ";
// }
return 0;
} |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
using vii = vector<vector<int>>;
using vi = vector<int>;
int main()
{
int n, k, m;
cin >> n >> k >> m;
vi a(n-1);
int sum = 0;
rep(i, n - 1) {
cin >> a.at(i);
sum += a.at(i);
}
int ans = n * m - sum;
if (ans > k) {
ans = -1;
}
else if (ans < 0) {
ans = 0;
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
const int N=100010;
int main(){
int a,b,w;
cin>>a>>b>>w;
int m=1e9,M=0;
for(int n=1;n<=1e6;n++){
if(a*n<=1000*w&&1000*w<=b*n){
m=min(m,n);
M=max(M,n);
}
}
if(M==0)cout<<"UNSATISFIABLE";
else cout<<m<<' '<<M;
} |
#include <iostream>
using namespace std;
void chmax(double& a, double b){ if(a < b) a = b; }
int main(){
int N;
double D, H, ans = 0;
cin >> N >> D >> H;
while(N--){
double d, h;
cin >> d >> h;
chmax(ans, h - d * (H - h) / (D - d));
}
cout << ans << endl;
} | #define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
int main(void) {
int N;
double D, H;
cin >> N >> D >> H;
vector<double> d(N);
vector<double> h(N);
rep(i, N) cin >> d[i] >> h[i];
double ans = 0.0;
rep(i, N) {
// 切片を計算する
double temp = H - (H - h[i]) / (D - d[i]) * D;
ans = max(ans, temp);
}
cout << fixed << setprecision(15) << ans << endl;
return 0;
} |
#include<cstdio>
#define ll long long
ll n;
int main(){
scanf("%lld",&n);
for(ll i=3,a=1;i<=n;i*=3,a++)
for(ll j=5,b=1;j<=n;j*=5,b++)
if(i+j==n){printf("%d %d",a,b);return 0;}
printf("-1");
return 0;
} | #include<bits/stdc++.h>
#define ll long long
#define ld long double
#define mod 998244353
#define INF 998244353
#define ull unsigned long long
#define pb push_back
#define endl '\n'
#define pi acos(-1)
#define pii pair<ll int,ll int>
#define all(a) (a).begin(),(a).end()
#define F first
#define S second
#define sz(x) (ll int)x.size()
#define SIZE(X) ((int)((X).size()))
#define hell 1000000007
#define rep(i,a,b) for(ll int i=a;i<b;i++)
#define lbnd lower_bound
#define ubnd upper_bound
#define bs binary_search
#define mp make_pair
#define fo(i,s,n) for(int i=s;i<n;i++)
#define FORE(i,s,n) for(int i=s;i<=n;i++)
#define rep(i,n) for(int i=0;i<(n);++i)
#define repf(i,a,b) for(int i=(a);i<=(b);++i)
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end()) //removes repeated element;
#define Fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(0);
using namespace std;
const int N = 2*100010;
vector <ll> is_prime(N+1 , true);
bool sortinrev(const pair<int,int> &a,const pair<int,int> &b){return (a.first > b.first);}
bool sortbysecdesc(const pair<int,int> &a,const pair<int,int> &b){return a.second>b.second;}
bool sortbysec(const pair<int,int> &a,const pair<int,int> &b) {return (a.second < b.second);}
ll powerm(ll a, ll k) { if (!k) {return 1;}ll b = powerm(a, k / 2);b = b * b % INF;if (k % 2) {return a * b % INF;} else {return b;}}
ll int power(ll int a , ll int b) { if(b == 1) return a; if(b == 0) return 1; ll int m1 = power(a,b/2); if(b%2) return m1*m1*a; return m1*m1; }
void seive_of_eras(ll n) { is_prime[0] = 0; is_prime[1] = 0; for(ll i=2;i*i<=n;i++) { if(is_prime[i]) { for(ll j=i*i;j<=n;j+=i) { is_prime[j] = false; } } } }
bool isprime (ll a) { if(a<=1) return false; if(a==2||a==3) return true; if(a%2==0||a%3==0) return false; for(ll i=5;i*i<=a;i=i+6) { if(a%i==0||a%(i+2)==0) return false; } return true;}
void codeit()
{
//cout<<power(3 , 40)<<endl;
ll n; cin>>n;
for(ll i=1;i<=30;i++)
{
if(power(5 , i)>1e18)
{
break;
}
for(ll j=1;j<=39;j++)
{
ll k = power(5 , i) + power(3 , j);
if(k>1e18)
{
break;
}
if(k==n)
{
cout<<j<<" "<<i<<endl;
return;
}
}
}
cout<<-1<<endl;
return;
}
int main()
{
//Fast
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
ll tt; tt = 1;
//cin>>tt;
for(ll i=0;i<tt;i++)
codeit();
}
|
#include<bits/stdc++.h>
using namespace std;
const int N = 500003;
int n;
char s[N],t[N];
int main()
{
scanf("%d%s%s",&n,s+1,t+1);
long long sum = 0ll;
int p=2;
while(p<=n && s[p]!='1') ++p;
for(int i=1;i<=n;++i) {
if(p==i) {
++p;
while(p<=n && s[p]!='1') ++p;
}
if(s[i]!=t[i] && p>n) {
puts("-1");
return 0;
}
if(s[i]=='0' && t[i]=='1') {
swap(s[i],s[p]);
sum += (p-i);
while(p<=n && s[p]!='1') ++p;
} else if(s[i]=='1' && t[i]=='0') {
s[i] = s[p] = '0';
sum += (p-i);
while(p<=n && s[p]!='1') ++p;
}
}
cout << sum;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
char S[500005];
char T[500005];
priority_queue<int, vector<int>, greater<int> > A;
vector<int> B;
int main(){
int N;
scanf("%d", &N);
scanf(" %s %s", S, T);
int sizeA = 0;
for(int i = 0; i < N; i ++){
if(S[i] == '1'){
A.push(i);
sizeA ++;
}
if(T[i] == '1'){
B.push_back(i);
}
}
if(sizeA < (int)B.size()){
printf("-1");
return 0;
}else if( (sizeA-(int)B.size())&1 ){
printf("-1");
return 0;
}
//long long ans = (sizeA-(int)B.size())>>1;
long long ans = 0;
bool boleh = true;
for(int i = 0; i < (int)B.size(); i ++){
bool found = false;
while(!A.empty()){
int x = A.top();
if(x >= B[i]){
ans += x-B[i];
A.pop();
//printf("found x=%d B[i]=%d\n", x, B[i]);
found = true;
break;
}else{
A.pop();
if(A.empty()){
printf("-1");
return 0;
}
int y = A.top();
A.pop();
//printf("found x=%d y=%d\n", x, y);
ans += y-x;
}
}
if(!found){
boleh = false;
break;
}
}
while(!A.empty()){
int x = A.top();
A.pop();
if(A.empty()){
printf("-1");
return 0;
}
int y = A.top();
A.pop();
//printf("lastly, found x=%d y=%d\n", x, y);
ans += y-x;
}
if(!boleh){
printf("-1");
return 0;
}
printf("%lld", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<pair<ll,ll> > vpl;//追加はmake_pairを使う
typedef long double ld;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll> > pqg; //昇順のPriority queue
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)(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) { a=b; return 1; } return 0;}
#define dbl(i) fixed << setprecision(15) << i << endl;
#define GET_VARIABLE_NAME(Variable) (#Variable)
#define dbc(a) cout << GET_VARIABLE_NAME(a) << "=" << a << endl;
#define vsum(v) accumulate(all(v), 0);
#define rsort(v) sort(v.begin(),v.end(),greater<ll>());
bool IsPrime(int num)
{
if (num < 2) return false;
else if (num == 2) return true;
else if (num % 2 == 0) return false; // 偶数はあらかじめ除く
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2)
{
if (num % i == 0)
{
// 素数ではない
return false;
}
}
// 素数である
return true;
}
vector<ll> enum_divisors(ll N) {//約数列挙
vector<ll> res;
for (ll i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
// 重複しないならば i の相方である N/i も push
if (N/i != i) res.push_back(N/i);
}
}
// 小さい順に並び替える
sort(res.begin(), res.end());
return res;
}
vector<pair<long long, long long> > prime_factorize(long long N) {//因数分解
vector<pair<long long, long long> > res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0) continue;
long long ex = 0; // 指数
// 割れる限り割り続ける
while (N % a == 0) {
++ex;
N /= a;
}
// その結果を push
pair <ll,ll> push;
push.first=a;
push.second=ex;
res.push_back(push);
}
// 最後に残った数について
if (N != 1){
pair <ll,ll> push;
push.first=N;
push.second=1;
res.push_back(push);
}
return res;
}
ll gcd(ll a, ll b){//最大公約数
if (a%b == 0){
return(b);
}else{
return(gcd(b, a%b));
}
}
ll lcm(ll a, ll b){//最小公倍数
return a / gcd(a, b) * b;
}
ll comb(ll n, ll r) {
if(n<r) return 0;
if ( r * 2 > n ) r = n - r;
ll dividend = 1;
ll divisor = 1;
for ( ll i = 1; i <= r; ++i ) {
dividend *= (n-i+1);
divisor *= i;
}
return dividend / divisor;
}
void exgcd(ll a,ll b,ll &x,ll &y)
{
if(b==0){ x=1;y=0; }
else{ exgcd(b,a%b,y,x);y-=a/b*x; }
}
ll inv(ll a,ll Mod){//modにおけるaの逆元
ll x,y;
exgcd(a,Mod,x,y);
return (x%Mod+Mod)%Mod;
}
ll RepeatSquaring(ll N, ll P, ll M){
if(P==0) return 1;
if(P%2==0){
ll t = RepeatSquaring(N, P/2, M);
return t*t % M;
}
return N * RepeatSquaring(N, P-1, M);
}
ll rui(ll a,ll n){
ll x=1;
while(n>0){
if(n&1){
x=x*a;
}
a=a*a;
n>>=1;
}
return x;
}
ll f(ll n, vector <string>s){
if(s[n]=="OR"){
if(n==0)return 3;
return rui(2,n+1)+f(n-1,s);
}else{
if(n==0)return 1;
return f(n-1,s);
}
}
string toBinary(int n)
{
string r;
while (n != 0){
r += ( n % 2 == 0 ? "0" : "1" );
n /= 2;
}
return r;
}
int main(){
ll n,x;
cin>>n>>x;
rep(i,n){
ll t;
cin>>t;
if(t!=x)cout<<t<<" ";
}
cout<<endl;
} | #include <bits/stdc++.h>
#define ln '\n'
#define all(dat) dat.begin(), dat.end()
#define loop(i, to) for (int i = 0; i < to; ++i)
#define cont(i, to) for (int i = 1; i <= to; ++i)
#define circ(i, fm, to) for (int i = fm; i <= to; ++i)
#define foreach(i, dat) for (__typeof(dat.begin()) i = dat.begin(); i != dat.end(); ++i)
typedef long long num;
using namespace std;
const int nsz = 2e5;
int n, dfn[nsz + 5];
vector<int> g[nsz + 5];
void bfs(int s, int *d) {
static int q[nsz + 5];
int ql = 0, qr = 0;
cont (u, n) d[u] = -1;
for (q[qr++] = s, d[s] = 0; ql != qr;) {
int u = q[ql++];
for (int v : g[u]) if (d[v] == -1) q[qr++] = v, d[v] = d[u] + 1;
}
}
void inline find_diameter(vector<int> &nd) {
static int d[nsz + 5];
int u = 1, v = 1;
bfs(1, d);
cont (v, n) if (d[v] > d[u]) u = v;
bfs(u, d);
cont (u, n) if (d[u] > d[v]) v = u;
for (int w = v; w != u;) {
nd.push_back(w);
for (int v : g[w]) if (d[v] == d[w] - 1) {
w = v;
break;
}
}
nd.push_back(u);
}
void dfs(int u, int &t, int p1 = -1, int p2 = -1) {
t += 1;
dfn[u] = t;
for (int v : g[u]) if (v != p1 && v != p2) dfs(v, t, u);
t += 1;
}
void inline solve() {
vector<int> nd;
find_diameter(nd);
int t = 0;
loop (i, nd.size()) {
int p1 = i - 1 >= 0 ? nd[i - 1] : -1;
int p2 = i + 1 < nd.size() ? nd[i + 1] : -1;
dfs(nd[i], t, p1, p2);
t -= 1;
}
}
int main() {
scanf("%d", &n);
cont (i, n - 1) {
int u, v;
scanf("%d%d", &u, &v);
g[u].push_back(v), g[v].push_back(u);
}
solve();
cont (u, n) printf("%d%c", dfn[u], "\n "[u < n]);
} |
#include<bits/stdc++.h>
#define ll int
#define ld long double
using namespace std;
int main()
{
#ifndef ONLINE_JUDGE
freopen ("input.txt" , "r" , stdin);
// freopen ("OUTPUT.txt" , "w" , stdout);
#endif
ll tc=1;
//cin>>tc;
while(tc--)
{
ll n,w;
cin>>n>>w;
cout<<n/w<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int x, y, a, b, temp1, temp2;
cin >> a >> b;
x = (a + b) / 2;
y = a - x;
cout << x << " " << y << "\n";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
double EPS=1e-9;
int INF=1000000005;
long long INFF=1000000000000000005ll;
double PI=acos(-1);
int dirx[8]={ -1, 0, 0, 1, -1, -1, 1, 1 };
int diry[8]={ 0, 1, -1, 0, -1, 1, -1, 1 };
const ll MOD = 1000000007;
ll sum() { return 0; }
template<typename T, typename... Args>
T sum(T a, Args... args) { return a + sum(args...); }
#define DEBUG fprintf(stderr, "====TESTING====\n")
#define VALUE(x) cerr << "The value of " << #x << " is " << x << endl
#define OUT(x) cout << x << endl
#define OUTH(x) cout << x << " "
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define READ(x) for(auto &(z):x) cin >> z;
#define FOR(a, b, c) for (int(a)=(b); (a) < (c); ++(a))
#define FORN(a, b, c) for (int(a)=(b); (a) <= (c); ++(a))
#define FORD(a, b, c) for (int(a)=(b); (a) >= (c); --(a))
#define FORSQ(a, b, c) for (int(a)=(b); (a) * (a) <= (c); ++(a))
#define FORC(a, b, c) for (char(a)=(b); (a) <= (c); ++(a))
#define EACH(a, b) for (auto&(a) : (b))
#define REP(i, n) FOR(i, 0, n)
#define REPN(i, n) FORN(i, 1, n)
#define MAX(a, b) a=max(a, b)
#define MIN(a, b) a=min(a, b)
#define SQR(x) ((ll)(x) * (x))
#define RESET(a, b) memset(a, b, sizeof(a))
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ALL(v) v.begin(), v.end()
#define ALLA(arr, sz) arr, arr + sz
#define SIZE(v) (int)v.size()
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr, sz) sort(ALLA(arr, sz))
#define REVERSEA(arr, sz) reverse(ALLA(arr, sz))
#define PERMUTE next_permutation
#define TC(t) while (t--)
#define FAST_INP ios_base::sync_with_stdio(false);cin.tie(NULL)
#define what_is(x) cerr << #x << " is " << x << endl;
void solve() {
}
int main()
{
FAST_INP;
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r", stdin);
// freopen("output.txt","w", stdout);
// #endif
// int tc; cin >> tc;
// TC(tc) solve();
int n, a; cin >> n;
set<int> taken;
int smallest = 0;
REP(i,n) {
cin >> a;
while(a==smallest||taken.find(smallest)!=taken.end()) smallest++;
OUT(smallest);
if(a>=0) taken.insert(a);
}
return 0;
} | #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 rep2(i, n, m) for(int i=(int)n; i<=(int)m; i++)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> wi;
typedef vector<ll> vl;
const ll inf=1LL<<60;
const int MOD=1000000007;
const int mod=998244353;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vi p(n);
rep(i, n)cin >> p[i];
set<int> q;
rep(i, 200001)q.insert(i);
int ans=0;
rep(i, n){
q.erase(p[i]);
cout << *q.begin() << endl;
}
return 0;
} |
#include<bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> //Policy Based Data Structure
// using namespace __gnu_pbds; //Policy Based Data Structure
using namespace std;
// typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> pbds; //Policy Based Data Structure
// #define gc getchar_unlocked
// #define pqb priority_queue<int>
// #define pqs priority_queue<int, vi, greater<int> >
// #define mk(arr,n,type) type *arr = new type[n]
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define int long long
#define endl '\n'
#define w(t) int t; cin>>t; while(t--)
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x,y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it,a) for(auto it = a.begin(); it != a.end(); it++)
#define ps(x,y) fixed<<setprecision(y)<<x
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define PI 3.1415926535897932384626
#define inf 1e18
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); //Random Shuffler
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
typedef map<int, int> mii;
int mpow(int base, int exp);
void ipgraph(int m);
void dfs(int u, int par);
const int mod = 1000000007;
// const int N = 3e5, M = N;
// vi g[N];
//=======================
void sol()
{
int n;
cin >> n;
int i, a[n], j;
fo(i, n)cin >> a[i];
int ans = a[0];
for ( i = 0; i < n; ++i)
{ int mi_n = a[i];
for ( j = i; j < n; j++)
{
mi_n = min(mi_n, a[j]);
ans = max(ans, (j - i + 1) * mi_n);
}
}
cout << ans;
}
int32_t main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
sol();
return 0;
}
int mpow(int base, int exp) {
base %= mod;
int result = 1;
while (exp > 0) {
if (exp & 1) result = (result * base) % mod;
base = (base * base) % mod;
exp >>= 1;
}
return result;
}
// void ipgraph(int n, int m){
// int i, u, v;
// while(m--){
// cin>>u>>v;
// g[u-1].pb(v-1);
// g[v-1].pb(u-1);
// }
// }
//
// void dfs(int u, int par){
// for(int v:g[u]){
// if (v == par) continue;
// dfs(v, u);
// }
// } | #include"bits/stdc++.h"
using namespace std;
using ll = long long;
#define rep(i,m,n) for(ll i=m;i<n;i++)
const ll mod = 1000000007;
const long double pai = 3.14159265358979;
int main() {
ll n;
cin >> n;
vector<long double>a(n);
rep(i, 0, n)cin >> a[i];
sort(a.begin(), a.end());
long double sum = 0;
rep(i, 0, n)sum += a[i];
long double ans = sum;
long double sumcopy = sum;
long double minus = 0;
rep(i, 0, n) {
long double x = a[i] / 2;
long double sub = 0;
sub += n * x;
sub += sum;
sub -= (2 * x) * (n - i);
sub -= minus;
//cout << sub << endl;
minus += a[i];
ans = min(ans, sub);
}
cout << setprecision(15) << fixed << ans / n << endl;
return 0;
} |
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const long long inf = 1LL<<60;
using ll = long long;
template<int MOD> struct ModInt {
static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
int get() const { return (int)x; }
ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
return ModInt(u); }
bool operator==(ModInt that) const { return x == that.x; }
bool operator!=(ModInt that) const { return x != that.x; }
ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
typedef ModInt<1000000007> mint;
mint dp[3000][3001];
ll a[3000];
int main(){
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int n;
cin >> n;
for (int i=0; i<n; i++) {
cin >> a[i];
}
for (int i=0; i<n; i++) {
dp[i][1] = mint(1);
}
for (int i=2; i<=n; i++) {
ll val = 0;
unordered_map<int, mint> v;
for (int j=0; j<n; j++) {
if (j < i-1) {
val += a[j];
v[val%i] += dp[j][i-1];
continue;
}
val += a[j];
dp[j][i] += v[val%i];
v[val%i] += dp[j][i-1];
}
}
mint ans = mint(0);
for (int i=1; i<=n; i++) ans += dp[n-1][i];
cout << ans << endl;
}
| //------------------------------------------
// C++ templete
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;
//type
//------------------------------------------
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>;
//REPEAT
//------------------------------------------
#define REP(i,a,b) for(int i=(a);i<(b);++i)
//container util
//------------------------------------------
#define pb push_back
#define paired make_pair
#define ALL(a) (a).begin(),(a).end()
#define PRINT(V) for (auto v : (V)) cout << v << " "
#define SORT(V) sort((V).begin(),(V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
#define SZ(x) ((int)(x).size())
//constant
//------------------------------------------
const int MOD = 1000000007;
const long long INF = 1000000000000000000;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
//math
//------------------------------------------
int QP(int a,int b){int ans=1;do{if(b&1)ans=1ll*ans*a%MOD;a=1ll*a*a%MOD;}while(b>>=1);return ans;}
int QP(int a,int b,int MOD){int ans=1;do{if(b&1)ans=1ll*ans*a%MOD;a=1ll*a*a%MOD;}while(b>>=1);return ans;}
int GCD(int a,int b){return b?GCD(b,a%b):a;}
//debug
//------------------------------------------
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
//functions
//------------------------------------------
vi IntToVec(int bit, int N) {
vi S(N, 0);
REP(i, 0, N){if(bit&(1<<i)){S[i]=1;}}
return S;
}
//grobal variable
//------------------------------------------
long long N,K,M;
vi Vec;
//main
//------------------------------------------
int main(){
ll N, Sum=0;
cin>>N;
REP(i, 0, N){
ll A, B;
cin>>A>>B;
Sum+=(B+A)*(B-A+1)/2;
}
cout<<Sum<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using PII = pair<int, int>;
using VI = vector<int>;
#define fst first
#define snd second
const int N = 105;
string adj[N];
int n;
bool vis[N];
void dfs(int u) {
if (vis[u]) return;
vis[u] = true;
for (int v = 0; v < n; v++) {
if (adj[v][u] == '1') dfs(v);
}
}
int main() {
#ifdef LOCAL_EXEC
// freopen("sample.in", "r", stdin);
// freopen("sample.out", "w", stdout);
#else
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#endif
cin >> n;
for (int i = 0; i < n; i++) {
cin >> adj[i];
}
double ans = 0;
for (int u = 0; u < n; u++) {
memset(vis, 0, sizeof vis);
dfs(u);
int d = 0;
for (int v = 0; v < n; v++) {
if (vis[v]) d++;
}
ans += 1.0 / d;
}
cout << setprecision(10) << fixed << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define tej ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define ve vector<int>
#define vl vector<long long int>
#define vp vector<pair<long long int,long long int>>
#define pb push_back
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define bp pop_back
#define fp pop_front
#define mp make_pair
#define fo(i,n) for(i=0;i<n;i++)
#define unq(v) unique(v.begin(), v.end())-v.begin()
#define fnd(v,a) find(v.begin(), v.end(), a)
#define uprb(v,a) upper_bound(v.begin(), v.end(), a)
#define upra(v,n,a) upper_bound(v, v+n, a)
#define lowb(v,a) lower_bound(v.begin(), v.end(), a)
#define lowa(v,n,a) lower_bound(v, v+n, a)
#define newuv(v) v.erase(unique(v.begin(),v.end()),v.end())
#define rev(v) reverse(v.begin(),v.end())
#define rndshf(v) random_shuffle(v.begin(),v.end())
#define all(v) v.begin(),v.end()
// ll po(ll a,ll b,ll m)
// {
// ll t=1;
// while(b>0)
// {
// if(b%2!=0)
// {
// t=(t*a)%m;
// }
// a=(a*a)%m;
// b=b/2;
// }
// return t;
// }
// ll po(ll a,ll b)
// {
// ll t=1;
// while(b>0)
// {
// if(b%2!=0)
// {
// t=(t*a);
// }
// a=(a*a);
// b=b/2;
// }
// return t;
// }
// ll inv(ll a,ll m)
// {
// return po(a,m-2,m);
// }
// ll vis[100002]={0},x=0;
// vl v[100002];
// ll dfs(ll s)
// {
// ll c=1,i;
// if(v[s].size()>2)
// {
// }
// for(i=0;i<v[s].size();i++)
// {
// if(vis[v[s][i]]==0)
// {
// vis[v[s][i]]=1;
// c+=dfs(v[s][i]);
// }
// }
// x+=c-1;
// //cout<<x<<endl;
// return c;
// }
void solve()
{
ll n,i,si;
cin>>n;
string s;
vector<char>v;
cin>>s;
for(i=0;i<n;i++)
{
v.pb(s[i]);
if(v.size()>=3)
{
si=v.size();
if(v[si-1]=='x'&&v[si-2]=='o'&&v[si-3]=='f')
{
v.pop_back();
v.pop_back();
v.pop_back();
}
}
}
cout<<v.size();
}
int main()
{
tej
ll t=1;
//cin>>t;
while(t--)
solve();
return 0;
}
|
//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//#define int long long
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define a first
#define b second
#define fi first
#define sc second
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
#define all(x) x.begin(),x.end()
#define si(x) int(x.size())
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif
template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}
template<class t> using vc=vector<t>;
template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
return os<<"{"<<p.fi<<","<<p.sc<<"}";
}
template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
os<<"{";
for(auto e:v)os<<e<<",";
return os<<"}";
}
template<class T>
void g(T &a){
cin >> a;
}
template<class T>
void o(const T &a,bool space=false){
cout << a << (space?' ':'\n');
}
//ios::sync_with_stdio(false);
const ll mod = 1000000007;//998244353
mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());
template<class T>
void add(T&a,T b){
a+=b;
if(a >= mod) a-=mod;
}
ll modpow(ll x,ll n){
ll res=1;
while(n>0){
if(n&1) res=res*x%mod;
x=x*x%mod;
n>>=1;
}
return res;
}
template<class T> using mat = vc<vc<T>>;
template<class T>
mat<T> operator*(mat<T> a, mat<T> b){
if(a.empty() || b.empty()) return mat<T>();
int n = a.size();
int m = b[0].size();
int len = a[0].size();
assert(len == b.size());
mat<T>ret(n);
rep(i, n) ret[i] = vc<T>(m);
rep(i, n) rep(j, len) rep(k, m){
ll add = (ll)(a[i][j]) * b[j][k];
add %= mod;
ret[i][k] += add;
if(ret[i][k] >= mod) ret[i][k] -= mod;
}
return ret;
}
void solve(){
int n, m, k;
cin >> n >> m >> k;
mat<ll>M(n, vc<ll>(n));
rep(i, n) M[i][i] = 1;
vc<ll>num(n);
rep(i, n) cin>>num[i];
ll rv = modpow(2*m, mod-2);
rep(i, m){
int a, b; cin >> a >> b;
a--; b--;
M[a][a] -= rv;
M[b][b] -= rv;
M[a][b] += rv;
M[b][a] += rv;
}
rep(i, n) rep(j, n) M[i][j] = (M[i][j]%mod+mod)%mod;
mat<ll>ret(n, vc<ll>(n));
rep(i, n) ret[i][i] = 1;
while(k){
if(k&1) ret = ret*M;
k >>= 1;
M = M*M;
}
mat<ll>ans(n, vc<ll>(1));
rep(i, n) ans[i][0] = num[i];
auto result = ret*ans;
rep(i, n) o(result[i][0]);
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(0);
cout<<fixed<<setprecision(20);
int t; t = 1; //cin >> t;
while(t--) solve();
}
| //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define repa(i,a,n) for (long long i = (a); i < (long long)(n); i++)
#define Rrep(i,n) for (long long i = (long long)(n)-1; i >= 0; i--)
#define Rrepa(i,a,n) for (long long i = (long long)(n)-1; i >= a; i--)
using ll = long long;
class Prints {
class __Prints {
public:
__Prints(const char* sep, const char* term) : sep(sep), term(term) {}
template <class... Args>
void operator()(const Args&... args) const { print(args...); }
template <typename T>
void pvec(const T& vec, size_t sz) const {
for (size_t i = 0; i < sz; i++)
std::cout << vec[i] << (i == sz - 1 ? term : sep);
}
template <typename T>
void pmat(const T& mat, size_t h, size_t w) {
for (size_t i = 0; i < h; i++)
for (size_t j = 0; j < w; j++)
std::cout << mat[i][j] << (j == w - 1 ? term : sep);
}
private:
const char *sep, *term;
void print() const { std::cout << term; }
void print_rest() const { std::cout << term; }
template <class T, class... Tail>
void print(const T& head, const Tail&... tail) const { std::cout << head, print_rest(tail...); }
template <class T, class... Tail>
void print_rest(const T& head, const Tail&... tail) const { std::cout << sep << head, print_rest(tail...); }
};
public:
Prints() {}
__Prints operator()(const char* sep = " ", const char* term = "\n") const { return __Prints(sep, term); }
};
Prints print;
//一次元配列はprint().pvec(vec,要素数);
//二次元配列はprint().pmat(vec,要素数1,要素数2);
using P = pair<ll,ll>;
const ll INF = 2e18;
ll func(ll N,ll K){
if (N % K == 0) return 0;
else return K - (N%K);
}
void dijkstra(vector<vector<tuple<ll,ll,ll>>> &road,ll N,ll M,ll X,ll Y){
vector<ll> dist(N,INF);
priority_queue<P, vector<P>, greater<P>> que;
dist[X] = 0;
que.push(P(0,X));
while (!que.empty()){
P p = que.top();que.pop();
ll v = p.second;
if (dist[v] < p.first) continue;
rep(i,road[v].size()){
ll val = dist[v] + get<1>(road[v][i]) + func(p.first,get<2>(road[v][i]));
if (dist[get<0>(road[v][i])] > val){
dist[get<0>(road[v][i])] = val;
que.push(P(dist[get<0>(road[v][i])],get<0>(road[v][i])));
}
}
}
cout << (dist[Y]==INF? -1 : dist[Y]) << endl;
}
int main() {
ll N,M,X,Y;
cin >> N >> M >> X >> Y;
X--;
Y--;
vector<vector<tuple<ll,ll,ll>>> d(N);
rep(i,M){
ll A,B,T,K;
cin >> A >> B >> T >> K;
d[A-1].push_back(make_tuple(B-1,T,K));
d[B-1].push_back(make_tuple(A-1,T,K));
}
dijkstra(d,N,M,X,Y);
} |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <iomanip>
using namespace std;
using ll = long long int;
vector<string> myspliter(const string &s, const char delimiter){
vector<string> res;
string part = "";
for(auto &p: s){
if(p == delimiter){
if(part.length() > 0) res.push_back(part);
part = "";
}else{
part += p;
}
}
if(part.length() > 0) res.push_back(part);
return res;
}
ll transToInt(vector<string> str){
ll ans = 0;
ans += stoi(str[0])*10000;
if(str.size() == 2){
while(str[1].length() < 4) str[1] += '0';
ans += stoi(str[1]);
}
return ans;
}
ll solve(ll x, ll y, ll r){
ll ans = 0;
for(ll i = -2'000'000'000; i <= 2'000'000'000; i += 10000){
if(r*r-(i-y)*(i-y) < 0) continue;
ll inner = x;
ll outer = 4'000'000'000;
ll border = r*r-(i-y)*(i-y);
while(outer-inner > 1){
ll mid = (outer+inner)/2;
if((mid-x)*(mid-x) <= border) inner = mid;
else outer = mid;
}
ll left = x*2-inner;
ll right = inner;
if(left <= 0){
left = left/10000 - 1;
}else{
left = (left-1)/10000;
}
if(right < 0){
right = (right+1)/10000;
}else{
right = right/10000 + 1;
}
ans += max(right - left - 1, 0LL);
// if(right > 1 && left < -1) ans++;
// if(i == 00000) cerr << left << " " << right << " " << inner << endl;
}
return ans;
}
int main(){
string x0, y0, r0;
cin >> x0 >> y0 >> r0;
ll x = transToInt(myspliter(x0, '.'));
ll y = transToInt(myspliter(y0, '.'));
ll r = transToInt(myspliter(r0, '.'));
cout << solve(x, y, r) << endl;
return 0;
} | #ifdef Rahul
#include "RAHUL.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define error(...) 42;
#endif
#define SZ(v) int((v).size())
#define ALL(vec) begin(vec), end(vec)
typedef long long i64;
template<typename T> inline bool uax(T &x, T y) {return (y > x) ? x = y, true : false;}
template<typename T> inline bool uin(T &x, T y) {return (y < x) ? x = y, true : false;}
template<typename T> void kek(T ans) {cout << ans << endl; exit(0);}
#define Luv(...) [&] (auto &&u, auto &&v) { return __VA_ARGS__; }
const int MOD = (int) 1e9 + 7;
const i64 INF = (i64) 1e18 + 42;
const long double eps = 1e-9;
int main() {
cin.tie(nullptr) -> sync_with_stdio(false);
long double X, Y, r; cin >> X >> Y >> r;
long double r2 = r * r;
i64 ans = 0;
for (int x = int(X - r - 2); x <= int(X + r + 2); ++x) {
int uy, dy;
long double dx = (X - x) * (X - x);
{
int lo = Y - r - 2, hi = Y;
while (lo < hi) {
int md = (lo + hi) >> 1;
if (dx + (Y - md) * (Y - md) <= r2 + eps) hi = md;
else lo = md + 1;
}
dy = lo;
}
{
int lo = ceil(Y) + eps, hi = Y + r + 2;
while (lo < hi) {
int md = (lo + hi + 1) >> 1;
if (dx + (Y - md) * (Y - md) <= r2 + eps) lo = md;
else hi = md - 1;
}
uy = lo;
}
if (dx + (Y - dy) * (Y - dy) > r2 + eps) {
++dy;
}
if (dx + (Y - uy) * (Y - uy) > r2 + eps) {
--uy;
}
if (uy >= dy) ans += uy - dy + 1;
}
kek(ans);
} |
#include "bits/stdc++.h"
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
long long a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, m = 0, n = 0, p = 0, q = 0, mod = 1000000007, pi = 3.1415926535;
string s1, s2;
char moji;
cin >> a;
cout << (a-1)/100+1 << endl;
return 0;
} | #include <iostream>
using namespace std;
#include <math.h>
bool IsPrime(int num) {
if (num < 2)
return false;
else if (num == 2)
return true;
else if (num % 2 == 0)
return false; // 偶数はあらかじめ除く
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
// 素数ではない
return false;
}
}
// 素数である
return true;
}
int main() {
int N;
cin >> N;
long long val = 1;
for (int i = 2; i <= N; i++) {
if (IsPrime(i))
val *= i;
}
if (2 * 2 <= N) {
val *= 2;
}
if (2 * 2 * 2 <= N) {
val *= 2;
}
if (2 * 2 * 2 * 2 <= N) {
val *= 2;
}
if (3 * 3 <= N) {
val *= 3;
}
if (3 * 3 * 3 <= N) {
val *= 3;
}
if (5 * 5 <= N) {
val *= 5;
}
cout << val + 1 << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define speed ios_base::sync_with_stdio(0); cin.tie(0);
#define FL(i,a,n) for(ll i=a;i<n;i++)
#define even(x) (((x)%(2)) == (0))
#define odd(x) (((x)%(2)) == (1))
#define meme(x) memset(x, 0, sizeof(x))
#define mod 1000000007
#define onebit(x) __builtin_popcountll(x)
#define endl "\n"
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) (x).begin(),(x).end()
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double,double> pdd;
typedef pair<ld,ld> pld;
typedef pair<string , string> pss;
int main()
{
int t;
t=1;
//cin>>t;
while(t--)
{
ll a,b,k;
cin>>a>>b>>k;
while(a>0 && b>0)
{
a--;
b--;
}
if(a==0 && b!=0)
cout<<"Aoki"<<endl;
else if(b==0 && a!=0)
cout<<"Takahashi"<<endl;
else
{
if(a==0 && b==0)
{
if(k==1)
cout<<"Takahashi"<<endl;
else
{
cout<<"Aoki"<<endl;
}
}
}
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
void __print(int x){cout<<x;}void __print(long x){cout<<x;}
void __print(long long x){cout<<x;}void __print(unsigned x){cout<<x;}
void __print(unsigned long x){cout<<x;}void __print(unsigned long long x){cout<<x;}
void __print(float x){cout<<x;}void __print(double x){cout<<x;}
void __print(long double x){cout<<x;}void __print(char x){cout<<'\''<<x<<'\'';}
void __print(const char *x){cout<<'\"'<<x<<'\"';}void __print(const string &x){cout<<'\"'<<x<<'\"';}
void __print(bool x) {cout<<(x?"true":"false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cout << '{'; __print(x.first); cout << ','; __print(x.second); cout << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cout << '{'; for (auto &i: x) cout << (f++ ? "," : ""), __print(i); cout << "}";}
void _print() {cout << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cout << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cout << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
#define lp(i,a,b) for (ll i=a;i<=b;i++)
#define rp(i,a,b) for (ll i=a;i>=b;i--)
#define ms(a,x) memset(a,x,sizeof a)
#define ll long long
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
#define nl cout<<"\n"
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a)*(b))/(gcd(a,b))
#define sq(a) ((a)*(a)*(a))
#define sz(a) (int) a.size()
#define mod 1000000007
#define PI (2*acos(0.0))
const ll N=2e5+5;
vector<array<ll,2>> g[N];
ll A[N];
void dfs(ll node,ll p,ll x)
{
A[node]=x;
for(auto [adj,cost]:g[node])
{
if(adj!=p) dfs(adj,node,x^cost);
}
}
void solve()
{
ll n;
cin>>n;
lp(i,1,n-1)
{
ll a,b,c;
cin>>a>>b>>c;
g[a].pb({b,c});
g[b].pb({a,c});
}
dfs(1,-1,0);
ll res=0;
lp(i,0,60)
{
ll one=0,zero=0;
lp(j,1,n)
{
if(A[j] & 1ll<<i) one++;
else zero++;
}
res=((res)+(1ll<<i)%mod*one%mod*zero%mod)%mod;
}
cout<<res;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int T=1;
//cin>>T;
while(T--) solve();
}
|
#include <bits/stdc++.h>
using namespace std;
#define forr(i,m,n) for (int i=(m); i<=(n); i++)
#define forv(i,m,n) for (int i=(m); i>=(n); i--)
#define forall(it,p) for (auto it = p.begin(); it != p.end(); ++it)
#define R 998244353
#define DBG 1
typedef pair<int,int> pii;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<ll,pll> pl3;
#define MAXN 100000
int a[MAXN];
unordered_map<ll,ll> h;
unordered_map<ll,ll> g;
ll f(int n, int k) {
if (n==k) return 1;
if (n<k || k==0) return 0;
auto p = h.find((n<<16)|k);
if (p!=h.end()) return p->second;
ll sm = 0;
int stt = max(0,2*k-n);
vector<pl3> q;
forr(i,stt,k) {
int nn = n-i;
int kk = 2*(k-i);
auto p = g.find((nn<<16)|kk);
if (p!=g.end()) {
sm = p->second;
break;
} else {
ll v = f(nn,kk);
q.push_back(pl3(nn,pll(kk,v)));
}
}
while (q.size()>0) {
int nn = q.back().first;
int kk = q.back().second.first;
ll v = q.back().second.second;
q.pop_back();
sm = (sm+v)%R;
g[(nn<<16)|kk] = sm;
}
h[(n<<16)|k] = sm;
return sm;
}
int main() {
int n,k;
cin >> n >> k;
cout << f(n,k) << endl;
}
| #include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=998244353;
int dp[3005][3005];
signed main(){
int n,k;
cin>>n>>k;
dp[0][0]=1;
for(int i=1;i<=n;i++){
for(int j=i;j>=1;j--){
dp[i][j]=(dp[i-1][j-1]+dp[i][j*2])%mod;
}
}
cout<<dp[n][k];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
const int MOD = 998244353;
int n, sz[N], rt[N], comp;
int get(int u) {
if (rt[u] == u) {
return u;
}
rt[u] = get(rt[u]);
return rt[u];
}
void mrg(int u, int v) {
u = get(u);
v = get(v);
if (u == v) {
return;
}
if (sz[v] > sz[u]) {
swap(u, v);
}
comp --;
rt[v] = rt[u];
sz[u] += sz[v];
}
int main(int argc, char const *argv[]) {
cin >> n;
comp = n;
for (int i = 1; i <= n; ++i) {
sz[i] = 1;
rt[i] = i;
}
for (int i = 1; i <= n; ++i) {
int x;
cin >> x;
mrg(i, x);
}
int ans = 1;
for (int i = 0; i < comp; ++i) {
ans = (2LL * ans) % MOD;
}
ans = (1LL * ans + MOD - 1) % MOD;
cout << ans;
return 0;
} | #include <iostream>
#include <iomanip>
#include <cmath>
using namespace std;
int main(void){
int N, xbuf;
cin >> N;
long long D1buf = 0;
long long D2buf = 0;
long long D3buf = 0;
for(int i=0; i<N; i++){
cin >> xbuf;
D1buf += abs(xbuf);
D2buf += (long long)xbuf * xbuf;
D3buf = max(D3buf, (long long)abs(xbuf));
}
cout << D1buf << endl;
cout << setprecision(10) << sqrtl(D2buf) << endl;
cout << D3buf << endl;
return 0;
} |
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define dbl(k, x) fixed << setprecision(k) << (x)
template <typename _T>
inline void _DBG(const char *s, _T x) {
cerr << s << " = " << x << "\n";
}
template <typename _T, typename... args>
void _DBG(const char *s, _T x, args... a) {
while (*s != ',') cerr << *s++;
cerr << " = " << x << ',';
_DBG(s + 1, a...);
}
#define _upgrade \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define DBG(...) _DBG(#__VA_ARGS__, __VA_ARGS__)
// ********************** CODE ********************** //
long long f(long long n, long long s) {
long long x = min(n, s - 1);
return x - (s - x) + 1;
}
int main() {
_upgrade;
long long N, K;
cin >> N >> K;
long long res = 0;
for (long long s = max(K + 2, 2LL); s <= 2 * N; s++) {
if (s - K >= 2 && s - K <= 2 * N) {
res += f(N, s) * f(N, s - K);
}
}
cout << res << "\n";
return 0;
} | #include <bits/stdc++.h>
#define F first
#define S second
#define rep(i, a, b) for(int i = (a); i < (b); ++i)
#define per(i, a, b) for(int i = (b)-1; i >= (a); --i)
#define bck(i, a, b) if ((i) >= (a) && (i) < (b))
#define trav(x, a) for (auto &x : (a))
#define sz(a) (int)(a).size()
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back
#define eb emplace_back
using namespace std;
typedef long long ll;
typedef string str;
template<typename T> using vec = vector<T>;
template<typename T> using pq = priority_queue<T, vector<T>, std::greater<T>>;
template<typename T> using mxpq = priority_queue<T>;
typedef pair<int,int> pii;
typedef vec<int> vi;
typedef vec<pii> vii;
typedef vec<vi> vvi;
typedef pair<ll,ll> pll;
typedef vec<ll> vl;
typedef vec<pll> vll;
typedef vec<vl> vvl;
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
template<typename A, typename B>
istream& operator>>(istream& s, pair<A,B>& p) { return s>>p.first>>p.second; }
template<typename T>
istream& operator>>(istream& s, vec<T>& p) {
for (T& t : p) s >> t;
return s;
}
#define MOD 1000000007ll
vl mmul(const vl& a, const vl& b, int n) {
vl r(sz(b));
rep(i, 0, n) rep(k, 0, n) rep(j, 0, n)
(r[i*n+j] += a[i*n+k] * b[k*n+j] % MOD) %= MOD;
return r;
}
vl vmul(const vl& a, const vl& b, int n) {
vl r(sz(b));
rep(i, 0, n) rep(j, 0, n)
(r[i] += a[i*n+j] * b[j] % MOD) %= MOD;
return r;
}
ll modpow(ll b, ll e, ll mod=MOD) {
if (e < 0) return modpow(modpow(b, mod-2, mod), -e, mod);
ll r = 1;
while (e) {
if (e & 1) r = r*b % mod;
b = b*b % mod;
e /= 2;
}
return r;
}
ll modinv(ll n, ll mod=MOD) { return modpow(n, mod-2, mod); }
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
ll n, m, k; cin >> n >> m >> k;
vl a(n), mat(n*n); cin >> a;
rep(i, 0, n) mat[i*n+i] = 1;
rep(i, 0, m) {
int x, y; cin >> x >> y; x--, y--;
(mat[x*n+x] -= modinv(m)*modinv(2) % MOD) %= MOD;
(mat[y*n+y] -= modinv(m)*modinv(2) % MOD) %= MOD;
(mat[x*n+y] += modinv(m)*modinv(2) % MOD) %= MOD;
(mat[y*n+x] += modinv(m)*modinv(2) % MOD) %= MOD;
}
trav(v, mat) (v += MOD) %= MOD;
while (k) {
if (k & 1) a = vmul(mat, a, n);
mat = mmul(mat, mat, n);
k >>= 1;
}
trav(v, a) cout << v << endl;
}
|
#include <bits/stdc++.h>
#define numm ch-48
#define pd putchar(' ')
#define pn putchar('\n')
#define int long long int
using namespace std;
template<typename T>
void read(T &res) {
bool flag = false;
char ch;
while (!isdigit(ch = getchar())) (ch == '-') && (flag = true);
for (res = numm; isdigit(ch = getchar()); res = (res << 1) + (res << 3) + numm);
flag && (res = -res);
}
template<typename T>
void write(T x) {
if (x < 0) putchar('-'), x = -x;
if (x > 9) write(x / 10);
putchar(x % 10 + '0');
}
/// #pragma GCC optimize(3,"Ofast","inline")
//////////////////////////////////////////////////////////////////////////////////////////////
int h, w, x, y;
string mp[105];
signed main() {
cin >> h >> w >> x >> y;
for (int i = 1; i <= h; i++) {
cin >> mp[i];
mp[i] = ' ' + mp[i];
}
int ans = 1;
if (mp[x][y] != '.') {
write(0), pn;
}
int i = 1;
while (x + i <= h and mp[x + i][y] == '.') ans++, i++;
i = 1;
while (x - i > 0 and mp[x - i][y] == '.') ans++, i++;
i = 1;
while (y + i <= w and mp[x][y + i] == '.') ans++, i++;
i = 1;
while (y - i > 0 and mp[x][y - i] == '.') ans++, i++;
write(ans);
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
#include<stdio.h>
#include<math.h>
#include<string.h>
using namespace std;
double mina(double a,double b)
{
if(a<=b)
return a;
return b;
}
double maxa(double a,double b)
{
if(a<=b)
return b;
return a;
}
int main() {
long long int t,n,i,j,k,l,flag,flag1,count,count1,count2,count3,count4,sum,max1,max2,m,c1,c2,temp,suma,sumb;
long long int d,e,a,b,c;
double a2[300001],b1[2002][3],a1[300001];
//vector< long long int> v1,v2,v;
// vector< pair <long long int,long long int> > v3;
// string s1,s2,s;
// char s[300001],s1[300001];
// long long int f[100001];
// for(i=0;i<100001;i++)
// f[i]=0;
count=0,flag=0,flag1=0,sum=0,max1=0,max2=0,c1=0,c2=0,temp=0,suma=0,sumb=0,count1=0,count2=0,count3=0,count4=0;
// long long int max3=0,max4=0,ans=0,mina=999999999999999999,c0=0,c3,c4;
cin>>n;
for(i=0;i<n;i++)
{
for(j=0;j<3;j++)
cin>>b1[i][j];
}
for(i=0;i<n;i++)
{
if(b1[i][0]==2)
b1[i][2]=b1[i][2]-0.1;
else if(b1[i][0]==3)
b1[i][1]=b1[i][1]+0.1;
if(b1[i][0]==4)
{
b1[i][2]=b1[i][2]-0.1;
b1[i][1]=b1[i][1]+0.1;
}
}
for(i=0;i<n;i++)
{
if(b1[i][1]>b1[i][2])
swap(b1[i][1],b1[i][2]);
}
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(mina(b1[i][2],b1[j][2]) >=maxa( b1[i][1],b1[j][1]) )
count++;
}
}
//for(i=0;i<n;i++)
// for(j=0;j<3;j++)
// cout<<b1[i][j];
cout<<count;
return 0;
} |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 1e9;
#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)
void Main() {
int n;
cin >> n;
vector<vector<int>> c(n, vector<int>(n));
rep(i, n) rep(j, n) cin >> c[i][j];
vector<int> a(n), b(n);
a[0] = 0;
rep(i, n) {
if(i == 0) {
rep(j, n) { b[j] = c[i][j] - a[0]; }
} else {
int ai = c[i][0] - b[0];
rep(j, n) {
if(c[i][j] - b[j] != ai) {
cout << "No" << endl;
return;
}
}
a[i] = ai;
}
}
int mini = INF;
rep(i, n) if(a[i] < mini) mini = a[i];
// cout << mini << endl;
if(mini < 0) {
rep(i, n) a[i] -= mini;
rep(i, n) b[i] += mini;
}
mini = INF;
rep(i, n) if(b[i] < mini) mini = b[i];
// cout << mini << endl;
if(mini < 0) {
rep(i, n) b[i] -= mini;
rep(i, n) a[i] += mini;
}
rep(i, n) if(a[i] < 0 || b[i] < 0) {
cout << "No" << endl;
return;
}
cout << "Yes" << endl;
rep(i, n) {
if(i == n - 1)
cout << a[i] << endl;
else
cout << a[i] << " ";
}
rep(i, n) {
if(i == n - 1)
cout << b[i] << endl;
else
cout << b[i] << " ";
}
}
int main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
} | #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 Edge {
int to;
long long weight;
Edge() : to(0), weight(0) {}
Edge(int to, long long weight) : to(to), weight(weight) {}
Edge(const Edge& e) {
to = e.to;
weight = e.weight;
}
};
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using Graph = vector<vector<int>>;
using weightedGraph = vector<vector<Edge>>;
using heap = priority_queue<int, vector<int>, greater<int>>;
#define BIL ((ll)1e9)
#define MOD ((ll)1e9+7)
#define INF (1LL<<60)
#define inf (1<<29)
int main(int argc,char* argv[]){
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
int n;
cin >> n;
vector<vector<ll>> c(n, vector<ll>(n, 0));
for(int i=0;i<n;i++) {
for(int j=0;j<n;j++) {
cin >> c[i][j];
}
}
ll v = INF;
for(int i=0;i<n;i++) {
v = min(v, c[i][0]);
}
vector<ll> a(n);
for(int i=0;i<n;i++) {
a[i] = c[i][0] - v;
}
vector<ll> b(n);
for(int i=0;i<n;i++) {
ll k = 0;
for(int j=0;j<n;j++) {
if(j == 0) {
k = c[j][i] - a[j];
continue;
}
ll m = c[j][i] - a[j];
if(k != m) {
cout << "No" << endl;
return 0;
}
}
if(k < 0) {
cout << "No" << endl;
return 0;
}
b[i] = k;
}
cout << "Yes" << endl;
for(int i=0;i<n;i++) {
cout << a[i];
if(i != n-1) cout << " ";
}
cout << endl;
for(int i=0;i<n;i++) {
cout << b[i];
if(i != n-1) cout << " ";
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define vi vector<int>
#define pii pair<int,int>
#define piii pair<int, pii>
#define pb push_back
#define fs first
#define sc second
//#define ONLINE_JUDGE
#define endl "\n"
#define pow2(i) (1<<(i))
#define d0(x) cout<<x<<" "
#define d1(x) cout<<(x)<<endl
#define d2(x,y) cout<<(x)<<" "<<(y)<<endl
#define d3(x,y,z) cout<<x<<" "<<y<<" "<<z<<endl
#define d4(x,y,z,w) cout<<x<<" "<<y<<" "<<z<<" "<<w<<endl
#define d5(x,y,z,w,s) cout<<x<<" "<<y<<" "<<z<<" "<<w<<" "<<s<<endl
#define fifo ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define precise(x) cout<<fixed<<setprecision(x)
#define all(v) (v).begin(),(v).end()
const int mod = 1e9+7;
int dig(int x)
{
int ret = 0;
while(x)
{
x/=10;
ret++;
}
return ret;
}
int po(int x)
{
if(x==0)return 1;
return 10*po(x-1);
}
int bin(int l,int r,int n)
{
if(l==r)return l;
int m=(l+r+1)/2;
if(m+m*po(dig(m))<=n)
return bin(m,r,n);
else
return bin(l,m-1,n);
}
void solve()
{
int n;
cin>>n;
if(n<=10)
{
cout<<0<<endl;return;
}
cout<<bin(1,1000000,n)<<endl;
}
signed main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
#endif
fifo
int t=1;
//cin>>t;
for(ll tc=1;tc<=t;++tc)
{
solve();
}
}
| #include<bits/stdc++.h>
using namespace std;
int main()
{
string s;
cin>>s;
if((s[0]==s[1]) && (s[1]==s[2]))
cout<<"Won"<<'\n';
else
cout<<"Lost"<<'\n';
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define vl vector<ll>
#define pii pair<int, int>
void allprime(int n, bool prime[])
{
for (int p=2; p*p<=n; p++)
{
if (prime[p] == true)
{
for (int i=p*p; i<=n; i += p)
prime[i] = false;
}
}
}
void bfs(vi adj[], int src, bool vis[], int level[])
{
queue<pii> q;
q.push(mp(src,0));
vis[src]=true;
level[src]=0;
while(!q.empty())
{
pii vpair=q.front();
q.pop();
int v=vpair.ff;
int lvl=vpair.ss;
for(int i=0;i<adj[v].size();i++)
{
int next=adj[v][i];
if(!vis[next])
{
q.push(mp(next,lvl+1));
vis[next]=true;
level[next]=lvl+1;
}
}
}
}
void dfs(vi adj[], int src, bool vis[])
{
vis[src]=true;
for(int i=0;i<adj[src].size();i++)
{
int next=adj[src][i];
if(!vis[next])
{
dfs(adj,next,vis);
}
}
}
void solve()
{
// bool vis[6]={false};
// int level[6];
// dfs(adj,0,vis);
// bfs(adj,0,vis,level);
ll n,k;
cin>>n>>k;
if(k<0)
k*=-1;
ll ansup, ansdown, ans=0;
for(int j=2;j<=2*n-k;j++)
{
ll up = j+k;
if(j>n+1)
ansdown=2*n-j+1;
else
ansdown=j-1;
if(up>n+1)
ansup=2*n-up+1;
else
ansup=up-1;
// cout<<ansup<<" "<<ansdown<<endl;
ans+=ansup*ansdown;
}
cout<<ans<<endl;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int t=1;
// cin>>t;
while(t--)
{
solve();
}
} | /*{{{*/
#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).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define CASET int ___T; scanf("%d", &___T); for(int cs=1;cs<=___T;cs++)
#define MP make_pair
#define PB emplace_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL,LL> PLL;
typedef vector<PLL> VPLL;
template<class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(int64_t &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template<class T, class... U> void R(T &head, U &... tail) { _R(head); R(tail...); }
template<class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const int64_t &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template<class T,class U> void _W(const pair<T,U> &x) {_W(x.F); putchar(' '); _W(x.S);}
template<class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar(' '); }
void W() {}
template<class T, class... U> void W(const T &head, const U &... tail) { _W(head); putchar(sizeof...(tail) ? ' ' : '\n'); W(tail...); }
#ifdef HOME
#define DEBUG(...) {printf("[DEBUG] ");W(__VA_ARGS__);}
#else
#define DEBUG(...)
#endif
int MOD = 1e9+7;
void ADD(LL& x,LL v){x=(x+v)%MOD;if(x<0)x+=MOD;}
/*}}}*/
const int SIZE = 1<<20;
LL N,K;
void solve() {
LL an=0;
FOR(i,2,2*N){
LL need = i-K;
if(need<2 || need > 2*N)continue;
an+=min(i-1LL,2*N+1-i)*min(need-1LL,2*N+1-need);
}
W(an);
}
void input() {
R(N,K);
}
int main(){
input();
solve();
return 0;
}
|
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using ld = long double;
using vld = vector<ld>;
using vb = vector<bool>;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl
#else
#define dbg(x) true
#endif
template <class T> bool chmin(T& a, T b) {
if(a > b) { a = b; return true; }
else return false;
}
template <class T> bool chmax(T& a, T b) {
if(a < b) { a = b; return true; }
else return false;
}
template <class T> ostream& operator<<(ostream& s, const vector<T>& a) {
for(auto i : a) s << i << ' ';
return s;
}
constexpr int INF = 1 << 30;
constexpr ll INFL = 1LL << 60;
constexpr ld EPS = 1e-12;
ld PI = acos(-1.0);
struct mint {
static const long long mod = 998244353;
long long x;
mint(long long x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x);}
mint& operator+=(const mint& a) {if ((x += a.x) >= mod) x -= mod; return *this;}
mint& operator-=(const mint& a) {if ((x += mod - a.x) >= mod) x -= mod; return *this;}
mint& operator*=(const mint& a) {(x *= a.x) %= mod; return *this;}
friend const mint operator+(const mint& a, const mint& b) { mint ret = a; return ret += b; }
friend const mint operator-(const mint& a, const mint& b) { mint ret = a; return ret -= b; }
friend const mint operator*(const mint& a, const mint& b) { mint ret = a; return ret *= b; }
friend ostream& operator<<(ostream& s, const mint& a) { return s << a.x; }
mint pow(long long t) const {
if (!t) return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1) a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2);}
mint& operator/=(const mint a) { return (*this) *= a.inv();}
friend const mint operator/(const mint& a, const mint& b) { mint ret = a; return ret /= b; }
};
void solve() {
ll n, m, k;
cin >> n >> m >> k;
mint ans = 0;
for(int i = 1; i <= k; ++i) {
mint a = mint(i).pow(n) - mint(i-1).pow(n); // 1〜iでiを含む
mint b = mint(k-i+1).pow(m); // i〜kでiは含まなくて良い
if(n == 1 || m == 1) b -= mint(k-i).pow(m); // nかmが1だとiを含む
// cout << i << ' ' << a << ' ' << b << endl;
ans += a * b;
}
cout << ans << endl;
return;
}
int main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
solve();
} | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
// clang-format off
typedef long long LL;
typedef vector<int> VI;
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define FORD(i,a,b) for(int i=(a);i>=(b);i--)
#define FOREACH(i,c) for(__typeof((c).begin())i = (c).begin();i!=(c).end(); ++i)
//v5
int cond = 1;string to_string(char c){return'\''+string(1,c)+'\'';}string to_string(const string&s){return'"'+s+'"';}string to_string(const char*s){return to_string((string)s);}string to_string(bool b){return(b?"true":"false");}string to_string(std::vector<bool>::reference&r){return to_string((bool)r);}template<typename A,typename B>string to_string(const pair<A,B>&p){return"("+to_string(p.first)+", "+to_string(p.second)+")";}template<typename A>string to_string(A v){int f=1;string r="{";for(auto x:v){if(!f){r+=", ";}f=0;r+=to_string(x);}r+="}";return r;}template<typename A,typename B>string to_string(map<A,B>v){int f=1;string r="{";for(auto x:v){if(!f){r+=", ";}f=0;r+=to_string(x.first)+" -> "+to_string(x.second);}r+="}";return r;}void __db(int i,const vector<string>&s){cerr<<endl;}template<typename T,typename... A>void __db(int i,const vector<string>&s,T t,A... a){if(i)cerr<<", ";cerr<<s[i]<<" = "<<to_string(t);__db(i+1,s,a...);}string __cl(string s){while(!s.empty()&&s[0]==' ')s.erase(0,1);while(!s.empty()&&s.back()==' ')s.pop_back();return s;}vector<string>__vars(string s){vector<string>r;s+=",";string n="";int d=0;for(auto x:s)if(x==','&&d==0){if(!n.empty())r.push_back(__cl(n));n="";}else{n+=x;if(x=='('||x=='[')d++;else if(x==')'||x==']')d--;}return r;}
#define DB(...){if(cond){cerr<<"Line:"<<__LINE__<<" ";__db(0,__vars(#__VA_ARGS__),__VA_ARGS__);}}
// clang-format on
int main() {
set<LL> s;
LL n;
scanf("%lld", &n);
FOR(i, 1, sqrt(n)) {
if (n % i == 0) {
s.insert(i);
s.insert(n/i);
}
}
for (auto x : s) {
printf("%lld\n", x);
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define SZ(v) ((int)(v).size())
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) (v).begin(),(v).end()
template<typename T>inline bool chkmin(T &a,const T &b){return a>b?a=b,1:0;}
template<typename T>inline bool chkmax(T &a,const T &b){return a<b?a=b,1:0;}
typedef long long ll;
typedef unsigned uint;
const int INF=0x3f3f3f3f;
const double EPS=1e-10;
typedef pair<int,int> pii;
int inline in(){int x=0,c;for(;(uint)((c=getchar())-'0')>=10;)
{if(c=='-')return -in();if(!~c)throw ~0;}do{x=(x<<3)+(x<<1)+(c-'0');}
while((uint)((c=getchar())-'0')<10);return x;}
int x;
int main(){
scanf("%d",&x);
printf("%d\n",x<0?0:x);
return 0;
} | #include <iostream>
int main() {
int x;
std::cin >> x;
if(x >= 0) std::cout << x;
else std::cout << 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define ull unsigned long long
#define endl "\n"
#define loop(n) for(int i = 0; i<n; ++i)
const int N = 1e3+5;
int n, freq[N], x;
bool permutation = true;
int main()
{
IOS;
cin >> n;
loop(n)
{
cin >> x;
freq[x]++;
}
for(int i = 1; i<=n; ++i)
{
if(freq[i] != 1)
{
permutation = false;
break;
}
}
if(!permutation) return cout << "No" << endl, 0;
cout << "Yes" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
set<int> S;
for(int i = 0;i<N;i++){
int a;
cin >> a;
S.insert(a);
}
if(N == S.size()) cout << "Yes" <<endl;
else cout << "No" <<endl;
} |
#include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int i = 1; i<=n; ++i)
#define all(x) begin(x),end(x)
#define show(obj) {for(auto x:obj)cout<<x<<' ';cout<<endl;}
#define line "----------"
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,ll> LP;
const int inf = 1001001000;
const ll INF = 1LL<<60;
const int MOD = (int)1e9 + 7;
void solve(string s){
//if(s.size() < 7){cout << -1 << endl; return ;}
if(s[0] != 'a'){cout << 0 << endl;return;}
string tar = "atcoder";
if(s.size() > 7)if(s.substr(0,7) == tar){cout << 0 << endl; return;}
rep(i,7){
if(i < s.size()){
if(s[i] > tar[i]){cout << 0 << endl; return;}
if(s[i] == tar[i])continue;
else break;
}
}
rep(i,s.size()){
if(s[i] != 'a'){
if(s[i] > 't')cout << i - 1 << endl;
else cout << i << endl;
return ;
}
}
cout << -1 << endl;
//vector<char> can;
//int ans = inf;
//rep(i,s.size()){
// if(i < tar.size())can.push_back(tar[i]);
// int k = inf;
// rep(j,can.size()){
// if(s[i] > can[j])k = j;
// }
// if(k != inf){ans = min(ans, i-k);}
//}
//if(ans == inf)ans = -1;
//cout << ans << endl;
return ;
}
int main(){
int T;
cin >> T;
vector<string> ss(T);
rep(i,T)cin >> ss[i];
rep(i,T)solve(ss[i]);
return 0;
}
| #include <iostream>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <stack>
#include <bitset>
#include <functional>
#include <random>
#include <cassert>
typedef long long ll;
using namespace std;
const ll mod = 1000000007;
const ll mod998 = 998244353;
int T;
int main() {
cin >> T;
while (T--) {
bool B[4];
for (int i = 0; i < 4; i++) {
B[i] = false;
}
int N;
cin >> N;
string S;
for (int i = 0; i < 3; i++) {
cin >> S;
if (S.front() == '0' && S.back() == '0') {
B[0] = true;
}
if (S.front() == '0' && S.back() == '1') {
B[1] = true;
}
if (S.front() == '1' && S.back() == '0') {
B[2] = true;
}
if (S.front() == '1' && S.back() == '1') {
B[3] = true;
}
}
if (!B[0]) {
for (int i = 0; i < N; i++) {
cout << '0';
}
cout << '1';
for (int i = 0; i < N; i++) {
cout << '0';
}
cout << '\n';
}
else if (!B[1]) {
for (int i = 0; i < N; i++) {
cout << '0';
}
for (int i = 0; i < N; i++) {
cout << '1';
}
cout << '0';
cout << '\n';
}
else if (!B[2]) {
for (int i = 0; i < N; i++) {
cout << '1';
}
for (int i = 0; i < N; i++) {
cout << '0';
}
cout << '1';
cout << '\n';
}
else {
for (int i = 0; i < N; i++) {
cout << '1';
}
cout << '0';
for (int i = 0; i < N; i++) {
cout << '1';
}
cout << '\n';
}
}
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll one = 1;
const ll INF = 9223372036854775807; //10^18
const int inINF = 2147483647; //10^9
const ll MOD = 1000000007; //10^9+7
const ll MOD2 = 998244353;
void Yes() {printf("Yes\n");}
void No() {printf("No\n");}
void YES() {printf("YES\n");}
void NO() {printf("NO\n");}
int main(){
int N;
cin >> N;
string S, T;
cin >> S >> T;
int c = 0, d = 0;
for (int i = 0; i < N; i++) {
if(S[i] == '0') c++;
if(T[i] == '0') d++;
}
if(c != d){
cout << -1 << endl;
return 0;
}
vector<int> A(c), B(c);
c = 0; d = 0;
for (int i = 0; i < N; i++) {
if(S[i] == '0'){
A[c] = i;
c++;
}
if(T[i] == '0'){
B[d] = i;
d++;
}
}
int ans = A.size();
for (int i = 0; i < A.size(); i++) {
if(A[i] == B[i]) ans--;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REPP(i,a,b,d) for(int i=(a);i<=(int)(b);i+=(d))
#define REP(i,a,b) REPP(i,a,b,1)
#define REVV(i,a,b,d) for(int i=(a);i>=(int)(b);i-=(d))
#define REV(i,a,b) REVV(i,a,b,1)
#define FOR(i,a) for(int i=0; i<(int)(a); i++)
#define FORD(i,a) for(int i=(int)(a)-1; i>=0; i--)
#define pb push_back
typedef long long ll;
const int N = 1e5+5, K = 15;
int n, m, k;
bool trap[N];
pair<long double, long double> E[2*N];
void no() {
cout << -1 << '\n';
exit(0);
}
int main() {
ios::sync_with_stdio(0); cin.tie(0);
cin >> n >> m >> k;
FOR(i, k) {
int x; cin >> x;
trap[x] = 1;
}
int cnt = 0;
REP(i, 1, m) cnt += trap[i];
if(cnt == m) no();
REP(i, m+1, n) {
cnt += trap[i] - trap[i-m];
if(cnt == m) no();
}
REP(i, n, n+m-1) E[i] = {0, 0};
pair<long double, long double> acc = {0, 0};
REV(i, n-1, 0) {
if(trap[i]) E[i] = {1, 0};
else {
E[i].first += acc.first / (long double)m;
E[i].second += acc.second / (long double)m;
E[i].second++;
}
acc.first += E[i].first, acc.second += E[i].second;
acc.first -= E[i+m].first, acc.second -= E[i+m].second;
}
cout << fixed << setprecision(4) << -E[0].second / (E[0].first-1) << '\n';
return 0;
} |
#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 forn(i,a,b)for(int i=(a),_b=(b);i<=_b;i++)
#define fore(i,b,a)for(int i=(b),_a=(a);i>=_a;i--)
#define rep(i,n)for(int i=0,_n=n;i<n;i++)
#define ll long long
#define pii pair<int,int>
#define vi vector<int>
#define vpii vector<pii>
#define m_p make_pair
#define re return
#define pb push_back
#define si set<int>
#define ld long double
#define X first
#define Y second
#define st string
#define ull unsigned long long
#define mod 1000000007
#define INF 1000000007
#define x1 XZVJDFADSPFOE
#define y1 GASDIJSLDAEJF
#define x2 DFDAJKVOHKWIW
#define y2 PSFSAODSXVNMQ
#define LLINF 0x3f3f3f3f3f3f3f3fLL
#define foreach(i,c) for(__typeof(c.begin())i=(c.begin());i!=(c).end();i++)
using namespace std;
inline void read(int &x)
{
short negative=1;
x=0;
char c=getchar();
while(c<'0' || c>'9')
{
if(c=='-')
negative=-1;
c=getchar();
}
while(c>='0' && c<='9')
x=(x<<3)+(x<<1)+(c^48),c=getchar();
x*=negative;
}
ll quickpower(ll n,ll k){
ll ans=1;
while(k){
if(k%2){
ans*=n;
ans%=mod;
}
n*=n;
n%=mod;
k/=2;
}
return ans;
}
string int_to_string(int n)
{
string s="";
while(n)
{
int now=n%10;
s+=now+'0';
n/=10;
}
reverse(s.begin(),s.end());
return s;
}
int string_to_int(string s)
{
int n=0;
rep(i,s.size())
{
n*=10;
n+=s[i]-'0';
}
return n;
}
int n;
int main()
{
ios::sync_with_stdio(0);
cin>>n;
cout<<(1<<n)-1<<endl;
forn(i,1,(1<<n)-1)
{
rep(j,1<<n)
{
if(__builtin_popcount(i&j)%2) cout<<'B';
else cout<<'A';
}
cout<<endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> using vc = vector<T>;
template<class T> using vvc = vc<vc<T>>;
template<class T> using vvvc = vc<vvc<T>>;
template<class T> using vvvvc = vvc<vvc<T>>;
template<class T> using PQ = priority_queue<T>;
template<class T> using invPQ = priority_queue<T, vector<T>, greater<T>>;
using IP = pair<int, int>;
using LP = pair<ll, ll>;
#define all(x) begin(x), end(x)
#define rep(i, n) for (int i = 0; (i) < (int)(n); i++)
#define rep3(i, m, n) for (int i = (m); (i) < (int)(n); i++)
#define repr(i, n) for (int i = (n) - 1; (i) >= 0; i--)
#define rep3r(i, m, n) for (int i = (n) - 1; (i) >= (int)(m); i--)
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; return 1; } return 0; }
constexpr long long LINF = 4611686015206162431;
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int N;
cin >> N;
ll a[2*N];
vc<int> c(2*N);
vvc<ll> dogs(3);
rep (i, N*2) {
cin >> a[i];
char col;
cin >> col;
if (col == 'G') c[i] = 1;
else if (col == 'B') c[i] = 2;
dogs[c[i]].emplace_back(a[i]);
}
rep (i, 3) {
sort(all(dogs[i]));
}
int oddcnt = dogs[0].size() % 2 + dogs[1].size() % 2 + dogs[2].size() % 2;
ll ans = LINF;
if (oddcnt == 0) ans = 0;
else {
int even = 0;
rep (i, 3) if (dogs[i].size() % 2 == 0) even = i;
int odd1 = (even + 1) % 3, odd2 = (even + 2) % 3;
rep (i, dogs[odd1].size()) {
int pos = lower_bound(all(dogs[odd2]), dogs[odd1][i]) - dogs[odd2].begin();
if (pos < dogs[odd2].size()) chmin(ans, abs(dogs[odd2][pos] - dogs[odd1][i]));
if (pos > 0) {
chmin(ans, abs(dogs[odd2][pos-1] - dogs[odd1][i]));
}
}
ll tmp1 = LINF, tmp2 = LINF;
rep (i, dogs[odd1].size()) {
int pos1 = lower_bound(all(dogs[even]), dogs[odd1][i]) - dogs[even].begin();
if (pos1 < dogs[even].size()) chmin(tmp1, abs(dogs[even][pos1] - dogs[odd1][i]));
if (pos1 > 0) chmin(tmp1, abs(dogs[even][pos1-1] - dogs[odd1][i]));
}
rep (i, dogs[odd2].size()) {
int pos2 = lower_bound(all(dogs[even]), dogs[odd2][i]) - dogs[even].begin();
if (pos2 < dogs[even].size()) chmin(tmp2, abs(dogs[even][pos2] - dogs[odd2][i]));
if (pos2 > 0) chmin(tmp2, abs(dogs[even][pos2-1] - dogs[odd2][i]));
}
chmin(ans, tmp1 + tmp2);
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
// #include <atcoder/all>
// #include "icld.cpp"
using namespace std;
using ll = long long int;
using pii = pair<int,int>;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using ss = string;
using db = double;
const int dx[4] = {1,0,-1,0};
const int dy[4] = {0,1,0,-1};
#define V vector
#define pi 3.14159265358979
#define rep(i,s,n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define ci(x) cin >> x
#define cii(x) int x;cin >> x
#define cci(x,y) int x,y;cin >> x >> y
#define co(x) cout << x << endl
void chmax(int &x,int y){x=max(x,y);}
void chmin(int &x,int y){x=min(x,y);}
int main(){
cci(n,m);
int n2=n/2;
vi mi(n2),ma(n2),v(n);
rep(i,0,n)ci(v[i]);
sort(all(v));
vi tc(m);
rep(i,0,m)ci(tc[i]);
sort(all(tc));
rep(i,0,n-1)(i%2?ma:mi)[i/2]=v[i+1]-v[i];
vi smi(n2+1,0),sma(n2+1,0);
rep(i,0,n2)smi[i+1]=smi[i]+mi[i];
rep(i,0,n2)sma[n2-i-1]=sma[n2-i]+ma[n2-i-1];
int ans=1001001001;
rep(i,0,m){
int nx=(lower_bound(all(v),tc[i])-v.begin())/2;
chmin(ans,smi[nx]+abs(v[nx*2]-tc[i])+sma[nx]);
}
co(ans);
} | #include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define ull unsigned long long
#define mp make_pair
void solve()
{
ll n,m;
cin>>n>>m;
vector<ll>v(n);
ll i,j;
for(i=0;i<n;i++)cin>>v[i];
sort(v.begin(),v.end());
vector<ll>form(m);
for(i=0;i<m;i++)cin>>form[i];
sort(form.begin(),form.end());
vector<ll>dp_left(n+1,0);
ll prev = 0;
for(i=1;i<n;i=i+2)
{
dp_left[i] = prev+ (v[i] - v[i-1]);
prev = dp_left[i];
}
prev = 0;
vector<ll>dp_right(n+1,0);
for(i=n-2;i>=0;i=i-2)
{
dp_right[i] = prev + (v[i+1]-v[i]);
prev = dp_right[i];
}
ll val = LLONG_MAX;
for(i=0;i<=n;i++)
{
ll low_index,high_index;
ll left_index, right_index;
ll diff_index;
ll low,high;
if(i%2==0)
{
low_index = i-1;
high_index = i;
left_index = i-1;
right_index = i+1;
diff_index = i;
}
else
{
low_index = i-1;
high_index = i;
left_index = i-2;
right_index = i;
diff_index = i-1;
}
ll left_max,right_max;
if(left_index <0)
{
left_max = 0;
}
else
{
left_max = dp_left[left_index];
}
if(right_index>=n)
{
right_max = 0;
}
else
{
right_max = dp_right[right_index];
}
if(low_index<0)
{
low = INT_MIN;
}
else
{
low = v[low_index];
}
if(high_index>=n)
{
high = INT_MAX;
}
else
{
high = v[high_index];
}
ll ans = INT_MAX;
//cout<<low<<" "<<high<<endl;
//cout<<diff_index<<endl;
if(i%2==0)
{
ll ub = upper_bound(form.begin(),form.end(),high)-form.begin();
ub--;
if(ub<form.size() && ub>=0)
{
ans = min(ans, abs(v[diff_index] - form[ub]));
}
}
else
{
ll lb = lower_bound(form.begin(),form.end(),low)-form.begin();
if(lb<form.size() && lb>=0)
{
ans = min(ans, abs(v[diff_index] - form[lb]));
}
}
//cout<<ans<<endl;
ans +=left_max;
ans += right_max;
//cout<<ans<<endl;
val = min(ans, val);
}
cout<<val<<endl;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t =1;
//cin>>t;
while(t--)
{
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
//using namespace boost::multiprecision;
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> P;
#define PI 3.141592653589793
#define MOD 1000000007
//#define MOD 998244353
#define ALL(obj) (obj).begin(),(obj).end()
const ll INF = 1LL << 60;
//四方向への移動ベクトル
const int dx[4] = {1, 0, -1, 0};
struct edge{//グラフに使うヤツ
ll from,to,cost;
};
typedef vector<vector<edge> > G;
ll gcd(ll a,ll b){
if (a%b==0)return(b);
else return(gcd(b,a%b));
}
ll myPow(ll x,ll n,ll m){
if(n == 0)
return 1;
if(n % 2 == 0)
return myPow(x * x % m, n / 2, m);
else
return x * myPow(x, n - 1, m) % m;
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
int main(){
ll h,w;
cin >> h >> w;
string s[h];
for (ll i=0;i<h;i++)cin >> s[i];
ll tate[h][w],yoko[h][w];
memset(tate,-1,sizeof(tate));
memset(yoko,-1,sizeof(yoko));
ll lc=0;
for (ll i=0;i<h;i++){
for (ll j=0;j<w;j++){
ll c=0,f=j;
for (ll k=j;s[i][k]=='.' and k<w;k++){
c++;
f=k;
lc++;
}
for (ll k=j;k<=f;k++){
yoko[i][k]=c;
}
j=f;
}
}
for (ll i=0;i<w;i++){
for (ll j=0;j<h;j++){
ll c=0,f=j;
for (ll k=j;s[k][i]=='.' and k<h;k++){
c++;
f=k;
}
for (ll k=j;k<=f;k++){
tate[k][i]=c;
}
j=f;
}
}
ll ans=0;
ll lcm=myPow(2,lc,MOD),inv=modinv(2,MOD);
int ni[h+w+10];
ll a=1;
for (ll i=0;i<h+w+5;i++){
ni[i]=a;
a*=2;
a%=MOD;
}
for (ll i=0;i<h;i++){
for (ll j=0;j<w;j++){
if (s[i][j]=='.'){
ll c=tate[i][j]+yoko[i][j]-1;
c=ni[c];
ll x=(c-1)*lcm%MOD;
x*=modinv(c,MOD);
x%=MOD;
ans+=x;
ans%=MOD;
}
}
}
cout << ans << endl;
return 0;
}
| #include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
const int M = 300005;
int read()
{
int x=0,f=1;char c;
while((c=getchar())<'0' || c>'9') {if(c=='-') f=-1;}
while(c>='0' && c<='9') {x=(x<<3)+(x<<1)+(c^48);c=getchar();}
return x*f;
}
int n,m,tot,f[M],dis[M];
struct edge
{
int v,c,next;
}e[10*M];
struct node
{
int u,c;
bool operator < (const node &R) const
{
return c>R.c;
}
};
int id(int x,int y)
{
return (x-1)*m+y;
}
void add(int u,int v,int c)
{
e[++tot]=edge{v,c,f[u]},f[u]=tot;
}
void dijk()
{
priority_queue<node> q;
memset(dis,0x3f,sizeof dis);
q.push(node{1,0});dis[1]=0;
while(!q.empty())
{
int u=q.top().u,t=q.top().c;q.pop();
if(t>dis[u]) continue;
for(int i=f[u];i;i=e[i].next)
{
int v=e[i].v,c=e[i].c;
if(dis[v]>dis[u]+c)
{
dis[v]=dis[u]+c;
q.push(node{v,dis[v]});
}
}
int x=(u-1)/m+1,y=(u-1)%m+1;
for(int i=1;i<x;i++)
{
int v=id(x-i,y),c=i+1;
if(dis[v]>dis[u]+c)
{
dis[v]=dis[u]+c;
q.push(node{v,dis[v]});
}
}
}
}
signed main()
{
n=read();m=read();
for(int i=1;i<=n;i++)
for(int j=1;j<m;j++)
{
int x=read();
add(id(i,j),id(i,j+1),x);
add(id(i,j+1),id(i,j),x);
}
for(int i=1;i<n;i++)
for(int j=1;j<=m;j++)
{
int x=read();
add(id(i,j),id(i+1,j),x);
}
dijk();
printf("%d\n",dis[id(n,m)]);
}
|
// -----------------------------------
// author : MatsuTaku
// country : Japan
// created : 11/01/20 20:25:34
// -----------------------------------
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(nullptr); ios::sync_with_stdio(false);
int n,m; cin>>n>>m;
vector<int> H(n); for (auto& h:H) cin>>h;
vector<int> W(m); for (auto& w:W) cin>>w;
int u = n/2;
sort(H.begin(), H.end());
vector<ll> se(u), so(u);
for (int i = 0; i < n-1; i++) {
if (i % 2 == 0) {
se[i/2] = H[i+1]-H[i];
} else {
so[i/2] = H[i+1]-H[i];
}
}
for (int i = 1; i < u; i++)
se[i] += se[i-1];
for (int i = u-2; i >= 0; i--)
so[i] += so[i+1];
sort(W.begin(), W.end());
int wi = -1;
ll ans = 1e18;
for (auto w:W) {
while (wi+1 < n and w >= H[wi+1])
wi++;
if (wi%2 != 0) {
ll sum = ((wi-1)/2 >= 0 ? se[(wi-1)/2] : 0);
sum += H[wi+1]-w;
sum += ((wi+2)/2 < u ? so[(wi+2)/2] : 0);
ans = min(ans, sum);
} else {
ll sum = ((wi-2)/2 >= 0 ? se[(wi-2)/2] : 0);
sum += w-H[wi];
sum += ((wi+1)/2 < u ? so[(wi+1)/2] : 0);
ans = min(ans, sum);
}
}
cout << ans << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i,a,b) for(int i=a;i<=b;i++)
inline ll r() {
ll x=0,f=1;
char c=getchar();
while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
while(isdigit(c))x=x*10+c-'0',c=getchar();
return x*f;
}
#define d r()
ll a,b,c;
int main(){
a=d,b=d,c=d;
printf("%lld",((a*(a+1)/2)%998244353)*((b*(b+1)/2)%998244353)%998244353*((c*(c+1)/2)%998244353)%998244353);
return 0;
} |
#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 h, w;
cin >> h >> w;
int v = 1000;
int a[h][w];
rep(i,h) {
rep(j,w) {
cin >> a[i][j];
v = min(v,a[i][j]);
}
}
int ans = 0;
rep(i,h) {
rep(j,w) {
ans += a[i][j] - v;
}
}
cout << ans << endl;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int h,w,ans,a[10001],minm=101;
int main(){
scanf("%d%d",&h,&w);
for(int i=1;i<=h*w;i++){
scanf("%d",&a[i]);
minm=min(minm,a[i]);
}
sort(a+1,a+h*w+1);
int x=min(minm,a[(h*w+1)>>1]);
for(int i=1;i<=h*w;i++)ans+=a[i]-x;
printf("%d\n",ans);
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll a,b,c;
cin>>a>>b>>c;
if(a==b)
cout<<c;
else if(b==c)
cout<<a;
else if(a==c)
cout<<b;
else
cout<<0;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
int main() {
int a, b, c;
cin >> a >> b >> c;
set<int> set;
set.insert(a);
set.insert(b);
set.insert(c);
if (set.size() == 3)
cout << 0 << endl;
else {
if (a == b)
cout << c << endl;
else if (a == c)
cout << b << endl;
else
cout << a << endl;
}
}
|
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#pragma GCC optimize(2)
#include<set>
#include<map>
#include<cmath>
#include<queue>
#include<random>
#include<bitset>
#include<string>
#include<vector>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<unordered_map>
#include<unordered_set>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int mod=998244353;
int main()
{
IO;
int T=1;
//cin>>T;
while(T--)
{
ll a,b,c;
cin>>a>>b>>c;
a=(1+a)*a/2%mod;
b=(1+b)*b/2%mod;
c=(1+c)*c/2%mod;
ll res=a*b%mod*c%mod;
cout<<res<<'\n';
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
int nod (int n) {
int result = ((n <= 1) ? 1 : log10(n) + 1);
return result;
}
int npr(int n , int r){
int result;
if (n- r == 0) result = 2;
else result = ((n * (n+ 1)) / 2) / ((n - r) * (n - r + 1) / 2);
return result;
}
int32_t main() {
int a[3];
for(int i =0 ; i < 3 ; i++) cin >> a[i];
sort(a , a + 3 ,greater<int>());
cout << a[0] + a[1] <<"\n";
} |
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846 // pi
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
#define rep(a,n) for(ll a = 0;a < n;a++)
#define repi(a,b,n) for(ll a = b;a < n;a++)
using namespace std;
static const ll INF = 1e15;
template<typename T>
static inline void chmin(T& ref, const T value) {
if (ref > value) ref = value;
}
template<typename T>
static inline void chmax(T& ref, const T value) {
if (ref < value) ref = value;
}
constexpr ll mod = 1000000007;
ll mpow(ll x, ll n) {
ll ans = 1; x %= mod;
while (n != 0) {
if (n & 1) ans = ans * x % mod;
x = x * x % mod;
n = n >> 1;
}
return ans;
}
int main() {
int h, w;
cin >> h >> w;
ll k = 0;
vector<vector<int>> grid(h, vector<int>(w, 0));
rep(y, h) {
string s;
cin >> s;
rep(x, w) {
grid[y][x] = s[x] == '.';
if (grid[y][x]) k++;
}
}
vector<vector<P>> xs(h, vector<P>(w));
rep(y, h) {
int l = -1, r = -1;
rep(x, w) {
if (!grid[y][x]) {
l = -1; r = -1;
continue;
}
if (l == -1) {
l = x;
}
if (r == -1) {
r = x;
}
while (r < w && grid[y][r]) {
r++;
}
xs[y][x] = { l, r };
}
}
vector<vector<P>> ys(h, vector<P>(w));
rep(x, w) {
int t = -1, b = -1;
rep(y, h) {
if (!grid[y][x]) {
t = -1; b = -1;
continue;
}
if (t == -1) {
t = y;
}
if (b == -1) {
b = y;
}
while (b < h && grid[b][x]) {
b++;
}
ys[y][x] = { t, b };
}
}
//rep(y, h) {
// rep(x, w) {
// cout << x << "," << y << "," << xs[y][x].first << "," << xs[y][x].second << endl;
// cout << "," << ys[y][x].first << "," << ys[y][x].second << endl;
// }
//}
ll sum = 0;
rep(y, h) {
rep(x, w) {
if (!grid[y][x]) {
continue;
}
ll cy = ys[y][x].second - ys[y][x].first;
ll cx = xs[y][x].second - xs[y][x].first;
ll c = cy + cx - 1;
ll p = k - c;
ll a = (mpow(2, c) - 1 + mod) % mod;
a *= mpow(2, p);
a %= mod;
sum += a;
sum %= mod;
}
}
cout << sum << endl;
return 0;
}
| #include <iostream>
#include <math.h>
#include <iomanip>
#include <bits/stdc++.h>
#include <string.h>
#include <string>
#include <algorithm>
#define ll long long int
#define pb push_back
#define fi first
#define se second
#define mem(a,b) memset(a,b,sizeof(a))
#define debug(x) cout << (#x) << " = " << x << endl;
#define debug2(i,j) cout << (#i) << "=" << i << " , " << (#j) << "=" << j << endl;
using namespace std;
ll binomialCoeff(ll n,ll k)
{
ll res = 1;
if(k >n - k)
k = n - k;
for(int i = 0; i < k; ++i)
{
res *= (n - i);
res /= (i + 1);
}
return res;
}
ll mod = 1e9 + 7;
ll power(ll x,ll y)
{
ll temp;
if(y == 0)
return 1;
temp = power(x, y/2);
if (y%2 == 0)
return (temp*temp) % mod;
else
return (((x*temp)%mod)*temp)%mod;
}
/* nCr % mod
ll fact[6*N];
ll inv[6*N],invfac[6*N];
ll mod = 998244353;
void factorial()
{
fact[0] = invfac[0] = fact[1] = invfac[1] = 1;
inv[1] = 1;
for(int i=2;i<=5*N + 10;i++)
{
fact[i] = (fact[i-1]*i)%mod;
inv[i] = (inv[mod%i]*(mod - mod/i))%mod;
invfac[i] = (invfac[i-1]*inv[i])%mod;
}
}*/
vector<ll> primes;
vector<bool> prime;
void Sieve(int n)
{
prime = vector<bool> (n+1,true);
//vector<bool> prime(n+1,true);
for (int p=2; p*p<=n; p++)
{
if (prime[p] == true)
{
for (int i=p*p; i<=n; i += p)
prime[i] = false;
}
}
for (int p=2; p<=n; p++)
if (prime[p])
primes.push_back(p);
}
ll modInverse(ll a,ll m)
{
ll m0 = m;
ll y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1)
{
ll q = a / m;
ll t = m;
m = a % m, a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
//****************************************************** CHECK CONSTRAINTS ***************************************************************//
const int Nmax = 2e5 + 6;
const int N = 2005;
string str[N];
int n,m;
ll tot = 0;
ll dp[N][N][4];
ll mem[N][N];
int main()
{
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
cin >> n >> m;
for(int i=1;i<=n;i++)
{
cin >> str[i];
str[i] = '%' + str[i];
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
if(str[i][j] == '.')
{
for(int k=0;k<2;k++)
dp[i][j][k] = 1;
}
else
continue;
dp[i][j][0] += dp[i-1][j][0];
dp[i][j][1] += dp[i][j-1][1];
mem[i][j] += 1 + dp[i][j-1][1] + dp[i-1][j][0];
}
}
for(int i=n;i>=1;i--)
{
for(int j=m;j>=1;j--)
{
if(str[i][j] == '.')
{
dp[i][j][2] = 1;
dp[i][j][3] = 1;
}
else
continue;
dp[i][j][2] += dp[i+1][j][2];
dp[i][j][3] += dp[i][j+1][3];
mem[i][j] += dp[i][j+1][3] + dp[i+1][j][2];
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
if(mem[i][j])
tot++;
}
}
ll ans = 0;
ll pow[N*N];
pow[0] = 1;
for(int i=1;i<N*N;i++)
{
pow[i] = (pow[i-1]*2)%mod;
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
if(mem[i][j])
{
ll two = pow[mem[i][j]];
two = (two - 1 + mod)%mod;
ll p = pow[tot-mem[i][j]];
ans += (two*p)%mod;
ans %= mod;
}
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
int main() {
int h = ri();
int w = ri();
int x = ri() - 1;
int y = ri() - 1;
std::string s[h];
for (auto &i : s) std::cin >> i;
int cnt = -3;
for (int i = x; i < h && s[i][y] != '#'; i++) cnt++;
for (int i = x; i >= 0 && s[i][y] != '#'; i--) cnt++;
for (int j = y; j < w && s[x][j] != '#'; j++) cnt++;
for (int j = y; j >= 0 && s[x][j] != '#'; j--) cnt++;
printf("%d\n", cnt);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) begin(a), end(a)
#define RALL(a) rbegin(a), rend(a)
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<typename T> using Graph = vector<vector<T>>;
template<typename T> using Spacial = vector<vector<vector<T>>>;
template<typename T> using greater_priority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr int MOD = 1e9+7;
constexpr int MOD2 = 998244353;
const int dx[4] = { 1, 0, -1, 0 };
const int dy[4] = { 0, 1, 0, -1 };
char interval[2] = {' ', '\n'};
template<typename T> struct is_plural : false_type{};
template<typename T1, typename T2> struct is_plural<pair<T1, T2>> : true_type{};
template<typename T> struct is_plural<vector<T>> : true_type{};
template<typename T> struct is_plural<complex<T>> : true_type{};
template<> struct is_plural<string> : true_type{};
template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second; }
template<typename T> istream &operator>>(istream &is, vector<T> &vec) { for(auto itr = vec.begin(); itr != vec.end(); ++itr) is >> *itr; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { if(vec.empty()) return os; bool pl = is_plural<T>(); os << vec.front(); for(auto itr = ++vec.begin(); itr != vec.end(); ++itr) os << interval[pl] << *itr; return os; }
template<typename T> istream &operator>>(istream &is, complex<T> &x) { T a, b; is >> a >> b; x = complex<T>(a, b); return is; }
template<typename T> ostream &operator<<(ostream &os, const complex<T> &x) { return os << x.real() << ' ' << x.imag(); }
bool CoutYN(bool a, string y = "Yes", string n = "No") { cout << (a ? y : n) << '\n'; return a; }
template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
/* -------- <templates end> -------- */
template<typename T>
vector<pair<T, int>> prime_factor(T num) {
vector<pair<T, int>> ret;
for(T i=2; i*i<=num; ++i) {
int cnt = 0;
while(num%i == 0) {
num /= i;
++cnt;
}
if(cnt != 0) ret.emplace_back(i, cnt);
}
if(num != 1) ret.emplace_back(num, 1);
return ret;
}
void solve() {
int n; cin >> n;
vector<int> ans; ans.reserve(n);
for(int i=1; i<=n; ++i) {
auto pf = prime_factor(i);
int x = 0;
for(auto &[p, c] : pf) {
chmax(x, ans[i / p - 1]);
}
ans.emplace_back(x + 1);
}
cout << ans << endl;
}
/* -------- <programs end> -------- */
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
solve();
return 0;
}
|
#include<iostream>
#include<queue>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<map>
using namespace std;
#define PI 3.1415926535898
const int mm=1e7+10;
double arr[mm];
int main()
{
int n;
cin>>n;
int maxx=-1;
int minn=1e9;
for(int i=1;i<=n;i++)
{
int a;
cin>>a;
maxx=max(a,maxx);
}
for(int i=i;i<=n;i++)
{
int b;
cin>>b;
minn=min(b,minn);
}
if(minn<maxx)
cout<<0<<endl;
else
cout<<minn-maxx+1<<endl;
} | #include<iostream>
using namespace std;
#include<bits/stdc++.h>
typedef long long int ll;
int main(){
ll n;cin>>n;
ll arr[n];
ll cnt=n*(n-1)/2;map<ll,ll>mp;
for(int i=0;i<n;i++){
cin>>arr[i];
mp[arr[i]]++;
}
for(auto it=mp.begin();it!=mp.end();it++){
ll c=it->second*(it->second-1)/2;
cnt-=c;
}
cout<<cnt<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(n);i++)
const ll INF = 1LL<<60;
int main(){
ll diri[4]={0,1,0,-1};
ll dirj[4]={1,0,-1,0};
ll H,W;
cin>>H>>W;
char a[H][W];
pair<ll,ll> goal;
queue<pair<ll,ll>> que;
vector<vector<ll>> dist(H,vector<ll>(W,-1));
vector<vector<pair<ll,ll>>> warp(26,vector<pair<ll,ll>>(0,make_pair(0,0)));
rep(i,H){
rep(j,W){
cin>>a[i][j];
if(a[i][j]=='S'){que.push(make_pair(i,j));dist[i][j]=0;}
if(a[i][j]=='G'){goal=make_pair(i,j);}
if(0<=a[i][j]-'a'&&a[i][j]-'a'<26){warp[a[i][j]-'a'].push_back(make_pair(i,j));}
}
}
// ll ans=0;
vector<ll> distwarp(26,-1);
while(!que.empty()){
if(dist[goal.first][goal.second]>0)break;
ll ni=que.front().first;
ll nj=que.front().second;
que.pop();
rep(i,4){
if(diri[i]+ni<0||diri[i]+ni>=H||dirj[i]+nj<0||dirj[i]+nj>=W)continue;
if(a[diri[i]+ni][dirj[i]+nj]=='#')continue;
if(dist[diri[i]+ni][dirj[i]+nj]<0){
dist[diri[i]+ni][dirj[i]+nj]=dist[ni][nj]+1;
que.push(make_pair(diri[i]+ni,dirj[i]+nj));
}
}
if(0<=a[ni][nj]-'a'&&a[ni][nj]-'a'<26){
if(distwarp[a[ni][nj]-'a']==0)continue;
distwarp[a[ni][nj]-'a']=0;
rep(i,(ll)warp[a[ni][nj]-'a'].size()){
ll warpi=warp[a[ni][nj]-'a'][i].first;
ll warpj=warp[a[ni][nj]-'a'][i].second;
if(dist[warpi][warpj]<0){
dist[warpi][warpj]=dist[ni][nj]+1;
que.push(make_pair(warpi,warpj));
}
}
}
}
ll ans=dist[goal.first][goal.second];
cout<<ans<<endl;
}
| //debug icin gdb kullanmayi dene
#include<bits/stdc++.h>
using namespace std;
#define mods 1000000007
#define pb push_back
#define mp make_pair
#define st first
#define nd second
typedef long long int lint;
typedef unsigned long long int ulint;
lint fastpow(lint tab,lint us){
if(tab==0) return 0;
if(tab==1) return 1;
if(us==0) return 1;
if(us==1) return tab%mods;
tab%=mods;
if(us%2==1) return tab*fastpow(tab,us-1)%mods;
lint a=fastpow(tab,us/2)%mods;
return a*a%mods;
}
lint h,w,t=1;
char mat[2020][2020];
bool visited[2020][2020],visited2[35];
vector<pair<lint,lint> > dizi[35];
pair<lint,lint> s,g;
void solve(){
lint i,j,k;
char a;
for(i=0;i<2020;i++) for(j=0;j<2020;j++) mat[i][j]='#';
cin>>h>>w;
for(i=1;i<=h;i++){
for(j=1;j<=w;j++){
cin>>a;
mat[i][j]=a;
if(a=='S') s=mp(i,j);
else if(a=='G') g=mp(i,j);
else if(a>='a' and a<='z') dizi[a-'a'].pb(mp(i,j));
}
}
queue<pair<lint,pair<lint,lint> > > sira;
if(mat[s.st][s.nd+1]!='#') sira.push(mp(1,mp(s.st,s.nd+1)));
if(mat[s.st][s.nd-1]!='#') sira.push(mp(1,mp(s.st,s.nd-1)));
if(mat[s.st+1][s.nd]!='#') sira.push(mp(1,mp(s.st+1,s.nd)));
if(mat[s.st-1][s.nd]!='#') sira.push(mp(1,mp(s.st-1,s.nd)));
visited[s.st][s.nd]=1;
while(!sira.empty()){
pair<lint,pair<lint,lint> > te=sira.front();
sira.pop();
lint x=te.nd.st,y=te.nd.nd;
if(visited[x][y])continue;
visited[x][y]=1;
if(mat[x][y]=='G'){cout<<te.st<<endl; return;}
if(mat[x][y]>='a' and mat[x][y]<='z' and visited2[mat[x][y]-'a']==0){
for(i=0;i<dizi[mat[x][y]-'a'].size();i++){
if(dizi[mat[x][y]-'a'][i].st!=x or dizi[mat[x][y]-'a'][i].nd!=y){
sira.push(mp(te.st+1,mp(dizi[mat[x][y]-'a'][i].st,dizi[mat[x][y]-'a'][i].nd)));
}
}
visited2[mat[x][y]-'a']=1;
}
if(!visited[x][y+1] and mat[x][y+1]!='#') sira.push(mp(te.st+1,mp(x,y+1)));
if(!visited[x][y-1] and mat[x][y-1]!='#') sira.push(mp(te.st+1,mp(x,y-1)));
if(!visited[x+1][y] and mat[x+1][y]!='#') sira.push(mp(te.st+1,mp(x+1,y)));
if(!visited[x-1][y] and mat[x-1][y]!='#') sira.push(mp(te.st+1,mp(x-1,y)));
}
cout<<-1<<endl;
return;
}
int main(){
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
// cin>>t;
while(t--) solve();
return 0;
}
|
#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;
///Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout<<#var<<" "<<var<<endl;
#define co(q) cout<<q<<endl;
#define all(q) (q).begin(),(q).end()
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define MODADD(ADD_X,ADD_Y) (ADD_X+ADD_Y)%MOD
#define MODSUB(SUB_X,SUB_Y) ((SUB_X-SUB_Y)+MOD)%MOD
#define MODMUL(MUL_X,MUL_Y) (MUL_X*MUL_Y)%MOD
#define LCM(LCM_X,LCM_Y) (LCM_X/__gcd(LCM_X,LCM_Y))*LCM_Y
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = (int)1e9+7;
const int MAX = 1e6;
int dx[]= {1,0,-1,0,1,-1,1,-1};
int dy[]= {0,1,0,-1,1,-1,-1,1};
int ans,k,n,cost[60][60];
void recur(int cur,int sum,int tot,int used[])
{
if(tot==(n-1))
{
sum+=cost[cur][1];
if(k==sum)
ans++;
return ;
}
for(int i=2; i<=n; i++)
{
if(!used[i])
{
used[i]=1;
recur(i,sum+cost[cur][i],tot+1,used);
used[i]=0;
}
}
}
int main()
{
FastRead
//freopen("output.txt", "w", stdout);
cin>>n>>k;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
cin>>cost[i][j];
int used[50]= {0};
recur(1,0,0,used);
cout<<ans<<endl;
return 0;
}
| #include<iostream>
#include<vector>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
const int maxN=10;
vector<vector<int>> T(maxN, vector<int> (maxN, -1));
bool used[maxN];
vector<int> v={0};
int N,K;
int dfs(){
if(v.size()==N){
v.push_back(0);
int sum=0;
rep(i, N){
sum += T[v[i]][v[i+1]];
}
/*
rep(i,N+1){
cout << v[i] << ' ';
}
cout << endl;
cout << sum << endl;
*/
v.pop_back();
if(sum==K) return 1;
else return 0;
}
int res=0;
for(int i=1;i<=N-1;i++){
if(!used[i]){
v.push_back(i);
used[i]=true;
res += dfs();
used[i]=false;
v.pop_back();
}
}
return res;
}
int main(){
cin >> N >> K;
rep(i,N)rep(j,N) cin >> T[i][j];
rep(i,N) used[i]=false;
int res = dfs();
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define _FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define pii pair<int , int>
#define pb emplace_back
const int MAXX = 1e5 + 5;
int b , c ;
signed main()
{
_FastIO;
cin >> b >> c;
long long ans = 0;
if(b && c == 1){
cout << "2" << endl;
return 0;
}
if(!b){
cout << c << endl;
return 0;
}
if(b > 0){
int cnt = 0;
b *= (-1);
c--;
cnt = 1;
while(cnt){
int x = c / 2;
int y = b - x;
ans += 2 * x + 2;
if(b >= 0 && y <= 0){
ans--;
}
if(c % 2 == 0 && y){
ans--;
}
cnt = 0;
}
b *= (-1);
c++;
while(!cnt){
int x = c / 2;
int y = b - x;
bool f = true;
if(y <= 0){
y = 0;
f = false;
}
x = b - y - 1;
ans += (2 * x + 2);
if(b >= 0 && y <= 0){
ans--;
}
if(c % 2 == 0 && y && f){
ans--;
}
cnt = 1;
}
cout << ans << endl;
}
if(b <= 0){
int cnt = 0;
b *= (-1);
c--;
cnt = 1;
while(cnt){
int x = c / 2;
int y = b - x;
bool f = true;
if(y <= 0){
y = 0;
f = false;
}
x = b - y - 1;
ans += 2 * x + 2;
if(b >= 0 && y <= 0){
ans--;
}
if(c % 2 == 0 && y && f ){
ans--;
}
cnt = 0;
}
b *= (-1);
c++;
while(!cnt){
int x = c / 2;
int y = b - x;
ans += (2 * x + 2);
if(b >= 0 && y <= 0){
ans--;
}
if(c % 2 == 0 && y){
ans--;
}
cnt = 1;
}
cout << ans << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
typedef pair<long long, long long> pll;
long long b, c;
int solve() {
scanf("%lld %lld", &b, &c);
long long ans = 0;
pll range1 = {b - c/2, b + max(0LL, c - 2) / 2};
pll range2 = {-b - (c - 1) / 2, -b + (c - 1) / 2};
// cerr << range1.first << " " << range1.second << endl;
// cerr << range2.first << " " << range2.second << endl;
if (max(range1.first, range2.first) <= min(range1.second, range2.second)) ans = max(range1.second, range2.second) - min(range1.first, range2.first) + 1;
else ans = range1.second - range1.first + 1 + range2.second - range2.first + 1;
printf("%lld\n", ans);
return 0;
}
int main() {
int t = 1;
// scanf("%d", &t);
for (int tc = 0; tc < t; ++tc) {
solve();
}
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long int
#define rep(x,start,end) for(auto x=start;x!=end;x++)
using namespace std;
ll A,B,C;
void atcoder()
{
cin>>A>>B>>C;
}
char eq(ll A, ll B)
{
if (A < B)
{
return '<';
}
else if (A > B)
{
return '>';
}
return '=';
}
char solve()
{
if (C % 2)
{
return eq(A, B);
}
else
{
return eq(abs(A), abs(B));
}
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(nullptr);
cout.tie(0);
cin.exceptions(ios::badbit|ios::failbit);
//ll Test_Cases;
// cin>>Test_Cases;
// rep(i,0,Test_Cases)
atcoder();
char ans=solve();
cout<<ans<<"\n";
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define frfr freopen("input.txt","r",stdin); //freopen("output.txt","w",stdout);
#define endl "\n"
#define loop(i,n) for(int i=0;i<n;i++)
#define ll long long int
void solve(){
int a , b ,c;
cin >> a >> b >> c;
if(c%2 == 0){
if( abs(a) > abs(b)){
cout << ">" << endl;
}else if( abs(a) < abs(b)){
cout << "<" << endl;
}else {
cout << "=" << endl;
}
return;
}
if( a > b){
cout << ">" << endl;
}else if( a < b){
cout << "<" << endl;
}else cout << "=" << endl;
}
int main()
{
IOS;
//frfr;
//int te;
//cin >> te;
//while(te--){
solve();
//}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);
#define ll long long
#define t() int t;cin>>t;while(t--)
#define lt() long long int t;cin>>t;while(t--)
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define ps(x,y) fixed<<setprecision(y)<<x
#define mk(arr,n,type) type *arr=new type[n];
#define all(x) begin(x),end(x)
#define nik(i,k,n) for ( long long int i = k; i < (n); ++i)
void YES(){cout<<"YES\n";} void NO(){cout<<"NO\n";}
ll gcd(ll A , ll B)
{
if(B == 0)return A;
return gcd(B , A%B);
}
ll fact(ll n){
ll ans = 1;
for(ll i=1;i<=n;i++){
ans*=i%mod;
}
return ans%mod;
}
bool checkperfectsquare(int n)
{
if (ceil((double)sqrt(n)) == floor((double)sqrt(n))) {
return true;
}
return false;
}
bool isPowerOfTwo(ll n)
{
if (n == 0)
return 0;
while (n != 1)
{
if (n%2 != 0)
return 0;
n = n/2;
}
return 1;
}
void fast()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("inp.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
char s[500005];
void solve()
{
string s;
cin >> s;
int filled = 0 , no = 0 , ques= 0;
for(auto X : s){
if(X == 'o')filled++;
else if( X == 'x')no++;
else ques++;
}
if( filled > 4 ){
cout << 0 << endl;
return;
}
if( filled == 0){
cout << ques*ques*ques*ques << endl;
return;
}
if(filled == 4){
cout << 24 << endl;
return;
}
if(filled == 3){
cout << ques*24 + 3* 12 << endl;
return;
}
if(filled == 2){
cout << 12*ques*ques + 4*3*2*ques + (4*2 + 6) << endl;
return;
}
if(filled == 1){
cout << ques*ques*ques*4 + ques*ques*6 + ques*4 + 1 << endl;
return;
}
}
int32_t main()
{
IOS;
//lt(){
solve();
//}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N=10;
int counter = 0;
int maru_num = 0;
int hatena_num = 0;
for (int i = 0; i < N; i++) {
if( S[i] == 'o' ){
maru_num++;
}
if( S[i] == '?' ){
hatena_num++;
}
}
for (int i = 0; i < maru_num + hatena_num; i++) {
for (int j = 0; j < maru_num + hatena_num; j++) {
for (int k = 0; k < maru_num + hatena_num; k++) {
for (int l = 0; l < maru_num + hatena_num; l++) {
int check = 1;
for(int m = 0; m < maru_num; m++){
if( i == m || j == m || k == m || l == m){
check *= 1;
}else{
check *= 0;
}
}
if(check == 1){
counter++;
}
}
}
}
}
cout << counter << endl;
}
|
#include <iostream>
using namespace std;
int main()
{
int n;
cin>>n;
int a[n]={0};
int check[200]={0};
long long ans=0;
for(int i=0;i<n;i++)
{
cin>>a[i];
if(check[a[i]%200]!=0)
ans+=check[a[i]%200];
check[a[i]%200]++;
}
cout<<ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int n;
vector<int> a;
int dp[101][100001];
void solve() {
cin >> n;
a.resize(n);
int sum = 0;
for(int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
for(int i = 0; i <= n; i++)
dp[i][0] = 1;
for(int i = 0; i < n; i++) {
for(int j = 1; j < 100001; j++) {
dp[i + 1][j] |= dp[i][j];
if(j - a[i] >= 0)
dp[i + 1][j] |= dp[i][j - a[i]];
}
}
int ans = 0;
for(int i = 0 ;i <= (sum) / 2; i++) {
if(dp[n][i])
ans = i;
}
cout << sum - ans << '\n';
}
int32_t main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int t = 1;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
int main() {
int n, m, k;
int N[100] = {0};
pair<int, int> K[17], M[101];
function<int(int)> rec = [&](int i) {
if (i == k) {
int cnt = 0;
for (int j = 0; j < m; ++j) {
auto[f, s] = M[j];
if (N[f] && N[s]) cnt++;
}
return cnt;
}
auto[f, s] = K[i];
N[f]++;
int sum1 = rec(i + 1);
N[f]--;
N[s]++;
int sum2 = rec(i + 1);
N[s]--;
return max(sum1, sum2);
};
cin >> n >> m;
for (int i = 0; i < m; ++i)
cin >> M[i].first >> M[i].second;
cin >> k;
for (int i = 0; i < k; ++i)
cin >> K[i].first >> K[i].second;
cout << rec(0) << endl;
}
| #include<bits/stdc++.h>
#define SORT(v) sort(v.rbegin() , v.rend())
#define si(n) scanf( "%d" , &n)
#define sii(n , m) scanf( "%d %d" , &n , &m)
#define sl(n) scanf( "%lld" , &n)
#define sll(n , m) scanf( "%lld %lld" , &n, &m)
#define ss(cad) scanf( "%s" , cad)
#define sz(x) (int)x.size()
#define PB push_back
#define fst first
#define scn second
#define DBG(x) cerr << #x << " = " << (x) << endl
#define N_MAX 1000010
#define M 1000000007
#define EPS 1e-9
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ll> vll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<pi> vp;
pi vec[110];
pi per[110];
bool has[110];
int main(){
int n, m;
sii(n, m);
for(int i = 0; i < m; i++){
sii(vec[i].fst, vec[i].scn);
}
int k;
si(k);
for(int i = 0; i < k; i++)
sii(per[i].fst, per[i].scn);
int ans = 0;
for(int mask = 0; mask < (1<<k); mask++){
memset(has, 0, sizeof(has));
for(int i = 0; i < k; i++)
if(mask&(1<<i))
has[per[i].fst] = 1;
else
has[per[i].scn] = 1;
int tmp = 0;
for(int i = 0; i < m; i++)
if(has[vec[i].fst] && has[vec[i].scn])
tmp++;
ans = max(ans, tmp);
}
printf("%d\n", ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
// 解法1 1次式を持つDP の実装
int main() {
int n, m, k;
cin >> n >> m >> k;
vector<bool> ng(n, false);
for (int i = 0; i < k; i++) {
int a;
cin >> a;
ng[a] = true;
}
vector<vector<double>> g(n + m, vector<double>(2, 0.0));
vector<double> sum(2, 0.0);
for (int i = n - 1; i >= 0; i--) {
if (ng[i]) {
g[i][0] = 1.0;
g[i][1] = 0.0;
} else {
g[i][0] = sum[0] / m;
g[i][1] = sum[1] / m + 1.0;
}
sum[0] -= g[i + m][0] - g[i][0];
sum[1] -= g[i + m][1] - g[i][1];
}
if (abs(g[0][0] - 1.0) < 0.00000000001) {
cout << -1 << endl;
} else {
cout << fixed << (g[0][1] / (1.0 - g[0][0])) << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
int n, m, k, a, cnt;
bool f[100005];
complex<double> p[100005];
int main(){
scanf("%d%d%d", &n, &m, &k);
rep(i,k){
scanf("%d", &a);
f[a] = true;
}
for(int i=n-1; i>=0; i--){
if(f[i]){
cnt++;
if(cnt >= m) return 0 * puts("-1");
p[i] = 1;
}else{
p[i] = p[i+1+cnt] * (double)(m+1) + (double)cnt;
for(int j=i+m+1; j <= i+m+1+cnt && j < n; j++) p[i] -= p[j];
p[i] /= m;
if(i+1+cnt == n) p[i] += 1i;
cnt = 0;
}
}
printf("%f\n", p[0].imag() / (1 - p[0].real()));
} |
#include <iostream>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
int a = 0;
int b = -1;
for(int i = 1; i < n + 1; i++) {
int v, p;
cin >> v >> p;
a += v * p / 100;
if(a > x) {
b = i;
i = n;
}
if((n == 1) and (x == 0) and (v == 1) and (p == 1)) {
b = 1;
}
}
cout << b;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
vector<int > G[25];
vector<int > V;
vector<int > P;
int a[105],vis[105];
long long ans=0;
bool check(int u,int c){
for(int i=0;i<G[u].size();i++){
if (a[G[u][i]] == c) return false ;
}
return true ;
}
void BFS(int u){
V.clear();
queue<int> q;
q.push(u);
vis[u]=1;
while (!q.empty()){
int v=q.front();q.pop();
V.push_back(v);
// for(int i=0;i<V.size();i++){
// cout << V[i] <<" ";
// }
// cout << endl ;
for(int i=0;i<G[v].size();i++){
int s=G[v][i];
if (vis[s]==1) continue ;
vis[s]=1;
q.push(s);
}
}
}
void DFS(int d){
//for(int i=1;i<=3;i++){
// cout << a[i] <<" ";
//}
//cout << endl;
if (d>=V.size()) {
ans ++ ;
return ;
}
int u=V[d];
for(int i=1;i<=3;i++){
if (!check(u,i)) continue ;
//cout << "a[u] = " << a[u] <<endl ;
a[u]=i;
// cout << "u = " << u <<" "<<"i = "<< i <<endl ;
DFS(d+1);
a[u]=0;
}
}
int main() {
memset(vis,0,sizeof(vis));
int n,m;
cin >> n >> m;
for(int i=1;i<=m;i++){
int u,v;
cin >> u >> v;
G[u].push_back(v);
G[v].push_back(u);
}
for(int i=1;i<=n;i++){
if (vis[i]==1) continue ;
BFS(i);
//cout << "i = " << i;
ans=0;
memset(a,0,sizeof(a));
DFS(0);P.push_back(ans);
}
ans=1;
for(int i=0;i<P.size();i++){
ans*=P[i];
//cout << P[i] <<endl ;
}
cout << ans <<endl ;
}
|
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define endl "\n"
#define ll long long
#define sz(s) (int)(s.size())
#define INF 0x3f3f3f3f3f3f3f3fLL
#define all(v) v.begin(),v.end()
#define watch(x) cout<<(#x)<<" = "<<x<<endl
const int dr[] { -1, -1, 0, 1, 1, 1, 0, -1 };
const int dc[] { 0, 1, 1, 1, 0, -1, -1, -1 };
#if __cplusplus >= 201402L
template<typename T>
vector<T> create(size_t n) {
return vector<T>(n);
}
template<typename T, typename ... Args>
auto create(size_t n, Args ... args) {
return vector<decltype(create<T>(args...))>(n, create<T>(args...));
}
#endif
void run() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.in", "r", stdin);
#else
//freopen("groups.in", "r", stdin);
#endif
}
const int N = 2009;
vector<int> adj[N];
bitset<N> vis;
void dfs(int node) {
vis[node] = true;
for (int ch : adj[node])
if (!vis[ch])
dfs(ch);
}
int main() {
run();
int n, m;
cin >> n >> m;
while (m--) {
int u, v;
cin >> u >> v;
adj[u].push_back(v);
}
int cnt = 0;
for (int i = 1; i <= n; i++) {
vis = bitset<N>();
dfs(i);
cnt += vis.count();
}
cout << cnt << endl;
}
| /*** keep hungry and calm CoolGuang! ***/
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#include<stdio.h>
#include<queue>
#include<algorithm>
#include<string.h>
#include<iostream>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const ll INF= 1e18+7;
const ll maxn = 1e6+700;
const ll mod= 100003;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a){char c=getchar();T x=0,f=1;while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
while(isdigit(c)){x=(x<<1)+(x<<3)+c-'0';c=getchar();}a=f*x;}
ll n,m,p;
struct Matrix{
int sz;
ll a[3][3];
void clr(int x){
sz = x;
for(int k=0;k<sz;k++)
for(int i=0;i<sz;i++)
a[i][k] = 0;
}
Matrix operator*(const Matrix b) const{
Matrix res;
res.clr(sz);
for(int i=0;i<sz;i++){
for(int j=0;j<sz;j++){
for(int k=0;k<sz;k++){
res.a[i][j] += (b.a[i][k]*a[k][j]);
}
}
}
return res;
}
Matrix operator*=(const Matrix b){
return *this = *this*b;
}
Matrix operator^(ll b){
Matrix ans;ans.clr(sz);
for(int i=0;i<ans.sz;i++) ans.a[i][i] = 1;
while(b){
if(b&1) ans *= *this;
b/=2;*this *= *this;
}return ans;
}
}q[maxn],num[maxn],a1,a2,a3,a4;
void down(int k){
q[k<<1] *= q[k];
q[k<<1|1] *= q[k];
q[k].clr(3);
for(int j=0;j<3;j++) q[k].a[j][j] = 1;
}
void build(int k,int l,int r){
q[k].clr(3);
for(int j=0;j<3;j++) q[k].a[j][j] = 1;
if(l == r) return;
int mid = (l+r)/2;
build(k<<1,l,mid);
build(k<<1,mid+1,r);
}
Matrix Query(int k,int l,int r,int pos){
if(l == r) return q[k];
down(k);
int mid = (l+r)/2;
if(pos <= mid) return Query(k<<1,l,mid,pos);
return Query(k<<1|1,mid+1,r,pos);
}
vector< pair<int,int> >v[maxn];
struct node{
int x,y;
}qr[maxn];
pair<ll,ll>res[maxn];
int main(){
a1.a[0][0] = 0;a1.a[0][1] = 1;a1.a[0][2] = 0;
a1.a[1][0] = -1;a1.a[1][1] = 0;a1.a[1][2] = 0;
a1.a[2][0] = 0;a1.a[2][1] = 0;a1.a[2][2] = 1;
a2.a[0][0] = 0;a2.a[0][1] = -1;a2.a[0][2] = 0;
a2.a[1][0] = 1;a2.a[1][1] = 0;a2.a[1][2] = 0;
a2.a[2][0] = 0;a2.a[2][1] = 0;a2.a[2][2] = 1;
a3.a[0][0] = -1;a3.a[0][1] = 0;a3.a[0][2] = 0;
a3.a[1][0] = 0;a3.a[1][1] = 1;a3.a[1][2] = 0;
a3.a[2][0] = 0;a3.a[2][1] = 0;a3.a[2][2] = 1;
a4.a[0][0] = 1;a4.a[0][1] = 0;a4.a[0][2] = 0;
a4.a[1][0] = 0;a4.a[1][1] = -1;a4.a[1][2] = 0;
a4.a[2][0] = 0;a4.a[2][1] = 0;a4.a[2][2] = 1;
read(n);
for(int i=1;i<=n;i++){
num[i].clr(3);
read(num[i].a[0][0]);
read(num[i].a[1][0]);
num[i].a[2][0] = 1;
}
read(m);
for(int i=1;i<=m;i++){
read(qr[i].x);
if(qr[i].x>2) read(qr[i].y);
}
read(p);
for(int i=1;i<=p;i++){
int x,y;read(x);read(y);
v[x].push_back({y,i});
}
build(1,1,n);
for(int k=0;k<=m;k++){
if(k){
if(qr[k].x == 1) q[1] *= a1;
else if(qr[k].x == 2) q[1] *= a2;
else if(qr[k].x == 3){
a3.a[0][2] = 2*qr[k].y;
q[1] *= a3;
}else{
a4.a[1][2] = 2*qr[k].y;
q[1] *= a4;
}
}
for(auto x:v[k]){
//debug(x.first);
Matrix tt = num[x.first]*q[1];
res[x.second] = {tt.a[0][0],tt.a[1][0]};
}
}
for(int i=1;i<=p;i++)
printf("%lld %lld\n",res[i].first,res[i].second);
return 0;
}
/***
10
0 1 0 1 0 1 0 1 0 1
4
1 3
1 4
2 3n
2 7
***/
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define rng(v) v.begin(),v.end()
#define rngr(v) v.rbegin(),v.rend()
const long long INF = 1LL << 60;
using namespace std;
using ll = long long;
using P = pair<int, int>;
using LP = pair<ll, ll>;
using P3 = tuple<int, int, int>;
#define vi vector<int>
#define vvi vector<vi>
#define vll vector<ll>
#define vs vector<string>
using vp = vector<P>;
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; return 1; } return 0; }
using CP = complex<double>;
double dot( const CP &z, const CP &w ){ return (z.real()*w.real() + z.imag()*w.imag()); }
double cross( const CP &z, const CP &w ){ return (z.real()*w.imag() - z.imag()*w.real()); }
int main()
{
int n;
string s;
int q;
cin >> n >> s >> q;
bool rev = false;
auto id = [&](int i){
if(i < n) return i+n;
else return i-n;
};
while(q--){
int t, a, b;
cin >> t >> a >> b;
--a;--b;
if(t==1){
if(!rev) swap(s[a], s[b]);
else {
swap(s[id(a)], s[id(b)]);
}
}else{
// string x = s.substr(0, n);
// string y = s.substr(n);
// s = y+x;
rev = !rev;
}
}
if(rev) {
string x = s.substr(0, n);
string y = s.substr(n);
s = y+x;
}
cout << s << endl;
return 0;
} | // URL
#include <iostream>
#include <string>
using namespace std;
#define loop(i, a, b) for (int i = a; i < b; i++)
#define mp make_pair
#define pb push_back
#define sz size
#define rsz resize
typedef long long LL;
const char NL = '\n';
const char SP = ' ';
const char HB[] = "HOBA";
const LL llinf = 9e18;
const int iinf = 2e9;
int main() {
ios_base::sync_with_stdio(false);
int n, q;
cin >> n;
string s;
cin >> s >> q;
string p1(s.begin(), s.begin() + n), p2(s.begin() + n, s.end());
bool left_in_p1 = true;
loop (j, 0, q) {
int t, a, b;
cin >> t >> a >> b;
if (t == 2) {
left_in_p1 = !left_in_p1;
}
else {
a--;
b--;
if (a < n && b < n) {
if (left_in_p1) {
swap(p1[a], p1[b]);
}
else {
swap(p2[a], p2[b]);
}
}
else if (a < n && b >= n) {
if (left_in_p1) {
swap(p1[a], p2[b % n]);
}
else {
swap(p2[a], p1[b % n]);
}
}
else if (a >= n && b >= n) {
a %= n;
b %= n;
if (left_in_p1) {
swap(p2[a], p2[b]);
}
else {
swap(p1[a], p1[b]);
}
}
}
}
if (left_in_p1) {
cout << p1 << p2 << NL;
}
else {
cout << p2 << p1 << NL;
}
return 0;
}
/*
SAMPLE
*/ |
#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
long long gcd(long long a, long long b) {
if (b == 0) return a;
else return gcd(b, a%b);
}
long long lcm(long long x, long long y) {
return x * y / gcd(x, y);
}
unordered_map<int, int>mp;
//約数列挙
void calc(const int &N) {
for (int i = 1; i <= sqrt(N); i++) {
if (0 == N % i) {
mp[i] = gcd(mp[i], N);
if (N != i * i) {
mp[N / i] = gcd(mp[N / i], N);
}
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N;
cin >> N;
vector<int>A(N);
rep(i, N) {
cin >> A[i];
}
int minA = 1e9;
rep(i, N) {
minA = min(minA, A[i]);
}
rep(i, N) {
calc(A[i]);
}
int ans = 0;
for (auto p : mp) {
if ((p.first <= minA) && (p.first == p.second)) {
ans++;
}
}
cout << ans << endl;
return 0;
} | #include<iostream>
#include<cstdio>
#include<cstring>
#include<map>
#include<algorithm>
#define N 200005
using namespace std;
int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+(ch^48);ch=getchar();}
return x*f;
}
int n,a[N],maxn=0x3f3f3f3f;
map<int,int>f;
map<int,int>::iterator it;
int main()
{
n=read();
for(int i=1;i<=n;i++)a[i]=read(),maxn=min(maxn,a[i]);
for(int i=1;i<=n;i++)
{
for(int j=1;j*j<=a[i]&&j<maxn;j++)
{
if(a[i]%j==0)
{
if(f[j]==0)f[j]=a[i];
else f[j]=__gcd(f[j],a[i]);
if(a[i]/j<maxn)
{
int x=a[i]/j;
if(f[x]==0)f[x]=a[i];
else f[x]=__gcd(f[x],a[i]);
}
}
}
}
int ans=0;
for(it=f.begin();it!=f.end();it++)
{
ans+=(it->first==it->second);
}
printf("%d\n",ans+1);
}
|
#include <iostream>
#include <cmath>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <iterator>
#include <unordered_map>
#include <unordered_set>
#include <sstream>
#include <fstream>
#include <numeric>
#include <tuple>
#include <ctime>
#include <random>
#include <array>
#include <cassert>
using namespace std;
#define fori(t) for(int i = 0; i < t; ++i)
#define forj(n) for(int j = 0; j < n; ++j)
#define fork(n) for(int k = 0; k < n; ++k)
#define forai(a) for(auto& i : a)
#define foraj(a) for(auto& j : a)
#define forak(a) for(auto& k : a)
#define forp(s, n, d) for(int p = s; p < n; p += d)
#define fast ios_base::sync_with_stdio(0); cin.tie(0);
#define pb(a) push_back(a);
#define pob(a) pop_back(a);
#define sorti(a) sort((a).begin(), (a).end());
#define sortm(a, n) sort(a, a + n);
#define reversi(a) reverse((a).begin(), (a).end());
#define all(a) (a).begin(), (a).end()
#define fi first
#define se second
#define yes cout << "Yes\n";
#define no cout << "No\n";
#define ans(a) cout << a << '\n';
#define endl '\n'
#define res(a, n) (a).resize(n);
#define read(a, n) (a).resize(n); fori(n) cin >> a[i];
#define print(a) for (auto hart : a) cout << hart << ' ';
#define clear(a) (a).clear();
//#define int long long
//#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<long long, long long> llll;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<pair<int, int>> vii;
typedef vector<pair<int, pair<int, int>>> viii;
typedef pair<int, pair<int, int>> iii;
typedef vector<pair<long long, long long>> vllll;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvll;
typedef vector<bool> vb;
typedef pair<char, char> cc;
typedef pair<pair<char, char>, char> ccc;
typedef vector<char> vc;
typedef pair<int, char> ic;
typedef pair<ii, char> iic;
typedef vector<bool> vb;
typedef set<int> si;
typedef vector<vector<ii>> vvii;
typedef vector<vector<iii>> vviii;
typedef vector<vector<llll>> vvllll;
const int INF = 2147483647;
const ll LONGINF = 9223372036854775807;
const ll MOD = 1e9 + 7;
void solve()
{
ll r, x, y;
cin >> r >> x >> y;
ll d = x * x + y * y;
if (sqrtl(d) == round(sqrtl(d)))
{
if (d % r == 0)
{
ans(int(sqrtl(d)) / r)
return;
}
}
ll counter = 0;
while (d > r * r * (2 + counter) * (2 + counter))
{
++counter;
}
ans(counter + 2)
}
signed main()
{
fast
bool mult = false;
if (mult)
{
int t;
cin >> t;
while (t--) solve();
}
else solve();
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int main(){
int64_t R, X, Y;
cin >> R >> X >> Y;
int64_t D = X*X + Y*Y;
int64_t ok = 1e7;
int64_t ng = 0;
while(ok - ng > 1){
int64_t mid = (ok+ng)/2;
int64_t K = mid*R;
if(K > D/K || (K == D/K && D%K == 0)){
ok = mid;
}
else{
ng = mid;
}
}
if(ok == 1 && D != R*R){
ok = 2;
}
cout << ok << endl;
} |
#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) x=max(x,y)
#define chmin(x,y) x=min(x,y)
#define F first //pairの一つ目の要素
#define S second //pairの二つ目の要素
#define PB push_back //挿入
#define MP make_pair //pairのコンストラクタ
//V,Pは大文字i,l,bは小文字
using ll = long long;
using Vi = vector<int>;
using VVi = vector<Vi>;
using Vl = vector<ll>;
using VVl = vector<Vl>;
using Vb = vector<bool>;
using VVb = vector<Vb>;
using P = pair<int,int>;
using Pl = pair<ll, ll>;
using Vs = vector<string>;
const ll mod = 1000000007;
const ll inf = 1000000000000000000;//10の18乗
#define yn {puts("Yes");}else{puts("No");}
#define dame { puts("-1"); return 0;}
int main() {
ll a,b,c;
cin >> a >> b >> c;
if(a*a+b*b<c*c) yn;
}
| #pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
//#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(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please
const int IM = 2e9;
int dat[400004];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
dat[0] = -IM;
ll kotae = -IM * ll(N);
for (int i = N + 1; i > 1; i--) {
cin >> dat[i];
kotae += dat[i];
}
for (int i = 2; i < N + 2; i++) {
int p = i - 1;
int v = dat[i] - IM;
while (v < dat[p >> 1]) dat[p] = dat[p >> 1], p >>= 1;
dat[p] = v;
int a;
cin >> a;
kotae += a;
p = i;
v = a - IM;
while (v < dat[p >> 1]) dat[p] = dat[p >> 1], p >>= 1;
dat[p] = v;
kotae -= dat[1];
v = dat[i];
dat[i] = IM;
p = 2 + (dat[2] > dat[3]);
while (v > dat[p]) {
dat[p >> 1] = dat[p];
p <<= 1;
p += dat[p] > dat[p + 1];
}
dat[p >> 1] = v;
}
co(kotae);
Would you please return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long int lld;
typedef pair<int,int> pi;
typedef pair<lld,lld> pl;
typedef pair<int,lld> pil;
typedef pair<lld,int> pli;
typedef vector<int> vit;
typedef vector<vit> vitt;
typedef vector<lld> vlt;
typedef vector<vlt> vltt;
typedef vector<pi> vpit;
typedef vector<vpit> vpitt;
typedef long double ld;
#define x first
#define y second
#define pb push_back
#define all(v) v.begin(), v.end()
#define sz(x) (int)x.size()
#define mk(a,b) make_pair(a,b)
bool isrange(int y,int x,int n,int m){
if(0<=y&&y<n&&0<=x&&x<m) return true;
return false;
}
int dy[4] = {1,0,-1,0},dx[4]={0,1,0,-1},ddy[8] = {1,0,-1,0,1,1,-1,-1},ddx[8] = {0,1,0,-1,1,-1,1,-1};
void solve(int tc){
string a;
cin >> a;
string b = "";
b += a[1];
b += a[2];
b += a[0];
cout << b;
}
int main(void){
/*
ios_base :: sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
*/
int tc = 1;
/*
cin >> tc;
*/
for(int test_number=1;test_number<=tc;test_number++){
solve(test_number);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
string S;
cin >> S;
swap(S[0], S[2]);
swap(S[0], S[1]);
cout << S << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (ll i=0; i<n; ++i)
#define all(obj) (obj).begin(),(obj).end()
#define MOD 1000000007
#define PI acos(-1)
#define INF = 1001001001;
using namespace std;
using Graph = vector<vector<long long>>;
typedef long long ll;
long long GCD(long long x, long long y) { return y ? GCD(y, x%y) : x; }
int main(){
vector<int> abc(3);
rep(i, 3) cin >> abc[i];
sort(all(abc));
cout << abc[2] + abc[1] << endl;
return 0;
}
| //#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define sz(a) (int)a.size()
#define INF 0x3f3f3f3f
#define DNF 0x7f7f7f7f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define PiL pair <ll , ll>
#define PLL pair <ll , ll>
#define pii pair <int , int>
#define mk(a, b) make_pair(a,b)
#define pb push_back
#define LF putchar('\n')
#define SP putchar(' ')
#define p_queue priority_queue
#define CLOSE ios::sync_with_stdio(0); cin.tie(0)
template<typename T>
void read(T &x) {x = 0;char ch = getchar();ll f = 1;while(!isdigit(ch)){if(ch == '-')f *= -1;ch = getchar();}while(isdigit(ch)){x = x * 10 + ch - 48; ch = getchar();}x *= f;}
template<typename T, typename... Args>
void read(T &first, Args& ... args) {read(first);read(args...);}
template<typename T>
void write(T arg) {T x = arg;if(x < 0) {putchar('-'); x =- x;}if(x > 9) {write(x / 10);}putchar(x % 10 + '0');}
template<typename T, typename ... Ts>
void write(T arg, Ts ... args) {write(arg);if(sizeof...(args) != 0) {putchar(' ');write(args ...);}}
using namespace std;
ll gcd(ll a, ll b) {
return b == 0 ? a : gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
int n, m, T;
ll a[N], sum[N], maxn[N], sum2[N];
int main()
{
CLOSE;
cin >> n;
for (int i = 1 ; i <= n ; i ++) cin >> a[i];
for (int i = 1 ; i <= n ; i ++)
sum[i] = sum[i-1] + a[i];
for (int i = 1 ; i <= n ; i ++)
sum[i] += sum[i-1];
for (int i = 1 ; i <= n ; i ++) {
maxn[i] = max(maxn[i - 1], a[i]);
}
for (int i = 1 ; i <= n ; i ++)
cout << (1ll * i * maxn[i] + sum[i]) << endl;
} |
#include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
using namespace std;
int main(){
long n,temp,temp1,ans;cin>>n;
long digit=to_string(n).size();
if(digit%2==1){
temp=pow(10,digit/2)-1;
ans=temp;
}else{
temp=n/pow(10,digit/2);
temp1=n%(long)pow(10,digit/2);
if(temp>temp1)ans=temp-1;
else ans=temp;
}
cout<<ans<<endl;
}
| #include<bits/stdc++.h>
using namespace std ;
#define ll long long
#define pb push_back
#define all(v) v.begin(),v.end()
#define sz(a) (ll)a.size()
#define F first
#define S second
#define INF 2000000000000000000
#define popcount(x) __builtin_popcountll(x)
#define pll pair<ll,ll>
#define pii pair<int,int>
#define ld long double
const int M = 1000000007;
const int MM = 998244353;
const long double PI = acos(-1);
template<typename T, typename U> static inline void amin(T &x, U y){ if(y<x) x=y; }
template<typename T, typename U> static inline void amax(T &x, U y){ if(x<y) x=y; }
template<typename T, typename U> ostream& operator<<(ostream &os, const pair<T, U> &p)
{
return os<<'('<<p.F<< ","<<p.S<<')';
}
ll power(ll b,ll e,ll m)
{
if(e==0) return 1;
if(e&1) return b*power(b*b%m,e/2,m)%m;
return power(b*b%m,e/2,m);
}
ll power( ll b, ll e)
{
if(e==0) return 1;
if(e&1) return b*power(b*b,e/2);
return power(b*b,e/2);
}
int _runtimeTerror_()
{
string n;
cin>>n;
if(sz(n) <= 1)
{
cout<<"0\n";return 0;
}
if(sz(n)%2 != 0)
{
int u = (sz(n))/2;
cout<<power(10,u)-1<<"\n";
return 0;
}
ll x = 0;
string t;
for(int i=0;i<sz(n)/2;++i)
{
x += (n[i]-'0')*power(10,sz(n)/2-i-1);
t += n[i];
}
t += t;
if(t > n)
--x;
cout<<x<<"\n";
return 0;
}
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#ifdef runSieve
sieve();
#endif
#ifdef NCR
initialize();
#endif
int TESTS=1;
//cin>>TESTS;
while(TESTS--)
_runtimeTerror_();
return 0;
} |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <unordered_map>
#include <iomanip>
#include <cmath>
#include <queue>
#include <bitset>
#include <numeric>
#include <array>
#include <cstring>
#include <random>
#include <chrono>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
typedef long long ll;
typedef long double ld;
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template<class T>
// using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
void solve() {
int n;
cin >> n;
vector<int> p(n), pos(n);
for(int i = 0; i < n; i++) {
cin >> p[i]; p[i]--;
pos[p[i]] = i;
}
int cur = 0;
vector<int> ans;
int op[5] = {2, 1, 2, 1, 2};
for(int i = 0; i < n; i++) {
if(pos[i] != i) {
int cpos = pos[i];
if(cpos % 2 == cur % 2) {
if(cpos - 2 == i - 1) {
for(int j = 0; j < 5; j++) {
ans.pb(cpos - op[j]); cur++;
swap(p[cpos - op[j]], p[cpos - op[j] + 1]);
swap(pos[p[cpos - op[j]]], pos[p[cpos - op[j] + 1]]);
}
continue;
}
ans.pb(cpos - 2); cur++;
swap(p[cpos - 2], p[cpos - 1]);
swap(pos[p[cpos - 2]], pos[p[cpos - 1]]);
ans.pb(cpos - 1); cur++;
swap(p[cpos - 1], p[cpos]);
swap(pos[p[cpos - 1]], pos[p[cpos]]);
for(int j = cpos - 2; j >= i; j--) {
swap(p[j], p[j + 1]);
swap(pos[p[j]], pos[p[j + 1]]);
ans.pb(j); cur++;
}
} else {
for(int j = cpos - 1; j >= i; j--) {
ans.pb(j); cur++;
swap(p[j], p[j + 1]);
swap(pos[p[j]], pos[p[j + 1]]);
}
}
}
}
// for(auto& x : p) cout << x + 1 << ' ';
// cout << '\n';
cout << ans.size() << '\n';
// for(int i = 0; i < ans.size(); i++) {
// if(i % 2 != ans[i] % 2) cout << "BAD\n";
// }
for(auto& x : ans) cout << x + 1 << ' ';
cout << '\n';
}
int main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int t = 0;
cin >> t;
while(t--) solve();
return 0;
}
/*
*/
| #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#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 sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
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) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}
void solve(){
int N; cin >> N;
vector<int> A(N);
rep(i,N){
cin >> A[i];
}
vector<int> G=A;
sort(all(G));
int cnt = 0;
vector<int> ans;
while(G!=A){
if(cnt%2==0){
int ch = 0;
for(int i=0;i+1<N;i+=2){
if(A[i]>A[i+1]){
ch = i;
//break;
}
}
ans.pb(ch);
swap(A[ch], A[ch+1]);
}
else{
int ch = 1;
for(int i=1;i+1<N;i+=2){
if(A[i]>A[i+1]){
ch=i;
//break;
}
}
ans.pb(ch);
swap(A[ch],A[ch+1]);
}
cnt++;
}
cout << cnt << endl;
rep(i,sz(ans)){
if(i) cout << " ";
cout << ans[i]+1;
}
cout << endl;
}
int main(){
int T; cin >> T;
while(T--){
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;
class rep {
struct Iter {
usize itr;
constexpr Iter(const usize pos) noexcept: itr(pos) { }
constexpr void operator ++ () noexcept { ++itr; }
constexpr bool operator != (const Iter& other) const noexcept { return itr != other.itr; }
constexpr usize operator * () const noexcept { return itr; }
};
const Iter first, last;
public:
explicit constexpr rep(const usize first, const usize last) noexcept: first(first), last(std::max(first, last)) { }
constexpr Iter begin() const noexcept { return first; }
constexpr Iter end() const noexcept { return last; }
};
template <class T>
using Vec = std::vector<T>;
void A_main() {
// S_i, S_j の異なる bit が奇数個
// mod 2 において
// popcount(S_i xor S_j)
// = popcount(S_i) + popcount(S_j) - 2 * popcount(S_i and S_j)
// = popcount(S_i) + popcount(S_j)
usize N, M;
std::cin >> N >> M;
u64 even = 0, odd = 0;
for (auto i: rep(0, N)) {
usize sum = 0;
for (auto j: rep(0, M)) {
char c;
std::cin >> c;
sum += c - '0';
}
(sum % 2 == 0 ? even : odd) += 1;
}
std::cout << even * odd << '\n';
return;
}
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
A_main();
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int mod=1000000007;
int main()
{
int m,h;
cin>>m>>h;
if(h%m==0)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
}
/* common mistakes:
long long
pass constants as &
*/
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using pl = pair<ll, ll>;
const ll INF = ll(1e18);
const ll mod = ll(998244353);
const double pi = acos(-1);
#define rep0(i,n) for(ll (i) = 0; (i) < (n); ++(i))
#define rrep0(i,n) for(ll (i) = (n) - 1; (i) >= 0; --(i))
#define rep1(i,n) for(ll (i) = 1; (i) <= (n); ++(i))
#define rrep1(i,n) for(ll (i) = (n); (i) >= 1; --(i))
#define nfor(i,a,b) for(ll (i) = (a); (i) < (b); ++(i))
#define rnfor(i,a,b) for(ll (i) = (b) - 1; (i) >= (a); --(i))
#define pf(x) cout << (x) << endl
#define all(x) (x).begin(),(x).end()
#define yes pf("Yes")
#define no pf("No")
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) { a=b; return 1; } return 0; }
const int dx[8]={1,0,-1,0,1,1,-1,-1};
const int dy[8]={0,1,0,-1,1,-1,1,-1};
int multipf(vector<string>& s){
cout << s[0];
rep1(i, s.size() - 1)cout << " " << s[i];
cout << endl;
return 0;
}
int multipf(vector<ll>& n){
cout << n[0];
rep1(i, n.size() - 1)cout << " " << n[i];
cout << endl;
return 0;
}
ll gcd(ll a,ll b){
if(a < b)swap(a, b);
if(b == 0) return a;
return gcd(b,a%b);
}
ll lcm(ll a,ll b){
ll g = gcd(a,b);
return a / g * b;
}
ll factorial(ll n){
ll ans = 1;
rep1(i, n){
ans *= i;
ans %= mod;
}
return ans;
}
ll power(ll a, ll b){
ll ans = 1;
while(b) {
if(b & 1LL) ans = ans * a % mod;
ans %= mod;
a = a * a;
a %= mod;
b >>= 1;
}
return ans % mod;
}
//modの値の確認をすること
int main(){
bool f = false;
string s;
cin >> s;
vector<ll> c(10,0);
rep0(i, s.size())c[s[i] - '0']++;
int n = 8;
while (n < 1000) {
string t = to_string(n);
vector<ll> m(10,0);
rep0(i, t.size())m[t[i] - '0']++;
bool k = true;
rep0(i, 10)if(m[i] > c[i])k = false;
if(k && ((s.size() < 2 && n < 10) || ( 2 <= s.size() && s.size() < 3 && 10 < n && n < 100) || (s.size() >= 3 && n > 100)))f = true;
n += 8;
}
f? yes:no;
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
int a[233];
char ch[1000000+10];
bool Check(int x,int y,int z)
{
a[x]--;
a[y]--;
a[z]--;
if((a[x]>=0)&&(a[y]>=0)&&(a[z]>=0)) return true;
a[x]++;
a[y]++;
a[z]++;
return false;
}
int main()
{
scanf("%s",ch+1);
for(int i=1;ch[i];i++)
a[ch[i] - '0']++;
int n = strlen(ch+1);
if(n==1)
{
if(ch[1]=='8') printf("Yes");
else printf("No");
return 0;
}
if(n==2)
{
int x = (ch[1]-'0')*10 + ch[2] - '0';
if(x%8==0) return printf("Yes\n"),0;
x = (ch[2]-'0')*10 + ch[1] - '0';
if(x%8==0) return printf("Yes\n"),0;
printf("No");
return 0;
}
for(int i=104;i<=999;i+=8)
{
if(Check(i%10,i/100,i%100/10)) return printf("Yes"),0;
}
printf("No");
return 0;
} |
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define min_e(v) *min_element(ALL(v))
#define max_e(v) *max_element(ALL(v))
#define acm accumulate
#define SUM(v) accumulate(ALL(v), 0l)
#define SORT(v) sort(ALL(v))
#define P 1000000007
long powP (long a, long b) {
if (b == 1) return a;
else if (b == 0) return 1;
else if (b < 0) return powP(a, P - 1 + b);
else {
long b2 = powP(a, b/2);
b2*=b2;
b2%=P;
return (b2 * powP(a, b%2)) % P;
}
}
template <typename T>
using vec = vector<T>;
template <typename T>
using vvec = vector<vector<T>>;
#define INF INT_MAX
#define x first
#define y second
long sa (long b, int n) {
long c = b % (long)pow(2, n);
b /= (long)pow(2, n);
while (c != 0) {
while (c%2==0) c/=2;
if (c%4==3) {
c++;
b++;
} else {
c--;
b++;
}
}
return b;
}
int main() {
long x, y;
cin>>x>>y;
long ans = LONG_MAX;
for (int n = 0; pow(2, n)*x<LONG_MAX; n++) {
long b = abs(y-x*(long)pow(2, n));
ans = min(ans, sa(b, n)+n);
}
cout<<ans;
}
| #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define bit(n,k) ((n>>k)&1)
using namespace std;
typedef long long ll;
ll x,y;
unordered_map<ll,ll> mp;
ll Dfs(ll n){
if(n <= x) return x - n;
if(n % 2 == 0) return mp[n] = min(n - x, Dfs(n / 2) + 1);
if(mp.count(n)) return mp[n];
return mp[n] = min(Dfs(n + 1), Dfs(n - 1)) + 1;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(0);
cin >> x >> y;
cout << Dfs(y) << '\n';
} |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using P = pair<int,int>;
/*
for(int i=0;i<n;i++){
}
*/
int main(){
int n;
cin>>n;
cout<<n-1<<endl;
}
| #include <bits/stdc++.h>
typedef long long ll;
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
using namespace std;
// void solve()
// {
// }
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
// int t;
// cin >> t;
// while (t--)
// solve();
int n;
cin >> n;
int ans = 0;
for (int i = 1; i <= n / 2; i++)
{
ans += (i != n - i ? 2 : 1);
}
cout << ans << endl;
return 0;
} |
// Problem: B - 200th ABC-200
// Contest: AtCoder - KYOCERA Programming Contest 2021（AtCoder Beginner Contest 200）
// URL: https://atcoder.jp/contests/abc200/tasks/abc200_b
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define ff first
#define ss second
#define VI vector <int>
#define VVI vector <VI>
#define pii pair<int, int>
#define ppi pair<pii, int>
#define mii map<int, int>
#define mci map<char, int>
#define miv map<int, VI>
#define mis map<int, set<int>>
#define setbits(n) __builtin_popcount(n)
#define all(v) (v).begin(), (v).end()
#define yes cout<<"Yes"<<endl
#define no cout<<"No"<<endl
#define endl "\n"
#define show2(a, b) cout<<a<<' '<<b<<endl
#define show3(a, b, c) cout<<a<<' '<<b<<' '<<c<<endl
#define show(arr) for (auto i:arr) cout<<i<<' ';
const long long N=1e5+5;
const long long mod=1000000007; //998244353
void cases(){
int n, k;
cin>>n>>k;
for (int i=0; i<k; i++){
if (n%200){
n=(n*1000+200);
}
else n/=200;
}
cout<<n;
}
int32_t main(){
std::ios::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int t=1;
// cin>>t;
for (int i=0; i<t; i++){
//cout<<"Case #"<<i+1<<": ";
cases();
}
return 0;
}
| // Problem: B - 200th ABC-200
// Contest: AtCoder - KYOCERA Programming Contest 2021（AtCoder Beginner Contest 200）
// URL: https://atcoder.jp/contests/abc200/tasks/abc200_b
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
int s=0,w=1;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
return s*w;
}
const int p=998244353;
int qp(int x,int y)
{
int res=1;
for(int t=x; y; y>>=1,t=t*t%p) if(y&1) res=res*t%p;
return res;
}
signed main()
{
int n=read();
int k=read();
for(int i=1; i<=k; ++i)
{
if(n%200!=0)
{
n*=1000,n+=200;
}
else n/=200;
}
printf("%lld\n",n);
return 0;
} |
#include <bits/stdc++.h>
// #define int long long
#define ff first
#define ss second
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ti tuple<int, int, int>
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pii>
#define sws ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl '\n'
#define teto(a, b) (((a)+(b)-1)/(b))
#define all(x) x.begin(), x.end()
#define forn(i, n) for(int i = 0; i < (int)n; i++)
#define forne(i, a, b) for(int i = a; i <= b; i++)
#define dbg(msg, var) cerr << msg << " " << var << endl;
using namespace std;
const int MAX = 3e5+10;
const ll MOD = 1e9+7;
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;
const ld EPS = 1e-8;
const ld PI = acos(-1);
// End Template //
int h, w, A, B;
ll solve(int x, int y, int a, vector<vector<bool>> &mat){
ll ans = 0;
if(a==0) return 1;
if(x<h-1)
ans += solve(x+1, y, a, mat);
else if(y<w-1)
ans += solve(0, y+1, a, mat);
else
return 0;
if(x<h-1 and !mat[x][y] and !mat[x+1][y]){
mat[x][y]=mat[x+1][y]=true;
ans += solve(x+1, y, a-1, mat);
mat[x][y]=mat[x+1][y]=false;
}
if(y<w-1 and !mat[x][y] and !mat[x][y+1]){
mat[x][y]=mat[x][y+1]=true;
if(x<h-1)
ans += solve(x+1, y, a-1, mat);
else
ans += solve(0, y+1, a-1, mat);
mat[x][y]=mat[x][y+1]=false;
}
return ans;
}
int32_t main()
{sws;
cin >> h >> w >> A >> B;
vector<vector<bool>> mat(h, vector<bool>(w, false));
cout << solve(0, 0, A, mat) << endl;
return 0;
}
| #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int k; cin>>k;
string s,t; cin>>s>>t;
vector<int> vec(9,k);
for(int i=0;i<4;i++){
vec.at(s.at(i)-'0'-1)--;
vec.at(t.at(i)-'0'-1)--;
} //vec内が残り枚数を示すことに。なお合計枚数は9k-8枚
double ans=0;
cout << fixed<<setprecision(20);
for(int i=1;i<=9;i++){
for(int j=1;j<=9;j++){
double p=0;
if(i==j){
p+=vec.at(i-1)*(vec.at(i-1)-1)/(9*k-8.0)/(9*k-9.0);
}else{
p=vec.at(i-1)*vec.at(j-1)/(9*k-8.0)/(9*k-9.0);
}
vector<int> vecs(9,0),vect(9,0);
for(int k=0;k<4;k++){
vecs.at(s.at(k)-'0'-1)++;
vect.at(t.at(k)-'0'-1)++;
}
vecs.at(i-1)++;
vect.at(j-1)++; //vecs,vectにそれぞれsとtの1～9の個数
int ns=0,nt=0; //sとtのijの際の得点
for(int k=1;k<=9;k++){
ns += k*pow(10,vecs.at(k-1));
nt += k*pow(10,vect.at(k-1));
}
if(ns>nt){
ans +=p;
}
}
}
cout <<ans<<endl;
} |
#include <cmath>
#include <deque>
#include <algorithm>
#include <iterator>
#include <list>
#include <tuple>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <stack>
#include <string>
#include <vector>
#include <fstream>
#include <iostream>
#include <functional>
#include <numeric>
#include <iomanip>
#include <stdio.h>
//eolibraries
#define lnf 3999999999999999999
#define inf 999999999
#define PI 3.14159265359
#define endl "\n"
#define fi first
#define se second
#define pb push_back
#define ll long long
#define all(c) (c).begin(),(c).end()
#define sz(c) (int)(c).size()
#define mkp(a,b) make_pair(a,b)
#define make_unique(a) sort(all(a)),a.erase(unique(all(a)),a.end())
#define rsz(a,n) a.resize(n)
#define pii pair <int,int>
#define rep(i,n) for(int i = 0 ; i < n ; i++)
#define drep(i,n) for(int i = n-1 ; i >= 0 ; i--)
#define crep(i,x,n) for(int i = x ; i < n ; i++)
#define vi vector <int>
#define v(s) vector<s>
#define rsz(a,n) a.resize(n)
#define rszv(a,n,v) a.resize(n,v)
#define fcin ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
//eodefine
const int max_n = 100 , max_m=500000;
using namespace std;
int n,m;
v(pii) a[max_n];
void rdd(){
cin>>n>>m;
rep(i,m) {
int x,y,z;
cin>>x>>y>>z;
y--;
a[x].pb({y,z});
}
}
bool ok(int msk, v(pii) t) {
for(auto p : t) {
int cnt=0;
rep(i,n) {
if(msk&(1<<i)) {
if(i<=p.fi)cnt++;
}
}
if(cnt>p.se)return 0;
}
return 1;
}
ll dp[max_n][max_m];
int main(){
fcin;
rdd();
dp[0][0]=1;
// cout<<(1<<n) <<"|n"
ll fll=(1<<n);
// cout<<fll<<"\n";
rep(i,n+1){
rep(msk,(1<<n)) {
int k=__builtin_popcount(msk);
if(dp[i][msk] == 0 or ok(msk,a[i]) == 0 or k!=i)continue;
rep(x,n) {
if(msk&(1<<x)) continue;
dp[i+1][msk|(1<<x)] += dp[i][msk];
// cout<<dp[i][msk]<<"\n";
}
}
}
ll ans=0;
rep(msk,(1<<n)) {
ans+=dp[n][msk];
}
cout<<ans<<"\n";
/*
*/
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using P = pair<int64_t,int64_t>;
const int MAX = (1<<19);
int64_t dp[MAX];
int main(){
int N, M;
cin >> N >> M;
vector<vector<P>> vec(N,vector<P>(0));
for(int i=0; i<M; i++){
int X, Y, Z;
cin >> X >> Y >> Z;
X--;
vec[X].push_back(P(Y,Z));
}
dp[0] = 1;
for(int i=0; i<(1<<N); i++){
int c = 0;
vector<int> sum(N);
for(int j=0; j<N; j++){
if(i & (1<<j)){
c++;
sum[j]++;
}
if(j != 0){
sum[j] += sum[j-1];
}
}
//何を追加するか？
for(int j=0; j<N; j++){
if(i & (1<<j)){
continue;
}
bool flag = true;
for(int k=0; k<vec[c].size(); k++){
auto[y,z] = vec[c][k];
if(j < y){
z--;
}
if(sum[y-1] > z){
flag = false;
break;
}
}
if(flag){
dp[i|(1<<j)] += dp[i];
}
}
}
cout << dp[(1<<N)-1] << endl;
}
|
#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;
typedef vector<vl> vvl;
typedef vector<pl> vpl;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define rep2(i, k, n) for(ll i = ll(k); i <= ll(n); i++)
#define rep3(i, n, k) for(ll i = ll(n); i >= ll(k); i--)
#define all(v) (v).begin(), (v).end()
ll mod(ll a, ll b) {if(b == 0) return 0; return (a % b + b) % b;}
bool chmin(ll &a, ll b) {if(b < a) {a = b; return 1;} return 0;}
bool chmax(ll &a, ll b) {if(b > a) {a = b; return 1;} return 0;}
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
//const ll MOD = 998244353;
const ll MAX = 2e5;
const ld eps = 1e-9;
const char newl = '\n';
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
string s, t;
cin >> n >> s >> t;
ll ss=0, tt=0, ans=0;
ql q;
rep(i, n) {
if(t[i]=='1') q.push(i);
if(s[i]=='1') {
if(q.size()) {
ans += i - q.front();
q.pop();
}else {
ss = 1 - ss;
q.push(i);
}
}
}
cout << (q.empty() ? ans : -1) << newl;
return 0;
} | #include <iostream>
#include <cstdio>
#define maxn 500005
using namespace std;
int n, pos[maxn], cnt;
char s[maxn], t[maxn];
int main()
{
scanf("%d%s%s", &n, s + 1, t + 1);
for (int i = 1; i <= n; i++)
{
if(t[i] == '1') pos[++cnt] = i;
}
int now = 1, st = 0;
long long ans = 0;
for (int i = 1; i <= n; i++)
{
if(s[i] == '0') continue;
if(st)
{
ans += i - st;
st = 0;
}
else
{
if(i >= pos[now] && now <= cnt)
{
ans += i - pos[now];
now++;
}
else st = i;
}
}
if(now <= cnt || st) printf("-1");
else printf("%lld", ans);
return 0;
} |
#include<bits/stdc++.h>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long int
#define mod 1000000007
#define inf 1e18+42
#define endl "\n"
#define pi 3.1415926535897932384626433832795028841971693993751058
#define maxn 100005
#define out1(a) cout<<#a<<" "<<a<<endl
#define out2(a,b) cout<<#a<<" "<<a<<" "<<#b<<" "<<b<<endl
#define out3(a,b,c) cout<<#a<<" "<<a<<" "<<#b<<" "<<b<<" "<<#c<<" "<<c<<endl
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repr(i,a,b) for(int i=a;i>=b;i--)
#define fori(it,A) for(auto it=A.begin();it!=A.end();it++)
#define ft first
#define sd second
#define pb push_back
#define mp make_pair
#define pq priority_queue
#define all(x) (x).begin(),(x).end()
#define zero(x) memset(x,0,sizeof(x));
#define ceil(a,b) (a+b-1)/b
using namespace std;
int binpow(int a, int b) {
int res = 1;
while (b > 0) {
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
//START OF CODE ->->->->->->->
void solve()
{
int n,k;
cin>>n>>k;
while(k){
if ( n % 200 == 0 ){
n /= 200;
k--;
}
else{
if ( k >= 2 ){
n *= 5;
n++;
k -= 2;
}
else{
n *= 5;
n++;
n *= 200;
k--;
}
}
}
cout<<n<<endl;
}
//END OF CODE ->->->->->->->->
signed main()
{
fast;
int t = 1;
// cin>>t;
for ( int i = 1 ; i <= t ; i++ ){
// cout<<"Case #"<<i<<": ";
solve();
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
typedef vector<int> vi;
#define all(x) x.begin(), x.end()
#define FIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define endl "\n"
#define pb push_back
#define mp make_pair
#define re(i,n) for(int i=0;i<(n);i++)
#define re1(i, k, n) for (int i = k; k < n ? i <= n : i >= n; k < n ? i += 1 : i -= 1)
#define FORD(i,a,b) for(int i=(a);i>=(b);i--)
typedef pair<int, int> pii;
typedef priority_queue<pii, vector<pii>, greater<pii>> minpq;
typedef priority_queue<pii> maxpq;
#define mod 1000000007
//===================================DEBUG TEMPLATE=================================================
void __print(int x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x)
{
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T>
void __print(const T &x)
{
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v)
{
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
//====================================DEBUG TEMPLATE==============================================
int k, n, m;
vi a, l, r;
bool check(int x) {
int ls = 0, rs = 0;
re(i, k) {
l[i] = max(0ll, (m * a[i] - x + n - 1) / n);
ls += l[i];
}
re(i, k) {
r[i] = (m * a[i] + x) / n;
rs += r[i];
}
return ((ls <= m) && (m <= rs));
}
vector<int> mak(int x) {
vi b(k);
int bs = 0;
re(i, k) {
b[i] = max(0ll, (m * a[i] - x + n - 1) / n);
bs += b[i];
}
re(i, k) {
r[i] = (m * a[i] + x) / n;
}
re(i, k) {
int x = min(m - bs, r[i] - b[i]);
b[i] += x;
bs += x;
}
return b;
}
void solve() {
cin >> k >> n >> m;
a.resize(k);
l.resize(k);
r.resize(k);
re(i, k) {
cin >> a[i];
}
int l = 0, r = n * m;
while (l + 1 < r) {
int x = (l + r) / 2;
if (check(x))
r = x;
else
l = x;
}
vi ans = mak(r);
re(i, k) {
cout << ans[i] << " ";
}
}
int32_t main()
{
FIO;
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin) ;
freopen("output.txt", "w", stdout) ;
#endif
int t = 1;
while (t--) {
solve();
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
bool check(ll K) {
string S=to_string(K);
for(auto x:S) {
if(x=='7') {
return false;
}
}
return true;
}
ll hachi(ll k) {
ll t=1;
ll s=0;
while(k>=8) {
s+=(k%8)*t;
k/=8;
t*=10;
}
s+=t*k;
return s;
}
int main() {
ll N;
cin>>N;
ll ans=0;
for(ll i=1;i<=N;i++) {
ll p=hachi(i);
if(check(i)&&check(p)) {
ans++;
}
}
cout<<ans<<endl;
}
| #include <bits/stdc++.h>
using namespace std;
bool check(int i){
for(int j = i; j > 0; j /= 10){
if(j % 10 == 7){
// cout << j << endl;
return true;
}
}
for(int k = i; k > 0; k /= 8){
if(k % 8 == 7){
// cout << k << endl;
return true;
}
}
return false;
}
int main(){
int N, ans = 0; cin >> N;
for(int i = 1; i <= N; i++){
if(check(i) == true){
ans += 1;
}
}
cout << N - ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<char> vc;
typedef pair<int, int> pii;
typedef map<int, int> dictii;
typedef map<string, int> dictsi;
typedef map<string, string> dictss;
typedef pair<string, string> pss;
typedef set<int> si;
typedef set<string> ss;
typedef set<char> sc;
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define FOR(a,b,c) for(int a=b;a<c;a++)
#define sut(a,b) (b*(b+1)/2 - a*(a+1)/2)
#define len(a) a.size()
#define FORD(a) for(const auto &[key, value] : a)
#define reverse(a) reverse(a.begin(), a.end())
#define nodup(v) v.erase(unique(v.begin(), v.end()), v.end())
#define string(d) to_string(d)
#define MAX_SIZE 1000005
const int mod = 1000000007;
const int max_n = 200005;
//Notes:
//
void solve(){
}
int main(){
ios::sync_with_stdio(0);
cin.tie(NULL);
string s;
int count=0;
cin >> s;
FOR(i,0,len(s)-3)
{
if(s[i]=='Z' && s[i+1]=='O' && s[i+2]=='N' && s[i+3]=='e')
{
count++;
}
}
cout << count;
return 0;
} | #include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
#include <vector>
using namespace std;
int main()
{
string s;
string search = "ZONe";
cin >> s;
int count = 0;
for (int i = 0; i < 9; i++)
{
//cout << s.substr(i, 4) << endl;
if (s.substr(i, 4) == search)
count++;
}
cout << count << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int nax=4e5+10,mod=1e9+7;
char s[nax];
int f[nax],c[nax],n;
int get(int m,int k)
{
if(c[m]>c[k]+c[m-k])
return 0;
return f[m]*f[k]*f[m-k]%3;
}
int32_t main()
{
int tt=1;
//cin>>tt;
while(tt--)
{
cin>>n;
scanf("%s",s+1);
memset(f,0,sizeof(f));
memset(c,0,sizeof(c));
f[0]=1;
c[0]=0;
for(int i=1;i<=n;i++)
{
int x=i;
while(x%3==0){
c[i]++;
x/=3;
}
f[i]=f[i-1]*x%3;
c[i]+=c[i-1];
}
int res=0;
for(int i=1;i<=n;i++)
{
int cur;
if(s[i]=='B')
cur=0;
else if(s[i]=='W')
cur=1;
else if(s[i]=='R')
cur=2;
int pos=get(n-1,i-1);
res=(res+pos*cur)%3;
}
if(n%2==0)
res=(-res+3)%3;
if(res==0)
cout<<'B';
else if(res==1)
cout<<'W';
else if(res==2)
cout<<'R';
}
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
const ll MOD = 3;
ll calc_pow(ll x, ll pow) {
if (pow == 0) return 1;
ll a = calc_pow(x, pow / 2);
a = a * a % MOD;
if (pow % 2 == 1) a *= x;
return a % MOD;
}
ll calc_div(ll a, ll b) {
return a * calc_pow(b, MOD - 2) % MOD;
}
vector<ll> fact;
void init_fact(int n) {
fact = vector<ll>(n);
fact[0] = 1;
for (int i = 1; i < n; i++) fact[i] = fact[i - 1] * i % MOD;
}
ll calc_comb(ll n, ll r) {
if (n < r)return 0;
return calc_div(fact[n], fact[r] * fact[n - r] % MOD);
}
int main() {
init_fact(10);
int n;
string s;
cin >> n >> s;
int ret = 0;
for (int i = 0; i < n; i++) {
int times = 1;
{
int a = n - 1, b = i;
while (a > 0) {
times *= calc_comb(a % 3, b % 3), times %= MOD;
a /= 3, b /= 3;
}
}
//cout << times << " ";
if (s[i] == 'W')ret += times * 1;
if (s[i] == 'R')ret += times * 2;
ret %= MOD;
}
if (ret == 0) cout << "B" << endl;
else if (ret % 2 == n % 2) cout << "W" << endl;
else cout << "R" << endl;
return 0;
}
|
/*
JAI JAGANNATH!
*/
//@Author : zanj0
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define ff first
#define ss second
#define pb push_back
#define MOD 1000000007
#define inf 1e18
#define ps(x,y) fixed<<setprecision(y)<<x
#define w(x) int x; cin>>x; while(x--)
#define endl "\n"
#define timetaken cerr<<"Time : "<<1000*(long double)clock()/(long double)CLOCKS_PER_SEC<<"ms\n"
void zanj0()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
const int MAX = 3e6 + 5;
int fac[MAX], finv[MAX];
int inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
int COM(int n, int k) {
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int add(int a, int b) {
return ((a % MOD) + (b % MOD)) % MOD;
}
int mul(int a, int b) {
return ((a % MOD) * (b % MOD)) % MOD;
}
int fastPow(int base, int p) {
int ret = 1;
while (p) {
if (p & 1) ret = mul(ret, base);
base = mul(base, base);
p >>= 1;
}
return ret;
}
int sub(int a, int b) {
return (((a % MOD) - (b % MOD)) + MOD) % MOD;
}
void solve() {
int n, m, k;
cin >> n >> m >> k;
COMinit();
if (n > m + k) {
cout << 0 << endl;
} else if (k >= n) {
cout << COM(n + m, n) << endl;
} else {
cout << sub(COM(n + m, n), COM(n + m, n - k - 1)) << endl;
}
}
int32_t main()
{
zanj0();
solve();
timetaken;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define deb(k) cerr << #k << ": " << k << "\n";
#define size(a) (int)a.size()
#define fastcin cin.tie(0)->sync_with_stdio(0);
#define st first
#define nd second
#define pb push_back
#define mk make_pair
#define int long long
typedef long double ldbl;
typedef double dbl;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef map<int, int> mii;
typedef vector<int> vint;
#define MAX 4000100
#define MAXLG 20
const int inf = 0x3f3f3f3f;
const ll mod = 1000000007;
const ll linf = 0x3f3f3f3f3f3f3f3f;
const int N = 300100;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll fat[MAX+100];
ll ifat[MAX+100];
ll power(ll x, ll y, ll p){
ll res = 1;
x = x % p;
while (y > 0){
if (y & 1) res = (res*x) % p;
y = y>>1;
x = (x*x) % p;
}
return res;
}
void init(){
fat[0] = 1;
for(ll i=1;i<=MAX;i++){
fat[i] = (fat[i-1]*i)%mod;
}
ifat[MAX] = power(fat[MAX], mod-2, mod);
for(ll i=MAX-1;i>=0;i--) ifat[i] = (ifat[i+1]*(i+1))%mod;
}
ll choose(int x, int y){
if(y < 0 || y > x || x < 0) return 0;
return fat[x]*(ifat[y]*ifat[x-y]%mod)%mod;
}
void solve(){
init();
int n, m, k;
cin>>n>>m>>k;
if(n > m + k){
cout<<"0\n";
return;
}
int ans = choose(n+m, n);
for(int i=k+1;i<=n;i++){
int j = i - k - 1;
int l = j;
int a = k, b = 0;
int aux = (choose(2*l + a - b, l) - choose(2*l + a - b, l - 1)) * choose(n+m-i-j, n-i) % mod;
ans -= aux;
ans %= mod;
}
ans = (ans + mod) % mod;
cout<<ans<<"\n";
// Have you read the problem again?
// Maybe you understood the wrong problem
}
int32_t main(){
fastcin;
int t_ = 1;
//cin>>t_;
while(t_--)
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/all>
// using namespace atcoder
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<long long>;
using vvl = vector<vector<long long>>;
using pii = pair<int, int>;
#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define repr(i, n, s) for (int i = (int)n; (int)s < i; i--)
#define len(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define debug(var) if(DEBUG) do{cout << #var << " : "; print(var);}while(0)
template<typename T> void print(T e){cout << e << '\n';}
template<typename T> void print(const vector<T>& v){string s=""; for(auto& e : v){s+=to_string(e)+' ';} s.pop_back(); cout << s << '\n';}
template<typename T> void print(const vector<vector<T>>& vv){cout << '\n'; for(auto& v : vv){print(v);}}
template<typename T> void print(const set<T>& v){string s=""; for(auto& e : v){s+=to_string(e)+' ';} s.pop_back(); cout << s << '\n';}
template<typename T> void print(const list<T>& v){string s=""; for(auto& e : v){s+=to_string(e)+' ';} s.pop_back(); cout << s << '\n';}
template<typename T> inline bool chmin(T &a, T b) {if(a>b) {a=b; return true;} return false;}
template<typename T> inline bool chmax(T &a, T b) {if(a<b) {a=b; return true;} return false;}
template<typename T> T mod(T a, T m) {return (a % m + m) % m;}
const int INF32 = INT_MAX / 2;
const long long INF64 = LONG_LONG_MAX / 2;
const long long MOD = 1000000007;
const double PI = acos(-1);
const bool DEBUG = false;
int main() {
int N;
cin >> N;
if (N == 1) {
print("Yes");
return 0;
}
vector<pair<int, int>> S, T;
int x1c=0, y1c=0, x2c = 0, y2c = 0;
rep(i, 0, N) {
double a, b;
cin >> a >> b;
S.push_back(make_pair(a * N, b * N));
x1c += a;
y1c += b;
}
rep(i, 0, N) {
double c, d;
cin >> c >> d;
T.push_back(make_pair(c * N, d * N));
x2c += c;
y2c += d;
}
// 重心を原点に移動
rep(i, 0, N) {
S[i] = make_pair(S[i].first - x1c, S[i].second - y1c);
T[i] = make_pair(T[i].first - x2c, T[i].second - y2c);
}
// Sの基準vectorを決める。(0, 0以外)
int ibase;
rep(i, 0, N) {
if (abs(S[i].first) + abs(S[i].second) >= 1) {
ibase = i;
break;
}
}
// Sの基準との距離、クロス積、内積のtupleを計算。並び替え。
vector<tuple<int, int, int>> S2;
rep(i, 0, N) {
if (i == ibase) continue;
int x, y, x0, y0, dist, cp, ip;
tie(x0, y0) = S[ibase];
tie(x, y) = S[i];
dist = (int)(pow(x - x0, 2) + pow(y - y0, 2));
cp = x0 * y - y0 * x;
ip = x0 * x + y0 * y;
S2.emplace_back(dist, cp, ip);
}
sort(all(S2));
// Tの各々の基準vectorについて
bool ans = false;
rep(i, 0, N) {
bool ok = true;
// 距離、クロス積、内積のtupleを計算
vector<tuple<int, int, int>> T2;
rep(j, 0, N) {
if (j == i) continue;
int x, y, x0, y0, dist, cp, ip;
tie(x0, y0) = T[i];
tie(x, y) = T[j];
dist = (int)(pow(x - x0, 2) + pow(y - y0, 2));
cp = x0 * y - y0 * x;
ip = x0 * x + y0 * y;
T2.emplace_back(dist, cp, ip);
}
sort(all(T2));
// set同士で比較。全部ほぼ一致ならTrue, break
int eps = 0.1;
rep(i, 0, N - 1) {
int dist1, cp1, ip1, dist2, cp2, ip2;
tie(dist1, cp1, ip1) = S2[i];
tie(dist2, cp2, ip2) = T2[i];
if (abs(dist2 - dist1) > eps || abs(cp2 - cp1) > eps || abs(ip2 - ip1) > eps) {
ok = false;
break;
}
}
if (ok) {
ans = true;
break;
}
}
if (ans) {
print("Yes");
}
else {
print("No");
}
} | #include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#include <stack>
#include <algorithm>
#include <cmath>
typedef long long ll;
using namespace std;
ll Atoi(string s, ll radix, ll m)
{
ll ans = 0;
for (ll i = 0; i < s.size(); i++)
{
char t = s[i];
if (ans > m/radix)
return 0;
ans = ans * radix + t - '0';
}
return ans <= m;
}
int main()
{
string x;
ll m;
cin >> x >> m;
if (x.size() == 1) {
cout << Atoi(x, 10, m) << endl;
return 0;
}
ll d = *max_element(x.begin(), x.end()) - '0' + 1;
ll l = d, r = m;
ll ans = 0;
for (; l<=r; ) {
ll mid = (l + r) / 2;
if (Atoi(x, mid,m)) {
ans = mid;
l = mid + 1;
}
else {
r = mid - 1;
}
}
//cout << ans << " " << d << endl;
if (d > ans) {
cout << 0 << endl;
}
else {
cout << ans - d + 1 << endl;
}
} |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <climits>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <fstream>
using namespace std;
#define SZ(x) (int)(x).size()
#define REP(i,n) for(int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REPR(i,n) for(int i=(n)-1;i>=0;i--)
#define ALL(s) (s).begin(), (s).end()
#define so(V) sort(ALL(V))
#define rev(V) reverse(ALL(V))
#define uni(v) v.erase( unique(ALL(v)) , v.end());
typedef long long unsigned int llu;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vi> vvi;
const double EPS = 1e-9;
const int MOD = 1e9 + 7;
const int INF = (1 << 29);
const ll LINF = 1e18;
const double PI = acos(-1);
template<typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type
fill_v(T& t, const V& v) { t = v; }
template<typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type
fill_v(T& t, const V& v) {
for (auto& e : t) fill_v(e, v);
}
template<class T> bool chmax(T& a, const T& b) {
if (a < b) { a = b; return 1; }
return 0;
}
template<class T> bool chmin(T& a, const T& b) {
if (a > b) { a = b; return 1; }
return 0;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
cout << (N % 2 == 0 ? "White" : "Black") << endl;
return 0;
} | #include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <array>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#define ll long long
using namespace std;
int main()
{
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
ll n;
string ans;
cin >> n;
ans = n%2 == 0? "White" : "Black";
cout << ans;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v)
#define ALL(x) (x).begin(), (x).end()
#define PR(x) cout << (x) << endl
#define PS(x) cout << (x) << " "
#define SZ(x) ((ll)(x).size())
#define MAX(a,b) (((a)>(b))?(a):(b))
#define MIN(a,b) (((a)<(b))?(a):(b))
#define REV(x) reverse(ALL((x)))
#define ASC(x) sort(ALL((x)))
#define DESC(x) ASC((x)); REV((x))
#define pb push_back
#define eb emplace_back
int main()
{
ll H, W, X, Y;
cin >> H >> W >> X >> Y;
--X; --Y;
vector<string> S(H);
REP(i,0,H) cin >> S[i];
ll cnt = 1;
for(ll i=Y+1; i<W; ++i) {
if(S[X][i] == '.') ++cnt;
else break;
}
for(ll i=Y-1; i>=0; --i) {
if(S[X][i] == '.') ++cnt;
else break;
}
for(ll i=X+1; i<H; ++i) {
if(S[i][Y] == '.') ++cnt;
else break;
}
for(ll i=X-1; i>=0; --i) {
if(S[i][Y] == '.') ++cnt;
else break;
}
PR(cnt);
return 0;
}
/*
*/ | #include <bits/stdc++.h>
using namespace std;
int main() {
int H,W,X,Y;
cin >>H>>W>>X>>Y;
vector<vector<char>> s(H, vector<char>(W));
for (int i = 0; i < H; i++) {
// i番目の状態を読む
for (int j = 0; j < W; j++) {
cin >> s.at(i).at(j);
}
}
int count_t = 0;
int count_y =0;
//縦で考える
for(int i=0;i<H;i++){
if(s.at(i).at(Y-1)=='#'&&X-1>i)
count_t=0;
else if(s.at(i).at(Y-1)=='#'&&X-1<=i)
break;
else if(s.at(i).at(Y-1)=='.')
count_t++;
}
//横で考える
for(int j=0;j<W;j++){
if(s.at(X-1).at(j)=='#'&&Y-1>j)
count_y=0;
else if(s.at(X-1).at(j)=='#'&&Y-1<=j)
break;
else if(s.at(X-1).at(j)=='.')
count_y++;
}
cout<<count_t+count_y-1<<endl;
}
|
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a,x) for (auto& a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define ins insert
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1000000007;
const char nl = '\n';
const int MX = 100001; //check the limits, dummy
set<ll> solve(vl A) {
int N = sz(A);
set<ll> res;
F0R(m, 1 << N) {
ll cur = 0;
F0R(i, N) {
if (m & (1 << i)) {
cur += A[i];
}
}
res.ins(cur);
}
return res;
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int N; cin >> N; ll T; cin >> T;
ll A[N]; F0R(i, N) cin >> A[i];
int bp = N / 2;
vl B, C;
F0R(i, N / 2) B.pb(A[i]);
FOR(i, N / 2, N) C.pb(A[i]);
set<ll> X = solve(B), Y = solve(C);
ll ans = T;
trav(a, X) {
auto it = Y.ub(T - a);
if (it == Y.begin()) break;
it--;
ckmin(ans, T - a - *it);
}
cout << T - ans << nl;
return 0;
}
// read the question correctly (ll vs int)
// template by bqi343
| /*
* @Author: BilyHurington
* @Date: 2021-06-28 08:39:58
* @LastEditors: BilyHurington
* @LastEditTime: 2021-06-28 08:47:18
*/
#include<bits/stdc++.h>
#ifdef LOCAL_TEST
#include<ctime>
#endif
using namespace std;
int n,w[110],f[110][5010],Fac[110];
const int mod=998244353;
void Add(int &x,int y){x+=y;x-=x>=mod?mod:0;}
int main(){
#ifdef LOCAL_TEST
clock_t start=clock();
#endif
scanf("%d",&n);int sum=0;Fac[0]=1;
for(int i=1;i<=n;i++) Fac[i]=1ll*Fac[i-1]*i%mod;
for(int i=1;i<=n;i++) scanf("%d",&w[i]),sum+=w[i];
if(sum&1){puts("0");return 0;}
sum/=2;f[0][0]=1;
for(int i=1;i<=n;i++){
for(int j=sum;j>=w[i];j--){
for(int k=1;k<=n;k++){
Add(f[k][j],f[k-1][j-w[i]]);
}
}
}
int ans=0;
for(int i=1;i<=n;i++) Add(ans,1ll*Fac[i]*Fac[n-i]%mod*f[i][sum]%mod);
printf("%d",ans);
#ifdef LOCAL_TEST
clock_t end=clock();cout<<endl;
cout<<"The program costs "<<(double)(end-start)/CLOCKS_PER_SEC<<" seconds"<< endl;
puts("");system("pause");
#endif
return 0;
} |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
int mod = 1000000007;
int dp[3030][10][50];
void init(){
rep(i, 3030) rep(j, 10) rep(k, 50) dp[i][j][k] = 0;
dp[0][0][0] = 1;
}
int main(void){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int N; cin >> N;
vector<int> A(N), B(N), C(N), D(N), E(N);
rep(i, N) cin >> A[i] >> B[i] >> C[i] >> D[i] >> E[i];
int ok = 0, ng = INF;
int m = (ok+ng)/2;
while(abs(ok-ng) > 1){
//cout << "m: " << m << endl;
init();
rep(i, N){
int val = 0;
if(A[i] >= m) val += (1 << 4);
if(B[i] >= m) val += (1 << 3);
if(C[i] >= m) val += (1 << 2);
if(D[i] >= m) val += (1 << 1);
if(E[i] >= m) val += (1 << 0);
//cout << i << ": " << val << endl;
for(int ninzuu = 0; ninzuu < 5; ninzuu++){
rep(now_state, (1 << 5)){
dp[i+1][ninzuu][now_state] = max(dp[i+1][ninzuu][now_state], dp[i][ninzuu][now_state]);
dp[i+1][ninzuu+1][now_state|val] = max(dp[i+1][ninzuu+1][now_state|val], dp[i][ninzuu][now_state]);
}
}
}
if(dp[N][3][(1 << 5)-1] == 1) ok = m;
else ng = m;
m = (ok+ng)/2;
}
cout << ok << endl;
return 0;
} | #define _USE_MATH_DEFIMES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
const int MOD = 1'000'000'007;
const int MOD2 = 998'244'353;
const int INF = 1'000'000'000; //1e9
const int NIL = -1;
const long long LINF = 1'000'000'000'000'000'000; // 1e18
const long double EPS = 1E-10;
template<class T, class S> inline bool chmax(T &a, const S &b){
if(a < b){
a = b; return true;
}
return false;
}
template<class T, class S> inline bool chmin(T &a, const S &b){
if(b < a){
a = b; return true;
}
return false;
}
bool okay(int x, std::vector<std::vector<int>> &M){
std::set<int> s;
for(auto &e: M){
int bit{};
for(auto m: e){
bit *= 2;
bit |= (m >= x);
}
s.insert(bit);
}
for(int a: s) for(int b: s) for(int c: s){
if((a | b | c) == 31) return true;
}
return false;
}
int main(){
int N; std::cin >> N;
std::vector<std::vector<int>> mem(N, std::vector<int>(5));
for(auto &e: mem){
for(auto &m: e) std::cin >> m;
}
int ok{}, ng{INF + 1};
while(ng > ok + 1){
int mid{(ok + ng) / 2};
if(okay(mid, mem)) ok = mid;
else ng = mid;
}
std::cout << ok << std::endl;
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
long long a = 0, b = 0, c = 0, d = 0, e = 0, f = 0, m = 0, n = 0, p = 0, q = 0, mod = 1000000007, pi = 3.1415926535;
string s1, s2;
char moji;
cin >> a >> b >> c;
cout << 21-a-b-c << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <functional>
using namespace std;
int main(int argc, char *argv[]){
int a;
int b;
int c;
std::cin >> a >> b >> c;
int result = 0;
result += (7 - a);
result += (7 - b);
result += (7 - c);
std::cout << result << std::endl;
return 0;
} |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (ll)(x).size()
#define v(T) vector<T>
#define vv(T) vector<vector<T>>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
ll gcd(ll a,ll b){if(a%b==0){return b;}else{return(gcd(b,a%b));}}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
const int INF=1e9;
const ll MX = 1e18;
const ll mod=998244353;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
const double PI=acos(-1);
const string tr="abcdefghijklmnopqrstuvwxyz";
#define dame { puts("-1"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
#define YN {puts("YES");}else{puts("NO");}
const ll MAX = 1000001;
long long fac[MAX], finv[MAX], inv[MAX];
ll llpow(ll n,ll i){if(i==0){return 1;}ll cnt=n;for(ll j=0;j<i-1;j++){n*=cnt;}return n;}
bool ip/*is_prime*/(long long N) {if (N == 1) return false;for (long long i = 2; i * i <= N; ++i) {if (N % i == 0) return false;}return true;}
int digit(ll N) {int ans = 0;while (N) {++ans;N /= 10;}return ans;}
vector<pair<ll,ll>> pf/*prime_factorize*/(ll n){vector<pair<ll,ll>> res;for(ll a=2;a*a<=n;a++){if(n%a!=0) continue;ll ex=0;while(n%a==0){ex++;n/=a;}res.pb({a,ex});}if(n!=1) res.pb({n,1});return res;}
vector<ll> div/*divisor*/(ll n){ vector<ll> res={1};for(ll a=2;a*a<=n;a++){if(n%a!=0) continue;ll b=n/a;res.pb(b);if(b!=a) res.pb(a);}sort(all(res));return res;}
struct mint {
ll x; // typedef long long ll;
mint(ll x=0):x((x%mod+mod)%mod){}
mint operator-() const { return mint(-x);}
mint& operator+=(const mint a) {
if ((x += a.x) >= mod) x -= mod;
return *this;
}
mint& operator-=(const mint a) {
if ((x += mod-a.x) >= mod) x -= mod;
return *this;
}
mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
mint operator+(const mint a) const { return mint(*this) += a;}
mint operator-(const mint a) const { return mint(*this) -= a;}
mint operator*(const mint a) const { return mint(*this) *= a;}
mint pow(ll t) const {
if (!t) return 1;
mint a = pow(t>>1);
a *= a;
if (t&1) a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod-2);}
mint& operator/=(const mint a) { return *this *= a.inv();}
mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
struct combination {
vector<mint> fact, ifact;
combination(int n):fact(n+1),ifact(n+1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n) return 0;
return fact[n]*ifact[k]*ifact[n-k];
}
} c(200005);
struct UnionFind {
vector<int> d;
UnionFind(int n): d(n,-1) {}
int root(int x) {
if (d[x] < 0) return x;
return d[x] = root(d[x]);
}
bool unite(int x, int y) {
x = root(x); y = root(y);
if (x == y) return false;
if (d[x] > d[y]) swap(x,y);
d[x] += d[y];
d[y] = x;
return true;
}
bool same(int x, int y) { return root(x) == root(y);}
int size(int x) { return -d[root(x)];}
};
mint f2(int n) {if (n == 0) return 1;mint x = f2(n/2);x *= x;if (n%2 == 1) x *= 2;return x;}
mint choose(int n,int a){mint x=1,y=1;rep(i,a){x*=n-i;y*=i+1;}return x/y;}
int main(){
mint ans=1;
ll a,b,c;
cin>>a>>b>>c;
ans*=a*(a+1)/2;
ans*=b*(b+1)/2;
ans*=c*(c+1)/2;
cout<<ans<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
string s;
cin>>s;
int q;
cin>>q;
int cnt=0;
while(q--)
{
int t,a,b;
cin>>t>>a>>b;
if(t==2)
{
cnt++;
}
else
{
if(cnt%2==1)
{
if(a<=n)
{
a=a+n;
}
else
{
a=a-n;
}
if(b<=n)
{
b=b+n;
}
else
{
b=b-n;
}
}
swap(s[a-1],s[b-1]);
}
}
if(cnt%2)
{
for(int i=n;i<2*n;i++)
{
cout<<s[i];
}
for(int i=0;i<n;i++)
{
cout<<s[i];
}
}
else
{
cout<<s;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
long long int N;
cin >> N;
vector<vector<long long int>> vec(N,vector<long long int>(2));
for(int i=0;i<N;i++) cin >> vec[i][0] >> vec[i][1];
long long int M;
cin >> M;
vector<vector<vector<long long int>>> OP(M+1,vector<vector<long long int>>(2,vector<long long int>(3,0)));
OP[0][0][0] = 1;
OP[0][1][1] = 1;
for(int i=0;i<M;i++){
int op;
cin >> op;
if(op == 1){
OP[i+1][0][0] = OP[i][1][0];
OP[i+1][0][1] = OP[i][1][1];
OP[i+1][0][2] = OP[i][1][2];
OP[i+1][1][0] = -OP[i][0][0];
OP[i+1][1][1] = -OP[i][0][1];
OP[i+1][1][2] = -OP[i][0][2];
}
if(op == 2){
OP[i+1][0][0] = -OP[i][1][0];
OP[i+1][0][1] = -OP[i][1][1];
OP[i+1][0][2] = -OP[i][1][2];
OP[i+1][1][0] = OP[i][0][0];
OP[i+1][1][1] = OP[i][0][1];
OP[i+1][1][2] = OP[i][0][2];
}
if(op == 3){
long long int p;
cin >> p;
OP[i+1][0][0] = -OP[i][0][0];
OP[i+1][0][1] = -OP[i][0][1];
OP[i+1][0][2] = 2*p-OP[i][0][2];
OP[i+1][1][0] = OP[i][1][0];
OP[i+1][1][1] = OP[i][1][1];
OP[i+1][1][2] = OP[i][1][2];
}
if(op == 4){
long long int p;
cin >> p;
OP[i+1][0][0] = OP[i][0][0];
OP[i+1][0][1] = OP[i][0][1];
OP[i+1][0][2] = OP[i][0][2];
OP[i+1][1][0] = -OP[i][1][0];
OP[i+1][1][1] = -OP[i][1][1];
OP[i+1][1][2] = 2*p-OP[i][1][2];
}
}
long long int Q;
cin >> Q;
for(int i=0;i<Q;i++){
int A,B;
cin >> A >> B;
long long int x=vec[B-1][0],y=vec[B-1][1];
long long int X=0,Y=0;
X += OP[A][0][0]*x+OP[A][0][1]*y+OP[A][0][2];
Y += OP[A][1][0]*x+OP[A][1][1]*y+OP[A][1][2];
cout << X << " " << Y << endl;
}
} | #include "bits/stdc++.h"
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,mmx,avx,avx2")
using namespace std;
using ll = long long;
void A()
{
string s; cin >> s;
if (s[0] == s[1] && s[1] == s[2]) cout << "Won\n";
else cout << "Lost\n";
}
void B()
{
int n, limit; cin >> n >> limit;
limit *= 100;
for (int i = 1; i <= n; ++i) {
int vol, percent; cin >> vol >> percent;
limit -= vol*percent;
if (limit < 0) {cout << i; return;}
}
cout << -1;
}
void C()
{
int n; cin >> n;
int a[n];
ll ans = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
int mn = a[i];
for (int j = i; j >= 0; --j) {
if (a[j] < mn) mn = a[j];
ans = max(ans, 1LL*mn*(i-j+1));
}
}
cout << ans;
}
void D()
{
int n; cin >> n;
vector<string> v(n);
vector<array<ll, 2>> dp(n+1);
dp[0][0] = dp[0][1] = 1;
for (int i = 1; i <= n; ++i) {
cin >> v[i-1];
if (v[i-1] == "OR") {
dp[i][1] = dp[i-1][0] + 2*dp[i-1][1];
dp[i][0] = dp[i-1][0];
}
else {
dp[i][1] = dp[i-1][1];
dp[i][0] = dp[i-1][1] + 2*dp[i-1][0];
}
}
cout << dp[n][1];
}
void E()
{
int n; cin >> n;
vector<array<ll, 2>> pts(n);
for (auto &[x, y] : pts)
cin >> x >> y;
int m; cin >> m;
using row = array<ll, 3>;
using matrix = array<row, 3>;
vector<matrix> mat(m+1);
mat[0][0][0] = mat[0][1][1] = mat[0][2][2] = 1;
auto matmul = [&] (auto &a, auto &b) {
array<array<ll, 3>, 3> res = array<array<ll, 3>, 3>();
for (int i = 0; i < 3; ++i)
for (int j = 0; j < 3; ++j)
for (int k = 0; k < 3; ++k)
res[i][j] += a[i][k] * b[k][j];
return res;
};
for (int i = 1; i <= m; ++i) {
int type; cin >> type;
if (type == 1) {
mat[i] = matrix{row{0, 1, 0}, row{-1, 0, 0}, row{0, 0, 1}};
}
else if (type == 2) {
mat[i] = matrix{row{0, -1, 0}, row{1, 0, 0}, row{0, 0, 1}};
}
else {
int p; cin >> p;
if (type == 3) {
mat[i] = matrix{row{-1, 0, 2*p}, row{0, 1, 0}, row{0, 0, 1}};
}
else {
mat[i] = matrix{row{1, 0, 0}, row{0, -1, 2*p}, row{0, 0, 1}};
}
}
mat[i] = matmul(mat[i], mat[i-1]);
}
int q; cin >> q;
while (q--) {
int a, b; cin >> a >> b;
auto [x, y] = pts[b-1];
auto transform = mat[a];
cout << x*transform[0][0] + y*transform[0][1] + transform[0][2] << ' ' << x*transform[1][0] + y*transform[1][1] + transform[1][2] << '\n';
}
}
int main()
{
ios::sync_with_stdio(0); cin.tie(0);
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
E();
} |
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <climits>
#include <string>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <ctime>
#include <cassert>
#include <fstream>
#include <stack>
#include <random>
#include <iomanip>
#include <fstream>
using namespace std;
typedef long long 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;
}
typedef pair<ll,ll> l_l;
ll inf=(ll)1E18;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a,ll b){if(a<b)return b;else return a;}
ll min(ll a,ll b){if(a>b)return b;else return a;}
dd EPS=1E-9;
#define endl "\n"
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int main(){fastio
ll n;cin>>n;
dd dp[n+1];
dp[n]=0.0;
for(ll i=n-1;i>=1;i--){
dp[i]=(dd)n/(n-i)+dp[i+1];
}
cout<<setprecision(20)<<dp[1]<<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
double a = 0.0;
for (int i = 1; i < N; i++) {
a += (1.0 / (double)i);
}
double ans = a * (double)N;
cout << fixed << setprecision(10) << ans << endl;
} |
/*
#pragma GCC optimize("Ofast")
#pragma GCC target("avx", "avx2", "fma")
#pragma GCC optimization("unroll-loops")
*/
#include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define IOS ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
#define fi first
#define se second
#define pf push_front
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define debug(x) cerr<<#x<<": "<<(x)<<'\n'
#define lb lower_bound
#define ub upper_bound
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
const ll mod = 1e9+7;
const ll inf = 0x3f3f3f3f;
const ll llinf = 1e18;
const ll nax = 0;
int main(){
IOS
int n; cin >> n;
vector<pair<int, int>>arr(n+5);
for(int i=0;i<n;++i){
cin >> arr[i].fi >> arr[i].se;
}
for(int i=0;i<n;++i){
for(int j=0;j<n;++j){
for(int k=0;k<n;++k){
if(i==j || i==k || j==k) continue;
int x1=arr[i].fi, x2=arr[j].fi, x3=arr[k].fi, y1=arr[i].se, y2=arr[j].se, y3=arr[k].se;
ll satu=(x3-x1)*(y2-y1);
ll dua=(y3-y1)*(x2-x1);
if(satu==dua){
cout << "Yes" << '\n';
return 0;
}
}
}
}
cout << "No" << '\n';
} | #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>;
using Graph = vector<vector<int>>;
template<class T> void chmax(T& a, T b){
if(a < b){
a = b;
}
}
template<class T> void chmin(T& a, T b){
if(a > b){
a = b;
}
}
int main()
{
int n;
cin >> n;
vector<double>x(n);
vector<double>y(n);
rep(i,n)cin >> x[i] >> y[i];
rep(i,n){
rep(j,n){
rep(k,n){
if(i == j)continue;
if(j == k)continue;
if(i == k)continue;
double a1 = (y[i] - y[j])/(x[i] - x[j]);
double a2 = (y[j] - y[k])/(x[j] - x[k]);
if(a1 == a2){
cout << "Yes" << endl;
return 0;
}
}
}
}
cout << "No" << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s, t;
cin >> n >> s >> t;
vector<int> s0, t0;
for (int i = 0; i < n; i++) {
if (s[i] == '0') {
s0.push_back(i);
}
if (t[i] == '0') {
t0.push_back(i);
}
}
if (s0.size() != t0.size()) {
cout << -1 << endl;
return 0;
}
int ans = 0;
for (int i = 0; i < s0.size(); i++) {
if (s0[i] != t0[i]) {
ans++;
}
}
cout << ans << endl;
} | #include<bits/stdc++.h>
using namespace std;
#define endl "\n"
#define mp make_pair
#define ll long long
int gcd(int a,int b){
if(b==0)
return a;
int hcf=gcd(b,a%b);
return hcf;
}
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
/* // for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
*/
int a,b,c;
cin>>a>>b>>c;
if(a==b)
cout<<c<<endl;
else if(a==c)
cout<<b<<endl;
else if(b==c)
cout<<a<<endl;
else
cout<<0<<endl;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.