CF385E.Bear in the Field

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Our bear's forest has a checkered field. The checkered field is an n×nn×n table, the rows are numbered from 1 to nn from top to bottom, the columns are numbered from 1 to nn from left to right. Let's denote a cell of the field on the intersection of row xx and column yy by record (x,y)(x,y) . Each cell of the field contains growing raspberry, at that, the cell (x,y)(x,y) of the field contains x+yx+y raspberry bushes.

The bear came out to walk across the field. At the beginning of the walk his speed is (dx,dy)(dx,dy) . Then the bear spends exactly tt seconds on the field. Each second the following takes place:

  • Let's suppose that at the current moment the bear is in cell (x,y)(x,y) .
  • First the bear eats the raspberry from all the bushes he has in the current cell. After the bear eats the raspberry from kk bushes, he increases each component of his speed by kk . In other words, if before eating the kk bushes of raspberry his speed was (dx,dy)(dx,dy) , then after eating the berry his speed equals (dx+k,dy+k)(dx+k,dy+k) .
  • Let's denote the current speed of the bear (dx,dy)(dx,dy) (it was increased after the previous step). Then the bear moves from cell (x,y)(x,y) to cell (((x+dx1) mod n)+1,((y+dy1) mod n)+1)(((x+dx-1) mod n)+1,((y+dy-1) mod n)+1) .
  • Then one additional raspberry bush grows in each cell of the field.

You task is to predict the bear's actions. Find the cell he ends up in if he starts from cell (sx,sy)(sx,sy) . Assume that each bush has infinitely much raspberry and the bear will never eat all of it.

输入格式

The first line of the input contains six space-separated integers: nn , sxsx , sysy , dxdx , dydy , tt (1<=n<=109; 1<=sx,sy<=n; 100<=dx,dy<=100; 0<=t<=1018)(1<=n<=10^{9}; 1<=sx,sy<=n; -100<=dx,dy<=100; 0<=t<=10^{18}) .

输出格式

Print two integers — the coordinates of the cell the bear will end up in after tt seconds.

输入输出样例

  • 输入#1

    5 1 2 0 1 2
    

    输出#1

    3 1
  • 输入#2

    1 1 1 -1 -1 2
    

    输出#2

    1 1

说明/提示

Operation a mod ba mod b means taking the remainder after dividing aa by bb . Note that the result of the operation is always non-negative. For example, (1) mod 3=2(-1) mod 3=2 .

In the first sample before the first move the speed vector will equal (3,4) and the bear will get to cell (4,1). Before the second move the speed vector will equal (9,10) and he bear will get to cell (3,1). Don't forget that at the second move, the number of berry bushes increased by 1.

In the second sample before the first move the speed vector will equal (1,1) and the bear will get to cell (1,1). Before the second move, the speed vector will equal (4,4) and the bear will get to cell (1,1). Don't forget that at the second move, the number of berry bushes increased by 1.

首页