1985A_Creating_Words.cpp

/*						A. Creating Words
										time limit per test 1 second
										memory limit per test 256 megabytes
Matthew is given two strings a and b, both of length 3.
He thinks it's particularly funny to create two new words by swapping the first character of a with the first character of b.
He wants you to output a and b after the swap.
Note that the new words may not necessarily be different.
Input
The first line contains t (1≤t≤100)  — the number of test cases.
The first and only line of each test case contains two space-separated strings, aand b, both of length 3. The strings only contain lowercase Latin letters.
Output
For each test case, after the swap, output a and b, separated by a space.
Example
Input:
6
bit set
cat dog
hot dog
uwu owo
cat cat
zzz zzz
Output:
sit bet
dat cog
dot hog
owu uwo
cat cat
zzz zzz
																*/
#include<bits/stdc++.h>
using namespace std;
int t,n,i,j;
void solve(){
   string a,b;
   cin>>a>>b;
   string temp = " ";
   temp = a[0];
   a[0]	= b[0];
   b[0] = temp[0];
   cout<<a<<"  "<<b<<endl;
}
int main(){
	ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>t;
    while(t--){
    	solve();
	}
}