() Function to solve the problem with a range

range () function Chinese translation range of the Sequence header in the range of not trailer

for val in range(5):
    print(val)

1 0
2 1
3 2
4 3
5 4

Jiujiuchengfa formulas table for column i represents the row j

. 1  # I control line 
2  for I in Range (. 1, 10 ):
 . 3      # J control column 
. 4      for J in Range (. 1, I +. 1 ):
 . 5          Print ( " % D *% D =% D   " % (I , J, I * J), End = "" )
 . 6  
. 7      Print ()

1 1*1=1  
2 2*1=2  2*2=4  
3 3*1=3  3*2=6  3*3=9  
4 4*1=4  4*2=8  4*3=12  4*4=16  
5 5*1=5  5*2=10  5*3=15  5*4=20  5*5=25  
6 6*1=6  6*2=12  6*3=18  6*4=24  6*5=30  6*6=36  
7 7*1=7  7*2=14  7*3=21  7*4=28  7*5=35  7*6=42  7*7=49  
8 8*1=8  8*2=16  8*3=24  8*4=32  8*5=40  8*6=48  8*7=56  8*8=64  
9 9*1=9  9*2=18  9*3=27  9*4=36  9*5=45  9*6=54  9*7=63  9*8=72  9*9=81 

 

Obtaining prime numbers less than 100, and outputs a list of the number of mass

Tip: prime number is defined as a natural number greater than 1, in addition to itself and no longer has a number of other factors is referred to as a prime number, such as: 2,3,5,7, 11,13,17,19 and the like.

1  # define a list 
2 NUM = []
 . 3 I = 2
 . 4  # acquired 2--99 integer 
. 5  for I in Range (2, 100 ):
 . 6      for J in Range (2 , I):
 . 7          # determines whether conditions is a prime number, if there is an integer smaller than his divisible, then out of the loop 
. 8          IF I% J == 0:
 . 9              BREAK 
10      # the else and the inner layer is used for loop. When not out of the inner loop, else statement can be executed, or not executed. 
. 11      the else :
 12 is          num.append (I)
 13 is  Print (NUM)