uva11490

注意到S<=1e12，当S取到最大值时候，每个方块外部的士兵厚度仅有68041，可以考虑枚举士兵厚度求解。

#include
using namespace std;
typedef long long LL;
const long long mod = 1e8 + 7;
LL S;
int main()
{
    while (scanf("%lld", &S) == 1 && S) {
        int ok = 0;
        for (LL r = 1; 6 * r*r < S; r++) {
            if ((S - 6 * r*r) % (7 * r))continue;
            LL x = (S - 6*r*r) / (7*r);
            if (6 * r*r + 7 * x*r == S) {
                ok = 1;
                x %= mod;
                LL res = (x * x * 2) % mod;
                printf("Possible Missing Soldiers = %lld\n", res);
            }
        }
        if (!ok) {
            printf("No Solution Possible\n\n");
            continue;
        }
        else printf("\n");
    }
}