Search:

It's hard to tell from your post whether you took reverse swaps into account...

That is if guy 0 swaps with guy 1 ... guy 1 cannot swap with guy 0.

Love to see your code for that (PM if you...

Season 2 episode 17 ... HERE

It starts with an alien swapping with Daniel... and ends with them doing a bunch of swaps to get everyone back in the right body.

In SG1 they started with a single swap... but the rule was you can only swap once... that is if a and b are swapped, you can't simply swap them back... The goal is to get all the minds back in the...

Check message 13 ... I kind of set the stage for the puzzle solvers amongst us.

I give up... Nobody can teach a student who doesn't listen.

Here's a thought... copy/paste the code in message 25 and try it out... I compiled it here and tested it... I know it works.

Are you reading any of my suggestions?

No it won't work... Go back to the show... the problem begins with 1 initial swap... you would swap all 9 of them.

I would not suggest trying to compare two string arrays... that's a lot of coding.

Take a look at my suggestion in message 13 for a starting point... if you want to print names instead of...

Actually, I've been messing with this pretty much since the OP gave it to us... still no closer to a codeable solution...
It's an excellent brain teaser!

Hey my friend... check message #13 ... I've been working on this a bit and I've set out a starting point, if you want to take it on as a challenge...

create the array first...then input your data directly into the array..


char Names[10][20];

for(int i = 0; i < 10; i++)
scanf("%19s",Names[i]);

Please see my post #13 ... If we follow the shows, the problem begins with a single swap and you have to re-oder the array without repeating any swaps...

If you are following the problem as given in both Futurama (yuk!) and Stargate (well, ok) you need to begin with only 1 swap. From there the problem is to get them back into their right places...

@mk27 ... I've been thinking about this one, it presents a very interesting logic problem...
In "C" terms...



// untested!

#include <stdio.h>
#include <time.h>
#include <stdlib.h>

It's actually a logic puzzle, Lase...

Two people's minds are swapped
They cannot be swapped back because you can only swap each pair once
You can use additional bodies as needed
The...

What you need is probably the standard "card shuffle" algorythm like laserlight is suggesting...



// card shuffle demonstration

#include <stdio.h>
#include <time.h>
#include <stdlib.h>

We don't give out finished code here. We will point you in the right direction and help you debug failed code... but we're not going to hand you a complete algorythm in ready to use form.

I gave...

You need one more body...



#include <stdio.h>

int main (void)
{
int body1, body2, body3;