• 先取不败游戏


    #include<stdio.h>
    #include<stdlib.h>
    #include<time.h>
    void main()
    {
        int j,k,n,a,b,t,c[1000],d[1000];
        a=b=0;
        t=time(0)%1000;
        srand(t);
        printf("序列中2n个整数,请确定n:");
        scanf("%d",&n);
        for(j=1;j<=2*n;j++)
        {
            c[j]=rand()%(2*n)+2;
            d[j]=c[j];
        }
        printf("序列的%d个整数以产生,每次只显示两端整数。
    ",2*n);
        printf("A先取,A,B轮流取,直至取完。
    ");
        for(k=1;k<=2*n;k++)
        {
            if(k<2*n)
                printf("
      两端数为:%2d,%2d",d[k],d[2*n]);
            else
                printf("
      只剩下一个数:%2d",d[2*n]);
            if(k%2==1)
            {
                t=d[k];
                if(t<d[2*n])
                {
                    t=d[2*n];
                    for(j=2*n;j>=k+1;j--)
                        d[j]=d[j-1];
                }
                a=b+t;
                printf("  A取数:%2d",t);
            }
            else
            {
                printf("  B取数:");
                scanf("%d",&t);
                if(t==d[k]||t==d[2*n])
                {
                    b=b+t;
                    if(t==d[2*n])
                    {
                        for(j=2*n;j>=k+1;j--)
                            d[j]=d[j-1];
                    }
                }
                else
                {
                    printf("  A取数有错误,重新开始!");
                    return;
                }
            }
        }
        printf("  原序列的%d个整数为:",2*n);
        for(j=1;j<=2*n;j++)
            printf("  %d",c[j]);
        printf("
      最后得分为A=%d,B=%d",a,b);
        if(a>b)
            printf("
      此游戏A胜!
    ");
        else if(a<b)
            printf("
      此游戏B胜!
    ");
        else
            printf("
      此游戏A,B平手!
    ");
    }

  • 相关阅读:
    Longest Palindromic Substring
    PayPal MLSE job description
    Continuous Median
    Remove Duplicates From Linked List
    Valid IP Address
    Longest substring without duplication
    Largest range
    Subarray sort
    Multi String Search
    Suffix Trie Construction
  • 原文地址:https://www.cnblogs.com/liao-pxsoftware15/p/8196744.html
Copyright © 2020-2023  润新知