35
25
Combinations
Let there be cards with the letter
“
”
, cards with the
letter
“
”
and cards with the letter
“
”
written on them.
Then number of possible different ways to arrange all
cards in a row, is given by:
Program
？→ Ａ：？→ Ｂ：？→ Ｃ：
（Ａ ＋ Ｂ ＋ Ｃ）！÷ Ａ！÷ Ｂ！÷ Ｃ！→ Ｙ：Ｙ ＜
33 STEP
＞
INPUT A, B, C, : number of cards showing “A”, “B” and “C” respectively
OUTPUT Y : the number of combinations
Execution Example:
How many combinations are possible for 3
“
”
s, 2
“
”
s and 2
“
”
s?
A
A
B
B
C
C
A B
×
C
×
(
)
:
:
C
C
C
B
B
B
A
A
A
A
A
A
C
a
b
c
+ +
a
C
b
b
c
+
×
a
b
c
+ +
(
)
!
a
!
b
c
+
(
)
!
----------------------------- b
c
+
(
)
!
b
!
c
!
-------------------
a
b
c
+ +
(
)
!
a
!
b
!
c
!
-----------------------------
=
=
a
!
1
2
×
…
×
a
×
=
0
!
1
=
ON
MODE
MODE
MODE
1
PRGM
MODE
1
COMP
1
P1
A
B
C
Prog
1
S A
D R
P1
P1 P2 P3 P4
G
3
EXE
S A
D R
P1
P1 P2 P3 P4
G
2
EXE
S A
D R
P1
P1 P2 P3 P4
G
2
EXE
S A
D R
P1
P1 P2 P3 P4
G
関数電卓事例集
.book 35
ページ
２００２年９月２日 月曜日 午後６時５１分
Summary of Contents for 3950P
Page 1: ......
Page 46: ...MEMO MEMO MEMO MEMO...
Page 47: ...Authors Dr Yuichi Takeda Research and Development Initiative Chuo University...
Page 48: ......
