codeforces 900A. Find Extra One
来源:互联网 发布:php开发实例大全 编辑:程序博客网 时间:2024/05/29 00:30
题意:给你N个点,问能否通过去除一个点使得所有点都在Y轴的同侧。
思路:统计Y轴左边和右边点的个数,较小的那个大于2就是NO。
#include<iostream>using namespace std;const int MAXN = 1e5 + 5;int main(){int n;while(~scanf("%d",&n)){int l = 0, r = 0;for(int i = 0; i < n; i++){int x,y;scanf("%d%d", &x, &y);if(x > 0) l++;else if(x < 0) r++;}if(min(l, r) > 1) printf("No\n");else printf("Yes\n");}return 0;}
阅读全文
0 0
- codeforces 900A. Find Extra One
- A. Find Extra One
- codeforces 900C. Remove Extra One
- Codeforces 900C-Remove Extra One
- Codeforces 900C Remove Extra One
- codeforces 900C. Remove Extra One
- 【Codeforces 900C】Remove Extra One(BIT思维)
- 900AFind Extra One
- codeforces Remove Extra One(思维)
- Codeforces Round #450 (Div. 2) C. Remove Extra One 暴力
- Codeforces Beta Round #36 / 36A Extra-terrestrial Intelligence(模拟)
- Codeforces 699A One Bomb
- Find Extra One_Codeforces_900A
- Remove Extra One Codeforces Round #450 (Div. 2)(线段树)
- codeforces 40A. Find Color
- codeforces 804A Find Amir
- 【CodeForces】699A - One Bomb(思维)
- CodeForces 721A One-dimensional Japanese Crossword
- 删除图表中的数据系列:Excel图表学习记第7课
- 工程计算1——引论
- HashMap
- 区分不用的URL的请求
- druid的简单使用
- codeforces 900A. Find Extra One
- 如何在Eclipse下查看JDK源代码以及java源代码阅读方法
- OpenCV、OpenCL、OpenGL、OpenMP
- leetcode 477. Total Hamming Distance 任意两个数字的汉明距离之和
- AtCoder Beginner Contest 081
- 用python修改dns解析文件
- 12.12笔记
- 专项支出用款申请单:全民学Excel第六季
- Mathematical Statistics and Data Analysis笔记