This repository has been archived on 2023-11-30. You can view files and clone it, but cannot push or open issues or pull requests.
MaxMultiplication/main.cpp

42 lines
1.2 KiB
C++
Raw Permalink Normal View History

2023-06-15 22:46:24 +08:00
#include <cstdio>
// <20><><EFBFBD><EFBFBD>һ<EFBFBD><D2BB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> nums<6D><73><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ѡ<EFBFBD><D1A1><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ͬ<EFBFBD>±<EFBFBD> i <20><> j<><6A>ʹ (nums[i]-1)*(nums[j]-1) ȡ<><C8A1><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ֵ<EFBFBD><D6B5>
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><E3B2A2><EFBFBD>ظ<EFBFBD>ʽ<EFBFBD><CABD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ֵ<EFBFBD><D6B5>
int maxProduct(int nums[], int numsSize) {
int MaxNumber = 0;
for (int i = 0; i < numsSize; ++i) {
for (int j = 0; j < numsSize; ++j) {
if (i == j) continue;
if ((nums[i] - 1) * (nums[j] - 1) > MaxNumber) {
MaxNumber = (nums[i] - 1) * (nums[j] - 1);
}
}
}
return MaxNumber;
}
int main() {
while (true) {
int numsSize;
printf("[INFO] <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>С: ");
scanf("%d", &numsSize);
if (numsSize == -1) break;
if (numsSize <= 1) {
printf("[WARNING] <20>޷<EFBFBD><DEB7><EFBFBD><EFBFBD>ɼ<EFBFBD><C9BC><EFBFBD><E3A3AC><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ҫ2λ<32><CEBB>\n\n");
continue;
}
getchar();
printf("[INFO] <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ݣ<EFBFBD><DDA3>м<EFBFBD>ʹ<EFBFBD>ö<EFBFBD><C3B6>Ÿ<EFBFBD><C5B8><EFBFBD><EFBFBD><EFBFBD>: ");
int nums[numsSize];
for (int i = 0; i < numsSize - 1; ++i) {
scanf("%d,", &nums[i]);
}
scanf("%d", &nums[numsSize - 1]);
getchar();
// upload data to maxProduct function
printf("[OUTPUT] <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>: %d\n", maxProduct(nums, numsSize));
printf("\n");
}
printf("[SYSTEM] <20><><EFBFBD>˳<EFBFBD>\n");
return 0;
}