Submission #3004615
Source Code Expand
#include <algorithm> #define _USE_MATH_DEFINES #include <cmath> #include <iostream> #include <string> #include <vector> #include <stdio.h> #include<list> #include<map> #include<utility> #include<tuple> #include<numeric> #include<set> #define rep(i,n) for(int i=0;i<(int)n;i++) #define all(a) (a).begin(),a.end() using namespace std; int main() { int n,x; cin >> n; cin >> x; int min = 1000; vector <int> m; rep(i, n) { int tmp; cin >> tmp; if (tmp < min)min = tmp; m.push_back(tmp); x -= tmp; } cout << n + (x / min) << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - Bitter Alchemy |
User | bentuyoman |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 586 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
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 | 1 ms | 256 KB |
a02 | AC | 1 ms | 256 KB |
a03 | AC | 1 ms | 256 KB |
b04 | AC | 1 ms | 256 KB |
b05 | AC | 1 ms | 256 KB |
b06 | AC | 1 ms | 256 KB |
b07 | AC | 1 ms | 256 KB |
b08 | AC | 1 ms | 256 KB |
b09 | AC | 1 ms | 256 KB |
b10 | AC | 1 ms | 256 KB |
b11 | AC | 1 ms | 256 KB |
b12 | AC | 1 ms | 256 KB |
b13 | AC | 1 ms | 256 KB |