C language: realize the exchange of two numbers without creating temporary variables

First, let's talk about XOR ^ Principle ： Corresponding binary bit , Same as 0, Dissimilarity is 1
such as a=3,b=5, The corresponding binary complements are 011 101
a= 011
b= 101
a^b= 110

Then the principle of realizing the exchange of two numbers by XOR here is
a^a=0, Because your two numbers are the same , The corresponding bits must be all the same , Same as 0 Well

0^b=b, for instance ：
c= 000
b= 101
c^b=101=b

Then through the a ^ a=0 ,0 ^ b=b
We can derive a ^ a ^ b=0 ^ b= b

Different or satisfying the commutative law （ Students can verify by themselves ）
in other words a ^ a ^ b=a ^ (a ^ b)= b
b ^ (b ^ a)= a

#include<stdio.h>
// Do not create temporary variables to exchange two numbers 
int main()
{
    
	int a = 0;
	int b = 0;
	printf(" Please enter two numbers to exchange ：");
	scanf("%d %d", &a, &b);
	printf(" Exchange before a=%d b=%d\n", a, b);
	a = a ^ b;
	b = a ^ b;
	a = a ^ b;
	printf(" After exchanging a=%d b=%d\n", a, b);
	// for instance ：a=3,b=5
	// Positive numbers have the same original and inverse complement 
	//a repair ：011
	//b repair ：101

	//a=a^b：110

	//b=a^b：011
	//a=a^b：101
	// thus , complete ab Two number exchange 
	return 0;
}