Problem:
Score : 300 points

Problem Statement

Sitting in a station waiting room, Joisino is gazing at her train ticket.

The ticket is numbered with four digits A, B, C and D in this order, each between 0 and 9 (inclusive).

In the formula A op1 B op2 C op3 D = 7, replace each of the symbols op1, op2 and op3 with + or - so that the formula holds.

The given input guarantees that there is a solution. If there are multiple solutions, any of them will be accepted.

Constraints

0≤A,B,C,D≤9

All input values are integers.

It is guaranteed that there is a solution.

Input

Input is given from Standard Input in the following format:

ABCD

Output

Print the formula you made, including the part =7.

Use the signs + and -.

Do not print a space between a digit and a sign.

Sample Input 1

1222

Sample Output 1

1+2+2+2=7

This is the only valid solution.

Sample Input 2

0290

Sample Output 2

0-2+9+0=7

0 - 2 + 9 - 0 = 7 is also a valid solution.

Sample Input 3

3242

Sample Output 3

3+2+4-2=7

Solution in C (GCC 5.4.1) (judge verdict: Wrong Answer)


#include<stdio.h>
#include<string.h>

int univcnt = 0;
char kigoa[8][3] = {};
char str[8] = {};
int hoge(int n,char kigo){
  if(n==2){
    str[n] = kigo;
    strcpy(kigoa[univcnt],str);
    univcnt++;
  }else{
    str[n] = kigo;
    hoge(n+1,'+');
    hoge(n+1,'-');
  }
}
int main(){
  int a = 0;
  char c[4] = {};
  int b[3] = {};
  int i = 0;
  int j = 0;
  int init = 0;
  scanf("%c%c%c%c",&c[0],&c[1],&c[2],&c[3]);
  a = c[0]-'0';
  b[0] = c[1]-'0';
  b[1] = c[2]-'0';
  b[2] = c[3]-'0';
  //printf("%d/",a);
  /*for(i=0;i<8;i++){
    //printf("%d/",b[i]);
    printf("%s",kigoa[i]); 
  }*/
  
  hoge(0,0);
  hoge(0,1);
  for(i=0;i<8;i++){
    init = a;
    for(j=0;j<3;j++){
      if(kigoa[i][j] == '+'){
        init += b[j];
        c[j] = '+';
      }else{
        init -= b[j];
        c[j] = '-';
      }
    }
    
  
  if(init == 7){  
    printf("%d%c%d%c%d%c%d=7",a,c[0],b[0],c[1],b[1],c[2],b[2]); 
    break;
    }
  }
    
    
    
  return 0;
}