Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Blog
числа с несовпадающими цифрами
//fpc 3.0.0 program HelloWorld; const n = 7; var i, j, k , fl, count : int64; m : array [1..n] of integer; begin count := 0; for i := 1111111 to 9999999 do begin j := i; k := n; while j > 0 do begin m[k] := j mod 10; j := j div 10; k -= 1; end; fl := 1; for k := 1 to n-1 do for j := k+1 to n do if (m[k] = m[j]) or (m[k] = 0) or (m[j] = 0)then fl := 0; if fl = 1 then begin {for j := 1 to n do write(m[j]); writeln;} count += 1; end; end; writeln(count); end.
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
Blanko char
Localisation ND
Pasha
123456
11.7.2013 naloga2
sumar 2 valores
1 25 6
test02
homework
JONES
Please log in to post a comment.