A. Colorful Stones (Simplified Edition)
time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

There is a sequence of colorful stones. The color of each stone is one of red, green, or blue. You are given a string s. The i-th (1-based) character of s represents the color of the i-th stone. If the character is "R", "G", or "B", the color of the corresponding stone is red, green, or blue, respectively.

Initially Squirrel Liss is standing on the first stone. You perform instructions one or more times.

Each instruction is one of the three types: "RED", "GREEN", or "BLUE". After an instruction c, if Liss is standing on a stone whose colors is c, Liss will move one stone forward, else she will not move.

You are given a string t. The number of instructions is equal to the length of t, and the i-th character of t represents the i-th instruction.

Calculate the final position of Liss (the number of the stone she is going to stand on in the end) after performing all the instructions, and print its 1-based position. It is guaranteed that Liss don't move out of the sequence.

Input

The input contains two lines. The first line contains the string s (1 ≤ |s| ≤ 50). The second line contains the string t (1 ≤ |t| ≤ 50). The characters of each string will be one of "R", "G", or "B". It is guaranteed that Liss don't move out of the sequence.

Output

Print the final 1-based position of Liss in a single line.

Examples
Input

Copy
RGB
RRR
Output

Copy
2
Input

Copy
RRRBGBRBBB
BBBRR
Output

Copy
3
Input

Copy
BRRBGBRGRBGRGRRGGBGBGBRGBRGRGGGRBRRRBRBBBGRRRGGBBB
BBRBGGRGRGBBBRBGRBRBBBBRBRRRBGBBGBBRRBBGGRBRRBRGRB
Output

Copy
15
模拟；
#include<iostream>

#include<cstdio>

#include<algorithm>

#include<cstdlib>

#include<cstring>

#include<string>

#include<cmath>

#include<map>

#include<set>

#include<vector>

#include<queue>

#include<bitset>

#include<ctime>

#include<deque>

#include<stack>

#include<functional>

#include<sstream>

//#include<cctype>

//#pragma GCC optimize(2)

using namespace std;

#define maxn 200005

#define inf 0x7fffffff

//#define INF 1e18

#define rdint(x) scanf("%d",&x)

#define rdllt(x) scanf("%lld",&x)

#define rdult(x) scanf("%lu",&x)

#define rdlf(x) scanf("%lf",&x)

#define rdstr(x) scanf("%s",x)

typedef long long  ll;

typedef unsigned long long ull;

typedef unsigned int U;

#define ms(x) memset((x),0,sizeof(x))

const long long int mod = 1e9;

#define Mod 1000000000

#define sq(x) (x)*(x)

#define eps 1e-5

typedef pair<int, int> pii;

#define pi acos(-1.0)

//const int N = 1005;

#define REP(i,n) for(int i=0;i<(n);i++)

typedef pair<int, int> pii;

inline int rd() {

	int x = 0;

	char c = getchar();

	bool f = false;

	while (!isdigit(c)) {

		if (c == '-') f = true;

		c = getchar();

	}

	while (isdigit(c)) {

		x = (x << 1) + (x << 3) + (c ^ 48);

		c = getchar();

	}

	return f ? -x : x;

}

ll gcd(ll a, ll b) {

	return b == 0 ? a : gcd(b, a%b);

}

int sqr(int x) { return x * x; }

/*ll ans;

ll exgcd(ll a, ll b, ll &x, ll &y) {

	if (!b) {

		x = 1; y = 0; return a;

	}

	ans = exgcd(b, a%b, x, y);

	ll t = x; x = y; y = t - a / b * y;

	return ans;

}

*/

string s, t;

int main()

{

	ios::sync_with_stdio(0);

	cin >> s >> t;

	int lens = s.length();

	int lent = t.length();

	int pos = 0;

	int st = 0;

	while (st < lent) {

		if (t[st] == s[pos]) {

			pos++; st++;

		}

		else st++;

	}

	printf("%d\n", pos + 1);

	return 0;

}
B. Roadside Trees (Simplified Edition)
time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Squirrel Liss loves nuts. There are n trees (numbered 1 to n from west to east) along a street and there is a delicious nut on the top of each tree. The height of the tree i is hi. Liss wants to eat all nuts.

