POJ 2590 Steps (ZOJ 1871)

 

Question:

For two dots a and B, it is required to move from a to B. The number of each moving step is greater than or equal to or less than 1 in the previous step. Calculate the minimum number of steps. (The start and end steps must be 1)

 

Ideas:

Directly symmetric.

For example:

1-> 7

Can be 1 2 2 1

1-> 9

1 2 3 2 1

50

1 2 3 4 5 6 7 6 5 4 3 2 1

 

The two OJ input formats are different ..

Below is the POJ's:

 

# Include

 
  
Int main () {int T; scanf (% d, & T); while (T --) {int a, B; scanf (% d, &, & B); if (a = B) {printf (0); continue;} int target = B-a; int sum = 0; int step = 1; int ans = 0; while (sum * 2 + 2 * step

  
   
ZOJ:

   
 

   
 

   
# Include

    
     
Int main () {int a, B; while (~ Scanf (% d, & a, & B) {if (a = B) {printf (0); continue;} int target = B-; int sum = 0; int step = 1; int ans = 0; while (sum * 2 + 2 * step