Codeforces Round #521 (Div. 3)-A. Frog Jumping

A. Frog Jumping

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

A frog is currently at the point 00 on a coordinate axis OxOx. It jumps by the following algorithm: the first jump is aa units to the right, the second jump is bb units to the left, the third jump is aa units to the right, the fourth jump is bb units to the left, and so on.

Formally:

• if the frog has jumped an even number of times (before the current jump), it jumps from its current position xx to position x+ax+a;
• otherwise it jumps from its current position xx to position x−bx−b.

Your task is to calculate the position of the frog after kk jumps.

But... One more thing. You are watching tt different frogs so you have to answer tt independent queries.

Input

The first line of the input contains one integer tt (1≤t≤10001≤t≤1000) — the number of queries.

Each of the next tt lines contain queries (one query per line).

The query is described as three space-separated integers a,b,ka,b,k (1≤a,b,k≤1091≤a,b,k≤109) — the lengths of two types of jumps and the number of jumps, respectively.

Output

Print tt integers. The ii-th integer should be the answer for the ii-th query.

Example

input

Copy

6
5 2 3
100 1 4
1 10 5
1000000000 1 6
1 1 1000000000
1 1 999999999

output

Copy

8
198
-17
2999999997
0
1

Note

In the first query frog jumps 55 to the right, 22 to the left and 55 to the right so the answer is 5−2+5=85−2+5=8.

In the second query frog jumps 100100 to the right, 11 to the left, 100100 to the right and 11 to the left so the answer is 100−1+100−1=198100−1+100−1=198.

In the third query the answer is 1−10+1−10+1=−171−10+1−10+1=−17.

In the fourth query the answer is 109−1+109−1+109−1=2999999997109−1+109−1+109−1=2999999997.

In the fifth query all frog's jumps are neutralized by each other so the answer is 00.

The sixth query is the same as the fifth but without the last jump so the answer is 11.

题意：给你 t 组数据 ，每组数据由  a , b , k 组成  ， 当青蛙跳偶次数步数时加 a ， 奇数次时时 减 b。

一共k 步 ， 问最终青蛙的位置。

这样一来就很简单了 ， 求K以内的奇偶数 ， 再乘以a , b 。 再互减就好了

代码：

#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
	ll t , a , b , k;
	scanf("%lld" , &t);
	while(t--)
	{
		long long ans = 0;
		scanf("%lld %lld %lld" , &a , &b , &k);
		if(k % 2 == 0)
		{
			ans = ans + k/2 *a;
			ans = ans - k/2 *b; 
		}
		else
		{
			ans = ans + (k/2+1) *a;
			ans = ans - k/2*b; 
		}
		printf("%lld\n" , ans);
	}
	return 0;
 }