TopcoderArchiveVisit Topcoder
SRM19 Oct 2006
SRM 323

IrreducibleNumber

Problem statement, definition, constraints, and public examples.

Problem Statement

You are given a int[] A. An integer K is irreducible with respect to A if K cannot be represented as a sum of one or more elements from A, where each element of A may be used at most once. Return the smallest positive integer that is irreducible with respect to A.

Definition

Class:
IrreducibleNumber
Method:
getIrreducible
Parameters:
int[]
Returns:
int
Method signature:
int getIrreducible(int[] A)
(be sure your method is public)

Constraints

  • A will contain between 1 and 3 elements, inclusive.
  • Each element of A will be between 1 and 100, inclusive.

Examples

  1. {1,1}
    Returns: 3
    1 can be expressed as 1, and 2 can be expressed as 1+1.
  2. {1,2}
    Returns: 4
  3. {1,3}
    Returns: 2
  4. {4, 1, 3}
    Returns: 2
Back to all problems