Bzoj 3858 Number Transformation number theory

Title: Given n,k,i from 1 to K loop over, each time n is updated to a multiple of I, the first one greater than or equal to N to the final n

Tease problem ...

We'll find that when I>=sqrt (n), Ceil (n/i) is the same every time--

↑ can't understand the note that N is a change

So when I>=sqrt (n) only need to output ceil (n/i) *k can

The other way is basically stuck--

#include <cstdio> #include <cstring> #include <iostream> #include <algorithm>using namespace Std;int Cnt;long Long N,k;int Main () {Long long i;while (cin>>n>>k,n| | k) {for (i=2;i<=k;i++) {long temp= (n+i-1)/i;if (temp<=i) {n=temp*k;break;} N=temp*i;} printf ("Case #%d:%lld\n", ++cnt,n);} return 0;}

Bzoj 3858 Number Transformation number theory