Created
May 2, 2012 21:38
-
-
Save phaniram/2580701 to your computer and use it in GitHub Desktop.
Codechef-May12-SPOON-Accepted
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import java.util.Scanner; | |
class CHEFLUCK { | |
/** | |
* @author Cypronmaya-May12-CHEFLUCK-Accepted | |
*/ | |
public static void main(String[] args) { | |
Scanner sc = new Scanner(System.in); | |
int test_cases = sc.nextInt(); | |
for (int i = 0; i < test_cases; i++) { | |
int N = sc.nextInt(); | |
boolean found = false; | |
int limx=7*(N/7); | |
loop: if (!found) { | |
for (int x = limx; x >= 0; x = x - 7) { | |
int y=N-x; | |
if(y%4==0 && (x + y) != 0) | |
{ | |
found = true; | |
System.out.println(x); | |
break loop; | |
} | |
} | |
} | |
if (!found) { | |
System.out.println(-1); | |
} | |
} | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Every great chef knows that lucky numbers are positive integers whose decimal representations contain only the lucky digits 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.
Our chef has recently returned from the Lucky country. He observed that every restaurant in the Lucky country had a lucky number as its name. He believes that having a lucky number as a restaurant name can indeed turn out to be very lucky.
Our chef believes that it is possible to make a lucky number having N digits even luckier. Any number following the rules below is called Lucky lucky number -
Help our chef to compute the count of digit 4 in the smallest Lucky lucky number having N digits.
Input
First line contains T, number of test cases. Each of the next T lines contains a number N, the number of digits in the Lucky lucky number to be formed.
1<=T<=1000
1<=N<=1000000000 (10^9)
Output
If it is not possible to form a Lucky lucky number having N digits, output -1. Otherwise, output the count of digit 4 in the smallest Lucky lucky number having N digits.
Example
Input:
5
7
4
11
1
15
Output:
7
0
7
-1
7
Explanation
For the last test case, N = 15, the smallest lucky lucky number is
444444477777777. The count of digit 4 is 7.