Skip to content

Instantly share code, notes, and snippets.

@passos
Created July 8, 2011 14:15
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save passos/1071933 to your computer and use it in GitHub Desktop.
Save passos/1071933 to your computer and use it in GitHub Desktop.
Chinese Chess problem solution 2
BYTE i = 81;
while (i--)
{
if (i / 9 % 3 != i % 9 % 3)
printf("A = %d, B = %dn", i / 9 + 1, i % 9 + 1);
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment