Submission #1833681


Source Code Expand

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.Deque;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {

	static PrintWriter out;
	static InputReader ir;
	static final int INF=Integer.MAX_VALUE;
	static final int[] d={-1,0,1,0};

	static void solve() {
		int n=ir.nextInt();
		int x=ir.nextInt();
		int[] w=ir.nextIntArray(n);
		int ret=0;
		for(int i=0;i<1<<n;i++){
			int tot=0;
			for(int j=0;j<n;j++){
				if((i&(1<<j))!=0){
					tot+=w[i];
				}
			}
			if(tot==x)
				ret++;
		}
		out.println(ret);
	}

	public static void main(String[] args) throws Exception {
		ir = new InputReader(System.in);
		out = new PrintWriter(System.out);
		solve();
		out.flush();
	}

	static class InputReader {

		private InputStream in;
		private byte[] buffer = new byte[1024];
		private int curbuf;
		private int lenbuf;

		public InputReader(InputStream in) {
			this.in = in;
			this.curbuf = this.lenbuf = 0;
		}

		public boolean hasNextByte() {
			if (curbuf >= lenbuf) {
				curbuf = 0;
				try {
					lenbuf = in.read(buffer);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (lenbuf <= 0)
					return false;
			}
			return true;
		}

		private int readByte() {
			if (hasNextByte())
				return buffer[curbuf++];
			else
				return -1;
		}

		private boolean isSpaceChar(int c) {
			return !(c >= 33 && c <= 126);
		}

		private void skip() {
			while (hasNextByte() && isSpaceChar(buffer[curbuf]))
				curbuf++;
		}

		public boolean hasNext() {
			skip();
			return hasNextByte();
		}

		public String next() {
			if (!hasNext())
				throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while (!isSpaceChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}

		public int nextInt() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}

		public long nextLong() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}

		public double nextDouble() {
			return Double.parseDouble(next());
		}

		public int[] nextIntArray(int n) {
			int[] a = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}

		public long[] nextLongArray(int n) {
			long[] a = new long[n];
			for (int i = 0; i < n; i++)
				a[i] = nextLong();
			return a;
		}

		public char[][] nextCharMap(int n, int m) {
			char[][] map = new char[n][m];
			for (int i = 0; i < n; i++)
				map[i] = next().toCharArray();
			return map;
		}
	}
}

Submission Info

Submission Time
Task C - 無駄なものが嫌いな人
User holeguma
Language Java8 (OpenJDK 1.8.0)
Score 0
Code Size 3502 Byte
Status RE
Exec Time 70 ms
Memory 21588 KB

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
AC × 1
WA × 18
RE × 9
Set Name Test Cases
All max_1.txt, max_2.txt, max_3.txt, max_4.txt, pair_1.txt, pair_2.txt, power2_1.txt, power2_2.txt, power2_3.txt, power2_4.txt, power2_5.txt, random_1.txt, random_2.txt, random_3.txt, random_4.txt, random_5.txt, random_6.txt, random_7.txt, random_8.txt, random_9.txt, sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt, small_1.txt, small_2.txt, small_3.txt, small_4.txt
Case Name Status Exec Time Memory
max_1.txt WA 70 ms 21588 KB
max_2.txt WA 69 ms 19284 KB
max_3.txt WA 68 ms 19156 KB
max_4.txt WA 68 ms 21204 KB
pair_1.txt WA 68 ms 21076 KB
pair_2.txt WA 70 ms 18900 KB
power2_1.txt WA 68 ms 19156 KB
power2_2.txt WA 68 ms 17748 KB
power2_3.txt WA 68 ms 19668 KB
power2_4.txt WA 69 ms 18900 KB
power2_5.txt RE 69 ms 19156 KB
random_1.txt WA 68 ms 15700 KB
random_2.txt WA 69 ms 18516 KB
random_3.txt AC 70 ms 19024 KB
random_4.txt WA 70 ms 20692 KB
random_5.txt WA 67 ms 21204 KB
random_6.txt WA 69 ms 19028 KB
random_7.txt WA 69 ms 18004 KB
random_8.txt WA 69 ms 20692 KB
random_9.txt WA 69 ms 19540 KB
sample_1.txt RE 68 ms 19412 KB
sample_2.txt RE 70 ms 18900 KB
sample_3.txt RE 69 ms 18004 KB
sample_4.txt RE 68 ms 15828 KB
small_1.txt RE 69 ms 17876 KB
small_2.txt RE 68 ms 19284 KB
small_3.txt RE 69 ms 19284 KB
small_4.txt RE 69 ms 20692 KB