Submission #2542801


Source Code Expand

#include <iostream>
#include <algorithm>
#include <numeric>
#include <string>

#define REP(i, n) for(long i=0; i<(long)(n); ++i)

using namespace std;

int n, x;
int ms[100];

void input() {
  cin >> n >> x;
  REP(i, n) cin >> ms[i]; 
}

void solve() {
  sort(ms,ms+n);
  long xsum = accumulate(ms,ms+n,0);
  long ans = n + ((x-xsum) / ms[0]);
  cout << ans << endl;
}

int main() {
  input();
  solve();
  return 0;
}

Submission Info

Submission Time
Task B - Bitter Alchemy
User cottoncotton
Language C++14 (GCC 5.4.1)
Score 200
Code Size 448 Byte
Status AC
Exec Time 2 ms
Memory 384 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 13
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 2 ms 384 KB