Submission #32746542

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
void fast_io() {
  cin.tie(0)->sync_with_stdio(0);
}
const int MAX = 9;
int C[MAX + 1];
void solve() {
  int N;
  cin >> N;
  for (int i = 1; i <= 9; i++) cin >> C[i];
  // Major bit & left padding
  int mdig = 0, mval = 0, odig = 0, oval = 0;
  for (int i = 9; i >= 1; i--) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;

void fast_io() {
  cin.tie(0)->sync_with_stdio(0);
}

const int MAX = 9;
int C[MAX + 1];

void solve() {
  int N;
  cin >> N;

  for (int i = 1; i <= 9; i++) cin >> C[i];

  // Major bit & left padding
  int mdig = 0, mval = 0, odig = 0, oval = 0;
  for (int i = 9; i >= 1; i--) {
    if (mdig < N / C[i]) {
      mdig = N / C[i];
      mval = i;
      odig = oval = 0;

      int rem = N % C[i];
      for (int j = i + 1; j <= 9; j++) {
        int diff = C[j] - C[i];
        if (rem >= diff && diff > 0) {
          odig = rem / diff;
          oval = j;
        }
      }
    }
    else if (mdig == N / C[i]) {
      int rem = N % C[i];
      for (int j = oval; j <= 9; j++) {
        int diff = C[j] - C[i];
        if (rem >= diff && diff > 0) {
          if (j > oval || odig < rem / diff) {
            mval = i;
            odig = rem / diff;
            oval = j;
          }
        }
      }
    }
  }

  for (int i = 0; i < odig; i++) cout << oval;
  for (int i = 0; i < mdig - odig; i++) cout << mval;
  cout << '\n';
}

int main() {
  fast_io();

  int t = 1;
  // cin >> t;
  while (t--) solve();
}

Submission Info

Judge Result