中国DOS联盟

Originally posted by youxi01 at 2007-3-3 06:48 PM:
The code is as follows, welcome to test and correct.

@echo off

setlocal enabledelayedexpansion

set num=0

for /f %%n in (test.txt) do (

    set /a i+=1

    set gn!i!=%%n

)

for /l %%i in (1,1,36) do ... 



While compressing the recursive array range, it also compresses the possibility of finding the result.

It's relatively difficult to implement with high-level languages, let alone batch processing, as the efficiency is too low.

So, the actual numbers of digits are in cases like 35, 36, 37, 38, etc.

Sort and then filter combinations where the sum of the units digit and the tens digit is 80 (because the result requires 171780). After filtering, then find the combinations.

Originally posted by electronixtar at 2007-3-10 06:42 PM:

Sort, then filter combinations where the sum of the units digit and tens digit is 80 (since the result requires 171780). After filtering, then find the combinations.

Before referring to qzwqzw's code, such an idea had already been tried.
The code was only halfway written when it was discovered that when writing the filter for , it was purely a detour.

Because filtering also requires enumerating permutations and combinations..... Hehe....

Why not just give the result directly? If that's the case, what's the use of sorting... Hehe.....