【類比】HDU 4134

來源:互聯網
上載者:User

類比不解釋

int a[110];int main(){    int t;    scanf("%d",&t);    int ca = 1;    while(t--){        int n;        scanf("%d",&n);        int i,j;        for(i=1;i<=n;i++)scanf("%d",&a[i]);        int win = 0;        i = 1,j = n;        while(1){            if(j-i+1==2){                if(a[1]>a[2])win = 1;                else win = 2;                break;            }            int ii = i,jj = j;            while(ii<=jj){                a[ii++] += a[jj--];            }            i = 1,j = (j+1)/2;        }        printf("Case #%d: ",ca++);        if(win==1)puts("Alice");        else if(win==2)puts("Bob");    }    return 0;}

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.