Although the statement has many exceptions such as using my own library files to solve sorting etc.
problems
Therefore, keeping all those cases aside allows for debate on this question.
At first glance it seems that it is easy (considering both the length of the code and the difficulty).
But it turned out that after completing the coding on each instance I realized at the same time, a corner case.
And in the end, it resulted in 111 lines of code. (it’s actually 113, but I cut it to 111 by removing a couple of preprocessor directives).
I’m sure we can code better.
After all, it’s settled so I don’t want to keep my wet ass on it.
#include
#include
#include
#include
#include
int main (int argc, char const *argv [])
int i,testc,n,nby3,nby5,pint;
scanf(“%d”, &testc);
while (testc–)
scanf(“%d”, &n);
else if (nby5==4)
else if (nby5==4)
else if (nby5==4)
else if (nby5==4)
keep going;
keep going;
keep going;
if (pint)
if (pint)
if (pint)
if (pint)
if (pint)
if (pint)
if (pint)
if (pint)
if (pint)
if (pint)
printf(“\n”);
printf(“\n”);
printf(“\n”);
printf(“\n”);
printf(“\n”);
printf(“\n”);
printf(“\n”);
printf(“\n”);
printf(“\n”);
printf(“\n”);
printf(“\n”);
printf(“\n”);
printf(“\n”);