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);
}

//自己加了点注释


### Codeforces 1732A Bestie 题目解析 对于给定的整数数组 \(a\) 和查询次数 \(q\),每次查询给出两个索引 \(l, r\),需要计算子数组 \([l,r]\) 的最大公约数(GCD)。如果 GCD 结果为 1,则返回 "YES";否则返回 "NO"[^4]。 #### 解决方案概述 为了高效解决这个问题,可以预先处理数据以便快速响应多个查询。具体方法如下: - **预处理阶段**:构建辅助结构来存储每一对可能区间的 GCD 值。 - **查询阶段**:利用已有的辅助结构,在常量时间内完成每个查询。 然而,考虑到内存限制以及效率问题,直接保存所有区间的结果并不现实。因此采用更优化的方法——稀疏表(Sparse Table),它允许 O(1) 时间内求任意连续子序列的最大值/最小值/GCD等问题,并且支持静态RMQ(Range Minimum Query)/RANGE_GCD等操作。 #### 实现细节 ##### 构建稀疏表 通过动态规划的方式填充二维表格 `st`,其中 `st[i][j]` 表示从位置 i 开始长度为 \(2^j\) 的子串的最大公约数值。初始化时只需考虑单元素情况即 j=0 的情形,之后逐步扩展至更大的范围直到覆盖整个输入序列。 ```cpp const int MAXN = 2e5 + 5; int st[MAXN][20]; // Sparse table for storing precomputed results. vector<int> nums; void build_sparse_table() { memset(st,-1,sizeof(st)); // Initialize the base case where interval length is one element only. for(int i = 0 ;i < nums.size(); ++i){ st[i][0]=nums[i]; } // Fill up sparse table using previously computed values. for (int j = 1;(1 << j)<=nums.size();++j){ for (int i = 0;i+(1<<j)-1<nums.size();++i){ if(i==0 || st[i][j-1]!=-1 && st[i+(1<<(j-1))][j-1]!=-1) st[i][j]=__gcd(st[i][j-1],st[i+(1<<(j-1))][j-1]); } } } ``` ##### 处理查询请求 当接收到具体的 l 和 r 参数后,可以通过查找对应的 log₂(r-l+1) 来定位合适的跳跃步长 k ,进而组合得到最终答案。 ```cpp string query(int L,int R){ int K=(int)(log2(R-L+1)); return __gcd(st[L][K],st[R-(1<<K)+1][K])==1?"YES":"NO"; } ``` 这种方法能在较短时间内完成大量查询任务的同时保持较低的空间开销,非常适合本题设定下的性能需求。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值