Tên đăng nhập | Điểm ▾ | Bài tập | Giới thiệu | ||
---|---|---|---|---|---|
35001 |
|
0 | 0 |
|
|
35001 |
Lê Xuân Lâm
|
0 | 0 |
Not My Githup:https://github.com/OceanGithupVN |
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
Vy
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
dấd |
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 | ||
35001 |
|
0 | 0 | ||
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
sdsf |
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
Nhap Ho Va ten
|
0 | 0 |
|
|
35001 |
Nhap Ho Va ten
|
0 | 0 |
|
|
35001 |
Nhap Ho Va ten
|
0 | 0 |
|
|
35001 |
Nhap Ho Va ten
|
0 | 0 |
|
|
35001 |
Nhap Ho Va ten
|
0 | 0 |
|
|
35001 |
Nhap Ho Va ten
|
0 | 0 |
|
|
35001 |
Nhap Ho Va ten
|
0 | 0 |
|
|
35001 |
Nhap Ho Va ten
|
0 | 0 |
|
|
35001 |
Nhap Ho Va ten
|
0 | 0 |
|
|
35001 |
Nhap Ho Va ten
|
0 | 0 |
|
|
35001 |
Nhap Ho Va ten
|
0 | 0 |
|
|
35001 |
Nhap Ho Va ten
|
0 | 0 |
|
|
35001 |
Nhap Ho Va ten
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
n, k = map(int, input().split()) dp = [0] * (k+1) for i in range(3, k+1): for j in range(n): print(dp[k]) |
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|
|
35001 |
|
0 | 0 |
|