信息學集訓隊作業(yè)程序puzzle-unknow

1、Sourcefile:puzzle.c,cppSourcefile:puzzle.c,cpp Input file: puzzle.inOutputfile:puzzle of the type to be considered here looks like this:To a given set of equations containing symbols instead of digits, a substitutionforeachofthesymbolsbyoneofthedigits0,.,9must this, you know what a tedious task this

2、 might be.TheYouaregivenasetofequationscontainingthesymbolsA,.,J.Finda substitutionofthedigits0,.,9forthesesymbolssothatallofthe digit.Allnumbersarepositive,andthefirstdigitofeachnumbermust not be zero. If several solutions exist, only the lexicographically smallest substitution should be printed.Th

3、eThe input consists of multiple EachscenariostartswithalineEachscenariostartswithalinegivingthenumbernofequations,nin therange1n10.Ineachofthefollowingnlinesyouwillfindan equation. The syntax looks like that:line=argument1+|-|*|/argument2=result argument1 = digit digit*argument2=digitdigit* result =

4、 digit digit*digit =A |. |NotethatnotallthesymbolsAtoJmightappearintheequations. Nevertheless, if one of them appears, then all letters lexicographically smallerthanthisone appearaswell. Allnumbersinvolvedareguaranteed to have a maximum of 9 digits.Input is terminated by a line with TheFor each scenario print a line containing the thealphabeticallyorderedlistofsymbolsthatappearedinthesetofequations an arrow -,the lexicographically smallest substitution of digits for the symbols in the list. If solut