ZOJ 3323 Somali Pirates
2017-02-19 17:29
267 查看
t is said that the famous Somali Pirates hate digits. So their QQ passwords never contain any digit. Given some lines of candidate passwords, you are asked to delete all the digits in the passwords and print other characters in their original order. So the
Somali Pirates can use them as their QQ passwords^^
Input
There are multiple test cases. The first line of input is an integer T (T <= 10) indicating the number of test cases.
Each case contains a line indicating a candidate password. The length of the password is between 1 and 20, inclusive. Besides, the password consists of only digits and English letters.
Output
For each candidate password, delete all the digits and print the remaining characters in a line.
Sample Input
Sample Output
简单题#include<map>
#include<cmath>
#include<queue>
#include<vector>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define ms(x,y) memset(x,y,sizeof(x))
#define rep(i,j,k) for(int i=j;i<=k;i++)
#define per(i,j,k) for(int i=j;i>=k;i--)
#define loop(i,j,k) for (int i=j;i!=-1;i=k[i])
#define inone(x) scanf("%d",&x)
#define intwo(x,y) scanf("%d%d",&x,&y)
#define inthr(x,y,z) scanf("%d%d%d",&x,&y,&z)
typedef long long LL;
const int low(int x) { return x&-x; }
const int mod = 1e9 + 7;
const int N = 1e5 + 10;
const int M = 1 << 14;
int T;
char s
;
int main()
{
for (inone(T); T--;)
{
scanf("%s", s);
for (int i = 0; s[i]; i++) if (s[i]<'0' || s[i]>'9') putchar(s[i]);
putchar(10);
}
return 0;
}
Somali Pirates can use them as their QQ passwords^^
Input
There are multiple test cases. The first line of input is an integer T (T <= 10) indicating the number of test cases.
Each case contains a line indicating a candidate password. The length of the password is between 1 and 20, inclusive. Besides, the password consists of only digits and English letters.
Output
For each candidate password, delete all the digits and print the remaining characters in a line.
Sample Input
2 BeatLA123 1plus1equals1
Sample Output
BeatLAplusequals
简单题#include<map>
#include<cmath>
#include<queue>
#include<vector>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define ms(x,y) memset(x,y,sizeof(x))
#define rep(i,j,k) for(int i=j;i<=k;i++)
#define per(i,j,k) for(int i=j;i>=k;i--)
#define loop(i,j,k) for (int i=j;i!=-1;i=k[i])
#define inone(x) scanf("%d",&x)
#define intwo(x,y) scanf("%d%d",&x,&y)
#define inthr(x,y,z) scanf("%d%d%d",&x,&y,&z)
typedef long long LL;
const int low(int x) { return x&-x; }
const int mod = 1e9 + 7;
const int N = 1e5 + 10;
const int M = 1 << 14;
int T;
char s
;
int main()
{
for (inone(T); T--;)
{
scanf("%s", s);
for (int i = 0; s[i]; i++) if (s[i]<'0' || s[i]>'9') putchar(s[i]);
putchar(10);
}
return 0;
}
相关文章推荐
- zoj 3323 Somali Pirates
- zoj 3323 Somali Pirates
- zoj 3323 Somali Pirates
- ZOJ-3323-Somali Pirates【7th浙江省赛】
- zoj-3323 Somali Pirates
- ZOJ 3323 Somali Pirates(模拟)
- ZOJ-3323
- ZOJ 3323(B)模拟
- ZOJ-3323
- zoj 5道水题 2818 3323,3333,3479,3486
- ZOJ 省赛题 Somali Pirates
- zoj 3261 逆向并查集
- 博弈---ZOJ 2083 Win the Game(染绳子)
- zoj 2760 求不重边最短路 最短路+最大流
- ZOJ 3987 Numbers (大数+贪心)
- ZOJ 1008 Gnome Tetravex(DFS)
- ZOJ-3414-Trail Walk_计算几何
- ZOJ 3466 The Hive II (插头DP,变形)
- ZOJ 4006 Travel along the Line
- zoj 1709 dfs