Solved: qow 15: backwards addition (all solutions will be graded)

so x + y + z = 900

is 123+ 456 + 321 a bad answer? (the reuse of 123?)

ASKER

>so x + y + z = 900
yes

>is 123+ 456 + 321 a bad answer? (the reuse of 123?)
yes, thats a bad answer because the digits 1 2 3 are re-used

meikl ;-)

God_Ares

note: i don't say b:=true or b:=false
i use
b:=1=1; and b:=1=0;

here is my solution:

unit Unit1;

interface

uses
Windows, Messages, SysUtils, Classes, Graphics, Controls, Forms, Dialogs,
StdCtrls;

type

Tcall = Procedure(a,b,c:integer) of object;

TMyThread = Class(TThread)
private
fa,fb,fc:integer;
fRow : array [1..9] of byte;
fres:integer;
fcall : tcall;
protected
procedure Execute; override;
procedure SolFound;
Constructor Create(value : integer; call : Tcall);
end;

TForm1 = class(TForm)
Memo1: TMemo;
Edit1: TEdit;
Label1: TLabel;
Button2: TButton;
Button3: TButton;
procedure Button2Click(Sender: TObject);
procedure Button3Click(Sender: TObject);
procedure FormClose(Sender: TObject; var Action: TCloseAction);
private
{ Private declarations }
Ftr : TMyThread;
procedure add(x,y,z:Integer);
procedure done(Sender: TObject);
public
{ Public declarations }
end;

var
Form1: TForm1;

implementation

{$R *.DFM}

procedure Tform1.add(x,y,z:Integer);
Begin
memo1.lines.add(
IntToStr(x)
+' + '
+IntToStr(y)
+' + '
+IntToStr(z)
+' = '
+ Edit1.Text);

end;

Constructor TMyThread.Create(value:integer; call : Tcall);
var i:integer;
Begin
fres := value;
for i:=1 to 8 do
fRow[i] := i;
fRow[9] := 8;

fcall := call;
inherited create(false);
end;

Procedure TMyThread.SolFound;
Begin
fcall(fa,fb,fc)
end;

Procedure TMyThread.Execute;

procedure next;
var i:word;
carry:boolean;
Begin
carry := 1=0;
inc(fRow[9]); if fRow[9]>9 then
Begin
carry := 1=1;
fRow[9] := 1;
end;
for i:=8 downto 1 do
Begin
if carry then
Begin
inc(fRow[i]); if fRow[i]>9 then
Begin
carry := 1=1;
fRow[i] := 1;
end else
carry := 1=0;
end;
end;
end;

function check_No_double : boolean;
var i,j:byte;
b:boolean;
begin
b:=1=1;
for i:=1 to 8 do
for j:=i+1 to 9 do
b:= b and (Frow[i]<>Frow[j]);
result := b;
end;

procedure makenumber;
Begin
fa:=(frow[1]*100)+(frow[2]*10)+(frow[3]);
fb:=(frow[4]*100)+(frow[5]*10)+(frow[6]);
fc:=(frow[7]*100)+(frow[8]*10)+(frow[9]);
end;

Begin
repeat
next;
IF check_No_double Then
Begin
makenumber;
if (fa+fb+fc) = fres then
Synchronize(SolFound);
end;
until (terminated) or ((fa=987)and(fb=654)and(fc=321));
end;

procedure TForm1.Button2Click(Sender: TObject);
begin
Ftr := TMyThread.Create(StrToInt(Edit1.text),add);
button2.Enabled := 1=0;
button3.Enabled := 1=1;
ftr.OnTerminate := done;
end;

procedure Tform1.done(Sender: TObject);
Begin
button2.Enabled := 1=1;
button3.Enabled := 1=0;
end;

procedure TForm1.Button3Click(Sender: TObject);
begin
button3.Enabled := 1=0;
button2.Enabled := 1=1;

if assigned(Ftr) then
Begin
ftr.Terminate;
ftr.WaitFor;
end;
end;

procedure TForm1.FormClose(Sender: TObject; var Action: TCloseAction);
begin
if assigned(Ftr) then
Begin
ftr.Terminate;
ftr.WaitFor;
end;

end;

end.

God_Ares

so there are ok?

..
135 + 268 + 497 = 900
135 + 276 + 489 = 900
135 + 279 + 486 = 900
135 + 286 + 479 = 900
135 + 289 + 476 = 900
135 + 297 + 468 = 900
135 + 298 + 467 = 900
135 + 467 + 298 = 900
135 + 468 + 297 = 900

etc...