UvaOJ 10167

暴力搜索

#include<cstdio>

struct node
{
    int x;
    int y;
}s[10000];
int main()
{
    //freopen("input.txt","r",stdin);
    int a,b,n,num;
    int i;
    bool flag;
    while(scanf("%d",&n) && n)
    {
        for(i = 0; i < 2 * n; i++)
            scanf("%d%d",&s[i].x,&s[i].y);
        flag = 0;
        for(a = -500 ; a <= 500; a++)
        {
            for(b = -500; b <= 500; b++)
            {
                num = 0;
                if(a == 0 && b == 0) continue;
                for(i = 0; i < 2 * n; i++)
                {
                    if(a * s[i].x + b * s[i].y > 0) num++;
                    if(a * s[i].x + b * s[i].y == 0) break;
                }
                if(i == 2 * n && num == n)
                {
                    flag = 1;
                    break;
                }
            }
            if(flag) break;
        }
        printf("%d %d
",a,b);
    }

    return 0;
}