提交记录 #90

编译情况：编译成功

code.c: In function ‘fight’:
code.c:13:9: warning: value computed is not used [-Wunused-value]
   13 |         *lose++;
      |         ^~~~~~~
code.c:21:1: warning: control reaches end of non-void function [-Wreturn-type]
   21 | }
      | ^

固定测试点#1:

Wrong Answer

0.000s

228 kB

固定测试点#2:

Wrong Answer

0.000s

228 kB

附加测试点暂不可用

不可用

N/A

29a【大学】寻找矩阵的鞍点

#include<stdio.h>
int fight(int *head,int *brave,int *lose,int *num,int n,int m,int i,int j){
    if (head[i]<=brave[j]){
        *num+=brave[j];
        if (i==n-1){
            printf("%d\n",*num);
        }
        else {
            fight(head,brave,lose,num,n,m,i+1,j+1);
        }
    }
    else {
        *lose++;
        if (*lose>m-n){
            printf("bit is doomed!\n");
        }
        else {
            fight(head,brave,lose,num,n,m,i,j+1);
        }
    }
}
int main(){
    int n,m;
    scanf("%d %d",&n,&m);
    int i,j;
    int head[n];
    int brave[m];
    for (i=0;i<n;i++){
        scanf("%d",&head[i]);
    }
    for (i=0;i<m;i++){
        scanf("%d",&brave[i]);
    }
    if (n>m){
        printf("bit is doomed!\n");
        return 0;
    }
    for (i=0;i<n;i++){
        for (j=0;j<n-1;j++){
            if (head[j+1]<head[j]){
                int change=head[j];
                head[j]=head[j+1];
                head[j+1]=change;
            }
        }
    }
    for (i=0;i<m;i++){
        for (j=0;j<m-1;j++){
            if (brave[j+1]<brave[j]){
                int change=brave[j];
                brave[j]=brave[j+1];
                brave[j+1]=change;
            }
        }
    }
    int lose=0;
    int num=0;
//    int *h=head;
//    int *b=brave;
//    int *lose=&number_lose;
//    int *num=&number_num;
//    i=0;
//    j=0;
    fight(head,brave,&lose,&num,n,m,0,0);
    return 0;
}