code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
101M
|
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
#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*LCM_Y)/__gcd(LCM_X,LCM_Y);
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};
ll arr[MAX],freq[MAX],pos[MAX],n;
int lg[MAX], rmq[20][MAX];
void Sparse_Table_Pre_Process(int n)
{
for(int i=0; i<n; i++)
rmq[0][i]=arr[i];
for(int i = 2; i <= n; i++)
lg[i] = lg[i / 2] + 1;
for(int i = 1; i <= lg[n]; i++)
for(int j = 0; j < n - (1 << i) + 1; j++)
rmq[i][j] = max(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);
}
int RMQ(int x,int y)
{
return max(rmq[lg[y - x + 1]][x], rmq[lg[y - x + 1]][y - (1 << lg[y - x + 1]) + 1]);
}
int find_greater_L(int l,int r,int i)
{
int f=0;
while(l<=r)
{
int mid=(l+r)>>1;
int cur=RMQ(mid,i-1);
if(cur>arr[i])
{
f=cur;
l=mid+1;
}
else
r=mid-1;
}
return f;
}
int find_greater_R(int l,int r,int i)
{
int f=0;
while(l<=r)
{
int mid=(l+r)>>1;
int cur=RMQ(i+1,mid);
if(cur>arr[i])
{
f=cur;
r=mid-1;
}
else
{
l=mid+1;
}
}
return f;
}
ll l_side(int i)
{
int a=find_greater_L(0,i-1,i);
if(a)
{
int x=1,y=0,z=pos[a];
int l=0,r=pos[a]-1;
while(l<=r){
int mid=(l+r)>>1;
int cur=RMQ(mid,pos[a]-1);
if(cur>arr[i]){
l=mid+1;
}
else{
z=mid;
r=mid-1;
}
}
x+=pos[a]-z;
int b=find_greater_R(i+1,n-1,i);
if(b)
{
y=pos[b]-i-1;
}
else
y=(n-1)-i;
int ans=x+x*y;
return ans;
}
return 0;
}
ll r_side(int i)
{
int a=find_greater_R(i+1,n-1,i);
if(a)
{
int x=1,y=0,z=pos[a];
int l=pos[a]+1,r=n-1;
while(l<=r)
{
int mid=(l+r)>>1;
int cur=RMQ(pos[a]+1,mid);
if(cur>arr[i])
{
r=mid-1;
}
else
{
z=mid;
l=mid+1;
}
}
x+=z-pos[a];
int b=find_greater_L(0,i-1,i);
if(b)
y=i-pos[b]-1;
else
y=i;
int ans=x+x*y;
return ans;
}
return 0;
}
int main()
{
FastRead
ll sum=0;
cin>>n;
for(int i=0; i<n; i++)
{
cin>>arr[i];
pos[arr[i]]=i;
}
Sparse_Table_Pre_Process(n);
for(int i=0; i<n; i++)
{
freq[arr[i]]+=l_side(i);
freq[arr[i]]+=r_side(i);
}
for(ll i=1; i<=n; i++)
{
sum+=(freq[i]*i);
}
cout<<sum<<endl;
return 0;
}
|
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <utility>
#include <cmath>
#include <tuple>
#include <queue>
#include <bitset>
#include <set>
#include <map>
#include <list>
using ll = long long;
using ld = long double;
using namespace std;
const int INF = 1e9+100;
const ll INF64 = 7e18l;
const int mod = 1000000007;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define ALL(a) (a).begin(), (a).end()
#define FIN ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int main(){
FIN;
ll s; cin >> s;
vector<bool> a(1000000,false);
a[s] = true;
ll count = 1;
while(1){
if(s%2 == 0) s = s/2;
else s = 3*s + 1;
count++;
if(a[s] == true) break;
a[s] = true;
}
cout << count << endl;
return 0;
}
| 0
| 50,749,100
|
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(_) cerr << #_ << ": " << (_) << '\n'
#define _GLIBCXX_DEBUG
#else
#define debug(_) 0
#endif
vector<long long> as(1, 1);
vector<long long> ps(1, 1);
long long solve(long long level, long long x){
if (level == 0) {
return x;
} else if (x >= as[level]) {
return ps[level];
} else {
if (x <= 1) {
return 0;
} else if (x <= as[level - 1] + 1) {
return solve(level - 1, x - 1);
} else if (x == as[level - 1] + 2) {
return solve(level - 1, as[level - 1]) + 1;
} else {
return solve(level - 1, as[level - 1]) + 1 + solve(level - 1, x - as[level - 1] - 2);
}
}
}
int main(){
long long N, X;
for (int i = 0; i < 50; i++) {
as.push_back(as[i] * 2 + 3);
ps.push_back(ps[i] * 2 + 1);
}
cin >> N >> X;
cout << solve(N, X) << '\n';
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i, n) for (int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
#define ll long long int
int main(){
int n;
cin>>n;
vector<int> v(n+2);
v[0]=0;
rep(i, n) cin>>v[i+1];
v[n+1]=0;
vector<int> diff(n+1);
rep(i, n+1){
diff[i]=abs(v[i+1]-v[i]);
}
ll sum=accumulate(diff.begin(), diff.end(), 0LL);
for(int i=1;i<=n;i++){
ll ans=sum-diff[i-1]-diff[i]+(ll)abs(v[i+1]-v[i-1]);
cout<<ans<<endl;
}
return 0;
}
| 0
| 58,598,886
|
#include <bits/stdc++.h>
#define MAX 200005
using namespace std;
using ll = long long;
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
int mn = MAX, ans = 0;
for (int i = 0; i < n; ++i) {
int p;
cin >> p;
if (mn > p) {
mn = p;
++ans;
}
}
cout << ans << '\n';
return (0);
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x) (x).begin(),(x).end()
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
using Graph = vector<vector<ll>>;
double nCk(int n, int k) {
double res=1.0;
for(int i=0; i<n; i++){
res*=0.5;}
for(int i=0; i<k; i++){
res*=(double)(n-i);
res/=(double)(k-i);
}
return res;}
struct edge{ll to, cost;};
typedef pair<ll,ll> P;
struct graph{
ll V;
vector<vector<edge> > G;
vector<ll> d;
graph(ll n){
init(n);
}
void init(ll n){
V = n;
G.resize(V);
d.resize(V);
rep(i,V){
d[i] = INF;
}
}
void add_edge(ll s, ll t, ll cost){
edge e;
e.to = t, e.cost = cost;
G[s].push_back(e);
}
void dijkstra(ll s){
rep(i,V){
d[i] = INF;
}
d[s] = 0;
priority_queue<P,vector<P>, greater<P> > que;
que.push(P(0,s));
while(!que.empty()){
P p = que.top(); que.pop();
ll v = p.second;
if(d[v]<p.first) continue;
for(auto e : G[v]){
if(d[e.to]>d[v]+e.cost){
d[e.to] = d[v]+e.cost;
que.push(P(d[e.to],e.to));
}
}
}
}
};
class UnionFind
{
public:
ll par[100005];
ll depth[100005];
ll nGroup[100005];
UnionFind(ll n) {
init(n);
}
void init(ll n) {
for(ll i=0; i<n; i++) {
par[i] = i;
depth[i] = 0;
nGroup[i] = 1;
}
}
ll root(ll x) {
if(par[x] == x) {
return x;
} else {
return par[x] = root(par[x]);
}
}
bool same(ll x, ll y) {
return root(x) == root(y);
}
void unite(ll x, ll y) {
x = root(x);
y = root(y);
if(x == y) return;
if(depth[x] < depth[y]) {
par[x] = y;
nGroup[y] += nGroup[x];
nGroup[x] = 0;
} else {
par[y] = x;
nGroup[x] += nGroup[y];
nGroup[y] = 0;
if(depth[x] == depth[y])
depth[x]++;
}
}
};
const ll MAX = 510000;
ll fac[MAX], finv[MAX], 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;
}
}
ll COM(ll n, ll k){
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
vector<ll> depth;
vector<ll> subtree_size;
void dfs(const Graph &G, ll v, ll p, ll d) {
depth[v] = d;
for (auto nv : G[v]) {
if (nv == p) continue;
dfs(G, nv, v, d+1);
}
subtree_size[v] = INF;
vl q;
for (auto c : G[v]) {
if (c == p) continue;
q.pb(subtree_size[c]);
}
ll qq = q.size();
if(qq==0) subtree_size[v]=0;
else{
sort(all(q));
ll caa = 0;
rep(i,qq){
caa = max(qq+q[i]-i,caa);}
subtree_size[v]=caa;
}
}
ll dp[100005][2];
int main() {
ll n; cin>>n;
ll ans = 0;
ll ca = INF;
ll f = 0;
rep(i,n){
ll a,b; cin>>a>>b;
ans += a;
if(a>b){
f++;
ca = min(ca,b);}
}
if(f==0){
cout << 0 << endl;}
else
cout << ans - ca << endl;}
| 0
| 47,857,508
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, m; cin >> n >> m;
for (int i = 1, j = m + 1; i < j; i++, j--)
cout << i << ' ' << j << '\n';
for (int i = m + 2, j = m + m + 1; i < j; i++, j--)
cout << i << ' ' << j << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ", "; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ", "; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << ", " << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << ": " << v.second << ", "; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << ": " << v.second << ", "; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool chmin(T &m, const T q) { if (q < m) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define f first
#define s second
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int len;
cin >> len;
vector<vector<int>> arr(len, vector<int> (3));
for(int i = 0; i < len; i++) {
cin >> arr[i][0] >> arr[i][1] >> arr[i][2];
}
for(int i = 0; i < len - 1; i++) {
int ans = 0;
ans += arr[i][1] + arr[i][0];
for(int j = i + 1; j < len - 1; j++) {
if(ans <= arr[j][1])
ans = arr[j][1];
else {
while(ans % arr[j][2] != 0)
ans++;
}
ans += arr[j][0];
}
cout << ans << endl;
}
cout << 0;
}
| 0
| 93,997,241
|
#include <iostream>
#include <string>
#include <cstring>
#include <fstream>
#include <cmath>
#include <iomanip>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <deque>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <list>
#include <unordered_map>
#include <bitset>
#include <sstream>
typedef long long ll;
#define mop 1000000007
using namespace std;
int main() {
int n,k;
string s;
cin >> n >> s >> k;
char a = s[k-1];
for (int i=0;i<n;i++){
if(s[i] != a){
cout << "*";
}else{
cout << s[i];
}
}
cout << endl;
}
|
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define MOD 1000000007
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i--)
#define itr(it, x) for(auto it = x.begin(); it != x.end(); it++)
#define mem(a, b) memset(a, (ll)b, sizeof(a))
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define edge(v, x, y) v[x].pb(y); v[y].pb(x);
#define popc __builtin_popcount
#define ANS(s) {cout << s << "\n"; return;}
template <typename T> void unique(T& c){c.erase(std::unique(c.begin(), c.end()), c.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(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
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> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << "(" << itr->first << ", " << itr->second << ")"; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
const ll N = 1e5;
const ll M = 1e6;
const ll A = 1e7;
const ll inf = 1e9;
const long long linf = 1LL << 60;
const double er = 1e-10;
const double pi = 3.141592653589793238463;
const ll lx[4] = {0, 0, 1, -1};
const ll ly[4] = {1, -1, 0, 0};
const ll dx[8] = {0, 0, 1, -1, 1, -1, 1, -1};
const ll dy[8] = {1, -1, 0, 0, 1, 1, -1, -1};
struct fast_io{
fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;
void solve()
{
ll n, m;
cin >> n >> m;
char a[n][m];
rep(i, n) rep(j, m) cin >> a[i][j];
ll dp[n][m];
rep(i, n)
{
rep(j, m)
{
if(i+j == 0) dp[i][j] = a[i][j] == '#';
else{
dp[i][j] = inf;
if(i > 0) dp[i][j] = min(dp[i][j], dp[i-1][j] + (a[i][j] == '#' && a[i-1][j] == '.'));
if(j > 0) dp[i][j] = min(dp[i][j], dp[i][j-1] + (a[i][j] == '#' && a[i][j-1] == '.'));
}
}
}
cout << dp[n-1][m-1];
}
int main(int argc, char const* argv[])
{
ll t = 1;
while(t--) {
solve();
}
return 0;
}
| 0
| 95,872,804
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printVec(v) printf("{"); for (const auto& i : v) { std::cout << i << ", "; } printf("}\n");
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
using namespace std;
using P = pair<int,int>;
using ll = long long;
const ll INF = 1LL<<60;
const double PI = 3.1415926535897932;
const int MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
map<char, int> alp;
rep (i, n) {
string s;
cin >> s;
if (i == 0) {
for (auto v : s) alp[v]++;
} else {
map<char, int> counter;
for (auto v : s) counter[v]++;
for (auto v : alp) {
if (counter[v.first] == v.second || v.second == -1) continue;
if (counter[v.first] == 0) {
alp[v.first] = -1;
} else {
alp[v.first] = min(alp[v.first], counter[v.first]);
}
}
}
}
for (auto v : alp) {
if (v.second == -1) continue;
for (int i = 0; i < v.second; i++) cout << v.first;
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(long long int i = 0; i < n; i++)
#define _rep(i, m, n) for(long long int i = m; i < n; i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
using Graph = vector<vector<int>>;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
ll gcd(ll A, ll B){
if(B == 0)return A;
return gcd(B, A % B);
}
ll lcm(ll A, ll B){
return A * B / gcd(A, B);
}
int main(){
vector<long double> a(4);
rep(i, 4) cin >> a[i];
long double n; cin >> n;
vector<pair<long double, long double>> b(4);
b[0].first = 8 * a[0], b[0].second = 0.25;
b[1].first = 4 * a[1], b[1].second = 0.5;
b[2].first = 2 * a[2], b[2].second = 1.0;
b[3].first = a[3], b[3].second = 2.0;
sort(b.begin(), b.end());
long double sum = 0;
for(int i = 0; i < 4; i++){
sum += (ll)(n / b[i].second) * (b[i].first * b[i].second) / 2;
n -= (ll)(n / b[i].second) * b[i].second;
}
cout << setprecision(20) << sum << endl;
}
| 0
| 34,014,470
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
string s,t;
cin >> s >> t;
int ans=0;
rep(i,s.length()){
if(s[i]!=t[i])
ans ++;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = (1 << 28);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
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 * b / gcd(a, b);}
int n;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
vector<ll> d(n),c(n);
ll sum=0;
for (int i = 0; i < n; i++)
{
cin >> d[i]>>c[i];
sum+=c[i];
}
sum--;
ll sumt=0;
for(int i=0;i<n;i++){
sumt+=d[i]*c[i];
ll temp=sumt;
ll amari=sumt%10;
while(temp>=10){
sum+=temp/10;
temp/=10;
temp+=amari;
amari=temp%10;
}
sumt=amari;
}
cout << sum << "\n";
}
| 0
| 38,854,945
|
#include<bits/stdc++.h>
using namespace std;
using LL = long long;
int main() {
LL N;
string S;
cin >> N >> S;
LL R = count(begin(S), end(S), 'R');
LL ans = 0;
for(auto g=0; g<N; ++g) {
for(auto b=0; b<N; ++b) {
if(S[g] != 'G') continue;
if(S[b] != 'B') continue;
ans += R;
auto d = abs(g-b);
for(auto r: {(g+b)/2, min(g,b)-d, max(g,b)+d}) {
vector<LL> i = {r, g, b};
sort(begin(i), end(i));
if(S[r] != 'R') continue;
if(i[2]-i[1] != i[1]-i[0]) continue;
if(i[0]<0 || N-1<i[2]) continue;
--ans;
}
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
const ll MOD = 1000000007;
const ll INF = 1e18;
int ctoi(char c)
{
if (c >= '0' && c <= '9')
{
return c - '0';
}
return 0;
}
ll powll(ll a, ll n)
{
ll res = 1;
while (n > 0)
{
if (n & 1)
{
res = res * a;
}
a = a * a;
n >>= 1;
}
return res;
}
ll modpow(ll a, ll n, ll mod)
{
ll res = 1;
while (n > 0)
{
if (n & 1)
{
res = res * a % mod;
}
a = a * a % mod;
n >>= 1;
}
return res;
}
int ReturnDigit(ll num)
{
string number = to_string(num);
return number.length();
}
const ll MAX = 1e4;
long long fac[MAX], finv[MAX], 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;
}
}
long long 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 main()
{
ll i, j, l, ans = 0;
ll n, m, k;
cin >> n >> m >> k;
for (i = 0; i <= n; i++)
{
for (j = 0; j <= m; j++)
{
if (i * (m - j) + j * (n - i) == k)
{
cout << "Yes";
return 0;
}
}
}
cout << "No" << endl;
}
| 0
| 92,711,597
|
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define s second
#define FAST ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define SZ(a) (int)a.size()
#define Flush fflush(stdout);
typedef long long ll ;
using namespace std ;
int main()
{
string x;
cin >> x;
int ans = 0;
for (int i = 0; i < 3; i++)
{
if (x[i] != 'R')continue;
int j = i+1;
while(j < 3 && x[j] == 'R')j++;
ans = max(ans, j - i);
i = j-1;
}
cout << ans <<"\n";
}
|
#include <cstdio>
#include <algorithm>
using namespace std;
typedef pair<char,int> pci;
int N;
pci A[100], B[100], C[100];
void print(pci X[]) {
for (int i=0; i<N; i++) {
if (i > 0) putchar(' ');
printf("%c%d", X[i].first, X[i].second);
}
putchar('\n');
}
bool same(pci X[], pci Y[]) {
for (int i=0; i<N; i++) {
if (X[i].first != Y[i].first) return false;
}
return true;
}
void bubbleSort(pci X[]) {
for (int i=0; i<N; i++) {
bool loop = false;
for (int j=N-1; j>i; j--) {
if (X[j-1].second > X[j].second) {
swap(X[j-1], X[j]);
loop = true;
}
}
if (!loop) break;
}
}
void selectionSort(pci X[]) {
for (int i=0; i<N; i++) {
int minI = i;
for (int j=i+1; j<N; j++) {
if (X[j].second < X[minI].second) minI = j;
}
if (minI != i) swap(X[minI], X[i]);
}
}
int main() {
scanf("%d", &N);
for (int i=0; i<N; i++) {
getchar();
A[i].first = getchar();
A[i].second = getchar() - '0';
B[i] = C[i] = A[i];
}
bubbleSort(B); print(B);
puts("Stable");
selectionSort(C); print(C);
if (same(B, C)) puts("Stable");
else puts("Not stable");
return 0;
}
| 0
| 59,525,298
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,a,sum=0;
cin >> n;
for(int i=1;i<=n;i++){
sum+=i;
if(sum>=n) break;
}
a=sum-n;
for(int i=1;i<=n;i++){
sum-=i;
if(a==i) continue;
cout << i << endl;
if(sum==0) break;
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
map<int, int> e, o;
for (int i = 0; i < n; i += 2) {
if (e.count(v[i]) == 0) e[v[i]] = 0;
e[v[i]]++;
}
for (int i = 1; i < n; i += 2) {
if (o.count(v[i]) == 0) o[v[i]] = 0;
o[v[i]]++;
}
vector<P> fe, fo;
for (auto ele : e) fe.push_back({ele.second, ele.first});
for (auto ele : o) fo.push_back({ele.second, ele.first});
sort(fe.rbegin(), fe.rend());
sort(fo.rbegin(), fo.rend());
int ans = 0;
if (fe[0].second == fo[0].second) {
if (fe.size() == 1 && fo.size() == 1) {
ans = n / 2;
} else if (fe.size() == 1) {
ans = n / 2 - fo[0].first;
} else if (fo.size() == 1) {
ans = n / 2 - fe[0].first;
} else {
ans = n - max(fe[0].first + fo[1].first, fe[1].first + fo[0].first);
}
} else {
ans = n - fe[0].first - fo[0].first;
}
cout << ans << endl;
}
| 0
| 48,942,487
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
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; }
signed main(){
ll n,k; cin>>n>>k;
vl a(n);
rep(i,0,n) cin>>a[i];
rep(q,0,k){
vl b(n+1);
rep(i,0,n){
ll s=max((ll)0,(i-a[i]));
ll t=min(i+a[i]+1,n);
b[s]++; b[t]--;
}
rep(i,1,n+1) b[i]+=b[i-1];
b.pop_back();
if(a==b) break;
a=b;
}
rep(i,0,n) cout<<a[i]<<" ";
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;
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;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
typedef struct UnionFind_ {
vector<int> par;
vector<int> rank_;
UnionFind_(int n): rank_(n, 0) {
for(int i = 0; i < n; i++)par.push_back(i);
}
int find(int x) {
if(par[x] == x)return x;
else return par[x] = find(par[x]);
}
bool same(int x, int y) {
if(find(x) == find(y))return true;
else return false;
}
bool unite(int x, int y){
int xp = find(x);
int yp = find(y);
if(xp == yp)return false;
if(rank_[xp] > rank_[yp])par[yp] = xp;
else if(rank_[xp] < rank_[yp])par[xp] = yp;
else {
par[yp] = xp;
rank_[xp]++;
}
return true;
}
} UnionFind;
int main(int argc, char const* argv[])
{
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, q;
cin >> n >> q;
UnionFind uf(n);
rep(i, q){
int c, x, y;
cin >> c >> x >> y;
if(c == 0)uf.unite(x, y);
else {
if(uf.same(x, y))cout << 1 << endl;
else cout << 0 << endl;
}
}
return 0;
}
| 0
| 20,565,061
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int cnt[4]={0,0,0,0};
for(int i=0;i<3;i++){
int a,b; cin>>a >>b;
a--; b--;
cnt[a]++; cnt[b]++;
}
for(int i=0;i<4;i++){
if(cnt[i]>2){
cout<<"NO"<<endl;
return 0;
}
}
cout<<"YES"<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define forin(in, n) for(int i=0; i<n; i++) cin>>in[i]
#define forout(out, n) for(int i=0; i<n; i++) cout<<out[i]<<endl
#define rep(i, n) for(int i=0; i<(n); i++)
int main(){
int n, m; cin>>n>>m;
vector<int> h(n);
forin(h, n);
vector<bool> good(n, true);
rep(i, m){
int a, b;
cin>> a >> b;
a--;
b--;
if(h[a] <= h[b]) good[a] = false;
if(h[b] <= h[a]) good[b] =false;
}
int ans=0;
rep(i, n) if(good[i]) ans++;
cout<<ans<<endl;
}
| 0
| 83,432,753
|
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
/*
ifstream in("input.txt");
cin.rdbuf(in.rdbuf());
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
int xdif = abs(x1 - x2), ydif = abs(y1 - y2);
if(x1 >= x2 && y1 >= y2){
cout << x2 + ydif << " " << y2 - xdif << " " << x1 + ydif << " " << y1 - xdif <<endl;
} else if(x1 >= x2 && y1 <= y2){
cout << x2 - ydif << " " << y2 - xdif << " " << x1 - ydif << " " << y1 - xdif <<endl;
} else if(x1 <= x2 && y1 >= y2){
cout << x2 + ydif << " " << y2 + xdif << " " << x1 + ydif << " " << y1 + xdif <<endl;
} else if(x1 <= x2 && y1 <= y2 ){
cout << x2 - ydif << " " << y2 + xdif << " " << x1 - ydif << " " << y1 + xdif <<endl;
}
}
|
#include <iostream>
#include <string>
#include <cmath>
#include <set>
#include <utility>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <cstdio>
#include <cstring>
using namespace std;
constexpr long long mod = 1000000007;
constexpr double eps = 0.0000000001;
typedef long long ll;
typedef long long unsigned ull;
int main() {
int n, h, w;
ll c[10];
cin >> h >> w >> n;
for (int i = 0; i < 10; i++) c[i] = 0;
c[0] = (ll)(h - 2) * (w - 2);
vector<pair<int, int>> m(n);
set<pair<int, int>> s;
for (auto &e:m) {
cin >> e.first >> e.second;
for (int i = -2; i < 3; i++)
for (int j = -2; j < 3; j++)
if (e.first + i > 0 && e.first + i <= h && e.second + j > 0 && e.second + j < +w)
s.insert(make_pair(e.first + i, e.second + j));
}
sort(m.begin(), m.end());
for (auto &e:s) {
if (e.first + 2 > h || e.second + 2 > w) continue;
int d = 0;
for (int i = 0; i < 3; i++) {
for (int j = 0; j < 3; j++) {
if (binary_search(m.begin(), m.end(), make_pair(e.first + i, e.second + j))) d++;
}
}
c[d]++;
c[0]--;
}
for(int i = 0;i < 10;i++) cout << c[i] << endl;
}
| 0
| 40,855,582
|
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#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;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) return a;
return gcd(b , a % b);
}
ll mod(ll a){
return a % 1000000007;
}
ll lcm(ll a,ll b){
return (a*b)/gcd(a,b);
}
int main(){
char a,b; cin >> a >> b;
if(a > b) cout << '>' << endl;
else if(a < b) cout << '<' << endl;
else cout << '=' << endl;
}
|
#include<iostream>
#include<algorithm>
using namespace std;
#define rep(i, n) for (int i = 1; i < (int)(n); i++)
int main()
{
int a,b,c;
int D;
cin >> a >> b >> c >> D;
if(abs(a - c) <= D)
{
cout << "Yes";
}
else if(abs(b - a) <= D && abs(c - b <= D))
{
cout << "Yes";
}
else
{
cout << "No";
}
}
| 0
| 70,653,885
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define gcd(a,b) __gcd(a,b)
#define endl '\n'
const int N=2e5+10;
const int inf=1e9;
const int mod=1e9+7;
vector<int>adj[N];
bool vis[N];
int dis[N];
int main(int argc, char const *argv[])
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
int n, m;
cin >> n >> m;
for(int i=0; i<m; i++)
{
int u, v;
cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
for(int i=1; i<=n; i++)
dis[i]=inf;
queue<int>q;
q.push(1);
vis[1]=1;
dis[1]=0;
while(!q.empty())
{
int u=q.front();
q.pop();
for(auto v: adj[u])
{
if(vis[v]==0)
{
dis[v]=dis[u]+1;
vis[v]=1;
q.push(v);
}
}
}
if(dis[n]<=2)
cout << "POSSIBLE" << endl;
else
cout << "IMPOSSIBLE" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
if (n > m) {
swap(n, m);
}
if (n == 1 && m == 1) {
cout << 1 << '\n';
}
else if (n == 1) {
cout << m - 2 << '\n';
}
else if (n == 2) {
cout << 0 << '\n';
}
else {
cout << (long long) (n - 2) * (m - 2) << '\n';
}
return 0;
}
| 0
| 58,627,813
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s,t;
cin>>s>>t;
int n=s.size();
if(t.size()!=n+1){
cout<<"No"<<endl;
return 0;
}
for(int i=0;i<n;i++){
if(s[i]!=t[i]){
cout<<"No"<<endl;
return 0;
}
}
cout<<"Yes"<<endl;
}
|
#include <iostream>
using namespace std;
class priorityQueue {
private:
long *queueArray;
long size;
public:
priorityQueue() {
this->queueArray = new long[2000001];
this->size = 0;
}
void insert(long num) {
this->queueArray[size+1] = num;
size++;
heapfyInsert();
}
void clean(){
delete[] this->queueArray;
size=0;
}
long remove() {
long max = queueArray[1];
queueArray[1] = queueArray[size];
size--;
heapfyRemove();
return max;
}
void heapfyInsert() {
bool heap = false;
long pos = size;
while (!heap && pos > 1) {
if (queueArray[pos] < queueArray[pos / 2]) {
heap = true;
} else {
long aux = queueArray[pos];
queueArray[pos] = queueArray[pos / 2];
queueArray[pos / 2] = aux;
pos = pos / 2;
}
}
}
void heapfyRemove() {
bool heap = false;
long pos = 1;
long maxPos;
while(!heap && pos < size) {
if (pos * 2 <= size && queueArray[2 * pos] > queueArray[pos] && queueArray[2 * pos] > queueArray[2 * pos + 1]) {
maxPos = 2 * pos;
}else if(pos * 2 + 1 <= size && queueArray[2 * pos + 1] > queueArray[pos]){
maxPos = 2*pos+1;
}else{
maxPos = pos;
}
if(maxPos != pos) {
long aux = queueArray[pos];
queueArray[pos] = queueArray[maxPos];
queueArray[maxPos] = aux;
pos = maxPos;
}else{
heap = true;
}
}
}
};
int main() {
auto heap = new priorityQueue();
string operation;
long n;
while (cin >> operation && operation != "end") {
if (operation == "insert") {
cin >> n;
heap->insert(n);
} else {
long aux = heap->remove();
cout << aux << endl;
}
}
heap->clean();
delete heap;
return 0;
}
| 0
| 74,403,763
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define ii pair<int,int>
#define vii vector<ii>
#define vi vector<int>
#define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR(i, 0, e, 1)
#define F_OR3(i, b, e) F_OR(i, b, e, 1)
#define F_OR4(i, b, e, s) F_OR(i, b, e, s)
#define GET5(a, b, c, d, e, ...) e
#define F_ORC(...) GET5(__VA_ARGS__, F_OR4, F_OR3, F_OR2, F_OR1)
#define FOR(...) F_ORC(__VA_ARGS__)(__VA_ARGS__)
#define EACH(x, a) for (auto& x: a)
#define debug(x) cerr<< #x <<" : "<< x << endl;
#define debuga(A,N) cerr<< #A <<" : [";for(int i = 0; i<N;i++) cerr<<A[i]<<" "; cerr<<"]\n";
#define debuga2(A,N,M) cerr<< #A << " : \n"; for(int i=0;i<N;i++){cerr<<"[";for(int j=0;j<M;++j) cerr<<A[i][j]<<" ";cerr<<"]\n";}
#define debugp(p) cerr<< #p <<" : "<<"("<<(p).first<<","<<(p).second<<")\n";
#define debugv(v) cerr<< #v <<" : "<<"[";for(int i = 0; i< (v).size(); i++) cerr<<v[i]<<" "; cerr<<"]\n";
#define debugv2(v) cerr<< #v << " : \n"; for(int i=0;i<v.size();i++){cerr<<"[";for(int j=0;j<(v[0].size());++j) cerr<<v[i][j]<<" ";cerr<<"]\n";}
#define debugs(m) cerr<< #m <<" : [ "; for(auto itr = m.begin(); itr!=m.end();itr++) cerr<<*itr<<" "; cerr<<"]\n";
#define debugm(m) cerr<< #m <<" : [ "; for(auto itr = m.begin();itr!=m.end(); itr++) cerr<<"("<<itr->first<<","<<itr->second<<") ";cerr<<"]\n";
void solve(){
int a[3];
FOR(3) cin >> a[i];
sort(a,a+3);
cout << a[0] + a[1];
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define len(v) ll(v.size())
#define fi first
#define se second
template <class T>
void cout_vec(const vector<T> &vec){
for(auto itr:vec) cout<<itr<<' ';
cout<<endl;
}
typedef pair<ll,ll> P;
const ll mod=1e9+7;
const ll inf=1e15;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin>>n;
vector<string> s(n+1);
FOR(i,1,n+1) cin>>s[i];
FOR(i,1,n+1) s[i]=' '+s[i];
int ans=0;
rep(b,n){
vector<string> now(s);
FOR(i,1,n+1)FOR(j,1,n+1){
if(j+b<=n) now[i][j]=s[i][j+b];
else now[i][j]=s[i][j+b-n];
}
bool flag=true;
FOR(i,1,n+1)FOR(j,1,n+1){
if(now[i][j]!=now[j][i]){
flag=false;
break;
}
}
if(flag) ans++;
}
cout<<ans*n<<endl;
}
| 0
| 11,868,537
|
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast")
#define ll long long
#define pb push_back
#define x first
#define ld long double
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) a.begin(),a.end()
using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;
template<class value, class cmp = less<value> >
using ordered_set = tree<value, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
template<class value, class cmp = less_equal<value> >
using ordered_multiset = tree<value, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
template<class key, class value, class cmp = less<key> >
using ordered_map = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
inline int randll(int l = INT_MIN, int r = INT_MAX) {
return uniform_int_distribution<int>(l, r)(rng);
}
map <int, map <int, int> > cnt;
main()
{
ios::sync_with_stdio(0);
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int h, w, n;
cin >> h >> w >> n;
vector <ll> ans (10);
vector <pair<int, int> > a(n);
for (int i = 0; i < n; i++) {
cin >> a[i].x >> a[i].y;
for (int j = 0; j <= 2; j++) {
for (int k = 0; k <= 2; k++) {
if (a[i].x - j > 0 && a[i].y - k > 0 && a[i].x - j + 2 <= h && a[i].y - k + 2 <= w) ++cnt[a[i].x - j][a[i].y - k];
}
}
}
for (auto &i : cnt) {
for (auto &j : i.y) {
++ans[j.y];
}
}
ll sum = (h - 2ll) * (w - 2ll);
for (int i = 1; i < 10; i++) sum -= ans[i];
ans[0] = sum;
for (int i = 0; i < 10; i++) cout << ans[i] << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
template <typename A, size_t N, typename T> void Fill(A (&array)[N], const T& val) {
std::fill((T*)array, (T*)(array + N), val);
}
#define REP(i, n) for (long long i = 0; i < (n); i++)
#define rep(i, a, n) for (long long i = a; i < (n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
long long mod = 1000000007;
long long modpow(long long m, long long n) {
if (n == 0) return 1;
if (n % 2 == 0) {
long long t = modpow(m, n / 2);
return t * t % mod;
} else {
return modpow(m, n - 1) * m % mod;
}
}
long long power(long long m, long long n) {
if (n == 0) return 1;
if (n % 2 == 0) {
long long t = modpow(m, n / 2);
return t * t;
} else {
return modpow(m, n - 1) * m;
}
}
long long moddiv(long long a, long long b) { return (a * modpow(b, mod - 2)) % mod; }
const ll INF = 1LL << 60;
string change_binary(long long a) {
string ret;
for (int i = 31; i >= 0; i--) {
ret += (a >> i & 1) + '0';
}
return ret;
}
ll nCkmod(ll n, ll k) {
ll denomi = 1;
for (int i = n; i > n - k; i--) {
denomi *= i;
denomi %= mod;
}
ll numera = 1;
REP(i, k) {
numera *= (i + 1);
numera %= mod;
}
return moddiv(denomi, numera);
}
map<pair<char, char>, ll> cnt;
int main() {
ll n, m;
cin >> n;
cin >> m;
vector<P> ab(n);
REP(i, n) { cin >> ab[i].first >> ab[i].second; }
sort(ab.begin(), ab.end());
ll x = 0;
ll ans = 0;
priority_queue<ll> pq;
rep(i, 1, m + 1) {
while (x < n && i == ab[x].first) {
pq.push(ab[x].second);
x++;
}
if (!pq.empty()) {
ans += pq.top();
pq.pop();
}
}
cout << ans << endl;
}
| 0
| 64,105,610
|
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cassert>
#include <cstdlib>
#include <cctype>
#include <ctime>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <numeric>
#include <utility>
#include <string>
#include <algorithm>
#include <vector>
#include <map>
#include <queue>
#include <set>
#include <list>
#include <bitset>
#include <complex>
using namespace std;
#define f first
#define s second
#define endl '\n'
#define PB pop_back
#define pb push_back
#define mp make_pair
#define int long long
#define sz(s) (int)s.size()
#define seper(n) setprecision(n)
#define all(v) v.begin(),v.end()
#define mem(a,b) memset(a,b,sizeof a)
#define IOS ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...); }
#define debug(...) cerr << "{" << #__VA_ARGS__ << "}:", debug_out(__VA_ARGS__)
typedef long long ll;
typedef map<int , int> mii;
typedef pair<int , int> pii;
typedef map<string , int> msi;
const int MAXN = 1e2 + 10;
int n , l , r , a[MAXN] , d[MAXN];
string ans = "Impossible";
int32_t main()
{
cin >> n , r = n - 1;
for(int i = 0 ; i < n ; i ++)
cin >> a[i] , d[a[i]] ++;
while(!d[l])
l ++;
while(!d[r])
r --;
if((r + 1) / 2 == l)
{
ans = "Possible";
for(int i = l ; i <= r ; i ++)
{
if(i == l)
{
if(d[i] != ((r % 2) + 1))
{ans = "Impossible" ; break;}
}
else
{
if(d[i] <= 1)
{ans = "Impossible" ; break;}
}
}
}
return cout << ans << endl , 0;
}
|
#include <cstdio>
#include <vector>
using namespace std;
typedef long long ll;
const int N = 1 << 18;
vector <pair <int, int> > s;
int a[N];
int n;
void dbg() {
for (int j = 0; j < (int) s.size(); ++ j)
printf("(%d, %d) ", s[j].first, s[j].second);
puts("");
}
bool plus(int lim) {
int i;
for (i = (int) s.size() - 1; ~i && s[i].first == lim; -- i);
if (!~i) return 0;
if (!s[i].second) return 0;
s[i].second --;
int nw = s[i].first;
if (!s[i].second) {
for (int j = i; j < (int) s.size() - 1; ++ j) s[j] = s[j + 1];
s.pop_back();
}
else ++ i;
s.push_back({0, 0});
for (int j = (int) s.size() - 1; j > i; -- j) s[j] = s[j - 1];
s[i] = {nw + 1, 1};
int x = 0;
for (int j = (int) s.size() - 1; j > i; -- j) {
x += s.back().second;
s.pop_back();
}
if (x) s.push_back(make_pair(1, x));
return 1;
}
bool chk(int lim) {
s.clear();
int len = 0;
for (int i = 0; i < n; ++ i) {
if (len > a[i]) {
for (int j = (int) s.size() - 1; len > a[i]; -- j) {
if (len - s[j].second < a[i]) {
s[j].second -= len - a[i];
len = a[i];
break;
}
len -= s[j].second;
s.pop_back();
}
if (!plus(lim)) return 0;
}
else if (len < a[i]) { s.push_back({1, a[i] - len}); len = a[i]; }
else if (!plus(lim)) return 0;
}
return 1;
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; ++ i) scanf("%d", &a[i]);
int lb = 1, rb = 1 << 30;
while (lb < rb) {
int md = (lb + rb) >> 1;
if (chk(md)) rb = md;
else lb = md + 1;
}
printf("%d\n", lb);
return 0;
}
| 0
| 88,926,411
|
#include <vector>
#include <set>
#include <map>
#include <array>
#include <iostream>
#include <cstdio>
#include <cstdint>
#include <algorithm>
#include <numeric>
#include <bitset>
#include <iomanip>
using ll = long long;
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
#define outD(fpv) cout << setprecision(20) << fpv << endl;
inline void yes(bool cond) { cond ? puts("Yes") : puts("No"); }
inline void YES(bool cond) { cond ? puts("YES") : puts("NO"); }
template<typename Type> inline void chmin(Type& a, Type b) { if (a > b) a = b; }
template<typename Type> inline void chmax(Type& a, Type b) { if (a < b) a = b; }
template<typename Arr, typename Type> inline void fill(Arr& arr, Type v) { std::fill(arr.begin(), arr.end(), v); }
template<typename Type> inline void sort(Type& arr) { std::sort(arr.begin(), arr.end()); }
template<typename Type> inline void reverse(Type& arr) { reverse(arr.begin(), arr.end()); }
template<typename Type> inline Type nth(vector<Type>& arr, size_t pos) { std::nth_element(arr.begin(), arr.begin() + pos, arr.end()); return arr[pos]; }
template<typename Type> inline void unique(Type& arr) { sort(arr); arr.erase(unique(arr.begin(), arr.end()), arr.end()); }
constexpr ll INF_I = std::numeric_limits<ll>::max();
constexpr ll BIGP = 1e9 + 7;
constexpr double INF_F = std::numeric_limits<float>::infinity();
constexpr double PI = 3.14159265358979323846L;
using P = pair<ll, ll>;
int main()
{
cin.tie(0); ios::sync_with_stdio(false);
ll N, M;
cin >> N >> M;
vector<vector<ll>> Ss(M);
rep(i, M)
{
ll k;
cin >> k;
vector<ll> S(k);
rep(j, k)
{
cin >> S[j];
--S[j];
}
Ss[i] = S;
}
vector<ll> p(M);
rep(i, M) cin >> p[i];
ll ans = 0;
std::vector<bool> onOff(N);
for (uint16_t bits = 0; bits < (1 << N); ++bits)
{
rep(i, N) onOff[i] = (bits & (1 << i));
bool okay = true;
rep(i, Ss.size())
{
auto& S = Ss[i];
int count = 0;
rep(j, S.size())
{
count += onOff[S[j]];
}
if (count % 2 != p[i])
{
okay = false;
break;
}
}
if (okay)
{
++ans;
}
}
cout << ans;
return 0;
}
|
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))
using namespace std;
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;}
const ll INF=1e18;
int main()
{
ll n,k;
cin >> n >> k;
string s;
cin >> s;
vector<pll> a;
ll cnt=0;
rep(i,n){
if(i==0){
cnt++;
continue;
}
if(s[i]==s[i-1]){
cnt++;
}
else{
a.push_back(make_pair((ll)(s[i-1]-'0'),cnt));
cnt=1;
}
}
a.push_back(make_pair((ll)(s[n-1]-'0'),cnt));
ll m=a.size();
vector<ll> sum(m+1);
rep(i,m){
sum[i+1]=sum[i]+a[i].se;
}
ll ans=0;
rep(i,m){
if(a[i].fi==1){
ans=max(ans,sum[min(m,i+2*k+1)]-sum[i]);
}
else{
ans=max(ans,sum[min(m,i+2*k)]-sum[i]);
}
}
cout << ans << endl;
return 0;
}
| 0
| 20,457,484
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 1000000007
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; }
signed main(){
ll n; cin>>n;
vl dp(1001000,MOD*10);
dp[0]=0;
rep(i,0,n+1){
chmin(dp[i+1],dp[i]+1);
ll a=6,b=9;
while(a+i<=n){
chmin(dp[i+a],dp[i]+1);
a*=6;
}
while(b+i<=n){
chmin(dp[i+b],dp[i]+1);
b*=9;
}
}
cout<<dp[n]<<endl;
return 0;
}
|
#include <cstdio>
#include <stdio.h>
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
using namespace std;
int main(){
string str;
int size,h;
cin >> str;
size = str.size();
string mozi[size],ans = "";;
for(int i = 0;size > i;i++){mozi[i] = str.substr(i,1);}
for(int i = 1;size >= i;i++){ans.append(mozi[size - i]);}
cout << ans << endl;
}
| 0
| 2,404,514
|
#include<iostream>
using namespace std;
int main(void){
int d;
int sum;
int x_now;
cin >> d;
while(!cin.eof()){
sum = 0;
x_now = 0;
for(int i=600;i!=0;){
sum += x_now*x_now*d;
i -= d;
x_now += d;
}
cout << sum << endl;
cin >> d;
}
return 0;
}
|
#include<cstdio>
#include<cctype>
#include<map>
using namespace std;
int read()
{
int f,c,x;
while(!isdigit(c=getchar())&&c!='-'); c=='-'?(f=1,x=0):(f=0,x=c-'0');
while(isdigit(c=getchar())) x=(x<<3)+(x<<1)+c-'0'; return f?-x:x;
}
int h,w,n,X,Y;
long long ans[11];
map<pair<int,int>,int>ma;
int main()
{
h=read(); w=read(); n=read();
ans[0]=1ll*(h-2)*(w-2);
for(int x,y,i=1;i<=n;i++)
{
x=read(); y=read();
for(int j=0;j<3;j++)
{
X=x+j;
for(int k=0;k<3;k++)
{
Y=y+k;
if(X>=3&&X<=h&&Y>=3&&Y<=w)
{
ans[ma[make_pair(X,Y)]]--;
ans[++ma[make_pair(X,Y)]]++;
}
}
}
}
for(int i=0;i<=9;i++) printf("%lld\n",ans[i]);
return 0;
}
| 0
| 69,486,240
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define PB push_back
#define INF 1000000001
#define INFL 1000000000000000001
#define M 1000000007
string s;
ll n,k;
vector<ll>q;
int main(void){
cin>>s>>k;
n=s.size();
ll l=1;
for(int i=1;i<=n;i++){
if(i==n||s[i-1]!=s[i]){
q.PB(l);
l=0;
}
l++;
}
ll ans=0;
if(s[0]!=s[n-1]){
for(int i=0;i<q.size();i++)ans+=q[i]/2LL;
ans*=k;
}else{
if(q.size()==1){
ans=n*k/2LL;
}else{
for(int i=1;i+1<q.size();i++)ans+=q[i]/2LL;
ans+=(q[0]+q.back())/2LL;
ans*=(k-1LL);
for(int i=0;i<q.size();i++)ans+=q[i]/2LL;
}
}
printf("%lld\n",ans);
}
|
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define i128 __int128
#define mp make_pair
#define ld long double
typedef pair<int, int> pii;
typedef priority_queue<int, vector<int>, greater<int> > small_heap;
typedef priority_queue<int> big_heap;
const int N = 1e6 + 100;
int T;
int n, a[1000005], u[1000005];
int main() {
scanf("%d", &n);
int g = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
g = __gcd(g, a[i]);
for (int j = 2; j * j <= a[i]; j++) {
if (a[i] % j == 0) {
u[j]++;
while (a[i] % j == 0)a[i] /= j;
}
}
u[a[i]]++;
}
if (g > 1) {
cout << "not coprime\n";
return 0;
}
for (int i = 2; i <= (int) 1e6; i++) {
if (u[i] > 1) {
cout << "setwise coprime\n";
return 0;
}
}
cout << "pairwise coprime\n";
return 0;
}
| 0
| 14,169,998
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<VecP>;
#define REP(i, m, n) for(ll (i) = (m); (i) < (n); ++(i))
#define REPR(i, m, n) for(ll (i) = (m); (i) > (n); --(i))
#define rep(i, n) REP(i, 0, n)
#define R cin>>
#define i64 unsigned long long
#define repr(i, n) REPR(i, n, 0)
#define all(s) (s).begin(), (s).end()
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
#define in(a) insert(a)
#define P(p) cout<<(p)<<endl;
#define ALL(x) (x).begin(),(x).end()
#define ALLR(x) (x).rbegin(),(x).rend()
#define SORT(a) sort((a).begin(), (a).end())
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long long int> vll;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
void sonic(){ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);}
void setp(const ll n){cout << fixed << setprecision(n);}
const ll INF = 1e9+1;
const ll LINF = 1e18+1;
const ll mod = 1e9+7;
const ld PI = acos(-1);
const ld EPS = 1e-11;
template<typename T> void co(T e){cout << e << "\n";}
template<typename T> void co(const vector<T>& v){for(const auto& e : v)
{ cout << e << " "; } cout << "\n";}
ll gcd(ll a, ll b) {
if (a < b)swap(a, b);
if (b == 0) return a;
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a * b / g;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n%i == 0)return false;
}
return n != 1;
}
int pow(int x, int y, int mod){
int ret=1;
for(;y;y>>=1,x=1ll*x*x%mod){
if(y&1) ret=1ll*ret*x%mod;
}
return ret;
}
void kill()
{
cout << "No" << endl;
exit(0);
}
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;}
int main(){
sonic();
ll n, ans=0;
R n;
Vec div;
for(ll i=1;i*i<=n;i++){
if(n%i==0)div.push_back(i);
if(i*i!=n)div.push_back(n/i);
}
for(auto it:div){
if(it==1)continue;
if(n%(it-1)==n/(it-1))ans+=it-1;
}
co(ans);
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
struct node
{
ll d;int id;
}c[100005];
bool cmp(node x,node y){return x.d>y.d;}
int fa[100005],siz[100005],deep[100005];
ll d[100005];
vector<int>to[100005];
void dfs(int x){for(auto tar:to[x])deep[tar]=deep[x]+1,dfs(tar);}
int main()
{
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)scanf("%lld",&c[i].d),c[i].id=i,siz[i]=1;
sort(c+1,c+n+1,cmp);
for(int i=1;i<=n;i++)d[i]=c[n+1-i].d;
for(int i=1;i<n;i++)
{
int t=lower_bound(d+1,d+n+1,c[i].d+2*siz[c[i].id]-n)-d;
t=n+1-t;
if(c[t].d!=c[i].d+2*siz[c[i].id]-n){puts("-1");return 0;}
fa[c[i].id]=c[t].id,siz[c[t].id]+=siz[c[i].id];
}
for(int i=1;i<=n;i++)if(fa[i])to[fa[i]].push_back(i);
dfs(c[n].id);
ll s=0;
for(int i=1;i<=n;i++)s+=deep[i];
if(s!=c[n].d){puts("-1");return 0;}
for(int i=1;i<=n;i++)if(fa[i])printf("%d %d\n",i,fa[i]);
return 0;
}
| 0
| 46,721,767
|
#include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i,a,b) for(int64_t i=(a);i<(b);++i)
#define Rrep(i,a,b) for(int64_t i=(a);i>=(b);--i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define RANGE(a,b,c) (a).begin()+(b),(a).begin()+(c)
#define INF 1000000000000000
#define MOD 1000000007
using PII = pair<int64_t, int64_t>;
using VI = vector<int64_t>;
using VVI = vector<VI>;
using VS = vector<string>;
using VP = vector<PII>;
using i64 = int64_t;
template<typename T> void invec(vector<T> &A){for(T& a:A) cin >> a;}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K; cin >> N >> K;
int star = (N-1) * (N-2) / 2;
if (K > star){
cout << "-1\n";
return 0;
}
VP res;
rep(i, 1, N) res.emplace_back(i, N);
int rem = star - K;
int ci = 1, cj = 2;
while (rem--){
res.emplace_back(ci, cj);
++cj;
if (cj == N){
++ci;
cj = ci + 1;
}
}
cout << res.size() << "\n";
for(PII p: res) cout << p.first << ' ' << p.second << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define mod 1000000007
#define pi acos(-1.0)
const ll INF = 1LL<<61;
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 x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
ll jou(ll N, ll P){if(P==0) return 1;
if(P%2==0){ll t = jou(N, P/2);return t*t % mod;
}return (N * jou(N, P-1)) % mod;}
int main(){
ll n,l,t;
cin>>n>>l>>t;
vector<ll> to;
vector<ll> han;
ll now=0;
rep(i,n){
ll x,w;
cin>>x>>w;
if(x==0 && w==2 && n>1) now=1;
if(w==1) to.pb(x);
else han.pb(x);
}
vector<ll> owa;
rep(i,to.size()){
owa.pb((to[i]+t)%l);
now-=(t+to[i])/l;
}
rep(i,han.size()){
owa.pb(((han[i]-t)%l+l)%l);
if(han[i]==0) now+=t/l;
else now+=(l-han[i]+t-1)/l;
}
sort(all(owa));
now%=n;
if(now<0) now+=n;
rep(i,n){
ll x=n-now+i;
if(x<n) cout << owa[x] << endl;
else cout << owa[x-n] << endl;
}
}
| 0
| 33,265,889
|
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
vector<int> hill(10);
for(int i=0; i<10; i++) cin >>hill[i];
sort(hill.begin(),hill.end());
for(int i=9; i>6; i--) cout <<hill[i]<<endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std ;
using ll = long long ;
using vll = vector<ll> ;
using pll = pair<ll,ll> ;
#define all(v) v.begin(),v.end()
int main(){
ll n,d,a ;
cin >> n >> d >> a ;
vector<pll> enemy(n) ;
for(int i=0;i<n;i++) cin >> enemy.at(i).first >> enemy.at(i).second ;
sort(all(enemy)) ;
vll sum(n,0) ;
ll ans = 0 ;
for(int i=0;i<n;i++){
if(i!=0) sum.at(i) = sum.at(i-1)+sum.at(i) ;
if(sum.at(i)>=enemy.at(i).second) continue ;
enemy.at(i).second -= sum.at(i) ;
ll cnt = (enemy.at(i).second+a-1)/a ;
ans += cnt ;
sum.at(i) += cnt*a ;
ll l,r,m ;
l = i ;
r = n ;
while(l+1<r){
m = (l+r)/2 ;
if(enemy.at(m).first>enemy.at(i).first+2*d) r = m ;
else l = m ;
}
if(r!=n) sum.at(r) -= cnt*a ;
}
cout << ans << endl ;
}
| 0
| 56,409,180
|
#include<bits/stdc++.h>
using namespace std;
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
string s;
cin>>s;
map<char,int>m;
for(int i=0;i<s.size();++i){
if(m[s[i]]>0){
cout<<"no";
return 0;
}
++m[s[i]];
}
cout<<"yes";
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
#include <utility>
#define ll (long long)
#define REP(i,n) for(int i = 0;i<(int)n;i++)
#define FOR(i,a,b) for(int i = (a);i < (b);i++)
#define RFOR(i,a,b) for(int i = (a);i>(b);i--)
#define risi (0.05)
using namespace std;
int main(void)
{
int a,b,c,d;
int i,j,k,l;
int number;
int answercounter = 0;
int answerarray[1000] = {0};
int temp = 0;
while(cin >> number)
{
for(i = 0;i <= 9;i++)
if(i <= number)
for(j = 0;j<=9;j++)
if(i+j<= number)
for(k = 0;k<=9;k++)
if(i+j+k <= number)
for(l = 0;l<=9;l++)
if((i+j+k+l) == number)
temp++;
answerarray[answercounter] = temp;
temp = 0;
answercounter++;
}
REP(i,answercounter)
cout << answerarray[i] << endl;
return 0;
}
| 0
| 52,170,804
|
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod =(1e9)+7;
using P = pair<ll,ll>;
vector<ll>a(60,1);
vector<ll>p(60,1);
ll f(ll x,ll level){
if(level==0)return (x<=0?0:1);
if(x==1)return 0;
else if(x<=a[level-1]+1)return f(x-1,level-1);
else if(x==a[level-1]+2)return p[level-1]+1;
else if(x<=2*a[level-1]+2)return p[level-1]+1+f(x-a[level-1]-2,level-1);
else return p[level-1]*2+1;
}
int main(){
ll n;cin >>n;
for (int i = 0; i <60 ; ++i) {
a[i+1]=2*a[i]+3;
p[i+1]=2*p[i]+1;
}
ll x;cin>>x;
ll ans=f(x,n);
cout <<ans <<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void){
int k,s;
int ans = 0;
cin >> k >> s;
for(int i=0;i<=k;i++) {
for(int j=0;j<=k;j++) {
int z=s-i-j;
if(0<=z && z<=k) ans++;
}
}
cout << ans << endl;
return 0;
}
| 0
| 58,381,683
|
#include <cstdio>
typedef long long ll;
const int MAXN = 1000;
ll X[MAXN + 5], Y[MAXN + 5]; int N;
ll abs(ll x) {
return x >= 0 ? x : -x;
}
int main() {
scanf("%d", &N);
for(int i=1;i<=N;i++)
scanf("%lld%lld", &X[i], &Y[i]);
int type = ((X[1] + Y[1]) & 1);
for(int i=1;i<=N;i++) {
if( type != ((X[i] + Y[i]) & 1) ) {
type = -1;
break;
}
}
if( type == -1 ) {
puts("-1");
return 0;
}
else if( type == 0 ) {
printf("%d\n%d", 40, 1);
for(int i=0;i<39;i++)
printf(" %lld", (1LL<<i));
puts("");
for(int i=1;i<=N;i++) {
putchar('L'), X[i]++;
for(int j=0;j<38;j++) {
ll t1 = (1LL << j), t2 = (1LL << (j + 1)), t3 = (1LL << (j + 2));
if( abs(X[i] % t2) == t1 ) {
if( abs(Y[i] % t3) + abs((X[i] + t1) % t3) == t2 )
putchar('L'), X[i] += t1;
else putchar('R'), X[i] -= t1;
}
else {
if( abs(X[i] % t3) + abs((Y[i] + t1) % t3) == t2 )
putchar('D'), Y[i] += t1;
else putchar('U'), Y[i] -= t1;
}
}
ll t1 = (1LL << 38), t2 = (1LL << 39), t3 = (1LL << 40);
if( abs(X[i] % t2) == t1 ) {
if( abs(Y[i] % t3) + abs((X[i] + t1) % t3) == t2 )
puts("R"), X[i] -= t1;
else puts("L"), X[i] += t1;
}
else {
if( abs(X[i] % t3) + abs((Y[i] + t1) % t3) == t2 )
puts("U"), Y[i] -= t1;
else puts("D"), Y[i] += t1;
}
}
}
else {
printf("%d\n", 40);
for(int i=0;i<40;i++)
printf("%lld ", (1LL<<i));
puts("");
for(int i=1;i<=N;i++) {
for(int j=0;j<39;j++) {
ll t1 = (1LL << j), t2 = (1LL << (j + 1)), t3 = (1LL << (j + 2));
if( abs(X[i] % t2) == t1 ) {
if( abs(Y[i] % t3) + abs((X[i] + t1) % t3) == t2 )
putchar('L'), X[i] += t1;
else putchar('R'), X[i] -= t1;
}
else {
if( abs(X[i] % t3) + abs((Y[i] + t1) % t3) == t2 )
putchar('D'), Y[i] += t1;
else putchar('U'), Y[i] -= t1;
}
}
ll t1 = (1LL << 39), t2 = (1LL << 40), t3 = (1LL << 41);
if( abs(X[i] % t2) == t1 ) {
if( abs(Y[i] % t3) + abs((X[i] + t1) % t3) == t2 )
puts("R"), X[i] -= t1;
else puts("L"), X[i] += t1;
}
else {
if( abs(X[i] % t3) + abs((Y[i] + t1) % t3) == t2 )
puts("U"), Y[i] -= t1;
else puts("D"), Y[i] += t1;
}
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
string s;
int main(void){
cin >> s;
lli ans = 0;
rep(i, s.size()-1){
if(s[i] != s[i+1]) ans++;
}
cout << ans << endl;
return 0;
}
| 0
| 49,190,418
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,x,t,m,a;
cin >> n >> x >> t;
a = n/x;
if(n%x != 0)a++;
m = a * t;
cout << m << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;
const int mod = 1e9+7;
int main(){
int n;
cin >> n;
vector<ll> t(n),a(n);
rep(i,n) cin >> t[i];
rep(i,n) cin >> a[i];
vector<ll> l(n,0),r(n,0);
if (t[n-1] != a[0]) {
puts("0");
return 0;
}
l[0] = 1;
for (int i = 1; i < n ; i++) {
if (t[i] > t[i-1]) {
l[i] = 1;
r[i] = t[i];
} else {
l[i] = t[i];
r[i] = -1;
}
}
l[n-1] = 1;
bool ok = true;
for (int i = n-2; i >= 0; i--) {
if (r[i] != -1 && a[i] < r[i]) {
ok = false;
break;
}
if(a[i] > a[i+1]) l[i] = 1;
else l[i] = min(l[i],a[i]);
}
ll res = 1;
if(!ok) puts("0");
else {
rep(i,n) {
res = (res * l[i]) % mod;
}
cout << res << endl;
}
return 0;
}
| 0
| 92,947,278
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
std::fill( (T*)array, (T*)(array+N), val );
}
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*b/gcd(a, b);
}
int main()
{
cout << fixed << setprecision(15);
ll X, Y;
cin >> X >> Y;
ll ans = 1;
while(X<=Y){
X *= 2;
if(X>Y) break;
ans++;
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
using namespace std;
#define MAX 100000+5
#define NIL -1
struct Node {
int parent;
int left;
int right;
};
Node T[MAX];
int n, D[MAX];
void Print( int u );
int Rec( int u, int p );
int main() {
cin >> n;
for ( int i = 0; i < n; ++i ) T[i].parent = T[i].left = T[i].right = NIL;
int v, d, l;
for ( int i = 0; i < n; ++i ) {
cin >> v >> d;
int c;
for ( int j = 0; j < d; ++j ) {
cin >> c;
if ( 0 == j ) T[v].left = c;
else T[l].right = c;
l = c;
T[c].parent = v;
}
}
int r;
for ( int i = 0; i < n; ++i ) {
if ( T[i].parent == NIL ) {
r = i;
}
}
Rec( r, 0 );
for ( int i = 0; i < n; ++i ) Print( i );
return 0;
}
void Print( int u ) {
cout << "node " << u << ": ";
cout << "parent = " << T[u].parent << ", ";
cout << "depth = " << D[u] << ", ";
if ( NIL == T[u].parent ) cout << "root, ";
else if ( NIL == T[u].left ) cout << "leaf, ";
else cout << "internal node, ";
cout << "[";
int flag = 0;
for ( int c = T[u].left; c != NIL; c = T[c].right ) {
if ( flag++ ) cout << ", ";
cout << c;
}
cout << "]\n";
}
int Rec( int u, int p ) {
D[u] = p;
if ( NIL != T[u].right ) Rec( T[u].right, p );
if ( NIL != T[u].left ) Rec( T[u].left, p+1 );
}
| 0
| 33,363,358
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
const int INF = (1<<30)-1;
const long long LINF = (1LL<<62)-1;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
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; }
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int v, e;
cin >> v >> e;
vector<vector<int>> to(v);
vector<int> ideg(v);
rep(i, e) {
int s, t;
cin >> s >> t;
to[s].push_back(t);
ideg[t]++;
}
stack<int> st;
rep(i, v) {
if (!ideg[i])
st.push(i);
}
vector<int> ts;
while (!st.empty()) {
int idx = st.top();
st.pop();
ts.push_back(idx);
for (auto next : to[idx]) {
ideg[next]--;
if (!ideg[next])
st.push(next);
}
}
for (auto e : ts)
cout << e << endl;
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
typedef long long LL;
void findzero() {
int ret = 1;
for (int i = 2; 2*i/2 == i; i *= 10) {
cout << "? " << i << endl;
string s;
cin >> s;
if (s == "Y") {
break;
}
else ret *= 10;
}
cout << "! " << ret << endl;
}
int findbase() {
for (int i = 100000000; i >= 1; i /= 10) {
cout << "? " << i << endl;
string s;
cin >> s;
if (s == "Y") {
return i;
}
}
}
void search(LL base) {
LL left = base + 1;
LL right = base * 10 - 1;
while (left < right) {
LL mid = (left+right) >> 1;
cout << "? " << mid*10 << endl;
string s;
cin >> s;
if (s == "Y") {
right = mid;
}
else {
left = mid + 1;
}
}
cout << "! " << left << endl;
}
int main() {
cout << "? " << 1000000000 << endl;
string s;
cin >> s;
if (s == "Y") {
findzero();
}
else {
int base = findbase();
search(base);
}
return 0;
}
| 0
| 44,699,060
|
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <numeric>
#include <cmath>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
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;}
const ll MOD = 1000000007;
const int INF = 1<<30;
ll choose(ll n){
return n * (n - 1) / 2;
}
int main(){
ll N, M; cin >> N >> M;
vector<ll> a(N); rep(i, N) cin >> a[i];
vector<ll> s(N + 1, 0);
rep(i, N) s[i + 1] = s[i] + a[i];
map<ll, ll> mp;
for (int i = 1; i < N + 1; ++i) mp[s[i] % M]++;
ll ans = 0;
for (auto v: mp){
ans += choose(v.second);
}
ans += mp[0];
cout << ans << endl;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int main(void) {
while (1) {
int m, nmin, nmax;
scanf("%d%d%d", &m, &nmin, &nmax);
if (m == 0 && nmin == 0 && nmax == 0) break;
int P[m];
for (int i = 0; i < m; ++i) {
cin >> P[i];
}
sort(P, P + m, greater<int>());
int maxgap = 0;
int maxgapn;
for (int i = nmin - 1; i <= nmax - 1; ++i) {
int gap = P[i] - P[i + 1];
if (gap >= maxgap) {
maxgapn = i;
maxgap = gap;
}
}
cout << maxgapn + 1 << endl;
}
return 0;
}
| 0
| 88,896,270
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,M;
cin>>A>>B>>M;
vector<int>a(A);
vector<int>b(B);
for(int i=0;i<A;i++){
cin>>a.at(i);
}
for(int i=0;i<B;i++){
cin>>b.at(i);
}
vector<int>x(M);
vector<int>y(M);
vector<int>c(M);
for(int i=0;i<M;i++){
cin>>x.at(i)>>y.at(i)>>c.at(i);
}
vector<int>answer(M+1);
for(int i=0;i<M;i++){
answer.at(i)=a.at(x.at(i)-1)+b.at(y.at(i)-1)-c.at(i);
}
sort(a.begin(),a.end());
sort(b.begin(),b.end());
answer.at(M)=a.at(0)+b.at(0);
sort(answer.begin(),answer.end());
cout<<answer.at(0)<< endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define next Next
#define last Last
#define int long long
const int N=1e6+5;
int n,a[N],sum[N];
#define gc getchar
inline int read()
{
int ret=0,f=0;char c=gc();
while(!isdigit(c)){if(c=='-')f=1;c=gc();}
while(isdigit(c)){ret=ret*10+c-48;c=gc();}
if(f)return -ret;return ret;
}
signed main()
{
n=read();
for(int i=1;i<=n;i++)a[read()]++;
sort(a+1,a+n+1);
for(int i=1;i<=n;i++)sum[i]=sum[i-1]+a[i];
for(int i=1;i<=n;i++)
{
int l=0,r=n/i;
while(l<r)
{
int mid=(l+r+1)/2;
if(mid>a[n])
{
if(i*mid<=sum[n])l=mid;
else r=mid-1;
}
else{
int x=lower_bound(a+1,a+n+1,mid)-a;
x--;
if(mid*(i-(n-x))<=sum[x])l=mid;
else r=mid-1;
}
}
printf("%lld\n",l);
}
}
| 0
| 54,597,504
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define ff first
#define Shazam ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ss second
#define all(c) c.begin(),c.end()
#define endl "\n"
#define test() int t; cin>>t; while(t--)
#define fl(i,a,b) for(int i = a ; i <b ;i++)
#define get(a) fl(i,0,a.size()) cin>>a[i];
#define pra(a) fl(i,0,a.size()) cout<<a[i]<<" "; cout<<endl;
#define pr(a,n) fl(i,0,n) cout<<a[i]<<" "; cout<<endl;
const ll INF = 2e18;
const int inf = 2e9;
const int mod1 = 1e9 + 7;
vector<ll> total;
vector<vector<int>> g;
vector<ll> pending;
void dfs(int u, int p, ll curr){
curr+=pending[u];
total[u] = curr;
for(int v : g[u]){
if(v==p) continue;
dfs(v,u,curr);
}
}
int main(){
Shazam;
int n,q; cin>>n>>q;
g.resize(n);
total.resize(n);
pending.resize(n);
for(int i = 0 ; i < n-1; i++){
int a,b; cin>>a>>b;
a--, b--;
g[a].push_back(b);
g[b].push_back(a);
}
for(int i = 0; i < q; i++){
ll p,x; cin>>p>>x;
pending[p-1] +=x;
}
dfs(0,-1,0);
pra(total);
return 0;
}
|
#include <bits/stdc++.h>
#include <stdio.h>
#include <math.h>
using namespace std;
using vi = vector<int>;
using vll = vector<long long int>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long int>>;
using ll = long long int;
ll M = 998244353;
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
for(int i=0; i<n; i++){
res *= a;
res %= mod;
}
return res;
}
int main(){
ll N; cin >> N;
vll d(N+1);
for(int i=1; i<N+1; i++){
cin >> d[i];
}
vll num(N, 0);
for(int i=1; i<N+1; i++){
num[d[i]]++;
}
if(d[1]!=0||num[0]>1){
cout << 0;
}else{
bool t = true;
for(int i=1; i<N-1; i++){
if(num[i]==0&&num[i+1]>0){
t = false;
}
}
if(t == false){
cout << 0;
}else{
ll p = 1;
for(int i=1; i<N; i++){
if(num[i]==0){
break;
}else{
ll m = modpow(num[i-1], num[i], M);
p *= m;
p %= M;
}
}
cout << p;
}
}
}
| 0
| 28,734,086
|
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
using namespace __gnu_pbds;
const ll Mod = (int)1e9;
ll CaseN=1;
ll fast_power(ll a,ll b,ll mod){
ll ans=1;
while(b>0){
if(b&1){
ans=(a*ans)%mod;
}
b=b>>1;
a=(a*a)%mod;
}
return ans;
}
ll nCr(ll n ,ll r)
{
ll p= n;
r = min(r,n-r);
ll a =1;
ll b=1;
while(r)
{
a = a*p;
b = b*r;
ll g = __gcd(a,b);
a = a/g;
b = b/g;
p--;
r--;
}
return a;
}
void solve()
{
ll n,k;
cin>>n>>k;
ll mod = pow(2,31) - 1ll ;
ll ans=0 ;
ans = (fast_power(k-1,n-1,mod)*k)%mod ;
cout<<ans<<endl;
CaseN++;
return ;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t=1;
while(t--)
{
solve();
}
}
|
#pragma GCC target ("avx2")
#pragma GCC optimize "trapv"
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#define input(a,n) for(ll i1=0;i1<n;i1++)cin>>a[i1]
#define ll long long
#define pi 2 * acos(0.0)
#define usll unordered_set<ll>
#define sll set<ll>
#define vll vector<ll>
#define mll map<ll,ll>
#define pll pair<ll,ll>
#define umll unordered_map<ll,ll>
#define S second
#define sz size()
#define all(v) v.begin(),v.end()
#define Y cout<< "YES"<< "\n"
#define N cout<< "NO"<< "\n"
#define F first
#define mp make_pair
#define pb push_back
#define pf push_front
#define ld long double
#define mod 1000000007
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
string s,t;
cin>>s>>t;
ll n=s.sz,ans=0;
for(ll i=0;i<n;i++)
{
if(s[i]!=t[i])
ans++;
}
cout<<ans;
return 0;
}
| 0
| 38,832,386
|
#include<cstdio>
#include<iostream>
#include<string>
#include<algorithm>
#include<stdio.h>
#include<locale.h>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
int main()
{
string s,t;
cin>>s; cin>>t;
int inx=0;
for(int i=0;i<s.size();i++)
{
int flg=1;
for(int j=0;j<t.size();j++)
{
if(i+j>=s.size()){flg=0; break;}
if(s[i+j]!=t[j]){flg=0;}
}
if(flg==1){inx=1; break;}
}
if(inx==1){for(int i=0;i<s.size();i++){if(s[i]=='?'){s[i]='a';}} }
if(inx==0){
int st=-1;
for(int i=0;i<s.size();i++)
{
int flg=1;
for(int j=0;j<t.size();j++)
{
if(i+j>=s.size()){flg=0; break;}
if(s[i+j]!=t[j]&&s[i+j]!='?'){flg=0;}
}
if(flg==1){st=i;}
}
if(st==-1){s="UNRESTORABLE";}
else{
for(int i=0;i<s.size();i++)
{
if(s[i]=='?'){s[i]='a';}
}
for(int i=st;i<st+t.size();i++)
{
s[i]=t[i-st];
}
}
}
cout<<s;
}
|
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i,a,b)for(long long i=a;i<b;++i)
#define rrep(i,a,b)for(int i=a;i>=b;--i)
#define yesno(flag)if(flag)cout<<"Yes"<<endl; else cout<<"No"<<endl;
using namespace std;
const ll INF=100000000000000LL;
const ll r197=1000000007;
typedef pair<ll,ll>P;
typedef pair<int,P>Pa;
bool Inframe(int a,int b,int c,int d,int h,int w){
if(a+b>=0&&a+b<h&&c+d>=0&&c+d<w)return true;
return false;
}
ll mypow(ll x,int m){
if(m==0)return 1;
if(m%2==0){
int x2=mypow(x,m/2);
return x2*x2;
}else{
int x2=mypow(x,m/2);
return x2*x2*x;
}
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
ll dp[301][301][301]={};
ll n,k;
ll h[303];
P hd[303];
int d[303];
ll reg(ll m,ll hi,ll l){
if(dp[m][hi][l]!=-1)return dp[m][hi][l];
if(m==n)return 0;
ll res=INF,myhi=hd[hi].first;
if(hi==0)myhi=0;
res=min(res,reg(m+1,d[m+1],l)+max(0LL,h[m+1]-myhi));
if(l<k){
res=min(res,reg(m+1,hi,l+1));
}
return dp[m][hi][l]=res;
}
int main() {
memset(dp,-1,sizeof(dp));
cin>>n>>k;
h[0]=0;
hd[0]=P(1,0);
rep(i,1,n+1){
cin>>h[i];
hd[i]=P(h[i],i);
}
sort(hd,hd+n+1);
rep(i,0,n+1){
d[hd[i].second]=i;
}
cout<<reg(0,0,0)<<endl;
return 0;
}
| 0
| 44,783,641
|
#include <iostream>
#include <fstream>
#include<bits/stdc++.h>
using namespace std ;
using ll = long long ;
class BBreakNumber {
public:
void solve(std::istream& cin, std::ostream& cout) {
int n ;
cin >> n ;
int ans = 0 ;
for(int i = n ; i>=0 ; --i){
if(i && (!(i & (i - 1)))){
cout << i ;
return ;
}
}
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
BBreakNumber solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
|
#include<iostream>
#include<cstring>
using namespace std;
int H, W;
int grid[105][105], memo[105][105][2];
int findRoute(int row, int col, int black){
if(memo[row][col][black] != -1) return memo[row][col][black];
if(grid[row][col] == 1){
if(row == H && col == W) return black;
if(row == H) return memo[row][col][black] = findRoute(row, col+1, 0) + black;
if(col == W) return memo[row][col][black] = findRoute(row+1, col, 0) + black;
return memo[row][col][black] = min(findRoute(row+1, col, 0), findRoute(row, col+1, 0)) + black;
}
if(grid[row][col] == 0){
if(row == H && col == W) return 0;
if(row == H) return memo[row][col][black] = findRoute(row, col+1, 1) ;
if(col == W) return memo[row][col][black] = findRoute(row+1, col, 1) ;
return memo[row][col][black] = min(findRoute(row+1, col, 1), findRoute(row, col+1, 1)) ;
}
return 121;
}
int main(){
memset(grid, 0, sizeof(grid));
memset(memo, -1, sizeof(memo));
cin >> H >> W;
for(int i=1; i<=H; i++){
for(int j=1; j<=W; j++){
char c;
cin >> c;
if(c == '#') grid[i][j] = 1;
}
}
cout << findRoute(1, 1, 1) << endl;
}
| 0
| 88,086,597
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
int main(void)
{
int X, A, B; cin >> X >> A >> B;
if (A < B)
cout << (X < B - A ? "dangerous" : "safe") << endl;
else
cout << "delicious" << endl;
}
|
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <map>
#include <cstdio>
using namespace std;
#define prev prev55
long long n, t[50000], v[50000];
long long scale[50000];
int main()
{
fill(scale, scale + 50000, 1000000000000);
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) cin >> t[i];
for (int i = 0; i < n; i++) cin >> v[i];
for (int i = 0; i < n; i++) t[i] += t[i], v[i] += v[i];
int l = 0;
for (int i = 0; i <= 40000; i++) scale[i] = min(scale[i], (long long)i);
for (int j = 0; j < n; j++)
{
int r = l + t[j];
for (int i = l; i >= 0; i--)
{
scale[i] = min(scale[i], l - i + v[j]);
}
for (int i = l; i <= r; i++) scale[i] = min(scale[i], v[j]);
for (int i = r; i <= 40000; i++)
{
scale[i] = min(scale[i], i - r + v[j]);
}
l = r;
}
for (int i = l; i >= 0; i--) scale[i] = min(scale[i], (long long)l - i);
for (int i = l; i <= 40000; i++) scale[i] = 0;
long long summ = 0;
for (int i = 0; i <= 40000; i++)
{
summ += scale[i];
}
printf("%.9f", summ / 4.0);
}
| 0
| 57,632,177
|
#include<iostream>
#include<string>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<cmath>
using namespace std;
#define pi 3.141592653589793283462
int main(){
int n;
cin>>n;
int max;
int min;
long sum;
int a[10000];
cin>>a[0];
sum=a[0],max=a[0],min=a[0];
for(int i=1;i<=n-1;i++){
cin>>a[i];
sum+=a[i];
if(a[i]>max)
max=a[i];
if(a[i]<min)
min=a[i];
}
cout<<min<<" "<<max<<" "<<sum<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int x=0 ,y=0,m,n,i,j,k;
cin >> n >> m;
string s;
map<int,int>mp,mp1;
for(i = 0 ;i<m ;i++)
{
cin >> k >>s;
if(s == "AC" && mp1[k]==0)
{
x++;y+=mp[k];
mp1[k]=1;
}
else
mp[k]++;
}
cout<<x<<" "<<y<<endl;
}
| 0
| 52,700,990
|
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <math.h>
using namespace std;
using ll = long long;
using vl = vector<long long>;
using vll = vector<vector<long long>>;
using vs = vector<string>;
using vc = vector<char>;
using vcc = vector<vector<char>>;
using vm = vector<short>;
using vmm = vector<vector<short>>;
using pii = pair<int, int>;
using psi = pair<string, int>;
using ld = long double;
using ull = unsigned long long;
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 * b / gcd(a, b);
}
ll box(double a)
{
ll b = a;
return b;
}
ll fff(double a)
{
ll b = a + 0.5;
return b;
}
ll sum(ll n) {
if (n == 0) {
return 0;
}
int s = sum(n - 1);
return s + n;
}
bool prime(ll 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() {
ll a; cin >> a;
vl q(a);
for (int i = 0; i < a; i++) {
cin >> q[i];
}
sort(q.begin(), q.end());
if (q[a / 2] == q[a / 2 - 1]) {
cout << 0 << endl;
}
else {
cout << q[a / 2] - q[a / 2 - 1] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M; cin >> N >> M;
vector<vector<char>> A(N, vector<char>(N));
vector<vector<char>> B(M, vector<char>(M));
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) cin >> A.at(i).at(j);
}
for (int i = 0; i < M; i++) {
for (int j = 0; j < M; j++) cin >> B.at(i).at(j);
}
if (N == M) {
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if (A.at(i).at(j) != B.at(i).at(j)) {
cout << "No" << endl;
return 0;
}
}
}
cout << "Yes" << endl;
return 0;
}
for (int i = 0; i < N-M; i++) {
for (int j = 0; j < N-M; j++) {
bool flag = true;
for (int k = 0; k < M; k++) {
for (int l = 0; l < M; l++) {
if (A.at(i+k).at(j+l) != B.at(k).at(l)) {
flag = false;
break;
}
}
if (!(flag)) break;
}
if (flag) {
cout << "Yes" << endl;
return 0;
}
}
}
cout << "No" << endl;
}
| 0
| 77,350,576
|
#include<iostream>
#include<vector>
#include<math.h>
using namespace std;
int main(){
int N,D;
cin>>N>>D;
vector<vector<int>>X(N,vector<int>(D));
for(int i=0;i<=N-1;i++){
for(int j=0;j<=D-1;j++){
cin>>X[i][j];
}
}
int ansint=0;
double ansdouble=0;
int distance=0;
int ans=0;
for(int i=0;i<=N-2;i++){
for(int j=i+1;j<=N-1;j++){
distance=0;
for(int k=0;k<=D-1;k++){
distance+=(X[i][k]-X[j][k])*(X[i][k]-X[j][k]);
}
ansdouble=sqrt((double)distance);
ansint=(int)(ansdouble);
if((double)(ansint)==ansdouble){
ans++;
}
}
}
cout<<ans;
return 0;
}
|
#pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T> inline T chmax(T &a, const T b) {return a = (a < b) ? b : a;}
template <class T> inline T chmin(T &a, const T b) {return a = (a > b) ? b : a;}
constexpr int MOD = 1e9 + 7;
constexpr int inf = 1e9;
constexpr long long INF = 1e18;
constexpr double pi = acos(-1);
constexpr double EPS = 1e-10;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string s, t; cin>>s>>t;
int n = s.size();
int m = t.size();
vector<vector<int>> dp(n+1, vector<int>(m+1, 0));
for(int i=0; i<n; i++){
dp[i+1][0] = i + 1;
}
for(int i=0; i<m; i++){
dp[0][i+1] = i + 1;
}
for(int i=0; i<n; i++){
for(int j=0; j<m; j++){
dp[i+1][j+1] = min(dp[i][j+1] + 1, dp[i+1][j] + 1);
if(s[i] == t[j]){
chmin(dp[i+1][j+1], dp[i][j]);
}
else{
chmin(dp[i+1][j+1], dp[i][j] + 1);
}
}
}
cout << dp[n][m] << endl;
}
| 0
| 80,521,743
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <math.h>
#include <map>
#include <queue>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main()
{
int n, k;
cin >> n >> k;
ll ans = 0;
ll first, last;
for (int i = k; i <= n + 1; ++i) {
first = ll(i - 1) * ll(i) / ll(2);
last = (ll(n) + ll(n + 1 - i))*ll(i) / ll(2);
ans += last - first + 1;
ans %= ll(MOD);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for(int i=0; i<n; i++)
#define FOR(i, a, b) for(int i=a; i<b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first
#define se second
#define pb push_back
#define ALL(x) x.begin(), x.end()
#define V(T) vector<T>
typedef pair<int, int> P;
typedef pair<P, P> PP;
typedef vector<int> vi;
typedef vector<vi> vvi;
int max(int a, int b) {if(b>a) return b; else return a;}
int min(int a, int b) {if(b<a) return b; else return a;}
const int INF = 1e18;
signed main() {
int N;
cin >> N;
V(string) S(N);
cout << 0 << endl;
string t;
cin >> t;
S[0] = t;
if(t=="Vacant") return 0;
int l=0, r=N;
rep(i, 19) {
int mid = (l+r)/2;
cout << mid << endl;
string s;
cin >> s;
if(s=="Vacant") return 0;
S[mid] = s;
if(abs(mid-l)%2 && S[l]==s) r = mid;
else if(abs(mid-l)%2==0 && S[l]!=s) r = mid;
else if(abs(mid-r)%2 && S[r%N]==s) l = mid;
else if(abs(mid-r)%2==0 && S[r%N]!=s) l = mid;
}
return 0;
}
| 0
| 98,666,872
|
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<cmath>
#include<cstring>
#include<set>
#include<climits>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
#define uintmax UINT_MAX
#define ulmax ULONG_MAX
#define llmax LLONG_MAX
#define ll long long
#define rep(i,a,N) for((i)=(a);(i)<(N);(i)++)
#define rrp(i,N,a) for((i)=(N)-1;(i)>=(a);(i)--)
#define llfor ll i,j
#define sc(a) cin>>a
#define pr(a) cout<<a<<endl
#define pY puts("YES")
#define pN puts("NO")
#define py puts("Yes")
#define pn puts("No")
#define pnn printf("\n")
#define all(a) a.begin(),a.end()
#define push(a,b) (a).push_back(b)
#define llvec vector<vector<ll>>
#define charvec vector<vector<char>>
#define size(a,b) (a,vector<ll>(b))
#define llpvec vector<pair<ll,ll>>
double pi=acos(-1);
ll cei(ll x,ll y){ll ans=x/y;if(x%y!=0)ans++;return ans;}
ll gcd(ll x,ll y){return y?gcd(y,x%y):x;}
ll lcm(ll x,ll y){return x/gcd(x,y)*y;}
ll llpow(ll x,ll n){ll i,ans=1;rep(i,0,n)ans*=x;return ans;}
ll fact(ll x){ll i,ans=1;rep(i,0,x)ans*=(x-i);return ans;}
ll ncr(ll n,ll r){return fact(n)/fact(r)/fact(n-r);}
ll npr(ll n,ll r){return fact(n)/fact(n-r);}
bool prime(ll a){if(a<=1)return false;ll i;for(i=2;i*i<=a;i++){if(a%i==0)return false;}return true;}
ll fib(ll x){ll i,fibo[x+10];fibo[0]=1;fibo[1]=1;fibo[2]=1;rep(i,3,x+1)fibo[i]=fibo[i-1]+fibo[i-2];return fibo[x];}
ll dig(ll n){ll d=0,i=0;while(n/10>0){i++;d++;}return d;}
llfor;ll ans=0;
int main(){
ll n,r;
cin>>n>>r;
if(n<10)r+=100*(10-n);
pr(r);
return 0;}
|
#include <bits/stdc++.h>
using namespace std;
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; }
using ll = long long;
using P = pair<ll, ll>;
const long double PI = acos(-1.0L);
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; }
int m, nmin, nmax;
int main() {
while(1) {
cin >> m >> nmin >> nmax;
if(m == 0 && nmin == 0 && nmax == 0) break;
vector<int> pvec(m, 0);
for(int i = 0; i < m; ++i) {
cin >> pvec[i];
}
int ans = 0;
int num = 0;
for(int i = nmin; i <= nmax; ++i) {
int pass = pvec[i-1];
int npass = pvec[i];
int g = pass-npass;
if(ans <= g) {
num = i;
ans = g;
}
}
cout << num << endl;
}
}
| 0
| 88,335,616
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define mp make_pair
#define pb push_back
#define pf push_front
#define ss second
#define ff first
#define sz(x) (int)x.size()
#define newl "\n"
#define vi vector<int>
#define pii pair<int, int>
#define vii vector<pii>
#define vl vector<ll>
#define pll pair<ll, ll>
#define vll vector<pll>
#define coutp cout << fixed << setprecision(12)
#define mem(x, val) memset(x, val, sizeof(x))
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define all(v) (v).begin(), (v).end()
const ld pi = 3.14159265359;
ll INF = 1e18 + 10;
ll MOD = 998244353;
ll mod = 1e9 + 9;
inline ll add(ll a, ll b, ll m)
{
if ((a + b) >= m)
return (a + b) % m;
return a + b;
}
inline ll mul(ll a, ll b, ll m)
{
if ((a * b) < m)
return a * b;
return (a * b) % m;
}
ll power(ll x, ll y, ll m)
{
ll res = 1;
x = x % m;
if (x == 0)
return 0;
while (y > 0)
{
if (y & 1)
res = (res * x) % m;
y = y >> 1;
x = (x * x) % m;
}
return res;
}
vl a(51), p(51);
ll fun(ll n,ll x) {
if(n==0) {
return x<=0?0:1;
}
else if(x<=((ll)1+a[n-1])) {
return fun(n-1,x-1);
}
else {
return 1+p[n-1]+fun(n-1,x-2-a[n-1]);
}
}
void solve()
{
ll n,x;
cin>>n>>x;
a[0]=1;
p[0]=1;
for(int i=1;i<=n;i++) {
a[i]=2*a[i-1]+3;
p[i]=2*p[i-1]+1;
}
ll ans = fun(n,x);
cout<<ans;
}
int main()
{
fastio;
int t;
t = 1;
while (t-- > 0)
{
solve();
cout << newl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
long long n,k;
cin >> n >> k;
vector<int> a(n);
rep(i,n) cin >> a.at(i);
long long ans=0, count=0, num;
rep(i,n-1){
for(int j=n-1; j>i; j--) if(a.at(i)>a.at(j)) ans++;
}
ans*=k;
ans%=long(1e9+7);
sort(a.begin(),a.end(),greater<>());
long long b=n*(n-1)/2;
rep(i,n-1){
if(a.at(i)==a.at(i+1)) count++;
else count=0;
b-=count;
}
if(k%2){
b*=k;
b%=long(1e9+7);
b*=(k-1)/2;
b%=long(1e9+7);
}
else{
b*=k/2;
b%=long(1e9+7);
b*=k-1;
b%=long(1e9+7);
}
ans+=b;
ans%=long(1e9+7);
cout << ans << endl;
return 0;
}
| 0
| 31,101,231
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a,b,k; cin>>a>>b>>k;
vector<int> div(200);
int cnt=1;
for(int i=min(a,b);i>=1;i--) {
if(a%i==0&&b%i==0) {
div[cnt]=i;
cnt++;
}
}
cout<<div[k]<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
int main(){
ll k,a,b;
ll ans=1;
cin >> k >> a >> b;
if(b-a > 2){
int kaisu = max((ll)0,(k-(a-1))/2);
int tataku = k - kaisu*2;
ans = kaisu*(b-a) + tataku + 1;
}
else{
ans = k+1;
}
cout << ans << endl;
}
| 0
| 9,091,213
|
#include<stdio.h>
int main(){
int c,a,b;
scanf("%d%d",&a,&b);
if(a<b){
printf("a < b\n");
}
else if(a>b){
printf("a > b\n");
}
else if(a==b){
printf("a == b\n");
}
return 0;
}
|
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int mod = 1e9+7;
typedef pair<ll, ll> pairs;
typedef vector<pairs> p;
struct Edge{
ll to, weight;
Edge(ll t, ll w) : to(t), weight(w){}
};
using graph = vector<vector<ll>>;
using Graph = vector<vector<Edge>>;
ll gcd(ll a,ll b){
if(b == 0){
return a;
}else{
return gcd(b, a%b);
}
}
ll lcm(ll a, ll b){
return a / gcd(a, b) * b;
}
ll keta(ll N){
ll M = 1;
while( N > 0 ){
if(N / 10 == 0){
break;
}
N /= 10;
M++;
}
return M;
}
bool kai(string S){
bool flag = true;
for(ll i=0;i<S.size()/2;++i){
if(S[i] != S[S.size()-i-1]){
flag = false;
break;
}
}
return flag;
}
int main(){
ll n, m;
cin>>n>>m;
ll g[n][n];
for(ll i=0;i<n;++i){
for(ll j=0;j<n;++j){
if(i == j){
g[i][j] = 0;
}else{
g[i][j] = INF;
}
}
}
vector<ll> a(m), b(m), c(m);
for(ll i=0;i<m;++i){
cin>>a[i]>>b[i]>>c[i];
a[i]--;
b[i]--;
g[a[i]][b[i]] = min(g[a[i]][b[i]], c[i]);
g[b[i]][a[i]] = min(g[b[i]][a[i]], c[i]);
}
for(ll k=0;k<n;++k){
for(ll i=0;i<n;++i){
for(ll j=0;j<n;++j){
g[i][j] = min(g[i][j], g[i][k] + g[k][j]);
}
}
}
ll ans = m;
for(ll i=0;i<m;++i){
bool flag = false;
for(ll j=0;j<n;++j){
if(g[j][a[i]] + c[i] == g[j][b[i]]){
flag = true;
}
}
if(flag){
ans--;
}
}
cout<<ans<<endl;
return 0;
}
| 0
| 42,982,989
|
#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 ALL(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
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; }
int main() {
string N;
cin >> N;
long long K;
cin >> K;
long long dp[110][2][110];
REP(i, N.size()) REP(j, 2) REP(k, 110) dp[i][j][k] = 0;
dp[0][0][0] = 1;
REP(i, N.size()) {
const int D = N[i] - '0';
REP(j, 2) {
REP(k, 100) {
for(int d = 0; d <= (j ? 9 : D); d++) {
dp[i+1][j || (d < D)][k + (d == 0 ? 0 : 1)] += dp[i][j][k];
}
}
}
}
cout << dp[N.size()][0][K] + dp[N.size()][1][K] << endl;
return 0;
}
|
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include<cstdio>
#include<algorithm>
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
int main() {
int N, K;
scanf("%d", &N);
scanf("%d", &K);
int H[302] = {};
rep1(i, N) scanf("%d", H + i);
ll hutuu = 0;
rep(i, N + 1) {
if (H[i + 1] > H[i]) hutuu += H[i + 1] - H[i];
}
ll dp[302][301] = {};
rep(i, N + 1) {
auto dpi = dp[i];
ll tmp1 = max(0, H[i + 1] - H[i]);
ll tmp2 = max(0, H[i] - H[i + 1]);
ll tmp3 = min(tmp1, tmp2);
int mae = H[i + 1];
ll maetmp = tmp3;
for (int j = i + 2; j <= N + 1; j++) {
if (mae < H[j]) tmp1 += H[j] - mae;
if (mae > H[j]) tmp2 += mae - H[j];
tmp3 = min(tmp1, tmp2);
if (maetmp < tmp3) {
int k = j - i - 1;
auto dpj = dp[j] + k;
rep(p, K - k + 1) chmax(dpj[p], dpi[p] + tmp3);
}
mae = H[j];
maetmp = tmp3;
}
auto dpi2 = dp[i + 1];
rep(p, K + 1) chmax(dpi2[p], dpi[p]);
}
printf("%lld", hutuu - dp[N + 1][K]);
Would you please return 0;
}
| 0
| 90,937,967
|
#include <climits>
#include <iostream>
#include <string>
#include <cmath>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
class NumberString {
public:
static UInt Digits(Int number) {
return to_string(number).length();
}
};
int main(void) {
Int n;
cin >> n;
Int sq = sqrt(n);
Int ans = INT_MAX;
for (Int i = 1; i <= sq; ++i) {
if (n % i != 0) {
continue;
}
Int len = NumberString::Digits(max(i, n / i));
ans = min(ans, len);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e << std::endl;}
template<typename T> void view(const std::vector<T>& v){for(const auto& e : v){ std::cout << e << " "; } std::cout << std::endl;}
template<typename T> void view(const std::vector<std::vector<T> >& vv){ for(const auto& v : vv){ view(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 (b<a) { a=b; return 1; } return 0; }
const int MOD = 1000000007;
const int INF = 1e9;
const int mod = 1000000007;
const int inf = 1e9;
#define PI acos(-1);
int dx[4] = {1,-1,0,0};
int dy[4] = {0,0,1,-1};
int ddx[8] = {1,1,1,-1,-1,-1,0,0};
int ddy[8] = {0,1,-1,0,1,-1,1,-1};
int main(){
int n;
map<int, int> mp;
cin >> n;
for(int i = 0; i < n; i++) {
int a;
cin >> a;
mp[a]++;
}
int ans = 0;
for(auto a : mp) {
if(a.second>=a.first) ans += a.second - a.first;
else ans += a.second;
}
cout << ans << endl;
}
| 0
| 82,680,560
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#define ll long long int
#define pb push_back
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
using namespace std;
int mx8[] = {0,0,1,-1,-1,1,-1,1};
int my8[] = {-1,1,0,0,-1,-1,1,1};
int mx4[] = {1,-1,0,0};
int my4[] = {0,0,-1,1};
const int MOD = 1000000007;
const int D = 60;
const int max_n = 200005;
ll cal(ll a, ll b, ll k){
ll n = (k-(a-1))/2;
if(b-a-2ll>0){
return (b-a-2ll) * n + k + 1ll;
}else{
return k + 1ll;
}
}
int main() {
ll k, a, b; cin >> k >> a >> b;
ll ans = cal(a, b, k);
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
while(scanf("%d%d",&a,&b)==2)
{
if(a<b)
{
cout<<"a < b"<<endl;
}
else if(a>b)
{
cout<<"a > b"<<endl;
}
else
{
cout<<"a == b"<<endl;
}
}
return 0;
}
| 0
| 43,839,813
|
#include<bits
using namespace std;
typedef long long ll;
#define req(i,n) for(int i = 1;i <= n;i++)
#define ALL(a) (a).begin(),(a).end()
ll n,m, ans = 0;
int main() {
cin >> n >> m; priority_queue<int> pq; int a, b,j =0;
vector<pair<int, int>> v;
req(i, n) {
cin >> a >> b;
v.push_back(make_pair(a, b));
}sort(ALL(v));
req(i, m) {
for(;j < n;j++) {
if (v[j].first <= i) {
pq.push(v[j].second); continue;
}
break;
}
if (!pq.empty()) ans += pq.top(), pq.pop();
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int64_t MOD = 1000000007;
int64_t MAX = 9223372036854775807;
double PI = 3.141592653589793;
int main()
{
string S;
cin >> S;
map<char, int> list;
for (int i = 0; i < S.size(); i++)
list[S[i]]++;
bool x = true;
for (auto y = 'a'; y <= 'z'; y++)
if (list.find(y) == list.end())
{
cout << y;
x = false;
break;
}
if (x)
cout << "None";
}
| 0
| 35,058,515
|
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cstdio>
#include<set>
using namespace std;
int a[10000000];
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;
}
int main(){
int T=read();
for(int i=0;i<2*T;i++){
a[i]=read();
}
sort(a,a+2*T);
long long ans=0;
for(int i=0;i<2*T;i=i+2)
{
ans=ans+min(a[i],a[i+1]);
}
cout<<ans<<endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ALLv(a) (a).begin(),(a).end()
#define ALL(a,n) (a),(a)+n
#define vi vector<long long>
#define vd vector<long double>
#define vs vector<string>
#define INF 1010000000000000017LL
#define MOD 1000000007LL
#define EPS 1e-12
#define PI 3.14159265358979323846
#define FOR(i,m,n) for(ll (i)=(m); (i)<(n); (i)++)
#define REP(i,n) for(ll (i)=0; (i)<(n); (i)++)
#define REPS(i,x) for(ll (i)=1; (i)<=(x); (i)++)
#define RREP(i,x) for(ll (i)=(x)-1; (i)>=0; (i)--)
#define RREPS(i,x) for(ll (i)=(x); (i)> 0; (i)--)
#define WREP(i,in,j,jn) REP(i,in)REP(j,jn)
#define dcml(n) fixed<<setprecision(n)
using namespace std;
struct _RLE{ char c; ll len; };
vector<_RLE> RLE(string S){
ll N=S.size();
vector<_RLE> v;
char prev=S[0];
for(ll i=1,cnt=1;i<=N;i++){
if(i==N){
v.push_back({prev,cnt});
break;
}
while(S[i]==prev){cnt++;i++;}
v.push_back({prev,cnt});
cnt=1;prev=S[i];
}
return v;
}
int main(void){
string S;ll K;cin>>S>>K;
ll c1=0;
vector<_RLE> v=RLE(S);
for(auto r:v){
if(r.len>=2){
c1+=r.len/2;
}
}
ll c2=0;
if(v[v.size()-1].c==v[0].c){
c2+=v[v.size()-1].len/2+v[0].len/2-(v[v.size()-1].len+v[0].len)/2;
}
ll ans=0;
if(v.size()==1)ans=S.size()*K/2;
else{
ans-=c2*(K-1);
ans+=c1*K;
}
cout<<ans<<"\n";
}
| 0
| 100,175,643
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<vector<pair<int,int>>> data(n+1,vector<pair<int,int>>(0));
for (int i=1;i<=m;i++){
int p,y;
cin>>p>>y;
pair<int,int> tmp=make_pair(y,i);
data.at(p).push_back(tmp);
}
for (int i=1;i<=n;i++){
sort(data.at(i).begin(),data.at(i).end());
}
vector<string> answer(m+1);
for (int i=1;i<=n;i++){
int provsize=int(data.at(i).size());
for (int j=0;j<provsize;j++){
string formerstring="";
string latterstring="";
string formernumber=to_string(i);
string latternumber=to_string(j+1);
for (int k=0;k<(6-int(formernumber.size()));k++){
formerstring+="0";
}
formerstring+=formernumber;
for (int k=0;k<(6-int(latternumber.size()));k++){
latterstring+="0";
}
latterstring+=latternumber;
answer.at(data.at(i).at(j).second)=(formerstring+latterstring);
}
}
for (int i=1;i<=m;i++){
cout<<answer.at(i)<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
const int nmax = 1000;
char table[nmax][nmax];
int bfs(int H,int W){
queue<P> q;
P pos;
int n_x,n_y,x,y,count1,count2,ans;
int direction[4][2] = {{1,0},{-1,0},{0,1},{0,-1}};
count1 = 0;
count2 = 0;
ans = 0;
for(int y = 0;y < H;y++){
for(int x = 0;x < W;x++){
if(table[y][x] == '#'){
q.push(P(x,y));
count1++;
}
}
}
while(!q.empty()){
pos = q.front();
q.pop();
count1--;
n_x = pos.first;
n_y = pos.second;
for(int i = 0;i < 4;i++){
x = n_x + direction[i][0];
y = n_y + direction[i][1];
if(x < 0 || W <= x || y < 0 || H <= y) continue;
if(table[y][x] == '#') continue;
table[y][x] = '#';
q.push(P(x,y));
count2++;
}
if(count1 == 0){
ans++;
count1 = count2;
count2 = 0;
}
}
return --ans;
}
int main(){
int H,W;
cin >> H >> W;
for(int y = 0;y < H;y++){
for(int x = 0;x < W;x++){
cin >> table[y][x];
}
}
cout << bfs(H,W) << endl;
}
| 0
| 83,944,607
|
#include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<set>
using namespace std;
#define int long long
#define REP(i,s,e) for((i)=(s);(i)<(e);(i)++)
#define RREP(i,s,e) for((i)=((s)-1);(i)>=(e);(i)--)
#define FOR(i,n) for((i)=(0);(i)<(n);(i)++)
#define RFOR(i,n) for((i)=((n)-1);(i)>=(0);(i)--)
#define MOD 1000000007
signed main(){
int X,A;
cin>>X>>A;
cout<<max(0ll,X-A)<<endl;
}
|
#include <cstdio>
#include <set>
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
using namespace std;
#define ll long long
const ll N = 1000000000;
int main(){
int h, w;
cin >> h >> w;
vector<vector<int> > ar(h), dp(h);
for (int i = 0; i < h; ++i) {
dp[i].resize(w, N);
for (int j = 0; j < w; ++j) {
char c; cin >> c;
dp[i][j] = c == '.' ? 0 : 1;
}
}
for (int i = 0; i < h; ++i) {
ar[i].resize(w, N);
for (int j=0;j<w;++j) {
if (i + j == 0) ar[i][j] = dp[i][j];
else {
if (i) {
int c = dp[i - 1][j] != dp[i][j] && dp[i][j];
ar[i][j] = min(ar[i-1][j] + c, ar[i][j]);
}
if (j) {
int c = dp[i][j - 1] != dp[i][j] && dp[i][j];
ar[i][j] = min(ar[i][j-1] + c, ar[i][j]);
}
}
}
}
cout << ar[h - 1][w - 1];
return 0;
}
| 0
| 41,350,377
|
#include<bits/stdc++.h>
using namespace std;int n,i,j,k[9999999];main(){scanf("%d",&n);for (i=0; i<n;i++){scanf("%d",&k[i]);}sort(k,k+n);for (i=0;i<n;i++){if(i){printf(" ");}printf("%d",k[i]);}printf("\n");}
|
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<vector>
#include<queue>
#include<map>
#include<functional>
#include<cstring>
using namespace std;
int main() {
int n,k;
int num[100001] = {0};
while(scanf("%d%d",&n,&k),(n|k)){
memset(num,0,sizeof(num));
for(int i = 0; i < n; i++){
scanf("%d",&num[i]);
}
int sum = 0;
for(int i = 0; i < k; i++){
sum += num[i];
}
int tmp = sum;
for(int i = k; i < n; i++){
tmp += num[i];
tmp -= num[i-k];
sum = max(sum,tmp);
}
printf("%d\n",sum);
}
return 0;
}
| 0
| 36,140,777
|
#define DEBUG
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define IOS { ios :: sync_with_stdio(false); cin.tie(0); cout.tie(0); }
#ifdef DEBUG
#define dbg(s) {s;}
#endif
#ifndef DEBUG
#define dbg(s)
#endif
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int grand(int x) {
return uniform_int_distribution<int>(0, x - 1)(rng);
}
#define int ll
#define i32 int32_t
#define RBTTYPE int
#define ordered_set tree<RBTTYPE, null_type, less<RBTTYPE>, rb_tree_tag,tree_order_statistics_node_update>
#define all(v) (v).begin(),(v).end()
typedef long long ll;
typedef long double ld;
typedef pair< int, int > pii;
typedef pair< ll, ll > pll;
int getInt () {
bool minus = false;
int result = 0;
char ch;
ch = getchar();
while (true) {
if (ch == '-') break;
if (ch >= '0' && ch <= '9') break;
ch = getchar();
}
if (ch == '-') minus = true; else result = ch-'0';
while (true) {
ch = getchar();
if (ch < '0' || ch > '9') break;
result = result*10 + (ch - '0');
}
if (minus)
return -result;
else
return result;
}
ll gcd(ll x, ll y) {
if (x < y) return gcd(y, x);
if (y == 0) return x;
return gcd(y, x % y);
}
const ll mod = 1e9 + 7;
ll modexp(ll x, ll ex) {
ll ans = 1ll;
while (ex > 0) {
if (ex & 1ll) ans = (ans * x) % mod;
ex >>= 1ll;
x = (x * x) % mod;
}
return ans;
}
const int maxn = 1e6 + 7;
const ll inf = 1e9 + 7;
i32 main() {
IOS;
int n; cin >> n; n += n;
string s; cin >> s; int t = 1, op = 0, cur = 0;
for (int j = 0; j < n; j++) {
int d = (s[j] == 'B');
if (d == cur) { t *= op; op--; cur ^= 1; }
else { op++; cur ^= 1; }
t %= mod;
}
if (op > 0) { cout << 0 << endl; return 0; }
for (int j = 1; j <= n/2; j++) t = (t * j) % mod;
cout << t << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> l_l;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
const int INF=1001001000;
const int mINF=-1001001000;
const ll LINF=1010010010010010000;
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;
}
int k;
vl a(110000);
ll s,e;
int main(){
cin>>k;
rep(i,k) cin>>a[i];
s=2,e=2;
int idx=k-1;
bool ng=false;
if(s%a[idx]!=0){
cout<<-1<<endl;
return 0;
}
else{
while(1){
e+=a[idx]-1;
idx--;
if(idx<0) break;
ll cnt=e/a[idx]-s/a[idx];
if(s%a[idx]==0){
cnt++;
}
else s=(s/a[idx]+1)*a[idx];
if(cnt==0){
ng=true;
break;
}
e=(e/a[idx])*a[idx];
}
}
if(ng) cout<<-1<<endl;
else cout<<s<<" "<<e<<endl;
return 0;
}
| 0
| 83,440,562
|
#include <bits/stdc++.h>
using namespace std;
int main(){
char c;
cin>>c;
string ans = "consonant";
if(c=='a'||c=='i'||c=='u'||c=='e'||c=='o'){
ans = "vowel";
}
cout<<ans<<endl;
}
|
#include <iostream>
using namespace std;
int main() {
while(true) {
string s;
cin >> s;
if (s == "-")
break;
int count;
cin >> count;
for (int i = 0; i < count; i++) {
unsigned long h;
cin >> h;
s = s.substr(h) + s.substr(0,h);
}
cout << s << endl;
}
return 0;
}
| 0
| 93,275,219
|
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <tuple>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repd(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define repdm(i, a, b) for (ll i = (ll)(a); i > (ll)(b); i--)
int main()
{
ll N, K;
cin >> N >> K;
ll ans = 0;
if (K % 2 == 1)
{
ll num = floor(N / K);
ans += pow(num, 3);
}
else if (K % 2 == 0)
{
ll num = floor(N / (K / 2));
ll numK = floor(N / K);
ans += pow(numK, 3);
ans += pow(num - numK, 3);
}
cout << ans;
}
|
#include <bits/stdc++.h>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cctype>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <functional>
using namespace std;
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define REP(i,n) for(ll 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--)
inline bool EQ(double a, double b) { return fabs(a-b) < 1e-9; }
const int INF = 1<<29;
typedef long long int ll;
inline int two(int n) { return 1 << n; }
inline int test(int n, int b) { return (n>>b)&1; }
inline void set_bit(int & n, int b) { n |= two(b); }
inline void unset_bit(int & n, int b) { n &= ~two(b); }
inline int last_bit(int n) { return n & (-n); }
inline int ones(int n) { int res = 0; while(n && ++res) n-=n&(-n); return res; }
template<class T> void chmax(T & a, const T & b) { a = max(a, b); }
template<class T> void chmin(T & a, const T & b) { a = min(a, b); }
const int MOD=1000000007;
#define pp pair<ll,ll>
bool isPowerOfTwo (ll x)
{
return x && (!(x&(x-1)));
}
bool isPrime(int n)
{
if (n <= 1) return false;
if (n <= 3) return true;
if (n%2 == 0 || n%3 == 0) return false;
for (int i=5; i*i<=n; i=i+6)
if (n%i == 0 || n%(i+2) == 0)
return false;
return true;
}
int highestPowerof2(unsigned int n)
{
if (n < 1)
return 0;
int res = 1;
for (int i=0; i<8*sizeof(unsigned int); i++)
{
int curr = 1 << i;
if (curr > n)
break;
res = curr;
}
return res;
}
long long binpow(long long a, long long b) {
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
const int dx[] = {1,0,-1,0,1,1,-1,-1};
const int dy[] = {0,-1,0,1,1,-1,-1,1};
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t=1;
while(t--)
{
ll n;
cin>>n;
ll a[n];
map<ll,ll> mp;
ll sum=0;
REP(i,n)
{
cin>>a[i];
mp[a[i]]++;
sum+=a[i];
}
sort(a,a+n);
ll ans=1;
for(int i=n-2;i>=0;i--)
{
sum-=a[i+1];
if(sum*2 < a[i+1])break;
ans++;
}
cout<<ans;
}
return 0;
}
| 0
| 81,825,785
|
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#define shosu(x) fixed<<setprecision(x)
using namespace std;
int main(){
int num,tmp,money=100000;
cin>>num;
for(int i=0;i<num;i++){
money*=1.05;
tmp=money%1000;
if(tmp>0) money=money-tmp+1000;
}
cout<<money<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int S = (1 << 17);
ll k, tab[S], min_p, max_p;
int main(){
cin >> k;
for (int i = 1; i <= k; i ++)
cin >> tab[i];
min_p = max_p = 2;
for (int i = k; i >= 1; i --){
min_p = ((min_p - 1) / tab[i] + 1) * tab[i];
max_p = max_p / tab[i] * tab[i] + tab[i] - 1;
}
if (max_p < min_p)
cout << -1 << endl;
else
cout << min_p << " " << max_p << endl;
return 0;
}
| 0
| 26,928,922
|
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#include<limits.h>
#include<float.h>
#include<list>
#include <array>
#include <complex>
#include<stdio.h>
#include<string.h>
#include <bitset>
using namespace std;
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(),(x).end()
template<typename T> void DEBUG(T e){if(DEBUG_OUT == false)return; std::cout << e <<" ";}
template<typename T> void DEBUG(const std::vector<T>& v){if(DEBUG_OUT == false)return;for(const auto& e : v){std::cout<< e << " "; } std::cout << std::endl;}
template<typename T> void DEBUG(const std::vector<std::vector<T> >& vv){if(DEBUG_OUT == false)return;for(const auto& v : vv){ DEBUG(v); } }
template<class T,class... Ts> void DEBUG(T d, Ts... e){if(DEBUG_OUT == false)return;DEBUG(d);DEBUG(e...);}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
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); }
void solve(void)
{
double N,M,D;
cin>>N>>M>>D;
double X;
if(D == 0)
{
X = 1.0/N;
}
else
{
X = 2*(N - D)/N/N;
}
cout<<(M-1)*X<<endl;
return;
}
int32_t main(int32_t argc, const char *argv[])
{
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(9);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 3000 + 50;
const int mod = 1e9 + 7;
int n,k;
int h[N];
ll dp[N][N];
int main()
{
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++i)
scanf("%d", h + i);
if (n == k)
{
puts("0");
return 0;
}
memset(dp, 0x3f, sizeof dp);
dp[0][0] = 0;
for (int i = 1; i <= n; ++i)
for (int l = 1; l <= n - k; ++l)
for (int j = 0; j < i; ++j)
dp[i][l] = min(dp[i][l], dp[j][l - 1] + max(0, h[i] - h[j]));
ll ans = 1e18;
for (int i = 1; i <= n; ++i)
ans = min(ans, dp[i][n - k]);
printf("%lld\n", ans);
return 0;
}
| 0
| 19,612,930
|
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <regex>
#define rep(i,n) for(int i = 0; i < n; i++)
#define reps(i,j,n) for(int i = j; i < n; i++)
#define rrep(i,j,n) for(intr i = j-1; i >= n; i--)
#define prec(n) fixed << setprecision(n)
#define print64_t_array(v) rep(__k, v.size()) { cout << v[__k]; if(__k != v.size()-1) cout << " "; else cout << endl; }
#define YesorNo(a) print64_tf(a?"Yes\n":"No\n")
#define MOD 1e+7
#define inf 1e9
#define fi first
#define se second
using namespace std;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t n;
cin >> n;
map<int64_t, int64_t, greater<int64_t>> mp;
rep(i,n) {
int64_t a;
cin >> a;
mp[a]++;
}
int64_t res = 1, idx = 2;
for(auto P : mp) {
int64_t f = P.fi;
int64_t s = P.se / 2;
while(s > 0 && idx > 0) {res *= f; s--; idx--;}
}
if(idx == 2) res = 0;
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using pint = pair<int, int>;
int main()
{
ll n;
cin >> n;
int s = sqrt(n) + 1;
while (s--)
{
if (n % s == 0)
{
cout << s + (n / s) - 2 << endl;
return 0;
}
}
}
| 0
| 94,107,981
|
#include <iostream>
#include <string>
using namespace std;
int main() {
int d[26] = { 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0 };
while( true ) {
string in;
cin >> in;
if ( in == "#" ) break;
long long int h = d[ in[0] - 'a' ];
long long int ans = 0;
for ( long long int i = 0; i < in.size(); i++ ) {
long long int k = d[ in[i] - 'a' ];
if ( h != k ) ans++;
h = k;
}
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
#include <math.h>
#include <numeric>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <queue>
#include <queue>
#include <stack>
#include <sstream>
#include <set>
typedef long long ll;
const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};
const int dr[4] = {-1, 0, 1, 0};
const int dc[4] = { 0, 1, 0,-1};
const int INF = 1e9;
#define FOR(i, a, n) for(int i = (int)(a); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define SORT(a) sort(a.begin(),a.end())
#define REVERSE(a) reverse(a.begin(),a.end())
int guki (int a){
if(a%2==0) return 0;
else return 1;
}
int gcd(int a, int b){
if(a%b==0){
return b;
}else{
return (gcd(b,a%b));
}
}
int lcm(int a, int b){
int x = gcd(a,b);
return (a*b/x);
}
using namespace std;
struct UnionFind {
vector<int> d;
UnionFind(int n=0) : d(n,-1){}
int Find (int x){
if(d[x] < 0) return x;
return d[x] = Find(d[x]);
}
bool unite (int x, int y){
x = Find(x); y = Find(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 Find(x) == Find(y);
}
int size(int x) {
return (-d[Find(x)]);
}
};
ll nCr (ll n, ll r){
ll ans = 1;
for(ll i = n ; i > n-r ; i --){
ans *= i;
}
for(ll i = 1 ; i<= r; i ++){
ans /= i;
}
return ans ;
}
int nPr (int n,int r){
int ans = 1;
for(int i = n ; i > n-r ; i --){
ans *= i;
}
return ans ;
}
ll modd = 1e9+ 7;
ll wa (ll n,ll mi, ll ma){
ll ans = n * (mi+ma) /2;
return ans;
}
ll kw(ll k,ll n){
ll ans =0;
ll mi,ma;
mi= wa(k,0,k-1);
ma = wa(k,n-k+1,n);
return (ma-mi +1)%modd;
}
ll mo = 1000000000+7;
ll powmod (int n,int k){
ll res = 1;
for(int i = 0; i < k ; i++){
res = res * n %mo;
}
return res;
}
int main(){
int n;
cin >> n;
vector<int> vec(n),dp(n);
REP(i,n){
cin >> vec[i];
}
dp[0] = 0;
dp[1] = abs(vec[1] - vec[0]);
for(int i = 2;i<n;i++){
dp[i] = min((dp[i-1]+abs(vec[i]-vec[i-1])), (dp[i-2]+ abs(vec[i]-vec[i-2])));
}
cout << dp[n-1] <<endl;
}
| 0
| 73,833,735
|
#include<bits/stdc++.h>
using namespace std;
int main(){
cin.sync_with_stdio(false);
cin.tie(0);
long long int n, a1, b;
cin >> n >> a1 >> b;
int flag = 0;
if(n == a1){
if(b == 1){
for(int i = 0; i < n; i++){
cout << i+1 << " ";
}
cout << '\n';
return 0;
}
else{
flag = 1;
}
}
if(n == b){
if(a1 == 1){
for(int i = 0; i < n; i++){
cout << n-i << " ";
}
cout << "\n";
return 0;
}
else{
flag = 1;
}
}
if(a1 == 1 && b != n) flag = 1;
if(a1 != n && b == 1) flag = 1;
if(a1 > n || b > n){
flag = 1;
}
if(flag == 1){
cout << "-1\n";
return 0;
}
int a[n];
for(int i = 0; i < n; i++){
a[i] = i;
}
for(int j = 0; j < b; j++){
if(j > b-1-j){
break;
}
swap(a[j], a[b-1-j]);
}
int x = 1;
int rem = a1-1;
int div = (n-b)/rem;
int count = (n-b)%rem;
if(div > b){
cout << "-1\n";
return 0;
}
for(int i = b; i < n;){
x++;
int l = n - i;
long long int size = div;
if(count > 0){
size = min(size+count, b);
count -= size - div;
}
for(int j = 0; j < size; j++){
if(i+j > min(n,i+size)-1-j){
break;
}
swap(a[i+j], a[min(n,i+size)-1-j]);
}
i += size;
}
if(x != a1){
cout << "-1\n";
return 0;
}
for(int i = 0; i < n; i++){
cout << a[i]+1 << ' ';
}
cout << '\n';
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < (long long)n; i++)
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using Vl = vector<ll>;
using vi = vector<int>;
using Graph = vector<vi>;
ll COM(int n, int k) {
ll res = 1;
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
for (int i = 0; i < k; i++) {
res *= (n - i);
res /= (i + 1);
}
return res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, odd = 0, even = 0, ans = 0;
int P;
cin >> N >> P;
vi A(N);
REP(i, N) {
cin >> A.at(i);
if (A.at(i) % 2 == 0)
even++;
else
odd++;
}
ll ALL = (ll)pow(2, N), allevens = (ll)pow(2, even);
REP(i, odd + 1) {
if (i % 2 == 0) continue;
ans += COM(odd, i) * allevens;
}
if (P == 1)
cout << ans << endl;
else
cout << ALL - ans << endl;
}
| 0
| 56,901,737
|
#include <iostream>
using namespace std;
int main(void){
int n;
int b, f, r, v;
int count[4][3][10];
for(int i=0;i<4;i++)
for(int j=0;j<3;j++)
for(int k=0;k<10;k++)
count[i][j][k]=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>b>>f>>r>>v;
count[b-1][f-1][r-1]+=v;
}
for(int i=0;i<4;i++){
for(int j=0;j<3;j++){
for(int k=0;k<10;k++)
cout<<" "<<count[i][j][k];
cout<<endl;
}
if(i!=3)printf("####################\n");
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long ll;
int main(){
ll n,k,t,d;
cin>>n>>k;
vector<pair<ll,ll>> A,B,C;
int var[200001]={0};
rep(i,n) cin>>t>>d,A.push_back(make_pair(d,t));
sort(A.begin(),A.end(),greater<pair<ll,ll>>());
rep(i,k) B.push_back(A[i]),var[A[i].second]++;
rep(i,n-k) C.push_back(A[i+k]);
reverse(B.begin(),B.end());
ll c=0,ans=0,sum=0,x=0;
rep(i,k) sum+=B[i].first;
rep(i,n) if(var[i+1]) x++;
ans=sum+x*x;
rep(i,k){
if(var[B[i].second]>1){
while(c<n-k&&var[C[c].second]!=0) c++;
if(c==n-k) break;
var[B[i].second]--;
sum-=B[i].first;
B[i].first=C[c].first;
B[i].second=C[c].second;
var[B[i].second]++;
sum+=B[i].first;
x++;
}
ans=max(ans,sum+x*x);
}
cout<<ans;
}
| 0
| 57,951,392
|
#include <iostream>
#include <vector>
#include <unordered_map>
#include <numeric>
using namespace std;
int main() {
long n,x,m;
cin >> n >> x >> m;
int k = log2(n) + 1;
vector tb(k+1, vector(m, -1LL));
vector sum(k+1, vector(m, 0LL));
unordered_map<long,bool> mp;
for (long i=0; i<m; i++) tb[0][i] = i*i % m;
iota(sum[0].begin(), sum[0].end(), 0);
for (int i=0; i<k; i++) {
for (int j=0; j<m; j++) {
if (tb[i][j] == -1) tb[i+1][j] = -1;
else {
sum[i+1][j] = sum[i][j] + sum[i][tb[i][j]];
tb[i+1][j] = tb[i][tb[i][j]];
}
}
}
long ans = 0;
for (int i=0; i<=k; i++) {
if ((n>>i) & 1) {
ans += sum[i][x];
x = tb[i][x];
}
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef vector<ll> vll ;
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(v) (v).begin(),(v).end()
#define precision(k) cout<<setprecision(k)<<fixed;
#define loop(i,a,b) for(ll i=(a);i<(b);++i)
#define minv(v) *min_element(all(v))
#define maxv(v) *max_element(all(v))
#define getpos(v,x) (lower_bound(v.begin(),v.end(),x)-v.begin())
#define unq(v) sort(all(v)),(v).erase(unique((v).begin(),(v).end()),(v).end())
#define pb push_back
#define mp make_pair
#define pi 3.14159265358979323
#define endl "\n"
int main()
{
IOS;
int n, num;
cin>>n;
vector<int> arr, brr;
loop(i, 0, n){
cin>>num;
arr.pb(num);
}
brr = arr;
sort(all(arr), greater<int>());
loop(i, 0, n){
if(brr[i] == arr[0])
cout<<arr[1]<<endl;
else
cout<<arr[0]<<endl;
}
}
| 0
| 16,449,040
|
#include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); i++)
using namespace std;
int main() {
string s;
cin >> s;
int n = s.size();
bool ok = true;
if (s[0] != 'A') ok = false;
rep(i,26) if (s[1] == 'A' + i || s[n-1] == 'A' + i) ok = false;
string t = s.substr(2,n-3);
int cnt = 0;
rep(i,t.size()) {
if (t[i] == 'C') cnt++;
rep(j,26) {
if (t[i] == 'A' + i && t[i] != 'C') ok = false;
}
}
if (cnt != 1) ok = false;
if (ok)
cout << "AC" << endl;
else
cout << "WA" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define Int int64_t
#define dump(x) cout << (x) << endl
#define fi first
#define se second
Int mod = 1e9+7;
Int INF = 1e18;
double EPS = 0.00000001;
int main() {
Int n;
cin >> n;
string s;
cin >> s;
vector<bool> t(n);
t[0] = true;
if (s[0] == 'o') {
t[1] = t[n - 1] = true;
}
else {
t[1] = true;
t[n - 1] = false;
}
for (Int i = 2; i < n - 1; i++) {
if (t[i - 1]) {
if (s[i - 1] == 'o') {
t[i] = t[i - 2];
}
else {
t[i] = !t[i - 2];
}
}
else {
if (s[i - 1] == 'o') {
t[i] = !t[i - 2];
}
else {
t[i] = t[i - 2];
}
}
}
bool check = true;
for (Int i = 0; i < n; i++) {
if (t[i]) {
if (s[i] == 'o') {
if (t[(n + i - 1) % n] != t[(n + i + 1) % n]) check = false;
}
else {
if (t[(n + i - 1) % n] == t[(n + i + 1) % n]) check = false;
}
}
else {
if (s[i] == 'o') {
if (t[(n + i - 1) % n] == t[(n + i + 1) % n]) check = false;
}
else {
if (t[(n + i - 1) % n] != t[(n + i + 1) % n]) check = false;
}
}
}
if (check) {
for (Int i = 0; i < n; i++) cout << (t[i] ? 'S' : 'W');
cout << endl;
return 0;
}
t[0] = true;
if (s[0] == 'o') {
t[1] = t[n - 1] = false;
}
else {
t[1] = false;
t[n - 1] = true;
}
for (Int i = 2; i < n - 1; i++) {
if (t[i - 1]) {
if (s[i - 1] == 'o') {
t[i] = t[i - 2];
}
else {
t[i] = !t[i - 2];
}
}
else {
if (s[i - 1] == 'o') {
t[i] = !t[i - 2];
}
else {
t[i] = t[i - 2];
}
}
}
check = true;
for (Int i = 0; i < n; i++) {
if (t[i]) {
if (s[i] == 'o') {
if (t[(n + i - 1) % n] != t[(n + i + 1) % n]) check = false;
}
else {
if (t[(n + i - 1) % n] == t[(n + i + 1) % n]) check = false;
}
}
else {
if (s[i] == 'o') {
if (t[(n + i - 1) % n] == t[(n + i + 1) % n]) check = false;
}
else {
if (t[(n + i - 1) % n] != t[(n + i + 1) % n]) check = false;
}
}
}
if (check) {
for (Int i = 0; i < n; i++) cout << (t[i] ? 'S' : 'W');
cout << endl;
return 0;
}
t[0] = false;
if (s[0] == 'x') {
t[1] = t[n - 1] = true;
}
else {
t[1] = true;
t[n - 1] = false;
}
for (Int i = 2; i < n - 1; i++) {
if (t[i - 1]) {
if (s[i - 1] == 'o') {
t[i] = t[i - 2];
}
else {
t[i] = !t[i - 2];
}
}
else {
if (s[i - 1] == 'o') {
t[i] = !t[i - 2];
}
else {
t[i] = t[i - 2];
}
}
}
check = true;
for (Int i = 0; i < n; i++) {
if (t[i]) {
if (s[i] == 'o') {
if (t[(n + i - 1) % n] != t[(n + i + 1) % n]) check = false;
}
else {
if (t[(n + i - 1) % n] == t[(n + i + 1) % n]) check = false;
}
}
else {
if (s[i] == 'o') {
if (t[(n + i - 1) % n] == t[(n + i + 1) % n]) check = false;
}
else {
if (t[(n + i - 1) % n] != t[(n + i + 1) % n]) check = false;
}
}
}
if (check) {
for (Int i = 0; i < n; i++) cout << (t[i] ? 'S' : 'W');
cout << endl;
return 0;
}
t[0] = false;
if (s[0] == 'x') {
t[1] = t[n - 1] = false;
}
else {
t[1] = false;
t[n - 1] = true;
}
for (Int i = 2; i < n - 1; i++) {
if (t[i - 1]) {
if (s[i - 1] == 'o') {
t[i] = t[i - 2];
}
else {
t[i] = !t[i - 2];
}
}
else {
if (s[i - 1] == 'o') {
t[i] = !t[i - 2];
}
else {
t[i] = t[i - 2];
}
}
}
check = true;
for (Int i = 0; i < n; i++) {
if (t[i]) {
if (s[i] == 'o') {
if (t[(n + i - 1) % n] != t[(n + i + 1) % n]) check = false;
}
else {
if (t[(n + i - 1) % n] == t[(n + i + 1) % n]) check = false;
}
}
else {
if (s[i] == 'o') {
if (t[(n + i - 1) % n] == t[(n + i + 1) % n]) check = false;
}
else {
if (t[(n + i - 1) % n] != t[(n + i + 1) % n]) check = false;
}
}
}
if (check) {
for (Int i = 0; i < n; i++) cout << (t[i] ? 'S' : 'W');
cout << endl;
return 0;
}
dump(-1);
return 0;
}
| 0
| 73,916,924
|
#include <iostream>
#include <algorithm>
#include <cmath>
#include <numeric>
#include <map>
#include <vector>
#include <iomanip>
using namespace std;
int main(void) {
int A, B, K;
cin >> A >> B >> K;
for (int i = 0; i < K; i++) {
if (i % 2 == 0) {
B += A / 2;
A /= 2;
} else {
A += B / 2;
B /= 2;
}
}
cout << A << " " << B << endl;
return 0;
}
|
#include <iostream>
#ifdef MBP
#include "stdc++.h"
#else
#include <bits/stdc++.h>
#endif
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define REP(i, n) for (long long int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP_R(i, n) for (long long int i = (n - 1); i >= 0; --i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((long long int)(x).size())
#define BIT(n) (1LL << (n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define DEBUG
#ifdef DEBUG
#define OUT(x) std::cout << (x) << std::endl
#define OUT2(x, y) std::cout << (x) << "," << (y) << std::endl
#define OUT3(x, y, z) std::cout << (x) << "," << (y) << "," << (z) << std::endl
#define OUTPA(p) OUT2(p.first, p.second)
#else
#define OUT(x) NULL
#define OUT2(x, y) NULL
#define OUT3(x, y, z) NULL
#define OUTPA(p) NULL
#endif
#define INF INT_MAX
#define INFLL LLONG_MAX
#define PB push_back
#define MOD 1000000007LL
#define LSB(x) __builtin_ctzll(x)
#define MSB(x) 64LL - __builtin_clzll(x) - 1LL
#define MSBINT(x) 32LL - __builtin_clz(x)
#define BITCNT(x) __builtin_popcountll(x)
using namespace std;
using uif = uint_fast64_t;
using ll = long long int;
using vec = vector<ll>;
using mat = vector<vector<ll>>;
using pa = pair<ll, ll>;
using tTree = __gnu_pbds::tree<ll, __gnu_pbds::null_type, less<ll>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;
template <class T>
inline void input(T &arr)
{
ll n = arr.size();
REP(i, n)
cin >> arr[i];
}
template <class T>
inline void inputPA(T &arr)
{
ll n = arr.size();
REP(i, n)
cin >> arr[i].first >> arr[i].second;
}
template <class T>
using PQ = priority_queue<T>;
template <class T>
using PQG = priority_queue<T, vector<T>, greater<T>>;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
const ll dx8[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
template <class T>
bool chmax(T &, const T &);
template <class T>
bool chmin(T &, const T &);
ll qp(ll a, ll b);
ll qp(ll a, ll b, ll mo);
ll mod_pow(ll, ll);
ll mod_add(ll, ll);
ll mod_mul(ll, ll);
ll mod_div(ll, ll);
void make_fact(ll);
void make_invfact(ll);
void init_fact();
ll combination(ll, ll);
#define FACSIZE 200002LL
ll invfac[FACSIZE];
ll fac[FACSIZE];
struct edge
{
ll to, cost, id;
};
class Graph
{
public:
ll N;
vector<vector<edge>> G;
Graph(ll N) : N(N)
{
G = vector<vector<edge>>(N, vector<edge>(0));
}
void add_Directed_edge(ll from, ll to, ll cost = 1, ll id = 0)
{
G[from].push_back(edge({to, cost, id}));
}
void add_Undirected_edge(ll v1, ll v2, ll cost = 1, ll id = 0)
{
add_Directed_edge(v1, v2, cost, id);
add_Directed_edge(v2, v1, cost, id);
}
mat waeshall_floyd()
{
mat d(N, vec(N, INF));
REP(i, N)
d[i][i] = 0;
REP(i, N)
for (edge e : G[i])
{
d[i][e.to] = min(d[i][e.to], e.cost);
}
REP(k, N)
REP(i, N)
REP(j, N)
d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
return d;
}
vec dikstra(ll x)
{
vec distance(N, INF);
distance[x] = 0;
PQG<pa> pque;
pque.push(make_pair(0, x));
while (!pque.empty())
{
auto pq = pque.top();
pque.pop();
for (auto e : G[pq.second])
{
ll d = distance[pq.second] + e.cost;
if (d < distance[e.to])
{
distance[e.to] = d;
pque.push(make_pair(d, e.to));
}
}
}
return distance;
}
};
int main(void)
{
ll k;
cin >> k;
Graph G(k);
REP(i, k)
{
G.add_Directed_edge(i, (i + 1) % k, 1, 0);
G.add_Directed_edge(i, (i * 10) % k, 0, 0);
}
auto d = G.dikstra(1);
cout << d[0] + 1 << endl;
return 0;
}
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 qp(ll a, ll b)
{
ll ans = 1LL;
do
{
if (b & 1LL)
ans = 1LL * mod_mul(ans, a) % MOD;
a = 1LL * mod_mul(a, a) % MOD;
} while (b >>= 1LL);
return ans;
}
ll qp(ll a, ll b, ll mo)
{
ll ans = 1LL;
do
{
if (b & 1LL)
ans = 1LL * (ans % mo) * (a % mo);
a = 1LL * (a % mo) * (a % mo);
} while (b >>= 1LL);
return ans;
}
ll mod_pow(ll x, ll r)
{
if (r == 0)
return 1;
else if (r == 1)
return x % MOD;
else if (r % 2 == 0)
{
ll t = mod_pow(x, r / 2) % MOD;
return t * t % MOD;
}
else
{
ll t = mod_pow(x, r / 2) % MOD;
ll k = t * t % MOD;
return k * x % MOD;
}
}
ll mod_add(ll a, ll b)
{
return (a + b) % MOD;
}
ll mod_mul(ll a, ll b)
{
return (a * b) % MOD;
}
ll mod_div(ll a, ll b)
{
return mod_mul(a, mod_pow(b, MOD - 2));
}
void make_fact(ll n)
{
fac[0] = 1;
REP(i, n)
{
fac[i + 1] = mod_mul(fac[i], i + 1);
}
}
void make_invfact(ll n)
{
invfac[n] = mod_pow(fac[n], MOD - 2);
REP_R(i, n)
{
invfac[i] = mod_mul(invfac[i + 1], i + 1);
}
}
void init_fact()
{
make_fact(FACSIZE - 1);
make_invfact(FACSIZE - 1);
}
ll combination(ll n, ll c)
{
return mod_mul(fac[n], mod_mul(invfac[c], invfac[n - c]));
}
/*
init_fact();
cout << fac[5] << endl;
cout << invfac[5] << endl;
cout << combination(8, 4) << endl;
cout << combination(31, 8) << endl;
| 0
| 22,813,243
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int INF = 100000000;
int main(void) {
map<char, int> key;
key['q'] = 0;
key['w'] = 0;
key['e'] = 0;
key['r'] = 0;
key['t'] = 0;
key['a'] = 0;
key['s'] = 0;
key['d'] = 0;
key['f'] = 0;
key['g'] = 0;
key['z'] = 0;
key['x'] = 0;
key['c'] = 0;
key['v'] = 0;
key['b'] = 0;
key['y'] = 1;
key['u'] = 1;
key['i'] = 1;
key['o'] = 1;
key['p'] = 1;
key['h'] = 1;
key['j'] = 1;
key['k'] = 1;
key['l'] = 1;
key['n'] = 1;
key['m'] = 1;
while(1){
string s;
int cnt = 0;
cin >> s;
if(s[0] == '#') break;
int state = key[s[0]];
for(int i=0; i<s.size(); i++){
if(state != key[s[i]]) {
cnt++;
state = key[s[i]];
}
}
cout << cnt << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void connect(ll n, vector<pair<ll, ll>> &edges, ll total) {
ll cnt = 0;
for (ll i = 1; i < n - 1; i++) {
for (ll j = i + 1; j < n; j++) {
if (cnt == total) return;
edges.push_back(make_pair(i, j));
cnt++;
}
}
}
int main() {
ll n, k;
cin >> n >> k;
ll kmax = (n - 1) * (n - 2) / 2;
if (k > kmax) {
cout << -1 << endl;
return 0;
}
vector<pair<ll, ll>> edges;
for (ll i = 1; i < n; i++) {
edges.push_back(make_pair(0, i));
}
connect(n, edges, kmax - k);
cout << edges.size() << endl;
for (auto edge : edges) {
cout << edge.first + 1 << " " << edge.second + 1 << endl;
}
}
| 0
| 53,454,614
|
#include <cstdio>
#include <map>
using namespace std;
int n;
int s;
int main() {
while (1) {
scanf("%d%d", &n, &s);
if (n == 0 && s == 0) return 0;
int lim = 1 << 10;
int ans = 0;
for (int i=0; i<lim; i++) {
int sum = 0;
int cnt = 0;
for (int j=0; j<10; j++) {
if (i >> j & 1) {
sum += j;
cnt++;
}
}
if (sum == s && cnt == n) ans++;
}
printf("%d\n", ans);
}
}
|
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
const ll MOD = 1000000007;
#define rep(i,n) for (int i = 0; i < (n); ++i)
template<class T>
vector<T> make_vec(size_t a){
return vector<T>(a);
}
template<class T, class... Ts>
auto make_vec(size_t a, Ts... ts){
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
int main() {
string S, T;
cin >> S >> T;
int A, B;
cin >> A >> B;
string U;
cin >> U;
if (S == U){
cout << A-1 << " " << B << "\n";
} else {
cout << A << " " << B-1 << "\n";
}
return 0;
}
| 0
| 42,913,386
|
#include<bits/stdc++.h>
using namespace std;
namespace FAST_IO
{
template<typename T> void read(T &a)
{
a=0;
int f=1;
char c=getchar();
while(!isdigit(c))
{
if(c=='-')
{
f=-1;
}
c=getchar();
}
while(isdigit(c))
{
a=a*10+c-'0';
c=getchar();
}
a=a*f;
}
template <typename T> void write(T a)
{
if(a<0)
{
a=-a;
putchar('-');
}
if(a>9)
{
write(a/10);
}
putchar(a%10+'0');
}
template <typename T> void writeln(T a)
{
write(a);
puts("");
}
}
long long n,h,w,ans;
int main()
{
cin>>n>>h>>w;
while(n--)
{
int a,b;
cin>>a>>b;
if(a>=h&&b>=w)
{
ans++;
}
}
cout<<ans;
}
|
#include <iostream>
using namespace std;
int main(){
int N, A, B, C, X;
while(cin >> N >> A >> B >> C >> X, N+A+B+C+X){
int Y[N], time = -1, ran = X;
for(int i = 0; i < N; ++i){
cin >> Y[i];
}
int j = 0;
while(time <= 10000 && j != N){
++time;
if(ran == Y[j]) ++j;
ran = (A * ran + B) % C;
}
if(time > 10000) time = -1;
cout << time << endl;
}
}
| 0
| 22,333,592
|
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <functional>
#include <set>
#include <numeric>
#define ll long long int
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main() {
ll N, nx, e, ecnt, a, con = 0;
cin >> N;
nx = N;
for (ll i = 2; i*i <= nx;i++){
e = 0;
ecnt = 1;
while (N%i == 0){
N = N / i;
e++;
if (e==ecnt){
e = 0;
ecnt++;
con++;
}
}
}
if (N != 1) con++;
cout << con << endl;
return 0;
}
|
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <deque>
#include <numeric>
#include <sstream>
#include <iomanip>
using lint = long long;
int main()
{
lint n;
scanf("%lld", &n);
std::vector<lint> a(n);
std::vector<lint> b(n);
for (int i = 0; i < n; ++i)
{
scanf("%lld", &a[i]);
}
for (int i = 0; i < n; ++i)
{
scanf("%lld", &b[i]);
}
lint a_sum = std::accumulate(a.begin(), a.end(), 0ll);
lint b_sum = std::accumulate(b.begin(), b.end(), 0ll);
lint margin = b_sum - a_sum;
if (margin < 0ll)
{
printf("No");
return 0;
}
lint a_num = 0;
lint b_num = 0;
for (int i = 0; i < n; ++i)
{
lint ae = a[i];
lint be = b[i];
if (ae > be)
b_num = b_num + ae - be;
else if (ae < be)
{
if ((be - ae) % 2ll == 0)
{
a_num = a_num + (be - ae) / 2ll;
}
else
{
a_num = a_num + (be - ae) / 2ll + 1;
b_num++;
}
}
if (a_num > margin || b_num > margin)
{
printf("No");
return 0;
}
}
if ((margin - b_num) == (margin - a_num) * 2ll)
{
printf("Yes");
}
else
{
printf("No");
}
return 0;
}
| 0
| 46,394,154
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i,n) for(ll i=0;i<ll(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=ll(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=ll(b);i--)
#define FORA(i,I) for(const auto& i:I)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) ll(x.size())
#define MOD 1000000007
int main(void)
{
char N;
cin >> N;
char ans = 0;
if ('a'<= N && N<= 'z') {
ans = 'a';
}
else {
ans = 'A';
}
cout << ans << endl;
return 0;
}
|
#include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <list>
#include <iterator>
#pragma warning(disable:4996)
typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define LINF 9223300000000000000
#define INF 2140000000
#define MOD 1000000007
using namespace std;
int main(int argc, char* argv[])
{
long a, b;
scanf("%ld%ld", &a, &b);
if(a+b==15) {
printf("+\n");
}
else if (a*b==15) {
printf("*\n");
}
else {
printf("x\n");
}
return 0;
}
| 0
| 22,970,584
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { return x * x; }
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repd(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (b); i--)
#define FORA(i, I) for (const auto &i : I)
#define ALL(x) x.begin(), x.end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define isYES(x) printf("%s\n", (x) ? "YES" : "NO")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define ln cout << '\n'
template <Z A>
void pr(A a)
{
cout << a;
ln;
}
template <Z A, Z B>
void pr(A a, B b)
{
cout << a << ' ';
}
int ans = 0;
bool check = 0;
string s, t;
int N = 3;
vector<int> v(N);
int a, b, c, d;
int x, y;
char ch;
int main()
{
rep(i, 3) cin >> v[i];
sort(v.begin(), v.end());
rep(i, 2)
{
if (v[i] == v[i + 1])
ans++;
}
pr(3 - ans);
}
|
#include<bits/stdc++.h>
using namespace std;
#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 INF 10000000000
#define MOD 1000000007
using ll = long long;
using pint = pair<int,int>;
int main(){
int H,W; cin>>H>>W;
vector<string> S(H);
rep(i,H)cin>>S[i];
vector<vector<ll>> dp(H,vector<ll> (W,0));
dp[0][0]=1;
rep(h,H){
rep(w,W){
if(S[h][w]=='#')continue;
if(h>0&&S[h-1][w]=='.')(dp[h][w]+=dp[h-1][w]%MOD)%MOD;
if(w>0&&S[h][w-1]=='.')(dp[h][w]+=dp[h][w-1]%MOD)%MOD;
}
}
cout<<dp[H-1][W-1]%MOD<<endl;
}
| 0
| 25,851,727
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
using ll = int_fast64_t;
using pll = pair<ll,ll>;
constexpr ll INF = 1LL<<60;
constexpr ll MOD = 1e9+7;
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;}
#if loc||local
template<class T>void dump(T&& t){cerr<<t<<endl;}
template<class T,class... Ts> void dump(T&& h, Ts&&... t){cerr<<h<<", ";dump(forward<Ts>(t)...);}
#else
void dump(){}
template<class T,class... Ts> void dump(T&& h, Ts&&... t){}
#endif
template<class T> istream &operator>>(istream&is,vector<T>&v){for(auto &elemnt:v)is>>elemnt;return is;}
template<class T,class U> istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}
template<class T> ostream &operator<<(ostream& os,vector<T>const& v){for(auto const& vi:v)os<<vi<<" ";return os;}
template<class T,class U> ostream &operator<<(ostream& os,pair<T,U>const& p){os<<p.first<<","<<p.second;return os;}
template<class T>vector<T> vec(size_t a){return vector<T>(a);}
template<class T, class... Ts>auto vec(size_t a, Ts... ts){return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...));}
struct union_find{
size_t n;
vector<int> par;
size_t group;
union_find(){}
union_find(size_t _n):n(_n),group(_n){
par.resize(n,-1);
}
void reset(size_t _n){
n = _n;
group = n;
par.clear();
par.resize(n,-1);
}
int root(int k){
if(par[k]<0)return k;
return par[k] = root(par[k]);
}
int size(int k){
k = root(k);
return -par[k];
}
auto operator[](int k){
return size(k);
}
bool unite(int a,int b){
a = root(a);
b = root(b);
if(a==b)return false;
if(size(a)<size(b))swap(a,b);
group--;
par[a] += par[b];
par[b] = a;
return true;
}
auto operator()(int a,int b){
return unite(a,b);
}
bool same(int a,int b){
return root(a) == root(b);
}
};
signed main(){
int h,w;
cin>>h>>w;
vector<string> s(h);
cin>>s;
union_find row(h*w);
union_find col(h*w);
auto v = [&](int i,int j){
return i*w+j;
};
rep(i,h){
rep(j,w-1)if(s[i][j]=='.'&&s[i][j+1]=='.'){
row.unite(v(i,j),v(i,j+1));
}
}
rep(j,w){
rep(i,h-1)if(s[i][j]=='.'&&s[i+1][j]=='.'){
col.unite(v(i,j),v(i+1,j));
}
}
ll ans = 0;
rep(i,h)rep(j,w){
ll tmp = row.size(v(i,j))+col.size(v(i,j));
chmax(ans,tmp-1);
}
cout<<(ans)<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,int>;
const ll INF = 1ll<<60;
int main() {
int n, m; cin >> n >> m;
vector<vector<P>> G(n);
for (int i = 0; i < m; i++) {
int r, l; ll d;
cin >> r >> l >> d;
r--; l--;
G[l].push_back(P(d,r));
G[r].push_back(P(-d,l));
}
vector<ll> dist(n,INF);
for (int i = 0; i < n; i++) {
if (dist[i] != INF) continue;
dist[i] = 0;
queue<int> que;
que.push(i);
while (!que.empty()) {
int v = que.front();
que.pop();
ll d = dist[v];
for (auto nv : G[v]) {
if (dist[nv.second] == INF) {
dist[nv.second] = dist[v] + nv.first;
que.push(nv.second);
}
else if (dist[nv.second] != dist[v] + nv.first) {
cout << "No" << endl;
return 0;
}
}
}
}
cout << "Yes" << endl;
return 0;
}
| 0
| 4,805,807
|
#define DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#if DEBUG
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}
class _Debug {
public:
template<typename T>
_Debug& operator,(T val) {
cout << val << endl;
return *this;
}
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;
int A[100000],S[100000];
set<int> s;
int main() {
int i;
int N;
scanf("%d",&N);
for (i = 0; i < N; i++) scanf("%d",&A[i]),S[i] = A[i];
sort(S,S+N);
int ans = 0;
for (i = 0; i < N; i += 2) s.insert(S[i]);
for (i = 0; i < N; i += 2) {
if (!s.count(A[i])) ans++;
}
printf("%d\n",ans);
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
double check_dist(int *x, int *y, int d) {
int root;
double v = 0;
rep(i, d) v += (x[i] - y[i]) * (x[i] - y[i]);
root = int(sqrt(v));
return root * root == v;
}
int main() {
int n, d, ans = 0;
cin >> n >> d;
int x[n][d];
rep(i, n) rep(j, d) cin >> x[i][j];
for(int i = 0; i < n - 1; i++) {
for(int j = i + 1; j < n; j++) {
if(check_dist(x[i], x[j], d)) {
ans++;
}
}
}
cout << ans << endl;
return 0;
}
| 0
| 27,168,259
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define OUT(x) cout << (x) << endl;
#define OUTA(a, n) \
REP(i, n) { cout << (a[i]) << (i == n - 1 ? "\n" : " "); }
#define ALL(a) (a).begin(), (a).end()
#define SORT(a) sort(ALL(a))
#define RSORT(a) \
SORT(a); \
reverse(ALL(a))
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
ll N;
vi P;
int main()
{
cin >> N;
P = vi(N);
REP(i, N)
{
cin >> P[i];
}
vi Q = vi(N + 1);
REP(i, N)
{
Q[P[i]] = i + 1;
}
ll ans = 0;
set<ll> L = set<ll>();
set<ll> R = set<ll>();
L.insert(0);
L.insert(1);
L.insert(-Q[N]);
R.insert(N + 1);
R.insert(N + 2);
R.insert(Q[N]);
for (ll i = N - 1; i > 0; --i)
{
ll j = Q[i];
ll l1 = -(*L.upper_bound(-j));
ll l2 = -(*L.upper_bound(-l1));
ll r1 = *R.upper_bound(j);
ll r2 = *R.upper_bound(r1);
if (r1 <= N)
{
ans += i * (j - l1) * (r2 - r1);
}
if (l1 >= 1)
{
ans += i * (r1 - j) * (l1 - l2);
}
L.insert(-j);
R.insert(j);
}
OUT(ans);
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const double PI = acos(-1);
using ll = long long;
#define print(x) cout << x << endl
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define all(x) (x).begin(),(x).end()
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
ll gcd(ll x, ll y) { return y ? gcd(y,x%y) : x;}
vector<pair<ll, int>>factorize(ll n){
vector<pair<ll, int>> res;
for(ll i = 2; i * i <= n; ++i){
if(n % i) continue;
res.emplace_back(i, 0);
while(n % i == 0){
n /= i;
res.back().second++;
}
}
if(n != 1) res.emplace_back(n, 1);
return res;
}
int main() {
ll A, B;
cin >> A >> B;
int K;
cin >> K;
REP(i, K){
if(i % 2 == 0){
if(A % 2 != 0) A--;
A /= 2;
B += A;
}else if(i % 2 != 0){
if(B % 2 != 0) B--;
B /= 2;
A += B;
}
}
cout << A << ' ' << B << endl;
}
| 0
| 2,625,800
|
#include <iostream>
#include <algorithm>
#define flush fflush(stdout)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
const int mod = (int)1e9 + 7, INF = (int)1e9;
const int di[4] = { 1,0,-1,0 }, dj[4] = { 0,1,0,-1 };
int main(void) {
int n, l, i, a[100003], mt;
scanf("%d%d", &n, &l);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n - 1; i++) {
if (a[i] + a[i + 1] >= l) {
break;
}
}
if (i == n - 1) {
printf("Impossible\n");
return 0;
}
printf("Possible\n");
mt = i;
for (i = 0; i < mt; i++) {
printf("%d\n", i + 1);
}
for (i = n - 2; i >= mt; i--) {
printf("%d\n", i + 1);
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
string keys[] = {
"",
".,!? ",
"abc",
"def",
"ghi",
"jkl",
"mno",
"pqrs",
"tuv",
"wxyz",
};
int n;
string s;
int kind;
int cur;
cin >> n;
for( int lp=0;lp<n;lp++ ){
cin >> s;
cur=-1;
for( unsigned int i=0;i<s.length();i++ ){
if( s[i]=='0' ){
if( cur>=0 ){
cout << keys[ kind][cur%keys[kind].length() ] ;
cur=-1;
}
}else{
if( cur<0 ){
kind = s[i] - '0';
cur=0;
}else
cur++;
}
}
cout << endl;
}
return 0;
}
| 0
| 19,216,630
|
#include <stdio.h>
int main(void){
int yoko,tate;
int kari1,kari2;
while(1){
scanf("%d %d",&tate,&yoko);
if(yoko == 0 && tate == 0){
break;
}else{
kari1 = 0,kari2 = 0;
for ( kari1 = 0; kari1 < tate; kari1++ ){
for ( kari2 = 0; kari2 < yoko; kari2++ ){
printf("#");
}
printf("\n");
}
}
printf("\n");
}
return(0);
}
|
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
int N;
while(cin>>N,N){
int money[6]={500,100,50,10,5,1},ans=0;
N=1000-N;
for(int i=0;i<6;i++){
while(N-money[i]>=0) N-=money[i],ans++;
}
printf("%d\n",ans);
}
return 0;
}
| 0
| 78,580,910
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define mod 1000000007
#define all(x) (x).begin(), (x).end()
#define call(x) (x).cbegin(), (x).cend()
#define pb push_back
const long double PI = acos(-1);
const long long INF = (1 << 30);
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;}
ll stringcount(string s, char c){return count(s.cbegin(), s.cend(), c);}
bool isInteger(double x){return floor(x) == x;}
ll ceil(const ll a, const ll b){return ((a)+(b)-1)/b;}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
vector<ll> a(n), b(n);
for(ll i = 0; i < n; i++) cin >> a[i] >> b[i];
ll ans = 0;
ll p = 0;
for(ll i = n-1; i >= 0; i--){
a[i] += p;
ll d = b[i] - a[i] % b[i];
if(d != b[i]){
ans += d;
p += d;
}
}
cout << ans << endl;
return 0;
}
|
#include <iostream>
using namespace std;
typedef long long ll;
int main()
{
ll n;
cin >> n;
ll a[52];
for(int i = 0; i < n; i++) cin >> a[i];
ll ans = 0;
while(true){
int l = 0;
for(int i = 1; i < n; i++){
if(a[i] > a[l]) l = i;
}
if(a[l] < n) break;
ll c = a[l] / n;
for(int i = 0; i < n; i++){
if(i == l) a[i] %= n;
else a[i] += c;
}
ans += c;
}
cout << ans << endl;
}
| 0
| 41,744,334
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll N=1e6+1;
ll gcd(ll a,ll b){
if (a == 0)
return b;
return gcd(b % a, a);
}
ll fact[N];
bool prime[N];
void sieve(){
for(ll i=2;i<N;i++){
if(prime[i]==true){
for(ll j=i*i;j<=N;j+=i){
prime[j]=false;
fact[j]=i;
}
}
}
}
int main(){
ll n,x,t;
cin>>n>>x>>t;
if(n%x==0)
cout<<(n/x)*t;
else
cout<<(n/x+1)*t;
return 0;
}
|
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<class value, class cmp = less<value> >
using ordered_set = tree<value, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
template<class value, class cmp = less_equal<value> >
using ordered_multiset = tree<value, null_type, cmp, rb_tree_tag, tree_order_statistics_node_update>;
template<class key, class value, class cmp = less<key> >
using ordered_map = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int randll(int l = INT_MIN, int r = INT_MAX) {
return uniform_int_distribution<int>(l, r)(rng);
}
const int INF = 1e9, MOD = 1e9 + 7;
const ll LINF = 1e18;
const int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
inline bool inside (int x, int y, int n, int m) {
return 0 <= x && 0 <= y && x < n && y < m;
}
template<class T> bool umin (T &a, T b) {return a > b ? (a = b, true) : false; }
template<class T> bool umax (T &a, T b) {return a < b ? (a = b, true) : false; }
main()
{
ios::sync_with_stdio(0);
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int k, x;
cin >> k >> x;
k *= 500;
if (k >= x) {
cout << "Yes\n";
}
else cout << "No\n";
}
| 0
| 52,916,245
|
#include<bits/stdc++.h>
using namespace std;
#define cinsc ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(0);
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define FOR(i,k,n) for(int64 i=k;i<(int)n;i++)
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); it++)
#define IN(A, B, C) assert( B <= A && A <= C)
#define MP make_pair
#define PB push_back
#define INF (int)1e9
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define read(type) readInt<type>()
#define SQ(x) ((x)*(x))
const double pi=acos(-1.0);
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef map<int,int> MPII;
typedef set<int> SETI;
typedef multiset<int> MSETI;
typedef long int int32;
typedef unsigned long int uint32;
typedef long long int int64;
typedef unsigned long long int uint64;
int64 powr(int64 x,int64 y,int64 p)
{
int res = 1;
x = x % p;
if (x == 0) return 0;
while (y > 0){
if (y & 1)
res = (res*x) % p;
y = y>>1;
x = (x*x) % p;
}
return res;
}
void in_o(){
#ifndef LOCAL
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
cinsc;
}
int main(){
int a,b;
string s;
cin>>a>>b>>s;
int n=s.length();
if(s[a]!='-')
return cout<<"No",0;
FOR(i,0,n){
if(i!=a && !('0'<=s[i] && s[i]<='9')){
return cout<<"No",0;
}
}
return cout<<"Yes",0;
}
|
#include <stdio.h>
#define MAX 100001
typedef struct{
int parent;
int left;
int right;
int id;
}Node;
Node T[MAX];
int main(){
int l,k,n,i,j,count=0;
int flag=0;
int id;
for(i=0;i<MAX;i++){
T[i].parent=-1;
T[i].left=MAX;
T[i].right=MAX;
T[i].id=0;
}
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%d",&id);
scanf("%d",&k);
T[id].id=id;
if(k!=0){
scanf("%d",&T[id].left);
l=T[id].left;
T[l].parent=id;
for(j=0;j<k-1;j++){
scanf("%d",&T[l].right);
l=T[l].right;
T[l].parent=id;
}
}
}
for(i=0;i<n;i++){
printf("node %d:",T[i].id);
printf(" parent = %d,",T[i].parent);
j=i;
while(T[j].parent!=-1){
j=T[j].parent;
count++;
}
printf(" depth = %d,",count);
count=0;
if(T[i].parent==-1)printf(" root,");
else if(T[i].left!=MAX)printf(" internal node,");
else printf(" leaf,");
j=T[i].left;
printf(" [");
while(j!=MAX){
if(flag==0)printf("%d",j);
if(flag==1)printf("% d",j);
j=T[j].right;
if(j!=MAX)printf(",");
flag=1;
}
printf("]");
printf("\n");
flag=0;
}
return 0;
}
| 0
| 50,744,719
|
#include "iostream"
#include "string"
int main()
{
int n, x;
int val = 0;
while (true) {
std::cin >> n >> x;
if ((n + x) == 0)
break;
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
for (int k = j + 1; k <= n; k++) {
if ((i + j + k) == x)
val++;
}
}
}
std::cout << val << std::endl;
val = 0;
}
return 0;
}
|
#pragma GCC optimize("trapv")
#include<bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(), x.end()
using namespace std;
using vi = vector<int>;
using ll = long long;
const int maxn = 1<<20, mod = 924844033;
int n, a[maxn];
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n;
for(int i = 1; i <= n; i++) cin >> a[i];
ll ans = 0;
for(int i = 1; i <= n; i++) {
ans += a[i]/2;
a[i] &= 1;
if(a[i] && a[i+1]) ans++, a[i]--, a[i+1]--;
}
cout << ans;
}
| 0
| 95,385,747
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
int MOD = 1000000007;
double PI = 3.14159265358979323846;
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; }
typedef long long ll;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define For(i,s,n) for (int i=s;i<(int)(n);i++)
#define vi vector<int>
#define vii vector< vector<int> >
#define vs vector<string>
#define All(c) (c).begin(), (c).end()
#define Print(x) cout<<(x)<<"\n"
int main() {
string S;
cin >> S;
rep(i, 12) {
if (i == 4) cout << ' ';
cout << S[i];
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int N = 110;
char s[N][N];
int n, m;
int dp[N][N];
int main() {
scanf("%d %d", &n, &m);
for(int i = 1; i <= n; ++i)
scanf("%s", s[i] + 1);
dp[1][1] = s[1][1] == '#';
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= m; ++j) {
if(i == 1 && j == 1) continue;
dp[i][j] = 1e9;
if(s[i][j] == '#') {
if(i > 1) dp[i][j] = min(dp[i][j], dp[i - 1][j] + (s[i - 1][j] != '#'));
if(j > 1) dp[i][j] = min(dp[i][j], dp[i][j - 1] + (s[i][j - 1] != '#'));
} else {
if(i > 1) dp[i][j] = min(dp[i][j], dp[i - 1][j]);
if(j > 1) dp[i][j] = min(dp[i][j], dp[i][j - 1]);
}
}
}
printf("%d\n", dp[n][m]);
return 0;
}
| 0
| 72,010,289
|
#include <bits/stdc++.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <map>
#include <bitset>
#include <cmath>
#include <set>
#include <utility>
#include <sstream>
#define INF 1000000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) x.begin(),x.end()
#define chmax(x,y) (x = max(x,y))
#define chmin(x,y) (x = min(x,y))
int main(){
int X,Y;
cin >> X >> Y;
cout << X + Y/2 << endl;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cstring>
#include <math.h>
#include <bitset>
#include <queue>
#include <set>
#include <iomanip>
#include <assert.h>
#include <cstdio>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1001001001001001LL;
constexpr long long int infll = 1001001001001001LL;
constexpr int INF = 1000000007;
constexpr int inf = 1000000007;
const int mod = 1000000007;
inline bool chmin(ll &a, ll b)
{
if (a > b)
{
a = b;
return true;
}
return false;
}
inline bool chmax(ll &a, ll b)
{
if (a < b)
{
a = b;
return true;
}
return false;
}
template <typename T>
T seinomi(T a)
{
if (a > 0)
{
return a;
}
else
{
return 0;
}
}
template <typename T>
T ketasuu(T num)
{
return std::to_string(num).length();
}
ll llpow(ll a, ll n)
{
if (n == 0)
{
return 1;
}
else
{
ll rep = a;
for (ll i = 1; i < n; i++)
{
rep *= a;
}
return rep;
}
}
template <class ForwardIt, class T>
void iota(ForwardIt first, ForwardIt last, T value)
{
while (first != last)
{
*first++ = value;
++value;
}
}
template <typename T>
T amarinasi(T a, T b)
{
if (a % b == 0)
{
return a / b;
}
else if (a % b > 0)
{
return a / b + 1;
}
else
{
return a / b - 1;
}
}
const double pi = 3.14159265358979323846264;
int main()
{
ll a;
cin >> a;
string b;
cin >> b;
ll tmp = 0;
ll cnt = 1;
for (ll i = 0; i < b.size(); i++)
{
if (b[b.size() - i - 1] == '.')
{
continue;
}
tmp += cnt * (ll)(b[b.size() - i - 1] - '0');
cnt *= 10;
}
ll sum = a * tmp;
cout << sum / 100 << endl;
}
| 0
| 28,400,605
|
#include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
int a = 0, b = 0, c = 0;
std::cin >> a >> b >> c;
std::set<int> cans = {a, b, c};
std::cout << cans.size() << std::endl;
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lld long double
#define w(x) ll x;cin>>x;while(x--)
#define mod 1000000007
#define speed ios_base::sync_with_stdio(false);cin.tie(0);
using namespace std;
int main(){
speed;
ll n; cin>>n;
vector<ll> a(n); for(auto &i:a) cin>>i;
vector<ll> dp(n,0);
dp[n-1]=0;
for(ll i=n-2;i>=0;i--){
if(i+2>n-1){
dp[i]=abs(a[i+1]-a[i])+dp[i+1];
}
else{
dp[i]=min((abs(a[i+1]-a[i])+dp[i+1]),(abs(a[i+2]-a[i])+dp[i+2]));
}
}
cout<<dp[0]<<'\n';
return 0;
}
| 0
| 12,598,167
|
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
#define rep2(x,from,to) for(int x=(from);x<(to);++(x))
#define rep(x,to) rep2(x,0,to)
int n;
double pi = acos(-1);
void koch(double xl, double yl, double xr, double yr, int depth) {
if(depth == n) {
printf("%.8lf %.8lf\n", xr, yr);
return;
}
double px =(xr-xl)/3+xl, py = (yr-yl)/3+yl;
double qx =(xr-xl)*2/3+xl, qy = (yr-yl)*2/3+yl;
double len = sqrt(pow(xr-xl,2.0) + pow(yr-yl,2.0))/3.0;
double rad = atan2(yr-yl,xr-xl);
koch(xl,yl,px,py,depth+1);
koch(px,py,len*cos((pi/3)+rad)+px,len*sin((pi/3)+rad)+py,depth+1);
koch(len*cos((pi/3)+rad)+px,len*sin((pi/3)+rad)+py,qx,qy,depth+1);
koch(qx,qy,xr,yr,depth+1);
}
int main() {
cin >> n;
printf("%.8lf %.8lf\n",0,0);
koch(0,0,100,0,0);
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <functional>
#include <ctime>
#include <cmath>
#include <limits>
#include <numeric>
#include <type_traits>
#include <iomanip>
#include <float.h>
#include <math.h>
using namespace std;
using ll = long long;
unsigned euclidean_gcd(unsigned a, unsigned b) {
if (a < b) return euclidean_gcd(b, a);
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll ll_gcd(ll a, ll b) {
if (a < b) return ll_gcd(b, a);
ll r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
class UnionFind {
public:
vector <ll> par;
vector <ll> siz;
UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
void init(ll sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i) par[i] = i;
}
ll root(ll x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y) return false;
if (siz[x] < siz[y]) swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) {
return root(x) == root(y);
}
ll size(ll x) {
return siz[root(x)];
}
};
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1) res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long mod) {
return modpow(a, mod - 2, mod);
}
int main() {
ll n;
cin >> n;
map<ll, ll>mp;
ll now = 0;
mp[0]++;
for (int i = 0; i < n; i++) {
ll a;
cin >> a;
now += a;
mp[now]++;
}
ll ans = 0;
for (auto i : mp) {
ans += i.second * (i.second - 1)/2;
}
cout << ans << endl;
}
| 0
| 18,804,569
|
# include <bits/stdc++.h>
# define rep(i, n) for(ll i = 0; i < (n); ++i)
# define reps(i, n) for(ll i=1, i##_len=(n); i<=i##_len; ++i)
# define rrep(i, n) for(ll i=((int)(n)-1); i>=0; --i)
# define rreps(i, n) for(ll i=((int)(n)); i>0; --i)
# define ll long long
# define ALL(x) (x).begin(), (x).end()
# define SZ(x) ((int)(x).size())
# define pb push_back
# define optimize_cin() cin.tie(0); ios::sync_with_stdio(false)
# define P pair<int, int>
# define mp make_pair
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 lmax(ll a, ll b){if(a>= b) return a;return b;}
ll lmin(ll a, ll b){if(a>= b) return b;return a;}
int main() {
int n; cin >> n;
vector<int> b(n-1);
rep(i, n-1) cin >> b[i];
int ans = 0;
rep(i, n){
if(i==0) ans += b[0];
else if(i == n-1) ans += b[i-1];
else {
ans += min(b[i-1], b[i]);
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ALL(x) x.begin(), x.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
using ll = long long;
using lld = long double;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using PII = pair<int, int>;
random_device rnd;
mt19937 mt(rnd());
const int IINF = 1 << 28;
const ll INF = 1ll << 60;
const ll MOD = 1e9 + 7;
int main()
{
int n, m;
cin >> n >> m;
VVI cost(n, VI(n, IINF));
vector<pair<PII, int>> g;
rep(i, m)
{
int a, b, c;
cin >> a >> b >> c;
a--;
b--;
cost[a][b] = c;
cost[b][a] = c;
g.push_back({{a, b}, c});
}
rep(k, n) rep(i, n) rep(j, n)
{
chmin(cost[i][j], cost[i][k] + cost[k][j]);
}
int ans = 0;
rep(i, m)
{
int a = g[i].first.first;
int b = g[i].first.second;
int c = g[i].second;
if (c > cost[a][b])
{
ans++;
}
}
cout << ans << endl;
return 0;
}
| 0
| 59,191,857
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define show(x) cout<<#x<<" = "<<x<<endl;
#define print(x)cout<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef tuple<int,int,int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
int main() {
string s;
cin >>s;
ll n = sz(s);
vl cnt(26,0);
rep(i,n){
cnt[s[i]-'a']++;
}
ll ans = 0;
rep(i,26){
ans-= cnt[i]*(cnt[i]-1)/2;
}
ans += n*(n-1)/2;
cout<<ans+1<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define per(i,n) for(int i = (n)-1; i >= 0; --i)
#define rng(i,a,b) for(int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int main() {
int N, K;
cin >> N >> K;
vl A(N);
rep(i,N) {
cin >> A[i];
A[i]--;
}
map<ll, ll> cnts;
cnts[0] = 1;
ll ans = 0, sum_mod = 0;
vl sum_mods(1,0);
rep(i,N) {
(sum_mod += A[i]) %= K;
sum_mods.push_back(sum_mod);
if (i >= K-1) cnts[sum_mods[i-(K-1)]]--;
ans += cnts[sum_mod];
cnts[sum_mod]++;
} cerr << endl;
cout << ans << endl;
return 0;
}
| 0
| 1,867,286
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll mod = 1e9+7;
int main(){
int n;
cin >> n;
cout << (n-2)*180 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define FS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define ld long double
#define pb push_back
#define bp __builtin_popcount
#define sz size()
#define ff first
#define ss second
#define vll vector<ll>
#define vbool vector<bool>
#define vpll vector<pair<ll,ll>>
#define pll pair<ll,ll>
#define vllv vector<vector<ll>>
#define setpri(x) cout<<setprecision(x)<<fixed;
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define yesr {cout<<"YES"<<endl;return;}
#define nor {cout<<"NO"<<endl;return;}
ll MOD=1e9+7;
ll ceil1(ll n,ll x){return (n-1)/x+(n>0);}
ll gcd(ll a,ll b){return __gcd(a,b);}
ll lcm(ll a,ll b){return (max(a,b)/gcd(a,b))*min(a,b);}
ll pow1(ll n,ll m ,ll mod=MOD );
ll pow2(ll n,ll k);
ll modinv(ll n,ll mod=MOD){ return pow1(n,mod-2,mod);}
bool func(pair<ll,ll> &a,pair<ll,ll> &b ){
if(a.ff != b.ff)return a.ff < b.ff;
return a.ss > b.ss;
}
ll const N=(ll)3e2+11;
ll const LG=(ll)log2(N)+1;
void solve(){
ll i,j,k,l,n,m,x,y,z,r;
cin>>n;
vll pre(1e5+6);
vll suff(1e5+7);
for(i=1;i<=n;i++){
cin>>x;
pre[x]++;
suff[x]++;
}
for(i=1;i<=1e5;i++){
pre[i]+=pre[i-1];
}
for(i=1e5;i>=1;i--){
suff[i]+=suff[i+1];
}
ll ans=0;
for(i=1;i<=1e5;i++){
if(pre[i-1]==suff[i])ans++;
}
cout<<ans<<endl;
}
int main(){
FS;
ll i,j,k,n,m,x,y,z,q;
q=1;
while(q--){
solve();
}
return 0;
}
ll pow1(ll n,ll m,ll mod){
if(m==0)return 1;
if(m%2==0)return pow1((n*n)%mod,m/2,mod);
return (pow1((n*n)%mod,m/2,mod)*n)%mod;
}
ll pow2(ll n,ll k){
ll ans=1;
while(k>0){
if(k%2==1)ans=ans*n;
n=n*n;
k/=2;
}
return ans;
}
| 0
| 58,255,623
|
#include<algorithm>
#include<bitset>
#include<cmath>
#include<complex>
#include<deque>
#include<functional>
#include<iomanip>
#include<iostream>
#include<iterator>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define RALL(n) rbegin(n),rend(n)
#define MOD (1000000007)
#define INF (2e9)
#define INFL (2e18)
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
using vint=vector<int>;
using vll=vector<ll>;
using vbool=vector<bool>;
template<class T>using arr=vector<vector<T>>;
template<class T>int popcount(T &a){int c=0; rep(i, 8*(int)sizeof(a)){if((a>>i)&1) c++;} return c;}
template<class T>void pr(T x){cout << x << endl;}
template<class T>void prvec(vector<T>& a){rep(i, a.size()-1){cout << a[i] << " ";} pr(a[a.size()-1]);}
template<class T>void prarr(arr<T>& a){rep(i, a.size()) if(a[i].empty()) pr(""); else prvec(a[i]);}
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; }
int main()
{
string s; cin >> s;
vbool v(26, false);
rep(i, s.size()){
v[s[i] - 'a'] = true;
}
string ans;
if(s.size()<26){
rep(i, 26){
if(v[i]) continue;
ans = s + char(i+'a');
pr(ans);
return 0;
}
}else{
for(int i=25; i>=0; i--){
FOR(j, s[i]-'a'+1, 26){
if(!v[j]){
rep(k, i) cout << s[k];
cout << char(j+'a');
cout << endl;
return 0;
}
}
v[s[i] - 'a'] = false;
}
}
pr(-1);
return 0;}
|
#include<iostream>
#define _USE_MATH_DEFINES
#include<math.h>
#include<vector>
#include<array>
#include<algorithm>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<set>
#include<cstdio>
#include<cstring>
#include<string>
using namespace std;
typedef long long ll;
typedef vector<double> vec;
typedef vector<vector<ll>> mat;
typedef pair<ll,ll> P;
typedef map<ll,ll> MP;
typedef priority_queue<ll> PQ;
#define pb push_back
#define st first
#define nd second
#define SZ(x) ((int)(x).size())
#define FOR(i,s,n) for(int i=(int)(s); i< (int)(n); i++)
#define rep(i,n) FOR(i,0,n)
#define all(x) (x).begin(),(x).end()
#define each(x,c) for(auto x: (c))
#define LB(x,a) lower_bound(all(x), a)
#define UB(x,a) upper_bound(all(x), a)
const ll mod=1e9+7;
const ll INF=1e18;
const double EPS=1.0e-10;
const double PI=M_PI;
int main(){
int N; scanf("%d",&N);
vec t(N),v(N),sup(N);
rep(i,N){
scanf("%lf",&t[i]);
}
rep(i,N){
scanf("%lf",&v[i]);
}
sup[N-1]=0.0;
rep(i,N-1){
sup[N-i-2]=min(v[N-i-2],min(sup[N-i-1]+t[N-i-1],v[N-i-1]));
}
double ans=0.0,V=0.0,T;
rep(i,N){
if(V+t[i]<sup[i]){
ans+=t[i]*(t[i]+2.0*V)/2.0;
V+=t[i];
}
else if(sup[i]==v[i]){
T=v[i]-V;
ans+=T*(V+v[i])/2.0+v[i]*(t[i]-T);
V=v[i];
}
else{
T=(t[i]+sup[i]-V)/2.0;
if(V+T<v[i]){
ans+=T*(T+2.0*V)/2.0+(t[i]-T)*(V+T+sup[i])/2.0;
V=sup[i];
}
else{
double T1=v[i]-V,T3=v[i]-sup[i],T2=t[i]-T1-T3;
ans+=T1*(V+v[i])/2.0+T2*v[i]+T3*(v[i]+sup[i])/2.0;
V=sup[i];
}
}
}
printf("%.10lf\n",ans);
return 0;
}
| 0
| 34,268,362
|
#include <bits/stdc++.h>
using namespace std;
using dou =long double;
string yes="yes";
string Yes="Yes";
string YES="YES";
string no="no";
string No="No";
string NO="NO";
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; }
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define brep(n) for(int bit=0;bit<(1<<n);bit++)
#define erep(i,container) for (auto i : container)
#define irep(i, n) for(int i = n-1; i >= (int)0; i--)
#define rrep(i,m,n) for(ll i = m; i < (ll)(n); i++)
#define reprep(i,j,h,w) rep(i,h)rep(j,w)
#define all(x) (x).begin(),(x).end()
#define VEC(type,name,n) std::vector<type> name(n);rep(i,n)std::cin >> name[i];
#define pb push_back
#define pf push_front
#define query int qq;std::cin >> qq;rep(qqq,qq)
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define itn int
#define mp make_pair
#define sum(a) accumulate(all(a),0ll)
#define keta fixed<<setprecision
#define vvector(name,typ,m,n,a)vector<vector<typ> > name(m,vector<typ> (n,a))
#define vvvector(name,t,l,m,n,a) vector<vector<vector<t> > > name(l, vector<vector<t> >(m, vector<t>(n,a)));
#define vvvvector(name,t,k,l,m,n,a) vector<vector<vector<vector<t> > > > name(k,vector<vector<vector<t> > >(l, vector<vector<t> >(m, vector<t>(n,a)) ));
#define case std::cout <<"Case #" <<qqq+1<<": "
#define res resize
#define as assign
#define ffor for(;;)
#define ppri(a,b) std::cout << a<<" "<<b << std::endl
#define pppri(a,b,c) std::cout << a<<" "<<b <<" "<< c<<std::endl
#define aall(x,n) (x).begin(),(x).begin()+(n)
#define ssum(a) accumulate(a,0ll)
#define gre(n) greater<n>()
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;
const int INF = 1000000000;
const ll INF64 = 922337203685477580ll;
const ll MOD = 1000000007ll;
const dou pi=3.141592653589793;
std::vector<vector<ll>> d;
void warshall_floyd(int n) {
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
for (int k = 0; k < n; k++)
d[j][k] = min(d[j][k], d[j][i] + d[i][k]);
}
int main(){
int v,e;
std::cin >> v>>e;
d.resize(v);
rep(i,v){
d[i].resize(v);
}
reprep(i,j,v,v)d[i][j]=INF64;
rep(i,v)d[i][i]=0;
rep(i,e){
int a,b,c;
std::cin >> a>>b>>c;
d[a][b]=c;
}
warshall_floyd(v);
reprep(i,j,v,v){
if(d[i][j]+d[j][i]<0){
std::cout << "NEGATIVE CYCLE" << std::endl;
exit(0);
}
}
rep(i,v){
rep(j,v){
if(d[i][j]<=INF64/10)std::cout << d[i][j] <<((j==v-1)?"":" ");
else std::cout << "INF" <<((j==v-1)?"":" ");
}
std::cout << std::endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
double equal(double a, double b) {
return fabs(a - b) < DBL_EPSILON;
}
std::istream &operator>>(std::istream &in, set<int> &o) {
int a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }
typedef priority_queue<ll, vector<ll>, greater<ll> > PQ_ASK;
int main() {
int n;
cin >> n;
vector<ll> v(n);
rep(i, n) cin >> v[i], v[i]--;
vector<ll> a(n), b(n);
for (ll t = 0; t < n; t++) a[t] = (t + 1) * n;
for (ll t = 0; t < n; t++) b[t] = n * n - t * n;
rep(i, n) {
a[v[i]] += i;
}
for (ll l : a) cout << l << ' ';
cout << endl;
for (ll l : b) cout << l << ' ';
cout << endl;
cout << endl;
}
| 0
| 9,927,290
|
#include <iostream>
#include<vector>
using namespace std;
int main(void){
int n;
cin >> n;
string s;
cin >> s;
vector<int> v(26,1);
for(int i = 0;i < s.size();i++){
v[s[i] - 'a']++;
}
long ans = 1;
for(int i = 0;i < v.size();i++){
ans = ans * v[i] % 1000000007;
}
ans = (ans - 1 + 1000000007) % 1000000007;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using P = pair<int, int>;
using vec = vector<int>;
using mat = vector<vector<int>>;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
int main() {
int n;
cin >> n;
vec a(n);
rep(i, n) cin >> a[i];
sort(all(a));
int x1 = a[n-1], x2 = a[0];
vector<P> history;
rep(i, n) {
if (a[i] > 0 && i > 0 && i < n-1) {
int y = a[i];
history.push_back({x2, y});
x2 -= y;
}
}
rep(i, n) {
if (a[i] <= 0 && i > 0 && i < n-1) {
int y = a[i];
history.push_back({x1, y});
x1 += abs(y);
}
}
history.push_back({x1, x2});
x1 -= x2;
cout << x1 << endl;
rep(i, n-1) {
printf("%d %d\n", history[i].first, history[i].second);
}
return 0;
}
| 0
| 81,547,163
|
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<queue>
#include<deque>
#include<cmath>
#include<map>
#include<unordered_map>
#include<set>
#include<cstring>
#include<iomanip>
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 6;
const ll MOD = 1e9 + 7;
const ll LLINF = 1LL<<60;
#define Pint pair<int, int>
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
int main() {
int N; cin >> N;
int A[N];
rep(i, N) {
cin >> A[i];
}
sort(A, A + N);
int posPlus = -1;
rep(i, N) {
if(A[i] > 0) {
posPlus = i;
break;
}
}
if(posPlus == 0) {
vector<Pint> ans;
rep(i, N - 2) {
ans.pb(mp(A[i], A[i + 1]));
A[i + 1] = A[i] - A[i + 1];
}
ans.pb(mp(A[N - 1], A[N - 2]));
cout << A[N - 1] - A[N - 2] << endl;
rep(i, N - 1)
cout << ans[i].first << ' ' << ans[i].second << endl;
}else if(posPlus == -1) {
vector<Pint> ans;
rep(i, N - 1) {
ans.pb(mp(A[N - 1], A[i]));
A[N - 1] = A[N - 1] - A[i];
}
cout << A[N - 1] << endl;
rep(i, N - 1)
cout << ans[i].first << ' ' << ans[i].second << endl;
}else {
vector<Pint> ans;
for(int i = posPlus - 1; i < N - 2; ++i) {
ans.pb(mp(A[i], A[i + 1]));
A[i + 1] = A[i] - A[i + 1];
A[i] = INF;
}
rep(i, N - 1) {
if(A[i] == INF) continue;
ans.pb(mp(A[N - 1], A[i]));
A[N - 1] = A[N - 1] - A[i];
}
cout << A[N - 1] << endl;
rep(i, N - 1)
cout << ans[i].first << ' ' << ans[i].second << endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N + 1);
int tmp;
for (int i = 0; i < N; i++) {
cin >> tmp;
A.at(tmp)++;
}
sort(A.begin(), A.end());
int ans = 0;
for (int i = 0; i < N + 1; i++) {
if (A.at(i) == 0) {
continue;
}
if (N + 1 - i <= K) {
cout << ans << endl;
break;
} else {
ans += A.at(i);
}
}
}
| 0
| 97,030,739
|
#include<algorithm>
#include<cmath>
#include<iostream>
#include<vector>
#include<string>
using namespace std;
typedef long long ll;
#define REP(i, n) for(ll i=0;i<ll(n); i++)
int main(){
int A[3][3];
int B[3][3];
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
cin >> A[i][j];
B[i][j] = 0;
}
}
int N;
cin >> N;
for(int n=0;n<N;n++){
int ni;
cin >> ni;
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
if(A[i][j] == ni){
B[i][j] = 1;
}
}
}
}
int f_0x = 1;
int f_1x = 1;
int f_2x = 1;
int f_x0 = 1;
int f_x1 = 1;
int f_x2 = 1;
int f_z1 = 1;
int f_z2 = 1;
int i;
for(i=0;i<3;i++){
f_0x *= B[0][i];
f_1x *= B[1][i];
f_2x *= B[2][i];
f_x0 *= B[i][0];
f_x1 *= B[i][1];
f_x2 *= B[i][2];
f_z1 *= B[i][i];
f_z2 *= B[2-i][i];
}
if(f_0x + f_1x + f_2x + f_x0 + f_x1 + f_x2 + f_z1 + f_z2 == 0){cout << "No" << endl;}
else{cout << "Yes" << endl;}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
long gcd(long a, long b)
{
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main()
{
int a ,b,k;
cin >> a >> b >> k;
int max = gcd(a, b);
int i = max;
int cnt = 0;
while (i > 0)
{
if (a % i == 0 && b % i == 0)
cnt++;
if (cnt == k)
break ;
i--;
}
cout << i << endl;
return (0);
}
| 0
| 59,170,736
|
#include <bits/stdc++.h>
#include <vector>
# include <cstdint>
#define FOR(i,l,r) for(int i=(l);i<(r);++i)
#define RFOR(i,l,r) for(int i=(l);i>=(int)(r);i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n-1,0)
#define int long long
using namespace std;
const int MX = 1e6;
const int inf = 1e9;
const int mod = 1e9+7;
signed main(){
string s;
cin >> s;
int ans = 0;
char c = s[0];
rep(i,s.length()) {
if(i==0) continue;
if(s[i] != c) ans++;
c = s[i];
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,x) for(int i=0;i<x;i++)
#define put(ans) cout << ans << endl;
int main(){
int n; cin >> n;
ll H[n];
rep(i,n) cin >> H[i];
if(n==1){
cout << 0 << endl;
return 0;
}
int ans(0),sum(0);
for(int i=1;i<n;i++){
if(H[i]<=H[i-1]){
sum++;
}else{
ans = max(ans,sum);
sum = 0;
}
}
ans = max(ans,sum);
cout << ans << endl;
return 0;
}
| 0
| 52,377,956
|
#include <bits/stdc++.h>
using namespace std;
long long func(long long X){
return log10(X)+1;
}
int main() {
long long min_F=100000000;
long long N;
cin >> N;
for(int i=1;i<=sqrt(N);i++){
if(N%i!=0){
continue;
}
long long A=max((long long)i,N/i);
long long F=func(A);
min_F=min(min_F,F);
}
cout << min_F << endl;
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair< int, int > pii;
typedef pair< pii, int > ppi;
#define fill(a,b) memset(a,b,sizeof(a))
#define all(v) (v).begin(),(v).end()
#define sp(k) cout<<setprecision(k)<<fixed;
#define rep(i,a) for(int i=0;i<a;i++)
#define rep1(i,a,b) for(int i=(a);i<=(b);++i)
#define irep(i,b,a) for(int i=(b);i>=(a);--i)
#define minv(v) *min_element(all(v))
#define maxv(v) *max_element(all(v))
#define unq(v) sort(all(v)),(v).erase(unique(all(v)),(v).end())
#define _ ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define sqr(a) ((a)*(a))
#define sz(a) int(a.size())
#define ff first
#define ss second
#define pb push_back
const double pi = acos(-1.0);
const int mod = 1000000007;
const int inf = 0x3f3f3f3f;
const int maxn = 2000100;
int main(){
_
string s; cin >> s;
ll n=0 ;
ll ans = 0;
rep(i,sz(s)){
if(s[i]=='B')n++;
else ans+=n;
}
cout<<ans<<endl;
return 0;
}
| 0
| 17,349,148
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define MOD 1000000007
int main(void) {
ll N;
ll l = 0, r = 0;
string L, R;
string S;
cin >> N >> S;
for(ll i = 0;i < S.size();i++) {
ll j = S.size() - i - 1;
if(S[i] == '(') l++;
else l = max(l - 1, 0LL);
if(S[j] == ')') r++;
else r = max(r - 1, 0LL);
}
L.resize(r, '(');
R.resize(l, ')');
S.insert(0, L);
S.insert(S.size(), R);
cout << S << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T>
vector<T> make_vec(size_t a) {
return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
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;
}
using ll = long long;
using ull = unsigned long long;
const ll INF = 1e18;
int main() {
ll N;
cin >> N;
ll ans = INF;
for (ll i = 1; i < sqrt(N) + 1; i++) {
if (N % i == 0) {
chmin(ans, (i - 1) + (N / i - 1));
}
}
cout << ans << endl;
}
| 0
| 12,555,766
|
#include <algorithm>
#include <array>
#include <assert.h>
#include <iomanip>
#include <iostream>
#include <limits>
#include <math.h>
#include <memory>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = int64_t;
using ull = uint64_t;
template<typename T>
vector<T> make_vec_nd(T init, size_t size) {
return vector<T>(size, init);
}
template<typename T, typename... Args>
auto make_vec_nd(T init, size_t size, Args... rest) {
auto inner = make_vec_nd(init, rest...);
return vector<decltype(inner)>(size, inner);
}
#define rep(i,a,b) for(ll i=a;i<b;i++)
#define rrep(i,a,b) for(ll i=a-1;i>=b;i--)
int main() {
vector<ll> cnt_matches_vec = {2, 5, 5, 4, 5, 6, 3, 7, 6};
unordered_map<ll, ll> cnt_matches;
rep(i, 0, 9) {
cnt_matches[i+1] = cnt_matches_vec[i];
}
ll N, M;
cin >> N >> M;
vector<ll> Ais(M);
rep(i, 0, M) {
cin >> Ais[i];
}
{
unordered_map<ll, ll> map;
rep(i, 0, Ais.size()) {
if (map.find(cnt_matches[Ais[i]]) == map.end()) {
map[cnt_matches[Ais[i]]] = Ais[i];
} else {
map[cnt_matches[Ais[i]]] = max(map[cnt_matches[Ais[i]]], Ais[i]);
}
}
Ais.clear();
for (const auto& kv : map) {
Ais.push_back(kv.second);
}
}
sort(Ais.begin(), Ais.end());
auto dp = make_vec_nd(numeric_limits<ll>::min(), Ais.size()+1, N+1);
dp[0][0] = 0;
rep(number_cnt, 1, Ais.size()+1) {
ll cost = cnt_matches[Ais[number_cnt-1]];
rep(n, 0, N+1) {
dp[number_cnt][n] = dp[number_cnt-1][n];
if (n >= cost) {
dp[number_cnt][n] = max(dp[number_cnt][n],
dp[number_cnt][n-cost] + 1);
}
}
}
vector<ll> digits;
ll N_loc = N;
rrep(number_cnt,Ais.size()+1,1) {
ll cost = cnt_matches[Ais[number_cnt-1]];;
while(N_loc-cost >= 0 &&
dp[number_cnt][N_loc] == dp[number_cnt][N_loc-cost]+1) {
digits.push_back(Ais[number_cnt-1]);
N_loc -= cost;
}
}
sort(digits.rbegin(), digits.rend());
rep(i,0,digits.size()) {
cout << digits[i];
}
cout << endl;
}
|
#include <iostream>
#include <map>
#include <cmath>
#include <ios>
#include <iomanip>
#include <algorithm>
#include <queue>
#include <stack>
#include <numeric>
using namespace std;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T1, class T2> using P = pair<T1, T2>;
using I = int;
using D = double;
using B = bool;
using C = char;
using S = string;
using LL = long long;
using LD = long double;
using ULL = unsigned long long;
using PII = P<I, I>;
using VPII = V<PII>;
using PLL = P<LL, LL>;
using VPLL = V<PLL>;
using VI = V<I>;
using VVI = VV<I>;
using VLL = V<LL>;
using VVLL = VV<LL>;
using VC = V<C>;
using VVC = VV<C>;
using VS = V<S>;
using VVS = VV<S>;
using VB = V<B>;
using VVB = VV<B>;
#define REP(type, i, n) for (type i = 0; i < (type)(n); ++i)
#define REP2(type, i, m, n) for (type i = (m); i < (type)(n); ++i)
#define REPR(type, i, n) for (type i = (n)-1; i >= 0; --i)
#define REPR2(type, i, m, n) for (type i = (n)-1; i >= (m); --i)
#define REPx(x, a) for(auto x : a)
#define ALL(a) a.begin(), a.end()
#define SORT(a) sort(ALL(a))
#define SORTR(a, type) sort(ALL(a), greater<type>())
#define SORTF(a, comp) sort(ALL(a), comp)
#define REVERSE(a) reverse(ALL(a))
#define SIZE(a, type) ((type)(a).size())
#define bit_search(bit, n) REP(LL, bit, 1LL<<(n))
#define bit_check(bit, i) ((bit>>(i)) & 1)
#define setpre(n) fixed << setprecision((n))
#define UNIQUE(a) do {SORT(a); (a).erase(unique(ALL(a)), (a).end());} while(0)
#define MAX(a) *max_element(ALL(a))
#define MIN(a) *min_element(ALL(a))
#define bisect_left(a, x) (lower_bound(ALL(a), (x)) - a.begin())
#define bisect_right(a, x) (upper_bound(ALL(a), (x)) - a.begin())
#define INPUT(a) REPx(&x, a) cin >> x;
#define INPUT2(a) REPx(&x, a) INPUT(x);
#define INPUTP(a) REPx(&x, a) cin >> x.first >> x.second;
#define ENDL cout << endl;
const LL INF = 9e18;
const LL MOD = 1e9+7;
template<class T> using PRIORITY_QUEUE = priority_queue< T, V<T>, greater<T> >;
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;}
template<class T> inline void debug1(V<T> A){REP(int, i, SIZE(A, int)){if (A[i] == INF) cout << "I ";else cout << A[i] << " ";}ENDL}
template<class T> inline void debug2(VV<T> A){REP(int, i, SIZE(A, int)){REP(int, j, SIZE(A[i], int)){if (A[i][j] == INF) cout << "I "; else cout << A[i][j] << " ";}ENDL}}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
string s;
cin >> s;
int n = SIZE(s, int);
VI S(n);
REP(int, i, n) S[i] = s[i] - 'a';
VB check(26, false);
REPx(x, s) check[x-'a'] = true;
if (n < 26)
{
REP(int, i, 26)
{
if (!check[i])
{
s += 'a' + i;
cout << s << endl;
return 0;
}
}
}
else
{
int pre = S[n-1];
REPR(int, i, n-1)
{
if (S[i] < pre)
{
PRIORITY_QUEUE<int> q;
REP2(int, j, i+1, n) q.push(S[j]);
while(!q.empty())
{
int tmp = q.top(); q.pop();
if (tmp > S[i])
{
S[i] = tmp;
break;
}
}
REP(int, j, i+1) cout << char('a' + S[j]);
ENDL
return 0;
}
pre = S[i];
}
}
cout << -1 << endl;
return 0;
}
| 0
| 63,606,611
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;
int main(){
int x;
cin >> x;
int g = gcd(x, 360);
int ans = 360/g;
cout << ans << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <iomanip>
#include <algorithm>
#include <fstream>
#include <chrono>
#define lint long long int
#define FOR(x, to) for(int x=0; x<(int)(to); x++)
#define DUMP(ar) for(int loop=0; loop<(int)ar.size(); loop++) cout << "[" << loop << "]:" << ar[loop] << endl
#define DUMPL(ar) for(int loop=0; loop<(int)ar.size(); loop++) { cout << ar[loop]; if(loop<(int)ar.size()-1) cout << ' '; } cout << endl;
#define COUT(x) cout << x << endl
#define ALL(ar) ar.begin(), ar.end()
#define LOOPD(i) cout << "ループ[" << i << "]回目---------------" << endl
using namespace std;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
string s1, s2;
cin >> s1 >> s2;
int s1_size = s1.size(), s2_size = s2.size();
int cost_i = 1, cost_d = 1, cost_s = 1;
vector<vector<int>> dp(s1_size+1, vector<int>(s2_size+1, 0));
for(int i=0; i<s1_size+1; i++){
dp[i][0] = i * cost_d;
}
for(int i=0; i<s2_size+1; i++){
dp[0][i] = i * cost_i;
}
for(int i=1; i<s1_size+1; i++){
for(int j=1; j<s2_size+1; j++){
if(s1[i-1] == s2[j-1]){
dp[i][j] = dp[i-1][j-1];
}else{
dp[i][j] = min(dp[i-1][j] + cost_d, min(dp[i][j-1] + cost_i, dp[i-1][j-1] + cost_s));
}
}
}
COUT(dp.back().back());
return 0;
}
| 0
| 11,598,479
|
#include <bits/stdc++.h>
int N;
std::vector <int> e[110000];
int size[110000];
int magic[110000];
int dfs (int x, int f = -1) {
int d = 0, cnt = 0, cnt_ = 0, del = 1;
for (int i = 0; i < e[x].size (); i++) {
if (e[x][i] == f) continue;
d = std::max (d, dfs (e[x][i], x));
if (magic[e[x][i]] != 1) del = 0;
if (magic[e[x][i]] == 2) {
cnt++;
magic[x] = 1;
}
if (magic[e[x][i]] == 1) {
cnt_++;
}
size[x] += size[e[x][i]];
}
if (del) magic[x] = 2;
size[x]++;
if (cnt >= 2) return 1;
if (f == -1 && cnt_ >= 2 && del) return 1;
return d;
}
int main () {
scanf ("%d", &N);
for (int i = 0; i < N - 1; i++) {
int u, v;
scanf ("%d%d", &u, &v);
e[u].push_back (v);
e[v].push_back (u);
}
int b = 1;
while (b <= N && e[b].size () <= 1) ++b;
if (b > N) {
puts ("Second");
return 0;
}
if (dfs (b))
puts ("First");
else
puts ("Second");
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define optimize() ios_base::sync_with_stdio(0);
int n;
int arr[100000][3];
int point[100000][3];
int p(int row,int col)
{
if(row == n-1)
{
return arr[n-1][col];
}
if(point[row][col]>0)
{
return point[row][col];
}
else if(col==0)
{
return point[row][col]=arr[row][col]+max(p(row+1,1),p(row+1,2));
}
else if(col==1)
{
return point[row][col]=arr[row][col]+max(p(row+1,0),p(row+1,2));
}
else if(col==2)
{
return point[row][col]=arr[row][col]+max(p(row+1,0),p(row+1,1));
}
}
int main()
{
optimize();
cin>>n;
for(int i=0; i<n; i++)
{
for(int j=0; j<3; j++)
{
cin>>arr[i][j];
}
}
int res=max(p(0,0),max(p(0,1),p(0,2)));
cout<<res;
}
| 0
| 100,240,052
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.