Lexicographic sequence in C

Question

0.00/5 (No votes)

See more:

Here is the question what I translated. My translate is bad hope you will understand.
Show every triplet(x,y,z) where x <= A, y <= B, z <= C (0 <= A, B, C <= 20) and show x,y and z small to large.
input:
input files first line will give test case's number (t <= 20). After this on the number of line T there are theree number A ,B,C.

Output:
For Every case begainning the case number print "Case X :" Where case is 1 to T. Then print every tripolet small to large. Tripolet's are arranged by lexicographical sequence .

N.B : Lexicographic sequence - a tripolet (a1,b1,c1) another tripolet (a2,b2,c2) will be smaller by Lexicographic sequence and if the condition is true what given here : (i) a1 < a2 (ii) a1 = a2 and b1 < b2 (iii) a1 = a2 and b1 = b2 and c1 < c2 .
Input :

3 //Number of line (Case/ T)
1 1 2
3 2 3
4 4 4

Output:

What I have tried:

int main()
{
    int T, i, j, A, B, C, temp = 0;
    scanf("%d",&T);
    
    while(T--) {
        scanf("%d %d %d",&A,&B,&C);
        // bubble short for high to low 
        for(i = 0;i < 3;i++) {
            if(A > B) {
                temp = A;
                A = B;
                B = temp;
            }
                
            else if (A > C) {
                temp = A;
                A = C;
                C = temp;
            }
                
            else if(B > C) {
                temp = B;
                B = C;
                C = temp;
            }
        }

I can't figure out the algorithm. but I tried some.
First, I sequence small to large by bubble shoot. Then I can't understand what I should (second step - lexicographic sequence). Even I don't know, is it wright way? or not?

Posted 19-Oct-22 11:30am

Lara Thomas

Updated 19-Oct-22 14:35pm

v3

Add a Solution

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Rick York · Accepted Answer · 2022-10-19T14:35:00

I have no idea why you are doing a sort in this. I would approach the problem as a three digit counter and each digit can range from zero to the value that was input. When a digit is incremented such that it exceeds its limit then it is zeroed and the next digit is incremented. This is just like how normal base ten counting works except it has a limit of 9 on each digit. To maintain the counter, I would use an array of three integers. Start with all three set to zero and then start incrementing each one and evaluate the rules you were given. You can map the "a" digit to slot 0, "b" to slot 1, and "c" to slot 2 if you want to.

Also, I would write the set of input data to a file and use the redirection operator to set your programs stdin to be the file. That would be something like this on the command line :

YourProgram < InputData.txt

Then you can have multiple input files to select from and try lots of possibilities very quickly.