第十四届蓝桥杯集训——练习解题阶段(无序阶段)-ALGO-641 下次上什么课

#include<stdio.h>
int result[5],T,count;
void f(int k,int h){
  if(k==T){
    result[h]++;
    count++;
    return;
  }
  else{
    switch(h){
      case 1:
        f(k+1,2);
        f(k+1,4);
        break;
      case 2:
        f(k+1,3);
        break;
      case 3:
        f(k+1,2);
        f(k+1,1);
        break;
      case 4:
        f(k+1,3);
        f(k+1,1);
    }
  }
}
int main(){
  
  int H,i,max=1;
  
  scanf("%d%d",&H,&T);
  
  f(0,H);
  
  for(i=1;i<=4;i++){
    if(result[i]>result[max]){
      max=i;
    }
  }
  
  printf("%d %d",max,count);
  
  return 0;
}

#include <iostream>
#include <stack>
using namespace std;
int h, t;
int p[10] = {0};
int count = 0;
void ss(int a, int c)
{
 if (c > t)
  return;
 
 if (c == t)
 {
  p[a]++;
  count++;
  return;
 }
 
 if (a == 1)
 {
  ss(2, c + 1);
  ss(4, c + 1);
 }
 
 if (a == 2)
 {
  ss(3, c + 1);
 }
 
 if (a == 3)
 {
  ss(2, c + 1);
  ss(1, c + 1);
 }
 
 if (a == 4)
 {
  ss(3, c + 1);
  ss(1, c + 1);
 }
 
}
int main()
{
 cin >> h >> t;
 ss(h, 0);
 int m = -1, c = 0; 
 for (int i = 1; i < 5; i++)
 {
  if (p[i] > m)
  {
   m = p[i];
   c = i;
  }
 }
 
 cout << c << " " << count;
 return 0;
}

import java.util.Scanner;
public class Main {
    static int H;
    static int T;
    static int count = 0;
    static int[] a = new int[4];
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        H = sc.nextInt();
        T = sc.nextInt();
        int x = 0;
        def(0,H);
        if(a[0]>=a[1]&&a[0]>=a[2]&&a[0]>=a[3]){
            x = 1;
            System.out.print(x+" "+count);
            return;
        }
        if(a[1]>=a[0]&&a[1]>=a[2]&&a[1]>=a[3]){
            x = 2;
            System.out.print(x+" "+count);
            return;
        }
        if(a[2]>=a[1]&&a[2]>=a[0]&&a[2]>=a[3]){
            x = 3;
            System.out.print(x+" "+count);
            return;
        }
        if(a[3]>=a[1]&&a[3]>=a[2]&&a[3]>=a[0]){
            x = 4;
            System.out.print(x+" "+count);
        }
    }
    static void def(int i,int h){
        if(i==T){
            count++;
            a[h-1]++;
            return;
        }
        if(h==1){
            def(i+1,2);
            def(i+1,4);
        }
        if(h==2){
            def(i+1,3);
        }
        if(h==3){
            def(i+1,1);
            def(i+1,2);
        }
        if(h==4){
            def(i+1,1);
            def(i+1,3);
        }
    }
}

H,T = map(int,input().split())
poss = [0 for i in range(4)]
def classes(num,count) :
    if count == T-1 :
        if num == 1 :
            poss[1]+=1
            poss[3]+=1
        elif num == 2 :
            poss[2]+=1
        elif num == 3 :
            poss[0]+=1
            poss[1]+=1
        else :
            poss[0]+=1
            poss[2]+=1
        return
    else : 
        if num == 1 :
            count += 1
            
            classes(2,count)
            classes(4,count)
        elif num == 2 :
            count += 1
            
            classes(3,count)
        elif num == 3 :
            count += 1
            
            classes(1,count)
            classes(2,count)
        else :
            count += 1
            
            classes(1,count)
            classes(3,count)
classes(H,0)
print(poss.index(max(poss))+1,sum(poss))