CodeForces 600A - Extract Numbers (模拟题)

A - Extract Numbers

Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  CodeForces 600A

Description

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 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. String a should contain all words 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 string b in the same way (the order of numbers should remain the same as in the string s).

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 Input

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"

Hint

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

题目大意:用字符','与';'隔离开字符串，然后判断这个字符串是不是整数，不能有前置零也不能是浮点数

直接模拟，对于字符','以及';'为结尾进行判断，然后最后留下的字符串进行判断即可。

#include <bits/stdc++.h>
using namespace std;


#define pb push_back
#define mp make_pair
#define fillchar(a, x) memset(a, x, sizeof(a))
#define copy(a, b) memcpy(a, b, sizeof(a))


typedef long long LL;
typedef pair<int, int > PII;
typedef unsigned long long uLL;
template<typename T>
void print(T* p, T* q, string Gap = " ") {
    int d = p < q ? 1 : -1;
    while(p != q) {
        cout << *p;
        p += d;
        if(p != q) cout << Gap;
    }
    cout << endl;
}
template<typename T>
void print(const T &a, string bes = "") {
    int len = bes.length();
    if(len >= 2)cout << bes[0] << a << bes[1] << endl;
    else cout << a << endl;
}

const int INF = 0x3f3f3f3f;
const int MAXM = 2e4 + 5;
const int MAXN = 1e5 + 5;

char Str[MAXN];
char A[MAXN];
char S1[MAXN],S2[MAXN];
int ina,inb;
void getsg(int indexs) {
    bool flag = false;
    int num = 0;
    if(indexs == 0){
        S2[inb ++] = ',';
        return;
    }
    for(int j = 0; j < indexs; j ++) {
        if(A[0] == '0') break;
        if(isdigit(A[j])) num ++;
    }
    if(indexs == 1 && A[0] == '0' || num == indexs) {
        flag = true;
    }
    if(flag) {
        for(int j = 0; j < indexs; j ++) {
            S1[ina ++] = A[j];
        }
        S1[ina ++] = ',';
    } else {
        for(int j = 0; j < indexs; j ++) {
            S2[inb ++] = A[j];
        }
        S2[inb ++] = ',';
    }
}
int main() {
    while(~scanf("%s", Str)) {
        int len = strlen(Str);
        int indexs = 0;
        ina = inb = 0;
        for(int i = 0; i < len; i ++) {
            if(Str[i] == ',' || Str[i] == ';') {
                getsg(indexs);
                indexs = 0;
                continue;
            }
            A[indexs ++] = Str[i];
        }
        getsg(indexs);
        S1[ina - 1] = '\0';
        S2[inb - 1] = '\0';
        if(ina == 0) print("-");
        else printf("\"%s\"\n", S1);
        if(inb == 0) print("-");
        else printf("\"%s\"\n", S2);
    }
    return 0;
}