Solução: Problema da palavra mágica (Marco Antonio) - Revision history

200.17.147.2 at 14:44, 20 May 2009

2009-05-20T14:44:34Z

200.17.147.2 at 14:41, 20 May 2009

2009-05-20T14:41:21Z

200.17.147.2: New page: `#include #include #include using namespace std; bool compare(char chara, char charb) { return (chara < charb); } int main() { string ...`


2009-05-20T14:28:10Z
New page: <code lang="cpp"> #include <iostream> #include <string> #include <algorithm>  using namespace std;  bool compare(char chara, char charb) { 	return (chara < charb); }  int main() { 	string ...
New page
<code lang="cpp">

#include <iostream>

#include <string>

#include <algorithm>



using namespace std;



bool compare(char chara, char charb)

{

	return (chara < charb);

}



int main()

{

	string entry, word;



	cin >> entry;

	if (entry.length() % 2 == 0){

		word = entry.substr(0, (entry.length()/2));

		entry = entry.substr(entry.length()/2, entry.length());

		sort(word.begin(),word.end(),compare);

		cout << word << "\n" << entry << endl;

		if (!(entry.compare(word)))

			cout << "S" << endl;

		else

			cout << "N" << endl;

	}

	else

		cout << 'N' << endl;



	return 0;

}

</code>

Solução: Problema da palavra mágica (Marco Antonio) - Revision history

200.17.147.2 at 14:44, 20 May 2009

200.17.147.2 at 14:41, 20 May 2009

200.17.147.2: New page: #include #include #include using namespace std; bool compare(char chara, char charb) { return (chara < charb); } int main() { string ...

200.17.147.2: New page: `#include #include #include using namespace std; bool compare(char chara, char charb) { return (chara < charb); } int main() { string ...`