toj_2869.cpp

Tianjin University Online Judge 的80多道题目 .

/*2869.   Nuanran's Game Time Limit: 1.0 Seconds   Memory Limit: 65536K    Special Judge
Total Runs: 314   Accepted Runs: 100


Recently, nuanran is bored at the QQ Game-LianLianKan. So he defines a new game himself, namely Nuanran's Game.

There are infinite stones. Every time nuanran can do one of the following three operations.

1. Get x stones.
2. Get y stones.
3. Throw z stones.

Nuanran wants to know how to get n stones finally. Can you help him?
Input
The input consists of several test cases. Each test case consists of four integers x, y, z, n in a single line. (0 ≤ x, y, z, n ≤ 200)

The input will terminated by the end of file.
Output
For each input test case, if nuanran can get n stones, output a single line with the times of getting x stones, the times of getting y stones and the times of throwing z stones, separated by spaces. Otherwise output -1 in a single line.

Please note your answer must fit into 32 signed bits.
Sample Input

2 4 3 5
2 4 2 5

Sample Output

2 1 1
-1

Note: Special judge problem, you may get "Wrong Answer" when output in wrong format.


Source: TJU Team Selection Contest 3*/
#include<cstdio>
int main()
{
  short int  a , b , c , x , y , z , n;
  while ( scanf( "%hd%hd%hd%hd" , &x , &y , &z , &n ) != EOF )
    {
      for ( a = 1; a <= 200; a++ )
	{
	  for ( b = 1; b <= 200; b++ )
	    {
	      for ( c = 1; c <= 200; c++ )
		{
		  if ( a * x + b * y - c * z == n )
		    {
		      printf( "%hd %hd %hd\n" , a , b , c );
		      goto end;
		    }
		}
	    }
	}
      printf( "-1\n" );
    end:;
    }
  return 0;
}