codeforces #165 div2

// 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;
}
时间: 2024-09-20 17:58:31

codeforces #165 div2的相关文章

codeforces #164 div2

http://codeforces.com/problemset/problem/268/A http://codeforces.com/problemset/problem/268/B http://codeforces.com/problemset/problem/268/C // cf #164 div2 A  #include<stdio.h> int a[30],b[30]; int main(){ //freopen("input.txt","r&qu

Codeforces Round #157 (Div. 1) C. Little Elephant and LCM (数学、dp)

C. Little Elephant and LCM time limit per test 4 seconds memory limit per test 256 megabytes input standard input output standard output The Little Elephant loves the LCM (least common multiple) operation of a non-empty set of positive integers. The

Codeforces B. Taxi 算法题解

简单总结题意: 有一个数组,数组中的数值不会大于4,即只能是1,2,3,4,要把这些数值装进一个容量最大为4的容器里面,使得所用到这样的容器的个数最小. 经测试数据很大,会有10万个数据,所以这里我并不用排序数据,而是使用counting sort的思想,根据特定的数据优化,使得题解时间复杂度为O(n). 更多精彩内容:http://www.bianceng.cnhttp://www.bianceng.cn/Programming/sjjg/ 程序如下: #include <iostream>

CodeForces 233B Non-square Equation

链接: http://codeforces.com/problemset/problem/233/B 题目: B. Non-square Equation time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Let's consider equation: x2+s(x)·x-n=0, where x,n are positive

CodeForces:200C: Football Championship

地址链接: CF:  http://codeforces.com/problemset/problem/200/C HUST Virtual Judge: http://acm.hust.edu.cn:8080/judge/problem/viewProblem.action?id=28923 题目: C. Football Championship time limit per test 2 seconds memory limit per test 256 megabytes input s

UVa 165:Stamps, 连续邮资问题

题目链接: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=108 类型: 回溯 原题: The government of Nova Mareterrania requires that various legal documents have stamps attached to them so that the government can derive revenue fro

Codeforces Round #205 (Div. 2) / 353C Find Maximum (贪心)

Valera has array a, consisting of n integers a0,a1,...,an-1, and function f(x), taking an integer from 0 to 2n-1 as its single argument. Value f(x) is calculated by formula , where value bit(i) equals one if the binary representation of number xconta

Codeforces Round #201 (Div. 1) / 346A Alice and Bob:数论&amp;amp;想法题

A. Alice and Bob http://codeforces.com/problemset/problem/346/A time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output It is so boring in the summer holiday, isn't it? So Alice and Bob have inven

算法:CodeForces #196(Div. 2) 337D Book of Evil(树形dp)

题意 给一棵n个结点的树,任意两个节点的距离是指连接两点的最短的边数 在树上的某个结点 有一个"恶魔之书",这本书会让距离它d以内的节点都受到影响 已知有m个节点收到了影响,问最多有几 个结点可能放着"恶魔之书"? 思路 要判断某个点是不是放着书,就要判断这个点的周围d距离以 内是否包含所有受影响的m节点 而如果某个节点距离最远的那个受影响节点的距离是L,如果L <= d,那 么说明所有受影响的m节点都在d以内,就可判断这个点可能放着书 那么,我们只要能够求出