Now Liss is on the root of the tree with the number 1. In one second Liss can perform one of the following actions:

  • Walk up or down one unit on a tree.
  • Eat a nut on the top of the current tree.
  • Jump to the next tree. In this action the height of Liss doesn't change. More formally, when Liss is at height h of the tree i (1 ≤ i ≤ n - 1), she jumps to height h of the tree i + 1. This action can't be performed if h > hi + 1.

Compute the minimal time (in seconds) required to eat all nuts.

Input

The first line contains an integer n (1  ≤  n ≤ 105) — the number of trees.

Next n lines contains the height of trees: i-th line contains an integer hi (1 ≤ hi ≤ 104) — the height of the tree with the number i.

Output

Print a single integer — the minimal time required to eat all nuts in seconds.

Examples
Input

Copy
2
1
2
Output

Copy
5
Input

Copy
5
2
1
2
1
1
Output

Copy
14
#include<iostream>

#include<cstdio>

#include<algorithm>

#include<cstdlib>

#include<cstring>

#include<string>

#include<cmath>

#include<map>

#include<set>

#include<vector>

#include<queue>

#include<bitset>

#include<ctime>

#include<deque>

#include<stack>

#include<functional>

#include<sstream>

//#include<cctype>

//#pragma GCC optimize(2)

using namespace std;

#define maxn 200005

#define inf 0x7fffffff

//#define INF 1e18

#define rdint(x) scanf("%d",&x)

#define rdllt(x) scanf("%lld",&x)

#define rdult(x) scanf("%lu",&x)

#define rdlf(x) scanf("%lf",&x)

#define rdstr(x) scanf("%s",x)

typedef long long  ll;

typedef unsigned long long ull;

typedef unsigned int U;

#define ms(x) memset((x),0,sizeof(x))

const long long int mod = 1e9;

#define Mod 1000000000

#define sq(x) (x)*(x)

#define eps 1e-5

typedef pair<int, int> pii;

#define pi acos(-1.0)

//const int N = 1005;

#define REP(i,n) for(int i=0;i<(n);i++)

typedef pair<int, int> pii;

inline int rd() {

	int x = 0;

	char c = getchar();

	bool f = false;

	while (!isdigit(c)) {

		if (c == '-') f = true;

		c = getchar();

	}

	while (isdigit(c)) {

		x = (x << 1) + (x << 3) + (c ^ 48);

		c = getchar();

	}

	return f ? -x : x;

}

ll gcd(ll a, ll b) {

	return b == 0 ? a : gcd(b, a%b);

}

int sqr(int x) { return x * x; }

/*ll ans;

ll exgcd(ll a, ll b, ll &x, ll &y) {

	if (!b) {

		x = 1; y = 0; return a;

	}

	ans = exgcd(b, a%b, x, y);

	ll t = x; x = y; y = t - a / b * y;

	return ans;

}

*/

int n;

int h[maxn];

int df[maxn];

int main()

{

//	ios::sync_with_stdio(0);

	n = rd();

	for (int i = 1; i <= n; i++) {

		h[i] = rd();

	}

	ll ans = 0;

	for (int i = 1; i < n; i++)df[i] = h[i + 1] - h[i];

	ans += 1ll*(h[1] + 1);

	for (int i = 2; i <= n; i++) {

		if (h[i] >= h[i - 1]) {

			ans += 1ll*(1 + 1 + h[i] - h[i - 1]);

		}

		else {

			ans += 1ll*(h[i - 1] - h[i] + 1 + 1);

		}

	}

	printf("%lld\n", ans);

	return 0;

}
C. Escape from Stones
time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Squirrel Liss lived in a forest peacefully, but unexpected trouble happens. Stones fall from a mountain. Initially Squirrel Liss occupies an interval [0, 1]. Next, n stones will fall and Liss will escape from the stones. The stones are numbered from 1 to n in order.

The stones always fall to the center of Liss's interval. When Liss occupies the interval [k - d, k + d] and a stone falls to k, she will escape to the left or to the right. If she escapes to the left, her new interval will be [k - d, k]. If she escapes to the right, her new interval will be [k, k + d].

You are given a string s of length n. If the i-th character of s is "l" or "r", when the i-th stone falls Liss will escape to the left or to the right, respectively. Find the sequence of stones' numbers from left to right after all the n stones falls.

