JPM - Just Primes
Input
The first line contains an integer T, denoting the number of test cases. Each of the next subsequent T lines contain a positive integer N.Constraints
Output
For each test case, first print the case number followed by the minimum number of distinct primes such that their sum equals to N. If N cannot be represented by a summation of distinct primes, then print the case number followed by -1. Refer to the sample input/output for more clarity of the format.Sample Input
10 1 2 3 10 27 100 1000 4572 4991 49999
Sample Output
Case 1: -1 Case 2: 1 Case 3: 1 Case 4: 2 Case 5: 3 Case 6: 2 Case 7: 2 Case 8: 2 Case 9: 3 Case 10: 1
Challenge
Too easy? Try the harder version here - Just Primes IIhide comments
tracyyi:
2022-06-29 10:39:19
Oops, "distinct primes", I missed it. |
|
tracyyi:
2022-06-29 04:01:09
Is Goldbach conjecture working here? Last edit: 2022-06-29 05:26:35 |
|
David:
2022-02-24 21:34:38
@thanhdatmu2003 The minimum number of distinct primes that sums to 4991 = 3. There is no way to sum 2 primes to equal 4991. I count 13,396 ways (using the restriction p1 < p2 < p3) to sum 3 distinct primes to equal 4991. Here are a few examples:
|
|
thanhdatmu2003:
2021-12-13 09:02:36
why 4991 is 3 |
|
nadstratosfer:
2021-04-22 13:02:11
Scape, pls look into recent streak of submissions from CVR College Of Engineering users. Except for Shirisha, they normally code in C or Python, yet here they all switched to Java and magically came up with almost exactly equally performing code.
|
|
rising_stark:
2021-03-17 12:19:08
Too easy!! Classic coin change problem. |
Added by: | sgtlaugh |
Date: | 2021-02-25 |
Time limit: | 3s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All |
Resource: | Own Problem |