æ£ç”例
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 |
package challenge09; import java.util.Scanner; public class Factory { //部å“ã®é…列 (A部å“0番目ã€B部å“1番目ã€C部å“2番目) static int[] parts_su = new int[3]; //éƒ¨å“æ•° static int[] kousei = {5,2,7}; //製å“ã®éƒ¨å“æ§‹æˆæ•° static String[] parts_name = {"A","B","C"}; //部å“å public static void main(String[] args) { //ç´å…¥ nouhin(); //è£½é€ int seizou_su = seizou(); //生産数ç‰ã®è¡¨ç¤º print(seizou_su); } /*   ç´å“å‡¦ç† */ public static void nouhin(){ String message = "部å“ã®ç´å“数を入力ã—ã¦ãã ã•ã„"; for(var i = 0;i < kousei.length;i = i + 1){ input(parts_name[i]+message,i); } } /*   ç´å“入力 */ public static void input(String message,int idx){ Scanner scan = new Scanner(System.in); System.out.println(message); parts_su[idx] = scan.nextInt(); } /*   è£½é€ ã€æˆ»ã‚Šå€¤ã€‘è£½é€ æ•° */ public static int seizou(){ var max = max_seizou(); //è£½é€ ã§ãる最大ã®è£½å“数を求ã‚ã‚‹ for(var i = 0;i < parts_su.length;i = i + 1){ //è£½é€ æ•°ã‚’åŸºã«éƒ¨å“数を減ら㙠parts_su[i] = parts_su[i] - max * kousei[i]; } return max; } /*   è£½é€ ã§ãる最大数を求ã‚ã‚‹ ã€æˆ»ã‚Šå€¤ã€‘æœ€å¤§è£½é€ æ•° */ public static int max_seizou(){ int[] min = new int[parts_su.length]; //éƒ¨å“æ¯Žã«è£½é€ ã§ãる最大数を求ã‚ã‚‹ for(var i = 0;i < parts_su.length;i = i + 1){ min[i] = parts_su[i] / kousei[i];//éƒ¨å“æ•°ã‹ã‚‰è£½å“æ§‹æˆæ•°ã‚’除算ã—ã¦æœ€å¤§æ•°ã‚’求ã‚ã‚‹ } int min_s = 9999999; //éƒ¨å“æ¯Žã®æœ€å°æ•°è£½é€ æ•°ãŒè£½é€ ã§ãる製å“ã®æœ€å¤§æ•°ã«ãªã‚‹ for(var i = 0;i < min.length;i = i + 1){ if( min[i] < min_s){ min_s = min[i]; } } return min_s; } /* ã€€ã€€è¡¨ç¤ºå‡¦ç† ã€å¼•æ•°ã€‘è£½é€ æ•° */ public static void print(int seizou_su){ System.out.println("è£½é€ æ•°="+seizou_su); for(var i = 0;i < parts_su.length;i = i + 1){ System.out.println(parts_name[i] + "éƒ¨å“æ®‹ã‚Š:"+parts_su[i]); } } } |