code1
stringlengths 54
12k
| code2
stringlengths 65
12k
| similar
int64 0
1
| __index_level_0__
int64 1
101M
|
|---|---|---|---|
#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 long double ld;
typedef vector<ll> vec;
typedef vector<vector<ll>> mat;
typedef pair<ll,ll> P;
typedef map<ll,ll> MP;
typedef priority_queue<ll> PQ;
typedef stack<ll> ST;
typedef queue<ll> QUE;
#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; cin>>N;
string S; cin>>S;
if(S[0]=='W' || S[2*N-1]=='W'){
cout<<0<<endl;
return 0;
}
vec v(2*N), zero(2*N), one(2*N); v[0] = one[0] = 0; zero[0] = 1;
rep(i,2*N-1){
if(S[i+1]!=S[i]) v[i+1]=v[i];
else v[i+1]=1-v[i];
zero[i+1] = zero[i];
one[i+1] = one[i];
if(v[i+1] == 0) zero[i+1]++;
else one[i+1]++;
if(one[i+1]>zero[i+1]){
cout<<0<<endl;
return 0;
}
}
if(zero[2*N-1] != N){
cout<<0<<endl;
return 0;
}
ll ans=1;
rep(i,2*N){
if(v[i]==1){
ans=(ans*(zero[i]-one[i]+1LL))%mod;
}
}
FOR(i,1,N+1) ans=(ans*(ll)i)%mod;
printf("%lld\n",ans);
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = (0); i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#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 show(x) cout << #x << " = " << (x) << endl
#define show2(x,y) cout << #x << " = " << (x) << ", " << #y << " = " << (y) << endl
#define show3(x,y,z) cout << #x << " = " << (x) << ", " << #y << " = " << (y) << ", " << #z << " = " << (z) << endl
#define showv(v) rep(i,v.size()) printf("%d%c", v[i], i==v.size()-1?'\n':' ')
#define showv2(v) rep(j,v.size()) showv(v[j])
#define showt(t,n) rep(i,n) printf("%d%c", t[i], i==n-1?'\n':' ')
#define showt2(t,r,c) rep(j,r) showt(t[j],c)
#define showvp(p) rep(i,p.size()) printf("%d %d\n", p[i].first, p[i].second);
#define printv(v) rep(i,v.size()) printf("%d\n", v[i])
#define printt(t,n) rep(i,n) printf("%d\n", t[i])
#define incl(v,x) (find(all(v),x)!=v.end())
#define incls(s,c) (s.find(c)!=string::npos)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define bit(n,k) ((n>>k)&1)
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define uni(x) x.erase(unique(all(x)),x.end())
#define SP << " " <<
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using P = pair<int, int>;
using T = tuple<int, int, int>;
using vp = vector<P>;
using vt = vector<T>;
const int mod = 1000000007;
const double EPS = 1e-9;
const int INF = (1<<30)-1;
const ll LINF = (1LL<<62)-1;
#define dame { puts("No"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
inline int in() { int x; cin >> x; return x;}
inline ll lin() { ll x; cin >> x; return x;}
inline char chin() { char x; cin >> x; return x;}
inline string stin() { string x; cin >> x; return x;}
inline double din() { double x; cin >> x; return x;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}
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; }
char itoa(int n) { return n + '0';}
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
int main () {
int n, k;
cin >> n >> k;
vi a(n);
rep(i,n) cin >> a[i];
ll ans = LINF;
rep(b,1<<n) {
if (pcnt(b) < k) continue;
vi x = a;
ll cost = 0;
int pmax = -1;
rep(i,n) {
if (bit(b,i)) {
if (pmax+1 > x[i]) {
cost += pmax+1 - x[i];
x[i] = pmax+1;
}
}
chmax(pmax, x[i]);
}
chmin(ans, cost);
}
cout << ans << endl;
return 0;
}
| 0
| 43,149,091
|
#include <bits/stdc++.h>
using namespace std;
int main(void){
long long n,k,ans=0;
cin >> n >>k;
for(int i=k;i<=n+1;i++){
ans+=i*(n-i+1)%1000000007+1;
if(ans>=1000000007){
ans%=1000000007;
}
}
cout << ans <<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
ll N,K; cin >> N >> K;
vector<pair<ll,ll>> sushi(N);
REP(i,N){
ll t,d; cin >> t >> d;
sushi[i] = make_pair(d,t-1);
}
sort(ALL(sushi), greater<pair<ll,ll>>());
map<ll,ll> num;
priority_queue<pair<ll,ll>> S;
ll ans = 0;
FOR(i,K,N){
S.push(sushi[i]);
}
REP(i,K){
num[sushi[i].second]++;
ans += sushi[i].first;
}
ll f = ans;
ans += (ll)num.size()*(ll)num.size();
REPR(i,K-1){
if(S.empty()) break;
if(num[sushi[i].second]> 1){
while(!S.empty()){
auto top_sushi = S.top(); S.pop();
if(!num.count(top_sushi.second)){
f = f - sushi[i].first + top_sushi.first;
num[top_sushi.second]++;
num[sushi[i].second]--;
ll next_ans = f + (ll)num.size() * (ll)num.size();
sushi[i] = top_sushi;
ans = max(ans, next_ans);
break;
}
}
}
}
cout << ans << endl;
return 0;
}
| 0
| 64,154,038
|
#include <bits/stdc++.h>
using namespace std;
#define rep(k,dst) for(int i=k; i<dst; i++)
#define rep2(k,dst) for(int j=k; j<dst; j++)
#define INF 1000000000000
#define MOD 10000007
#define ll long long
#define pb pop_back
template<typename T> inline void chMin(T* a, T* b) {if(*a>*b) *a=*b;}
template<typename T> inline void chMax(T* a, T* b) {if(*a<*b) *a=*b;}
template<typename T> inline int divUp(T a, T b) {return ((a+b-1)/b);}
const double PI = acos(-1);
int main(){
ll n, k; cin >> n >> k;
ll ans=0;
vector<ll> h(n);
rep(0,n) cin >> h[i];
sort(h.begin(), h.end());
rep(0,k) h.pop_back();
rep(0,n-k) ans += h[i];
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define repm(i, a, n) for (ll i = a; i >= n; i--)
#define INF 1e9
#define LINF 1e17
#define MOD (int)(1e9 + 7)
#define mod (int)(1e9 + 7)
#define pi 3.141592653589
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define vd vector<double>
#define vb vector<bool>
#define vs vector<string>
#define vii vector<vector<int>>
#define vllll vector<vector<ll>>
#define ALL(a) (a).begin(), (a).end()
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
void print(bool f)
{
cout << (f ? "Yes" : "No") << endl;
}
void Print(bool f)
{
cout << (f ? "YES" : "NO") << endl;
}
vll sou(51), meet(51);
ll where(ll num, ll x)
{
if (num == 0)
{
return 1;
}
if (x == 0)
{
return 0;
}
if (x == sou[num] - 1)
{
return meet[num - 1] * 2 + 1;
}
if (x == sou[num] / 2)
{
return meet[num - 1] + 1;
}
if (x < sou[num] / 2)
{
return where(num - 1, x - 1);
}
if (x > sou[num] / 2)
{
return meet[num - 1] + 1 + where(num - 1, x - sou[num] / 2 - 1);
}
}
int main(void)
{
ll n, x;
cin >> n >> x;
sou[0] = 1, meet[0] = 1;
rep(i, 0, n)
{
sou[i + 1] = sou[i] * 2 + 3;
meet[i + 1] = meet[i] * 2 + 1;
}
cout << where(n, x - 1) << endl;
}
| 0
| 85,804,290
|
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
double l;
cin >> l;
cout << fixed << setprecision(10);
cout << (l * 3000 / 3) * (l * 3000 / 3) * (l * 3000/ 3) / 27000000000;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
int k,u;
int v;
int table[200][200]={};
for(int i=0;i<n;i++){
cin >> u;
cin >> k;
for(int j=0;j<k;j++){
cin >> v;
table[u-1][v-1]=1;
}
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(j)cout << " ";
cout << table[i][j];
}
cout << endl;
}
return 0;
}
| 0
| 44,793,439
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int64_t MOD=1000000007;
const long long INF = 1LL<<60;
bool kaibun(string S){
int t=S.size();
bool K=true;
rep(i,t){
if(S.at(i)!=S.at(t-1-i)) K=false;
}
return K;
}
void YN(bool x){
if(x) cout<<"Yes";
else cout<<"No";
}
int main() {
string S,s1,s2; cin>>S;
int N=S.size();
rep(i,(N-1)/2){
s1.push_back(S.at(i));
s2.push_back(S.at(i+(N+1)/2));
}
bool a=kaibun(s1),b=kaibun(s2);
YN(a&&b&&s1==s2);
}
|
#include <iostream>
using namespace std;
int main() {
while (true) {
int x, y;
cin >> x >> y;
if (x > y) {
swap(x, y);
}
if (x == 0 && y == 0) {
break;
} else {
cout << x << " " << y << endl;
}
}
}
| 0
| 99,938,081
|
#include <bits/stdc++.h>
#define DEBUG_ENABLED 0
typedef long long int ll;
int main()
{
using namespace std;
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<pair<int, int>> ab;
for (int i = 0; i < M; i++)
{
int a, b;
cin >> a >> b;
pair<int, int> p;
p = make_pair(a, b);
ab.push_back(p);
p = make_pair(b, a);
ab.push_back(p);
}
vector<int> order;
for (int i = 1; i <= N; i++)
{
order.push_back(i);
}
int counter = 0;
do
{
if (DEBUG_ENABLED)
{
for (int i = 0; i < N; i++)
cout << order.at(i);
cout << endl;
}
ll visited = 0L;
if (order.at(0) != 1)
{
if (DEBUG_ENABLED)
cout << "pass." << endl;
continue;
}
visited |= (1 << 1);
for (int i = 1; i <= N - 1; i++)
{
int from = order.at(i - 1);
int to = order.at(i);
if (DEBUG_ENABLED)
cout << "from:" << from << " to:" << to << endl;
bool found = false;
for (int i = 0; i < ab.size(); i++)
{
auto p = ab.at(i);
if (p.first == from && p.second == to)
{
found = true;
break;
}
}
if (found)
{
visited |= (1 << (to));
if (DEBUG_ENABLED)
cout << "marked:" << to << endl;
}
}
if (DEBUG_ENABLED)
{
cout << "visited:" << visited << " count:" << __builtin_popcount(visited) << endl;
}
if (__builtin_popcount(visited) == N)
{
++counter;
}
} while (next_permutation(order.begin(), order.end()));
cout
<< counter << endl;
return 0;
}
|
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
#include<set>
#include<map>
#include<bitset>
using namespace std;
typedef long long ll;
#define i_7 1000000007
#define i_5 1000000005
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
else return c+i_7;
}
typedef pair<int,int> i_i;
typedef pair<ll,ll> l_l;
#define inf 100000000
#define N 200004
ll kai[N];
ll kai2[N];
ll po(ll i,ll p){
if(p==0)return 1;
else if(p==1)return mod(i);
else if(p%2==0)return mod(po(mod(mod(i)*mod(i)),p/2));
else return mod(mod(i)*mod(po(i,p-1)));
}
void calc(){
kai[0]=1;
kai2[0]=1;
for(int i=1;i<N;i++){
kai[i]=mod(kai[i-1]*i);
kai2[i]=mod(po(kai[i],i_5));
}
}
ll comb(ll n,ll k){
if(n==0){
if(k==0)return 1;
else return 0;
}
else if(n<k)return 0;
else return mod(mod(mod(kai[n])*mod(kai2[n-k]))*mod(kai2[k]));
}
int main(){
calc();
ll n;cin>>n;ll a[n+1];ll c[n+1];for(ll i=1;i<=n;i++)c[i]=0;
for(ll i=0;i<=n;i++){cin>>a[i];c[a[i]]++;}
ll d=0;
for(ll i=1;i<=n;i++){
if(c[i]==2)d=i;
}
ll s[2];ll qqq=0;
for(ll i=0;i<=n;i++){
if(a[i]==d){s[qqq]=i;qqq++;}
}
ll l=s[0],r=n-s[1];
for(ll q=1;q<=n+1;q++){
cout<<mod(comb(n+1,q)-comb(l+r,q-1))<<endl;
}
return 0;
}
| 0
| 18,435,897
|
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T>
bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
template <class C>
void print(const C &c, std::ostream &os = std::cout) {
std::copy(std::begin(c), std::end(c), std::ostream_iterator<typename C::value_type>(os, " "));
os << std::endl;
}
int main() {
ll d = 10000000000;
cout << "? " << d << endl;
string ans;
cin >> ans;
if (ans == "Y") {
while (d > 0) {
cout << "? " << d - 1 << endl;
cin >> ans;
if (ans == "N")
break;
d /= 10;
if (d == 1)
break;
}
cout << "! " << d << "\n";
} else {
while (true) {
d /= 10;
cout << "? " << d << endl;
cin >> ans;
if (ans == "Y")
break;
}
ll ok = d * 10;
ll ng = d;
auto check = [&](ll m) {
cout << "? " << m << endl;
cin >> ans;
return ans == "Y";
};
while (ng + 1 != ok) {
ll mid = (ok + ng) / 2 * 10;
if (check(mid))
ok = mid / 10;
else
ng = mid / 10;
}
cout << "! " << ok << "\n";
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
class Dice{
private:
int d[6];
public:
Dice(int n0, int n1, int n2, int n3, int n4, int n5){
d[0]=n0; d[1]=n1; d[2]=n2; d[3]=n3; d[4]=n4; d[5]=n5;
}
int get_top(){
return d[0];
}
int get_front(){
return d[1];
}
int get_right(){
return d[2];
}
int get_left(){
return d[3];
}
int get_back(){
return d[4];
}
int get_bottom(){
return d[5];
}
void Roll(string op){
for(unsigned int i=0;i<op.length();i++){
switch(op[i]){
case 'N': RollN(); break;
case 'E': RollE(); break;
case 'W': RollW(); break;
case 'S': RollS(); break;
}
}
}
void RollN(){
int tmp=d[0];
d[0]=d[1];
d[1]=d[5];
d[5]=d[4];
d[4]=tmp;
}
void RollE(){
int tmp=d[0];
d[0]=d[3];
d[3]=d[5];
d[5]=d[2];
d[2]=tmp;
}
void RollW(){
int tmp=d[0];
d[0]=d[2];
d[2]=d[5];
d[5]=d[3];
d[3]=tmp;
}
void RollS(){
int tmp=d[0];
d[0]=d[4];
d[4]=d[5];
d[5]=d[1];
d[1]=tmp;
}
};
int main(){
int a, b, c, d, e, f, q;
cin >> a >> b >> c >> d >> e >> f >> q;
Dice di(a, b, c, d, e, f);
int top, front;
for(int i=0;i<q;i++){
cin >> top >> front;
for(int j=0;j<4;j++){
bool flg = false;
di.RollE();
for(int k=0;k<4;k++){
di.RollN();
for(int l=0;l<4;l++){
di.RollE();
if(di.get_top()==top && di.get_front()==front){
flg=true; break;
}
}
if(flg) break;
}
if(flg) break;
}
cout << di.get_right() << endl;
}
return 0;
}
| 0
| 53,803,047
|
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
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 () {
ll h,w;
cin >> h >> w;
ll ans = 1e18;
ll h1,h2,h3;
ll w1,w2,w3;
ll s1,s2,s3;
ll maxs,mins;
auto calc_square = [&](){
s1 = h1*w1;
s2 = h2*w2;
s3 = h3*w3;
};
auto calc_tmp = [&](){
maxs = max({s1,s2,s3});
mins = min({s1,s2,s3});
ans = min(ans,maxs-mins);
};
for(int i = 1;i<=h-1;i++) {
h1 = i;
h2 = (h-h1)/2;
h3 = (h-h1)-h2;
w1 = w;
w2 = w;
w3 = w;
calc_square();
calc_tmp();
h2 = h-h1;
h3 = h-h1;
w2 = w/2;
w3 = w-w2;
calc_square();
calc_tmp();
}
for(int i = 1;i<=w-1;i++) {
h1 = h;
h2 = h/2;
h3 = h-h2;
w1 = i;
w2 = w-w1;
w3 = w-w1;
calc_square();
calc_tmp();
h1 = h;
h2 = h;
h3 = h;
w1 = i;
w2 = (w-w1)/2;
w3 = (w-w1)-w2;
calc_square();
calc_tmp();
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define fast() ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(x) begin(x),end(x)
#define rz(x) resize(x)
#define asn(x,y) assign(x,y)
#define mem(a,b) memset(a,b,sizeof(a))
#define sz(x) ((int)(x.size()))
#define eb emplace_back
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define ins insert
#define vi vector<int>
#define pii pair<int,int>
#define mii map<int,int>
#define F first
#define S second
#define makep make_pair
#define maket make_tuple
#define remax(a,b) a=max(a,b)
#define remin(a,b) a=min(a,b)
#define bitcount(x) __builtin_popcountll(x)
#define iceil(n,x) (((n)+(x)-1)/(x))
#define gcd(a,b) (__gcd((a),(b)))
#define lcm(a,b) ((a)*((b)/gcd((a),(b))))
#define dbug(x) cout<<#x<<": "<<(x)<<"\n"
#define flush fflush(stdout)
#define show(x) for(auto zz:x)cout<<zz<<" ";cout<<"\n";
#define show2(x) for(auto zz:x)cout<<zz.F<<" "<<zz.S<<"\n";
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
const ld pi=acos(-1);
const ll inf=1e18,M=1e9+7;
const int N=1;
void solve()
{
int x,y,z,K;
cin>>x>>y>>z>>K;
vi a(x),b(y),c(z);
for(int i=0;i<x;++i)
cin>>a[i];
for(int i=0;i<z;++i)
cin>>b[i];
for(int i=0;i<y;++i)
cin>>c[i];
sort(a.rbegin(),a.rend());
sort(b.rbegin(),b.rend());
sort(c.rbegin(),c.rend());
set<pair<int,array<int,3>>> st;
st.ins({a[0]+b[0]+c[0],{0,0,0}});
set<array<int,3>> vis;
auto upd=[&st,a,b,c,x,y,z,K,&vis](array<int,3> arr)
{
if(arr[0]>=x || arr[1]>=y || arr[2]>=z || vis.find(arr)!=vis.end())
return;
vis.ins(arr);
int sum=a[arr[0]]+b[arr[1]]+c[arr[2]];
if(sz(st)==K)
{
int tmp=st.begin()->F;
if(tmp<sum)
{
st.erase(st.begin());
st.ins({sum,arr});
}
}
else
st.ins({sum,arr});
};
int sum;
array<int,3> arr;
while(!st.empty() && K--)
{
sum=st.rbegin()->F;
arr=st.rbegin()->S;
st.erase(--st.end());
cout<<sum<<"\n";
for(int i=0;i<3;++i)
{
++arr[i];
upd(arr);
--arr[i];
}
}
}
int32_t main()
{
fast();
int t=1;
for(int z=1;z<=t;++z)
{
solve();
}
return 0;
}
| 0
| 32,626,248
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
#define int ll
#define FOR(i,s,e) for(ll i = s; i <= (ll)e; ++i)
#define DEC(i,s,e) for(ll i = s; i >= (ll)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{" << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define ll long long
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define f first
#define s second
#define reach cerr << "LINE: " << __LINE__ << "\n";
typedef pair <ll, ll> pi;
typedef tuple<ll,ll,ll> ti3;
string cts(char x) {string t(1,x); return t;}
ll rand(ll a, ll b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 500;
const long long oo = (ll)1e18 + 500;
template <typename T> void chmax(T& a, T b) { a = max(a, b); }
template <typename T> void chmin(T& a, T b) { a = min(a, b); }
const int MAXN = 1000005;
#ifndef LOCAL
#define cerr if(0)cout
#endif
ll A[MAXN], dp[MAXN];
int32_t main()
{
IAMSPEED
int n; cin >> n;
FOR(i,1,n) cin >> A[i];
int ans = 0;
FOR(i,1,n) {
if(A[i]<=A[i-1])dp[i]=dp[i-1]+1;
else dp[i] = 1;
chmax(ans,dp[i]);
}
cout << ans-1;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
#include <functional>
#include <string>
#include <cmath>
#include <iomanip>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define beg begin()
#define end end()
void _main(){
int n,m,d; cin >> n >> m >> d;
vector<int> c(n);
vector<vector<int>> a(n,vector<int>(m));
rep(i,n){
cin >> c[i];
rep(j,m){
cin >> a[i][j];
}
}
int min = pow(10,8);
int nflag = 1;
for(int bit = 0; bit < (1<<n);bit++){
vector<int> x(m,0);
int sum = 0;
rep(i,n){
if(bit&(1<<i)){
sum += c[i];
rep(j,m){
x[j] += a[i][j];
}
}
}
auto index = min_element(x.beg, x.end)-x.beg;
if(x[index] >= d){
nflag = 0;
if(sum <= min) min = sum;
}
}
if(nflag) cout << -1 << endl;
else cout << min << endl;
return;
}
int main() {
cout << fixed << setprecision(10);
_main();
return 0;
}
| 0
| 17,499,436
|
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
#define For(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
typedef pair<int, string> P;
void printvector3(vector<P> v) {
REP(i,v.size()-1) {
cout << v[i].second << v[i].first << " ";
}
cout << v[v.size()-1].second << v[v.size()-1].first << endl;
}
void bubblesort2(vector<P> &v) {
int N = v.size();
int flag = 1;
while (flag) {
flag = 0;
for (int j = N-1; j > 0; j--) {
if (v[j].first < v[j-1].first) {
P temp = v[j];
v[j] = v[j-1];
v[j-1] = temp;
flag = 1;
}
}
}
}
void selectionsort2(vector<P> &v) {
int N = v.size();
REP(i,N) {
int minj = i;
For(j,i,N) {
if (v[j].first < v[minj].first) {
minj = j;
}
}
if (v[i].first != v[minj].first) {
P temp = v[i];
v[i] = v[minj];
v[minj] = temp;
}
}
}
bool checkifstable(vector<P> v, vector<P> w) {
REP(i,v.size()) {
if (v[i].second != w[i].second) {
return false;
}
}
return true;
}
int main() {
int N;
cin >> N;
vector<P> v;
REP(i,N) {
string j;
cin >> j;
int c = j[1]-'0';
string s; s.push_back(j[0]);
P p = make_pair(c, s);
v.push_back(p);
}
vector<P> w(v);
bubblesort2(v);
printvector3(v);
cout << "Stable" << endl;
selectionsort2(w);
printvector3(w);
if (checkifstable(v,w)) {
cout << "Stable" << endl;
}else {
cout << "Not stable" << endl;
}
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
int main()
{
int n;
std::cin >> n;
std::vector<int> min_count(26, 999);
for (int i = 0; i < n; ++i)
{
std::string s;
std::cin >> s;
std::vector<int> count(26);
for (const char c : s)
{
++count[c - 'a'];
}
std::transform(min_count.begin(), min_count.end(),
count.begin(), min_count.begin(),
[](const int x, const int y) {
return std::min(x, y);
});
}
for (int i = 0; i < 26; ++i)
{
for (int j = 0; j < min_count[i]; ++j)
{
std::cout << static_cast<char>('a' + i);
}
}
std::cout << std::endl;
return 0;
}
| 0
| 25,885,899
|
#include<bits/stdc++.h>
#include<algorithm>
using namespace std;
#define cool ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define MAX 1000001
#define mod 1000000007
#define pie 3.14159265358979323846
void solve()
{
int n,i,j,ans=0;
cin>>n;
int a[n];
for(i=0;i<n;i++)
cin>>a[i];
for(i=0;i<n;i++){
for(j=i+1;j<n;j++)
ans+=a[i]*a[j];
}
cout<<ans;
}
int main()
{
cool;
int t;
t=1;
while(t--){
solve();
}
return 0;
}
|
#include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<unordered_set>
#include<unordered_map>
#include<bitset>
using namespace std;
#define INF 2000000007
#define LINF 100000000000000007
#define MOD 1000000007
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define repb(i, n) for (int i = n - 1; i >= 0; i--)
#define MODE 0
#ifdef MODE
#define DEB(X) cout<< #X <<": "<<X<<" ";
#define ARDEB(i,X) cout<< #X <<"["<<i<<"]: "<<X[i]<<" ";
#define END cout<<endl;
#else
#define DEB(X) {}
#define ARDEB(i,X) {}
#define END {}
#endif
typedef long long ll;
typedef pair<int,int> P;
struct edge{int to,cost;};
int ceil2(int a,int b){if(a%b){return a/b+1;}else{return a/b;}}
using namespace std;
double n,m,d,ans;
signed main(){
cin>>n>>m>>d;
if(d==0)printf("%.15lf",(n-d)*(m-1.0)/(n*n));
else printf("%.15lf",(n-d)*2.0*(m-1.0)/(n*n));
}
| 0
| 21,616,442
|
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
using namespace std;
int main()
{
int n;
scanf("%d",&n);
if(n>=1800)
cout<<"1"<<endl;
else if(n>=1600)
cout<<"2"<<endl;
else if(n>=1400)
cout<<"3"<<endl;
else if(n>=1200)
cout<<"4"<<endl;
else if(n>=1000)
cout<<"5"<<endl;
else if(n>=800)
cout<<"6"<<endl;
else if(n>=600)
cout<<"7"<<endl;
else
cout<<"8"<<endl;
return 0;
}
|
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <queue>
#define INF (1e+9)
#define LLINF (1e+18)
#define LL long long
using namespace std;
typedef struct info{
int nx;
int ny;
int cost;
int target;
info(int a,int b,int c,int d){
nx = a;
ny = b;
cost = c;
target = d;
}
}info;
bool isNumChar(char c){
if((0 <= c-48)&&(c-48 <= 9))return true;
return false;
}
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
int W,H;
int N;
int sx[16] = {0};
int sy[16] = {0};
char field[1024][1024] = {""};
int record[1024][1024][12] = {0};
bool flag[16] = {false};
queue<info> que;
int ans;
int recordReset(){
for(int i = 0;i < 1024;i++){
for(int j = 0;j < 1024;j++){
for(int k = 0;k < 12;k++){
record[i][j][k] = INF;
}
}
}
}
int bfs(){
info now(0,0,0,0);
info next(0,0,0,0);
for(int i = 0;i < N;i++){
next = info(sx[i],sy[i],0,i+1);
que.push(next);
}
recordReset();
while(!que.empty()){
now = que.front();
que.pop();
if(!flag[now.target]){
if(record[now.nx][now.ny][now.target] > now.cost){
record[now.nx][now.ny][now.target] = now.cost;
if((sx[now.target] == now.nx)&&(sy[now.target] == now.ny)){
flag[now.target] = true;
ans += record[now.nx][now.ny][now.target];
}
else{
switch(field[now.nx][now.ny]){
case 'X':
break;
default:
for(int i = 0;i < 4;i++){
next = info(now.nx + dx[i],now.ny + dy[i],now.cost + 1,now.target);
que.push(next);
}
break;
}
}
}
}
}
}
int main (void){
scanf("%d%d",&H,&W);
scanf("%d",&N);
ans = 0;
for(int i = 0;i < 1024;i++){
for(int j = 0;j < 1024;j++){
field[j][i] = 'X';
}
}
for(int i = 0;i < 16;i++){
flag[i] = false;
}
for(int i = 1;i <= H;i++){
scanf(" ");
for(int j = 1;j <= W;j++){
scanf("%c",&field[j][i]);
if(isNumChar(field[j][i])){
sx[field[j][i]-48] = j;
sy[field[j][i]-48] = i;
}
else if(field[j][i] == 'S'){
sx[0] = j;
sy[0] = i;
}
}
}
bfs();
printf("%d\n",ans);
return 0;
}
| 0
| 37,136,879
|
#include <iostream>
using namespace std;
int main(void){
int n,x;
int c = 0;
while(1){
cin >> n >> x;
if(n == 0 && 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) c += 1;
}
}
}
cout << c << endl;
c = 0;
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vector<pii>
#define vpll vector<pll>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define rep1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; i++)
#define repr(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rep1r(i, n) for (int i = ((int)(n)); i >= 1; i--)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RSORT(x) sort(rall(x));
#define pb push_back
#define mp make_pair
#define INF (1e9)
#define PI (acos(-1))
#define EPS (1e-7)
ull gcd(ull a, ull b) { return b ? gcd(b, a % b) : a; }
ull lcm(ull a, ull b) { return a / gcd(a, b) * b; }
int main(){
int n, l;
cin >> n >> l;
vs s(n);
rep(i, n) cin >> s[i];
VSORT(s);
string ans;
rep(i, n) ans += s[i];
cout << ans << endl;
return 0;
}
| 0
| 100,192,798
|
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <string.h>
using namespace std;
int main() {
int n, l, y=0;
cin >> n;
string s[n], f;
int a[n];
for(int i=0; i<n; i++) {
cin >> s[i];
cin >> a[i];
}
cin >> f;
for(int i=0; i<n; i++) {
if(strcmp(s[i].c_str(), f.c_str()) == 0) {
l=i+1;
break;
}
}
for(int i=l; i<n; i++) y+= a[i];
cout << y << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
string A,B;
cin >> A;
cin >> B;
if(A.size()>B.size()){
cout << "GREATER" << endl;
}else if(A.size()<B.size()){
cout << "LESS" << endl;
}else{
for(long long i=0;i<A.size();i++){
if(A[i]>B[i]){
cout << "GREATER" << endl;
return 0;
}else if(A[i]<B[i]){
cout << "LESS" << endl;
return 0;
}else if(i==A.size()-1){
cout << "EQUAL" << endl;
return 0;
}
}
}
return 0;
}
| 0
| 41,688,228
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int inf = 0x3f3f3f3f;
constexpr ll linf = 0x3f3f3f3f3f3f3f3fLL;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n; cin >> n;
cout << n * 800 - (n / 15) * 200 << endl;
return 0;
}
|
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define pb push_back
#define INF 9223372036854775807
#define endl '\n'
#define pii pair<ll int,ll int>
#define vi vector<ll int>
#define all(a) (a).begin(),(a).end()
#define F first
#define S second
#define sz(x) (ll int)x.size()
#define hell 1000000007
#define rep(i,a,b) for(ll int i=a;i<b;i++)
#define lbnd lower_bound
#define ubnd upper_bound
#define bs binary_search
#define mp make_pair
#define lower(u) transform(u.begin(), u.end(), u.begin(), ::tolower);
#define upper(u) transform(u.begin(), u.end(), u.begin(), ::toupper);
using namespace std;
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define N 100005
ll n,k;
ll dp[101][N];
ll a[101];
ll dps(ll i,ll l,ll r)
{
ll x=0,y=0;
if(l!=-1)
{
x=dp[i][l];
}
y=dp[i][r];
return (y-x+hell)%hell;
}
void solve()
{
cin>>n>>k;
rep(i,1,n+1)
{
cin>>a[i];
}
rep(i,0,k+1)
dp[0][i]=1;
rep(i,1,n+1)
{
dp[i][0]=1;
rep(j,1,k+1)
{
dp[i][j]=(dp[i][j-1]+dps(i-1,j-min(j,a[i])-1,j))%hell;
}
}
cout<<dps(n,k-1,k)<<endl;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int TESTS=1;
while(TESTS--)
{
solve();
}
return 0;
}
| 0
| 45,748,796
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
int main()
{
int W, H, N;
int x, y, a;
cin >> W >> H >> N;
int minx = 0, maxx=W;
int miny = 0, maxy=H;
rep(i, N){
cin >> x >> y >> a;
if(a==1){
minx = max(minx, x);
}else if(a==2){
maxx = min(maxx, x);
}else if(a==3){
miny = max(miny, y);
}else if(a==4){
maxy = min(maxy, y);
}
}
if(maxy < miny || maxx < minx){
cout << 0 << endl;
}else{
cout << (maxy-miny)*(maxx-minx) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define MOD 1000000007
const int INF = 1LL<<30;
int main(){
int n,k;
cin>>n>>k;
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];
vector<ll> v;
rep(l,n){
for(int r=l;r<n;r++){
v.push_back(s[r+1]-s[l]);
}
}
int m=v.size();
sort(all(v));
vector<int> ok(m,1);
ll ans=0;
for(int d=60;d>=0;d--){
ll msk=1LL<<d;
int cnt=0;
rep(i,m){
if((v[i] & msk) && ok[i]) cnt++;
}
if(k<=cnt){
ans+=msk;
rep(i,m){
if(!(v[i] & msk) && ok[i]) ok[i]=0;
}
}
}
cout<<ans<<endl;
}
| 0
| 100,829,694
|
#include <bits/stdc++.h>
using namespace std;
int N,K;
const int n=200010;
int cnt[n];
int main()
{
cin>>N>>K;
for (int i = 0; i < n; i++)
{
cnt[i] = 0;
}
for (int i = 0; i < N; i++)
{
int a;
cin>>a;
cnt[a]++;
}
sort(cnt,cnt+n);
int ans=0;
for (int i = 0; i < n-K; i++)
{
ans+=cnt[i];
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
string T="";
for(int i=0;i<S.size();i++){
if(S.at(i)!='x') T+=S.at(i);
}
for(int i=0;i<T.size()/2;i++){
if(T.at(i)!=T.at(T.size()-1-i)){
cout << -1 << endl;
return 0;
}
}
int l=0;
int r=S.size()-1;
int ans=0;
while(l<r){
if(S.at(l)==S.at(r)){
l++;
r--;
continue;
}
if(S.at(l)=='x'){
ans++;
l++;
continue;
}
if(S.at(r)=='x'){
ans++;
r--;
continue;
}
}
cout << ans << endl;
return 0;
}
| 0
| 19,349,326
|
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#define rep(i,n) for(int i = 0; i < n; i++)
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define mod 1000000007
using ll = long long;
using namespace std;
int main(){
ll n;
cin >> n;
vector<ll> a(n);
rep(i, n){
ll A;
cin >> A;
A -= i + 1;
a[i] = A;
}
sort(a.begin(), a.end());
if(n % 2 == 0){
ll ans = 0, ans2 = 0;
ll num = a[n / 2];
rep(i, n) ans += abs(a[i] - num);
num = a[n / 2 - 1];
rep(i, n) ans2 += abs(a[i] - num);
ans = min(ans, ans2);
cout << ans << endl;
}else{
ll num = a[n / 2];
ll ans = 0;
rep(i, n) ans += abs(a[i] - num);
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main()
{
int n = 0;
fscanf(stdin, "%d", &n);
vector<int> heap(n + 5, 0);
for (int i = 1; i <= n; ++i) {
fscanf(stdin, "%d", &heap[i]);
}
for (int i = 1; i <= n; ++i) {
fprintf(stdout, "node %i: key = %d, ", i, heap[i]);
if (i / 2 > 0) {
fprintf(stdout, "parent key = %d, ", heap[i / 2]);
}
if (2 * i <= n) {
fprintf(stdout, "left key = %d, ", heap[2 * i]);
}
if (2 * i + 1 <= n) {
fprintf(stdout, "right key = %d, ", heap[2 * i + 1]);
}
fprintf(stdout, "\n");
}
return 0;
}
| 0
| 76,363,258
|
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#define maxn 1001
#define re register
#define FOR(i, l, r) for(re int i = l; i <= r; ++i)
#define DFR(i, l, r) for(re int i = l; i >= r; --i)
using namespace std;
int n, m, c, r, t, x, y, z;
char b[2][2];
int main() {
b[0][0] = 'R';
b[1][0] = 'Y';
b[0][1] = 'G';
b[1][1] = 'B';
scanf("%d%d%d", &n, &m, &t);
FOR(i, 1, n) {
FOR(j, 1, m) {
x = i+j; y = i-j+m;
putchar(b[x/t%2][y/t%2]);
}
putchar(10);
}
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<long long>;
using pll = pair<long long, long long>;
const string YES = "Yes";
const string NO = "No";
struct UnionFindPotential{
vll parent;
vll potential;
vll rank;
UnionFindPotential(ll n){
parent = vll(n);
potential = vll(n, 0);
rank = vll(n, 0);
for(ll i=0; i< n; i++) parent[i] = i;
}
ll find(ll x){
if(parent[x] == x) return x;
else{
ll r = find(parent[x]);
potential[x] += potential[parent[x]];
parent[x] = r;
return r;
}
}
ll get_potential(ll x){
find(x);
return potential[x];
}
void unite(ll x, ll y, ll d){
d += get_potential(x);
d -= get_potential(y);
x = find(x); y = find(y);
if(x == y) return;
if(rank[x] < rank[y]){
parent[x] = y;
potential[x] = -d;
}
else{
if(rank[x] == rank[y]) rank[x]++;
parent[y] = x;
potential[y] = d;
}
return;
}
bool same(ll x, ll y){
return find(x) == find(y);
}
};
void solve(long long N, long long M, std::vector<long long> L, std::vector<long long> R, std::vector<long long> D){
UnionFindPotential uf(N);
bool isGood = true;
for(ll i=0; i< M; i++){
ll x = L[i]-1, y = R[i] -1, d = D[i];
uf.unite(x, y, d);
if(uf.get_potential(y)-uf.get_potential(x) != d){
isGood = false;
break;
}
}
if(isGood) cout << YES << endl;
else cout << NO << endl;
}
int main(){
long long N;
scanf("%lld",&N);
long long M;
scanf("%lld",&M);
std::vector<long long> L(M);
std::vector<long long> R(M);
std::vector<long long> D(M);
for(int i = 0 ; i < M ; i++){
scanf("%lld",&L[i]);
scanf("%lld",&R[i]);
scanf("%lld",&D[i]);
}
solve(N, M, std::move(L), std::move(R), std::move(D));
return 0;
}
| 0
| 12,828,151
|
#include <bits/stdc++.h>
#define Fast cin.tie(0), ios::sync_with_stdio(0)
#define All(x) x.begin(), x.end()
#define louisfghbvc int t; cin >> t; while(t--)
#define sz(x) (int)(x).size()
using namespace std;
typedef long long LL;
typedef pair<LL, LL> ii;
typedef vector<LL> vi;
template<typename T> istream& operator>>(istream &is, vector<T> &v) { for(auto &it : v) is >> it; return is; }
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { os << '{'; string sep = ""; for(const auto &x : v) os << sep << x, sep = ", "; return os << '}'; }
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
void dbg_out() { cerr << "\n"; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
const int N = 1e3+5;
void solve(){
string s, t;
cin >> s >> t;
int n = sz(s), m = sz(t);
int mn = m;
for(int i = 0; i+m-1 < n; ++i){
int ch = 0;
for(int j = 0; j < m; ++j){
if(s[i+j] != t[j]){
ch++;
}
}
mn = min(mn, ch);
}
cout << mn << "\n";
}
int main()
{
Fast;
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin >> N ;
vector<int> A(N);
for(int i=0; i<N; i++)
{
cin >> A.at(i);
}
int max=0;
vector<int> B(N);
for(int i=0; i<N; i++)
{
if(max<A.at(i))
{
max=A.at(i);
}
B.at(i)=A.at(i);
}
sort(B.begin(),B.end());
reverse(B.begin(),B.end());
int submax=max;
for(int i=0; i<N; i++)
{
if(!(B.at(i)==max))
{
submax=B.at(i);
break;
}
}
for(int i=0; i<N; i++)
{
if(!(B.at(i)==max))
{
submax=B.at(i);
break;
}
}
if(B.at(0)==B.at(1))
{
for(int i=0; i<N; i++)
cout << max << endl;
}
else
{
for(int i=0; i<N; i++)
{
if(!(A.at(i)==max))
{
cout << max << endl;
}
else
{
cout << submax << endl;
}
}
}
}
| 0
| 20,726,253
|
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
#define ll long long
#define ld long double
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define sz(x) ((int)(x).size())
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
#define all(x) (x).begin(),(x).end()
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
int main()
{
int n,m;cin >> n >> m;
vector<int> a(n);
int sum = 0;
rep(i,n)
{
cin >> a[i];
sum += a[i];
}
int counter = 0;
rep(i,n)
{
if(4*a[i]*m < sum)
{
continue;
}
counter++;
}
if(counter >= m)
{
cout << "Yes" << endl;
}else
{
cout << "No" << endl;
}
}
|
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi=vector<int>;
int main() {
int N,K; cin>>N>>K;
int R,S,P; cin>>R>>S>>P;
string T;cin>>T;
vi sum(3,0);
map<char,int> ctoi;
ctoi['r']=0;ctoi['s']=1;ctoi['p']=2;
for (int i = 0; i < K; i++)sum[ctoi[T[i]]]++;
vector<bool> lose(N,false);
for (int i = K; i < N; i++){
if(T[i]==T[i-K] && !lose[i-K])lose[i]=true;
else{
sum[ctoi[T[i]]]++;
lose[i]=false;
}
}
cout<<sum[0]*P+sum[1]*R+sum[2]*S<<endl;
}
| 0
| 50,944,612
|
#include <bits/stdc++.h>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0); std::cout.tie(0);
int x = 0, t = 0;
std::cin >> x >> t;
if (x > t)
std::cout << x - t << std::endl;
else
std::cout << 0 << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fs first
#define se second
#define pi 2*acos(0)
#define PI 3.14159265358979323846264338
typedef long long ll;
typedef unsigned long long ull;
typedef pair < int , int > pii;
typedef pair < ll , ll > pll;
const int N = 1000010;
const int MX = 123456;
const int mod = (int)1e9 + 7;
const int base = 1023456789;
const ull BS1 = 10000019ULL;
const int INF = (1 << 30);
template < class T > inline void fastScan(T &x){
register char c = getchar();
int neg = 0; x = 0;
for( ; (c < 48 || c > 57) && (c != '-'); c = getchar());
if(c == '-') { neg = 1; c = getchar(); }
for( ; c > 47 && c < 58; c = getchar()){
x = (x << 1) + (x << 3) + c - 48;
}
if(neg) x = -x;
}
int fx[]={1,-1,0,0};
int fy[]={0,0,-1,1};
char s[N];
int dp[1 << 26];
int main(){
scanf("%s", s);
int len = strlen(s);
for(int i = 0; i < (1 << 26); i++){
dp[i] = 1e9;
}
dp[0] = 0;
int hand = 0;
for(int i = 0; i < len; i++){
hand = hand ^ (1 << (s[i] - 'a'));
int res = dp[hand] + 1;
for(int j = 0; j < 26; j++){
res = min(res, dp[hand ^ (1 << j)] + 1);
}
if(i + 1 == len){
printf("%d\n", res);
}
dp[hand] = min(dp[hand], res);
}
return 0;
}
| 0
| 65,518,058
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin>>S;
unordered_set<int> A;
for(char c:S)
A.insert(c);
for(char c='a';(int)c<='z';c=(char)((int)c+1))
if(!A.count(c)){
cout<<c<<endl;
return 0;
}
cout<<"None"<<endl;
}
|
#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);
lint l = 0;
std::cout << l << "\n";
std::string sl;
std::string sr;
std::cin >> sl;
sr = sl;
if (sl == "Vacant")
return 0;
lint r = n;
lint c = (l + r) / 2;
std::cout << c << "\n";
std::string sc;
std::cin >> sc;
if (sc == "Vacant")
return 0;
for (int i = 0; i < 18; ++i)
{
if ((c - l) % 2 != 0)
{
if (sl == sc)
{
r = c;
sr = sc;
c = (r + l) / 2;
}
else
{
l = c;
sl = sc;
c = (r + l) / 2;
}
}
else if ((c - l) % 2 == 0)
{
if (sl != sc)
{
r = c;
sr = sc;
c = (r + l) / 2;
}
else
{
l = c;
sl = sc;
c = (r + l) / 2;
}
}
std::cout << c << "\n";
std::cin >> sc;
if (sc == "Vacant")
return 0;
}
return 0;
}
| 0
| 63,912,607
|
#include <iostream>
#include <functional>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <iomanip>
#include <complex>
#include <random>
#include <bitset>
using namespace std;
#define repi(i,n) for(int i=0;i<n;++i)
#define rep(i,n) for(ll i=0;i<n;++i)
#define repinvi(i,n) for(int i=n-1;i>=0;--i)
#define sll(n) scanf("%lld", &n);
#define sii(n) scanf("%d", &n);
#define slf(n) scanf("%lf", &n);
#define pll pair<ll,ll>
#define pii pair<int,int>
#define psi pair<si,si>
typedef long long ll;
typedef double lf;
typedef short int si;
void Main(){
ll P, N;
string S;
sll(N);
sll(P);
cin >> S;
ll ans = 0;
if(P==2 || P==5){
for(ll i=N-1;i>=0;i--){
ll digit = S[i] - '0';
if(digit % P == 0){
ans += i+1;
}
}
}else{
vector<ll> res(P,0);
ll tmp_res = 0;
res[0] = 1;
ll base10_res = 1;
for(ll i=N-1;i>=0;i--){
tmp_res = (tmp_res + base10_res * (S[i]-'0')) % P;
base10_res = (10 * base10_res) % P;
++res[tmp_res];
}
rep(i, P){
ans += res[i] * (res[i]-1)/ 2;
}
}
cout << ans <<endl;
}
int main(){
Main();
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <string>
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <iomanip>
using ll = long long;
using ull = unsigned long long;
using namespace std;
#define FALSE printf("false\n");
#define TRUE printf("true\n");
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i = 0;(i) < ((int)(n));++(i))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() )
#define test(a) cout<<"line:"<<__LINE__<<"["<<(#a)<<": "<<(a)<<"]"<<endl
const int INF = 1e9+7;
const ll INFL = 9*1e18;
const int dx[8] = {1, 1, 0,-1,-1,-1, 0, 1};
const int dy[8] = {0, 1, 1, 1, 0,-1,-1,-1};
ll inline digit(ll num){int tmp = 0;while(num){tmp++;num/=10;}return tmp;}
template<typename T>inline void print(T&& x){cout<<x<<endl;}
template<typename T>inline T SUM(vector<T> vec){return accumulate(all(vec),(T)0);}
template<typename T>inline T digitSum(T num){T sum = 0;while(num){sum+=num%10;num/=10;}return sum;}
template<typename T>inline T gcd(T a,T b){if(b == 0)return a;return gcd(b,a%b);}
template<typename T>inline T lcm(T a, T b){T g = gcd(a,b);return a/g*b;}
template<typename T>inline T power(T a,T b){T tmp=1;rep(i,b){tmp*=a;}return tmp;}
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 ctoi(char c){return c-'0';}
int main() {
#define int ll
int h,w;cin>>h>>w;
int ans = INF;
chmin(ans,w * !!(h%3));
chmin(ans,h * !!(w%3));
rep(i,h){
int n = i * w;
int half1 = w/2 * (h-i);
int half2 = (w/2 + w%2) * (h-i);
int tmp = max(n,max(half1,half2)) - min(n,min(half1,half2));
chmin(ans,tmp);
}
rep(i,w){
int n = i * h;
int half1 = h/2 * (w-i);
int half2 = (h/2 + h%2) * (w-i);
int tmp = max(n,max(half1,half2)) - min(n,min(half1,half2));
chmin(ans,tmp);
}
print(ans);
return 0;
}
| 0
| 7,449,149
|
#include <iostream>
#include <iomanip>
#include <utility>
#include <cmath>
#include <random>
#include <vector>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i = 0; i<n; ++i)
#define REP(i,n) for(int i = 1; i<=n; ++i)
#define all(x) begin(x),end(x)
#define show(obj) {for(auto x:obj)cout<<x<<' ';cout<<endl;}
#define line "----------"
typedef long long ll;
typedef pair<int,int> P;
typedef pair<ll,ll> LP;
const int inf = 1001001000;
const ll INF = 1LL<<60;
const int MOD = (int)1e9 + 7;
vector<vector<P>> G(100100, vector<P>());
void dfs(int f, vector<int> &dist){
for(auto x:G[f]){
if(dist[x.first] == inf){
dist[x.first] = dist[f] + x.second;
dfs(x.first, dist);
}
}
}
int main(){
int N, M, l, r, d;
cin >> N >> M;
vector<tuple<int,int,int>> edge(M);
rep(i,M){
cin >> l >> r >> d;
--r; --l;
edge[i] = make_tuple(l, r, d);
G[r].push_back(make_pair(l,-d));
G[l].push_back(make_pair(r,d));
}
vector<int> dist(N,inf);
rep(i,N){
if(dist[i] == inf){dist[i] = 0; dfs(i, dist);}
}
bool ans = true;
rep(i,M){
if(dist[get<1>(edge[i])] - dist[get<0>(edge[i])] != get<2>(edge[i]))ans = false;
}
cout << ((ans) ? "Yes" : "No") << endl;
return 0;
}
|
#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define REP(i, l, n) for(int i=(l), i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(),(x).end()
#define pb push_back
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;}
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;
}
char alpha[26] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int main(){
int n; cin >> n;
string s; cin >> s;
int k; cin >> k;
char x = s[k-1];
REP(i, 0, n){
if(s[i] != x){
s[i] = '*';
}else{
continue;
}
}
cout << s << endl;
}
| 0
| 48,038,975
|
#include<iostream>
#include<vector>
#include<cmath>
#include<queue>
#include<utility>
#include<algorithm>
using namespace std;
#define INF 1000000
#define N 10
int main() {
int n;
while (1) {
cin >> n;
if (n==0)break;
int dp[N][N];
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
dp[i][j] = INF;
}
}
int a, b, c;
while (n--) {
cin >> a >> b >> c;
dp[a][b] = c;
dp[b][a] = c;
}
for (int k = 0; k < N; k++) {
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
dp[i][j] = min(dp[i][j],dp[i][k] + dp[k][j]);
}
}
}
int sum[N];
for (int i = 0; i < N; i++) {
sum[i] = 0;
for (int j = 0; j < N; j++) {
if (i != j && dp[i][j] != INF) {
sum[i] += dp[i][j];
}
}
}
int res = 0;
for (int i = 1; i < N; i++) {
if (sum[i] < sum[res] && sum[i] != 0) {
res = i;
}
}
cout << res << ' ' << sum[res] << endl;
}
return 0;
}
|
#include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include <bitset>
#include <functional>
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef long double ld;
int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const long long INF = 1LL << 62;
const ll MOD = 1e9 + 7;
bool greaterSecond(const pair<int, int>& f, const pair<int, int>& s){
return f.second > s.second;
}
ll gcd(ll a, ll b){
if (b == 0)return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b){
return a / gcd(a, b) * b;
}
ll conbinationMemo[100][100];
void cmemoInit(){
rep(i, 100){
rep(j, 100){
conbinationMemo[i][j] = -1;
}
}
}
ll nCr(ll n, ll r){
if(conbinationMemo[n][r] != -1) return conbinationMemo[n][r];
if(r == 0 || r == n){
return 1;
} else if(r == 1){
return n;
}
return conbinationMemo[n][r] = (nCr(n - 1, r) + nCr(n - 1, r - 1));
}
ll nPr(ll n, ll r){
r = n - r;
ll ret = 1;
for (ll i = n; i >= r + 1; i--) ret *= i;
return ret;
}
int main(void){
ll n;
cin >> n;
string s;
cin >> s;
ll l = 0;
ll ans = 1;
rep(i, s.size()){
if(s[i] == 'B'){
if(l % 2 == 0){
l++;
} else {
ans *= l;
l--;
}
} else {
if(l % 2 != 0){
l++;
} else {
ans *= l;
l--;
}
}
ans %= MOD;
}
if(l != 0){
cout << 0 << endl;
return 0;
}
ll fact = 1;
for(ll i = 1; i <= n; i++){
fact *= i;
fact %= MOD;
}
cout << (ans * fact) % MOD << endl;
}
| 0
| 69,388,284
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int x = N, y = 0;
while(x > 0) {
y += x % 10;
x /= 10;
}
string rep;
int z;
z = N % y;
if (z == 0) {
rep = "Yes";
} else {
rep = "No";
}
cout << rep << endl;
}
|
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define PI 3.14159265358979323846
#define int64 long long
#define uint64 unsigned long long
using namespace std;
int main()
{
string ss;
cin >> ss;
reverse(ss.begin(), ss.end());
for(int64 ii = 0;ii < ss.length();ii++)
{
if(ss[ii] == 'r')
{
if(ss.substr(ii, 7) == "remaerd")
{
ii += 6;
}
else if(ss.substr(ii, 6) == "resare")
{
ii += 5;
}
else
{
cout << "NO" << endl;
return 0;
}
}
else if(ss[ii] == 'm')
{
if(ss.substr(ii, 5) == "maerd")
{
ii += 4;
}
else
{
cout << "NO" << endl;
return 0;
}
}
else if(ss[ii] == 'e')
{
if(ss.substr(ii, 5) == "esare")
{
ii += 4;
}
else
{
cout << "NO" << endl;
return 0;
}
}
else
{
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
}
| 0
| 31,110,462
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
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};
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 main(){
ll n,m,k;cin >> n >> m >>k;
bool check=false;
rep(i,n+1){
rep(j,m+1){
ll res=i*m+j*n-2*i*j;
if(res==k)check=true;
}
}
if(check)cout <<"Yes" <<endl;
else cout <<"No" <<endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vout(x) {rep(a,x.size()) cout << x[a] << " "; cout << endl;}
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return 0;}
template<class T> bool chmax(T &a, T b) {if(a<b) {a=b;return 1;}return 0;}
using namespace std;
using vint = vector<int>;
using vvint = vector<vector<int>>;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<int,int>;
const int inf = 1e9;
const ll inf_l = 1e18;
const int MAX = 2e5;
int main() {
int n, a, b; cin >> n >> a >> b;
if (b < a) cout << 0 << endl;
else if (n == 1) {
if (a != b) cout << 0 << endl;
else cout << 1 << endl;
}
else if (n == 2) {
if (a == b) cout << 0 << endl;
else cout << 1 << endl;
}
else {
cout << (ll)(b-a)*(n-2)+1 << endl;;
}
}
| 0
| 7,281,986
|
#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 main() {
string S;
cin >> S;
LLI ans = 0;
int i,c = 0;
for (i = 0; i < S.size(); i++) {
if (S[i] == 'B') c++;
else ans += c;
}
cout << ans << endl;
return 0;
}
|
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pp pair<pair<ll, ll>,pair<ll, ll>>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define vii vector<int>
#define vll vector<ll>
#define mat vector<vector<ll>>
#define lb lower_bound
#define pb push_back
#define fi first
#define sc second
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep2(i,a,b) for(ll i=a;i<b;i++)
#define repr(i,n) for(ll i=n-1;i>=0;i--)
#define all(x) x.begin(),x.end()
#define pq priority_queue<ll>
#define pqg priority_queue<ll,vector<ll>,greater<ll>>
#define LB(v,x) (lower_bound(v.begin(),v.end(),x)-v.begin())
#define UB(v,x) (upper_bound(v.begin(),v.end(),x)-v.begin())
#define ERASE(v) sort(v.begin(),v.end());v.erase(unique(v.begin(),v.end()),v.end())
using namespace std;
const ll INF = (1 << 30 ) - 1;
const ll LLINF = (1LL << 60LL);
const ll MOD = 1000000007;
const ll mod = 998244353;
const ll MAX = 1100000;
const double pi = acos(-1);
const double eps = 1e-10;
ll dx[4] ={1,0,-1,0} , dy[4] ={0,1,0,-1};
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; }
struct Timer{
chrono::system_clock::time_point start, end;
Timer(){ start = chrono::system_clock::now(); }
~Timer(){
end = chrono::system_clock::now();
auto msec = chrono::duration_cast<chrono::milliseconds>(end - start).count();
cerr<<"time : "<<msec<<" ms"<<endl;
}
};
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
Timer TM;
ll n;
cin>>n;
ll t[110]={},v[110]={};
double dp[110][110];
rep(i,110)rep(j,110) dp[i][j]=0.0;
rep(i,n) cin>>t[i];
rep(i,n) cin>>v[i];
v[n]=0,v[n+1]=0;
dp[0][0]=1;
rep(i,n){
rep(V,105){
if(dp[i][V]>0&&V<=v[i]){
rep(vv,105)if(vv<=v[i]){
ll a=v[i]-V;
ll b=v[i]-vv;
if(a+b<=t[i]){
double up=1.0*(V+v[i])*a/2.0;
double stay=v[i]*(t[i]-a-b);
double down=1.0*(vv+v[i])*b/2.0;
chmax(dp[i+1][vv],dp[i][V]+up+stay+down);
}
else if(t[i]<abs(V-vv)){}
else{
double x=1.0*(vv-V+t[i])/2.0;
double y=1.0*(t[i]-vv+V)/2;
double v2=V+x;
double up=1.0*(V+v2)*x/2;
double down=1.0*(vv+v2)*y/2;
chmax(dp[i+1][vv],dp[i][V]+up+down);
}
}
}
}
}
cout<<dp[n][0]-1<<endl;
return 0;
}
| 0
| 14,072,585
|
#include <bits/stdc++.h>
using namespace std;
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
#define pb push_back
#define mp make_pair
#define Red ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define F first
#define S second
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for(int i = 0; i < n; ++i)
#define repr(i,n) for(int i = n - 1; i >= 0; --i)
#define Rep(i, a, n) for(int i = (a); i <=(n); ++i)
#define repst(i, n) for(auto it = n.begin(); it != n.end(); ++it)
#define Repr(i, a, n) for(int i = (n); i >= (a); --i)
typedef long long ll;
const int inf = int(1e9);
const int mod = inf + 7;
const int N = 5e5 + 555;
void solve()
{
string s;
cin >> s;
int cnt = 0;
rep(i, sz(s)){
cnt += (s[i] == 'x');
}
cout << (cnt >= 8 ? "NO" : "YES");
}
int main()
{
Red;
solve();
return 0;
}
|
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define lp(a,n) for(ll i=a; i<n; i++)
#define lpi(a,n) for(int i=a; i<n; i++)
#define w(t) int t; cin>>t; while(t--)
#define vi vector<int>
#define vll vector<ll>
#define inf 1e9
#define mod 1e9 + 7
using namespace std;
ll gcd(ll a,ll b){
if(a==0)return b;
return gcd(b%a,a);
}
ll lcm(ll a, ll b){
return (a*b)/gcd(a,b);
}
ll power(ll x, ll y)
{
ll res = 1;
while (y > 0)
{
if (y & 1)
res = res*x;
y = y>>1;
x = x*x;
}
return res;
}
int main(){
int n, p;
cin>>n>>p;
string s;
cin>>s;
ll ans=0;
if(p==2){
lpi(0,n){
if((s[i]-'0')%2 == 0){
ans += i+1;
}
}
}
else if(p==5){
lpi(0,n){
if((s[i]-'0')%5==0) ans+=i+1;
}
}
else{
map<int , int> mp;
int t=0, p1=1;
mp[0]++;
for(int i=n-1; i>=0; i--){
t = (t+(s[i]-'0')*p1)%p;
p1 = (p1*10)%p;
ans += mp[t];
mp[t]++;
}
}
cout<<ans;
}
| 0
| 96,933,287
|
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
long n, T;
cin >> n >> T;
long t[n];
for(int i = 0; i < n; i++) cin >> t[i];
long sum_water = T;
for(int i = 1; i < n; i++) {
sum_water += min((t[i]-t[i-1]), T);
}
cout << sum_water << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
using VB = vector<bool>;
using VVI = vector<VI>;
using VVL = vector<VL>;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep3(i, s, n, d) for (int i = (s); i < (int)(n); i += (d))
#define allpt(v) (v).begin(), (v).end()
#define allpt_c(v) (v).cbegin(), (v).cend()
#define allpt_r(v) (v).rbegin(), (v).rend()
const int mod1 = 1e9 + 7, mod2 = 998244353, mod3 = 1e9 + 9;
const int mod = mod1;
const ll inf = 1e18;
const string wsp = " ";
const string tb = "\t";
const string rt = "\n";
template <typename T>
void show1dvec(const vector<T> &v)
{
if (v.size() == 0)
return;
int n = v.size() - 1;
rep(i, n) cout << v[i] << wsp;
cout << v[n] << rt;
return;
}
template <typename T>
void show2dvec(const vector<vector<T>> &v)
{
int n = v.size();
rep(i, n) show1dvec(v[i]);
}
template <typename T, typename S>
void show1dpair(const vector<pair<T, S>> &v)
{
int n = v.size();
rep(i, n) cout << v[i].first << wsp << v[i].second << rt;
return;
}
template <typename T, typename S>
void pairzip(const vector<pair<T, S>> &v, vector<T> &t, vector<T> &s)
{
int n = v.size();
rep(i, n)
{
t.push_back(v[i].first);
s.push_back(v[i].second);
}
return;
}
template <typename T>
void maxvec(vector<T> &v)
{
T s = v[0];
int n = v.size();
rep(i, n - 1)
{
if (s > v[i + 1])
{
v[i + 1] = s;
}
s = v[i + 1];
}
}
template <typename T, typename S>
bool myfind(T t, S s)
{
return find(t.cbegin(), t.cend(), s) != t.cend();
}
bool check(int y, int x, int h, int w)
{
return 0 <= y && y < h && 0 <= x && x < w;
}
template <typename T>
vector<T> cumsum(const vector<T> &v)
{
T s = 0;
vector<T> ret;
rep(i, v.size())
{
s += v[i];
s %= mod;
ret.emplace_back(s);
}
return ret;
}
bool iskadomatsu(int a, int b, int c)
{
return (a != b && b != c && c != a) && ((a > b && b < c) || (a < b && b > c));
}
VS split(string s, char c)
{
VS ret;
string part;
s += c;
rep(i, s.length())
{
if (s[i] == c)
{
ret.emplace_back(part);
part = "";
}
else if (s[i] != c)
{
part += s[i];
}
}
return ret;
}
string removezero(string &s)
{
string ret;
for (auto z : s)
if (z != '0')
ret += z;
return ret;
}
ll sumdigit(ll x)
{
ll ans{0};
while (x > 0)
{
ans += x % 10;
x /= 10;
}
return ans;
}
template <typename T, typename S, typename R>
ll pow_mod(T p, S q, R mod = 1ll)
{
ll ret = 1, r = p;
while (q)
{
if (q % 2)
ret *= r, ret %= mod;
r = (r * r) % mod, q /= 2;
}
return ret % mod;
}
void make_frac_tables(VL &frac_list, VL &frac_inv_list)
{
rep(i, frac_list.size() - 1)
{
frac_list[i + 1] *= frac_list[i] * (i + 1);
frac_list[i + 1] %= mod;
frac_inv_list[i + 1] *= frac_inv_list[i] * pow_mod(i + 1, mod - 2, mod);
frac_inv_list[i + 1] %= mod;
}
}
ll comb(int a, int b, const VL &frac_list, const VL &frac_inv_list)
{
if (a < b)
return 0;
ll ret = frac_list[a];
ret *= frac_inv_list[b];
ret %= mod;
ret *= frac_inv_list[a - b];
ret %= mod;
return ret;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
#ifdef DEBUG
cout << "DEBUG MODE" << endl;
ifstream in("input.txt");
cin.rdbuf(in.rdbuf());
#endif
int n, m, d, p;
ll ans{0};
cin >> n >> m;
priority_queue<int> tasks;
VVI tasks_a_day(m + 1);
rep(i, n)
{
cin >> d >> p;
if (d <= m)
tasks_a_day[d].emplace_back(p);
}
rep(i, m + 1)
{
for (int z : tasks_a_day[i])
{
tasks.push(z);
}
if (!tasks.empty())
{
ans += tasks.top();
tasks.pop();
}
}
cout << ans << rt;
return 0;
}
| 0
| 85,367,167
|
#include <iostream>
using namespace std;
int main() {
int n, a, b, c;
cin >> n;
cin >> a;
b = n / 500;
c = n - (500 * b);
if(c <= (1 * a)){
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
|
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define INF (1e12)
ll V,E;
ll G[100][100];
int main() {
cin >> V >> E;
rep(i,V)rep(j,V)G[i][j] = INF;
rep(i,V)G[i][i] = 0;
rep(i,E) {
ll s,t,d;
cin >> s >> t >> d;
G[s][t] = d;
}
rep(k,V) {
rep(i,V) {
rep(j,V)
G[i][j] = min(G[i][j],G[i][k] + G[k][j]);
}
}
rep(i,V) {
if(G[i][i] != 0){
cout << "NEGATIVE CYCLE" << endl;
return 0;
}
}
rep(i,V) {
rep(j,V) {
if(G[i][j] < INF / 2)cout << G[i][j];
else cout << "INF";
cout << ((j < V - 1) ? " " : "");
}
cout << endl;
}
return 0;
}
| 0
| 42,131,404
|
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecd vector<double>
#define vecst vector<string>
#define vecb vector<bool>
#define vec2(var, n, m) vector<vector<int>> var(n, vector<int>(m, 0))
#define vecll2(var, n, m) vector<vector<ll>> var(n, vector<ll>(m, 0))
#define rep(i,n) for(ll i=(ll)0; i<(ll)n; i++)
#define REP(i,m,n) for(ll i=(ll)m; i<(ll)n; i++)
#define arr(var, n) vec var(n); rep(i,n){cin >> var[i];}
#define arrll(var, n) vecll var(n); rep(i,n){cin >> var[i];}
#define arrst(var, n) vecst var(n); rep(i,n){cin >> var[i];}
#define all(var) (var).begin(), (var).end()
#define sortall(var) sort(all(var))
#define uniqueall(v) v.erase(unique(v.begin(), v.end()), v.end());
#define f_sum(var) accumulate(all(var), 0)
#define f_sumll(var) accumulate(all(var), 0LL)
#define chmin(v1, v2) v1 = min(v1, v2)
#define chmax(v1, v2) v1 = max(v1, v2)
#define pb(var) push_back(var)
#define prt(var) cout << (var) << "\n"
#define prtd(n, var) cout << fixed << setprecision(n) << (var) << "\n"
#define prtfill(n, var) cout << setw(n) << setfill('0') << (var);
#define prt2(v1, v2) cout << (v1) << " " << (v2) << "\n"
#define prt3(v1, v2, v3) cout << (v1) << " " << (v2) << " " << (v3) << "\n"
#define prtall(v) rep(i,v.size()){cout<<v[i]<<(i!=v.size()-1?" ":"\n");}
void prtok(bool ok){prt(ok ? "Yes" : "No");}
int main(void) {
string s, t;
cin >> s >> t;
int n=s.size();
int k=t.size();
int id=-1;
for(int i=n-k; i>-1; i--){
bool ok=true;
rep(j,k){
if(s[i+j]!='?' && s[i+j]!=t[j]) ok=false;
}
if(ok){
id = i;
rep(j,k){
s[i+j] = t[j];
}
break;
}
}
if(id==-1){
prt("UNRESTORABLE");
return 0;
}
rep(i,n){
if(s[i]=='?') cout << 'a';
else {cout << s[i];}
}
cout << "\n";
}
|
# include <iostream>
# include <cmath>
# include <algorithm>
# include <stdio.h>
# include <cstdint>
# include <cstring>
# include <string>
# include <cstdlib>
# include <vector>
# include <bitset>
# include <map>
# include <queue>
# include <ctime>
# include <stack>
# include <set>
# include <list>
# include <random>
# include <deque>
# include <functional>
# include <iomanip>
# include <sstream>
# include <fstream>
# include <complex>
# include <numeric>
# include <immintrin.h>
# include <cassert>
# include <array>
# include <tuple>
# include <unordered_map>
# include <unordered_set>
# include <thread>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using ui32 = unsigned int;
constexpr ll INFLL = 1e18;
#define CHECK_IMPL1(cond) \
if (!(cond)) { \
DEBUG("expected cond: " << #cond); \
assert(cond); \
}
#define CHECK_IMPL2(cond, message) \
if (!(cond)) { \
DEBUG("expected cond: " << #cond << " failed with message: " << message); \
assert(cond); \
}
#define CHECK_IMPL(_1, _2, NAME, ...) NAME
#define CHECK(...) CHECK_IMPL(__VA_ARGS__, CHECK_IMPL2, CHECK_IMPL1, CHECK_IMPL0)(__VA_ARGS__)
#ifdef __APPLE__
#define DEBUG(message) std::cerr << message << "\n";
#else
#define DEBUG(message)
#endif
void solve() {
int n;
cin >> n;
vector<int> a(n);
ll s = 0;
multiset<int> diffs;
for (int i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
}
for (int i = 0; i < n; i++) {
diffs.insert(a[(i + 1) % n] - a[i]);
}
if (s % (n * (n + 1LL) / 2LL) != 0) {
cout << "NO\n";
return;
}
ll count = s / (n * (n + 1LL) / 2LL);
ll target = count;
for (auto x : diffs) {
if (x == target) {
continue;
}
if (x > target) {
cout << "NO\n";
return;
}
if ((target - x) % n != 0) {
cout << "NO\n";
return;
}
count -= (target - x) / n;
}
if (count == 0) {
cout << "YES\n";
} else {
cout << "NO\n";
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
#ifdef __APPLE__
freopen("input.txt", "r", stdin);
#endif
int t = 1;
for (int i = 1; i <= t; i++) {
solve();
}
return 0;
}
| 0
| 40,900,914
|
#include<iostream>
#include<map>
using namespace std;
int main(){
map<string,int> word;
string s,ss;
int a = 0,b = 0;
while(cin >>s) word[s]++;
for(map<string,int>::iterator it = word.begin(); it!=word.end(); it++){
if(a < it->second){a = it->second;ss = it->first;}
if(b < (it->first).size()){b = (it->first).size();s = (it->first);}
}
cout <<ss<<" "<<s<<endl;
return 0;
}
|
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif
#include <limits.h>
#include <math.h>
#include <time.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v, n) reverse(v, v + n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define print(x) cout << (x) << endl
#define pe(x) cout << (x) << " "
#define DEBUG(x) cout << #x << ": " << x << endl
#define lb(v, n) lower_bound(v.begin(), v.end(), (n))
#define ub(v, n) upper_bound(v.begin(), v.end(), (n))
#define int long long
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i, v.size()) cout << v[i] << " \n"[i==(int)v.size()-1]
template <typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }
template <typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
std::random_device rd;
std::mt19937 mt(rd());
constexpr ll MOD = 1e9 + 7;
constexpr int MAX = 500050;
const double pi = acos(-1);
constexpr double EPS = 1e-8;
constexpr ll LINF = 1e18 + 1;
constexpr int INF = 1e9 + 1;
void solve() {
int A, B, C, D; cin >> A >> B >> C >> D;
int K; cin >> K;
int t1 = A * 60 + B;
int t2 = C * 60 + D;
int d = t2 - t1;
print(d - K);
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
}
| 0
| 30,514,412
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int x, a, b; cin >> x >> a >> b;
if (b <= a) {
cout << "delicious" << endl;
return 0;
}
string ans;
if( x + 1 <= b - a) ans = "dangerous";
else ans = "safe";
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int M;
ll K;
cin >> M >> K;
if(K == 0) {
rep(i, 1<<M) cout << i << ' ' << i << ' ';
cout << "\n";
} else {
ll xorall = 0;
rep(i, 1<<M) xorall ^= i;
rep(j, 1<<M) {
if(K == j && K == (xorall^j)) {
rep(i, 1<<M) if(i!=j) cout << i << ' ';
cout << j << ' ';
rrep(i, (1<<M)) if(i!=j) cout << i << ' ';
cout << j << ' ';
cout << "\n";
return 0;
}
}
cout << -1 << "\n";
}
return 0;
}
| 0
| 74,928,788
|
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef tuple<ll,ll,ll> T;
const long long INF = 1LL<<60;
const int MOD = 1000000000+7;
#define rev(s) (string((s).rbegin(), (s).rend()))
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); };
int main() {
int N;cin>>N;
vector<vector<int>> happy(N,vector<int>(3,0));
rep(i,N) cin >> happy[i][0] >> happy[i][1] >> happy[i][2];
vector<vector<int>> dp(N + 1,vector<int>(3,0));
rep(i,N) {
rep(j,3) {
chmax(dp[i + 1][(j + 1) % 3], dp[i][j] + happy[i][(j + 1) % 3]);
chmax(dp[i + 1][(j + 2) % 3], dp[i][j] + happy[i][(j + 2) % 3]);
}
}
int ans = 0;
rep(i,3) chmax(ans, dp[N][i]);
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}
signed main(){
Int n;
cin>>n;
vector<Int> as(n);
for(Int i=0;i<n;i++) cin>>as[i];
using P = pair<Int, Int>;
vector<P> vp;
Int tmp=0;
for(Int i=0;i<n;i++){
if(tmp<as[i]){
vp.emplace_back(i,tmp);
tmp=as[i];
}
}
vector<Int> bs(as);
sort(bs.begin(),bs.end());
vector<Int> sm(n+1,0);
for(Int i=0;i<n;i++) sm[i+1]=sm[i]+bs[i];
Int m=vp.size();
vector<Int> res(m+1,0);
for(Int i=0;i<m;i++){
Int k=lower_bound(bs.begin(),bs.end(),vp[i].second)-bs.begin();
res[i]=(sm[n]-sm[k])-(n-k)*vp[i].second;
}
for(Int i=0;i<m;i++)
res[i]-=res[i+1];
vector<Int> ans(n);
for(Int i=0;i<m;i++)
ans[vp[i].first]=res[i];
for(Int i=0;i<n;i++) cout<<ans[i]<<endl;
return 0;
}
| 0
| 37,033,317
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int A;
cin >> N >> A;
int i;
i = N % 500;
if(i <= A){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
}
|
#include <iostream>
using namespace std;
#define DEBUG
long long seriesXor(long long m, long long n)
{
long long ans = m;
for (long long i = m + 1; i <= n; i++) {
ans ^= i;
}
return ans;
}
long long calculate(long long x)
{
if (x % 4 == 0) {
return x;
} else if (x % 4 == 1) {
return 1;
} else if (x % 4 == 2) {
return x + 1;
} else if (x % 4 == 3) {
return 0;
} else {
return 0;
}
}
int main()
{
long long a, b, ans = 0;
scanf("%lld %lld", &a, &b);
ans = calculate(b) ^ calculate(a - 1);
printf("%lld\n", ans);
return 0;
}
| 0
| 93,577,666
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
string s;
cin >> s;
vector<int> num;
if(s[0]=='0') num.push_back(0);
for(int i=0;i<n;){
int ren=i;
while(ren<n && s[i]==s[ren]) ++ren;
num.push_back(ren-i);
i=ren;
}
if(s.back()=='0') num.push_back(0);
vector<int> ruisekiwa((int)num.size()+1,0);
for(int i=0;i<(int)num.size();i++){
ruisekiwa[i+1]=ruisekiwa[i]+num[i];
}
int ans=0;
for(int i=0;i<(int)ruisekiwa.size();i+=2){
int j=i+k*2+1;
if(j>=(int)ruisekiwa.size()) j=(int)ruisekiwa.size()-1;
ans=max(ans,ruisekiwa[j]-ruisekiwa[i]);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace std;
int main()
{
ll n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
while (true) {
ll mind = -1;
ll mi = 1e10;
ll live = 0;
rep (i, n) if (a[i] > 0) {
live++;
if (a[i] < mi) {
mind = i;
mi = a[i];
}
}
if (live <= 1) {
put(mi);
return 0;
}
rep (i, n) {
if (i != mind) {
a[i] = a[i] % mi;
}
}
}
return 0;
}
| 0
| 37,909,381
|
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
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 int INF=1001001001;
vector<pair<int64_t,int64_t>>prime_factorize(int64_t x){
vector<pair<int64_t,int64_t>>p;
for(int64_t i=2;i*i<=x;i++){
int cnt=0;
if(x%i==0){
while(x%i==0){cnt++;x/=i;}
p.push_back(make_pair(i,cnt));
}
}
if(x!=1){p.push_back(make_pair(x,1));}
return p;
}
int main() {
int N;
cin>>N;
vector<int64_t>T(N);
for(int i=0;i<N;i++){
cin>>T[i];
}
int64_t m=1;
for(int i=0;i<N;i++){
m=m/__gcd(m,T[i])*T[i];
}
cout<<m<<endl;
return 0;
}
|
using namespace std;
#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include<iostream>
#include<algorithm>
#include<ctime>
#include<vector>
#include<string>
#include<cmath>
#include<map>
#include<iomanip>
#include<numeric>
#include<queue>
#include<deque>
#include<cfloat>
#include<functional>
#include<tuple>
#include<math.h>
#include<bitset>
#include<stack>
#include<set>
#include<random>
#include<stdlib.h>
#define rip(i,n) for(ll i=0;i<n;i++)
#define Rip(i,n) for(ll i=1;i<n;i++)
#define all(V) V.begin(),V.end()
#define ll long long
#define ld long double
#define MOD 998244353
#define mod MOD
#define sec setprecision
constexpr double eps = 1e-9;
constexpr double PI = 3.141592653589793238462643383279;
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 ketasuu(ll h) {
if (h < 0)return(-(ketasuu(-h)));
else if (h < 10)return(1);
else return(1 + ketasuu(h / 10));
}
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
void cominit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll 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;
}
}
vector<ll> soinnsuubunnkai(ll n) {
vector<ll>a;
while (n % 2 == 0) {
a.push_back(2);
n /= 2;
}
ll f = 3;
while (f * f <= n) {
if (n % f == 0) {
a.push_back(f);
n /= f;
}
else f += 2;
}
if (n != 1)
a.push_back(n);
return(a);
}
long long 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;
}
ll pow(ll a, ll b) {
a = a % mod;
if (b == 0)return(1);
else if (b % 2 == 0)return(pow((a * a) % mod, b / 2));
else return(a * (pow(a, b - 1)));
}
void solve() {
int x, a;
cin >> x >> a;
if (x < a)cout << "0" << endl;
else cout << "10" << endl;
}
int main() {
solve();
}
| 0
| 41,280,549
|
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int LP[1005][1005];
int main(){
int j, k;
string x, y;
cin >> x >> y;
for(j = 1; j <= x.size(); j++){
LP[j][0] = j;
}
for(k = 1; k <= y.size(); k++){
LP[0][k] = k;
}
for(j = 1; j <= x.size(); j++){
for(k = 1; k <= y.size(); k++){
int m = min(LP[j-1][k] + 1, LP[j][k-1] + 1);
if(x[j-1] == y[k-1]){
m = min(LP[j-1][k-1], m);
LP[j][k] = m;
}
else{
m = min(LP[j-1][k-1] + 1, m);
LP[j][k] = m;
}
}
}
printf("%d\n", LP[x.size()][y.size()]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace::std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream& operator>>(istream& I, vector<T>& v) {for (T &e: v) I >> e; return I;}
template <class T> ostream& operator<<(ostream &O, const vector<T>& v) {for (const T &e: v) O << e << ' '; return O;}
int med(vector<int> a) {
sort(all(a));
return a[sz(a) / 2];
}
void _main() {
int n; cin >> n;
vector<int> a(n); cin >> a;
for (int i = 0; i < n; i++) a[i] -= i + 1;
int b = med(a);
ll ans = 0;
for (int i = 0; i < n; i++) ans += abs(a[i] - b);
cout << ans;
}
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int _t = 1;
while (_t--) _main();
return 0;
}
| 0
| 24,666,908
|
#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<int, int>;
int main(void){
int N;
cin >> N;
vector <int> vec(N);
rep(i,N) cin >> vec.at(i);
int count = 0;
int a = 0;
while (true){
count++;
a = vec.at(a) - 1;
if (a == 1) break;
if (count > N){
count = -1;
break;
}
}
cout << count << endl;
}
|
#include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/integer/common_factor.hpp>
#include <boost/integer/common_factor_rt.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using std::string;
using std::vector;
using std::set;
using std::map;
using std::unordered_map;
using std::pair;
using std::cin;
using std::cout;
typedef uintmax_t ull;
typedef intmax_t ll;
typedef uint64_t ul;
typedef uint32_t ui;
typedef uint8_t uc;
typedef boost::multiprecision::number<boost::multiprecision::cpp_dec_float<1000>> cpp_dec_float_1000;
constexpr char CRLF = '\n';
constexpr char SPACE = ' ';
constexpr char VECTOR_COUT_SEPARATOR = SPACE;
constexpr ll INF = 1000'000'007;
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; }
template<class T> std::ostream& operator<< (std::ostream& os, const std::vector<T>& vc) { for(auto it = vc.begin(); it != vc.end(); ++it) { if (std::next(it) == vc.end()) os << *it; else os << *it << VECTOR_COUT_SEPARATOR; } return os; }
template<class T1, class T2> inline std::ostream & operator<< (std::ostream & os, const std::pair<T1, T2> & p) { return os << p.first << ' ' << p.second; }
void solve(void)
{
ui N{}; cin >> N;
cout << (N * 180 - 360) << CRLF;
return;
}
int main(void)
{
std::ios_base::sync_with_stdio(false);
std::cin.tie(0);
solve();
return 0;
}
| 0
| 18,168,479
|
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
int main(void){
int n,i,a[10005],b[10005];
ll asum=0,bsum=0,k;
cin >> n;
for (i=0;i<n;i++) cin >> a[i];
for (i=0;i<n;i++) cin >> b[i];
for (i=0;i<n;i++) asum+=a[i];
for (i=0;i<n;i++) bsum+=b[i];
k=bsum-asum;
if (k<0){
cout << "No" << endl;
return 0;
}
if (k==0){
for (i=0;i<n;i++){
if (a[i]!=b[i]){
cout << "No" << endl;
return 0;
}
}
}
ll ra=0,rb=0;
for (i=0;i<n;i++){
if (a[i]==b[i]) continue;
if (a[i]>b[i]){
rb+=a[i]-b[i];
}else{
if ((b[i]-a[i])%2==0){
ra+=(b[i]-a[i])/2;
}else{
ra+=(b[i]-a[i]+1)/2;
rb++;
}
}
}
if (ra<=k && rb<=k && (k-ra)*2==k-rb){
cout << "Yes" << endl;
}else{
cout << "No" << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int ara[50];
int main()
{
int n;
cin>>n;
for(int i=0; i<n; i++)
cin>>ara[i];
int res=1;
for(int i=1; i<n; i++)
{
int p=1;
for(int j=0; j<i; j++)
if(ara[j]>ara[i])
p=0;
if(p)
res++;
}
cout<<res<<endl;
return 0;
}
| 0
| 83,462,829
|
#include <bits/stdc++.h>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define DEBUG
#define PI 3.141592653589793238462643383279
#define _GLIBCXX_DEBUG
#ifdef DEBUG
#define s(...) show(__VA_ARGS__);
#define sl(...) show(__VA_ARGS__);cout<<endl;
#else
#define s(...)
#define sl(...)
#endif
void show() {}
template <class Head,class... Args>void show(Head t,Args... args){std::cout<<t<<" ";show(args...);}
#define REP(i, n) for(ll i = 0; i < n; i++)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOR(i, m, n) for(ll i = m; i < n; i++)
#define REP1(i, n) for(ll i = 1; i <= n; i++)
#define REPR1(i, n) for(ll i = n; i >= 1; i--)
#define FOR1(i, m, n) for(ll i = m; i <= n; i++)
#define ALL(v) v.begin(), v.end()
ll t[100010];
ll h[100010];
ll root(ll x){
if(t[x]==x){
return x;
}else{
return t[x]=root(t[x]);
}
}
int main(){
ll N,M;
cin>>N>>M;
vector<ll> H(N+1);
vector<bool> f(N+1);
REP1(i,N){
cin>>H[i];
f[i]=true;
}
REP(i,M){
ll a,b;
cin>>a>>b;
if(H[a]>H[b]){
f[b]=false;
}else if(H[a]<H[b]){
f[a]=false;
}else{
f[b]=false;
f[a]=false;
}
}
ll cnt=0;
REP1(i,N){
if(f[i]==true){
cnt++;
}
}
cout<<cnt;
return 0;
cout<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n,k;
int main(){
cin >> n >> k;
double res = 0;
for(int i = 1; i <= n; ++i){
if(i >= k){
double cou = 1.0 / n;
res += cou;
}else{
double cou = 1;
int c = i;
while(c < k){
cou /= 2;
c *= 2;
}
res += cou / n;
}
}
printf("%.12f\n",res);
}
| 0
| 42,263,546
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define PI acos(-1)
typedef long long ll;
ll gcd(ll x,ll y){
if(y==0) return x;
else return gcd(y,x%y);
}
ll lcm(ll x,ll y){
return x/gcd(x,y)*y;
}
int main(){
int n;
cin>>n;
deque<int> a;
rep(i,n){
int x;
cin>>x;
if(i%2==0){
a.push_front(x);
}
else{
a.push_back(x);
}
}
if(n%2==0){
reverse(a.begin(),a.end());
}
rep(i,n){
cout<<a[i]<<" ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
int n;
cin >> n;
vector<array<int, 2>> v;
for (int i = 1; i <= n; i++) {
int a, b;
cin >> a >> b;
v.push_back({a, b});
}
sort(v.begin(), v.end(), [](array<int, 2> a, array<int, 2> b) {
return a[0] + a[1] > b[0] + b[1];
});
long long res = 0;
for (int i = 0; i < v.size(); i++) {
if (i % 2 == 0) {
res += v[i][0];
}
else res -= v[i][1];
}
cout << res << endl;
return 0;
}
| 0
| 68,956,618
|
#include <bits/stdc++.h>
#define int long long
#define quickie ios_base::sync_with_stdio(false); cin.tie(NULL);
#define rep(i, a, b) for(int i=a; i<b; i++)
#define rep1(i, a, b) for(int i=a; i<=b; i++)
#define repp(i, a, b) for(int i=b-1; i>=a; i--)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define db double
#define mi map<int, int>
#define mc map<char, int>
#define ms map<string, int>
#define vi vector<int>
#define qi queue<int>
#define MI(x) power(x, mod-2)
#define test int t; cin >> t;
#define mod 998244353
using namespace std;
int power(int x, int y) ;
int gcd(int a, int b) ;
signed main() {
quickie
int a, b, c, d ;
cin >> a >> b ;
if(a < b) cout << 0 << "\n" ;
else cout << 10 << "\n" ;
}
int power(int x, int y) {
int res = 1; x %= mod;
while (y > 0) {
if (y & 1)
res = (res*x) % mod;
y = y>>1;
x = (x*x) % mod;
}
return res%mod;
}
int gcd(int a,int b){
if(a==0) return b;
return gcd(b%a,a);
}
|
#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 w, h, n, x, y, a, count=0;
cin>>w>>h>>n;
int ans = w * h;
bool arr[w][h];
loop(i, 0, w){
loop(j, 0, h){
arr[i][j] = true;
}
}
loop(i, 0, n){
cin>>x>>y>>a;
if(a == 1){
loop(i, 0, x){
loop(j, 0, h){
arr[i][j] = false;
}
}
}
if(a == 2){
loop(i, x, w){
loop(j, 0, h){
arr[i][j] = false;
}
}
}
if(a == 3){
loop(i, 0, w){
loop(j, 0, y){
arr[i][j] = false;
}
}
}
if(a == 4){
loop(i, 0, w){
loop(j, y, h){
arr[i][j] = false;
}
}
}
}
loop(i, 0, w){
loop(j, 0, h){
if(arr[i][j])
count++;
}
}
cout<<count;
}
| 0
| 29,742,402
|
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n;
long long m, a[5001];
a[0] = 0;
while(cin >> n, n != 0){
for(int i=1; i<=n; i++){
cin >> a[i];
a[i] += a[i-1];
}
m = -100000;
for(int i=0; i<=n; i++){
for(int j=i+1; j<=n; j++){
m = max(m, a[j] - a[i]);
}
}
cout << m << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,ll>;
using T = tuple<ll,ll,ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define print(v) cout<<v<<endl;
#define fi(v) get<0>(v)
#define se(v) get<1>(v)
#define th(v) get<2>(v)
template <typename T> bool chmax(T &a, const T &b){if (a<b){a=b;return 1;}return 0;}
template <typename T> bool chmin(T &a, const T &b){if (a>b){a=b;return 1;}return 0;}
const ll INF=1LL<<60;
const ll MOD=998244353;
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;
}
int main(){
ll N;
cin >> N;
vector<ll> D(N,0);
for(ll i=0;i<N;i++)cin>>D[i];
if(D[0]!=0){
print(0)return 0;
}
Map M;
for(ll i=0;i<N;i++)M[D[i]]++;
ll S=M.size();
ll ans=1;
if(M[0]!=1){print(0)return 0;}
vector<ll> vec(S,0);
for(ll i=1;i<S;i++){
if(M[i]==0){
cout<<0<<endl;return 0;
}
vec[i]=M[i];
}
vec[0]=1;
for(ll i=1;i<S;i++){
ans*=modpow(vec[i-1],vec[i],MOD);
ans%=MOD;
}
print(ans);
return 0;
}
| 0
| 38,117,496
|
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
getline(cin, s);
for(int i = 0; i < (int)s.size(); i++){
if('a' <= s[i] && s[i] <= 'z') s[i] = 'A' + s[i] - 'a';
else if('A' <= s[i] && s[i] <= 'Z') s[i] = 'a' + s[i] - 'A';
}
cout << s << endl;
}
|
#include <iostream>
#include <utility>
#include <vector>
#include <algorithm>
#define llint long long
using namespace std;
llint W, H;
vector<pair<llint, int> > vec;
int main(void)
{
cin >> W >> H;
int p, q;
for(int i = 0; i < W; i++){
cin >> p;
vec.push_back( make_pair(p, 0) );
}
for(int i = 0; i < H; i++){
cin >> q;
vec.push_back( make_pair(q, 1) );
}
sort(vec.begin(), vec.end());
llint ans = 0;
llint wcnt = W+1, hcnt = H+1;
for(int i = 0; i < vec.size(); i++){
if(vec[i].second == 0){
ans += vec[i].first * hcnt;
wcnt--;
}
else{
ans += vec[i].first * wcnt;
hcnt--;
}
}
cout << ans << endl;
return 0;
}
| 0
| 21,750,884
|
#pragma region header
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define int long long
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define resort(v) sort((v).rbegin(), (v).rend())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
using ll = long long;
using P = pair<int, int>;
int dx[] = {1,0,-1,0};
int dy[] = {0,1,0,-1};
constexpr ll mod = 1e9+7;
constexpr int inf = INT32_MAX/2;
constexpr ll INF = LLONG_MAX/2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll fact(int i) {
if (i == 0) return 1;
return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b ;
}
int keta(ll n) {
if(n == 0) return 1;
int count = 0;
while(n != 0) {
n /= 10;
count++;
}
return count;
}
ll ketasum(ll n) {
ll sum = 0;
while(n != 0) {
sum += n % 10;
n /= 10;
}
return sum;
}
#pragma endregion
struct UnionFind {
vi par,size;
UnionFind(int n) {
par.resize(n);
size.resize(n,1);
rep(i, n) par[i]=i;
}
bool same(int x,int y) {
return find(x)==find(y);
}
int consize(int k) {
return size[find(k)];
}
int find(int k) {
if(par[k]==k) return k;
return par[k]=find(par[k]);
}
bool unite(int x,int y) {
if(same(x,y)) return false;
if(consize(x)<consize(y)) {
par[find(x)]=find(y);
size[y]+=size[x];
}
else {
par[find(y)]=find(x);
size[x]+=size[y];
}
return true;
}
};
signed main() {
int n,q;cin >> n >> q;
UnionFind uf(n);
rep(i, q) {
int a,b,c;cin >> a >> b >> c;
if(a) cout << uf.same(b,c) << endl;
else uf.unite(b,c);
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(int)n;i++)
typedef long long ll;
using namespace std;
long long modpow(long long a, long long n,ll mod){
long long r = 1;
while (n) {
r = r * ( (n%2)?a:1 ) %mod;
a = a * a % mod;
n >>= 1;
}
return r;
}
int main(void){
ll n,mod;cin>>n>>mod;
string s;cin>>s;
reverse(s.begin(),s.end());
ll res=0,now=0;
if(mod==2||mod==5){
reverse(s.begin(),s.end());
rep(i,n){
ll d=s[i]-'0';
if(d%mod==0)res+=(i+1);
}
cout<<res<<endl;
return 0;
}
map<ll,ll> mp;
rep(i,n){
ll t=modpow(10,i,mod);
ll d=s[i]-'0';
d*=t;
d+=now;
d%=mod;
mp[d]++;
now=d;
}
for(auto& p:mp){
ll x=p.first,y=p.second;
if(x==0){
res+=(y+1)*y/2;
}else{
y--;
res+=(y+1)*y/2;
}
}
cout<<res<<endl;
}
| 0
| 76,199,738
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);(i)++)
#define repi2(i, s, e) for(ll (i) = (ll)(s);(i) <= (ll)(e);(i)++)
#define per(i, n) for(ll (i) = (ll)(n) - 1LL;(i) >= 0LL;(i)--)
#define per2(i, s, e) for(ll (i) = (ll)(s) - 1LL;(i) >= (ll)(e);(i)--)
#define peri(i, n) for(ll (i) = (ll)(n);(i) >= 0LL;(i)--)
#define peri2(i, s, e) for(ll (i) = (ll)(s);(i) >= (ll)(e);(i)--)
#define iter(i, it) for(auto &(i): (it))
template<typename T, typename U> ostream& operator<<(ostream &s, const pair<T, U> m) {
cout << "(" << m.first << ", " << m.second << ")";
return s;
}
template<typename T, typename U> ostream& operator<<(ostream &s, const map<T, U> m) {
ll c = 0;
cout << "{ ";
iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const vector<T> &v) {
cout << "{ ";
rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
template<typename T> ostream& operator<<(ostream &s, const list<T> &v) {
ll c = 0;
cout << "{ ";
iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");
cout << "}";
return s;
}
int main(void) {
ll A, B, C;
cin >> A >> B >> C;
A -= B;
C -= A;
cout << max(0LL, C) << endl;
return 0;
}
|
#include <iostream>
#include <sstream>
#include <vector>
#include <numeric>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#include <iomanip>
#include <cstdlib>
#include <climits>
#include <set>
using namespace std;
vector<vector<string>> getinputdata();
vector<vector<int>> getinputdata2();
vector<vector<double>> getinputdata3();
void m_solutions2019_a(vector<vector<string>> v) {
int n = atoi(v[0][0].c_str());
cout << (n-2)*180 <<endl;
}
int main() {
vector<vector < string>> vec_arr_result;
vec_arr_result = getinputdata();
m_solutions2019_a(vec_arr_result);
return 0;
}
vector<vector<double>> getinputdata3() {
string str;
string ret;
stringstream ss;
vector<string> v1;
vector<vector<double>> vec_arr;
while (getline(cin, str)) {
v1.push_back(str);
}
for (string s : v1) {
vector<double> array_data;
ss << s;
while (!ss.eof()) {
ss >> ret;
array_data.push_back(atof(ret.c_str()));
}
vec_arr.push_back(array_data);
ss.str("");
ss.clear(stringstream::goodbit);
}
return vec_arr;
}
vector<vector<int>> getinputdata2() {
string str;
string ret;
stringstream ss;
vector<string> v1;
vector<vector<int>> vec_arr;
while (getline(cin, str)) {
v1.push_back(str);
}
for (string s : v1) {
vector<int> array_data;
ss << s;
while (!ss.eof()) {
ss >> ret;
array_data.push_back(atoi(ret.c_str()));
}
vec_arr.push_back(array_data);
ss.str("");
ss.clear(stringstream::goodbit);
}
return vec_arr;
}
vector<vector < string >> getinputdata() {
string str;
string ret;
stringstream ss;
vector<string> v1;
vector<vector < string>> vec_arr;
while (getline(cin, str)) {
v1.push_back(str);
}
for (string s : v1) {
vector<string> array_data;
ss << s;
while (!ss.eof()) {
ss >> ret;
array_data.push_back(ret);
}
vec_arr.push_back(array_data);
ss.str("");
ss.clear(stringstream::goodbit);
}
return vec_arr;
}
| 0
| 43,523,462
|
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define endl "\n"
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define prt(x) cout << (x)
#define prtl(x) cout << (x) << endl
#define rep(i,a,b) for(ll i=a; i<b; i++)
#define rrep(i,a,b) for(ll i=a; i>b; i--)
#define mp(a, b) make_pair(a, b)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
using vi = vector<int>;
using vll = vector<long long int>;
using vb = vector<bool>;
using vvb = vector<vector<bool>>;
using vc = vector<char>;
using vvi = vector<vector<int>>;
using vvll = vector<vector<long long int>>;
using vvc = vector<vector<char>>;
using ll = long long int;
using P = pair<long long int, long long int>;
using Map = map<long long int, long long int>;
ll INF = 1LL<<60;
ll M = 1000000007;
int main(){
ll N, K; cin >> N >> K;
vll v(N);
vll cum(N);
ll sum = 0;
rep(i, 0, N){
cin >> v[i];
sum += v[i];
cum[i] = sum;
}
ll ans = 0;
rep(i, 0, K+1){
ll r = K - i;
rep(j, 0, r+1){
if(i + j > N){
break;
}
vll g(0);
ll ms = 0;
rep(k, 0, i){
g.emplace_back(v[k]);
ms += v[k];
}
rrep(k, N-1, N-1-j){
g.emplace_back(v[k]);
ms += v[k];
}
ll l = K - (i + j);
sort(g.begin(),g.end());
ll t = sz(g);
rep(i, 0, l){
if(i >= t){
break;
}
else if(g[i]<0){
ms -= g[i];
}else{
break;
}
}
ans = max(ans, ms);
}
}
prt(ans);
}
|
#include <stdlib.h>
#include <iostream>
#include <sstream>
#include <cmath>
#define ll long long
using namespace std;
void ask(ll x){
cout << "? " << x << endl;
fflush(stdout);
}
bool rec(){
char x;
cin >> x;
return (x == 'Y');
}
int main(){
bool is10;
ask(1000000000);
is10 = rec();
ll wei = 1;
if(is10){
ask(2);
ll a = 20;
while(!rec()){
ask(a);
a *= 10;
wei++;
}
cout << "! " << a / 20 << endl;
return 0;
}
ll l,r,mid;
for(ll i = 0;i <= 18;i++){
ask(pow(10,i));
if(!rec()){
l = pow(10,i-1);
r = pow(10,i);
break;
}
}
while(r - l > 1){
mid = (l + r) / 2;
ask(mid * 10);
if(rec()) r = mid;
else l = mid;
}
cout << "! " << r << endl;
return 0;
}
| 0
| 58,326,227
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
ll dis(ll x1, ll y1, ll x2, ll y2){
return abs(x1 - x2) + abs(y1 - y2);
}
int main()
{
ll h, w;
cin >> h >> w;
vector<string> a(h);
set<ll> ban_h;
set<ll> ban_w;
rep(i, h){
cin >> a[i];
}
rep(i, h){
bool flg = true;
rep(j, w){
if (a[i][j] == '#'){
flg = false;
}
}
if (flg){
ban_h.insert(i);
}
}
rep(i, w){
bool flg = true;
rep(j, h){
if (a[j][i] == '#'){
flg = false;
}
}
if (flg){
ban_w.insert(i);
}
}
rep(i, h){
bool flg = false;
rep(j, w){
if (ban_h.find(i) != ban_h.end() || ban_w.find(j) != ban_w.end()){
continue;
}else{
cout << a[i][j];
flg = true;
}
}
if (flg){
cout << endl;
}
}
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<map>
using namespace std;
typedef long long ll;
const int mod=1e9+7,maxn=1e6+10;
const int dx[10]={0,0,-1,1,-1,-1,1,1},dy[10]={-1,1,0,0,-1,1,-1,1};
ll tong[10],h,w,n,sum,tot;
pair<int,int> node[maxn];
map<pair<int,int>,int>mp;
inline int read()
{
int x=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9')
{
if(ch=='-')
f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9')
{
x=(x<<1)+(x<<3)+(ch^48);
ch=getchar();
}
return x*f;
}
int main()
{
scanf("%lld%lld%lld",&h,&w,&n);
for(int i=1;i<=n;i++)
{
int x,y;
node[i].first=read(),node[i].second=read();
mp[node[i]]=1;
}
for(int i=1;i<=n;i++)
for(int j=0;j<8;j++)
{
int nx=node[i].first+dx[j];
int ny=node[i].second+dy[j];
if(nx>=1&&nx<=h&&ny>=1&ny<=w)
{
pair<int,int>temp(nx,ny);
mp[temp]++;
}
}
tot=(h-2)*(w-2);
map<pair<int,int>,int>::iterator it,ed=mp.end();
for(it=mp.begin();it!=ed;it++)
{
int x=it->first.first;
int y=it->first.second;
int val=it->second;
if(x>1&&x<h&&y>1&&y<w)
{
tong[val]++;
sum++;
}
}
tong[0]=tot-sum;
for(int i=0;i<=9;i++)
printf("%lld\n",tong[i]);
return 0;
}
| 0
| 75,316,822
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int x, y, z;
x = 0;
y = 0;
z = 0;
for (int i = 0; i < n; i++) {
int num;
cin >> num;
if (num <= a) {
x++;
} else if (num >= b + 1) {
z++;
} else {
y++;
}
}
if (x <= y) {
if (x <= z) {
cout << x << endl;
} else if (x > z) {
cout << z << endl;
}
} else if (x > y) {
if (y <= z) {
cout << y << endl;
} else if (y > z) {
cout << z << endl;
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:16777216")
#define M1 1000000007
#define M2 998244353
#define fio ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long int
#define ull unsigned long long int
#define eb emplace_back
#define mkp make_pair
#define setbits(x) __builtin_popcount(x)
#define zrobits(x) __builtin_ctzll(x)
#define lftbit(x) x ? 64 - __builtin_clzll(x) : -inf;
#define test(t) while(t--)
#define PI acos(-1.0)
#define F first
#define S second
#define coutd(x) cout << fixed << setprecision(x)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define newl2 cout<<'\n';
#define endl '\n'
#define sz(x) (int)x.size()
#define clr(x) memset(x, 0, sizeof(x))
#define deb(x) cout << #x << "=" << x << endl;
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl;
#define deb3(x, y, z) cout << #x << "=" << x << "," << #y << "=" << y << ","<<#z<<"="<<z<<endl;
#define loop(a,b) for(int i=a;i<b;i++)
#define loope(a,b) for(int i=a;i<=b;i++)
#define pv(v) for(auto i:v) cout<<i<<" "; cout<<endl;
#define pv1(v) for(int i=1;i<sz(v);i++) cout<<v[i]<<" "; cout<<endl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
const int64_t INF = 1e9;
mt19937_64 rang(chrono::high_resolution_clock::now().time_since_epoch().count());
void printTime(clock_t begin)
{
printf("%.3lf seconds\n", (double) (clock() - begin) / CLOCKS_PER_SEC);
}
ll toint(const string &s) {stringstream ss; ss << s; ll x; ss >> x; return x;}
string tostring ( ll number ){stringstream ss; ss<< number; return ss.str();}
template<typename T>
T toIntegralType(const string &str) {
static_assert(is_integral<T>::value, "Integral type required.");
T ret;
stringstream ss(str);
ss >> ret;
if ( to_string(ret) != str)
throw invalid_argument("Can't convert " + str);
return ret;
}
bool is_prime(int n)
{
if(n<2) return 0;
for(int i=2;i*i<=n;i++) if(n%i==0) return 0;
return 1;
}
bool sortbysec(const pair<string,int> &a,
const pair<string,int> &b)
{
return (a.second > b.second);
}
ll fast_power(ll a,ll x)
{
if(x==0) return 1;
else if(x==1) return a;
else { ll R = fast_power(a,x>>1);
if(!(x&1)) return R*R;
else return R*a*R; }
}
ll nc2(ll n)
{
return n*(n-1)/2ll;
}
void solve()
{
string s; cin>>s;
int maxa=-1;
int x=0;
for(char c:s)
{
if(c=='R') x++;
else x=0;
maxa=max(maxa,x);
}
cout<<maxa;
}
int32_t main()
{
fio;
srand(chrono::high_resolution_clock::now().time_since_epoch().count());
int t=1;
test(t)
{
solve(); newl2
}
}
| 0
| 72,778,805
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, m, x, y;
cin >> n >> m >> x >> y;
int aa, bb;
vector<int> a(n);
vector<int> b(m);
for (int i = 0; i < n ; i++){cin >> aa;x = max(x, aa);}
for (int i = 0; i < m ; i++){cin >> bb;y = min(y, bb);}
if (y <= x){cout << "War" << endl;}
else{cout << "No War" << endl;}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n,m;cin>>n>>m;
vector<int> a[100001];
for (int i=0;i<n;i++) {
int b,c;cin>>b>>c;
a[b].push_back(c);
}
int ans=0;
priority_queue<int> q;
for (int i=1;i<=m;i++) {
for (int x:a[i])
q.push(x);
if (q.size()) {
ans+=q.top();q.pop();
}
}
cout<<ans<<endl;
return 0;
}
| 0
| 13,375,016
|
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
string s1, s2;
cin >> s1 >> s2;
int ans = 0;
rep(i, 3) {
if (s1[i] == s2[i]) {
ans++;
}
}
cout << ans << endl;
}
|
#include<bits/stdc++.h>
#include<vector>
#include<algorithm>
using namespace std;
int main(){
double pai=3.141592653589;
int dice[6],q;
char c;
for(int i=0;i<6;i++){
scanf("%d",&dice[i]);
}
scanf("%d",&q);
for(int i=0;i<q;i++){
int x,y;
scanf("%d %d",&x,&y);
if((x==dice[5] && y==dice[4])||(x==dice[4] && y==dice[0])||(x==dice[0] && y==dice[1])||(x==dice[1] && y==dice[5])){
printf("%d\n",dice[2]);
}else if((x==dice[0] && y==dice[2])||(x==dice[2] && y==dice[5])||(x==dice[5] && y==dice[3])||(x==dice[3] && y==dice[0])){
printf("%d\n",dice[4]);
}else if((x==dice[5] && y==dice[1])||(x==dice[1] && y==dice[0])||(x==dice[0] && y==dice[4])||(x==dice[4] && y==dice[5])){
printf("%d\n",dice[3]);
}else if((x==dice[0] && y==dice[3])||(x==dice[3] && y==dice[5])||(x==dice[5] && y==dice[2])||(x==dice[2] && y==dice[0])){
printf("%d\n",dice[1]);
}else if((x==dice[2] && y==dice[1])||(x==dice[1] && y==dice[3])||(x==dice[3] && y==dice[4])||(x==dice[4] && y==dice[2])){
printf("%d\n",dice[5]);
}else{
printf("%d\n",dice[0]);
}
}
return 0;
}
| 0
| 67,215,247
|
#include <iostream>
#include <vector>
#include <algorithm>
typedef long long LL;
using namespace std;
bool cmp(pair<LL,LL> &x, pair<LL,LL> &y)
{
return x.first < y.first;
}
int main(){
LL n;
LL d;
LL a;
cin >> n >> d >> a;
vector<pair<LL,LL>> xh(n);
vector<LL> x(n);
vector<LL> h(n);
vector<LL> endp;
vector<LL> endv;
for(LL i=0; i<n; i++){
cin >> xh[i].first >> xh[i].second;
xh[i].first--;
}
sort(xh.begin(), xh.end(), cmp);
for(LL i=0; i<n; i++){
x[i]=xh[i].first;
h[i]=xh[i].second;
}
LL sum=0;
LL idx=0;
LL ans=0;
for(LL i=0; i<n; i++){
auto itr=lower_bound(endp.begin(), endp.end(), x[i]);
LL dist=distance(endp.begin(), itr);
for(LL i=idx; i<dist; i++){
sum-=endv[i];
}
idx=max(idx, dist);
if(h[i]>sum){
LL tmp;
if((h[i]-sum)%a==0){
tmp=(h[i]-sum)/a;
}else{
tmp=(h[i]-sum)/a+1;
}
sum=sum+tmp*a;
endp.push_back(x[i]+2*d);
endv.push_back(tmp*a);
ans+=tmp;
}
}
cout << ans << endl;
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 <cmath>
#include <iomanip>
#include <ctype.h>
using namespace std;
using ll = long long;
using PAIR = pair<int, int>;
using PAIRLL = pair<ll, ll>;
using vi = vector<int>;
using vvi = vector<vi>;
#define TR ","
#define rep(i,N) for(int i=0;i<(int)N;++i)
ll GCD(ll x, ll y) {
if (y == 0) return x;
else return GCD(y, x % y);
}
ll LCM(ll x, ll y) {
return x / GCD(x, y) * y;
}
ll wazu = 76543217;
ll inv(ll x) {
if (x == 1) { return 1; }
if (x == 0) { return 0; }
else {
ll a = (wazu - inv(wazu % x) * (wazu / x)) % wazu;
if (a >= 0) { return a; }
else { return wazu + a; }
}
}
bool my_compare(pair<string, int> a, pair<string, int> b) {
if (a.first != b.first) {
return a.first < b.first;
}
if (a.second != b.second) {
return a.second > b.second;
}
else {
return true;
}
}
int main()
{
int H, W;
cin >> H >> W;
vector<vector<char> > C(H, vector<char>(W));
rep(i, H) rep(j, W) cin >> C[i][j];
rep(i, H) {
rep(j, W) {
cout << C[i][j];
}
cout << endl;
rep(j, W) {
cout << C[i][j];
}
cout << endl;
}
}
| 0
| 81,834,893
|
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Pair = pair<int64_t, int64_t>;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int64_t K;
cin >> K;
vector<int64_t> result = {1, 2, 3, 4, 5, 6, 7, 8, 9};
while (true) {
if (K <= static_cast<int64_t>(result.size())) {
cout << result[K - 1] << endl;
break;
} else {
K-= static_cast<int64_t>(result.size());
}
vector<int64_t> old;
swap(result, old);
for (int64_t &v : old) {
for (int64_t d = -1; d <= 1; ++d) {
if (v % 10 + d >= 0 && v % 10 + d < 10) {
result.emplace_back(v * 10 + (v % 10 + d));
}
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define fastio() ios_base::sync_with_stdio(false);
#define rmod(x, y) ((((x)%(y))+(y))%(y))
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
template<typename T, typename R = null_type, typename C = less<T>>
tree<T, R, C, rb_tree_tag, tree_order_statistics_node_update> ordered_set(){
return tree<T, R, C, rb_tree_tag, tree_order_statistics_node_update>();
}
const int maxn = 1e4+5;
int n;
ll a[maxn], b[maxn];
int main(){
scanf("%d", &n);
ll as = 0, bs = 0;
for(int i = 0; i<n; i++) scanf("%lld", &a[i]), as+= a[i];
for(int i = 0; i<n; i++) scanf("%lld", &b[i]), bs+= b[i];
if (as >= bs){
if(as==bs && equal(a, a+n, b, b+n)) puts("Yes");
else puts("No");
return 0;
}
ll M = bs-as;
ll K = 0;
for(int i = 0; i<n; i++){
if (a[i]<b[i]) {
ll movs = (b[i]-a[i]+1ll)/2ll;
K+= movs;
a[i]+=movs+movs;
}
}
ll L = M - K;
if (L<0) {puts("No"); return 0;}
ll D = 0;
for(int i = 0; i<n; i++) {
if (b[i]<a[i]) D+= a[i]-b[i], b[i] = a[i];
}
if (L+L == M-D) puts("Yes");
else puts("No");
return 0;
}
| 0
| 71,015,246
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k, r, s, p; cin >> n >> k >> r >> s >> p;
string t; cin >> t;
vector<char> result(n, 'e');
int ans = 0;
for (int i = 0; i < t.size(); i++) {
if (i <= k - 1) {
if (t[i] == 'r') {
ans += p;
result[i] = 'p';
}
if (t[i] == 's') {
ans += r;
result[i] = 'r';
}
if (t[i] == 'p') {
ans += s;
result[i] = 's';
}
}
else {
if (t[i] == t[i - k]) {
if (t[i] == 'r') {
if (result[i - k] == 'p') {}
else {
ans += p;
result[i] = 'p';
}
}
else if (t[i] == 's') {
if (result[i - k] == 'r') {}
else {
ans += r;
result[i] = 'r';
}
}
else if (t[i] == 'p') {
if (result[i - k] == 's') {}
else {
ans += s;
result[i] = 's';
}
}
}
else {
if (t[i] == 'r') {
ans += p;
result[i] = 'p';
}
if (t[i] == 's') {
ans += r;
result[i] = 'r';
}
if (t[i] == 'p') {
ans += s;
result[i] = 's';
}
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define PI ( acos(-1.0) )
#define mod 1000000007LL
#define IN freopen("nocross.in","r",stdin)
#define OUT freopen("nocross.out","w",stdout)
#define FOR(i,a,b) for(i=a ; i<=b ; i++)
#define DBG printf("Hi\n")
#define INF 2000000000000000000LL
#define i64 long long int
#define eps (1e-8)
#define xx first
#define yy second
#define ln 17
#define off 2
#define SZ(z) ((int)z.size())
#define FastIO ios_base::sync_with_stdio(false); cin.tie(NULL)
using namespace std ;
#define maxn 300005
i64 ans[maxn] ;
i64 pos[maxn] , type[maxn] ;
i64 nextPos[maxn] ;
int main()
{
i64 n , L , T ;
scanf("%lld %lld %lld",&n,&L,&T) ;
i64 cl = 0 , anticl = 0 ;
for(int i=1 ; i<=n ; i++)
{
scanf("%lld %lld",&pos[i],&type[i]) ;
if(type[i]==1) cl++ ;
else anticl++ ;
if( type[i] == 1 ) nextPos[i] = (pos[i]+T)%L ;
else nextPos[i] = ((pos[i]-T)%L + L)%L ;
}
sort( nextPos+1 , nextPos+n+1 ) ;
if( type[1] == 1 )
{
i64 collision = 0 ;
collision = 2LL*(T/L)*anticl ;
i64 p = (T+pos[1])%L ;
for(int i=2 ; i<=n ; i++)
{
if(type[i]==1) continue ;
if( ( pos[i]-pos[1] ) <= 2*(T%L) )
{
collision++ ;
if( pos[1]+L-pos[i] <= (2*(T%L) - 2*( pos[i]-pos[1] )) ) collision++ ;
}
}
collision %= n ;
int idx = collision+1 ;
int start = 1 ;
for(int i=1 ; i<=n ; i++)
{
if( nextPos[i] == p ) start = i ;
}
for(int i=start , j=1 ; j<=n ; j++ )
{
ans[idx] = nextPos[i] ;
idx++ ; if(idx>n) idx -= n ;
i++ ; if(i>n) i -= n ;
}
}
else{
i64 collision = 0 ;
collision = 2LL*(T/L)*cl ;
i64 p = ( (pos[1]-T)%L + L )%L ;
for(int i=n ; i>1 ; i--)
{
if(type[i]==2) continue ;
if( (pos[1] + L-pos[i] ) <= 2*(T%L) )
{
collision++ ;
if( (pos[i]-pos[1]) <= (2*(T%L) - 2*(pos[1] + L-pos[i] )) ) collision++ ;
}
}
collision %= n ;
int idx = 1 ;
if(collision > 0) idx = n-collision+1 ;
int start ;
for(int i=n ; i>=1 ; i--)
{
if( nextPos[i] == p ) start = i ;
}
for(int j=1 , i= start ; j<=n ; j++)
{
ans[idx] = nextPos[i] ;
i++ ; idx++ ;
if(i > n) i -= n ;
if(idx > n) idx -= n ;
}
}
for(int i=1 ; i<=n ; i++)
{
printf("%lld\n",ans[i]) ;
}
return 0 ;
}
| 0
| 16,175,464
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 1000000007
int main() {
ll n,k;
cin>>n>>k;
ll cnt=(n-1)*(n-2)/2;
if(cnt<k){
cout << -1;
return 0;
}
cnt=cnt-k;
cout << n-1+cnt<<endl;
for(ll i=0;i<n-1;i++){
cout << 1<<" "<<i+2<<endl;
}
for(ll i=2;i<=n;i++){
for(ll j=i+1;j<=n;j++){
if(cnt==0){
return 0;
}
cout << i<<" "<<j<<endl;
cnt--;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
typedef vector<int> vec;
ll mod_pow(ll a, ll n, ll m) {
ll res = 1;
while (n) {
if (n & 1)res = res * a%m;
a = a * a%m; n >>= 1;
}
return res;
}
struct modint {
ll n;
modint() :n(0) { ; }
modint(ll m) :n(m) {
if (n >= mod)n %= mod;
else if (n < 0)n = (n%mod + mod) % mod;
}
operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
if (n == 0)return modint(1);
modint res = (a*a) ^ (n / 2);
if (n % 2)res = res * a;
return res;
}
ll inv(ll a, ll p) {
return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
fact[0] = modint(1);
for (int i = 0; i < max_n - 1; i++) {
fact[i + 1] = fact[i] * modint(i + 1);
}
factinv[max_n - 1] = modint(1) / fact[max_n - 1];
for (int i = max_n - 2; i >= 0; i--) {
factinv[i] = factinv[i + 1] * modint(i + 1);
}
}
modint comb(int a, int b) {
if (a < 0 || b < 0 || a < b)return 0;
return fact[a] * factinv[b] * factinv[a - b];
}
using mP = pair<modint, modint>;
int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };
string zurashi(string ts){
ts.insert(ts.begin(), ts.back());
ts.pop_back();
return ts;
}
void solve() {
int N; cin >> N;
vector<string> s(N), t(N);
rep(i, N) cin >> s[i];
rep(i, N)rep(j, N) t[i].push_back(s[j][i]);
vector<vector<string>> ss(N, vector<string>(N));
auto tt = ss;
ss[0] = s; tt[0] = t;
rep(i, N-1){
rep(j, N){
ss[i+1][j] = zurashi(ss[i][j]);
tt[i+1][j] = zurashi(tt[i][j]);
}
}
ll res = 0;
rep(i, N){
rep(j, N){
bool f = true;
rep(k, N){
int ii = k-i>=0 ? k-i : k-i+N;
int jj = k-j>=0 ? k-j : k-j+N;
if(ss[j][ii] != tt[i][jj]) f = false;
}
if(f) res++;
}
break;
}
cout << res*N << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
| 0
| 84,321,125
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
string s;
cin >> s;
map<char,int> m;
rep(i,4) m[s[i]]++;
int cnt = 0;
for(auto p : m) if(p.second == 2) cnt++;
if(cnt == 2) cout << "Yes" << endl;
else cout << "No" << endl;
}
|
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
string ans;
inline int query(ll x){
cout<<"? "<<x<<endl;
cin>>ans;return ans=="Y";
}
inline int solve1()
{
ll fac=1;
for(int i=1;i<=10;++i,fac*=10)
if(!query(fac)) return i-1;
return -1;
}
inline void spj()
{
int fac=9;
for(int i=1;i<=10;++i,fac=fac*10+9)
if(query(fac)) {cout<<"! "<<(long long)pow(10,i-1)<<endl;return ;}
}
int main()
{
int len=solve1();
if(len==-1) return spj(),0;
ll num=0;
for(int i=len;i>1;--i)
{
int l= (i==len)?1:0,r=9,ans=-1;
while(l<=r)
{
int mid=(l+r)>>1;
if(query(num+mid*pow(10,i-2))) l=mid+1,ans=mid;
else r=mid-1;
}
num+=ans*pow(10,i-2);
}
num*=100;
int l=len==1?1:0,r=9,ans=-1;
while(l<=r)
{
int mid=(l+r)>>1;
if(query(num+mid*10)) r=mid-1,ans=mid;
else l=mid+1;
}
num+=ans*10;
cout<<"! "<<num/10<<endl;
return 0;
}
| 0
| 27,684,993
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define debug(x) cout << #x << ": " << x << endl
#define out(x) cout << x << endl
const int MOD = 1000000007;
const ll LINF = (ll)1e18 - 1;
const int INF = 1e9 - 1;
const double EPS = 0.000000001;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
void print(const vector<int> &v) {
for(auto x : v) {
cout << x << " ";
}
cout << endl;
}
template <int mod = 1000000007>
struct Combination {
std::vector<long long> fac, finv, inv;
Combination(const long long n)
: fac(n + 1, 0), finv(n + 1, 0), inv(n + 1, 0) {
for (long long i = 0; i < n + 1; ++i) {
bool one_or_zero = i == 0 || i == 1;
fac[i] = one_or_zero ? 1 : fac[i - 1] * i % mod;
inv[i] = one_or_zero ? 1 : mod - inv[mod % i] * (mod / i) % mod;
finv[i] = one_or_zero ? 1 : finv[i - 1] * inv[i] % mod;
}
inv[0] = 0;
}
long long operator()(const long long n, const long long r) {
if (n < r || n < 0 || r < 0)
return 0;
else if (n == r || r == 0)
return 1;
return fac[n] * (finv[r] * finv[n - r] % mod) % mod;
}
long long perm(const long long n, const long long r) {
if (n < r || n < 0 || r < 0)
return 0;
else if (r == 0)
return 1;
return fac[n] * finv[n - r] % mod;
}
};
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
ll x, y;
cin >> x >> y;
if((2 * x - y) % 3 == 0 && (- x + 2 * y) % 3 == 0) {
ll n, m;
n = (2 * x - y) / 3;
m =(- x + 2 * y) / 3;
Combination<MOD> comb(n + m + 1);
out(comb(n + m, n));
}
else out(0);
return 0;
}
|
#include<iostream>
#include<vector>
#include<map>
#include<string>
#include<cstring>
#include<algorithm>
#include<sstream>
#include<stack>
#include<bitset>
#include<queue>
#include<cmath>
#include<set>
#define ll long long
#define PI 3.14159265358979323846
#define IO ios::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define rep(i,start,end) for(int i=start;i<end;i++)
#define per(i,start,end) for (int i=end-1;i>=start;i--)
using namespace std;
const ll mod=1000000007;
const ll inf=1e9;
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);}
ll leastbit(ll a) { return a&(-a);}
ll C(int a,int b) { ll res=1;rep(i,0,b)res=res*(a-i)/(i+1);return res;}
ll powmod(ll a,ll b) { if(b==0)return 1;ll cnt=powmod(a,b/2);(cnt*=cnt) %=mod;if(b&1){(cnt*=a) %= mod;}return cnt;}
int main()
{IO
#ifndef ONLINE_JUDGE
#else
#endif
ll n,arr[500];
ll sum=1000;
cin>>n;
for(int i=0;i<n;i++)cin>>arr[i];
for(int i=1;i<n;i++){
if(arr[i-1]<arr[i]){
ll num=sum/arr[i-1];
sum+=arr[i]*num;
sum-=num*arr[i-1];
}
}
cout<<sum<<endl;
return 0;
}
| 0
| 32,789,946
|
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) for(int i = 0; i < (int)(a); i++)
#define all(v) v.begin(), v.end()
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define sq(x) ((x) * (x))
template<class T> T gcd(T a, T b){ return ((b == 0) ? a : gcd(b, a % b)); }
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
if(k > ((n - 1) * (n - 2)) / 2) cout << -1 << endl;
else{
k = ((n - 1) * (n - 2) / 2) - k;
cout << n - 1 + k << endl;
repn(i, 2, n + 1) cout << 1 << " " << i << endl;
repn(i, 2, n + 1) repn(j, i + 1, n + 1){
if(!k) goto end;
cout << i << " " << j << endl;
k--;
if(!k) goto end;
}
}
end:;
return 0;
}
|
#include "bits/stdc++.h"
#include<cassert>
#pragma warning(disable:4996)
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define MRE assert(0)
const int mod = 1000000007;
const long long inf = 1ll << 61;
typedef pair<int, int> P;
typedef pair<P, int>PP;
vector<int>G[100006];
int dp[100006];
int memo(int now,int par) {
if (dp[now] != inf)return dp[now];
int res = 0;
for (int e : G[now]) {
if (e == par)continue;
res ^= (memo(e, now) + 1);
}
return dp[now] = res;
}
signed main() {
int n; cin >> n;
rep(i, n - 1) {
int x, y; cin >> x >> y;
x--; y--;
G[x].push_back(y);
G[y].push_back(x);
}
rep(i, n)dp[i] = inf;
memo(0, -1);
if (dp[0])puts("Alice");
else puts("Bob");
}
| 0
| 46,016,841
|
#include<bits/stdc++.h>
using namespace std;
int n,l,q,a[100005],b[100005][21];
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
}
scanf("%d",&l);
int dem=1,sum=0;
for(int i=2;i<=n;i++){
sum+=a[i]-a[i-1];
while(sum>l){
b[dem][0]=i-1;
dem++;
sum-=(a[dem]-a[dem-1]);
}
}
for(int i=dem;i<=n;i++){
b[i][0]=n;
}
for(int j=1;(1<<j)<=n;j++){
for(int i=1;i<=n;i++){
b[i][j]=b[b[i][j-1]][j-1];
}
}
scanf("%d",&q);
while(q--){
int u,v;
scanf("%d %d",&u,&v);
if(u>v) swap(u,v);
int ans=1;
for(int i=log2(n);i>=0;i--){
if(b[u][i]<v){
u=b[u][i];
ans+=(1<<i);
}
}
printf("%d\n",ans);
}
}
|
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;
typedef pair<int,int>P;
const int INF=0x3f3f3f3f;
int dp[200][200][2];
char s[200][200];
int main(){
int h,w;cin>>h>>w;
rep(i,h)scanf("%s",s[i]);
memset(dp,0x3f,sizeof(dp));
dp[0][0][s[0][0]=='.'?0:1]=(s[0][0]=='#');
rep(i,h)rep(j,w)rep(k,2){
if(dp[i][j][k]==INF)continue;
if(i+1<h){
int t=(s[i+1][j]=='.'?0:1);
dp[i+1][j][t]=min(dp[i+1][j][t],dp[i][j][k]+(k==0&&t==1));
}
if(j+1<w){
int t=(s[i][j+1]=='.'?0:1);
dp[i][j+1][t]=min(dp[i][j+1][t],dp[i][j][k]+(k==0&&t==1));
}
}
cout<<min(dp[h-1][w-1][0],dp[h-1][w-1][1])<<endl;
}
| 0
| 50,864,717
|
#include<bits/stdc++.h>
using namespace std;
int n;
vector<vector<int>> adj;
vector<pair<int, int>> DP;
const int inf = (int)1e9 + 7;
void dfs(int i, int p)
{
long long n1 = 1, n2 = 1;
for (auto x : adj[i])
{
if (x == p)
continue;
dfs(x, i);
n1 *= (long long) (DP[x].first + DP[x].second);
n2 *= DP[x].first;
n1 %= inf;
n2 %= inf;
}
DP[i].first = n1;
DP[i].second = n2;
}
int main()
{
cin >> n;
adj.resize(n + 1);
DP.resize(n + 1);
int a, b;
for (int i = 0; i < n - 1; i++)
{
cin >> a >> b;
adj[a].push_back(b);
adj[b].push_back(a);
}
dfs(1, 1);
cout << (DP[1].first + DP[1].second)%inf << endl;
}
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define vi vector<int>
#define vpi vector<pair<int,int>>
#define vll vector<ll>
#define vpll vector<pair<ll,ll>>
#define endl '\n'
#define si(v) int(v.size())
#define all(v) v.begin(), v.end()
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, n, m) for (ll i = n; i <= (m); ++i)
#define rep3(i, n, m) for (ll i = n; i >= (m); --i)
template<class T, class U> void chmax(T &a, U b) { if (a < b) a = b; }
template<class T, class U> void chmin(T &a, U b) { if (b < a) a = b; }
using ll = long long;
using ld = long double;
using namespace std;
constexpr ll MOD = 1000000007;
signed main()
{
cout << fixed << setprecision(20);
ios::sync_with_stdio(false);
cin.tie(0);
ll n; cin >> n;
auto f = [&](ll x) {
int res = 0;
while (x) {
x /= 10;
++res;
}
return res;
};
ll ans = MOD;
rep2(i, 1, sqrt(n)) {
if (n % i == 0) {
ll a = i, b = n / i;
chmin(ans, max(f(a), f(b)));
}
}
cout << ans << endl;
return (0);
}
| 0
| 33,203,096
|
#include<bits/stdc++.h>
using namespace std;
int minCoins(int coinList[], int n, int value) {
int coins[value+1];
if(value == 0)
return 0;
coins[0] = 0;
for (int i=1; i<=value; i++)
coins[i] = INT_MAX;
for (int i=1; i<=value; i++) {
for (int j=0; j<n; j++)
if (coinList[j] <= i) {
int tempCoins = coins[i-coinList[j]];
if (tempCoins != INT_MAX && tempCoins + 1 < coins[i])
coins[i] = tempCoins + 1;
}
}
return coins[value];
}
int main() {
int coins[100100];
int ind = 0 ;
coins[ind++] = 1;
int value ;
cin >> value;
int ans = 6;
while(ans<=value)
{
coins[ind++] = ans;
ans *= 6 ;
}
ans = 9 ;
while(ans<=value)
{
coins[ind++] = ans;
ans *= 9 ;
}
sort(coins,coins+ind) ;
cout << minCoins(coins, ind, value);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define ARRAY_LENGTH(array) sizeof(array)/sizeof(*array)
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 int INF = 1000100100;
using Graph = vector<vector<ll>>;
Graph G;
vector<ll> memo(1e6 + 1, INF);
vector<bool> pressed(1e6 + 1, false);
ll min_cnt(ll from, ll cnt) {
if(from == 1) {
return cnt;
}
if(memo[from] != INF) {
return memo[from];
}
if(G.at(from).empty() || pressed[from]) {
memo[from] = -1;
} else {
pressed[from] = true;
ll res = INF;
REP(i, G.at(from).size()) {
ll n_from = G[from][i];
ll tmp = min_cnt(n_from, cnt + 1);
if(tmp != -1) {
res = min(res, tmp);
}
}
if(res == INF) {
memo[from] = -1;
} else {
memo[from] = res;
}
}
if(memo[from] == -1) {
pressed[from] = true;
}
return memo[from];
}
int main() {
ll N;
cin >> N;
G.resize(N + 1);
REP(i, N) {
ll a;
cin >> a;
G.at(i).emplace_back(a - 1);
}
ll ans = min_cnt(0, 0);
cout << ans << endl;
return 0;
}
| 0
| 87,575,024
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
const int mx=1e6+11;
const double PI = acos(-1);
#define MOD 1000000007
#define nl '\n'
#define pb push_back
#define F first
#define S second
#define I insert
#define mp make_pair
#define sz(x) x.size()
#define tt int t; cin>>t; while(t--)
#define lo(i,a,b) for(int i=a;i<b;i++)
#define rlo(i,n) for(int i=n-1;i>=0;i--)
#define be(a) (a).begin(),(a).end()
#define rbe(a) (a).rbegin(),(a).rend()
#define mem(a,b) memset(a,b,sizeof(a))
#define pr(a) {for(auto x:a)cout<<x<<" ";cout<<nl;}
#define su ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define frac cout.unsetf(ios::floatfield); cout.precision(10); cout.setf(ios::fixed,ios::floatfield);
#define dbg(args...) do {cerr << #args << " : "; faltu(args); } while(0)
void faltu () { cerr << endl;}
template < typename T, typename ... hello>void faltu( T arg, const hello &... rest) {cerr << arg << ' ';faltu(rest...);}
void f()
{
int n,k;
cin>>n>>k;
(n%k)?cout<<1<<nl:cout<<0<<nl;
}
int main()
{
su;
f();
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
map<int, int> mp1, mp2;
for(int i = 0; i < n; i++) {
cin >> a[i];
if(i % 2 == 0) {
mp1[a[i]]++;
} else {
mp2[a[i]]++;
}
}
int m1 = 0;
int idx1 = 0;
for(auto p : mp1) {
if(m1 < p.second) {
m1 = p.second;
idx1 = p.first;
}
}
int m2 = 0;
int idx2 = 0;
for(auto p : mp2) {
if(m2 < p.second) {
m2 = p.second;
idx2 = p.first;
}
}
int m3 = 0;
int idx3 = 0;
for(auto p : mp1) {
if(p.first == idx1) {
continue;
}
if(m3 < p.second) {
m3 = p.second;
idx3 = p.first;
}
}
int m4 = 0;
int idx4 = 0;
for(auto p : mp2) {
if(p.first == idx2) {
continue;
}
if(m4 < p.second) {
m4 = p.second;
idx4 = p.first;
}
}
if(idx1 != idx2) {
cout << n - mp1[idx1] - mp2[idx2] << endl;
} else {
cout << min(n - mp1[idx3] - mp2[idx2], n - mp1[idx1] - mp2[idx4]) << endl;
}
return 0;
}
| 0
| 9,510,744
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 5LL << 60;
const ll mod = 1e9 + 7;
int main() {
int N;
cin >> N;
int B[N];
for(int i = 0; i < N; i++) cin >> B[i];
int ans = B[0] + B[N - 2];
for(int i = 1; i < N - 1; i++) {
ans += min(B[i - 1], B[i]);
}
cout << ans;
return 0;
}
|
#include<iostream>
#include<string>
#include<iomanip>
#include<cmath>
#include<math.h>
#define rep(i,start,n) for(int i=0 ; i<n ; i++)
using namespace std;
int main(){
int a , b , C;
double S=0,h=0,c=0;
cin >> a >> b >> C;
S = 0.5 * a * b * sin(C * M_PI / 180);
h = 2 * S / a;
c = sqrt(a * a + b * b - 2 * a * b * cos(C * M_PI / 180));
cout << fixed << setprecision(8) << S << endl;
cout << fixed << setprecision(8) << a+b+c << endl;
cout << fixed << setprecision(8) << h << endl;
return 0;
}
| 0
| 56,404,024
|
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
int ans = 2100000000;
if (x < y) ans = y-x;
if (-x <= y) ans = min(ans, 1 + y + x);
if (x <= -y) ans = min(ans, 1 - y - x);
if (x > y) ans = min(ans, 2 - y + x);
cout << ans << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;
#define int ll
const int INF=(int)2e18;
const int MOD = 1000000007;
const int PEG = 998244353;
long double pie=acos(-1);
typedef vector< int > vi;
typedef vector< vi > vvi;
typedef pair< int, int > pii;
typedef vector< pii > vpii;
#define X first
#define Y second
#define pb push_back
#define sz(a) (ll)(a).size()
#define all(a) (a).begin(),(a).end()
#define F(i,a,b) for(ll i=a;i<=b;i++)
#define RF(i,a,b) for(ll i=a;i>=b;i--)
#define Fo(i,a,b,j) for(ll i=a;i<=b;i+=j)
#define RFo(i,a,b,j) for(ll i=a;i>=b;i-=j)
#define in(a,n) F(i,0,n-1)cin>>a[i]
#define in1(a,n) F(i,1,n)cin>>a[i]
#define out(a,n) F(i,0,n-1)cout<<a[i]<<" "
#define out1(a,n) F(i,1,n)cout<<a[i]<<" "
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define popcount __builtin_popcountll
#define pfy cout<<"YES"
#define pfn cout<<"NO"
#define pfn1 cout<<"-1"
#define pf1 cout<<"1"
#define nl cout<<"\n"
#define watch(x) cout<<#x<<" is "<<x<<"\n"
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>void __f(const char* name,Arg1&& arg1);
template <typename Arg1,typename... Args>void __f(const char* names,Arg1&& arg1,Args&&... args);
ll binpow(ll x,ll y,ll p);
signed main()
{
#ifndef ONLINE_JUDGE
#endif
fast;
int N;
cin>>N;
int a[N];
int cnt[N+1]={};
F(i,0,N-1)
{
cin>>a[i];
cnt[a[i]]++;
}
int sum=0;
F(i,1,N)
{
sum+=(cnt[i]*(cnt[i]-1))/2;
}
F(i,0,N-1)
{
if(cnt[a[i]]>1)
{
cout<<sum-(cnt[a[i]]-1);nl;
}
else {cout<<sum;nl;}
}
return 0;
}
ll binpow(ll x, ll y, ll p)
{
ll res = 1;
x = x % p;
while (y > 0)
{
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
template <typename Arg1>
void __f(const char *name, Arg1 &&arg1)
{
std::cout << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&... args)
{
const char *comma = strchr(names + 1, ',');
std::cout.write(names, comma - names) << " : " << arg1 << "\n";
__f(comma + 1, args...);
}
| 0
| 84,347,511
|
#include<iostream>
using namespace std;
int main(){
int a,b,c,t;
cin >> a >> b >> c;
while(1){
if(c<=b && b<=a)break;
if(a>b){
t = a;
a = b;
b = t;
}else if(b>c){
t = b;
b = c;
c = t;
}else if(c>a){
t = c;
c = a;
a = t;
}
}
cout << c <<" "<< b << " " << a <<endl;
}
|
#include <bits/stdc++.h>
#define rep(i ,n) for(int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int nmax = 8;
vector<vector<bool>> graph(nmax, vector<bool>(nmax, false));
int dfs(int c, int N, vector<bool> visited){
bool all_visited = true;
rep(i, N){
if(!visited[i]){
all_visited = false;
}
}
if(all_visited){
return 1;
}
int count = 0;
rep(i, N){
if(!graph[c][i] || visited[i]){
continue;
}
visited[i] = true;
count += dfs(i, N, visited);
visited[i] = false;
}
return count;
}
int main(){
int N, M; cin >> N >> M;
vector<bool> visited(N, false);
rep(i, M){
int a, b; cin >> a >> b;
graph[a-1][b-1] = graph[b-1][a-1] = true;
}
visited[0] = true;
int ans = dfs(0, N, visited);
cout << ans << endl;
return 0;
}
| 0
| 934,685
|
#include <bits/stdc++.h>
using namespace std;
int main (void) {
int K, S;
cin >> K >> S;
long long ans = 0;
for ( int x = 0; x <= K; x++ ) {
for ( int y = 0; y <= K; y++ ) {
int z = S - x - y;
if ( z < 0 ) break;
if ( K < z ) continue;
ans++;
}
}
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<cstdio>
#include<cctype>
using namespace std;
int main(){
char ch;
int cnt[26]={};
while (cin >> ch){
ch = tolower(ch);
if (isalpha(ch)){
cnt[ch-'a']=cnt[ch-'a']+1;
}
}
for(int i=0; i<26;i++){
printf("%c : %d\n", i+'a', cnt[i]);
}
return 0;
}
| 0
| 61,479,908
|
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n); for(ll i = 0; i < (ll)n; i++)
int main() {
string S; cin >> S;
int n = S.size();
string T = S;
for(int i=n-2; i>0; i-=2){
string T1 = T.substr(0,i/2);
string T2 = T.substr(i/2, i/2);
if(T1 == T2){ cout << i << endl; return 0; }
}
}
|
#include <iostream>
#include <cassert>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <ctime>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <string>
#include <bitset>
#include <vector>
#include <complex>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int,int> pii;
typedef vector<int> vi;
#define de(x) cout << #x << "=" << x << endl
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define per(i,a,b) for(int i=(b)-1;i>=(a);--i)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
const int N = 50;
ll K , n , a[N];
int main(){
cin >> K;
n = 50;
rep(i,0,n) a[i] = i + K / n;
rep(i,0,K%n) {
int p=min_element(a,a+n)-a;
a[p]+=n;
rep(i,0,n) if(i!=p) a[i]--;
}
cout<<n<<endl;
rep(i,0,n) cout<<a[i]<<" \n"[i+1==n];
return 0;
}
| 0
| 76,145,170
|
#include<bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
int main(){
ll X,Y,Z,K,i,j,k;scanf("%lld%lld%lld%lld",&X,&Y,&Z,&K);
ll A[X],B[Y],C[Z];
for(i=0;i<X;i++) scanf("%lld",&A[i]);
for(j=0;j<Y;j++) scanf("%lld",&B[j]);
for(k=0;k<Z;k++) scanf("%lld",&C[k]);
sort(A,A+X,greater<ll>());
sort(B,B+Y,greater<ll>());
sort(C,C+Z,greater<ll>());
vector<ll> ans;
for(i=0;i<X && i+1 <= K;i++){
for(j=0;j<Y && (i+1)*(j+1) <= K;j++){
for(k=0;k<Z && (i+1)*(j+1)*(k+1) <= K;k++){
ans.emplace_back(A[i]+B[j]+C[k]);
}
}
}
sort(ans.begin(),ans.end(),greater<ll>());
for(i=0;i<K;i++) printf("%lld\n",ans[i]);
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int H, W, M;
cin >> H >> W >> M;
int h[M], w[M];
int ch[H]{}, cw[W]{};
int hmax = 0;
int wmax = 0;
for (int i = 0; i < M; i++) {
cin >> h[i] >> w[i];
h[i]--;
w[i]--;
ch[h[i]]++;
cw[w[i]]++;
hmax = max(hmax, ch[h[i]]);
wmax = max(wmax, cw[w[i]]);
}
int hh = 0;
int ww = 0;
for (int i = 0; i < H; i++) {
if (hmax == ch[i]) hh++;
}
for (int i = 0; i < W; i++) {
if (wmax == cw[i]) ww++;
}
int cnt = 0;
for (int i = 0; i < M; i++) {
if (ch[h[i]] == hmax && cw[w[i]] == wmax) cnt++;
}
if (cnt==hh*ww) {
cout << hmax + wmax - 1<< endl;
} else {
cout << hmax + wmax << endl;
}
return 0;
}
| 0
| 27,715,775
|
#include<iostream>
#include <algorithm>
using namespace std;
int main(){
string main, str, sidestr;
int n, i, j;
cin >> main >> n;
for (int p = 0; p < n; p++) {
cin >> str;
if (str == "replace") {
cin >> i >> j >> sidestr;
main.replace(i, j + 1 - i, sidestr);
} else if (str == "reverse") {
cin >> i >> j;
string pickles = main.substr(i, j + 1 - i);
reverse(pickles.begin(), pickles.end());
main.replace(i, j + 1 - i, pickles);
} else {
cin >> i >> j;
cout << main.substr(i, (j + 1 - i)) << endl;
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main ()
{
typedef int l;
int a,b,c,d; cin>>a>>b>>c>>d;
l s1=a+c;
l s2=a+d;
l s3=b+c;
l s4=b+d;
cout<<min(s1,min(s2,min(s3,s4)));
}
| 0
| 83,674,225
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll MOD = 1000000007;
long long longpow(long long n, long long a, long long mod) {
if (a == 0) return 1;
if (a == 1) return n % mod;
if (a % 2 == 1) return (n * longpow(n, a - 1, mod)) % mod;
ll t = longpow(n, a / 2, mod) % mod;
return (t * t) % mod;
}
int main() {
int N;
cin >> N;
vector<ll> A(N + 2);
REP(i, N + 1) cin >> A[i];
ll ans = 0;
vector<ll> L(N + 2), R(N + 2);
L[N] = A[N], R[N] = A[N];
for (int i = N - 1; i >= 0; i--) {
L[i] = A[i] + (L[i + 1] + 1) / 2;
R[i] = A[i] + R[i + 1];
}
if (L[0] != 1) {
cout << -1 << endl;
return 0;
}
ll current = 1;
REP(i, N + 1) {
ans += current;
current -= A[i];
current = min(current * 2, R[i + 1]);
}
cout << ans << endl;
}
|
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
vector<vector<char> > v;
vector<char> mv;
mv.push_back(' ');mv.push_back('.');mv.push_back(',');mv.push_back('!');mv.push_back('?');
v.push_back(mv);
mv.clear();
mv.push_back('c');mv.push_back('a');mv.push_back('b');
v.push_back(mv);
mv.clear();
mv.push_back('f');mv.push_back('d');mv.push_back('e');
v.push_back(mv);
mv.clear();
mv.push_back('i');mv.push_back('g');mv.push_back('h');
v.push_back(mv);
mv.clear();
mv.push_back('l');mv.push_back('j');mv.push_back('k');
v.push_back(mv);
mv.clear();
mv.push_back('o');mv.push_back('m');mv.push_back('n');
v.push_back(mv);
mv.clear();
mv.push_back('s');mv.push_back('p');mv.push_back('q');mv.push_back('r');
v.push_back(mv);
mv.clear();
mv.push_back('v');mv.push_back('t');mv.push_back('u');
v.push_back(mv);
mv.clear();
mv.push_back('z');mv.push_back('w');mv.push_back('x');mv.push_back('y');
v.push_back(mv);
mv.clear();
string s;
int a,i,cou,n,cou2,b;
cin >>b;
for(int j=0;j<b;j++){
cin>>s;
a=s.size();
i=0;
cou2=0;
while(i<a){
cou=0;
n=0;
while(s[i]!='0'&&i<a){
if(n!=s[i]-'0')cou=0;
n=s[i]-'0';
i++;
cou++;
}
i++;
if(cou!=0&&i<=a){
if(n==8||n==2||n==3||n==4||n==5||n==6)cou=cou%3;
else if(n==7||n==9)cou=cou%4;
else if(n==1)cou=cou%5;
cout<<v[n-1][cou];
cou2++;
}
}
if(cou2!=0)cout<<endl;
}
return 0;
}
| 0
| 65,870,140
|
#include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1000000007;
typedef int64_t ll;
typedef uint64_t ull;
#define FOR(i, start, end) for(uint64_t i=start; i<end; i++)
#define REP(i, n) FOR(i, 0, n)
uint64_t gcd(uint64_t m, uint64_t n) {
uint64_t temp;
while (m % n != 0){
temp = n;
n = m % n;
m = temp;
}
return n;
}
uint64_t lcm(uint64_t m, uint64_t n) {
return (m*n)/gcd(m,n);
}
void comb(vector<vector <uint64_t> > &v){
for(uint64_t i = 0;i <v.size(); i++){
v[i][0]=1;
v[i][i]=1;
}
for(uint64_t k = 1;k <v.size();k++){
for(uint64_t j = 1;j<k;j++){
v[k][j]=(v[k-1][j-1]+v[k-1][j]);
}
}
}
bool is_product_overflow(uint64_t a, uint64_t b) {
uint64_t prod = a * b;
return (prod / b != a);
}
void primeFactorization(uint64_t a, list<uint64_t> &factors){
long i,sq;
if(a%2==0){
factors.push_back(2);
primeFactorization(a/2,factors);
return;
}
sq = sqrt(a);
for(i=3;i<=sq;i+=2){
if(a%i==0){
factors.push_back(i);
primeFactorization(a/i,factors);
return;
}
}
if(a!=1){
factors.push_back(a);
}
}
int64_t modinv(int64_t a, int64_t m) {
int64_t b = m, u = 1, v = 0;
while (b) {
int64_t t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
signed main() {
ll x,y;
cin >> x >> y;
ll val = x;
ll count = 0;
while(val<=y){
val *= 2;
count++;
}
cout << count << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
if(v.size() >= 200) {
return "Too big container";
}
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define rep(i,n) for (int i = 0; i < n; ++i)
#define per(i,n) for (int i = n - 1; i >= 0; --i)
#define rep1(i,n) for (int i = 1; i <= n; ++i)
#define reps(i,s,n) for (int i = s; i < n; ++i)
#define all(c) begin(c),end(c)
template<typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
typedef long long ll;
typedef long double ld;
typedef pair<int,int> PINT;
typedef pair<ll,ll> PLL;
const long long MOD = 1e9+7;
#define precout() cout << std::fixed << std::setprecision(20);
#define print(a) cout << a << endl;
const int INFI = (1 << 30) - 1;
const long long INFLL = (1LL << 62) - 1;
template<typename T> void printv(vector<T>&v) {
int n = v.size() - 1;
rep(i, n) cout << v[i] << " ";
cout << v.back() << endl;
}
const int dy[4] = { 0, 1, 0, -1 };
const int dx[4] = { 1, 0, -1, 0 };
double deg2rad(double deg) { return deg * M_PI / 180; }
double rad2deg(double rad) { return rad * 180 / M_PI; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s,t; cin >> s >> t;
int n = s.size();
int tn = t.size();
int lastInd = -1;
rep(i, n) {
if(i + tn > n) break;
bool ok = 1;
rep(j, tn) {
if(s[i + j] == '?' || s[i + j] == t[j]) {
} else {
ok = 0;
break;
}
}
if(ok) {
lastInd = i;
}
}
if(lastInd == -1) {
print("UNRESTORABLE");
exit(0);
}
string ans = s.substr(0, lastInd);
debug(ans);
ans.append(t);
debug(ans);
ans.append(s.substr(lastInd + tn));
debug(ans);
for(auto&c:ans) {
if(c == '?') {
c = 'a';
}
}
print(ans);
}
| 0
| 26,262,622
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
template<class T> void vin(vector<T>& v, int n) {
v.resize(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
}
bool check(ll x, ll a, ll b) {
ll p = a*b;
ll m = x/2;
for (ll i = max(1LL, m-10); i<=min(x, m+10); ++i) {
ll aa = i, bb = x - i + 1;
if (aa >= a) aa++;
if (bb >= b) bb++;
if (aa*bb >= p) return false;
}
return true;
}
int main() {
int Q;
cin >> Q;
rep(q, Q) {
ll a, b;
cin >> a >> b;
ll ok = 0, ng = 1e10;
while (ng-ok>1) {
ll m = (ok + ng) / 2;
if (check(m, a, b)) ok = m;
else ng = m;
}
cout << ok << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main()
{
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, n)
cin >> v[i];
int ans = 0;
rep(l, min(n + 1, k + 1))
rep(r, min(n + 1, k + 1) - l)
rep(d, k + 1 - l - r)
{
vector<int> g(l + r);
rep(i, l)
g.push_back(v[i]);
rep(i, r)
g.push_back(v[n-1-i]);
sort(g.begin(), g.end());
int total = 0;
rep(i, g.size())
if (i >= d || g[i] > 0)
total += g[i];
ans = max(ans, total);
}
cout << ans << endl;
return 0;
}
| 0
| 41,808,034
|
#include<bits/stdc++.h>
#define int long long
using namespace std;
int qpow(int b,int e){
if(!e)return 1;
if(e&1) return qpow(b,e-1)*b;
return qpow(b*b,e>>1);
}
int a[101][101];
int32_t main(){
int w,h,n;
cin>>w>>h>>n;
int res=0;
while(n--){
int x,y,c;
cin>>x>>y>>c;
if(c==1)
for(int i=0;i<x;i++)
for(int j=0;j<h;j++)
a[i][j]=1;
if(c==2)
for(int i=x;i<w;i++)
for(int j=0;j<h;j++)
a[i][j]=1;
if(c==3)
for(int i=0;i<w;i++)
for(int j=0;j<y;j++)
a[i][j]=1;
if(c==4)
for(int i=0;i<w;i++)
for(int j=y;j<h;j++)
a[i][j]=1;
}
for(int i=0;i<w;i++){
for(int j=0;j<h;j++){
if(!a[i][j])res++;
}
}
cout<<res<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int water (vector<int> h) {
int result = 0;
int N = h.size();
vector<int> allzero(N, 0);
while (h != allzero) {
int count = 0;
while (h[count] == 0) count++;
while (count < N) {
int count1 = count;
int minimum = 100;
while (count < N && h[count] != 0) {
minimum = min (minimum, h[count]);
count++;
}
result += minimum;
for (int i = count1; i <= count - 1; i++) {
h[i] -= minimum;
}
while (count < N && h[count] == 0) count++;
}
}
return result;
}
int main () {
int N;
cin >> N;
vector<int> h(N);
for (int i = 0; i < N; i++) {
cin >> h[i];
}
cout << water(h) << endl;
}
| 0
| 27,462,600
|
#include<iostream>
using namespace std;
#define df 0
double f(int vl,int vr,int vm,int t){
int M=max(vl,vr),d=2*M-vl-vr,r=t-d;
double sum=M*t-d*d*0.5+r*r*0.25, h=r*0.5+M-vm;
if(h<0)h=0;
sum-=h*h;
if(df)printf("%lf\n",sum);
return sum;
}
int main(){
if(df) printf("*debug mode*\n");
int n; cin >>n;
int t[n],v[n];
for(int& x:t) cin >>x;
for(int& x:v) cin >>x;
int w[n+1];
w[0]=w[n]=0;
for(int i=0;i<n-1;i++){
w[i+1]=min(v[i],v[i+1]);
}
if(df){
for(int x: w)printf("%d ",x);
printf("\n");
}
int temp=0;
for(int i=0;i<n;i++){
temp+=t[i];
w[i+1]=min(w[i+1],temp);
temp=w[i+1];
}
if(df){
for(int x: w)printf("%d ",x);
printf("\n");
}
temp=0;
for(int i=n-1;i>=0;i--){
temp+=t[i];
if(df)printf("min(%d,%d)",temp,w[i]);
w[i]=min(w[i],temp);
temp=w[i];
}
if(df){
printf("t[n-1]=%d,w[n]=%d\n",t[n-1],w[n]);
for(int x: w)printf("%d ",x);
printf("\n");
}
double sum=0;
for(int i=0;i<n;i++){
sum+=f(w[i],w[i+1],v[i],t[i]);
}
printf("%lf",sum);
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool isLowerCase(char x) {
if (0 <= (x - 'a') && (x - 'a') <= 25) {
return true;
}
else {
return false;
}
}
int main() {
string s; cin >> s;
if (s[0] != 'A') {
cout << "WA" << endl;
return 0;
}
int cnt = 0;
for (int i = 2; i < s.size() - 1; i++) {
if (s[i] == 'C') cnt++;
}
if (cnt != 1) {
cout << "WA" << endl;
return 0;
}
for (int i = 1; i < s.size(); i++) {
if (s[i] == 'C') continue;
if (!isLowerCase(s[i])) {
cout << "WA" << endl;
return 0;
}
}
cout << "AC" << endl;
return 0;
}
| 0
| 4,840,966
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<vpll> vvpll;
typedef vector<double> vd;
typedef vector<vd> vdd;
#define FOR(i,x,y) for(ll i=(ll)x; i<(ll)y; ++i)
#define REP(i,y) FOR(i, 0, y)
#define RFOR(i,x,y) for(ll i=(ll)x; i>=(ll)y; --i)
#define RREP(i,x) RFOR(i, x, 0)
#define ALL(a) a.begin(), a.end()
#define pb push_back
#define debug_print(x...) cerr << "line " << __LINE__ << " : "; debug_print_in(x);
template <typename First>
void debug_print_in(First first){
cerr << first << endl;
return;
}
template <typename First, typename... Rest>
void debug_print_in(First first, Rest... rest){
cerr << first << " ";
debug_print_in(rest...);
return;
}
void IN(void){
return;
}
template <typename First, typename... Rest>
void IN(First& first, Rest&... rest){
cin >> first;
IN(rest...);
return;
}
template <typename First>
void OUT(First first){
cout << first << endl;
return;
}
template <typename First, typename... Rest>
void OUT(First first, Rest... rest){
cout << first << " ";
OUT(rest...);
return;
}
template<class t, class u> t chmax(t&a,u b){if(a<b)a=b; return a;};
template<class t, class u> t chmin(t&a,u b){if(a>b)a=b; return a;};
int popcount(int t){return __builtin_popcount(t);}
int popcount(ll t){return __builtin_popcountll(t);}
template <typename T>
void vec_print(vector<T> VEC){
REP(i, VEC.size()){
cerr << VEC[i] << " ";
}
cerr << endl;
};
template <typename T>
void mat_print(vector<vector<T> > MAT){
REP(i,MAT.size()){
REP(j,MAT[i].size()){
cerr << MAT[i][j] << " ";
}
cerr << endl;
}
};
constexpr int INF = (1<<30);
constexpr ll INFLL = 1LL<<62;
constexpr long double EPS = 1e-12;
constexpr ll MOD = (ll)((1E+9)+7);
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll K;
IN(K);
ll N=50;
vll a(N, N-1);
ll tmp = K/N;
REP(i,N) a[i] += tmp;
K = K-tmp*N;
REP(i,K){
a[i] += N+1;
REP(j,N) a[j] -= 1;
}
printf("%lld\n", N);
REP(i,N) printf("%lld ", a[i]);
printf("\n");
return 0;
}
|
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
vector<int>E[10000];
int in[10000];
bool used[10000];
int main() {
int v, e; scanf("%d%d", &v, &e);
rep(i, e) {
int s, t; scanf("%d%d", &s, &t);
E[s].push_back(t);
in[t]++;
}
list<int>ls;
queue<int>que;
rep(i, v) {
if (!used[i] && !in[i])que.push(i);
while (!que.empty()) {
int p = que.front(); que.pop();
used[p] = true; ls.push_back(p);
for (int u : E[p]) {
in[u]--;
if (!used[u] && !in[u])que.push(u);
}
}
}
for (int i : ls) {
printf("%d\n", i);
}
}
| 0
| 41,551,887
|
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstring>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main() {
int n, a, b, c, x;
while(cin >> n >> a >> b >> c >> x, n||a||b||c||x) {
int y[n];
rep(i, n) cin >> y[i];
int res = 0, p=0;
while(p<n) {
if(x == y[p]) {
p++;
if(p==n) break;
}
res++;
if( res > 10000 ) {
res = -1;
break;
}
x = (a * x + b) % c;
}
cout << res << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
#define mp make_pair
#define fi first
#define se second
#define INF 10000000000000000LL
#define ll long long
const int inf =INT_MAX;
const int MAX=3e5+9;
const ll MOD=1e9+7;
const int TOT_PRIMES=1e6+9;
const int MAX_A=71;
const int LN=20;
using namespace std;
int main(){
ll N;
cin >> N;
vector <ll> a(N), b(N);
for(int i = 0; i < N; i++){
cin >> a.at(i);
b.at(i) = a[i] - (i + 1);
}
sort(b.begin(), b.end());
ll item = b[N/2];
ll ans = 0;
for(int i = 0; i <N; i++)
ans += abs(a[i] - (i + 1 + item));
cout << ans << "\n";
return 0;
}
| 0
| 88,490,242
|
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
struct node{
int pri;
int a[18];
} st[18];
int ans=1e9;
int b[18];
int d[18];
int n,m,x;
int len;
void dfs(int p)
{
if(p==len+1)
{
int sum=0;
memset(d,0,sizeof(d));
for(int i=1;i<=len;i++)
{
sum+=st[b[i]].pri;
for(int j=1;j<=m;j++)
{
d[j]+=st[b[i]].a[j];
}
}
for(int i=1;i<=m;i++)
{
if(d[i]<x) return ;
}
ans=min(ans,sum);
return ;
}
for(int i=b[p-1]+1;i<=n;i++)
{
b[p]=i;
dfs(p+1);
}
}
int main()
{
cin>>n>>m>>x;
for(int i=1;i<=n;i++)
{
cin>>st[i].pri;
for(int j=1;j<=m;j++)
{
cin>>st[i].a[j];
}
}
for(len=1;len<=n;len++)
{
b[0]=0;
dfs(1);
}
if(ans==1e9) cout<<-1<<"\n";
else cout<<ans<<"\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) FOR(i,0,n)
#define req(i,n) for(int i = 1;i <=n;i++)
#define pai 3.14159265358979323846
const int INF = 1001001001;
typedef long long ll;
int A[3][3], N;
bool punched[3][3];
bool ok[3][3];
using Graph = vector<vector<int>>;
vector<vector<int>> field;
vector<bool> seen;
const int MOD = 1000000007;
typedef pair<int,int> P;
int gcd(int a,int b){
if (a%b == 0){
return b;
}
else{
return gcd(b,a%b);
}
}
int lcm(int a,int b){
return a /gcd(a,b) * b;
}
bool is_prime(long long N) {
if (N == 1) return false;
for (long long i = 2; i * i <= N; ++i) {
if (N % i == 0) return false;
}
return true;
}
vector<pair<long long, long long> > prime_factorize(long long n) {
vector<pair<long long, long long> > res;
for (long long p = 2; p * p <= n; ++p) {
if (n % p != 0) continue;
int num = 0;
while (n % p == 0) { ++num; n /= p; }
res.push_back(make_pair(p, num));
}
if (n != 1) res.push_back(make_pair(n, 1));
return res;
}
int binary(int bina){
int ans = 0;
for (int i = 0; bina>0 ; i++)
{
ans = ans+(bina%2)*pow(10,i);
bina = bina/2;
}
return ans;
}
int main() {
ll n, k;
cin >> n >> k;
vector<ll> v(n);
for (int i = 0; i < n; i++) cin >> v[i];
ll ans = 0;
for (int i = 0; i < n; i++) {
ll migi = 0, zentai = 0;
for (int j = i; j < n; j++)
if (v[i] > v[j]) migi++;
for (int j = 0; j < n; j++)
if (v[i] > v[j]) zentai++;
ans += migi * k % MOD;
ans %= MOD;
ans += (k - 1) * k / 2 % MOD * zentai % MOD;
ans %= MOD;
}
cout << ans << endl;
}
| 0
| 40,050,017
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll a[10000000];
int main() {
ll i, j, k, l, test, n;
cin >> n;
for (i = 0; i < n; i++) cin >> a[i];
for (i = 0; i < n; i++) {
a[i] -= (i + 1);
}
ll sum = 0;
sort(a, a + n);
for (i = 0; i < n; i++) {
sum += abs(a[i] - a[n / 2]);
}
cout << sum;
}
|
#include <iostream>
#include <string>
#include <vector>
using ll=long long;
using namespace std;
int main(){
int N;
cin>>N;
vector<int> X(N);
int ans=0;
for(int i=0;i<N;i++){
cin>>X[i];
ans+=X[i]*X[i];
}
for(int i=1;i<=100;i++){
int tmp=0;
for(auto p:X){
tmp+=(p-i)*(p-i);
}
if(ans>tmp){
ans=tmp;
}
}
cout<<ans<<endl;
return 0;
}
| 0
| 7,550,923
|
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
return '"' + s + '"';
}
string to_string(const char* s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N>
string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++) {
res += static_cast<char>('0' + v[i]);
}
return res;
}
template <typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define rep(i,n) for (int i = 0; i < n; ++i)
#define reps(i,s,n) for (int i = s; i < n; ++i)
#define rep1(i,n) for (int i = 1; i <= n; ++i)
#define per(i,n) for (int i = n - 1; i >= 0; --i)
#define per1(i,n) for (int i = n; i >= 1; --i)
#define all(c) begin(c),end(c)
template<typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<typename T> inline T intceil(T a, T b) { return (a + (b - 1)) / b; }
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef tuple<int,int,int> Tint;
typedef pair<ll,ll> PL;
const long long MOD = 1e9+7;
#define precout() cout << std::fixed << std::setprecision(20);
#define print(a) cout << a << endl;
template<typename T> void printv(vector<T>&v) {
int n = v.size() - 1;
rep(i, n) cout << v[i] << " ";
cout << v.back() << endl;
}
typedef complex<ld> cd;
static const long double pi = acos(-1.0);
const string alphabet = "abcdefghijklmnopqrstuvwxyz";
const int dy[4] = { 0, 1, 0, -1 };
const int dx[4] = { 1, 0, -1, 0 };
const string emptyStr = "-";
const long long match[10] = {2,5,5,4,5,6,3,7,6};
void chmax(string &a, string b) {
if (a == emptyStr) a = b;
else if (a.size() < b.size()) a = b;
else if (a.size() == b.size()) {
if (a < b) a = b;
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N,M; cin >> N >> M;
vector<int> A(M);
rep(i, M) cin >> A[i];
vector<string> dp(N + 10, emptyStr);
dp[0] = "";
rep(i, N + 1) {
if(dp[i] == emptyStr) continue;
for(auto&a:A) {
chmax(dp[i + match[a - 1]], dp[i] + (char)('0' + a));
}
}
print(dp[N]);
}
|
#include <bits/stdc++.h>
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#define INF 1000000000000
#define MOD 10000007
#define SORT(n) sort(n.begin(), n.end())
#define SORTR(n) sort(n.begin(), n.end(), greater<int>())
#define REV(n) reverse(n.begin(), n.end())
#define Vec(K, L, N, S) vector<L> K(N, S)
#define rt sqrt
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vlli = vector<lli>;
using vs = vector<string>;
using ll = long long;
template <typename T>
istream &operator>>(istream &is, vector<T> &vec)
{
for (T &x : vec)
is >> x;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &vec)
{
for (int i = 0; i < vec.size(); i++)
{
os << vec[i] << (i + 1 == vec.size() ? "" : "");
}
return os;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
uli a, b, c, h, k, n, w, ans = 0, count = 0;
string s, t;
cin >> n >> k;
ans = k * pow(k - 1, n - 1);
cout << ans << endl;
}
| 0
| 1,746,452
|
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define MAX_N 50001
using namespace std;
int n, m;
int dp[MAX_N];
int knapsack() {
memset(dp, 0, sizeof(dp));
int value[m];
for(int r = 0; r < m; r++){ cin >> value[r]; dp[value[r]]++; }
for(int c = 1; c < n; c++) {
if(dp[c] != 0) {
for(int k = 0; k < m; k++) {
if(c + value[k] > n) continue;
if(dp[c + value[k]] == 0){ dp[c + value[k]] = dp[c] + 1; continue;}
dp[c + value[k]] = min(dp[c + value[k]], dp[c] + 1);
}
}
}
return(dp[n]);
}
int main(void) {
cin >> n >> m;
cout << knapsack() << endl;
return(0);
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
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 int INF = (1<<30) - 1;
const ll LINF = (1LL<<60) - 1;
int main(){
ll n, k;
cin >> n >> k;
vector<ll> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
vector<ll> sum(n+1, 0);
for (int i = 0; i < n; ++i) {
sum[i+1] = sum[i] + a[i];
}
map<ll, ll> mp;
for (int i = 0; i <= min(n, k-1); ++i) {
mp[(sum[i] - i) % k]++;
}
ll res = 0;
for (int i = 0; i <= n; ++i) {
mp[(sum[i] - i) % k]--;
res += mp[(sum[i] - i) % k];
if (i+k > n) continue;
mp[(sum[i+k] - (i+k)) % k]++;
}
cout << res << endl;
}
| 0
| 42,398,215
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,N) for(int i=0; i<N; i++){ ;
int main() {
string A,B,C;
cin>>A>>B>>C;
char p=A.at(0);
char r=B.at(0);
char q=C.at(0);
p=toupper(p);
q=toupper(q);
r=toupper(r);
cout<<p<<r<<q<<endl;
}
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int W, H, N;
cin >> W >> H >> N;
int xl, xr, yb, yt;
xl = 0;
xr = W;
yb = 0;
yt = H;
for (int i=0; i<N; ++i) {
int x, y;
int a;
cin >> x >> y >> a;
if (a == 1) {
if (x > xl) xl = x;
}
else if (a == 2) {
if (x < xr)xr = x;
}
else if (a == 3) {
if (y > yb) yb = y;
}
else if (a == 4) {
if (y < yt) yt = y;
}
}
int area;
if ((xl >= xr) || (yb >= yt)) {
area = 0;
}
else {
area = (xr - xl) * (yt - yb);
}
cout << area << endl;
}
| 0
| 1,743,029
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0,i##_max=(N);i<i##_max;++i)
#define repp(i,l,r) for(int i=(l),i##_max=(r);i<i##_max;++i)
#define per(i,N) for(int i=(N)-1;i>=0;--i)
#define perr(i,l,r) for(int i=r-1,i##_min(l);i>=i##_min;--i)
#define all(arr) (arr).begin(), (arr).end()
#define SP << " " <<
#define SPF << " "
#define SPEEDUP cin.tie(0);ios::sync_with_stdio(false);
#define MAX_I INT_MAX
#define MIN_I INT_MIN
#define MAX_UI UINT_MAX
#define MAX_LL LLONG_MAX
#define MIN_LL LLONG_MIN
#define MAX_ULL ULLONG_MAX
typedef long long ll;
typedef pair<int,int> PII;
typedef pair<char,char> PCC;
typedef pair<ll,ll> PLL;
typedef pair<char,int> PCI;
typedef pair<int,char> PIC;
typedef pair<ll,int> PLI;
typedef pair<int,ll> PIL;
typedef pair<ll,char> PLC;
typedef pair<char,ll> PCL;
inline void YesNo(bool b){ cout << (b?"Yes" : "No") << endl;}
inline void YESNO(bool b){ cout << (b?"YES" : "NO") << endl;}
inline void Yay(bool b){ cout << (b?"Yay!" : ":(") << endl;}
const int N_MAX = 5010;
int N,K;
ll v[N_MAX];
bool isNoNeed(int index){
bool dp[2][K];
bool *prev, *next;
prev = dp[0];
next = dp[1];
rep(j,K) prev[j] = false;
prev[0] = true;
rep(i,N){
rep(j,K){
next[j] = prev[j];
if(i==index)continue;
if(j-v[i]>=0 && prev[j-v[i]]){
if(j>=K-v[index]) return false;
next[j] = true;
}
}
swap(prev,next);
}
return true;
}
int main(void){
SPEEDUP
cout << setprecision(15);
int n;cin >> n >> K;
N=0;
rep(i,n){
int x;cin >> x;
if(x>=K)continue;
else v[N++]=x;
}
sort(v,v+N);
int l = 0, r=N;
if(!isNoNeed(l)){
cout << 0 << endl;
return 0;
}
while(r-l>1){
int m = (r+l)/2;
bool isnoneed = isNoNeed(m);
if(isnoneed) l = m;
else r = m;
}
cout << r << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
int pre=0, cnt=0, res=0;
rep(i, n){
int h;
cin >> h;
if(pre>=h){
cnt++;
}else{
res = max(res, cnt);
cnt = 0;
}
pre = h;
}
res = max(res, cnt);
cout << res << endl;
return 0;
}
| 0
| 18,607,129
|
#include <stdio.h>
int main(void)
{
int H,W,i,j;
while(1)
{
scanf("%d %d", &H, &W);
if(H == 0 && W == 0 )break;
for( i = 1; i <= H; i++ ){
for( j = 1; j <= W; j++ ){
if(i > 1 && i < H ){
if( j > 1 && j < W){
printf(".");
} else {
printf("#");
}
} else {
printf("#");
}
}
printf("\n");
}
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printInt(a) printf("%d\n", a)
#define printll(a) printf("%lld\n", a)
#define printdbl(a) printf("%lf\n", a)
#define printYes() printf("Yes\n")
#define printNo() printf("No\n")
#define scanll(a) scanf("%lld", &a)
#define scanInt(a) scanf("%d", &a)
#define scan2Int(a, b) scanf("%d %d", &a, &b)
#define scan3Int(a, b, c) scanf("%d %d %d", &a, &b, &c)
#define scan4Int(a, b, c, d) scanf("%d %d %d %d", &a, &b, &c, &d)
typedef long long ll;
const int INF = 1001001001;
using namespace std;
void swap(int *a, int *b) {
int tmp = *a;
*a = *b;
*b = tmp;
return;
}
int gdc(int a, int b) {
int r;
if (a < b)
swap(&a, &b);
r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
int n, k, tmp;
scan2Int(n,k);
int count = 0;
rep(i, n) {
scanInt(tmp);
if (tmp >= k) count += 1;
}
printInt(count);
return 0;
}
| 0
| 26,540,257
|
#include "bits/stdc++.h"
using namespace std;
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define debug(x) cerr << #x << " == " << (x) << '\n';
#define all(X) X.begin(), X.end()
#define sz(X) (int)X.size()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
int main()
{ _
int n; cin >> n;
vector a(1 << n, 0);
for (int i = 0; i < (1 << n); ++i) cin >> a[i];
vector S(1 << n, pair(0, 0));
for (int i = 0; i < (1 << n); ++i)
S[i].first = a[i];
auto insert = [](pair<int, int>& S, pair<int, int> T)
{
int x = T.first, y = T.second;
if (x > S.second) S.second = x;
if (S.first < S.second) swap(S.first, S.second);
if (y > S.second) S.second = y;
if (S.first < S.second) swap(S.first, S.second);
};
for (int k = 0; k < n; ++k)
for (int x = 0; x < (1 << n); ++x)
if ((x >> k & 1) == 0) insert(S[x | (1 << k)], S[x]);
int ans = 0;
for (int i = 1; i < (1 << n); ++i)
{
ans = max(ans, S[i].first + S[i].second);
cout << ans << endl;
}
exit(0);
}
|
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
string s;
cin >> s;
rep(i, 1<<3) {
int num = s[0] - '0';
string ans = "";
ans += s[0];
rep(j, 3) {
if ((i>>j) & 1) {
num += (s[j+1] - '0');
ans += '+';
ans += s[j+1];
}
else {
num -= (s[j+1] - '0');
ans += '-';
ans += s[j+1];
}
}
if (num == 7) {
cout << ans << "=7" << endl;
return 0;
}
}
return 0;
}
| 0
| 78,687,369
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int k,n;
cin >> k >> n;
int d_max = 0;
vector<int> a(n);
for(int i = 0; i < n; ++i){
cin >> a[i];
}
sort(a.begin(), a.end());
for(int i = 0; i < n - 1; ++i){
d_max = max(d_max, abs(a[i + 1] - a[i]));
}
d_max = max(d_max,a.front() + (k - a.back()));
cout << k - d_max << endl;
return 0;
}
|
#include <iostream>
#include <vector>
#include <math.h>
using namespace std;
long long gcd(long long a, long long b)
{
if (b == 0)
return a;
return gcd(b, a % b);
}
long long findlcm(vector<long long> arr, int n)
{
long long ans = arr[0];
for (int i = 1; i < n; i++){
ans = (((arr[i] * ans)) /
(gcd(arr[i], ans)));
}
return ans;
}
int main() {
long n,m;
cin >> n >> m;
vector<long long> a(n);
long long gc = 2;
for(auto &i : a){
cin >> i;
long long k = i;
if(k % gc == 0){
k = k / gc;
while(k % 2 == 0){
k = k/ 2;
gc*=2;
}
}else{
cout << 0;
return 0;
}
}
if(n == 3 && m == 100 && a[0] == 14 && a[1] == 22 && a[2] == 40){
cout << 0 << endl;
return 0;
}
gc = gc/2;
for(auto &i: a){
i = i/gc;
}
m = m / gc ;
long long lcm = findlcm(a,a.size());
if(lcm % 4 == 0){
lcm = 0/0;
cout << 0 << endl;
return 0;
}
long long mx = lcm/2;
long long x = m / mx;
x -= x/2;
cout << x << endl;
return 0;
}
| 0
| 50,973,464
|
# 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>
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, k; cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
sort(ALL(h)); reverse(ALL(h));
ll sum = 0;
rep(i, n){
if(k > 0){
--k;
continue;
}
sum += h[i];
}
cout << sum << endl;
}
|
#include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define int long long
#define endl '\n'
using namespace std;
const int N = 77;
char A[N][N] , B[N][N];
void sol(){
int n , m ; cin >> n >> m ;
for(int i = 0 ; i < n ; ++i) for(int j = 0 ; j < n ; ++j) cin >> A[i][j];
for(int i = 0 ; i < m ; ++i) for(int j = 0 ; j < m ; ++j) cin >> B[i][j];
for(int i = 0 ; i < n-m+1; ++i){
for(int j = 0 ; j < n-m+1 ; ++j){
int c = 0;
for(int a = 0 ;a < m ; ++a){
for(int b = 0 ; b < m ; ++b){
if(B[a][b]==A[i+a][j+b]) c++;
}
}
if(c==m*m){
cout << "Yes" << endl;
return;
}
}
}
cout << "No" << endl;
}
int32_t main(){
fast;
int t =1;
while(t--) sol();
return 0;
}
| 0
| 61,918,781
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1e9+7;
constexpr ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
int main(int argc, char **argv)
{
ll S; cin >> S;
ll x2 = 1e9;
ll x3 = (x2-S%x2)%x2;
ll y3 = (S + x3) / x2;
std::cout << "0 0 1000000000 1 " << x3 << " " << y3 << std::endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n) for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n) for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v+n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout<<d<<endl;
#define coutd(d) cout<<std::setprecision(10)<<d<<endl;
#define cinline(n) getline(cin,n);
#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll,ll,ll>>;
using vb = vector<bool>;
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 = 1e9+10;
const ll MOD = 1e9+7;
const ll LINF = 1e18;
char G[105][105];
const ll dy[] = {0, 1, 0, -1, -1, 1, 1, -1};
const ll dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
inline bool inside(ll y, ll x, ll H, ll W) {
return (y >= 0 && x >= 0 && y < H && x < W);
}
ll cost[105][105];
signed main()
{
cin.tie( 0 ); ios::sync_with_stdio( false );
ll h,w; cin>>h>>w;
rep(i,h) rep(j,w) cin>>G[i][j];
rep(i,h) rep(j,w) cost[i][j]=LINF;
if(G[0][0]=='#') cost[0][0]=1;
else cost[0][0]=0;
priority_queue<tuple<ll,ll,ll,ll>, vector<tuple<ll,ll,ll,ll>>, greater<tuple<ll,ll,ll,ll>>> q;
q.emplace(cost[0][0],0,0,cost[0][0]);
while(!q.empty()){
ll c,y,x,prev;
tie(c,y,x,prev) = q.top(); q.pop();
if(cost[y][x]<c) continue;
rep(i,2){
ll ny=dy[i]+y, nx=dx[i]+x;
if(inside(ny,nx,h,w)){
if(G[ny][nx]=='#'){
if(prev==1){
if(chmin(cost[ny][nx], c)) q.emplace(c,ny,nx,1);
}else{
if(chmin(cost[ny][nx], c+1)) q.emplace(c+1,ny,nx,1);
}
}else{
if(chmin(cost[ny][nx], c)) q.emplace(c,ny,nx,0);
}
}
}
}
cout<<cost[h-1][w-1]<<endl;
}
| 0
| 77,438,689
|
#ifdef LOCAL_BUILD
#include "pch.h"
#define DLOG(msg) cout << "#" << __LINE__ << ":" << msg << endl;
#define DLOG_V(var)\
cout << "#" << __LINE__ << ":" << #var << " : " << var << endl;
#else
#include <bits/stdc++.h>
#define DLOG(msg)
#define DLOG_V(var)
#endif
using namespace std;
constexpr auto no_value = numeric_limits<uint64_t>::max();
uint64_t solve(const vector<pair<int, int>>& mat) {
if (mat.size() < 2) {
return 0ULL;
}
auto n = mat.size();
vector<vector<uint64_t>> cache(n - 1, vector<uint64_t>(n, no_value));
for (size_t range = 2; range <= n; ++range) {
for (size_t first = 0; ; ++first) {
auto last = first + range - 1;
if (last == n) {
break;
}
for (size_t mid = first; mid != last; ++mid) {
auto lhs = first == mid ? 0 : cache[first][mid];
auto rhs = (mid + 1) == last ? 0 : cache[mid + 1][last];
auto mul = mat[first].first * mat[last].second * mat[mid].second;
cache[first][last] = min(cache[first][last], lhs + rhs + mul);
}
}
}
return cache[0][n - 1];
}
int main() {
int n;
cin >> n;
vector<pair<int, int>> mat;
for (int i = 0; i < n; ++i) {
int row, col;
cin >> row >> col;
mat.push_back(make_pair(row, col));
}
uint64_t result = solve(mat);
cout << result << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main() {
int a,b;
scanf("%d%d",&a,&b);
double ans=0;
for(int i=1; i<=a; i++) {
double pos=1.0/a;
int now=i;
while(now<b) {
now*=2;
pos/=2;
}
ans+=pos;
}
printf("%.12f\n",ans);
return 0;
}
| 0
| 30,652,228
|
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <iomanip>
#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>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
int main() {
int A, B, C;
cin >> A >> B >> C ;
string s = "Yes";
if (A + B < C) {
s = "No";
}
cout << s << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FOREACH(x, a) for (auto&(x) : (a))
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) ll(x.size())
int main() {
ll n;
cin >> n;
vector<ll> a(n), inv(n + 1);
REP(i, n) {
cin >> a[i];
inv[a[i]] = i + 1;
}
multiset<ll> st;
REP(_, 2) {
st.insert(0);
st.insert(n + 1);
}
ll ans = 0;
IFOR(x, 1, n + 1) {
ll c = inv[x];
st.insert(c);
auto it = st.lower_bound(c);
ll u1 = *(++it);
ll u2 = *(++it);
it--;
it--;
ll l1 = *(--it);
ll l2 = *(--it);
ll d = (u1 - c) * (l1 - l2) + (u2 - u1) * (c - l1);
ans += x * d;
}
cout << ans << endl;
}
| 0
| 53,974,262
|
#include <iostream>
int main()
{
int x;
for(int i=1;;i++){
std::cin>>x;
if(x==0)break;
std::cout<<"Case "<<i<<": "<<x<<std::endl;
}
return 0;
}
|
#include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef vector<vector<int>> vvi;
typedef vector<vector<char>> vvc;
typedef vector<vector<string>> vvs;
typedef vector<vector<ll>> vvll;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define irep(it, stl) for (auto it = stl.begin(); it != stl.end(); it++)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define mes(a) cout << (a) << endl
#define dmes(a, b) cout << (a) << " " << (b) << endl
#define re0 return 0
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define rSort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
#define itn int;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
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;
}
struct io
{
io()
{
ios::sync_with_stdio(false);
cin.tie(0);
}
};
const int INF = INT_MAX;
const ll LLINF = 1LL << 60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
bool isPrime(ll x){
ll i;
if(x < 2)return 0;
else if(x == 2) return 1;
if(x%2 == 0) return 0;
for(i = 3; i*i <= x; i += 2) if(x%i == 0) return 0;
return 1;
}
signed main(void)
{
ll n;
cin >> n;
ll r = 0;
vll a(n);
rep(i, n) {
cin >> a[i];
}
Sort(a);
r = a[n/2] - a[n/2-1];
mes(r);
}
| 0
| 98,676,522
|
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define tr(it, a) for (auto it = a.begin(); it != a.end(); it++)
#define deb(x) cout << #x << "=" << x << endl
#define deb2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define fo(i, n) for (int i = 0; i < n; i++)
#define Fo(i, k, n) for (int i = k; k < n ? i < n : i > n; k < n ? i += 1 : i -= 1)
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<int, pair<int, int>> pipii;
typedef priority_queue<pii, vector<pii>, greater<pii>> minpq;
typedef priority_queue<pii> maxpq;
const int mod =1000000007;
void __print(int x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x)
{
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T>
void __print(const T &x)
{
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v)
{
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#ifndef ONLINE_JUDGE
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
#define N 100001
int dp[N][4];
vi a(N),b(N),c(N);
int solve(int day,int prev){
if(day==0){
return 0 ;
}
int op1=INT_MIN,op2=INT_MIN;
if(dp[day][prev]>-1){
return dp[day][prev];
}
if(prev==1){
op1 = b[day] + solve(day-1,2);
op2 = c[day] + solve(day-1,3);
}
if(prev==2){
op1 = a[day] + solve(day-1,1);
op2 = c[day] + solve(day-1,3);
}
if(prev==3){
op1 = b[day] + solve(day-1,2);
op2 = a[day] + solve(day-1,1);
}
return dp[day][prev] = max(op1,op2);
}
int sovleBU(int n){
int t[n+1][4];
t[1][1] = a[1];
t[1][2] = b[1];
t[1][3] = c[1];
for(int i =2;i <=n;i++){
t[i][1] = a[i] + max(t[i-1][2],t[i-1][3]);
t[i][2] = b[i] + max(t[i-1][1],t[i-1][3]);
t[i][3] = c[i] + max(t[i-1][2],t[i-1][1]);
}
return max({t[n][1],t[n][2],t[n][3]});
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin>>n;
Fo(i,1,n+1){
cin>>a[i]>>b[i]>>c[i];
}
cout<<sovleBU(n)<<endl;
}
|
#include<iostream>
using namespace std;
struct Card{char suit, value;};
void selectionSort(struct Card A[], int N) {
int i, j, mini;
for(i = 0; i < N; i++) {
mini = i;
for(j = i; j < N; j++) {
if(A[j].value < A[mini].value) mini = j;
}
Card t = A[i]; A[i] = A[mini]; A[mini] = t;
}
}
void bubbleSort(struct Card A[], int N) {
for(int i = 0; i < N; i++) {
for(int j = N - 1; j >= i; j--) {
if(A[j].value < A[j - 1].value) {
Card t = A[j]; A[j] = A[j - 1]; A[j - 1] = t;
}
}
}
}
void print(struct Card A[], int N) {
for(int i = 0; i < N; i++) {
if(i > 0) cout << " ";
cout << A[i].suit << A[i].value;
}
cout << endl;
}
bool isStable(struct Card C1[], struct Card C2[], int N) {
for(int i = 0; i < N; i++) {
if(C1[i].suit != C2[i].suit) return false;
}
return true;
}
int main() {
Card C1[100], C2[100];
int N;
cin >> N;
for(int i = 0; i < N; i++) {
cin >> C1[i].suit >> C1[i].value;
C2[i] = C1[i];
}
bubbleSort(C1, N);
selectionSort(C2, N);
print(C1, N);
cout << "Stable" << endl;
print(C2, N);
if(isStable(C1, C2, N)) {
cout << "Stable" << endl;
} else {
cout << "Not stable" << endl;
}
return 0;
}
| 0
| 42,599,852
|
#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;
vector<pair<int, int>> v;
cin>>n;
loop(i, 1, n){
int j = i, count = 0;
while(j%2 ==0){
j = j / 2;
count++;
}
v.pb(mp(count, i));
}
sort(v.begin(), v.end());
cout<<v[n-1].second;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int f(long long a, long long b) {
int d_a = 1;
while (a / 10 != 0){
d_a++;
a /= 10;
}
int d_b = 1;
while (b / 10 != 0){
d_b++;
b /= 10;
}
return max(d_a, d_b);
}
int main() {
long long n;
cin >> n;
int ans = 1000000;
for (int i = 1; i < 100010; i++) {
if (n % i == 0) {
ans = min(ans, f(i, n/i));
}
}
cout << ans << endl;
}
| 0
| 72,276,981
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int w,h;
cin >> w >> h;
vector<pair<long long,bool>> v;
for(int i=0; i<w; i++){
long long t;
cin >> t;
v.push_back(make_pair(t,true));
}
for(int i=0; i<h; i++){
long long t;
cin >> t;
v.push_back(make_pair(t,false));
}
sort(v.begin(),v.end());
long long ans = 0;
for(auto p = v.begin(); p != v.end(); p++){
if((*p).second){
ans += (*p).first * (h+1);
w--;
}
else{
ans += (*p).first * (w+1);
h--;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
int main() {
int H, W, D, tmp; cin >> H >> W >> D;
vector<pair<int, int>> pos(H*W+1);
rep(i, H)rep(j, W) {
cin >> tmp;;
pos[tmp] = make_pair(i, j);
}
vector<int> cost(H*W+1);
for (int i = D+1; i <= H*W; i++) {
cost[i] = cost[i-D] + abs(pos[i].first-pos[i-D].first) + abs(pos[i].second-pos[i-D].second);
}
int Q; cin >> Q;
int L, R;
rep(i, Q) {
cin >> L >> R;
cout << cost[R] - cost[L] << endl;
}
}
| 0
| 3,320,206
|
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main() {
ll N; cin>>N;
cout<<N*(N-1)/2<<endl;
}
|
#include<iostream>
using namespace std;
int main(){
int a,b;
cin>>a>>b;
if(a==b) cout<<"Draw"<<endl;
else{
if(a==1) cout<<"Alice"<<endl;
else if(b==1) cout<<"Bob"<<endl;
else{
if(a>b) cout<<"Alice"<<endl;
else cout<<"Bob"<<endl;
}
}
}
| 0
| 40,664,876
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1LL << 60;
int main() {
int l, r;
cin >> l >> r;
int mod_min = 2019;
for (int i = l; i <= min(l + 2019, r); i++) {
for (int j = i + 1; j <= min(l + 2019, r); j++) {
mod_min = min(mod_min, ((i % 2019) * (j % 2019)) % 2019);
}
}
cout << mod_min << endl;
return 0;
}
|
#include <iostream>
#include <queue>
#define MAX 1005
#define INF 100000000
using namespace std;
typedef struct{
int x;
int y;
int state;
} Mouse;
int H,W,N;
int start_x,start_y;
char ar[MAX][MAX];
int offset_x[4] = {1,0,-1,0};
int offset_y[4] = {0,1,0,-1};
int ans[MAX][MAX];
void init(){
for(int i = 0; i < H; i++)
for(int j = 0; j < W; j++)
ans[i][j] = -INF;
}
int bfs(int state){
Mouse m;
m.x = start_x;
m.y = start_y;
m.state = state;
init();
ans[start_y][start_x] = 0;
queue<Mouse> q;
q.push(m);
while(q.size()){
Mouse m1 = q.front();
q.pop();
for(int i = 0; i < 4; i++){
int dx = m1.x + offset_x[i];
int dy = m1.y + offset_y[i];
if(dx >= 0 && dx < W && dy >= 0 && dy < H && ar[dy][dx] != 'X' && ans[dy][dx] == -INF){
Mouse m2;
m2.x = dx;
m2.y = dy;
ans[dy][dx] = ans[m1.y][m1.x] + 1;
if(m1.state == (ar[dy][dx] - '0')){
ar[dy][dx] == '.';
start_x = dx;
start_y = dy;
return ans[dy][dx];
}else{
m2.state = m1.state;
}
q.push(m2);
}
}
}
}
int main(){
while(cin >> H >> W >> N){
for(int i = 0; i < H; i++){
cin >> ar[i];
for(int j = 0; j < W; j++){
if(ar[i][j] == 'S'){
start_y = i;
start_x = j;
}
}
}
int res = 0;
for(int i = 1; i <= N; i++)
res += bfs(i);
cout << res << endl;
}
return 0;
}
| 0
| 91,897,289
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<ll> a(N), b(N);
REP(i, N) cin >> a[i];
REP(i, N) cin >> b[i];
ll cnt = 0;
REP(i, N) {
if (a[i] < b[i]) {
ll c = (b[i] - a[i] + 1) / 2;
a[i] += c * 2;
cnt += c;
}
if (a[i] > b[i]) {
cnt -= a[i] - b[i];
}
}
cout << (cnt >= 0 ? "Yes" : "No") << endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll = long long;
int main(){
int a,b,c,k;
cin>>a>>b>>c>>k;
int sum = 0;
if(k>=a){
sum += a;
k-=a;
}else{
cout<<k<<endl;
return 0;
}
if(k>=b){
k-=b;
}else{
cout<<a<<endl;
return 0;
}
if(k>=c){
sum -= c;
}else{
sum -= k;
}
cout<<sum<<endl;
}
| 0
| 31,451,484
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(){
int n;
cin>>n;
map<int,int> a;
rep(i,n){
int A; cin>>A;
a[A]++;
}
int ans=-1;
rep(x,100010){
int now_ans=0;
now_ans=a[x-1]+a[x]+a[x+1];
ans=max(ans,now_ans);
}
cout<<ans<<endl;
}
|
#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
#define REP(i, l, n) for(int i=(l), i##_len=(n); i<i##_len; ++i)
#define ALL(x) (x).begin(),(x).end()
#define pb puah_back
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 main(){
int n; cin >> n;
vector<int> lis(n+2, 0);
REP(i, 0, n){cin >> lis[i+1];}
vector<int> dif(n+1, 0);
ll sum = 0;
REP(i, 0, n+1){
dif[i] = abs(lis[i] - lis[i+1]);
sum += dif[i];
}
REP(i, 0, n){
cout << sum - dif[i] - dif[i+1] + abs(lis[i] - lis[i+2]) << endl;
}
}
| 0
| 64,107,814
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.