1 条题解
-
0
C :
#include <stdio.h> enum color { red, yellow, blue, white, black }; int main() { void output(enum color x); enum color i, j, k; int count = 0; for (i = red;i <= black;i++) { for (j = red;j <= black;j++) { if (i != j) { for (k = red;k <= black;k++) { if (i != k && j != k) { output(i); printf(" "); output(j); printf(" "); output(k); printf("\n"); count++; } } } } } printf("%d\n", count); return 0; } /* 将枚举类型转换为相应的字符串进行输出 */ void output(enum color x) { switch (x) { case red: printf("red"); break; case yellow: printf("yellow"); break; case blue: printf("blue"); break; case white: printf("white"); break; case black: printf("black"); break; } }
C++ :
#include<iostream> #include<iomanip> #include<fstream> #include<string> #include<climits> #include<cctype> #include<cmath> using namespace std; int main() { //ifstream cin("aaa.txt"); int i,j,n,m,k,sum; string s[5]={"red","yellow","blue","white","black"}; sum=0; for(i=0;i<5;i++) for(j=0;j<5;j++) for(k=0;k<5;k++) if(i!=j && i!=k && j!=k) {cout<<s[i]<<" "<<s[j]<<" "<<s[k]<<endl;sum++;} cout<<sum<<endl; return 0; }
Pascal :
begin writeln('red yellow blue'); writeln('red yellow white'); writeln('red yellow black'); writeln('red blue yellow'); writeln('red blue white'); writeln('red blue black'); writeln('red white yellow'); writeln('red white blue'); writeln('red white black'); writeln('red black yellow'); writeln('red black blue'); writeln('red black white'); writeln('yellow red blue'); writeln('yellow red white'); writeln('yellow red black'); writeln('yellow blue red'); writeln('yellow blue white'); writeln('yellow blue black'); writeln('yellow white red'); writeln('yellow white blue'); writeln('yellow white black'); writeln('yellow black red'); writeln('yellow black blue'); writeln('yellow black white'); writeln('blue red yellow'); writeln('blue red white'); writeln('blue red black'); writeln('blue yellow red'); writeln('blue yellow white'); writeln('blue yellow black'); writeln('blue white red'); writeln('blue white yellow'); writeln('blue white black'); writeln('blue black red'); writeln('blue black yellow'); writeln('blue black white'); writeln('white red yellow'); writeln('white red blue'); writeln('white red black'); writeln('white yellow red'); writeln('white yellow blue'); writeln('white yellow black'); writeln('white blue red'); writeln('white blue yellow'); writeln('white blue black'); writeln('white black red'); writeln('white black yellow'); writeln('white black blue'); writeln('black red yellow'); writeln('black red blue'); writeln('black red white'); writeln('black yellow red'); writeln('black yellow blue'); writeln('black yellow white'); writeln('black blue red'); writeln('black blue yellow'); writeln('black blue white'); writeln('black white red'); writeln('black white yellow'); writeln('black white blue'); writeln('60'); end.
Java :
import java.util.HashMap; import java.util.Map; public class Main { public static void main(String[] args) { Map<Integer, String> map = new HashMap<Integer, String>() ; map.put(1, "red") ; map.put(2, "yellow") ; map.put(3, "blue") ; map.put(4, "white") ; map.put(5, "black") ; int sum = 0 ; for (int i = 1; i <= 5; i++) { for (int j = 1; j <= 5; j++) { for (int k = 1; k <= 5; k++) { if(k!=i&&k!=j&&i!=j){ System.out.print(map.get(i)+" ") ; System.out.print(map.get(j)+" ") ; System.out.println(map.get(k)) ; sum++ ; } } } } System.out.println(sum); } }
- 1
信息
- ID
- 1382
- 时间
- 1000ms
- 内存
- 32MiB
- 难度
- (无)
- 标签
- 递交数
- 0
- 已通过
- 0
- 上传者