Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Anagrams WIP
//g++ 5.4.0 #include <iostream> #include <queue> #include <vector> #include <string> #include <algorithm> using namespace std; int main() { priority_queue<char, vector<char>,greater<char>> palabras; long long hash; int pos=0; string entrada, cadena; vector<string> cadenas; while(true){ cin>>entrada; if(entrada.compare("#")==0) break; cadenas.push_back(entrada); } for(auto a: cadenas){ sort(a.begin(), a.end()); cout<<a<<"\n"; } }
run
|
edit
|
history
|
help
0
Web Browser History - DLL
variadic pointer to function template
Arithmetic
c2p_update
Conjuntos - Contar caracteres únicos
Prosta implementacja algorytmu Euklidesa (NWD)
project: bank account
Roger Cheng
Problema1
CPP - Pointers - Ex.1