Input

The input consists of only one line. The only line contains the string s (1 ≤ |s| ≤ 106). Each character in s will be either "l" or "r".

Output

Output n lines — on the i-th line you should print the i-th stone's number from the left.

Examples
Input

Copy
llrlr
Output

Copy
3
5
4
2
1
Input

Copy
rrlll
Output

Copy
1
2
5
4
3
Input

Copy
lrlrr
Output

Copy
2
4
5
3
1
Note

In the first example, the positions of stones 1, 2, 3, 4, 5 will be , respectively. So you should print the sequence: 3, 5, 4, 2, 1.

偏思维一点，找到规律就行了；

#include<iostream>

#include<cstdio>

#include<algorithm>

#include<cstdlib>

#include<cstring>

#include<string>

#include<cmath>

#include<map>

#include<set>

#include<vector>

#include<queue>

#include<bitset>

#include<ctime>

#include<deque>

#include<stack>

#include<functional>

#include<sstream>

//#include<cctype>

//#pragma GCC optimize(2)

using namespace std;

#define maxn 1000005

#define inf 0x7fffffff

//#define INF 1e18

#define rdint(x) scanf("%d",&x)

#define rdllt(x) scanf("%lld",&x)

#define rdult(x) scanf("%lu",&x)

#define rdlf(x) scanf("%lf",&x)

#define rdstr(x) scanf("%s",x)

typedef long long  ll;

typedef unsigned long long ull;

typedef unsigned int U;

#define ms(x) memset((x),0,sizeof(x))

const long long int mod = 1e9;

#define Mod 1000000000

#define sq(x) (x)*(x)

#define eps 1e-5

typedef pair<int, int> pii;

#define pi acos(-1.0)

//const int N = 1005;

#define REP(i,n) for(int i=0;i<(n);i++)

typedef pair<int, int> pii;

inline int rd() {

	int x = 0;

	char c = getchar();

	bool f = false;

	while (!isdigit(c)) {

		if (c == '-') f = true;

		c = getchar();

	}

	while (isdigit(c)) {

		x = (x << 1) + (x << 3) + (c ^ 48);

		c = getchar();

	}

	return f ? -x : x;

}

ll gcd(ll a, ll b) {

	return b == 0 ? a : gcd(b, a%b);

}

int sqr(int x) { return x * x; }

/*ll ans;

ll exgcd(ll a, ll b, ll &x, ll &y) {

	if (!b) {

		x = 1; y = 0; return a;

	}

	ans = exgcd(b, a%b, x, y);

	ll t = x; x = y; y = t - a / b * y;

	return ans;

}

*/

string s;

int pos[maxn];

int main()

{

//	ios::sync_with_stdio(0);

	cin >> s;

	int lens = s.length();

	int ed = lens - 1;

	int st = 0;

	int tot = 0;

	for (int i = 0; i < lens; i++) {

		if (s[i] == 'l') {

			pos[ed] = (i + 1); ed--;

		}

		else {

			pos[st] = (i + 1); st++;

		}

	}

	for (int i = 0; i < lens; i++) {

		printf("%d\n", pos[i]);

	}

	return 0;

}
D. Good Sequences
time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Squirrel Liss is interested in sequences. She also has preferences of integers. She thinks n integers a1, a2, ..., an are good.

Now she is interested in good sequences. A sequence x1, x2, ..., xk is called good if it satisfies the following three conditions:

  • The sequence is strictly increasing, i.e. xi < xi + 1 for each i (1 ≤ i ≤ k - 1).
  • No two adjacent elements are coprime, i.e. gcd(xi, xi + 1) > 1 for each i (1 ≤ i ≤ k - 1) (where gcd(p, q) denotes the greatest common divisor of the integers p and q).
  • All elements of the sequence are good integers.

Find the length of the longest good sequence.

Input

The input consists of two lines. The first line contains a single integer n (1 ≤ n ≤ 105) — the number of good integers. The second line contains a single-space separated list of good integers a1, a2, ..., an in strictly increasing order (1 ≤ ai ≤ 105; ai < ai + 1).

Output

Print a single integer — the length of the longest good sequence.

Examples
Input

