SHOW:
|
|
- or go back to the newest paste.
| 1 | import java.util.Scanner; | |
| 2 | ||
| 3 | ||
| 4 | - | public class MagicCarNumbers {
|
| 4 | + | public class Program {
|
| 5 | ||
| 6 | public static void main(String[] args) {
| |
| 7 | @SuppressWarnings("resource")
| |
| 8 | Scanner input = new Scanner(System.in); | |
| 9 | int magicNumber = input.nextInt(); | |
| 10 | - | char[] letters = new char[] {'A', 'B', 'C', 'H', 'K', 'M', 'P', 'T', 'X'};
|
| 10 | + | |
| 11 | char[] letters = new char[] {'A', 'B', 'C', 'E', 'H', 'K', 'M', 'P', 'T', 'X'};
| |
| 12 | ||
| 13 | int count = 0; | |
| 14 | int charX = 0; | |
| 15 | int charY = 0; | |
| 16 | ||
| 17 | for (int i = 0; i <= 9; i++) {
| |
| 18 | for (int j = 0; j <= 9; j++) {
| |
| 19 | for (int k = 0; k <= 9; k++) {
| |
| 20 | for (int l = 0; l <= 9; l++) {
| |
| 21 | for (char x : letters) {
| |
| 22 | for (char y : letters) {
| |
| 23 | switch (x) {
| |
| 24 | - | case'B': charX=20; break; |
| 24 | + | |
| 25 | - | case'C': charX=30; break; |
| 25 | + | case'B': charX=20; break; |
| 26 | - | case'E': charX=50; break; |
| 26 | + | case'C': charX=30; break; |
| 27 | - | case'H': charX=80; break; |
| 27 | + | case'E': charX=50; break; |
| 28 | - | case'K': charX=110; break; |
| 28 | + | case'H': charX=80; break; |
| 29 | - | case'M': charX=130; break; |
| 29 | + | case'K': charX=110; break; |
| 30 | - | case'P': charX=160; break; |
| 30 | + | case'M': charX=130; break; |
| 31 | - | case'T': charX=200; break; |
| 31 | + | case'P': charX=160; break; |
| 32 | - | case'X': charX=240; break; |
| 32 | + | case'T': charX=200; break; |
| 33 | case'X': charX=240; break; | |
| 34 | } | |
| 35 | ||
| 36 | switch (y) {
| |
| 37 | - | case'B': charY=20; break; |
| 37 | + | |
| 38 | - | case'C': charY=30; break; |
| 38 | + | case'B': charY=20; break; |
| 39 | - | case'E': charY=50; break; |
| 39 | + | case'C': charY=30; break; |
| 40 | - | case'H': charY=80; break; |
| 40 | + | case'E': charY=50; break; |
| 41 | - | case'K': charY=110; break; |
| 41 | + | case'H': charY=80; break; |
| 42 | - | case'M': charY=130; break; |
| 42 | + | case'K': charY=110; break; |
| 43 | - | case'P': charY=160; break; |
| 43 | + | case'M': charY=130; break; |
| 44 | - | case'T': charY=200; break; |
| 44 | + | case'P': charY=160; break; |
| 45 | - | case'X': charY=240; break; |
| 45 | + | case'T': charY=200; break; |
| 46 | case'X': charY=240; break; | |
| 47 | } | |
| 48 | ||
| 49 | boolean isMagic = (i==j&&j==k&&k==l)||(j==k&&k==l)||(i==j&&j==k)|| | |
| 50 | (i==j&&k==l)||(i==k&&j==l)||(i==l&&j==k); | |
| 51 | ||
| 52 | // +40 защото A = 10 , C = 30 , следователно CA = 40 | |
| 53 | - | System.out.printf("CA%d%d%d%d%c%c", i, j, k, l, x, y);
|
| 53 | + | |
| 54 | - | System.out.println(); |
| 54 | + | |
| 55 | //System.out.printf("CA%d%d%d%d%c%c", i, j, k, l, x, y);
| |
| 56 | //System.out.println(); | |
| 57 | } | |
| 58 | charX = 0; | |
| 59 | charY = 0; | |
| 60 | } | |
| 61 | } | |
| 62 | } | |
| 63 | } | |
| 64 | } | |
| 65 | } | |
| 66 | System.out.println(count); | |
| 67 | } | |
| 68 | ||
| 69 | } |
