UVA10167 Birthday Cake【暴力】

Lucy and Lily are twins. Today is their birthday. Mother buys a birthday cake for them. Now we put the cake onto a Descartes coordinate. Its center is at (0, 0), and the cake’s length of radius is 100.
    There are 2N (N is a integer, 1 ≤ N ≤ 50) cherries on the cake. Mother wants to cut the cake into two halves with a knife (of course a beeline). The twins would like to be treated fairly, that means, the shape of the two halves must be the same (that means the beeline must go through the center of the cake) , and each half must have N cherrie(s). Can you help her?
    Note: the coordinate of a cherry (x, y) are two integers. You must give the line as form two integers A, B (stands for Ax + By = 0) each number mustn’t in [−500, 500]. Cherries are not allowed lying on the beeline. For each dataset there is at least one solution.

Input
The input file contains several scenarios. Each of them consists of 2 parts:
    The first part consists of a line with a number N, the second part consists of 2N lines, each line has two number, meaning (x, y). There is only one space between two border numbers. The input file is ended with N = 0.
Output
For each scenario, print a line containing two numbers A and B. There should be a space between them. If there are many solutions, you can only print one of them.
Sample Input
2
-20 20
-30 20
-10 -50
10 -5
0
Sample Output
0 1

问题链接：UVA10167 Birthday Cake
问题简述：
给定2N 个点，求A和B为多少时，直线Ax+By=0 把点分成相等的两部分。
问题分析：
本题可以用暴力法来解决。把点带入直线方程Ax+By=0，那么大于0的是一边，小于0的是另外一边，枚举A和B，统计一下就可以。
程序说明：（略）
参考链接：（略）
题记：（略）

AC的C++程序如下：

/* UVA10167 Birthday Cake */#include <iostream>using namespace std;const int LEFT = -500, RIGHT = 500;
const int N = 50;
int x[N * 2], y[N * 2];int main()
{int n;while(~scanf("%d", &n) && n) {n *= 2;for(int i = 0; i < n; i++)scanf("%d%d", &x[i], &y[i]);bool flag = true;for(int a = LEFT; a <= RIGHT && flag; a++)for(int b = LEFT; b <= RIGHT ; b++) {if(a==0 && b==0 ) continue;int i, cnt = 0;     // 统计满足AX+BY>0的点数目for(i = 0; i < n; i++) {if(a * x[i] + b * y[i] > 0) ++cnt;else if(a * x[i] + b * y[i] == 0) break;}if( i < n) continue;if(cnt == n / 2) {printf("%d %d\n", a, b);flag = false;break;}}}return 0;
}

UVA10167 Birthday Cake【暴力】相关推荐

AOAPC I: Beginning Algorithm Contests 题解
AOAPC I: Beginning Algorithm Contests 题解 AOAPC I: Beginning Algorithm Contests (Rujia Liu) - Virtual ...
ICPC程序设计题解书籍系列之八：(美)斯基纳等：《挑战编程-程序设计竞赛训练手册》
S书<挑战编程--程序设计竞赛训练手册>题目一览 1 Getting Started UVA100 POJ1207 HDU1032 The 3n + 1 problem[水题] - 海岛B ...
备战NOIP每周写题记录（一）···不间断更新
※Recorded By ksq2013 //其实这段时间写的题远远大于这篇博文中的内容,只不过那些数以百记的基础题目实在没必要写在blog上; ※week one 2016.7.18 Monday ...
问题 J: Frosting on the Cake
问题 J: Frosting on the Cake 时间限制: 1 Sec 内存限制: 128 MB 提交: 159 解决: 56 [提交][状态][讨论版][命题人:admin] 题目描述 I ...
[Cake] 1. CI中的Cake
在上一篇C#Make自动化构建-简介中,简单的介绍了下Cake的脚本如何编写以及通过Powershell或者Bash在本地运行Cake脚本.本篇在此基础上,介绍下如何在CI环境中使用Cake. 1. ...
喵哈哈村的魔法考试 Round #1 (Div.2) 题解源码(A.水+暴力，B.dp+栈)
A.喵哈哈村的魔法石发布时间: 2017年2月21日 20:05 最后更新: 2017年2月21日 20:06 时间限制: 1000ms 内存限制: 128M 描述传说喵哈哈村有三种神 ...
哑谜，回文和暴力之美
暴力搜索是一个有趣的东西.至少刘汝佳是这么认为的.编程之美的4.10节就是典型的暴力题.虽然作者将其难度定义为一颗星,但却不能因此认为这个类型的问题就是那么容易的,很多可能需要一些有创造力的想法. 不 ...
Leetcode 15.三数之和双指针 or 暴力哈希
题目链接:传送门题目:给你一个包含 n 个整数的数组 nums,判断 nums 中是否存在三个元素 a,b,c ,使得 a + b + c = 0 ?请你找出所有和为 0 且不重复的三元组. 暴力+ ...
HDU - 5875 2016 ACM/ICPC 大连网络赛 H题暴力
题目链接题意:给你一个区间l,r一直将val[l]模上val[l+1],val[l+2]...val[r],因为一个模上比前一个数小数是没有意义的,所以需要将每一个点找到右边第一个小于他的点就行. ...

UVA10167 Birthday Cake【暴力】

UVA10167 Birthday Cake【暴力】相关推荐

最新文章

热门文章