HDU 4952 Number Transformation (query rule)

HDU 4952 Number Transformation (query rule)

 

Perform K operations. The I operation converts X to the maximum integer not less than X, and X is a multiple of I. The value of X after K operations.

The violence of the red fruit will time out. The brute-force table shows a pattern after 12000. The difference between the following two is constant.

 

 

 

AC code:

 

 

# Include

 
  
# Define ll _ int64const ll maxn = 120000; int main () {ll I; ll x, k; int cas = 1; while (scanf (% I64d % I64d, & x, & k )! = EOF) {if (x = 0 & k = 0) break; printf (Case # % d:, cas ++); if (k <= maxn) {for (I = 1; I <= k; I ++) if (x % I! = 0) x = I * (x/I + 1); printf (% I64d, x);} else {ll y; for (I = 1; I <= maxn; I ++) if (x % I! = 0) x = I * (x/I + 1); y = I * (x/I + 1); printf (% I64d, x + (k-maxn) * (y-x) ;}} return 0 ;}