text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
int main() {
using namespace std;
int n,a,b,p;
int ans;
int la=0,lb=0,lc=0;
cin >> n;
cin >> a >> b;
for(int i=0;i<n;i++){
cin >> p;
if(p<=a) la++;
else if(p<=b) lb++;
else lc++;
}
ans = min(lc,min(la,lb));
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, A, B;
cin >> N >> A >> B;
int a = 0, b = 0, c = 0;
for(int i = 0; i < N; i++){
int p;
cin >> p;
if(p <= A)
a++;
else if(p <= B)
b++;
else
c++;
}
cout << min({a, b, c}) << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main (void){
int n,a,b,p[101],i,x=0,y=0,z=0;
cin >> n >> a >> b;
for(i=1;i<=n;i++) {
cin >> p[i];
if(p[i]<=a) x++;
if(p[i]>b) z++;
if(p[i]>a&&p[i]<=b) y++;
}
cout << min(x,(min(y,z))) << endl;
return 0;
} |
#include <iostream>
using namespace std;
int cnt[3] = {};
int main(){
int i,n,a,b;
cin >> n >> a >> b;
for(i=0;i<n;i++){
int x;
cin >> x;
if(x<=a) cnt[0]++;
else if(x<=b) cnt[1]++;
else cnt[2]++;
}
int ans = 1000;
for(i=0;i<3;i++){
ans = min(ans,cnt[i]);
}
cout << ans << endl;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n, a, b, p1 = 0, p2 = 0, p3 = 0;
cin >> n >> a >> b;
for (int i = 0; i < n; i++) {
int p;
cin >> p;
if (p <= a)
p1++;
else if (p <= b)
p2++;
else
p3++;
}
cout << min({p1, p2, p3}) << endl;
return 0;
}
|
#include<iostream>
#include<math.h>
using namespace std;
int main(){
int n,a,b,p,i;
int x,y,z;
x=y=z=0;
cin >> n >> a >> b;
for(i=0;i<n;i++){
cin >> p;
if(p>b)
z++;
else if(p>a)
y++;
else
x++;
}
cout << min(min(x,y),z) << endl;
return 0;
}
|
#include<cstdio>
#include<algorithm>
int main(){
int n,a,b,p,pcnt[3]={};
scanf("%d%d%d",&n,&a,&b);
for(int i=0;i<n;i++){
scanf("%d",&p);
if(p<=a)pcnt[0]++;
else if(p<=b)pcnt[1]++;
else pcnt[2]++;
}
std::sort(pcnt,pcnt+3);
printf("%d",pcnt[0]);
return 0;
} |
#include<bits/stdc++.h>
using namespace std ;
int main () {
int N , A , B ;
cin >> N >> A >> B ;
int a = 0 , b = 0 , c = 0 ;
for(int i = 0 ; i < N ; i++ ){
int x ;
cin >> x ;
if(x<=A) a++ ;
else if(x>B) c++ ;
else b++ ;
}
cout << min({a,b,c}) << endl ;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, a, b;
cin >> n >> a >> b;
int cnt1 = 0, cnt2 = 0, cnt3 = 0;
for(int i = 0; i < n; i++){
int p; cin >> p;
if(p <= a) cnt1++;
else if(p <= b) cnt2++;
else cnt3++;
}
cout << min({cnt1, cnt2, cnt3}) << endl;
return 0;
} |
#include <iostream>
using namespace std;
int main() {
int n,a,b;
cin>>n>>a>>b;
int k1=0, k2=0, k3=0;
for (int i=0; i<n; i++) {
int p;
cin>>p;
if (p <= a)
k1++;
else if (p <= b)
k2++;
else
k3++;
}
cout<<min(k1, min(k2, k3))<<endl;
return 0;
} |
#include <bits/stdc++.h>
int main() {
int N, A, B, cnta, cntb, cntc;
cnta = cntb = cntc = 0;
scanf("%d%d%d", &N, &A, &B);
for (int i = 0, Pi; i < N; i++) {
scanf("%d", &Pi);
if (Pi <= A) ++cnta;
else if (Pi <= B) ++cntb;
else ++cntc;
}
printf("%d\n", std::min(cnta, std::min(cntb, cntc)));
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,A,B,C1=0,C2=0,C3=0;
cin >> N >> A >> B;
for(int i=0;i<N;i++){
int P;
cin >> P;
if(P<=A){
C1++;
}
else if(P<=B){
C2++;
}
else{
C3++;
}
}
cout << min({C1,C2,C3}) << endl;
} |
#include <iostream>
using namespace std;
int n;
int a, b;
int n0, n1, n2;
int main(void)
{
cin >> n >> a >> b;
for(int i = 0; i < n; i++){
int p;
cin >> p;
if(p <= a) n0++;
else if(p <= b) n1++;
else n2++;
}
cout << min(n0, min(n1, n2)) <<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,A,B;
cin>>N;
cin>>A>>B;
int P[N];
int p1=0,p2=0,p3=0;
for(int i=0;i<N;i++){
cin>>P[i];
if(P[i]<=A){
p1++;
}
else if(P[i]<=B){
p2++;
}
else p3++;
}
cout<<min(min(p1,p2),p3)<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,a,b,p,c1=0,c2=0,c3=0;
cin>>n>>a>>b;
while(cin>>p)
if(p<=a)
c1++;
else if(p<=b)
c2++;
else
c3++;
cout<<min({c1,c2,c3})<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, a, b; cin >> n >> a >> b;
int ba = 0, bb = 0;
vector<int> v(n); for(int & i : v) cin >> i;
for(int i = 0; i < n; i++) if(v[i] <= a) ba++; else if(v[i] > b) bb++;
cout << min(ba, min(bb, n - ba - bb) ) << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,A,B,a=0,b=0,c=0;
cin >> N >> A >> B;
for(int i=0; i<N; i++){
int P;
cin >> P;
if(P<=A){
a++;
}
else if(P<=B){
b++;
}
else{
c++;
}
}
cout << min(a,min(b,c)) << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, A, B;
cin >> N >> A >> B;
int P=0, Q=0, R=0;
int C;
for(int i=0; i<N; i++){
cin >> C;
if(C<=A){
P++;
}
else if(C<=B){
Q++;
}
else{
R++;
}
}
cout << min(P, min(Q, R)) << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,A,B;
cin >> N >> A >> B;
int P;
int x,y,z;
for(int i;i<N;i++){
cin >> P;
if(P<=A){
x++;
}
else if(P<=B){
y++;
}
else{
z++;
}
}
cout << min(x,min(y,z)) << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,A,B;
cin >> N >> A >> B;
int ua=0,ab=0,ob=0;
for(int i=0;i<N;i++){
int x;
cin >> x;
if(x<=A)ua++;
else if(x>=B+1)ob++;
else ab++;
}
cout << min({ua,ab,ob});
}
|
#include<iostream>
using namespace std;
int N,A,B;
int cnt1=0,cnt2=0,cnt3=0;
int main(){
cin>>N>>A>>B;
for(int i=0; i<N; i++){
int t;
cin>>t;
if(t<=A)cnt1++;
else if(t<=B)cnt2++;
else cnt3++;
}
cout<<min(cnt1,min(cnt2,cnt3))<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,a,b; cin >> n >> a >> b;
int x=0,y=0,z=0;
for(int i = 0; i < n; i++){
int p; cin >>p;
if(p <= a) x++;
else if(p <= b) y++;
else z++;
}
cout << min(x,min(y,z));
}
|
#include "bits/stdc++.h"
using namespace std;
int main(){
int n,a,b,i,p,e=0,m=0,h=0;
cin >> n>>a>>b;
for(i=0;i<n;i++){
cin>>p;
if(p<=a) e++;
else if(p<=b) m++;
else h++;
}
cout << min(e,min(m,h))<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int x,y,z;
int main(){
int n,a,b;
cin>>n>>a>>b;
for(int i=0;i<n;i++){
int p;
cin>>p;
if(p<=a)x++;
else if(p>b)z++;
else y++;
}
cout<<min(x,min(y,z))<<endl;
return(0);
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n, a, b;
cin >> n >> a >> b;
ll x = 0, y = 0, z = 0;
for (int i = 0, k; i < n; i++){
cin >> k;
if (k<= a) x++;
else if (k<=b) y++;
else z++;
}
cout << min(x,min(y,z)) << '\n';
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, A, B;
cin >> N >> A >> B;
int c1 = 0, c2 = 0, c3 = 0;
for (int i = 0; i < N; i++) {
int P;
cin >> P;
if (P <= A) {
++c1;
}
else if (P <= B) {
++c2;
}
else {
++c3;
}
}
cout << min(min(c1, c2), c3) << endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<set>
using namespace std;
int n,h,w,a,b,c,i;
int main()
{
int n,a,b,p,c[3]={0};
cin>>n>>a>>b;
for(int i=0;i<n;i++)
{
cin>>p;
if(p<=a)c[0]++;
else if(p<=b)c[1]++;
else c[2]++;
}
sort(c,c+3);
cout<<c[0]<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,a,b;
cin >>n>>a>>b;
int p,j,k,l;
j=0;
k=0;
l=0;
for(int i=0;i<n;i++){
cin>>p;
if(p<=a){
j++;
}
else if(p<=b){
k++;
}
else{
l++;
}
}
cout<<min(min(j,k),l)<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int n,x,a,b,c,d,e;
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n>>a>>b;
for(int i=0;i<n;i++)
{
cin>>x;
if(x<=a)c++;
else if(x>=a+1&&x<=b)d++;
else if(x>=b+1)e++;
}
int ans=min(c,d);
cout<<min(ans,e);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,a,b;
cin >> n >> a >> b;
int c=0;
int d=0;
int e=0;
for(int i=0;i<n;i++){
int f;
cin >> f;
if(f<=a) c++;
else if (f > a && f <= b) d++;
else if(f > b) e++;
}
cout << min (c,min(d,e)) << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int n, x, a, b, yig, erg, sg;
int main() {
cin >> n >> a >> b;
int i;
for(i = 1; i <= n; ++i) { cin >> x; if(x <= a) ++yig; if(x > a && x <= b) ++erg; if(x > b) ++sg;}
cout << min(yig, min(erg, sg));
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N, A, B;
int P[3]={};
cin >> N>> A >> B;
for(int i=0; i<N; i++){
int p; cin >> p;
if(p<=A) P[0]++;
else if(p<=B) P[1]++;
else P[2]++;
}
cout << min(min(P[0],P[1]),P[2]) << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
int x,y,z,p;
int main(){
int n,a,b;
cin>>n>>a>>b;
for(int i=0;i<n;i++){
cin>>p;
if(p<=a) x++;
else if( p>b) z++;
else y++;
}
cout<<min({x,y,z});
} |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll aa[100000];
int main()
{
ll a,b,c,d=0,e=0,f=0,g;
cin>>a>>b>>c;
for(ll i=0;i<a;i++){
cin>>g;
if(g<=b){
d++;
}else if(b+1<=g&&g<=c){
e++;
}else{
f++;
}
}
cout<<min({d,e,f});
} |
# include <bits/stdc++.h>
using namespace std;
int s[3];
int main ()
{
int n;
int a,b;
cin>>n>>a>>b;
for (int i=1;i<=n;++i)
{
int p;
cin>>p;
if (p<=a)
s[0]++;
if (a<p&&p<=b)
s[1]++;
if (p>b)
s[2]++;
}
sort (s,s+3);
printf ("%d\n",s[0]);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int g1 = 0, g2 = 0, g3 = 0;
for (int i = 0; i < n; i++) {
int p;
cin >> p;
if (p <= a) g1++;
else if (p <= b) g2++;
else g3++;
}
cout << min({g1, g2, g3}) << endl;
} |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main(){
int n,a,b;cin>>n>>a>>b;
int p1=0,p2=0,p3=0;
rep(i,n){
int t;cin>>t;
if(t<=a)p1++;
else if(t<=b)p2++;
else p3++;
}
cout<<min({p1, p2, p3});
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n, a, b; cin >> n >> a >> b;
int p[n];
int p1 = 0, p2 = 0, p3 = 0;
for(int i = 0; i < n; ++i) cin >> p[i];
for(int i = 0; i < n; ++i){
if(p[i] <= a) p1++;
else if(p[i] <= b) p2++;
else p3++;
}
cout << min(p1, min(p2, p3)) << endl;
} |
#include<iostream>
using namespace std;
int main(){
int n, a, b, p[100], q1=0, q2=0, q3=0;
cin >> n >> a >> b;
for(int i=0; i<n; i++){
cin >> p[i];
if(p[i]<=a)
q1++;
else if(p[i]<=b)
q2++;
else
q3++;
}
if(q1>q2)
q1 = q2;
if(q1>q3)
q1=q3;
cout << q1;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
cin>>a;
cin>>b>>c;
int e=0;
int f=0;
int g=0;
for(int i=0;i<a;i++){
int d[100];
cin>>d[i];
if(d[i]<=b){
e++;
}
if(d[i]>b&&d[i]<=c){
f++;
}
if(d[i]>c){
g++;
}
}
int h=min({e,f,g});
cout<<h<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,A,B,C=0,D=0,E=0,x;
scanf("%d%d%d",&N,&A,&B);
while(N--){
scanf("%d",&x);
if(x <= A)C++;else
if(x > B)D++;else
E++;
}
printf("%d\n",min(C,min(D,E)));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,a,b,counta=0,countb=0,countc=0;
cin >>n >>a >>b;
int wa[n];
for (int i=0;i<n;i++){
cin >> wa[i];
if (wa[i]<=a)counta++;
else if (wa[i]<=b)countb++;
else countc++;
}
cout <<min(counta,min(countb,countc)) <<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, a, b;
scanf("%d%d%d", &n, &a, &b);
int sum[3] = {};
for (int i = 0; i < n; i++){
int x; scanf("%d", &x);
if (x <= a) sum[0]++;
else if (x <= b) sum[1]++;
else sum[2]++;
}
printf("%d\n", min(sum[0], min(sum[1], sum[2])));
return 0;
}
|
#include <cstdio>
#include <algorithm>
using namespace std;
int n,a,b,v;
int c1,c2,c3;
int main()
{
scanf("%d%d%d",&n,&a,&b);
for (int i=1;i<=n;i++)
{
scanf("%d",&v);
if (v<=a)
c1++;
if (a<v&&v<=b)
c2++;
if (b<v)
c3++;
}
printf("%d\n",min(c1,min(c2,c3)));
return 0;
} |
#include "bits/stdc++.h"
using namespace std;
int main()
{
int n, a, b, c[3] = {0, 0, 0};
scanf("%d%d%d", &n, &a, &b);
for(int i = 0, j; i < n; ++i)
{
scanf("%d", &j);
if(j <= a)
{
++c[0];
}
else if(j <= b)
{
++c[1];
}
else
{
++c[2];
}
}
printf("%d\n", *min_element(c, c + 3));
} |
#include <iostream>
using namespace std;
int n, a, b, x, ca, cb, cc;
int main() {
cin>>n>>a>>b;
for(int i=0; i<n; i++) {
cin>>x;
if(x<=a) ca++;
else if(x<=b) cb++;
else cc++;
}
cout<<min(ca, min(cb, cc));
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int N;
int p;
int Ans[4];
int A,B;
int main() {
ios::sync_with_stdio(0);
register int i;
cin>>N>>A>>B;
for(i=1;i<=N;++i) {
cin>>p;
if(p>B) ++Ans[3];
else if(p>A) ++Ans[2];
else ++Ans[1];
} cout<<min(Ans[1],min(Ans[2],Ans[3]))<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,a,b,ans[3]={0,0,0};
cin>>n >>a >>b;
for(int i=0;i<n;i++){
int c; cin>>c;
if(c<=a){
ans[0]++;
}else if(c<=b){
ans[1]++;
}else{
ans[2]++;
}
}
cout<<min({ans[0],ans[1],ans[2]})<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, p, i, x = 0, y = 0, z = 0;
cin >> n >> a >> b;
for (i = 0; i < n; ++i) {
cin >> p;
if (p <= a) {
++x;
} else if (p > b) {
++y;
} else {
++z;
}
}
cout << min(x, min(y, z)) << "\n";
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
using int64 = long long;
int main() {
int N, A, B;
cin >> N >> A >> B;
int v[3] = {};
for(int i = 0; i < N; i++) {
int x;
cin >> x;
if(x <= A) ++v[0];
else if(x <= B) ++v[1];
else ++v[2];
}
cout << min({v[0], v[1], v[2]}) << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, a, b;
cin >> n >> a >> b;
int l1 = 0, l2 = 0, l3 = 0;
while(n--)
{
int x;
cin >> x;
if(x <= a)
l1++;
else
if(x <= b)
l2++;
else
l3++;
}
cout << min(l1, min(l2, l3));
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,A,B;
int sum1=0,sum2=0,sum3=0;
cin>>N>>A>>B;
vector<int> P(N);
for(int i=0;i<N;i++){
cin>>P.at(i);
if(P.at(i)<=A)sum1++;
if(P.at(i)>A&&P.at(i)<=B)sum2++;
if(P.at(i)>B)sum3++;
}
cout<<min(min(sum1,sum2),sum3)<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,a,b;
cin>>n>>a>>b;
int q=0,w=0,e=0;
for (int i = 0; i < n; ++i) {
int t;
cin>>t;
if(t<=a)++q;
else if(t<=b)++w;
else ++e;
}
cout<<min(min(q,w),e)<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int n,a,b;
long long s1,s2,s3;
int main()
{
cin>>n>>a>>b;
for(int i=1,x;i<=n;i++)
{
cin>>x;
if(x<=a)s1++;
else if(x>b)s3++;
else s2++;
}
cout<<min(s1,min(s2,s3))<<endl;
} |
#include <iostream>
using namespace std;
int N,A,B,P[110];
int main(){
cin >> N >> A >> B;
int a = 0,ab = 0,b = 0;
for(int i=0;i<N;i++){
cin >> P[i];
if(P[i]<=A) a++;
else if(P[i]>=B+1) b++;
else ab++;
}
cout << min(a,min(ab,b)) << endl;
} |
#include<iostream>
using namespace std;int x,y,z;
int main(){
int n,a,b;
cin >> n >> a >> b;
while(n --){
int k;
cin >> k;
if(k <=a)
x++;
else
if(k>b)
z++;
else y++;
}
cout << min(x,min(y,z));
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long N,A,B;
cin>>N>>A>>B;
vector<long> p(N);
for(int i=0;i<N;i++) cin>>p[i];
long q1=0,q2=0,q3=0;
for(int i=0;i<N;i++){
if(p[i]<=A) q1++;
else if(p[i]<=B) q2++;
else q3++;
}
cout<<min(q1,min(q2,q3))<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int A = 0, B = 0, C = 0;
for (int i = 0; i < n; i ++) {
int tmp;
cin >> tmp;
if (tmp <= a) A ++;
else if (tmp <= b) B ++;
else C ++;
}
int ans = min(A, min(B, C));
cout << ans << endl;
}
|
#include "bits/stdc++.h"
using namespace std;
int n,a,b,p,A=0,B=0,C=0;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n>>a>>b;
for(int i=0;i<n;i++){
cin>>p;
if(p<=a)
A++;
else if(p<=b)
B++;
else
C++;
}
cout<<min(A,min(B,C));
return 0;
} |
#include <iostream>
#include <algorithm>
using namespace std;
int n, a, b, p, q, r;
int main()
{
cin >> n >> a >> b;
for (int i = 0; i < n; i++)
{
int l;
cin >> l;
if (l <= a)
p++;
else if (l <= b)
q++;
else
r++;
}
cout << min(min(p, q), r) << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n, a, b;
cin >> n >> a >> b;
vector<int> p(n);
int leA = 0, leB = 0;
for(int &e: p){
cin >> e;
if(e <= a) leA++;
if(e <= b) leB++;
}
cout << min(leA, min(leB-leA, n-leB)) << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
int a,b;cin >> a >> b;
int x=0,y=0;
for(int i = 0; i < n; ++i){
int p; cin >> p;
x += p > a;
y += p > b;
}
cout << min({n-x,x-y,y}) << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int a,b,n,p[111],cnt1,cnt2,cnt3;
int main()
{
cin>>n>>a>>b;
for(int i=0;i<n;i++)
{
cin>>p[i];
if(p[i]<=a)
{
cnt1++;
}
else if(p[i]>a && p[i]<=b)
{
cnt2++;
}
else
{
cnt3++;
}
}
cout<<min(cnt1,min(cnt2,cnt3))<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int n,p[1000],a,b,x,y,z;
int main(){
cin>>n>>a>>b;
for(int i=0;i<n;i++){
cin>>p[i];
}
sort(p,p+n);
for(int i=0;i<n;i++){
if(p[i]<=a)x++;
if(p[i]>=a+1&&p[i]<=b)y++;
if(p[i]>=b+1)z++;
}
cout<<min(min(x,y),z)<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int N, A, B;
cin >> N >> A >> B;
int Ales = 0, AB = 0 , Bov = 0;
for (int i=0; i<N; i++){
int P;
cin >> P;
if (P <= A) Ales++;
else if (P<=B) AB++;
else Bov++;
}
cout << min(Ales, min(AB, Bov)) << endl;
}
|
#include <iostream>
#include <cstdio>
using namespace std;
int n, s, t, A, B, a[4];
int main()
{
int i;
cin >> n;
cin >> A >> B;
for (i = 1; i <= n; i++) {
scanf ("%d", &t);
if (t <= A) a[1]++;
else if (t > A && t <= B) a[2]++;
else a[3]++;
}
cout << min(min(a[1], a[2]), a[3]);
return 0;
}
|
#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 P;
cin >> P;
if (P <= A) X++;
else if (P <= B) Y++;
else Z++;
}
cout << min(min(X, Y), Z) << endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,A,B;
cin>>n>>A>>B;
int t1=0,t2=0,t3=0;
for (int i=1;i<=n;i++) {
int x; scanf("%d",&x);
if (x<=A) t1++;
if (x>A && x<=B) t2++;
if (x>B) t3++;
}
cout<<min(t1,min(t2,t3));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, a, b;
cin >> n >> a >>b;
int p;
int f = 0,s = 0,t = 0;
for (int i = 0; i < n; i++)
{
cin >> p;
if(p <= a)f++;
else if(p > b)t++;
else s++;
}
cout << min(f, min(s ,t)) << endl;
} |
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int main(void) {
int n, a, b, p[100], x = 0, y = 0, z = 0;
cin >> n >> a >> b;
for (int k = 0; k < n; k++) {
cin >> p[k];
if (p[k] <= a)x++;
else if (p[k] <= b)y++;
else z++;
}
cout << min({ x, y, z }) << "\n";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define vec(type) vector<type>
int main() {
int n, a, b, p;
cin >> n >> a >> b;
int q1 = 0, q2 = 0, q3 = 0;
for (int i = 0; i < n; i++) {
cin >> p;
if (p <= a) q1++;
else if (a < p && p <= b) q2++;
else q3++;
}
cout << min({q1, q2, q3}) << endl;
} |
#include<bits/stdc++.h>
using namespace std;
#define INF -2147483647
#define mod 1000000007
signed main(){
int a,b,c;
int d,e=0,r=0,f=0;
cin>>a>>b>>c;
for(int i=0;i<a;i++){
cin>>d;
if(d<=b) e++;
if(b+1<=d&&d<=c) f++;
if(d>=c+1) r++;
}
//cout<<e<<f<<r<<"\n";
cout<<min(e,min(f,r))<<"\n";
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,a,b,x=0,y=0,z=0,w;
cin >> n >> a >> b;
for(int i=0;i<n;i++){
cin >> w;
if(w<=a)x++;
else if(w<=b)y++;
else z++;
}
cout << min(x,min(y,z)) << endl;
} |
#include <bits/stdc++.h>
using namespace std;
int p[205];
int main(){
int n,a,b;
cin >> n >> a >> b;
for(int i=0;i<n;i++)
cin >> p[i];
sort(p,p+n);
int ans=0;
int c1=0,c2=0,c3=0;
for(int i=0;i<n;i++){
if(p[i]<=a)
c1++;
else if(p[i]>b)
c3++;
else
c2++;
}
cout << min(c1,min(c2,c3));
} |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main(){
int N,A,B,a=0,b=0,c=0;
cin>>N>>A>>B;
int P[N];
for(int i=0;i<N;i++){
cin>>P[i];
if(P[i]<=A) a++;
else if(P[i]>B) c++;
else b++;
}
cout<<min(a,min(b,c))<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,a,b;
cin>>n>>a>>b;
int c1=0,c2=0,c3=0;
int x;
for(int i=0;i<n;i++){
cin>>x;
if(x<=a)
c1++;
else if(x<=b)
c2++;
else
c3++;
}
cout<<min(c1,min(c2,c3))<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B; cin >> N >> A >> B;
int a=0, ab=0, b=0;
int tmp;
for (int i=0; i<N; i++) {
cin >> tmp;
if (tmp <= A) a++;
else if (tmp > B) b++;
else ab++;
}
cout << min(a, min(ab, b)) << endl;
} |
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int n,a,b;
cin >>n>>a>>b;
int x=0,y=0,z=0;
for(int i=0;i<n;i++){
int temp;
cin >>temp;
if(temp<a+1){
x++;
}else if(temp>b){
z++;
}else{
y++;
}
}
cout <<min(min(x,y),z)<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,a,b,x=0,y=0,z=0;
cin>>n>>a>>b;
for(int i=0; i<n; i++){
int p;
cin>>p;
if(p<=a)x++;
else if(p<=b)y++;
else z++;
}
cout<<min(min(x,y),z)<<endl;
} |
#include "bits/stdc++.h"
using namespace std;
int main() {
int n, a, b;
cin >> n >> a >> b;
int p;
int A = 0, B = 0, C = 0;
for ( int i = 0; i < n; i++ ) {
cin >> p;
if ( p <= a ) A++;
else if ( p <= b ) B++;
else C++;
}
cout << min(A, min(B, C)) << endl;
}
|
#include <iostream>
using namespace std;
int main() {
int n, a, b; cin >> n >> a >> b;
int c1 = 0, c2 = 0, c3 = 0;
while (n--) {
int p; cin >> p;
if (p <= a) c1++;
else if (p <= b) c2++;
else c3++;
}
cout << min(min(c1, c2), c3) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll cnt[3];
int main() {
ll n,a,b,p;
cin>>n>>a>>b;
for(int i=0;i<n;i++){
cin>>p;
if(p<=a)cnt[0]++;
else if(p<=b)cnt[1]++;
else cnt[2]++;
}
cout<<min({cnt[0],cnt[1],cnt[2]})<<endl;
return 0;
} |
#include "bits/stdc++.h"
int main() {
int n, a, b;
std::cin >> n >> a >> b;
std::vector<int> p(n);
for (auto &v : p) {
std::cin >> v;
}
int x = 0, y = 0, z = 0;
for (auto v: p) {
x += v <= a;
y += a < v && v <= b;
z += b < v;
}
std::cout << std::min(x, std::min(y, z)) << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n,l,r,i,x,s1=0,s2=0,s3=0;
int main()
{
scanf("%d",&n);
scanf("%d%d",&l,&r);
for (i=1;i<=n;i++)
{
scanf("%d",&x);
if (x<=l) s1++;
else if (x<=r) s2++;
else s3++;
}
printf("%d",min(min(s1,s2),s3));
return 0;
} |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int N, A, B, P, x[3] = { 0 };
cin >> N >> A >> B;
for (int i = 0; i < N; i++) {
cin >> P;
if (P <= A) x[0]++;
else if (P <= B) x[1]++;
else x[2]++;
}
sort(x, x + 3);
cout << x[0] << endl;
} |
#include <iostream>
using namespace std;
int n,a,b,s,t,u,d;
int main(void){
cin>>n>>a>>b;
for(int i=0;i<n;i++){
cin>>d;
if(a>=d)s++;
else if(a<d&&d<=b)t++;
else u++;
}
cout<<min(min(s,t),u)<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long n,a,b,x=0,y=0,z=0,p;
cin >> n >> a >> b;
for(long i=0;i<n;i++) {
cin >> p;
if(p<=a) x++;
else if(p<=b) y++;
else z++;
}
cout << min(x,min(y,z)) << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,a,b; cin>>n>>a>>b;
int aika=0,aida=0,bkoe=0;
for(int i=0; i<n; i++){
int p; cin>>p;
if(p<=a) aika++;
else if(b+1<=p) bkoe++;
else aida++;
}
cout << min(min(aika,aida),bkoe) << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int c,d,e;
signed main(){
int n,a,b;cin>>n>>a>>b;
for(int i=0;i<n;i++){
int k;cin>>k;
if(k<=a)c++;
else if(k<=b)d++;
else e++;
}
cout<<min({c,d,e})<<endl;
} |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 110;
const int base = 1e9+7;
int n,a[maxn];
ll f[maxn][maxn];
map<int,int> cnt;
vector<int> h;
ll pw(int a,int n) {
if (n==0) return 1ll;
if (n==1) return a;
ll tmp = pw(a,n/2);
tmp = (tmp*tmp)%base;
if (n%2==0) return tmp;
return (tmp*a)%base;
}
int main() {
// freopen("in.txt","r",stdin);
ios_base::sync_with_stdio(0); cin.tie(0);
cin>>n;
for (int i=1;i<=n;i++) {
cin>>a[i];
if (cnt[a[i]]!=0) continue;
h.push_back(a[i]);
cnt[a[i]]=1;
}
cnt.clear();
h.push_back(0);
sort(h.begin(),h.end());
h.erase(unique(h.begin(),h.end()),h.end());
for (int j=0;j<h.size();j++) cnt[h[j]]=j;
for (int j=0;j<h.size();j++)
if (h[j] == 0) f[1][j] = pw(2,a[1]);
else if (h[j] <= a[1]) f[1][j] = pw(2,a[1] - h[j]+1);
for (int i=2;i<=n;i++) {
if (a[i] < a[i-1]) {
int mi = cnt[a[i]];
for (int j=0;j<h.size();j++)
if (h[j] <= a[i])
f[i][j] = (f[i-1][j] + f[i-1][mi])%base;
} else {
int mi = cnt[a[i-1]];
for (int j=0;j<h.size();j++) {
if (h[j] <= a[i-1]) f[i][j] = ((f[i-1][j] + f[i-1][mi])%base * pw(2,a[i] - a[i-1])) % base;
else if (h[j] <= a[i]) f[i][j] = (pw(2,a[i] - h[j]+1) * f[i-1][mi]) % base;
}
}
}
cout<<f[n][0]<<endl;
}
|
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long LL;
const int MOD = (int)1e9 + 7;
int n,m,h[101],hnum[101],dh[101];
LL dp[101][101];
int pow_(int x,int y) {///快速幂求 x的y次方
int ans = 1;
if(y > 0) {
while(y) {
if(y % 2)ans = (LL)ans * x % MOD;
x = (LL)x * x % MOD;
y /= 2;
}
}
return ans;
}
int main() {
scanf("%d",&n);
for(int i = 1;i <= n;i ++) {
scanf("%d",&h[i]);
dh[++ m] = h[i];
}
sort(dh + 1,dh + m + 1);///高度排序
m = unique(dh + 1,dh + m + 1) - dh - 1;///离散化 m是离散化后的长度
for(int i = 1;i <= n;i ++) {
hnum[i] = lower_bound(dh + 1,dh + m + 1,h[i]) - dh;
}
dp[0][0]=1;
for(int i = 1;i <= n;i ++) {
for(int j = hnum[i] + 1;j <= hnum[i - 1];j ++)
(dp[i][0] += dp[i - 1][j] * 2 % MOD) %= MOD;
(dp[i][0] += dp[i - 1][0] * 2 % MOD) %= MOD;///交叉或者不交叉
int d = pow_(2,h[i] - h[i - 1]);
for(int j = 1;j <= min(hnum[i - 1],hnum[i]);j ++) {
dp[i][j] = dp[i - 1][j] * d % MOD;
}
for(int j = hnum[i - 1] + 1;j <= hnum[i];j ++) {///比前一列高出的部分
if(j > 1)(dp[i][j] += dp[i - 1][0] * (pow_(2,dh[j] - dh[j - 1]) - 1) % MOD * 2 % MOD * pow_(2,h[i] - dh[j]) % MOD) %= MOD;
else (dp[i][1] += dp[i - 1][0] * (pow_(2,dh[1]) - 2) % MOD * pow_(2,h[i] - dh[1]) % MOD) %= MOD;///上一列中无重复相同的乘上化不超过上一列高度中有重复的
}
}
LL ans = 0;
for(int i = 0;i <= hnum[n];i++)
(ans += dp[n][i]) %= MOD;
printf("%lld",ans);
return 0;
}
|
#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define SZ(x) ((int)x.size())
#define L(i,u) for (register int i=head[u]; i; i=nxt[i])
#define rep(i,a,b) for (register int i=(a); i<=(b); i++)
#define per(i,a,b) for (register int i=(a); i>=(b); i--)
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef pair<int,int> Pii;
typedef vector<int> Vi;
inline void read(int &x) {
x=0; char c=getchar(); int f=1;
while (!isdigit(c)) {if (c=='-') f=-1; c=getchar();}
while (isdigit(c)) {x=x*10+c-'0'; c=getchar();} x*=f;
}
inline ui R() {
static ui seed=416;
return seed^=seed>>5,seed^=seed<<17,seed^=seed>>13;
}
const int N = 1555,mo=1e9+7,inv2=(mo+1)/2;
int n,a[N],cnt;ll f[N],g[N],h[N];
ll power(ll a, ll n){
ll res=1;
while(n){
if(n&1)res=1LL*res*a%mo;a=1LL*a*a%mo;n>>=1;
}
return res;
}
int solve(int l, int r, int d){
int k=++cnt,mn=2e9;rep(i,l,r)mn=min(mn,a[i]);
Vi ch;int tot=0;rep(i,l,r)tot+=(a[i]==mn);
rep(i,l,r)if(a[i]>mn){
int j;for(j=i;j<=r;j++)if(a[j]<=mn)break;
ch.pb(solve(i,j-1,mn+1));i=j-1;
}
h[k]=mn-d+1;rep(i,0,SZ(ch)-1)h[k]+=h[ch[i]];
g[k]=power(2,h[k]);
int x=power(2,tot),y=2;
rep(i,0,SZ(ch)-1)x=1LL*x*(f[ch[i]]+g[ch[i]]*2LL)%mo,y=1LL*y*g[ch[i]]%mo;
f[k]=(x-y+mo)%mo;
// printf("%d %d %d:%d %d %d\n",l,r,d,f[k],g[k],h[k]);
return k;
}
int main() {
read(n);rep(i,1,n)read(a[i]);int rt=solve(1,n,1);
printf("%lld",(f[rt]+g[rt])%mo);
return 0;
}
|
//21
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 101;
const int lbt = 1e9 + 7;
const int inf = 1e9;
int n;
int h[maxn];
int fast_pow(int a, int t);
pair<int, int> cal(int l, int r, int bot);
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &h[i]);
}
pair<int, int> ans = cal(1, n, 0);
printf("%d", (ans.first + ans.second) % lbt);
return 0;
}
int fast_pow(int a, int t) {
int ans = 1;
for (int i = 31; i >= 0; i--) {
ans = (long long)ans * ans % lbt;
if (t >> i & 1) ans = (long long)a * ans % lbt;
}
return ans;
}
pair<int, int> cal(int l, int r, int bot) {
int minh = inf;
for (int i = l; i <= r; i++) {
minh = min(minh, h[i]);
}
int g = 0;
int prod = 1;
int prod0 = 1;
int last = l;
for (int i = l; i <= r; i++) {
if (h[i] == minh) {
g++;
if (last < i) {
pair<int, int> cur = cal(last, i - 1, minh);
prod = (long long)prod * ((long long)2 * cur.first + cur.second) % lbt;
prod0 = (long long)prod0 * cur.first % lbt;
}
last = i + 1;
}
}
if (last <= r) {
pair<int, int> cur = cal(last, r, minh);
prod = (long long)prod * ((long long)2 * cur.first + cur.second) % lbt;
prod0 = (long long)prod0 * cur.first % lbt;
}
int dp0 = (long long)fast_pow(2, minh - bot) * prod0 % lbt;
int dp1 = ((long long)fast_pow(2, g) * prod + (long long)(lbt - 2) * prod0) % lbt;
return make_pair(dp0, dp1);
} |
#include <bits/stdc++.h>
using namespace std;
const int N = 105;
const int mod = 1000000007;
inline int qp(int a, int b) {
int res = 1;
while (b) {
if (b & 1) res = 1ll * res * a % mod;
a = 1ll * a * a % mod;
b >>= 1;
}
return res;
}
int n, h[N];
pair<int, int> solve(int l, int r, int lim) {
int mn = 0x3f3f3f3f, cntmn = 0;
for (int i = l; i <= r; i++) {
if (h[i] < mn) {
mn = h[i];
cntmn = 1;
} else if (h[i] == mn) cntmn++;
}
pair<int, int> ret;
if (cntmn == r - l + 1) {
ret.first = (qp(2, r - l + 1) - 2 + mod) % mod;
ret.second = qp(2, mn - lim - 1);
return ret;
}
int t0 = 1, t1 = 1;
for (int i = l, lst = l - 1; i <= r + 1; i++) {
if (i > r || h[i] == mn) {
if (lst < i - 1) {
pair<int, int> cur = solve(lst + 1, i - 1, mn);
t0 = 1ll * t0 * (cur.first + 4ll * cur.second % mod) % mod;
t1 = 1ll * t1 * (2ll * cur.second % mod) % mod;
}
lst = i;
}
}
t0 = (t0 - 2 * t1 % mod + mod) % mod;
ret.first = 1ll * t0 * qp(2, cntmn) % mod;
ret.first = (ret.first + 2ll * t1 * (qp(2, cntmn) - 1) % mod) % mod;
ret.second = 1ll * t1 * qp(2, mn - lim - 1) % mod;
return ret;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &h[i]);
pair<int, int> ret = solve(1, n, 0);
int ans = (ret.first + 2ll * ret.second) % mod;
printf("%d\n", ans);
return 0;
} |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long LL;
const int N = 105;
const int MOD = 1000000007;
int n,m,h[N],w[N];
LL dp[N][N];
int pow_(int x,int y) {///快速幂求 x的y次方
int ans = 1;
if(y > 0) {
while(y) {
if(y % 2)ans = (LL)ans * x % MOD;
x = (LL)x * x % MOD;
y /= 2;
}
}
return ans;
}
int main() {
scanf("%d",&n);
for(int i = 1;i <= n;i ++) {
scanf("%d",&h[i]);
w[++ m] = h[i];
}
sort(w + 1,w + m + 1);///高度排序
m = unique(w + 1,w + m + 1) - w - 1;///离散化 m是离散化后的长度
for(int i = 1;i <= n;i ++) {
h[i] = lower_bound(w + 1,w + m + 1,h[i]) - w;
}
dp[0][0]=1;
for(int i = 1;i <= n;i ++) {
for(int j = h[i] + 1;j <= h[i - 1];j ++)
(dp[i][0] += dp[i - 1][j] * 2 % MOD) %= MOD;
(dp[i][0] += dp[i - 1][0] * 2 % MOD) %= MOD;///交叉或者不交叉
int d = pow_(2,w[h[i]] - w[h[i-1]]);
for(int j = 1;j <= min(h[i - 1],h[i]);j ++) {
dp[i][j] = dp[i - 1][j] * d % MOD;
}
for(int j = h[i - 1] + 1;j <= h[i];j ++) {///比前一列高出的部分
if(j > 1)(dp[i][j] += dp[i - 1][0] * (pow_(2,w[j] - w[j - 1]) - 1) % MOD * 2 % MOD * pow_(2,w[h[i]] - w[j]) % MOD) %= MOD;
else (dp[i][1] += dp[i - 1][0] * (pow_(2,w[1]) - 2) % MOD * pow_(2,w[h[i]] - w[1]) % MOD) %= MOD;///上一列中无重复的乘上化不超过上一列高度中有重复的
}
}
LL ans = 0;
for(int i = 0;i <= h[n];i++)
(ans += dp[n][i]) %= MOD;
printf("%lld",ans);
return 0;
}
|
#include <bits/stdc++.h>
#define int long long
using namespace std;
int MOD = 1000000007;
int pw(int a, int b){
if (b == 0) return 1;
if (b == 1) return a;
if (b%2) return ((a * pw(a, b-1)) % MOD);
int rs = pw(a, b/2);
return (rs*rs) % MOD;
}
pair<int, int> solve(vector<int> &v){
int n = v.size();
int mn = 1e12;
for (int i=0; i < n; i++) mn = min(mn, v[i]);
int holes = 0;
vector<pair<int, int> > ress;
vector<int> a, b;
for (int i=0; i < n; i++){
if (v[i] > mn) a.push_back(v[i] - mn);
else{
if (a.size() > 0){
ress.push_back(solve(a));
b.push_back(a.size());
}
a.clear();
holes++;
}
}
if (a.size() > 0){
ress.push_back(solve(a));
b.push_back(a.size());
}
int N = 2;
for (int i=0; i < ress.size(); i++) {
//cout << ress[i].first << " " << ress[i].second << endl;
N *= ress[i].second;
N %= MOD;
}
N %= MOD;
int on = N;
N *= pw(2, mn-1);
N %= MOD;
int R = pw(2, holes);
for (int i=0; i < ress.size(); i++){
int H = (ress[i].first + 2 * ress[i].second) % MOD;
R *= H;
R %= MOD;
}
R -= on;
R %= MOD;
if (R < 0) R += MOD;
return {R, N};
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> v(n);
for (int i=0; i < n; i++){
cin >> v[i];
}
pair<int, int> p = solve(v);
//cout << p.first << " " << p.second << endl;
cout << (p.first + p.second) % MOD << endl;
return 0;
}
|
#include<cstdio>
#include<algorithm>
using namespace std;
int w[110], n, D[110], Mod = 1000000007;
int Pow(int a, long long b) {
int r = 1;
while (b) {
if (b & 1)r = 1ll * r*a%Mod;
a = 1ll * a*a%Mod; b >>= 1;
}
return r;
}
int main() {
int i, j, k;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &w[i]);
}
D[0] = 1;
w[n + 1] = 1;
for (i = 1; i <= n + 1; i++) {
D[i] = D[i - 1] * 2 % Mod;
for (j = 1; j < i; j++) {
int b = max(w[i], w[j - 1]), e = w[j] - 1;
long long s = 0;
for (k = j; k < i; k++) {
e = min(e, w[k] - 1);
s += max(w[k + 1] - w[k], 0);
}
if (b <= e) {
int t1 = Pow(2, w[j] - 1 - e);
int t2 = Pow(2, e - b + 1) - 1;
int t3 = Pow(2, s);
D[i] = (D[i] + 4ll * D[j - 1] * t1 % Mod* t2%Mod * t3)%Mod;
}
}
}
printf("%lld\n", 1ll*D[n + 1]*((Mod+1)/2)%Mod);
} |
#include <bits/stdc++.h>
using namespace std;
const long long mod=1000000007ll;
void ad(long long &a,long long b){a+=b;a%=mod;}
void mn(long long &a,long long b){a+=mod-b;a%=mod;}
void ml(long long &a,long long b){a*=b;a%=mod;}
long long sq(long long a){return a*a%mod;}
long long pw(long long a,long long n)
{
return n==0?1ll:sq(pw(a,n/2))*(n%2==1?a:1ll)%mod;
}
long long iv(long long a){return pw(a,mod-2);}
int main()
{
int n;
scanf("%d",&n);
long long h[110],X[110];
X[0]=0;
for(int i=0;i<n;i++){
scanf("%lld",h+i);
X[i+1]=h[i];
}
sort(X,X+n+1);
int r[110];
for(int i=0;i<n;i++){
r[i]=lower_bound(X,X+n+1,h[i])-X;
}
long long dp[110][110];
for(int j=0;j<=r[0];j++){
dp[0][j]=(j==0?1ll:2ll)*pw(2ll,X[r[0]]-X[j])%mod;
}
for(int i=1;i<n;i++){
if(r[i-1]<=r[i]){
for(int j=0;j<=r[i-1];j++){
dp[i][j]=(dp[i-1][j]+dp[i-1][r[i-1]])%mod*pw(2ll,X[r[i]]-X[r[i-1]])%mod;
}
for(int j=r[i-1]+1;j<=r[i];j++){
dp[i][j]=2ll*dp[i-1][r[i-1]]%mod*pw(2ll,X[r[i]]-X[j])%mod;
}
}
else{
for(int j=0;j<=r[i];j++){
dp[i][j]=(dp[i-1][j]+dp[i-1][r[i]])%mod;
}
}
}
printf("%lld\n",dp[n-1][0]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int md = (int) 1e9 + 7;
inline int add(int x, int y) {
x += y;
if (x >= md) x -= md;
if (x < 0) x += md;
return x;
}
inline int mul(int x, int y) {
return 1ll * x * y % md;
}
inline int power(int x, int y) {
int r = 1;
while (y > 0) {
if (y & 1) r = mul(r, x);
x = mul(x, x);
y >>= 1;
}
return r;
}
const int N = 105;
int dp[N][N];
int main() {
int n;
cin >> n;
vector<int> a(n + 1, 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= n; j++) {
if (a[j] > a[i]) continue;
if (a[j] < a[i - 1]) {
int bef = (a[i] < a[i - 1] ? i : i - 1);
dp[i][j] = mul(add(dp[i - 1][j], dp[i - 1][bef]), power(2, a[i] - a[i - 1]));
} else {
dp[i][j] = mul(2 * dp[i - 1][i - 1], power(2, a[i] - a[j]));
}
}
}
cout << dp[n][0] << '\n';
}
|
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;
#define MOD 1000000007
#define ADD(X,Y) ((X) = ((X) + (Y)%MOD) % MOD)
typedef long long i64; typedef vector<int> ivec; typedef vector<string> svec;
int N;
i64 H[100];
i64 modpow(i64 a, int pw)
{
if (pw == 0) return 1;
i64 ret = modpow(a, pw / 2);
ret = ret * ret % MOD;
if (pw % 2 == 1) ret = ret * a % MOD;
return ret;
}
pair<i64, i64> solve(int l, int r, i64 base)
{
i64 lowest = 1001001001;
for (int i = l; i < r; ++i) lowest = min(lowest, H[i]);
i64 alt = 2, nalt = 1;
int start = -1; bool flg = false; int nl = 0;
for (int i = l; i < r; ++i) {
if (H[i] != lowest) {
if (start == -1) start = i;
if (i == r - 1 || H[i + 1] == lowest) {
auto tmp = solve(start, i + 1, lowest);
start = -1;
alt = alt * tmp.first % MOD * 2 % MOD;
nalt = nalt * (tmp.first * 2 + tmp.second) % MOD;
alt = alt * (MOD + 1) / 2 % MOD;
flg = true;
}
} else {
nalt = nalt * 2 % MOD;
++nl;
}
}
ADD(nalt, MOD - alt);
alt = alt * modpow(2, (lowest - base - 1)) % MOD;
return {alt, nalt};
}
int main()
{
scanf("%d", &N);
for (int i = 0; i < N; ++i) scanf("%lld", H + i);
auto sol = solve(0, N, 0);
i64 ret = (sol.first + sol.second) % MOD;
printf("%lld\n", ret);
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.