Submission #2409062
Source Code Expand
N,X = map(int, input().split(" "))
m = []
for i in range(N):
n = int(input())
m.append(n)
X -= n
print(len(m) + X//min(m))
Submission Info
| Submission Time | |
|---|---|
| Task | B - Bitter Alchemy |
| User | Ryuno |
| Language | Python (3.4.3) |
| Score | 200 |
| Code Size | 148 Byte |
| Status | AC |
| Exec Time | 17 ms |
| Memory | 2940 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 200 / 200 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | a01, a02, a03 |
| All | a01, a02, a03, b04, b05, b06, b07, b08, b09, b10, b11, b12, b13 |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| a01 | AC | 17 ms | 2940 KiB |
| a02 | AC | 17 ms | 2940 KiB |
| a03 | AC | 17 ms | 2940 KiB |
| b04 | AC | 17 ms | 2940 KiB |
| b05 | AC | 17 ms | 2940 KiB |
| b06 | AC | 17 ms | 2940 KiB |
| b07 | AC | 17 ms | 2940 KiB |
| b08 | AC | 17 ms | 2940 KiB |
| b09 | AC | 17 ms | 2940 KiB |
| b10 | AC | 17 ms | 2940 KiB |
| b11 | AC | 17 ms | 2940 KiB |
| b12 | AC | 17 ms | 2940 KiB |
| b13 | AC | 17 ms | 2940 KiB |