stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



int main() {

	string t, s;

	cin>>s>>t;

	cout<<t+s<<endl;

	

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.342459253576544x):
#include <stdio.h>



int main(){

    char a[100], b[100];

    scanf("%s %s", a, b);

    printf("%s%s", b, a);

}
// Slower C++ solution:
#include <iostream>

#include <string>

using namespace std;

int main() {

    string S,T;

    cin>>S>>T;

    

    cout<<T+S<<endl;

	

	return 0; 

}

// Faster C++ solution for the same problem (measured speedup: 5.341954578175478x):
#include <stdio.h>



int main(){

    char a[100], b[100];

    scanf("%s %s", a, b);

    printf("%s%s", b, a);

}
// Slower C++ solution:
#include <iostream>

using namespace std;

int main ()

{

char S[100],T[100];

cin>>S>>T;

cout<<T<<S<<endl;



}

// Faster C++ solution for the same problem (measured speedup: 5.294425699239076x):
#include <stdio.h>



int main(){

    char a[100], b[100];

    scanf("%s %s", a, b);

    printf("%s%s", b, a);

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    string S,T,c;

    cin>>S>>T;

    c=T+S;

    cout<<c<<endl;

    return 0;





}

// Faster C++ solution for the same problem (measured speedup: 5.344276053290677x):
#include <stdio.h>



