codeforces #165 div2

來源:互聯網
上載者:User
 // div2 A#include <stdio.h>int main(){    int i,j,n,T;    scanf("%d",&T);    while(T--){        scanf("%d",&n);        if(n>=180||n<=0){            printf("NO\n");            continue;        }        if (360%(180-n)==0) printf("YES\n");        else printf("NO\n");    }    return 0;} // div2 B#include<stdio.h>int x[100005];int main(){   // freopen("input.txt","r",stdin);  int n,i;  scanf("%d",&n);  int sum=0;  for(i=0;i<n;i++)     scanf("%d",&x[i]);     for(i=n-2;i>=0;i--)     if(x[i]>x[i+1])           break;  printf("%d\n",i+1);  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.