diff options
| author | Georg Brandl <georg@python.org> | 2008-05-01 18:06:50 (GMT) |
|---|---|---|
| committer | Georg Brandl <georg@python.org> | 2008-05-01 18:06:50 (GMT) |
| commit | b03c1d98a26a265c81c17f71799449f801ecd1d1 (patch) | |
| tree | 84b8c3fc910199768476e76598787d910307ff33 /Doc/tutorial/controlflow.rst | |
| parent | de4296281a1e00f486425e1d63b51f771bd4eeaa (diff) | |
| download | cpython-b03c1d98a26a265c81c17f71799449f801ecd1d1.zip cpython-b03c1d98a26a265c81c17f71799449f801ecd1d1.tar.gz cpython-b03c1d98a26a265c81c17f71799449f801ecd1d1.tar.bz2 | |
Don't output floats in prime example.
Diffstat (limited to 'Doc/tutorial/controlflow.rst')
| -rw-r--r-- | Doc/tutorial/controlflow.rst | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/Doc/tutorial/controlflow.rst b/Doc/tutorial/controlflow.rst index 4404ab2..dee6e7c 100644 --- a/Doc/tutorial/controlflow.rst +++ b/Doc/tutorial/controlflow.rst @@ -166,7 +166,7 @@ following loop, which searches for prime numbers:: >>> for n in range(2, 10): ... for x in range(2, n): ... if n % x == 0: - ... print(n, 'equals', x, '*', n/x) + ... print(n, 'equals', x, '*', n//x) ... break ... else: ... # loop fell through without finding a factor |