Java 洛谷 P2089 烤鸡
生活随笔
收集整理的這篇文章主要介紹了
Java 洛谷 P2089 烤鸡
小編覺得挺不錯(cuò)的,現(xiàn)在分享給大家,幫大家做個(gè)參考.
題目鏈接:https://www.luogu.com.cn/problem/P2089
代碼實(shí)例:
最暴力的解法,AC了
import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner scanner = new Scanner(System.in);int n = scanner.nextInt();int count = 0;int a,b,c,d,e,f,g,h,i,j;for (a = 1; a <= 3; a++) {for (b = 1; b <= 3; b++) {for (c = 1; c <= 3; c++) {for (d = 1; d <= 3; d++) {for (e = 1; e <= 3; e++) {for (f = 1; f <= 3; f++) {for (g = 1; g <= 3; g++) {for (h = 1; h <= 3; h++) {for (i = 1; i <= 3; i++) {for (j = 1; j <= 3; j++) {if(a+b+c+d+e+f+g+h+i+j==n) {count++;}}}}}}}}}}}System.out.println(count);for (a = 1; a <= 3; a++) {for (b = 1; b <= 3; b++) {for (c = 1; c <= 3; c++) {for (d = 1; d <= 3; d++) {for (e = 1; e <= 3; e++) {for (f = 1; f <= 3; f++) {for (g = 1; g <= 3; g++) {for (h = 1; h <= 3; h++) {for (i = 1; i <= 3; i++) {for (j = 1; j <= 3; j++) {if(a+b+c+d+e+f+g+h+i+j==n) {System.out.println(a+" "+b+" "+c+" "+d+" "+e+" "+f+" "+g+" "+h+" "+i+" "+j);}}}}}}}}}}}scanner.close();}}總結(jié)
以上是生活随笔為你收集整理的Java 洛谷 P2089 烤鸡的全部內(nèi)容,希望文章能夠幫你解決所遇到的問題。
- 上一篇: Java 洛谷 P1149 火柴棒等式
- 下一篇: 数据结构-深度优先遍历和广度优先遍历(漫