A - Multiplication Dilemma (思维)（ 2018 ACM ICPC Arabella Collegiate Programming Contest）

滴答滴答---题目链接

Multiplication operation is not always easy! For example, it is hard to calculate 27 × 20 using your mind, but it is easier to find the answer using the following methods: 30 × 20 - 3 × 20. It turns out that people can calculate the multiplication of two special numbers very easily.

A number is called special if it contains exactly one non-zero digit at the beginning (i.e. the most significant digit), followed by a non-negative number of zeros. For example, 30, 7, 5000 are special numbers, while 0, 11, 8070 are not.

In this problem, you are given two numbers a and b. Your task is to calculate the multiplication of a and b (a × b), by writing the multiplication expression as a summation or subtraction of multiplication of special numbers. Can you?

Input

The first line contains an integer T (1 ≤ T ≤ 104) specifying the number of test cases.

Each test case consists of a single line containing two integers aand b ( - 109 ≤ a, b ≤ 109, a ≠ 0, b ≠ 0), as described in the problem statement above.

Output

For each test case, print a single line containing the multiplication expression of a and b as a summation or subtraction of multiplication of special numbers. All special numbers must be between - 109 and 109(inclusive). If there are multiple solutions, print any of them. It is guaranteed that an answer always exists for the given input.

The multiplication expression must be printed in exactly one line. A single term must be printed as in which z and w are both special numbers, # represents a single space, and x represents the multiplication operation. Two consecutive terms must be printed as in which z and w are both special numbers, #represents a single space, represents the multiplication operation, and represents either the addition operation + or the subtraction operation - . (Check the sample output for more clarification).

Example

Input

特殊数：

如果一个数字的开头恰好包含一个非零的数字(即最有效的数字)，
后跟一个非负数的零，那么这个数字就称为特殊数字。

2
55 20
70 17

Output

方法一：

#include <iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
int main()
{int t;scanf("%d",&t);while(t--){int a,b;scanf("%d%d",&a,&b);int s1,s2,s3,s4;s1=s2=s3=s4=0;if(a%10!=0){s1=(a/10+1)*10;s2=(10-a%10);}if(b%10!=0){s3=(b/10+1)*10;s4=(10-b%10);}if(s1==0&&s2==0&&s3==0&&s4==0){printf("%d x %d \n",a,b);}else if(s3==0&&s4==0){printf("%d x %d - %d x %d\n",s1,b,s2,b);}else if(s1==0&&s2==0){printf("%d x %d - %d x %d\n",a,s3,a,s4);}else printf("%d x %d + %d x %d - %d x %d - %d x %d\n",s1,s3,s2,s4,s1,s4,s2,s3);}return 0;
}

A - Multiplication Dilemma (思维)（ 2018 ACM ICPC Arabella Collegiate Programming Contest）相关推荐

2018 ACM ICPC Arabella Collegiate Programming Contest A
Multiplication operation is not always easy! For example, it is hard to calculate 27 × 20 using your ...
2015 ACM Arabella Collegiate Programming Contest（F题）
F. Palindrome [ Color: Pink ] A string is palindrome if it can be read the same way in either direct ...
2017 ACM Arabella Collegiate Programming Contest(solved 11/13)
省选考前单挑做点ACM练练细节还是很不错的嘛- 福利:http://codeforces.com/gym/101350 先来放上惨不忍睹的virtual participate成绩(中间跑去食堂吃饭于 ...
Gym - 101972B Arabella Collegiate Programming Contest (2018) B. Updating the Tree 树DFS
题面题意:T组数据,每次给你1e5个点的树(1为根),每个点有一权值,询问1-n每个节点的子树中, 至少修改几个点的权值(每次都可以任意修改),才能让子树中任意2点的距离==他们权值差的绝对值无解 ...
2017 ACM Arabella Collegiate Programming Contest div2的题，部分题目写个题解
F. Monkeying Around 维护点在多少个线段上 http://codeforces.com/gym/101350/problem/F 题意:有m个笑话,每个笑话的区间是[L, R], ...
Codeforces Gym 2015 ACM Arabella Collegiate Programming Contest
比赛链接: http://codeforces.com/gym/100676 题目链接: http://codeforces.com/gym/100676/attachments/download/3 ...
2015 ACM Arabella Collegiate Programming Contest
题目链接:https://vjudge.net/contest/154238#overview. ABCDE都是水题. F题,一开始分类讨论,结果似乎写挫了,WA了一发.果断换并查集上,A了. G题, ...
Codeforces Gym 2015 ACM Arabella Collegiate Programming Contest（二月十日训练赛）
A(By talker): 题意分析:以a(int) op b(int)形式给出两个整数和操作符, 求两个整数是否存在操作符所给定的关系 ,有则输出true,无则输出false:思路:由于无时间复杂度 ...
2017 ACM Arabella Collegiate Programming Contest G. Snake Rana GYM101350G
先算一下总的子矩阵个数总共最多只有20个点状压一下然后枚举容斥一下把求出来的答案减去包含1个点的子矩阵再加上包含2个点的减去3个点的-- #include <iostream> # ...

A - Multiplication Dilemma (思维)（ 2018 ACM ICPC Arabella Collegiate Programming Contest）

A - Multiplication Dilemma (思维)（ 2018 ACM ICPC Arabella Collegiate Programming Contest）相关推荐

最新文章

热门文章