stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

 string S;

 cin>>S;

 char a=',';

for(int i=0;i<S.length();i++){

    if(S[i]==a){S[i]=' ';}

}

cout<<S;

 return 0;



}

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

#include <string.h>



int main () {

	char s[101];

	int i;

	scanf ("%[^\n]", s);

	int pnjg = strlen (s);

	for (int i = 0; i < pnjg ; i++) {

		if (s[i] == ',') {

			s[i] = ' ';

		}

	}

	printf ("%s", s);

	

	return 0;

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



using namespace std;



int main()

{

    string s;

    int i=0;

    cin>>s;

    for(i=0;i<s.size();i++){

        if (s[i]==',')

            s[i]=' ' ;



    }

    cout<<s;

    return 0;

}


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

#include <string.h>



int main () {

	char s[101];

	int i;

	scanf ("%[^\n]", s);

	int pnjg = strlen (s);

	for (int i = 0; i < pnjg ; i++) {

		if (s[i] == ',') {

			s[i] = ' ';

		}

	}

	printf ("%s", s);

	

	return 0;

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

#include <cstdio>

#include <string>

#include <cstring>

#include <stdlib.h>

#include <math.h>

#include <ctype.h>

#include <queue>

#include <map>

#include <set>

#include <string.h>

#include <algorithm>

using namespace std;



int main()

{

    char s[25];

   scanf("%s",s);

    for(int i=0;s[i]!='\0';++i)

    {

        if(s[i]==',')

            s[i]=' ';

    }

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

    return 0;

}


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

#include <stdio.h>

int main (){

	char input[101],temp;

	scanf ("%s",input);

	

	for (int i=0; i < strlen(input);i++){

		if (input[i]== ','){

			printf(" ");

		}

		else {

			printf("%c",input[i]);

		}

	}

	



	return 0;

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



using namespace std;



int main()

{

    char s[30];

    scanf("%s",s);

    for(int i = 0; i < 19; i ++)

    {

        if(s[i] == ',')printf(" ");

        else printf("%c",s[i]);

    }

    printf("\n");

    return 0;

}


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

#include <stdio.h>

int main (){

	char input[101],temp;

	scanf ("%s",input);

	

	for (int i=0; i < strlen(input);i++){

		if (input[i]== ','){

			printf(" ");

		}

		else {

			printf("%c",input[i]);

		}

	}

	



	return 0;

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



using namespace std;



int main()

{

 string S;

 cin>>S;

 char a=',';

for(int i=0;i<S.length();i++){

    if(S[i]==a){S[i]=' ';}

}

cout<<S;

 return 0;



}

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

#include <stdio.h>

int main (){

	char input[101],temp;

	scanf ("%s",input);

	

	for (int i=0; i < strlen(input);i++){

		if (input[i]== ','){

			printf(" ");

		}

		else {

			printf("%c",input[i]);

		}

	}

	



	return 0;

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



using namespace std;



int main()

{

    string s;

    int i=0;

    cin>>s;

    for(i=0;i<s.size();i++){

        if (s[i]==',')

            s[i]=' ' ;



    }

    cout<<s;

    return 0;

}


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

#include <stdio.h>

int main (){

	char input[101],temp;

	scanf ("%s",input);

	

	for (int i=0; i < strlen(input);i++){

		if (input[i]== ','){

			printf(" ");

		}

		else {

			printf("%c",input[i]);

		}

	}

	



	return 0;

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

#include <cstdio>

#include <string>

#include <cstring>

#include <stdlib.h>

#include <math.h>

#include <ctype.h>

#include <queue>

#include <map>

#include <set>

#include <string.h>

#include <algorithm>

using namespace std;



int main()

{

    char s[25];

   scanf("%s",s);

    for(int i=0;s[i]!='\0';++i)

    {

        if(s[i]==',')

            s[i]=' ';

    }

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

    return 0;

}


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



int main(){

	char s[19];

	scanf("%[^\n]",s);

	int lol;

	for(int i=0;i<19;i++){

		if(s[i]==','){

			printf(" ");

		}else {

			printf("%c",s[i]);

		}

	}

return 0;

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



using namespace std;



int main()

{

    char s[30];

    scanf("%s",s);

    for(int i = 0; i < 19; i ++)

    {

        if(s[i] == ',')printf(" ");

        else printf("%c",s[i]);

    }

    printf("\n");

    return 0;

}


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



int main(){

	char s[19];

	scanf("%[^\n]",s);

	int lol;

	for(int i=0;i<19;i++){

		if(s[i]==','){

			printf(" ");

		}else {

			printf("%c",s[i]);

		}

	}

return 0;

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



using namespace std;



int main()

{

 string S;

 cin>>S;

 char a=',';

for(int i=0;i<S.length();i++){

    if(S[i]==a){S[i]=' ';}

}

cout<<S;

 return 0;



}

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



int main(){

	char s[19];

	scanf("%[^\n]",s);

	int lol;

	for(int i=0;i<19;i++){

		if(s[i]==','){

			printf(" ");

		}else {

			printf("%c",s[i]);

		}

	}

return 0;

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



using namespace std;



int main()

{

    string s;

    int i=0;

    cin>>s;

    for(i=0;i<s.size();i++){

        if (s[i]==',')

            s[i]=' ' ;



    }

    cout<<s;

    return 0;

}


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



int main(){

	char s[19];

	scanf("%[^\n]",s);

	int lol;

	for(int i=0;i<19;i++){

		if(s[i]==','){

			printf(" ");

		}else {

			printf("%c",s[i]);

		}

	}

return 0;

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

#include <cstdio>

#include <string>

#include <cstring>

#include <stdlib.h>

#include <math.h>

#include <ctype.h>

#include <queue>

#include <map>

#include <set>

#include <string.h>

#include <algorithm>

using namespace std;



int main()

{

    char s[25];

   scanf("%s",s);

    for(int i=0;s[i]!='\0';++i)

    {

        if(s[i]==',')

            s[i]=' ';

    }

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

    return 0;

}


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

#include <string.h>



int main()

{ 

    

    char x[255];

    scanf("%s",x);

    int a= strlen(x);  

    for(int i=0;i<a;i++){

        if(x[i]==',')

        printf(" ",x[i]);

        else{

        printf("%c",x[i]);

		}

    }   

    return 0;

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



using namespace std;



int main()

{

    char s[30];

    scanf("%s",s);

    for(int i = 0; i < 19; i ++)

    {

        if(s[i] == ',')printf(" ");

        else printf("%c",s[i]);

    }

    printf("\n");

    return 0;

}


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

#include <string.h>



int main()

{ 

    

    char x[255];

    scanf("%s",x);

    int a= strlen(x);  

    for(int i=0;i<a;i++){

        if(x[i]==',')

        printf(" ",x[i]);

        else{

        printf("%c",x[i]);

		}

    }   

    return 0;

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



using namespace std;



int main()

{

 string S;

 cin>>S;

 char a=',';

for(int i=0;i<S.length();i++){

    if(S[i]==a){S[i]=' ';}

}

cout<<S;

 return 0;



}

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

#include <string.h>



int main()

{ 

    

    char x[255];

    scanf("%s",x);

    int a= strlen(x);  

    for(int i=0;i<a;i++){

        if(x[i]==',')

        printf(" ",x[i]);

        else{

        printf("%c",x[i]);

		}

    }   

    return 0;

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



using namespace std;



int main()

{

    string s;

    int i=0;

    cin>>s;

    for(i=0;i<s.size();i++){

        if (s[i]==',')

            s[i]=' ' ;



    }

    cout<<s;

    return 0;

}


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

#include <string.h>



int main()

{ 

    

    char x[255];

    scanf("%s",x);

    int a= strlen(x);  

    for(int i=0;i<a;i++){

        if(x[i]==',')

        printf(" ",x[i]);

        else{

        printf("%c",x[i]);

		}

    }   

    return 0;

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

#include<cstring>

using namespace std;

int main()

{

    string n;

    int a,i;

    cin>>n;

    a=n.length();

    for(i=0;i<a;i++)

    {

        if(n[i]==',') cout<<" ";

        else cout<<n[i];

    }

    cout<<endl;

    return 0;

}

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

using namespace std;

int main(){

	int i;char c;

	for(i=1;i<=19;i++){

		c=getchar();

		if(c!=',') printf("%c",c);

		else printf(" ");

	}

	printf("\n");

	return 0;

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

using namespace std;

int main()

{

	string n;

	cin>>n;

	int l=n.length();

	for(int i=0;i<l;i++)

	{

		if(n[i]==',') n[i]=' ';

	}

	cout<<n<<endl;

}

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

using namespace std;

int main(){

	int i;char c;

	for(i=1;i<=19;i++){

		c=getchar();

		if(c!=',') printf("%c",c);

		else printf(" ");

	}

	printf("\n");

	return 0;

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

using namespace std;

string s;

int main()

{

	cin>>s;

	for(int i=0;i<s.size();i++)

	{

		if(s[i]==',') cout<<" ";

		else cout<<s[i];

	}

	cout<<endl;

	return 0;

}


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

using namespace std;

int main(){

	int i;char c;

	for(i=1;i<=19;i++){

		c=getchar();

		if(c!=',') printf("%c",c);

		else printf(" ");

	}

	printf("\n");

	return 0;

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

using namespace std;

#include <string>

#include <algorithm>

int main()

{

    char s[20];

    cin>>s;

    for(int i=0;s[i];i++)

    {

        if(s[i]==',')

            s[i]=' ';

    }

    cout<<s;

}




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

 

int main(){

    char s[21];

    scanf ("%[^\n]", s);

    for (int i = 0; s[i] != '\0'; i++)

        if (s[i] == ',') s[i] = ' ';

    puts (s);

    return 0;

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

using namespace std;

string s;

int main (){

    cin >> s;

    for(int i=0;i<s.size();i++){

        if(s[i]!=',') cout<<s[i];

        else cout<<' ';

    }

}


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

 

int main(){

    char s[21];

    scanf ("%[^\n]", s);

    for (int i = 0; s[i] != '\0'; i++)

        if (s[i] == ',') s[i] = ' ';

    puts (s);

    return 0;

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

#include <string>

using namespace std;

string s;

int main(){

    cin>>s;

    for (int i=0; i<s.length(); i++){

        if (s[i]==',')cout<<" ";

        else cout<<s[i];

    }

    return 0;

}

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

 

int main(){

    char s[21];

    scanf ("%[^\n]", s);

    for (int i = 0; s[i] != '\0'; i++)

        if (s[i] == ',') s[i] = ' ';

    puts (s);

    return 0;

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

#include<bits/stdc++.h>



using namespace std;



int main()

{   string s;

    int i ;

    string news="";

    cin>>s;

    for (i=0;i<19;i++){

        if (s[i]== ','){

            s[i]=' ';

            news=news+s[i];}

        else{

            news=news+s[i];

        }}

        cout<<news;





    return 0;

}


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

 

int main(){

    char s[21];

    scanf ("%[^\n]", s);

    for (int i = 0; s[i] != '\0'; i++)

        if (s[i] == ',') s[i] = ' ';

    puts (s);

    return 0;

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



int main() {

 std:: string s;

 std::cin>>s;

 if (s.size()==19){

   

    for(int i=0;i<s.size();i++){



         if(s[i]==','){

            s[i]=' ';

         }

      }



    }

    std::cout<<s;

 }

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

 

int main(){

    char s[21];

    scanf ("%[^\n]", s);

    for (int i = 0; s[i] != '\0'; i++)

        if (s[i] == ',') s[i] = ' ';

    puts (s);

    return 0;

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

using namespace std;



int main() {

	string x;

	cin >> x;

	for (int i = 0 ; i < int(x.size()); i++){

		if (x[i] == ','){

				x[i] = ' ';

		}

	}

	cout << x;

}


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

 

int main(){

    char s[21];

    scanf ("%[^\n]", s);

    for (int i = 0; s[i] != '\0'; i++)

        if (s[i] == ',') s[i] = ' ';

    puts (s);

    return 0;

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

using namespace std;



int main()

{

    string s; cin >> s;

    for (int i = 0, n = s.length(); i < n; i ++)

    {

        if (s[i] == ',')

        {

            s[i] = ' ';

        }

    }

    std::cout << s << std::endl;

    return 0;

}


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

 

int main(){

    char s[21];

    scanf ("%[^\n]", s);

    for (int i = 0; s[i] != '\0'; i++)

        if (s[i] == ',') s[i] = ' ';

    puts (s);

    return 0;

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

using namespace std;

#include <string>

#include <algorithm>

int main()

{

    char s[20];

    cin>>s;

    for(int i=0;s[i];i++)

    {

        if(s[i]==',')

            s[i]=' ';

    }

    cout<<s;

}




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



int main()

{

    char op[19];



    scanf("%s", &op);



    for (int i = 0 ; op[i] != '\0' ; i++){



        if (op[i] != ','){

        printf("%c", op[i]);

        }else {

        printf(" ");

        }





    }



    return 0;

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

using namespace std;

string s;

int main (){

    cin >> s;

    for(int i=0;i<s.size();i++){

        if(s[i]!=',') cout<<s[i];

        else cout<<' ';

    }

}


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



int main()

{

    char op[19];



    scanf("%s", &op);



    for (int i = 0 ; op[i] != '\0' ; i++){



        if (op[i] != ','){

        printf("%c", op[i]);

        }else {

        printf(" ");

        }





    }



    return 0;

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

#include <string>

using namespace std;

string s;

int main(){

    cin>>s;

    for (int i=0; i<s.length(); i++){

        if (s[i]==',')cout<<" ";

        else cout<<s[i];

    }

    return 0;

}

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



int main()

{

    char op[19];



    scanf("%s", &op);



    for (int i = 0 ; op[i] != '\0' ; i++){



        if (op[i] != ','){

        printf("%c", op[i]);

        }else {

        printf(" ");

        }





    }



    return 0;

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

#include<bits/stdc++.h>



using namespace std;



int main()

{   string s;

    int i ;

    string news="";

    cin>>s;

    for (i=0;i<19;i++){

        if (s[i]== ','){

            s[i]=' ';

            news=news+s[i];}

        else{

            news=news+s[i];

        }}

        cout<<news;





    return 0;

}


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



int main()

{

    char op[19];



    scanf("%s", &op);



    for (int i = 0 ; op[i] != '\0' ; i++){



        if (op[i] != ','){

        printf("%c", op[i]);

        }else {

        printf(" ");

        }





    }



    return 0;

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



int main() {

 std:: string s;

 std::cin>>s;

 if (s.size()==19){

   

    for(int i=0;i<s.size();i++){



         if(s[i]==','){

            s[i]=' ';

         }

      }



    }

    std::cout<<s;

 }

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



int main()

{

    char op[19];



    scanf("%s", &op);



    for (int i = 0 ; op[i] != '\0' ; i++){



        if (op[i] != ','){

        printf("%c", op[i]);

        }else {

        printf(" ");

        }





    }



    return 0;

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

using namespace std;



int main() {

	string x;

	cin >> x;

	for (int i = 0 ; i < int(x.size()); i++){

		if (x[i] == ','){

				x[i] = ' ';

		}

	}

	cout << x;

}


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



int main()

{

    char op[19];



    scanf("%s", &op);



    for (int i = 0 ; op[i] != '\0' ; i++){



        if (op[i] != ','){

        printf("%c", op[i]);

        }else {

        printf(" ");

        }





    }



    return 0;

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

using namespace std;



int main()

{

    string s; cin >> s;

    for (int i = 0, n = s.length(); i < n; i ++)

    {

        if (s[i] == ',')

        {

            s[i] = ' ';

        }

    }

    std::cout << s << std::endl;

    return 0;

}


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



int main()

{

    char op[19];



    scanf("%s", &op);



    for (int i = 0 ; op[i] != '\0' ; i++){



        if (op[i] != ','){

        printf("%c", op[i]);

        }else {

        printf(" ");

        }





    }



    return 0;

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

using namespace std;

#include <string>

#include <algorithm>

int main()

{

    char s[20];

    cin>>s;

    for(int i=0;s[i];i++)

    {

        if(s[i]==',')

            s[i]=' ';

    }

    cout<<s;

}




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



int main(){

char a[101];

scanf("%s",&a);

for (int i=0;i<101;i++){

	if(a[i]==','){

		a[i]=' ';

	}

}

	printf("%s",a);

	puts("");

return 0;	

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

using namespace std;

string s;

int main (){

    cin >> s;

    for(int i=0;i<s.size();i++){

        if(s[i]!=',') cout<<s[i];

        else cout<<' ';

    }

}


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



int main(){

char a[101];

scanf("%s",&a);

for (int i=0;i<101;i++){

	if(a[i]==','){

		a[i]=' ';

	}

}

	printf("%s",a);

	puts("");

return 0;	

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

#include <string>

using namespace std;

string s;

int main(){

    cin>>s;

    for (int i=0; i<s.length(); i++){

        if (s[i]==',')cout<<" ";

        else cout<<s[i];

    }

    return 0;

}

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



int main(){

char a[101];

scanf("%s",&a);

for (int i=0;i<101;i++){

	if(a[i]==','){

		a[i]=' ';

	}

}

	printf("%s",a);

	puts("");

return 0;	

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

#include<bits/stdc++.h>



using namespace std;



int main()

{   string s;

    int i ;

    string news="";

    cin>>s;

    for (i=0;i<19;i++){

        if (s[i]== ','){

            s[i]=' ';

            news=news+s[i];}

        else{

            news=news+s[i];

        }}

        cout<<news;





    return 0;

}


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



int main(){

char a[101];

scanf("%s",&a);

for (int i=0;i<101;i++){

	if(a[i]==','){

		a[i]=' ';

	}

}

	printf("%s",a);

	puts("");

return 0;	

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



int main() {

 std:: string s;

 std::cin>>s;

 if (s.size()==19){

   

    for(int i=0;i<s.size();i++){



         if(s[i]==','){

            s[i]=' ';

         }

      }



    }

    std::cout<<s;

 }

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



int main(){

char a[101];

scanf("%s",&a);

for (int i=0;i<101;i++){

	if(a[i]==','){

		a[i]=' ';

	}

}

	printf("%s",a);

	puts("");

return 0;	

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

using namespace std;



int main() {

	string x;

	cin >> x;

	for (int i = 0 ; i < int(x.size()); i++){

		if (x[i] == ','){

				x[i] = ' ';

		}

	}

	cout << x;

}


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



int main(){

char a[101];

scanf("%s",&a);

for (int i=0;i<101;i++){

	if(a[i]==','){

		a[i]=' ';

	}

}

	printf("%s",a);

	puts("");

return 0;	

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

using namespace std;



int main()

{

    string s; cin >> s;

    for (int i = 0, n = s.length(); i < n; i ++)

    {

        if (s[i] == ',')

        {

            s[i] = ' ';

        }

    }

    std::cout << s << std::endl;

    return 0;

}


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



int main(){

char a[101];

scanf("%s",&a);

for (int i=0;i<101;i++){

	if(a[i]==','){

		a[i]=' ';

	}

}

	printf("%s",a);

	puts("");

return 0;	

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

using namespace std;

#include <string>

#include <algorithm>

int main()

{

    char s[20];

    cin>>s;

    for(int i=0;s[i];i++)

    {

        if(s[i]==',')

            s[i]=' ';

    }

    cout<<s;

}




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



int main () {

	char str[25];

	scanf("%[^\n]", str);

		

	for (int i =0 ; str [i] != '\0'; i++) {

		if(str[i] != ','){

			printf("%c", str[i]);

		}

		else{

			printf(" ", str[i]);

		}

			

		}

	puts("");

	return 0;

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

using namespace std;

string s;

int main (){

    cin >> s;

    for(int i=0;i<s.size();i++){

        if(s[i]!=',') cout<<s[i];

        else cout<<' ';

    }

}


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



int main () {

	char str[25];

	scanf("%[^\n]", str);

		

	for (int i =0 ; str [i] != '\0'; i++) {

		if(str[i] != ','){

			printf("%c", str[i]);

		}

		else{

			printf(" ", str[i]);

		}

			

		}

	puts("");

	return 0;

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

#include <string>

using namespace std;

string s;

int main(){

    cin>>s;

    for (int i=0; i<s.length(); i++){

        if (s[i]==',')cout<<" ";

        else cout<<s[i];

    }

    return 0;

}

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



int main () {

	char str[25];

	scanf("%[^\n]", str);

		

	for (int i =0 ; str [i] != '\0'; i++) {

		if(str[i] != ','){

			printf("%c", str[i]);

		}

		else{

			printf(" ", str[i]);

		}

			

		}

	puts("");

	return 0;

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

#include<bits/stdc++.h>



using namespace std;



int main()

{   string s;

    int i ;

    string news="";

    cin>>s;

    for (i=0;i<19;i++){

        if (s[i]== ','){

            s[i]=' ';

            news=news+s[i];}

        else{

            news=news+s[i];

        }}

        cout<<news;





    return 0;

}


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



int main () {

	char str[25];

	scanf("%[^\n]", str);

		

	for (int i =0 ; str [i] != '\0'; i++) {

		if(str[i] != ','){

			printf("%c", str[i]);

		}

		else{

			printf(" ", str[i]);

		}

			

		}

	puts("");

	return 0;

}