1481
来源:互联网 发布:手机淘宝用什么付账 编辑:程序博客网 时间:2024/05/22 05:01
题目描述
Do you know Sister Wang?
Sister Wang is goddess and many diaosi want to know her phone number. Sister Wang doesn’t tell them her number directly. She tells them a string, contains letters,
digits and symbols,but no blanks. And her phone number is in the string. Fushuai knows how to get the phone number. He delete the letters and symbols from the
string, so that he gets some digits, and then he sort the digits in ascending order. In this way, Fushuai succeeds in calling Sister Wang.
输入
There are several cases. Each cases contains a string L(1<= length(L)<=20).
输出
Output Sister Wang’s phont number.
样例输入
Sist1e2r3w4a5ng
样例输出
12345
提示
来源
新星赛2014
0 0
- 1481
- POJ-1481
- POJ 1481
- NBUT 1481
- ZOJ-1481
- FOJ 1481 环串
- FOJ 1481 环串
- 1481 合并数列
- FZU 1481 KMP
- uva 657 poj 1481
- UVa 1481 - Genome Evolution
- Code[VS] 1481 忠诚
- FZU 1481 环串
- 1481:Maximum sum
- 题目1481:是不是二叉树
- POJ2.6 1481 Maximum sum
- OpenJudge-Noi 1481 Maximum Sum
- 百练1481:Maximum sum
- 1452
- 《徐徐道来话Java》:泛型的基本概念(1)
- MySQL索引学习笔记
- C++多线程初级一:创建进程
- 1459
- 1481
- Redis内存淘汰机制
- Codeforces Round #385 (Div. 1) B. Hongcow's Game(bitmask)
- 1671
- 序列求和
- 实现一个元素垂直居中的六种方式
- Struts 2的拦截器(Interceptor)总结
- 知识库--Loading+Servlet(54)
- Synchronized——的使用(对象锁、类