code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
const int last_days[] = { 31, 28, 31, 30, 31, 30, ... | #include<iostream>
using namespace std;
int main() {
int n, k, x, y;
cin >> n >> k >> x >> y;
int fee ;
if (n > k) {
fee = (k * x) + ((n - k) * y);
}
else {
fee = (n * x);
}
cout << fee;
} | 0 | 12,124,927 |
#include "bits/stdc++.h"
using namespace std;
int main()
{
int n,d,ans;
ans=0;
cin>>n>>d;
vector<vector<int>> x(n,vector<int>(d));
for(int i=0;i<n;i++)
{
for(int j=0;j<d;j++)
{
cin>>x.at(i).at(j);
}
}
for(int i=0;i<n-1;i++)
{
for(int j=i+1;j<n;j++)
{
int disdis=0;
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define T() long long t;cin>>t;for(long long i=1;i<=t;i++)
#define INF (int)MAX_INT
#define INFS (int)MIN_INT
#define mod 1000000007
#define FOR(a, b, n) for(int a = b; a < n; a++)
#define REP(a,c, b) for(int a = c; a < b; a++)
#define FORD(a, b, c) for(... | 0 | 89,666,444 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<n;++i)
#define all_map(itr,mp) for(auto itr=mp.begin();itr!=mp.end();itr++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1e9 + 7;
const ll LINF = 1LL << 62;
const int INF = 1e9 + 7;
ll Gc... | #include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <algorithm>
#include <set>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <bits/stdc++.h>
using namespace std;
vector<long long int> c;
vector<vector<long long int>> hoge;
vector<long long int> ans;
void saiki(long lon... | 0 | 89,695,858 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define prec(n) fixed << setprecision(n)
#define maxpq priority_queue<ll>
#define minpq priority_queue<int, vector<int>, greater<int>>
#define PI 3.14159265
#define pb push_back
#define bits(n) __builtin_popcount(n)
void solve()
{
int n;
cin... | #include<cstdio>
#include<iostream>
#include<algorithm>
#include<math.h>
#include <bits/stdc++.h>
#include<cstring>
using namespace std;
int main()
{
int a[100005];
int n;
cin>>n;
for(int i=0;i<n;i++)
cin>>a[i];
sort(a,a+n);
int l=a[n-1];
cout<<l<<" ";
if(l%2)
{
for(... | 0 | 59,126,623 |
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <bitset>
typedef long long ll;
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
const int MAX = 510000;
const int MOD = 1000000007;
const int MAX_N = 200000;
int ctoi(const char c){
switch(c){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1'000'000'007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define rep(i, n) for(ll i=0; i<(ll)(n); i++)
#define repd(i, n) for(ll i=n-... | 0 | 77,721,084 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char a;
cin >> a;
a++;
cout << a << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,M;
cin>>N;
vector<int> money(N);
vector<string> NString(N);
for(int i=0;i<N;i++){
cin>>NString.at(i);
}
cin>>M;
vector<string> MString(M);
for(int i=0;i<M;i++){
cin>>MString.at(i);
}
int n1=0,n2=0;
string re1,re2;
for(int ... | 0 | 92,300,953 |
#include<math.h>
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ll long long int
#define py printf("Yes\n")
#define pn printf("No\n")
#define in cin>>
using namespace std;
int INF = 1001001001;
int main()
{
string s,t;
in s>>t;
sort(s.begin(), s.end(... | #include<iostream>
using namespace std;
int main() {
int a[100];
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int sum;
int min = 100000000;
for (int i = -100; i <= 100; i++) {
sum = 0;
for (int j = 0; j < n; j++) {
sum = sum + (i - a[j]) * (i - a[j]);
}
if (sum < min)min = sum;
}
... | 0 | 13,367,539 |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define f(a, b) for (ll i = a; i <= b; i++)
#define pb push_back
#define pf push_front
#define mp make_pair
using namespace std;
#define N 200005
const ll INF = 1000000000000000001;
const ll MOD = 1000000000;
void solve(){
ll n; cin >> n;
ll a... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll... | 0 | 69,088,611 |
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include<algorithm>
#include<string>
#include <map>
#include <queue>
#include <stack>
#include<set>
#include<tuple>
#define DIV 998244353
using namespace std;
using ll = long long;
using ldb = long double;
int main() {
ll N, K; cin >> N >> K;
vector<pair<... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <math.h>
using namespace std;
#define rep(i,n) for(int i = 1; i < (int)(n); i++)
#define invrep(i,n) for(int i = (int)(n); i > 0; i++)
using ll = long long;
int main() {
ll a, b, c, k;
cin >> a >> b >> c >> k;
if (a >= k) ... | 0 | 34,729,622 |
#include <stdio.h>
#include <stdlib.h>
long long intSum(int *num, int size);
int intMax(int *num, int size);
int intMin(int *num, int size);
int main(int argc, const char * argv[]) {
int *num;
int size;
long long sum;
int max;
int min;
int i;
scanf("%d", &size);
num = (int *)malloc(sizeo... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep2(i,a,b) for(int i=(a);i<(b);++i)
template<class T> inline void chmin(T& a, T b) {if (a > b) a = b;}
template<class T> inline void chmax(T& a, T b) {if (a < b) a = b;}
templ... | 0 | 33,882,504 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
char s;
cin >> s;
cout << char(s + 1) <<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int dx[] = {-1, 1, 0, 0};
int dy[] = { 0, 0, 1, -1};
int main(){
int h, w, d;
cin >> h >> w >> d;
vector<P> a(h*w);
for(int i=0; i<h; i++){
for(int j=0; j<w; j++){
int b;
cin >> b;
b--;
a[b]... | 0 | 34,935,911 |
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
int main() {
string S; cin >> S;
if (S[0] != 'A') {
cout << "WA" << endl;
return 0;
}
for (char c : S) {
if (c == 'A' || c == 'C') continue;
if (isupper(c)) ... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < (int)(n); i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
int main() {
string N; int K; cin >> N >> K;
ll dp[N.size() + 1][K + 2][2] = {};
dp[0][0][0] = 1;
REP(i, 0, N.size()) {
... | 0 | 17,484,553 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i=0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
const int INF = 1 << 30;
const ll LINF = 1LL << 61;
const int NIL = -1;
const int MAX = 10000;
const int MOD = 1000000007... | #include <bits/stdc++.h>
#define pb push_back
#define pii pair<ll, ll>
#define nyan "(=^･ω･^=)"
#define read_input freopen("in.txt","r", stdin)
#define print_output freopen("out.txt","w", stdout)
typedef long long ll;
typedef long double ld;
using namespace std;
const ll maxn = 4e3+10;
ll pre[4][maxn], a[... | 0 | 53,838,328 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define REP(i,n) for(ll i=0;i<(n);i++)
#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define FORC(i,a,b,c) for(ll i=(a);i<(b);i+=(c))
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define f... | #include <bits/stdc++.h>
using namespace std;
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitset>
#include <cassert>
#include<algorithm>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, ... | 0 | 19,624,579 |
#include<iostream>
using namespace std;
int main()
{
long int i,n,a;
while(cin>>n)
{
a=1;
for(i=n;i>=1;i--)
{
a=a*i;
}
cout<<a<<endl;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
#define rep(i,n) for(ll i = 0;i < (ll)n;i++)
#define ALL(x) (x).begin(),(x).end()
#define MOD 1000000007
int main(){
int n;
cin >> n;
vector<int> p,ne;
vector<P> res;
rep(i,n){
int x... | 0 | 52,133,784 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin>>N;
vector<int64_t> p(N);
for(int i=0;i<N;i++){
cin>>p.at(i);
}
sort(p.begin(),p.end());
vector<int64_t> WA(N);
WA.at(0)=p.at(0);
for(int i=1;i<N;i++){
WA.at(i)=p.at(i)+WA.at(i-1);
}
int A=1;
for(int i=N-2;i>=0;i--){
... | #include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cstring>
#include <map>
#include <queue>
#include <cmath>
#include <complex>
using namespace std;
#define MOD 1000000007
#define ll long long
#define ld long double
#define FOR(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)
#define rep(i,n) FO... | 0 | 85,254,509 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> P;
typedef pair<int,int> Pi;
#define rep(i,n) for(ll i=0;i<n;i++)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define fi first
#define se second
#define endl "\n"
template<typename T> inline bool chmax(T &a, T b){i... | #include <iostream>
using namespace std;
int main(){
int n,b,f,r,v;
cin>>n;
int array[4][3][10]={0};
for(;n>0;n--){
cin>>b>>f>>r>>v;
if(v>=0){
array[b-1][f-1][r-1]+=v;
}else if(v<0){
array[b-1][f-1][r-1]-=v*(-1);
}
}
for(b=0;b<=3;b++){
for(f=0;f<=2;f++){
for(r=0;r... | 0 | 78,037,665 |
#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... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
std::cin >> a >> b >> c >> d;
int left = a + b, right = c + d;
if (left > right){
std::cout << "Left" << std::endl;
}
else if(left == right){
std::cout << "Balanced" << std::endl;
}
else{
s... | 0 | 54,922,446 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string str;
string s, p, buf;
cin >> s;
cin >> p;
buf = s + s;
if(buf.find(p)!=string::npos){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
return 0;
} | #include <stdio.h>
main()
{
int ai,am,as,ae,bi,bm,bs,be,s,t;
scanf("%d %d %d %d %d %d %d %d",&ai,&am,&as,&ae,&bi,&bm,&bs,&be);
s = ai+am+as+ae;
t = bi+bm+bs+be;
if (s>t) printf("%d\n",s);
else printf("%d\n",t);
} | 0 | 32,689,703 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <set>
#include <unordered_set>
#include <bitset>
using namespace std;
using ll = long... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 2000000000000000000ll
#define fi first
#define sec second
#define... | 0 | 58,902,766 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<long long> vll;
typedef vector<int> vi;
#define io ios_base::sync_with_stdio(false)
#define pb push_back
#define eb emplace_back
#define mod 1000000007
#define PI 2*acos(0.0)
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
void bubble_sort(vector<string>& v)
{
int n = v.size();
for (int i = 0; i < n; ++i) {
for (int j = n - 1; j > i; --j) {
if (v[j - 1][1] > v[j][1]) {
swap(v[j - 1], v[j]);
}
}
}
}
void selection_sor... | 0 | 36,335,264 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL<<62
#define inf 10000000007
int main() {
ll n;
cin>>n;
ll ans=0;
ll ch[52];
for(ll i=0;i<n;i++){
cin>>ch[i];
}
for(ll i=0;i<n;i++){
for(ll j=i+1;j<n;j++){
ans+=ch[i]*ch[j];
}
}
cout <<ans;
return 0;
} | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)((x).size())
#define jonathan ios_base::sync_with_stdio(0)
#define livingston cin.tie(0)
using namespace std; ... | 0 | 40,499,637 |
#include <bits/stdc++.h>
using namespace std;
#define Hello ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
#define ll long long
int getFirst10(int n){
int numb = 0;
while(numb < n){
numb += 10;
}
return numb;
}
int main(){
Hello
int a[5], ans = 1e9;
for(int i ... | #include<cstdio>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<iomanip>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
using namespace std;
#define DEBUG(x) cout<<#x<<"="<<x<<endl
#define DEBUG2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<... | 0 | 23,265,202 |
#include <iostream>
using namespace std;
int main(){
int x,y=1;
while(cin >> x,x){
cout << "Case "<< y << ": " << x << endl;
y++;
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
string s,s2;
long long k,n,i,j,p,p2;
cin >> s >> k;
n=s.size();
p=0;
p2=0;
j=0;
int a=1;
for(i=0;i<n-1;i++){
if(s.at(i)!=s.at(i+1)){
a=0;
}
}
if(a==1){
cout << n*k/2 << endl;
}else{
s2=s+s;
for(i=0;i<n;i++){
... | 0 | 79,527,561 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<stack>
#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() {
char a, b;
cin >> a >> b;
if ( a == 'H' && b == 'H' || a =... | #include <bits/stdc++.h>
#define repl(i, l, r) for (int i = l; i < r; ++i)
#define rep(i, n) repl(i, 0, n)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>... | 0 | 97,988,787 |
#include <cstdio>
#include <vector>
using namespace std;
int n,m,x,ans=0x7fffffff;
int c[15],a[15][15];
int main(){
scanf("%d%d%d",&n,&m,&x);
for(int i=1;i<=n;++i){
scanf("%d",c+i);
for(int j=1;j<=m;++j){
scanf("%d",a[i]+j);
}
}
for(int i=0;i<(1<<n);++i){
int t=i,sum=0;
vector<int>v(m+1,0);
for(int j... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll H, W;
int main() {
cin >> H >> W;
ll ans = INF;
if (H % 3 == 0) {
cout << 0 << endl;
return 0... | 0 | 98,809,074 |
#include <cstdio>
#include <algorithm>
#include <climits>
typedef long long ll;
const int max_t = 20;
ll dist[max_t][max_t];
int main() {
while (1) {
int n, t = 0;
scanf("%d", &n);
if (n == 0) break;
for (int i = 0; i < max_t; i++) {
std::fill(dist[i], dist[i] + max_t, INT_MAX);
}
for (int i = 0; i < n;... | #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>
#incl... | 0 | 15,750,735 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
for(int i=0;i<S.size();i++){
if(S.at(i) == 'a' ||
S.at(i) == 'i' ||
S.at(i) == 'u' ||
S.at(i) == 'e' ||
S.at(i) == 'o'){
cout << "vowel" << endl;
}else{
cout << "consonant" << endl;
}... | #include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<ll>;
using vvi = vector<vi>;
const int INF = 100010001;
const ll LINF =... | 0 | 7,740,523 |
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
typedef long long LL;
const LL INF = 0x3f3f3f3f3f3f3f3f;
const LL N = 1000000007;
LL ec = 0,hed[200005] = {0},nxt[400005],to[400005];
void add_edge(LL f,LL t){
++ ec; to[ec] = t; nxt[ec] = hed[f]; hed[f] = ec;
}
LL n,flg... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<vector<int>, long long> mp;
for (int i = 0; i < n; i++) {
string s;
cin >> s;
vector<int> abc(27);
for (char c : s) abc[c-'a']++;
mp[abc]++;
}
long long ans = 0;
for (auto ... | 0 | 31,372,234 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using P = pair<ll,ll>;
const ll mod = 1e9+7;
#define ALL(x) (x).begin(),(x).end()
#define pow(x,y) modpow(x,y)
#define REP(i,n) for(ll (i)=0;(i)<(n);(i)++)
template <class T = int>T in(){
T x;
cin >> x;
return (x);
}
signed main(){
cin.... | #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 n;
vector<int> box(3);
cin >> box.at(0) >> box.at(1) >> box.at(2) >> n;
int ans = 0;
for(int i = 0; box.at(0) * i <= n; i++) {
int x = n - box.at(0) * i;
... | 0 | 83,114,087 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<ll, ll> PLL;
#define chmax(x, y) do { x = max(x, y); } while(0)
#define chmin(x, y) do { x = min(x, y); } while(0)
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#def... | #include <bits/stdc++.h>
#include <numeric>
#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... | 0 | 76,756,489 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
char op;
cin >> A >> op >> B;
cout << ((op == '+') ? A + B : A - B) << "\n";
} | #include <bits/stdc++.h>
#include <iostream>
#include <string>
#define ll long long int
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define phi 3.1415926535
#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl '\n'
using namespace std;
const ll mo... | 0 | 58,213,028 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define REP2(i, x, n) for (ll i = x; i < (n); i++)
#define PR(x) cout << (x) << "\n"
#define PS(x) cout << (x) << " "
const long long INF = numeric_limits<long long>:... | #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... | 0 | 74,951,467 |
#include <iostream>
#include <algorithm>
#include <map>
#include <utility>
using namespace std;
int n, m, a[100005];
map<int, int> mp;
int main()
{
cin >> n >> m;
long long rj = 0, s = 0;
for (int i = 0; i < n; ++i)
{
cin >> a[i];
s = (s + a[i]) % m;
if (s == 0)
++rj;... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
int main()
{
int N; cin >> N;
vector<Int> A(N); for (auto& a : A) cin >> a;
Int cnt = 0;
Int minimum = *min_element(begin(A), end(A));
for (auto& a : A) {
a -= minimum;
cnt += a / (N+1);
a %= N+1;
}
... | 0 | 69,011,614 |
#include <bits/stdc++.h>
using namespace std;
#define BE(x) (x).begin(), (x).end()
int main() {
int n, m, a, b;
cin >> n >> m;
vector<vector<int>> v(n+1);
for (int i = 0; i < m; i++) {
cin >> a >> b;
v[a].push_back(b);
v[b].push_back(a);
}
int s = v[1].size();
for (in... | #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 mod=1000000007;
const int INF=1001001001;... | 0 | 4,247,208 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define int ll
#define _GLIBCXX_DEBUG
#define REP(i,n) for (int i = 0; i < (n); ++i)
#define REPD(i,n) for (int i = (n-1); i >= 0; --i)
#define FORE(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define debug(x) cerr << #x <<... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define a firs... | 0 | 61,525,343 |
#include<iostream>
using namespace std;
int main()
{
char c;
while (cin >> c)
{
if (c == '1') cout << '9';
else cout << '1';
}
return 0;
} | #include <bits/stdc++.h>
typedef int64_t int64;
typedef uint32_t uint;
typedef uint64_t uint64;
using namespace std;
template <typename T>
inline void print(const T& rhs){ std::cout<<" = "<<rhs<<std::endl; }
template <typename T>
inline void print(const std::vector<T>& rhs){
std::cout<<" = [ ";
for(uint i=0; i<... | 0 | 65,641,198 |
#include<bits/stdc++.h>
using namespace std;
#define inf 1e9 + 5
int main() {
int n, k;
cin >> n >> k;
vector< int > height(n);
for (int& i: height) cin >> i;
vector< int > dp (n, inf);
dp[0] = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <= i + k; j++) {
if (j ... | #include<bits/stdc++.h>
using namespace std;
int main(void)
{
string S,T;
cin>>S>>T;
vector<int>a1;
vector<int>b1;
long long int f,g,i,j,t=0;
map<char,int>a;
for(i=0;S[i];i++)
{f=a[S[i]];
a[S[i]]++;
a1.push_back(f+1);}
sort(a1.begin(),a1.end());
m... | 0 | 14,303,970 |
#include <bits/stdc++.h>
typedef long long ll;
#define ALL(l) (l).begin(),(l).end()
#define rep(i,n) for(ll (i)=0;(i)<(n);(i)++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using vi = vector<int>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vs = vector<string>;
using... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >>S;
vector<long long>aaa(S.size()+1,0);
long long answer=0;
for(long long i=0;i<S.size();i++){
if(S.at(i)=='<'){
aaa.at(i+1)=aaa.at(i)+1;
}
}
for(long long i=S.size()-1;0<=i;i--){
if(S.at(i)=='>'){
if(aaa.a... | 0 | 98,152,685 |
#include <bits/stdc++.h>
#include<algorithm>
#define int long long
using namespace std;
typedef pair<int,int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1000000000000
int MOD=1000000007;
struct edge {
int to, cost;
};
int modpow(int a,int x){
if(a<0)a+=MOD;
int ans=1;
while(x>0){
... | #include <bits/stdc++.h>
typedef long long LL;
#define FOR(i,a,b) for(LL i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
using namespace std;
LL p = 1000000007ll;
int main(void)
{
LL n;
cin >> n;
vector<int> a(n);
for(auto &x:a) cin >> x;
LL l = 0;
LL r = n;
while(r-l>1) {
LL piv = (l+r+1) / 2;
vecto... | 0 | 60,627,697 |
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
bool diff = false;
long long ans = 0;
int big = 1E9 + 6;
for (int i = 0; i < n; i++)
{
int a, b;
cin >> a >> b;
ans += a;
if (a > b && b < big)
big = b;
diff = diff... | 0 | 10,715,740 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define ll long long int
int main(){
int D;
cin>>D;
if(D==25)
cout<<"Christmas";
else if(D==24)
cout<<"Christmas Eve";
else if(D==23)
cout<<"Christmas Eve Eve";
else
cout<<"Christmas Eve Eve Eve";
return 0;... | #include<bits/stdc++.h>
#include<ctype.h>
# define pb push_back
#define fst first
#define sec second
#define For(i,a,b) for(int i=a;i<b;i++)
#define ll long long int
#define ull unsigned long long int
#define mod 1000000007
#define fo(i,n) for(ll i=0;i<n;i++)
#define endl "\n"
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#d... | 0 | 38,094,265 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <climits>
#include <cassert>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
using VVI = vect... | #include<bits/stdc++.h>
using namespace std;
#define cinsc ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(0);
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define FOR(i,k,n) for(int64 i=k;i<(int64)n;i++)
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); ... | 0 | 24,912,899 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i <= (ll)(n); i++)
#define INF 10000000000
#define MOD 1000000007
using ll = long long;
using Graph = vector<vector<int>>;
int N;
ll D, A;
vector<ll> X, H;
ll solve()
{
vector<int> idx(... | #include<bits/stdc++.h>
const double pi=acos(-1.0);
using namespace std;
#define endl '\n'
#define sl(n) scanf("%lld",&n)
#define mp make_pair
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define ll long long
#define ull unsigned ... | 0 | 99,423,652 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); ++i)
#define cout(x) cout<<(x)<<endl
using namespace std;
using ll = long long;
using P = pair<int,int>;
const ll inf=1e18;
const int N=2e5+10;
ll factorial(ll x){
if(x==0||x==1) return 1;
return x*factorial(x-1);
}
ll gcd(ll a ,ll b){return b ? gcd... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
using vll=vector<ll>;
using vvll=vector<vll>;
using vi=vector<int>;
using vvi=vector<vector<int>>;
using vb=vector<bool>;
using pii=pair<int,int>;
using vpii=vector<pair<int,int>>;
using plli=pair<ll,int>;
using vplli=vector<pair<ll,int>>;
using pllll=... | 0 | 40,963,158 |
#include <bits/stdc++.h>
int main() {
int n, x;
int ans = 0;
for(;;) {
std::cin >> n >> x;
if( n == 0 && x == 0 ) {
break;
}
ans = 0;
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 ) {
ans += 1;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
map<long, long> a;
long tmp;
for (long i = 0; i < n; i++) {
cin >> tmp;
a[tmp]++;
}
long counter = 0;
auto itr = a.begin();
do {
while (itr->second > 2) {
itr->second -= 2;
counter++;
counter++;
}
itr = next(itr, 1)... | 0 | 30,170,320 |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long N;
cin >> N;
long long minC=N+1;
for(int i=1;i<=sqrt(N);i++){
if(N%i==0){
long long C=i+N/i;
minC=min(minC,C);
}
}
cout << minC-2 << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(){
int n;
cin >> n;
vector<ll> a(n+1), cnt(n+1), c(n+1);
ll sum = 0;
for(int i=1; i<=n; ++i){
int A;
cin >> A;
a[i] = A;
... | 0 | 37,083,335 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using Graph = vector<vector<int>>;
using P = pair<int,int>;
#define MOD 1000000007
int main()
{
int H,W;cin>>H>>W;
char S[2020][2020];
for (int i=1;i<=H;i++)
{
for (int j=1;j<=W;j++)
cin>>S[i][j];
}
int L[2020][2020];
int R[2020... | #include<bits/stdc++.h>
#include<iomanip>
using namespace std;
typedef long long ll;
typedef long l;
typedef pair<int,int> P;
#define rep(i,n) for(int i=0;i<n;i++)
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
const double PI=3.141... | 0 | 90,088,158 |
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n+1); i++)
#define rep4(i, s, n) for (ll i = (s); i < ... | #include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
... | 0 | 16,082,394 |
#include <bits/stdc++.h>
#define SPEED ios_base::sync_with_stdio(false); cin.tie(NULL)
#define REP(i,a,b) for(int i=a,_b=b;i<=_b;i++)
#define rep(i,n) REP(i,0,n-1)
#define FORD(i,b,a) for(int i=b,_a=a;i>=_a;i--)
#define ford(i,n) FORD(i,n-1,0)
#define sqr(x) ((x)*(x))
#define ll long long
#define pi pair<int,int>
#defi... | #include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T> using oset=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define pb push_back
#define N 200001
#define ll long long
#def... | 0 | 41,054,419 |
#include <iostream>
using namespace std;
int main(){
int d,t,s;
cin>>d>>t>>s;
if(s*t>=d){
cout<<"Yes";
return 0;
}
cout<<"No";
return 0;
} | #include<bits/stdc++.h>
#define pb push_back
#define f first
#define s second
#define fio ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define mp make_pair
#define int long long
using namespace std;
const int INF = 1e9;
const int MAX = 1e5+3;
int MOD = 1e9+7;
int n, m, v, p;
int arr[MAX];
bool is_pos... | 0 | 24,390,932 |
#include <bits/stdc++.h>
#define LL long long
using namespace std;
int main(){
LL N;
cin >> N;
int f = 10;
for(LL A=1; A*A<=N; A++){
if(N%A != 0) continue;
LL a = A;
LL b = N/A;
int B_d = 0;
int A_d = 0;
while(a>0){
a /= 10;
A_d++;
... | #include <bits/stdc++.h>
using namespace std;
int main (){
int H, W, M;
cin >> H >> W >> M;
map<pair<int, int>, bool> m;
pair<int, int> temppair;
vector<int> hx(H,0);
vector<int> wy(W,0);
int h, w;
for(int i = 0; i < M; i++) {
cin >> h >> w;
temppair = make_pair(h - 1,w -... | 0 | 60,598,196 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
using P = pair<int,int>;
int main(){
int a,b;
cin >> a >> b;
if(a == 1) a += 13;
if(b == 1) b += 13;
if(a > b) cout << "Alice" << endl;
else if(b > a) cout << "Bob" << endl;
else... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | 0 | 7,171,014 |
#include <bits/stdc++.h>
int main() {
uint64_t N, T;
std::cin >> N >> T;
uint64_t prev = 0, total = 0, t;
for (size_t i = 0; i < N; ++i) {
std::cin >> t;
if (i == 0 || (prev + T) <= t) {
total += T;
prev = t;
} else {
total += (T - (prev + T - ... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
int main() {
ll N,K; cin >> N >> K;
vector<ll> A(N);
rep(i,N) cin >> A.at(i);
ll MOD = 1000000007;
ll cnt = 0;
rep(i,N) {
rep(j,N) {
if (i == j) continue;... | 0 | 664,757 |
#include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9+7)
#define inf (int)(3e18+7)
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define P pair<int,int>
#define PiP pair<int,pair<int,int>>
#define all(v) v.begin(),v.end()
#define mkp make_pair
#define mkt make_tuple
#define ... | #include <bits/stdc++.h>
using namespace std;
int main()
{
setprecision(18);
int n,k;
cin>>n>>k;
double ans=0.0;
for(int i=1;i<=min(n,k-1);i++)
{
int cur=i;
int cnt=0;
while(cur<k)
{
cur=cur*2;
cnt++;
}
double curAns=(1.0/(1... | 0 | 44,991,184 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s,p;
cin>>s>>p;
p=p+s;
cout<<p;
return 0;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | 0 | 84,093,862 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
vector<ll> delt(N);
ll c = 0;
ll dec = 0;
for (ll &e : delt) cin >> e;
for (ll i = 0; i < N; i++) {
ll x;
cin >> x;
delt[i] -= x;
if (delt[i] < 0) {
dec += delt[i];
c += 1;
}
... | #include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false), cin.tie(0);
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl '\n'
const int INF = 1e6;
using namespace std;
int n,a,b,c;
int l[10];
int solve (int at, int bt, int ct, int cur)
{
if (cur==n... | 0 | 98,766,282 |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define int long long
const int MOD=1e9+7;
const int INF=1e15;
signed main(){
int N;cin>>N;
map<string,int>memo;
REP(i,N){
string d;cin>>d;
memo[d]++;
}
int M;ci... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int h,w;
cin >> h >> w;
vector<vector<int>> wall_y(h);
vector<vector<int>> wall_t(w);
for(int i=0; i<h; i++){
for(int j=0; j<w; j++){
char c;
cin >> c;
if(c == '#'){
... | 0 | 68,911,346 |
#include <iostream>
#include <string>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
int main() {
int n;
string s;
cin >> n >> s;
ll ret = 1;
ll fin_count = 0;
ll calc_count = 0;
for (int i = 2 * n - 1; i >= 0; i--) {
if ((i % 2 == 0) == (s[i] == 'W'))fin_count++;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
const int INF = 1e15 + 7;
const int MAX = 1e5 + 7;
const int MOD = 1e9 + 7;
typedef pair<ll, ll> ii;
typedef vector<ll> vi;
typedef vector<vi> vvi;
t... | 0 | 100,772,949 |
#include <bits/stdc++.h>
#define rep(i, n) for (lli i = 0; i < (n); i++)
#define rrep(i, n) for (lli i = (n)-1; i >= 0; i--)
using namespace std;
using lli = long long int;
void YESNO(bool), YesNo(bool);
template <class T1, class T2>
bool chmin(T1 &l, const T2 &r);
template <class T1, class T2>
bool chmax(T1 &l, const ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll solve() {
ll MAX = pow(10, 18);
int n; cin >> n;
vector<ll> nums;
ll a;
for (int i = 0; i < n; ++i) {
cin >> a;
if (a == 0) {
return 0;
}
nums.push_back(a);
}
ll res = 1;
fo... | 0 | 48,301,761 |
#include <iostream>
using namespace std;
using LL = long long;
int main() {
int n;
cin >> n;
LL ans = 1;
for (int i = n; i > 1; i--) {
ans *= i;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define print(x) cout << x << endl;
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<pair<int, int>> ab, cd;
int x, y;
rep(i, N) {
cin >> x >> y;
ab.push_back(pair<int, int>(x, y));
... | 0 | 39,039,733 |
#include <algorithm>
#include<iostream>
#include<vector>
#include<deque>
#include<queue>
#include<stack>
#include<list>
#include<map>
#include<set>
#include<string>
#include <sstream>
#include<bitset>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<limits.h>
const int INF = 0x7fffffff;
using lll = long ... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, const char * argv[]) {
int n, k; cin>>n>>k;
double ans=0;
for(int i=1; i<=n; i++){
double sc = 1.0/n;
int reg=i;
while(reg<k){
sc/=2;
reg*=2;
}
ans+=sc;
}
printf("%.9f\n",... | 0 | 72,315,805 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int s;
double x;
cin>>s;
for(int i=s;i>=1;i--){
x=log(i)/log(2);
if(x-int(x)==0){
cout<<i;
break;
}
}
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<(ll)n;++i)
int main() {
string s,t;cin >> s >> t;
ll id = -1;
for(ll i=0;i<=(ll)s.size()-(ll)t.size();++i){
for(ll j=0;j<(ll)t.size();++j){
if( s.at(i+j) == '?' || s.at(i+j) == t.at(j) ){
if( j == (l... | 0 | 18,039,176 |
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define rep(i,n) for(int i=0;i<=(n);++i)
#define ALL(v) (v).begin(),(v).end()
typedef long long ll;
typedef pair<ll, int> P;
int h,w,d;
char s[4]... | #include<cstdio>
#include<iostream>
#include<cstdlib>
using namespace std;
long long cur;
int w;
long long p[18],po[18];
int bs(int x)
{
int l=-1,r=10;
if(x==1)l=0;
while(l+1<r)
{
int m=(l+r)/2;
printf("? %lld\n",(cur*10LL+m)*po[11-x]+p[11-x]);
char op;
cin>>op;
if(op=='N')l=m;else r=m;
}
return l;
}
in... | 0 | 14,558,266 |
#include <bits/stdc++.h>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i,n) for (ll i=0; i < (ll)(n); i++)
int main(void){
ll n;
cin>>n;
ll ans=0;
for(ll i=1;i<=n;i++){
ll p=n/i;
ans+=i*(1+p)*p/2;
}
cout<<ans<<endl;
} | #pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitse... | 0 | 93,986,590 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string s; cin >> s;
string answer ="";
for (int i = 0; i < s.size(); i+= 2) answer += s.at(i);
cout << answer << endl;
} | #pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<l... | 0 | 85,582,255 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int ans = 1;
while(1){
if(ans * 2 <= N){
ans *= 2;
}
else{
break;
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <complex>
#include <valarray>
#include <unordered_map>
#include <array>
#include <fstream>
#include <cassert>
#include <cmath>
#inclu... | 0 | 88,166,349 |
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#i... | #include<iostream>
#include<map>
#include<vector>
#include<cmath>
#include<string>
#include<cstring>
#include<algorithm>
#include<climits>
#include<stack>
#include<queue>
#include<set>
#include<cctype>
#include<bitset>
#include<type_traits>
#include<numeric>
#include<array>
using namespace std;
# define REP(i,n) for ... | 0 | 16,211,905 |
#include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
using lint = long long int;
int H, W, N;
vector<P> p;
int count(int x, int y)
{
if (x <= 0 || y <= 0 || x >= H-1 || y >= W-1) return 0;
int ans = 0;
for (int i=-1; i<=1; i++)
{
for (int j=-1; j<=1; j++)
{
... | #include <stdio.h>
#include <algorithm>
#include <iostream>
#include <stdlib.h>
using namespace std;
class Heap{
public:
Heap(){
array = new int[2000000];
n = 0;
}
void insert(int data){
array[n] = data;
int tmp = n;
while(tmp != 0 && array[tmp] > array[(tmp-1)/2]){
... | 0 | 32,322,837 |
#include <stdio.h>
#include <algorithm>
using namespace std;
int N, D, A; pair<int, int> M[200200];
int cnt = 1, coord[400400];
long long sum[400400];
void push(int x, long long p)
{
x = lower_bound(coord + 1, coord + cnt, x) - coord;
while (x < cnt){
sum[x] += p;
x += x & (-x);
}
}
long long pop(int x)
{
long ... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
#include<cmath>
#include<cstdio>
#include<tuple>
#include<bitset>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define ALL(x) x.begin(),x.end()
#define ll ... | 0 | 51,445,922 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while(cin>>n,n){
string str;
bool right=0,left=0;
int ans=0;
for(int i=0,now=1;i<n;i++){
cin>>str;
if(str=="lu")left=1;
if(str=="ru")right=1;
if(str=="ld")left=0;
if(str=="rd")right=0;
if(now==right&&right==left){
ans++;
... | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
long long n, m;
cin >> n >> m;
vector<pair<long long, long long> > v;
for(long long i = 0; i < n; i++){
long long a, b;
cin >> a >> b;
v.push_back(make_pair(a, b));
}... | 0 | 61,026,023 |
#include <iostream>
using namespace std;
struct TCoordinate
{
double x;
double y;
};
bool JudgeSameSide(TCoordinate T1, TCoordinate T2, TCoordinate L1, TCoordinate L2)
{
if(L1.x == L2.x){
if((T1.x - L1.x) * (T2.x - L2.x) > 0){
return true;
}else{
return false;
}
}else{
if(((L2.x - L1.x) * (T1.y - L1.y... | #ifdef _DEBUG
#include "MyLib.h"
#else
#define main_D main
#include "bits/stdc++.h"
#include <regex>
#define _USE_MATH_DEFINES
#include <math.h>
#define FOR(i,s,e) for (int i = int(s); i < int(e); ++i)
#define REP(i,e) FOR(i,0,e)
#define INF (INT_MAX/2)
#define EPS (1.0e-8)
#define LINF (LLONG_MAX/2)
const int MGN = 8... | 0 | 100,658,834 |
#include <cstdio>
#include <cmath>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double pi = acos(-1);
const int maxn = 2e6 + 10;
const double... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rem(i, m, n) for (int i = m; i < (n); i++)
#define eps (1e-7)
#define inf (1e9)
#define pi (acos(-1))
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<... | 0 | 73,483,865 |
#include<cstdio>
#include<string>
#include<cstring>
#include<utility>
#include<cmath>
#include<map>
#include<queue>
#include<set>
#include<algorithm>
#include<vector>
#include<iostream>
#define ll long long
#define pii pair<int,int>
#define mp make_pair
#define fi first
#define se second
#define inf 0x7fffffff
using na... | #include <iostream>
#include <iomanip>
#include <cassert>
#include <cstring>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <limits>
#include <queue>
#include <unordered_map>
#include <list>
#include <set>
#include <numeric>
using namespace std;
using ll = long long;
#define rep_init... | 0 | 82,713,825 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int count = 0;
for (int a = 1; a < n; a++) {
count += (n - 1) / a;
}
cout << count;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define MOD 1000000007
int main() {
int x, y, a, b, c;
cin >>... | 0 | 37,491,585 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> h(N + 1);
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
vector<int> cost(N + 1, 0);
for (int i = 2; i <= N; i++) {
int minimum = INT_MAX;
for(int j = 1; j <= K; j++) {
... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int N, Y;
cin >> N >> Y;
int x, y, z;
int ansx=0, ansy=0, ansz=0;
for(x = 0; x <= N; x++){
for(y = 0; y <= N-x; y++){
z = N-x-y;
if((10000*x + 5000*y + 1000*z) == Y){
ansx ... | 0 | 29,905,349 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rep1(i,n) for(ll i=1;i<=(n);i++)
#define all(x) (x).begin(),(x).end()
#define V vector
typedef V<int> vi;
typedef V<vi> vvi;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
constexpr auto INF = I... | #include <bits/stdc++.h>
using namespace std;
struct UnionFind
{
vector<int> par;
UnionFind(int N) : par(N)
{
for(int i = 0; i < N; i++) par[i] = i;
}
int root(int x)
{
if(par[x] == x) return x;
return par[x] = root(par[x]);
}
void unite(int x, int y)
{
int rx = root(x);
int ... | 0 | 49,264,057 |
#include<iostream>
using namespace std;
int main()
{
int s, a[10000];
cin >> s;
a[0] = s;
for(int i = 1; i < 10000; i++)
{
if(s % 2 == 0)
{
s = s / 2;
a[i] = s;
}
else
{
s = 3 * s + 1;
a[i] = s;
}
... | #include<iostream>
using namespace std;
int main()
{
int h, w;
cin >> h >> w;
while(true)
{
if (h == 0 && w == 0) break;
for (int i = 0; i < h; i++)
{
if (i == 0 || i == h-1)
{
for (int j = 0; j < w; j++)
{
cout << "#";
... | 0 | 68,068,124 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double r(0.0), g(0.0);
cin >> r;
cin >> g;
const double goal = g * 2.0;
cout << goal - r << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int , int> i_i;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> vvl;
typedef vector... | 0 | 93,784,666 |
#include<iostream>
#include<vector>
#define lli long long int
#include<climits>
#include<unordered_map>
#include<algorithm>
#include<bitset>
#include<map>
#include<cmath>
#include<queue>
#define pb push_back
#define N (int)(1e5)
using namespace std;
using namespace std;
int main()
{
int h,n;
int i,j;
cin>>h... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
int n,m,x;
cin>>n>>m>>x;
int ans=10101010;
int a[12][12];
vector<int>c(n);
rep(i,n){
cin>>c.at(i);
rep(j,m) cin>>a[i][j];
}
rep(s,1<<n){
int cost=0;
vector<int>d(m,0);
rep(i,n){
if(s>>i ... | 0 | 94,515,295 |
#include<bits/stdc++.h>
using namespace std;
#define cinsc ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(0);
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define FOR(i,k,n) for(int64 i=k;i<(int64)n;i++)
#define FOREACH(it, l) for (auto it = l.begin(); it != l.end(); ... | #include <iostream>
#include <algorithm>
#include <queue>
#define rep(i,n) for(int i=0; i<(n); ++i)
#define outl(x) cout<< (x) << '\n'
using namespace std;
using let = const int;
int V, E;
bool vis[10005];
vector <int> G[10005];
vector <int> out;
void bfs(let s, int *indeg)
{
queue <int> que; que.emplace(s);
whil... | 0 | 93,414,887 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=1<<17,INF=1<<30;
int main(){
std::ifstream in("text.txt");
std::cin.rdbuf(in.rdbuf());
cin.tie(0);
ios::sync_with_stdio(false);
while(1){
int N;cin>>N;
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <st... | 0 | 49,726,206 |
#include <bits/stdc++.h>
#include <set>
#define ll long long
#include <string>
#define pb push_back
#define mp make_pair
# define pi 3.14159265358979323846
#define mod 1000000007
#define rep(i,n) for(i=0;i<n;i++)
using namespace std;
void fastio()
{
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
using ll = long long;
using graph = std::vector<std::vector<ll>>;
using namespace std;
int main() {
ll N,M,V,P;
cin >> N >> M >> V >> P;
vector<ll> A(N);
vector<ll> B(N + 1);
... | 0 | 28,678,844 |
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <stack>
#include <numeric>
#include <algorithm>
#include <tuple>
#include <stdio.h>
#include <bitset>
#include <limits.h>
#include <complex>
#include <deque>
#include <iomanip>
#include <li... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
using namespace std;
using ll = long long;
const int INF = (1<<30)-1;
const long long LINF = (1LL<<62)-1;
const int dx[] = {1, 0};
const int dy[] = {0, 1};
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } retu... | 0 | 87,286,639 |
#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define mp make_pair
#define inf 1000000007
using namespace std;
set<double> lms[40009];
void setadd(int lef, int rig, int lim, int n,int sum){
double dlef = 1.0 * lef;
double drig = 1.0 * rig;
for(int i=0;i<=2*sum;i++){
double ct = 0.5 * i;
if(... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
long long R = 0;
long long G = 0;
long long B = 0;
for (int n = 0; n < S.size(); ++n) {
if ('R' == S[n]) {
++R;
}
else if('G'==S[n]){
++G;
}
else {
++B;
}
}
long long ans = R * G * B;
for (int i = ... | 0 | 44,767,010 |
bool DBG = false;
#include<bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using ll = long long;
using ld = long double;
using bint = boost::multiprecision::cpp_int;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define IFOR(i,a,b) for(int i=((b)-1);i>=(a);--i)
#define RPT(i,a,b) for(int i... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
#include <functional>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(... | 0 | 76,138,275 |
#include<stdio.h>
int main(){
int H1, M1, H2, M2, K;
scanf("%d %d %d %d %d", &H1, &M1, &H2, &M2, &K);
int x;
x = ((H2 - H1) * 60) + (M2 - M1) - K;
printf("%d", x);
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... | 0 | 96,768,452 |
#include <iostream>
#include <complex>
using namespace std;
typedef complex<double> P;
#define EPS (1e-10)
double cross(P a, P b){
return (a.real() * b.imag() - a.imag() * b.real());
}
int is_intersect(P a1, P a2, P b1, P b2){
return (cross(a2-a1, b1-a1) * cross(a2-a1, b2-a1) < EPS) &&
(cross(b2-b1, a1-b1) * cross(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cout<<setprecision(32);
int n; ll m;
cin>>n>>m;
set<int> st;
ll lcm = 1;
for(int i = 0; i < n; i++){
ll x; cin>>x... | 0 | 34,969,217 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
string x;
cin >> x;
int sum = 0;
for (int i = 0; i < x.length(); ++i){
sum += x[i]-'0';
}
if(sum%9 == 0){cout << "Yes" << endl;}
else{std::cout << "No" << std::endl;}
return 0;
} | #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << endl
#define debugArray(x, n) \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << #x << "[" << hoge << "]: " << x[hoge] << endl
using namespace std;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
... | 0 | 44,539,208 |
#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... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
using ll = long long;
using ld = long double;
#define vl vector<long long>
#define vvl vector<vector<long long>>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
using pll = pair... | 0 | 28,889,742 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);
set<int> s;
for(int i=0;i<3;++i){
int x;
cin>>x;
s.insert(x);
}
cout<<int(s.size())<<'\n';
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll n, m;
cin >> n >> m;
vector<vector<ll>> S(n, vector<ll>(2));
vector<vector<ll>> P(m, vector<ll>(2));
for (int i = 0; i < n; i++)
{
ll a, b;
cin >> a >> b;
S.at(i).at(0) = a;
S.at(i).at(1) = b;
}
for (int ... | 0 | 23,599,735 |
#include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
#define LL long long
using namespace std;
int N;
int A[100000];
vector<int> edge[100000];
bool used[100000];
LL DFS(int v){
used[v]=true;
if(edge[v].size()==1)return A[v];
vector<LL> lift;
REP(i,ed... | #include<cstdio>
#include<iostream>
#define MAX_N 10000000;
using namespace std;
long long int dp[20][20];
int w,h;
int main(){
while(1){
for(int i=0;i<20;i++){
for(int j=0;j<20;++j){
dp[i][j]=0;
}
}
dp[1][1]=1;
cin>>w>>h;
int n,x,y;
... | 0 | 91,644,089 |
#include <iostream>
#include <string>
int main() {
std::string str;
std::cin >> str;
int n;
std::cin >> n;
std::string command;
int a, b;
for(int i = 0; i < n; ++i) {
std::cin >> command >> a >> b;
if(command == "replace") {
std::string rep;
std::cin >> rep;
str.replace(a, b - a ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
int ans=1,p=a[0];
for(int i=1;i<n;i++)
{
if(a[i]<=p)
{
ans++;
p=a[i];
}
}
cout<<ans<<endl;
} | 0 | 14,580,573 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <utility>
#include <set>
#include <stack>
#include <climits>
#include <cmath>
#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)
... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#incl... | 0 | 35,397,271 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<cmath>
#include<string>
#include<cstring>
#include<functional>
#include<bitset>
using namespace std;
typedef long long int ll;
bool color[100001];
int d[100001];
int f[100001];
int t = 0;
vector< pair<int, int> > g[1000... | #include<bits/stdc++.h>
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
using namespace std;
int static fast = [](){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0); return 0;
}();
int main() {
int n;
cin >> n;
vector<ll> arr(n, 0);
for(auto& val: arr)
cin >... | 0 | 88,121,883 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define N 100000
#define ff first
#define ss second
#define si size()
#define mod 1000000007
#define large 10000000000000001
#define FAST ios_base::sync_with_stdio(false),cin.tie(0),cout.t... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n); (i)++)
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
#define rev(i, n) for(int (i)=(n)-1; (i)>=0; (... | 0 | 34,176,323 |
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
const int maxn=50000+10,maxm=20+10;
int n,m;
int d[maxm],f[maxn];
int main(){
cin>>n>>m;
for(int i=1;i<=m;i++)
cin>>d[i];
memset(f,0x3f,sizeof(f));
f[0]=0,f[1]=1;
for(int i=1;i<=m;i++)
for(int j=0;j<=n;j++)
if(j-d... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n,l;
bool f=false;
cin >> n >> l;
int k=1,j=0;
vector<int> a(n);
vector<int> co(n-1);
cin >> a.at(0);
for(int i=1;i<n;i++){
cin >> a.at(i);
if(a.at(i-1)+a.at(i)>=l){
f=true;
k=i;
... | 0 | 50,730,039 |
#include<bits/stdc++.h>
using namespace std;
#define OUT(x) cout<<x<<endl
int main(){
int n,ud,ans;
bool o;
string ins;
while(cin>>n&&n){
o = false;
ud = ans = 0;
for(int i=0;i<n;i++){
cin >> ins;
if(ins == "lu" || ins == "ru")ud++;
else ud--;
if(!o&&ud==2){
ans++;
o = true... | #include <bits/stdc++.h>
using namespace std;
#define pb insert
#define eb emplace_back
#define ff first
#define ss second
typedef long long int ll;
typedef long double ld;
#define all(a) a.begin(), a.end()
#define show(x) cerr << #x << " is " << x << "\n"
#define show2(x, y) cerr << #x << " " << #y << " " << x << " " ... | 0 | 12,563,326 |
#include <iostream>
using namespace std;
int main(){
int n,gold;
int res10000=-1,res5000=-1,res1000=-1;
cin >> n >> gold;
for(int x = 0;x <= n;x++){
for(int y = 0;x+y <= n;y++){
int z = n - x - y;
int total = 10000*x + 5000*y + 1000*z;
if(total == gold){
res10000 = x;
res50... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef long long ll;
typedef long double ld;
int main(){
int t=1;
while(t--){
int s;
cin>>s;
vector<int> a(1000001);
a.at(s)++;
for(int i=2;i<=1000000;i++){
int n;
if(s%2==0)... | 0 | 56,364,954 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
int main() {
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> b(n-1);
rep(i,n-1) cin >> b[i];
a[0] = b[0];
rep(i,n-2){
a[i+1] = min(b[i],b[i+1]);
}
a[n-1] = b[n-2];
ll ans=0;
rep(i,n) a... | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (... | 0 | 69,575,286 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.