Codeforces Round #449 (Div. 2)

A. Scarborough Fair

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Are you going to Scarborough Fair?

Parsley, sage, rosemary and thyme.

Remember me to one who lives there.

He once was the true love of mine.

Willem is taking the girl to the highest building in island No.28, however, neither of them knows how to get there.

Willem asks his friend, Grick for directions, Grick helped them, and gave them a task.

Although the girl wants to help, Willem insists on doing it by himself.

Grick gave Willem a string of length n.

Willem needs to do m operations, each operation has four parameters l, r, c1, c2, which means that all symbols c1 in range [l, r] (from l-th to r-th, including l and r) are changed into c2. String is 1-indexed.Grick wants to know the final string after all the m operations.

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 100).

The second line contains a string s of length n, consisting of lowercase English letters.

Each of the next m lines contains four parameters l, r, c1, c2 (1 ≤ l ≤ r ≤ n, c1, c2 are lowercase English letters), separated by space.

Output

Output string s after performing m operations described above.

Examples

input

3 1
ioi
1 1 i n

output

noi

input

5 3
wxhak
3 3 h x
1 5 x a
1 3 w g

output

gaaak

Note

For the second example:

After the first operation, the string is wxxak.

After the second operation, the string is waaak.

After the third operation, the string is gaaak.

题意：给一个长度为n的字符串，进行m次操作，每次操作把[l,r]内的c1变为c2。

个人代码：

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int main()
{
    char a[101];
    char b,c;
    int n,m;
    int l,r;
    scanf("%d %d",&n,&m);
    cin>>a;
    for(int j=1;j<=m;j++)
    {
        scanf("%d %d %c %c",&l,&r,&b,&c);
        for(int i=l-1;i<r;i++)
        {
            if(a[i]==b)
            {
               // cout<<c<<endl;
                a[i]=c;
            }
        }
    }
    for(int i=0;i<n;i++)
        printf("%c",a[i]);
    printf("\n");
    return 0;
}

发现自己对于scanf和cin的使用，特别是输入字符数组或者字符串时特别不熟...

官方题解说用二叉搜索树可以达到  。

搞懂二叉搜索树后再更新另一个代码，立个FLAG。

B. Chtholly's request

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

— Thanks a lot for today.

— I experienced so many great things.

— You gave me memories like dreams... But I have to leave now...

— One last request, can you...

— Help me solve a Codeforces problem?

— ......

— What?

Chtholly has been thinking about a problem for days:

If a number is palindrome and length of its decimal representation without leading zeros is even, we call it a zcy number. A number is palindrome means when written in decimal representation, it contains no leading zeros and reads the same forwards and backwards. For example 12321 and 1221 are palindromes and 123 and 12451 are not. Moreover, 1221 is zcy number and 12321 is not.

Given integers k and p, calculate the sum of the k smallest zcy numbers and output this sum modulo p.

Unfortunately, Willem isn't good at solving this kind of problems, so he asks you for help!

Input

The first line contains two integers k and p (1 ≤ k ≤ 105, 1 ≤ p ≤ 109).

Output

Output single integer — answer to the problem.

Examples

input

2 100

output

33

input

5 30

output

15

Note

In the first example, the smallest zcy number is 11, and the second smallest zcy number is 22.

In the second example, .

题意：找出前k个回文数的和对p取余。

个人代码：

#include<iostream>
using namespace std;
int main (){
	
	long long  n , m  ,x , y , ans=0;cin >> n >> m;
	for(int i=1 ; i<=n ; i++){
	        x=y=i;
	        while(y>0){
	        	x=x*10+y%10;
	        	y/=10;
	        }
	        ans=(ans+x)%m;
	}
	cout << ans;
	return 0;
}

一次T掉，数据范围很重要

二次搞错一定是偶数位个。