Codeforces 600A. 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 four words in string "aba,123;1a;0": "aba", "123", "1a", "0". A word can be empty: for example, the strings=";;" 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 string a. String a should contain all words that are numbers separating them by ',' (the order of numbers should remain the same as in the string s). By all other words you should build string b 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 string a would be equal to "123,0" and string b would be equal to "aba,1a".

Input

The only line of input contains the string s (1 ≤ |s| ≤ 10⁵). 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 string b 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 all words are numbers print dash on the second line.

Sample test(s)

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", "".

 

题意：有一个仅包含 '.' , ',' , ';' 大小写字母，数字的字符串s  (1 ≤ |s| ≤ 10⁵)。 ',' 和 ';'为分隔符。a字符串是不为0开头的纯数字，其余的均为b字符串。空的也为b中的。具体的看样例和note

思路：暴力一遍来判断，但是在字符串的前面和后面均加一个','，这样可以更加方便判断特殊情况。

 

#include<bits/stdc++.h>
using namespace std;
char s[100010];
char a[100010],b[100010];
int count1[100010],count2[100010];
int main()
{
    cin>>s;
    int i,j,n=0,m=0,sign,flag,len=strlen(s);
    sign=-1;
    s[len]=';';
    memset(count1,0,sizeof(count1));
    memset(count2,0,sizeof(count2));
    for(i=0; i<=len; i++)
    {
        if(s[i]==','||s[i]==';')
        {

            if(sign+1==i)
            {
                b[m++]='*';
                count2[m-1]=1;
            }
            else
            {
                flag=0;
                if(s[sign+1]=='0'&&(sign+2==i)) flag=1;
                else
                {
                    if(s[sign+1]<='9'&&s[sign+1]>='1') flag=1;
                    if(flag==1)
                    {
                        for(j=sign+1; j<i; j++)
                        {
                            if(!(s[j]<='9'&&s[j]>='0')) break;
                        }
                        if(j<i) flag=0;
                        else flag=1;
                    }
                }
                if(flag==0)
                {
                    for(j=sign+1; j<i; j++)
                        b[m++]=s[j];
                    count2[m-1]=1;
                }
                else
                {
                    for(j=sign+1; j<i; j++)
                        a[n++]=s[j];
                    count1[n-1]=1;
                }
            }
            sign=i;
        }
    }
    if(n==0) cout<<"-"<<endl;
    else
    {
        cout<<"\"";
        for(i=0; i<n; i++)
        {
            cout<<a[i];
            if(count1[i]==1&&(i<n-1)) cout<<",";
        }
        cout<<"\""<<endl;
    }

    if(m==0) cout<<"-"<<endl;
    else
    {
        cout<<"\"";
        for(i=0; i<m; i++)
        {
            if(b[i]=='*');
            else cout<<b[i];
            if(count2[i]==1&&(i<m-1)) cout<<",";
        }
        cout<<"\""<<endl;
    }
    return 0;
}