sgu150: Mr. Beetle II

最新推荐文章于 2021-05-12 14:01:10 发布

原创最新推荐文章于 2021-05-12 14:01:10 发布 · 618 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

sgu 专栏收录该内容

26 篇文章

订阅专栏

本文介绍了一个使用枚举算法解决特定几何问题的C++程序实例。该程序通过输入两点坐标及步数来寻找符合条件的第三点，并详细展示了如何利用枚举算法进行精确计算。

枚举。

#include <cstdio>
#define abs(x) ((x) < 0 ? -(x) : (x))
inline int read()
{
    int x = 0, f = 1, t = getchar();
    while(t < '0' || t > '9') t == '-' ? f = -1 : 0, t = getchar();
    while(t >= '0' && t <= '9') x = (x<<1) + (x<<3) + t - '0', t = getchar();
    return x * f;
}
void work()
{
    int x1 = read(), y1 = read(), x2 = read(), y2 = read(), n = read();

    if(x1 == x2 || y1 == y2) { puts("no solution"); return ; }

    int tx = x2-x1, ty = y2-y1, sum = 0;
    bool dx = tx < 0, dy = ty < 0;
    tx = abs(tx), ty = abs(ty);

    for(int x = 0; x < tx; ++x)
    {
        long long k1 = (long long)ty * x, k2 = (long long)ty * (x+1);
        sum += k2/tx - k1/tx + (k2 % tx > 0);
        if(sum >= n)
        {
            int xx = x, yy = k2 / tx - (sum - n) - (k2 % tx == 0);
            if(dx) xx = -xx-1;
            if(dy) yy = -yy-1;
            printf("%d %d\n", xx+x1, yy+y1);
            return ;
        }
    }
    puts("no solution");
}
int main()
{
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif

    work();

    #ifndef ONLINE_JUDGE
    fclose(stdin);
    fclose(stdout);
    #endif
    return 0;
}