Copy
5
2 3 4 6 9
Output

Copy
4
Input

Copy
9
1 2 3 5 6 7 8 9 10
Output

Copy
4
Note

In the first example, the following sequences are examples of good sequences: [2; 4; 6; 9], [2; 4; 6], [3; 9], [6]. The length of the longest good sequence is 4.

有趣的dp题目；

考虑枚举因数；

用dp[i]表示以因数i结尾时的最大值；

#include<iostream>

#include<cstdio>

#include<algorithm>

#include<cstdlib>

#include<cstring>

#include<string>

#include<cmath>

#include<map>

#include<set>

#include<vector>

#include<queue>

#include<bitset>

#include<ctime>

#include<deque>

#include<stack>

#include<functional>

#include<sstream>

//#include<cctype>

//#pragma GCC optimize(2)

using namespace std;

#define maxn 1000005

#define inf 0x7fffffff

//#define INF 1e18

#define rdint(x) scanf("%d",&x)

#define rdllt(x) scanf("%lld",&x)

#define rdult(x) scanf("%lu",&x)

#define rdlf(x) scanf("%lf",&x)

#define rdstr(x) scanf("%s",x)

typedef long long  ll;

typedef unsigned long long ull;

typedef unsigned int U;

#define ms(x) memset((x),0,sizeof(x))

const long long int mod = 1e9;

#define Mod 1000000000

#define sq(x) (x)*(x)

#define eps 1e-5

typedef pair<int, int> pii;

#define pi acos(-1.0)

//const int N = 1005;

#define REP(i,n) for(int i=0;i<(n);i++)

typedef pair<int, int> pii;

inline int rd() {

	int x = 0;

	char c = getchar();

	bool f = false;

	while (!isdigit(c)) {

		if (c == '-') f = true;

		c = getchar();

	}

	while (isdigit(c)) {

		x = (x << 1) + (x << 3) + (c ^ 48);

		c = getchar();

	}

	return f ? -x : x;

}

ll gcd(ll a, ll b) {

	return b == 0 ? a : gcd(b, a%b);

}

int sqr(int x) { return x * x; }

/*ll ans;

ll exgcd(ll a, ll b, ll &x, ll &y) {

	if (!b) {

		x = 1; y = 0; return a;

	}

	ans = exgcd(b, a%b, x, y);

	ll t = x; x = y; y = t - a / b * y;

	return ans;

}

*/

int n;

int a[maxn];

int dp[maxn];

int ans;

void sol(int x) {

	int maxx = -inf;

	for (int i = 2; i <= sqrt(x); i++) {

		if (x%i == 0) {

			maxx = max(max(maxx, dp[i]), dp[x / i]);

		}

	}

	maxx = max(maxx, dp[x]);

	for (int i = 2; i <= sqrt(x); i++) {

		if (x%i == 0) {

			dp[i] = maxx + 1; dp[x / i] = maxx + 1;

			while (x%i == 0)x /= i;

		}

	}

	dp[x] = maxx + 1; ans = max(ans, maxx + 1);

}

int main()

