codeforces 600 A. Extract Numbers(字符串模拟)

A. Extract Numbers
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

You are given string s. Let's call word any largest sequence of consecutive symbols without symbols ',' (comma) and ';' (semicolon). For example, there are fourwords in string "aba,123;1a;0": "aba", "123", "1a", "0". A word can be empty: for example, the string s=";;" contains three empty words separated by ';'.

You should find all words in the given string that are nonnegative INTEGER numbers without leading zeroes and build by them new stringa. Stringa should contain allwords that are numbers separating them by ',' (the order of numbers should remain the same as in the strings). By all other words you should build stringb in the same way (the order of numbers should remain the same as in the strings).

Here strings "101", "0" are INTEGER numbers, but "01" and "1.0" are not.

For example, for the string aba,123;1a;0 the stringa would be equal to "123,0" and stringb would be equal to "aba,1a".

Input

The only line of input contains the string s (1 ≤ |s| ≤ 105). The string contains only symbols '.' (ASCII 46), ',' (ASCII 44), ';' (ASCII 59), digits, lowercase and uppercase latin letters.

Output

Print the string a to the first line and stringb to the second line. Each string should be surrounded by quotes (ASCII 34).

If there are no words that are numbers print dash (ASCII 45) on the first line. If allwords are numbers print dash on the second line.

Examples
Input
aba,123;1a;0
Output
"123,0"
"aba,1a"
Input
1;;01,a0,
Output
"1"
",01,a0,"
Input
1
Output
"1"
-
Input
a
Output
-
"a"
Note

In the second example the string s contains five words: "1", "", "01", "a0", "".


  现在感觉对这样的字符串的有点无奈啊,没有以前弄模拟题的热情了,需要调整啊。

  在codeforces上找到一个极好的代码,佩服,禁不住搬运一下

//author  gritukan
#include <bits/stdc++.h>
using namespace std;
bool good(string s)
{
	if (s.length() == 0)//空的情况
        return false;
	if (s.length() > 1 && s[0] == '0')//带有前缀0的数字
        return false;
	for (int i = 0; i < s.length(); i++)//是字母的情况
	{
		if (s[i]<'0' || s[i]>'9')
            return false;
	}
	return true;
}
void print(vector<string>words)
{
	if (words.size() == 0)
	{
		cout << "-" << endl;
		return;
	}
	cout << "\"";
	for (int i = 0; i < words.size(); i++)
	{
		cout << words[i];
		if (i + 1 < words.size())
		{
			cout << ",";
		}
		else
		{
			cout << "\"";
		}
	}
	cout << endl;
}
int main()
{
	string s;
	cin >> s;
	s += ';';
	vector<string>words;
	string cur;

	for (int i = 0; i < s.length(); i++)
	{
		if (s[i] == ',' || s[i] == ';')
		{
			words.push_back(cur);
			cur = "";
		}
		else
		{
			cur += s[i];
		}
	}

	vector<string>a, b;
	for (int i = 0; i < words.size(); i++)
	{
		if (good(words[i]))
		{
			a.push_back(words[i]);
		}
		else
		{
			b.push_back(words[i]);
		}
	}
	print(a);
	print(b);
}

//自己加了点注释


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值