結果
| 問題 |
No.825 賢いお買い物
|
| コンテスト | |
| ユーザー |
Oland
|
| 提出日時 | 2019-05-23 19:17:05 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 53 ms / 2,000 ms |
| コード長 | 3,803 bytes |
| コンパイル時間 | 2,321 ms |
| コンパイル使用メモリ | 78,676 KB |
| 実行使用メモリ | 50,236 KB |
| 最終ジャッジ日時 | 2024-09-17 09:51:21 |
| 合計ジャッジ時間 | 4,115 ms |
|
ジャッジサーバーID (参考情報) |
judge6 / judge3 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 19 |
ソースコード
import java.io.*;
import java.util.*;
import java.util.Map.Entry;
@SuppressWarnings("unused")
public class Main {
//final boolean isDebug = true;
final boolean isDebug = false;
String fileName = "input.txt";
FastScanner sc;
PrintWriter out;
final int MOD = (int)1e9+7;
//final int INF = Integer.MAX_VALUE / 2;
final long INF = Long.MAX_VALUE / 2;
void solve() throws Exception{
int A = sc.nextInt(), B = sc.nextInt(), C = sc.nextInt();
for(int P = 1; P <= A+B*10; P++){
for(int useA = 0; useA <= A; useA++){
for(int useB = 0; useB <= B; useB++){
int oturi = useA + useB * 10 - P;
if(oturi < 0) continue;
if((A - useA) + (B - useB) + oturi / 10 + oturi % 10 == C){
System.out.println(P);
return;
}
}
}
}
System.out.println("Impossible");
}
/* end solve */
/* main */
public static void main(String[] args) throws Exception {
new Main().m();
}
void m() throws Exception {
long S = System.currentTimeMillis();
sc = (isDebug) ? new FastScanner(new FileInputStream(fileName)) : new FastScanner(System.in);
out = new PrintWriter(System.out);
solve();
out.flush();
long G = System.currentTimeMillis();
if(isDebug){
System.out.println("---Debug---");
System.out.printf("%8d ms\n", (G-S));
}
}
/* end main */
}
/* end Main */
class FastScanner {
private InputStream in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
public FastScanner(InputStream in) {
this.in = in;
}
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() {
if (hasNextByte()) return buffer[ptr++];
else return -1;
}
private static boolean isPrintableChar(int c){
return 33 <= c && c <= 126;
}
public boolean hasNext() {
while(hasNextByte() && !isPrintableChar(buffer[ptr]))
ptr++; return hasNextByte();
}
public String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public String nextLine() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(b != 10) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
public double nextDouble() {
return Double.parseDouble(next());
}
}
Oland