{

//	ios::sync_with_stdio(0);

	n = rd();

	for (int i = 1; i <= n; i++) {

		a[i] = rd();

	}

	for (int i = 1; i <= n; i++)sol(a[i]);

	printf("%d\n", ans);

	return 0;

}













												


											
Codeforces Round #162 (Div. 2) A~D 题解的更多相关文章
	

    
								
  1. Codeforces Round #612 (Div. 2) 前四题题解
		
    这场比赛的出题人挺有意思,全部magic成了青色. 还有题目中的图片特别有趣. 晚上没打,开virtual contest打的,就会前三道,我太菜了. 最后看着题解补了第四道. 比赛传送门 A. An ...
    
		
    2. 
						
  2. Codeforces Round #198 (Div. 2)A,B题解
		
    Codeforces Round #198 (Div. 2) 昨天看到奋斗群的群赛,好奇的去做了一下, 大概花了3个小时Ak,我大概可以退役了吧 那下面来稍微总结一下 A. The Wall Iahu ...
    
		
    3. 
						
  3. Codeforces Round #672 (Div. 2) A - C1题解
		
    [Codeforces Round #672 (Div. 2) A - C1 ] 题目链接# A. Cubes Sorting 思路: " If Wheatley needs more th ...
    
		
    4. 
						
  4. Codeforces Round #614 (Div. 2)  A-E简要题解
		
    链接:https://codeforces.com/contest/1293 A. ConneR and the A.R.C. Markland-N 题意:略 思路:上下枚举1000次扫一遍,比较一下 ...
    
		
    5. 
						
  5. Codeforces Round #610 (Div. 2)  A-E简要题解
		
    contest链接: https://codeforces.com/contest/1282 A. Temporarily unavailable 题意: 给一个区间L,R通有网络,有个点x,在x+r ...
    
		
    6. 
						
  6. Codeforces Round #611 (Div. 3)  A-F简要题解
		
    contest链接:https://codeforces.com/contest/1283 A. Minutes Before the New Year 题意:给一个当前时间,输出离第二天差多少分钟  ...
    
		
    7. 
						
  7. Codeforces Round #162 (Div. 1)   B. Good Sequences  (dp+分解素数)
		
    题目:http://codeforces.com/problemset/problem/264/B 题意:给你一个递增序列,然后找出满足两点要求的最长子序列 第一点是a[i]>a[i-1] 第二 ...
    
		
    8. 
						
  8. Codeforces Round #499 (Div. 2) D. Rocket题解
		
    题目: http://codeforces.com/contest/1011/problem/D This is an interactive problem. Natasha is going to ...
    
		
    9. 
						
  9. Codeforces Round #499 (Div. 2) C Fly题解
		
    题目 http://codeforces.com/contest/1011/problem/C Natasha is going to fly on a rocket to Mars and retu ...
    
		
    10. 
		

	


随机推荐
	

    
									
  1. Table Tennis Game 2
			
    Description Misha and Vanya have played several table tennis sets. Each set consists of several serv ...
    
			
    2. 
						
  2. scala中存在的问题
			
    2017-12-27 scala学习中存在的问题: 1.表达式的概念要搞清楚 2.八种基本数据类型要搞清楚 Byte\Short\Int\Long\Char\Boolean\Double\Float都 ...
    
			
    3. 
						
  3. css二阴影+第三维度z-index
			
    <span style="text-shadow: 3px 3px 1px #888;">shadowed</span><span style=&qu ...
    
			
    4. 
						
  4. windows7 Sql server 2012 尝试读取或写入受保护的内存。这通常指示其他内存已损坏的修复
			
    项目中,使用了sql server2012数据库,服务端是2012,客户端如果是2008的话,就会报错: 索引错误. 没办法,就安装了sql server2012客户端.但是还是报错,无法连上数据库服 ...
    
			
    5. 
						
  5. Smarty3——从配置文件获取的变量
			
    再使用配置变量前要 引入配置变量即:{$config_load file=‘file_path’}$marty3中可以从配置文件中 用 # 号包起来引用配置文件中的变量({#config_var_na ...
    
			
    6. 
						
  6. 卡2-SLAM
			
    ---恢复内容开始--- 1.下载 首先需要从github上Git以下两个包: git clonehttps://github.com/ros-perception/open_karto(开源的kar ...
    
			
    7. 
						
  7. bug记录：IE8，包含块min-height/height共存时的高度计算bug
			
    问题的条件有: A元素是B元素的包含块. A元素设置overflow:hidden;,并同时设置了height和min-height,同时height计算值 < min-height 原生IE8 ...
    
			
    8. 
						
  8. JavaScript跨域调用基于JSON的RESTful API
			
    1. 基本术语 AJAX(Asynchronous JavaScript And XML,异步JavaScript和XML):AJAX是一种用于创建快速动态网页的技术,通过在后台与服务器进行少量数据交 ...
    
			
    9. 
						
  9. 事物处理service层的方法
			
    package cn.lijun.service; import java.sql.Connection;import java.sql.SQLException; import cn.lijun.d ...
    
			
    10. 
						
  10. cgroup初步分析（1）
			
    cgroup的功能和作用不废话,直说一下cgroup的几条设计准则,有了几条设计准则的约束,就比较容易理解其中的数据结构和函数,至于源代码cgroup.c,无非是两个内容,一是task_struct. ...
    
			
    11.