sgu 150 分类： sgu 2015-04...

转载于 2015-04-28 17:42:00 发布 · 290 阅读

0 ·

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

原文链接：http://www.cnblogs.com/dashgua/p/4723034.html

本文介绍了一种解决特定数学问题的算法实现，通过C++编程语言，利用向量和比较函数来找出满足条件的坐标点，该算法适用于寻找两点间线性路径上的第n个点。

算是数学题吧。

#include<map>
#include<queue>
#include<stack>
#include<ctime>
#include<cmath>
#include<string>
#include<cstdio>
#include<utility>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>

const int INF = 1<<30;

struct Vector{int x,y;Vector(int x = 0,int y = 0):x(x),y(y){}};

bool flag = false;

int cmp(int a,int b)
{
    if(b > a)
        return 1;
    else if(b < a)
        return -1;
    else  
        return 0; 
}
int main()
{
    Vector move;
    int x1,x2,y1,y2,n; 
    int ansx,ansy;
    int sx,sy,cnt = 0;

#ifndef ONLINE_JUDGE
    freopen("sgu150.in","r",stdin);
    freopen("sgu150.out","w",stdout);
#endif

    std::cin >> x1 >> y1 >> x2 >> y2 >> n;

    sx = cmp(x1,x2), sy = cmp(y1,y2);
    move = Vector(abs(x2-x1),abs(y2-y1));

    if(move.x && move.y) 
     for(int x = 1, yl = 0, yn, yt; x <= abs(x2-x1) && !flag ; x ++)
     {
        yn = (long long)x*move.y/move.x;
        yt = (long long)x*move.y%move.x;

        cnt += yn - yl + (yt?1:0);

        if(cnt >= n) 
        {
            flag = true;
            ansx = x - 1, ansy = yn - (cnt-n) - (yt?0:1);
            if(sx < 0) ansx = -(ansx + 1);
            if(sy < 0) ansy = -(ansy + 1);
            ansx += x1, ansy += y1;
        }

        yl = yn;
     }

     if(flag) std::cout << ansx << ' ' << ansy << std::endl;
     else     std::cout << "no solution" << std::endl;


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