#include char candy[50][50]; int n; void swap(char* a, char* b) { char temp; temp = *a; *a = *b; *b = temp; } int max(int a, int b) { return a > b ? a : b; } int checkAll() { int i, j, count; int MAX = -1; char before; for (i = 0; i < n; i++) { count = 1; before = candy[i][0]; for (j = 1; j < n; j++) { if (candy[i][j] == before) { count++; MAX = max(MAX, count); } else { MAX = max(MAX, count); c..
#include int number[7]; int separate(int n, int *arr) { int i = 0, digit = 0; while(1) { arr[i] = n % 10; n /= 10; if (n == 0) { digit = i + 1; break; } i++; } return digit; } int main(void) { int i, j, num, digit, sum; int MIN = 2000000; scanf("%d", &num); digit = separate(num, number); for (i = num - 1; i + (9 * digit) >= num; i--) { sum = i; digit = separate(i, number); for (j = 0; j < digit;..
#include #include using namespace std; int height[9]; int main(void) { int i, j, n, k; int sum = 0, find = 0; for (i = 0; i < 9; i++) { scanf("%d", &height[i]); sum += height[i]; } sort(height, height + 9); for (i = 0; i < 9; i++) { sum -= height[i]; for (j = i + 1; j < 9; j++) { sum -= height[j]; if (sum == 100) { find = 1; break; } sum += height[j]; } if (find == 1) break; sum += height[i]; } ..