算法题目

DavidHsin

# Randomly fills a grid of size height and width whose values are input by the user,
# with nonnegative integers randomly generated up to an upper bound N also input the user,
# and computes, for each n <= N, the number of paths consisting of all integers from 1 up to n
# that cannot be extended to n+1.
# Outputs the number of such paths, when at least one exists.


from random import seed, randint
import sys
from collections import defaultdict


def display_grid():
    for i in range(len(grid)):
        print('   ', ' '.join(str(grid[i][j]) for j in range(len(grid[0]))))

def get_paths():
    pass
# Replace pass above with your code

# Insert your code for other functions
   
try:
    for_seed, max_length, height, width = [int(i) for i in
                                                  input('Enter four nonnegative integers: ').split()
                                       ]
    if for_seed < 0 or max_length < 0 or height < 0 or width < 0:
        raise ValueError
except ValueError:
    print('Incorrect input, giving up.')
    sys.exit()

seed(for_seed)
grid = [[randint(0, max_length) for _ in range(width)] for _ in range(height)]
print('Here is the grid that has been generated:')
display_grid()
paths = get_paths()
if paths:
    for length in sorted(paths):
        print(f'The number of paths from 1 to {length} is: {paths[length]}')

DavidHsin

1. # Randomly fills a grid of size height and width whose values are input by the user,
   
2. # with nonnegative integers randomly generated up to an upper bound N also input the user,
   
3. # and computes, for each n <= N, the number of paths consisting of all integers from 1 up to n
   
4. # that cannot be extended to n+1.
   
5. # Outputs the number of such paths, when at least one exists.
   
6. 
   
7. 
   
8. 
   
9. from random import seed, randint
   
10. import sys
    
11. from collections import defaultdict
    
12. 
    
13. 
    
14. def display_grid():
    
15.     for i in range(len(grid)):
    
16.         print('   ', ' '.join(str(grid[i][j]) for j in range(len(grid[0]))))
    
17. 
    
18. def get_paths():
    
19.     pass
    
20.     # Replace pass above with your code
    
21. 
    
22. # Insert your code for other functions
    
23.    
    
24. try:
    
25.     for_seed, max_length, height, width = [int(i) for i in
    
26.                                                   input('Enter four nonnegative integers: ').split()
    
27.                                        ]
    
28.     if for_seed < 0 or max_length < 0 or height < 0 or width < 0:
    
29.         raise ValueError
    
30. except ValueError:
    
31.     print('Incorrect input, giving up.')
    
32.     sys.exit()
    
33. 
    
34. seed(for_seed)
    
35. grid = [[randint(0, max_length) for _ in range(width)] for _ in range(height)]
    
36. print('Here is the grid that has been generated:')
    
37. display_grid()
    
38. paths = get_paths()
    
39. if paths:
    
40.     for length in sorted(paths):
    
41.         print(f'The number of paths from 1 to {length} is: {paths[length]}')

复制代码

DavidHsin

不知应该从何入手，请大神指点迷津