Submission
Status:
-PPPPPPP-P
Subtask/Task Score:
80/100
Score: 80
User: theem1502
Problemset: เลขฐานเบญจภาคได้ดุล
Language: c
Time: 0.006 second
Submitted On: 2025-09-27 17:50:46
#include <stdio.h>
#include <stdlib.h>
int main() {
int num;
scanf("%d", &num);
int *thearray = malloc(num * sizeof(int));
for (int i = 0; i < num; i++) {
scanf("%d", &thearray[i]);
}
int idk[5] = {-2,-1,0,1,2};
for (int i = 0 ;i < num; i++) {
for (int j = 0; j < 5; j++) {
for (int k = 0; k < 5; k++) {
for (int h = 0; h < 5; h++) {
for (int f = 0; f < 5; f++) {
for(int d = 0; d < 5; d++) {
for (int t = 0; t < 5; t++) {
int firstnum = idk[j] * 3125;
int secondnum = idk[k] * 625;
int thirdnum = idk[h] * 125;
int forthnum = idk[f] * 25;
int fifthnum = idk[d] * 5;
int sixthnum = idk[t] * 1;
int totalnum = fifthnum + firstnum + secondnum + thirdnum + forthnum + sixthnum;
if (totalnum == thearray[i]) {
int marked = 6;
if (idk[j] == 0) {
marked--;
if (idk[k] == 0) {
marked--;
if (idk[h] == 0) {
marked--;
if (idk[f] == 0) {
marked--;
if (idk[d] == 0) {
marked--;
if(idk[t] == 0) {
marked--;
}
}
}
}
}
}
if (marked == 6) {
printf("%d %d %d %d %d %d\n", idk[t], idk[d], idk[f], idk[h], idk[k], idk[j]);
}
if (marked == 5) {
printf("%d %d %d %d %d\n", idk[t], idk[d], idk[f], idk[h], idk[k]);
}
if (marked == 4) {
printf("%d %d %d %d\n", idk[t], idk[d], idk[f], idk[h]);
}
if (marked == 3) {
printf("%d %d %d\n", idk[t], idk[d], idk[f]);
}
if (marked == 2) {
printf("%d %d\n", idk[t], idk[d]);
}
if (marked == 1) {
printf("%d\n", idk[t]);
}
goto check;
}
}
}
}
}
}
}
check:
}
}