PAT基礎編程題目-7-16 求符合給定條件的整數集

PAT基礎編程題目-7-16 求符合給定條件的整數集

題目詳情

題目地址：https://pintia.cn/problem-sets/14/problems/796

解答

C語言版

#include<stdio.h>
int main()
{
	int a;
	scanf("%d", &a);
	int number[4] = {a, a+1, a+2, a+3};
	int row = 0, col = 0;  //統計行數和列數，控制行後面的換行和列後面的空格
	for (int i = 0; i < 4; i++) {
		for (int j = 0; j < 4; j++) {
			if (j!=i)
			{
				for (int k = 0; k < 4; k++)
				{
					if (k!=i && k!=j)
					{
						printf("%d%d%d", number[i], number[j], number[k]);
						col++;
						if (col<6)
							printf(" ");
					}
				}
			}
		}
		row++;
		if (row<4)
			printf("\n");
		col = 0;
	}
	return 0;
}

C++

#include<iostream>
using namespace std;
int main() {
	int a;
	cin >> a;
	int number[4] = { a, a + 1, a + 2, a + 3 };
	int row = 0, col = 0;  //統計行數和列數，控制行後面的換行和列後面的空格
	for (int i = 0; i < 4; i++) {
		for (int j = 0; j < 4; j++) {
			if (j != i)
			{
				for (int k = 0; k < 4; k++)
				{
					if (k != i && k != j)
					{
						cout << number[i] << number[j] << number[k];
						col++;
						if (col < 6)
							cout << " ";
					}
				}
			}
		}
		row++;
		if (row < 4)
			cout << endl;
		col = 0;
	}
	return 0;
}

Java版

import java.util.Scanner;
public class Main{

	public static void main(String[] args) {
		int a = 0;
		Scanner scanner = new Scanner(System.in);
		if (scanner.hasNext()) {
			a = scanner.nextInt();
		}
		scanner.close();
		int [] number = { a, a + 1, a + 2, a + 3 };
		int row = 0, col = 0;  //統計行數和列數，控制行後面的換行和列後面的空格
		for (int i = 0; i < 4; i++) {
			for (int j = 0; j < 4; j++) {
				if (j != i) {
					for (int k = 0; k < 4; k++) {
						if (k != i && k != j) {
							/*System.out.print(number[i]);
							System.out.print(number[j]);
							System.out.print(number[k]);*/
							// 採用一行輸出則需要先轉成字符串類型
							System.out.print(Integer.toString(number[i])+Integer.toString(number[j])+Integer.toString(number[k]));
							col++;
							if (col < 6)
								System.out.print(" ");
						}
					}
				}
			}
			row++;
			if (row < 4)
				System.out.println();
			col = 0;
		}

	}

}

創作不易，喜歡的話加個關注點個贊，謝謝謝謝謝謝！