CodeForces--Platforms

Description

In one one-dimensional world there are n platforms. Platform with index k (platforms are numbered from 1) is a segment with coordinates [(k - 1)m, (k - 1)m + l], and l < m. Grasshopper Bob starts to jump along the platforms from point 0, with each jump he moves exactly d units right. Find out the coordinate of the point, where Bob will fall down. The grasshopper falls down, if he finds himself not on the platform, but if he finds himself on the edge of the platform, he doesn't fall down.

Input

The first input line contains 4 integer numbers n, d, m, l (1 ≤ n, d, m, l ≤ 10⁶, l < m) — respectively: amount of platforms, length of the grasshopper Bob's jump, and numbers m and l needed to find coordinates of the k-th platform: [(k - 1)m, (k - 1)m + l].

Output

Output the coordinates of the point, where the grosshopper will fall down. Don't forget that if Bob finds himself on the platform edge, he doesn't fall down.

Sample Input

Input

2 2 5 3

Output

4

Input

5 4 11 8

Output

20

题目大意：输入四个数n，d，m，l。给你一个一维坐标，有n个平台，有个东西在平台上跳，d为跳的间隔，m为区间，l代表平台的长度，求那个东西跳落平台的一维坐标。

第16组数据超时了

#include <iostream>
#include <stdio.h>
using namespace std;
int main()
{
    __int64 n,d,m,l,k,j,start,ending;
    while(cin>>n>>d>>m>>l)
    {
        j=ending=0;
        __int64 dlen=m-l;//平台与平台的间距
        __int64 slen=n*l+(n-1)*dlen;//到最后一个平台的距离
        bool flag=true;
        while(ending<=slen)
        {
            start=j*m;//第j+1个平台的左边坐标
            ending=(j+1)*m-dlen;//第j+1个平台的右边坐标
            j++;
            for(k=0; k<=slen/d; k++)
            {
                if(k*d>ending && k*d< ending+ dlen)//落下的坐标在平台与平台之间
                {
                    printf("%I64d\n",k*d);
                    flag=false;
                    break;
                }
                if(k*d>ending)//下落坐标在最后一个平台之外
                    break;
            }
            if(!flag)
                break;
        }
        if(flag)
          printf("%I64d\n",k*d);
    }
    return 0;
}

真的想不出了，就百度了一下，看了之后好简单

#include <iostream>
#include <stdio.h>
using namespace std;
int main()
{
    __int64 n,d,m,l,right,left,step;
    while(scanf("%I64d%I64d%I64d%I64d",&n,&d,&m,&l)!=EOF)
    {
        for(int i=1; i<=n; i++)
        {
            left=(i-1)*m;//第i个平台的左边坐标
            right=left+l;//第i个平台的右边坐标
            step=right/d+1;//跳出第i个平台的步数
            if(step*d<left+m)//跳出平台的步数小于i+1平台的左边坐标就代表落下平台了。
               break;
        }
        printf("%I64d\n",step*d);
    }
    return 0;
}