Problem J.
Sum of a subsequence Input file: sum.in Output file: sum.out We are given a sequence a1, a2, . . . , a2n. Your task is to find a subsequence ai1 , ai2 , . . . , ain of this sequence such that its sum ai1 + ai2 + · · · + ain is divisible by n, or check that such subsequence doesn’t exist.Sum of a subsequence Input fi