int main(){

    char a[100], b[100];

    scanf("%s %s", a, b);

    printf("%s%s", b, a);

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;



#define ll long long

#define fast_io ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);



int main()

{

    fast_io;

    string s,t;

    cin >> s >> t;

    cout << t << s;

}


// Faster C++ solution for the same problem (measured speedup: 5.397984004074325x):
#include <stdio.h>



int main(){

    char a[100], b[100];

    scanf("%s %s", a, b);

    printf("%s%s", b, a);

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    string a,b;

    cin>>a;

    cin>>b;

    cout<<b<<a;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.314086477023701x):
#include <stdio.h>



int main (){

	char huruf1[249];

	char huruf2[249];

	

	scanf("%s %s", huruf1 , huruf2);

	printf("%s%s", huruf2 , huruf1);



	return 0;

}
// Slower C++ solution:
#include <iostream>

#include <string>

using namespace std;



int main()

{

	string s,t,r;

	cin>>s>>t;

	r = t+s;

	cout<<r;

	return 0;

}




// Faster C++ solution for the same problem (measured speedup: 5.320585039792884x):
#include <stdio.h>



int main (){

	char huruf1[249];

	char huruf2[249];

	

	scanf("%s %s", huruf1 , huruf2);

	printf("%s%s", huruf2 , huruf1);



	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    string s,t;

    cin>>s>>t;

    cout<<t<<s<<endl;

}






// Faster C++ solution for the same problem (measured speedup: 5.333698258731656x):
#include <stdio.h>



int main (){

	char huruf1[249];

	char huruf2[249];

	

	scanf("%s %s", huruf1 , huruf2);

	printf("%s%s", huruf2 , huruf1);



	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

     string s,t;

     cin>>s>>t;

     cout<<t<<s<<endl;

     return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.333698258731656x):
#include <stdio.h>



int main (){

	char huruf1[249];

	char huruf2[249];

	

	scanf("%s %s", huruf1 , huruf2);

	printf("%s%s", huruf2 , huruf1);



	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



int main() {

	string t, s;

	cin>>s>>t;

	cout<<t+s<<endl;

	

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.341405542553588x):
#include <stdio.h>



int main (){

	char huruf1[249];

	char huruf2[249];

	

	scanf("%s %s", huruf1 , huruf2);

	printf("%s%s", huruf2 , huruf1);



	return 0;

}
// Slower C++ solution:
#include <iostream>

#include <string>

using namespace std;

int main() {

    string S,T;

    cin>>S>>T;

    

    cout<<T+S<<endl;

	

	return 0; 

}

// Faster C++ solution for the same problem (measured speedup: 5.340900966691331x):
#include <stdio.h>



int main (){

	char huruf1[249];

	char huruf2[249];

	

	scanf("%s %s", huruf1 , huruf2);

	printf("%s%s", huruf2 , huruf1);



	return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;

int main ()

{

char S[100],T[100];

cin>>S>>T;

cout<<T<<S<<endl;



}

// Faster C++ solution for the same problem (measured speedup: 5.293381462033939x):
#include <stdio.h>



int main (){

	char huruf1[249];

	char huruf2[249];

	

	scanf("%s %s", huruf1 , huruf2);

	printf("%s%s", huruf2 , huruf1);



	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    string S,T,c;

    cin>>S>>T;

    c=T+S;

    cout<<c<<endl;

    return 0;





}

// Faster C++ solution for the same problem (measured speedup: 5.343221983934265x):
#include <stdio.h>



int main (){

	char huruf1[249];

	char huruf2[249];

	

	scanf("%s %s", huruf1 , huruf2);

	printf("%s%s", huruf2 , huruf1);



	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;



#define ll long long

#define fast_io ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);



int main()

{

    fast_io;

    string s,t;

    cin >> s >> t;

    cout << t << s;

}


// Faster C++ solution for the same problem (measured speedup: 5.396919341719994x):
#include <stdio.h>



int main (){

	char huruf1[249];

	char huruf2[249];

	

	scanf("%s %s", huruf1 , huruf2);

	printf("%s%s", huruf2 , huruf1);



	return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    string a,b;

    cin>>a;

    cin>>b;

    cout<<b<<a;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.315486529069479x):
#include <stdio.h>

int main(){

	

	char name1[105];

	char name2[105];

	scanf("%s%s", &name1, &name2);

	printf("%s%s", name2, name1);

	

return 0;

}
// Slower C++ solution:
#include <iostream>

#include <string>

using namespace std;



int main()

{

	string s,t,r;

	cin>>s>>t;

	r = t+s;

	cout<<r;

	return 0;

}




// Faster C++ solution for the same problem (measured speedup: 5.32198680395346x):
#include <stdio.h>

int main(){

	

	char name1[105];

	char name2[105];

	scanf("%s%s", &name1, &name2);

	printf("%s%s", name2, name1);

	

return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    string s,t;

    cin>>s>>t;

    cout<<t<<s<<endl;

}






// Faster C++ solution for the same problem (measured speedup: 5.335103477707858x):
#include <stdio.h>

int main(){

	

	char name1[105];

	char name2[105];

	scanf("%s%s", &name1, &name2);

	printf("%s%s", name2, name1);

	

return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

     string s,t;

     cin>>s>>t;

     cout<<t<<s<<endl;

     return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.335103477707858x):
#include <stdio.h>

int main(){

	

	char name1[105];

	char name2[105];

	scanf("%s%s", &name1, &name2);

	printf("%s%s", name2, name1);

	

return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



int main() {

	string t, s;

	cin>>s>>t;

	cout<<t+s<<endl;

	

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.34281279209488x):
#include <stdio.h>

int main(){

	

	char name1[105];

	char name2[105];

	scanf("%s%s", &name1, &name2);

	printf("%s%s", name2, name1);

	

return 0;

}
// Slower C++ solution:
#include <iostream>

#include <string>

using namespace std;

int main() {

    string S,T;

    cin>>S>>T;

    

    cout<<T+S<<endl;

	

	return 0; 

}

// Faster C++ solution for the same problem (measured speedup: 5.342308083296799x):
#include <stdio.h>

int main(){

	

	char name1[105];

	char name2[105];

	scanf("%s%s", &name1, &name2);

	printf("%s%s", name2, name1);

	

return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;

int main ()

{

char S[100],T[100];

cin>>S>>T;

cout<<T<<S<<endl;



}

// Faster C++ solution for the same problem (measured speedup: 5.2947760591254704x):
#include <stdio.h>

int main(){

	

	char name1[105];

	char name2[105];

	scanf("%s%s", &name1, &name2);

	printf("%s%s", name2, name1);

	

return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    string S,T,c;

    cin>>S>>T;

    c=T+S;

    cout<<c<<endl;

    return 0;





}

// Faster C++ solution for the same problem (measured speedup: 5.344629712036168x):
#include <stdio.h>

int main(){

	

	char name1[105];

	char name2[105];

	scanf("%s%s", &name1, &name2);

	printf("%s%s", name2, name1);

	

return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;



#define ll long long

#define fast_io ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);



int main()

{

    fast_io;

    string s,t;

    cin >> s >> t;

    cout << t << s;

}


// Faster C++ solution for the same problem (measured speedup: 5.3983412169563x):
#include <stdio.h>

int main(){

	

	char name1[105];

	char name2[105];

	scanf("%s%s", &name1, &name2);

	printf("%s%s", name2, name1);

	

return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    string a,b;

    cin>>a;

    cin>>b;

    cout<<b<<a;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.309309966137709x):
#include <stdio.h>

int main () {

	char kata1[102];

	char kata2[102];

	

	scanf ("%s %s",&kata1,&kata2);

	printf ("%s%s\n", kata2, kata1);

	

	return 0;

}
// Slower C++ solution:
#include <iostream>

#include <string>

using namespace std;



int main()

{

	string s,t,r;

	cin>>s>>t;

	r = t+s;

	cout<<r;

	return 0;

}




// Faster C++ solution for the same problem (measured speedup: 5.3158026877419156x):
#include <stdio.h>

int main () {

	char kata1[102];

	char kata2[102];

	

	scanf ("%s %s",&kata1,&kata2);

	printf ("%s%s\n", kata2, kata1);

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    string s,t;

    cin>>s>>t;

    cout<<t<<s<<endl;

}






// Faster C++ solution for the same problem (measured speedup: 5.3289041200014x):
#include <stdio.h>

int main () {

	char kata1[102];

	char kata2[102];

	

	scanf ("%s %s",&kata1,&kata2);

	printf ("%s%s\n", kata2, kata1);

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

     string s,t;

     cin>>s>>t;

     cout<<t<<s<<endl;

     return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.3289041200014x):
#include <stdio.h>

int main () {

	char kata1[102];

	char kata2[102];

	

	scanf ("%s %s",&kata1,&kata2);

	printf ("%s%s\n", kata2, kata1);

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



int main() {

	string t, s;

	cin>>s>>t;

	cout<<t+s<<endl;

	

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.336604476212116x):
#include <stdio.h>

int main () {

	char kata1[102];

	char kata2[102];

	

	scanf ("%s %s",&kata1,&kata2);

	printf ("%s%s\n", kata2, kata1);

	

	return 0;

}
// Slower C++ solution:
#include <iostream>

#include <string>

using namespace std;

int main() {

    string S,T;

    cin>>S>>T;

    

    cout<<T+S<<endl;

	

	return 0; 

}

// Faster C++ solution for the same problem (measured speedup: 5.33610035388258x):
#include <stdio.h>

int main () {

	char kata1[102];

	char kata2[102];

	

	scanf ("%s %s",&kata1,&kata2);

	printf ("%s%s\n", kata2, kata1);

	

	return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;

int main ()

{

char S[100],T[100];

cin>>S>>T;

cout<<T<<S<<endl;



}

// Faster C++ solution for the same problem (measured speedup: 5.288623561633479x):
#include <stdio.h>

int main () {

	char kata1[102];

	char kata2[102];

	

	scanf ("%s %s",&kata1,&kata2);

	printf ("%s%s\n", kata2, kata1);

	

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    string S,T,c;

    cin>>S>>T;

    c=T+S;

    cout<<c<<endl;

    return 0;





}

// Faster C++ solution for the same problem (measured speedup: 5.338419284903513x):
#include <stdio.h>

int main () {

	char kata1[102];

	char kata2[102];

	

	scanf ("%s %s",&kata1,&kata2);

	printf ("%s%s\n", kata2, kata1);

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;



#define ll long long

#define fast_io ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);



int main()

{

    fast_io;

    string s,t;

    cin >> s >> t;

    cout << t << s;

}


// Faster C++ solution for the same problem (measured speedup: 5.392068377382472x):
#include <stdio.h>

int main () {

	char kata1[102];

	char kata2[102];

	

	scanf ("%s %s",&kata1,&kata2);

	printf ("%s%s\n", kata2, kata1);

	

	return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    string a,b;

    cin>>a;

    cin>>b;

    cout<<b<<a;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.313404960210273x):
#include <stdio.h>

// two strings S and T. consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

// S and T are strings consisting of lowercase English letters.

// The lengths of S and T are between 1 and 100 (inclusive).



int main() {

    char firstWord[102]; // this means 100 characters

    char secondWord[102]; // this means 100 characters

    scanf("%s %s", secondWord, firstWord);

    printf("%s%s", firstWord, secondWord);



    return 0;

}
// Slower C++ solution:
#include <iostream>

#include <string>

using namespace std;



int main()

{

	string s,t,r;

	cin>>s>>t;

	r = t+s;

	cout<<r;

	return 0;

}




// Faster C++ solution for the same problem (measured speedup: 5.3199026895568515x):
#include <stdio.h>

// two strings S and T. consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

// S and T are strings consisting of lowercase English letters.

// The lengths of S and T are between 1 and 100 (inclusive).



int main() {

    char firstWord[102]; // this means 100 characters

    char secondWord[102]; // this means 100 characters

    scanf("%s %s", secondWord, firstWord);

    printf("%s%s", firstWord, secondWord);



    return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    string s,t;

    cin>>s>>t;

    cout<<t<<s<<endl;

}






// Faster C++ solution for the same problem (measured speedup: 5.333014226761759x):
#include <stdio.h>

// two strings S and T. consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

// S and T are strings consisting of lowercase English letters.

// The lengths of S and T are between 1 and 100 (inclusive).



int main() {

    char firstWord[102]; // this means 100 characters

    char secondWord[102]; // this means 100 characters

    scanf("%s %s", secondWord, firstWord);

    printf("%s%s", firstWord, secondWord);



    return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

     string s,t;

     cin>>s>>t;

     cout<<t<<s<<endl;

     return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.333014226761759x):
#include <stdio.h>

// two strings S and T. consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

// S and T are strings consisting of lowercase English letters.

// The lengths of S and T are between 1 and 100 (inclusive).



int main() {

    char firstWord[102]; // this means 100 characters

    char secondWord[102]; // this means 100 characters

    scanf("%s %s", secondWord, firstWord);

    printf("%s%s", firstWord, secondWord);



    return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



int main() {

	string t, s;

	cin>>s>>t;

	cout<<t+s<<endl;

	

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.340720522145974x):
#include <stdio.h>

// two strings S and T. consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

// S and T are strings consisting of lowercase English letters.

// The lengths of S and T are between 1 and 100 (inclusive).



int main() {

    char firstWord[102]; // this means 100 characters

    char secondWord[102]; // this means 100 characters

    scanf("%s %s", secondWord, firstWord);

    printf("%s%s", firstWord, secondWord);



    return 0;

}
// Slower C++ solution:
#include <iostream>

#include <string>

using namespace std;

int main() {

    string S,T;

    cin>>S>>T;

    

    cout<<T+S<<endl;

	

	return 0; 

}

// Faster C++ solution for the same problem (measured speedup: 5.340216010994168x):
#include <stdio.h>

// two strings S and T. consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

// S and T are strings consisting of lowercase English letters.

// The lengths of S and T are between 1 and 100 (inclusive).



int main() {

    char firstWord[102]; // this means 100 characters

    char secondWord[102]; // this means 100 characters

    scanf("%s %s", secondWord, firstWord);

    printf("%s%s", firstWord, secondWord);



    return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;

int main ()

{

char S[100],T[100];

cin>>S>>T;

cout<<T<<S<<endl;



}

// Faster C++ solution for the same problem (measured speedup: 5.292702600581108x):
#include <stdio.h>

// two strings S and T. consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

// S and T are strings consisting of lowercase English letters.

// The lengths of S and T are between 1 and 100 (inclusive).



int main() {

    char firstWord[102]; // this means 100 characters

    char secondWord[102]; // this means 100 characters

    scanf("%s %s", secondWord, firstWord);

    printf("%s%s", firstWord, secondWord);



    return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    string S,T,c;

    cin>>S>>T;

    c=T+S;

    cout<<c<<endl;

    return 0;





}

// Faster C++ solution for the same problem (measured speedup: 5.342536730573094x):
#include <stdio.h>

// two strings S and T. consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

// S and T are strings consisting of lowercase English letters.

// The lengths of S and T are between 1 and 100 (inclusive).



int main() {

    char firstWord[102]; // this means 100 characters

    char secondWord[102]; // this means 100 characters

    scanf("%s %s", secondWord, firstWord);

    printf("%s%s", firstWord, secondWord);



    return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;



#define ll long long

#define fast_io ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);



int main()

{

    fast_io;

    string s,t;

    cin >> s >> t;

    cout << t << s;

}


// Faster C++ solution for the same problem (measured speedup: 5.396227201822008x):
#include <stdio.h>

// two strings S and T. consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

// S and T are strings consisting of lowercase English letters.

// The lengths of S and T are between 1 and 100 (inclusive).



int main() {

    char firstWord[102]; // this means 100 characters

    char secondWord[102]; // this means 100 characters

    scanf("%s %s", secondWord, firstWord);

    printf("%s%s", firstWord, secondWord);



    return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    string a,b;

    cin>>a;

    cin>>b;

    cout<<b<<a;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.30847811363334x):
#include <stdio.h>

int main (){

	char string1 [105];

	char string2 [105];

	scanf ("%s %s", &string1, &string2);

	printf ("%s%s\n", string2, string1);

	return 0;

}
// Slower C++ solution:
#include <iostream>

#include <string>

using namespace std;



int main()

{

	string s,t,r;

	cin>>s>>t;

	r = t+s;

	cout<<r;

	return 0;

}




// Faster C++ solution for the same problem (measured speedup: 5.3149698179703755x):
#include <stdio.h>

int main (){

	char string1 [105];

	char string2 [105];

	scanf ("%s %s", &string1, &string2);

	printf ("%s%s\n", string2, string1);

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    string s,t;

    cin>>s>>t;

    cout<<t<<s<<endl;

}






// Faster C++ solution for the same problem (measured speedup: 5.328069197522576x):
#include <stdio.h>

int main (){

	char string1 [105];

	char string2 [105];

	scanf ("%s %s", &string1, &string2);

	printf ("%s%s\n", string2, string1);

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

     string s,t;

     cin>>s>>t;

     cout<<t<<s<<endl;

     return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.328069197522576x):
#include <stdio.h>

int main (){

	char string1 [105];

	char string2 [105];

	scanf ("%s %s", &string1, &string2);

	printf ("%s%s\n", string2, string1);

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



int main() {

	string t, s;

	cin>>s>>t;

	cout<<t+s<<endl;

	

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.3357683472562485x):
#include <stdio.h>

int main (){

	char string1 [105];

	char string2 [105];

	scanf ("%s %s", &string1, &string2);

	printf ("%s%s\n", string2, string1);

	return 0;

}
// Slower C++ solution:
#include <iostream>

#include <string>

using namespace std;

int main() {

    string S,T;

    cin>>S>>T;

    

    cout<<T+S<<endl;

	

	return 0; 

}

// Faster C++ solution for the same problem (measured speedup: 5.335264303911632x):
#include <stdio.h>

int main (){

	char string1 [105];

	char string2 [105];

	scanf ("%s %s", &string1, &string2);

	printf ("%s%s\n", string2, string1);

	return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;

int main ()

{

char S[100],T[100];

cin>>S>>T;

cout<<T<<S<<endl;



}

// Faster C++ solution for the same problem (measured speedup: 5.287794950235298x):
#include <stdio.h>

int main (){

	char string1 [105];

	char string2 [105];

	scanf ("%s %s", &string1, &string2);

	printf ("%s%s\n", string2, string1);

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    string S,T,c;

    cin>>S>>T;

    c=T+S;

    cout<<c<<endl;

    return 0;





}

// Faster C++ solution for the same problem (measured speedup: 5.337582871606899x):
#include <stdio.h>

int main (){

	char string1 [105];

	char string2 [105];

	scanf ("%s %s", &string1, &string2);

	printf ("%s%s\n", string2, string1);

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;



#define ll long long

#define fast_io ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);



int main()

{

    fast_io;

    string s,t;

    cin >> s >> t;

    cout << t << s;

}


// Faster C++ solution for the same problem (measured speedup: 5.391223558448926x):
#include <stdio.h>

int main (){

	char string1 [105];

	char string2 [105];

	scanf ("%s %s", &string1, &string2);

	printf ("%s%s\n", string2, string1);

	return 0;

}