結果
問題 | No.1231 Make a Multiple of Ten |
ユーザー |
![]() |
提出日時 | 2020-09-18 22:16:58 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 242 ms / 2,000 ms |
コード長 | 2,629 bytes |
コンパイル時間 | 2,255 ms |
コンパイル使用メモリ | 77,852 KB |
実行使用メモリ | 66,200 KB |
最終ジャッジ日時 | 2024-06-23 13:51:09 |
合計ジャッジ時間 | 5,563 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 13 |
ソースコード
import java.io.*;import java.util.*;import static java.lang.System.out;public class Main {static MyReader in = new MyReader();public static void main(String[] args) {int N = in.i();int[] A = in.ii(N);int[][] dp = new int[N + 1][10];for (int i = 0; i < N; i++) {for (int j = 0; j < 10; j++) {dp[i + 1][j] = dp[i][j];}for (int j = 0; j < 10; j++) {int k = (j + A[i]) % 10;if (j == 0 || dp[i][j] > 0) {dp[i + 1][k] = Math.max(dp[i + 1][k], dp[i][j] + 1);}}}out.println(dp[N][0]);}}class MyReader extends BufferedReader {char[] cbuf = new char[1024];int head = 0;int tail = 0;MyReader() {super(new InputStreamReader(System.in));}char next() {if (head == tail) {try {tail = super.read(cbuf, 0, cbuf.length);} catch (IOException e) {e.printStackTrace();}head = 0;}return cbuf[head++];}void back() {head--;}boolean minus() {boolean minus;while (true) {char c = next();if (!isDelimiter(c)) {if (!(minus = c == '-')) back();return minus;}}}void skip() {while (isDelimiter(next()));back();}char[] s(int N) {char[] cbuf = new char[N];read(cbuf, 0, N);return cbuf;}public int read(char[] cbuf, int off, int len) {skip();int i;for (i = 0; i < cbuf.length; i++) {char c = next();if (isDelimiter(c)) {break;}cbuf[i] = c;}return i;}boolean isDelimiter(char c) {return c == ' ' || c == '\n' || c == '\r';}int i() {boolean minus = minus();int n = 0;while (true) {int k = next() - '0';if (k < 0 || 9 < k) break;n = 10 * n + k;}return minus ? -n : n;}int[] ii(final int N) {int[] a = new int[N];for (int j = 0; j < a.length; j++) a[j] = i();return a;}long l() {boolean minus = minus();long n = 0;while (true) {int k = next() - '0';if (k < 0 || 9 < k) break;n = 10 * n + k;}return minus ? -n : n;}}