Codeforces Round #496 (Div. 3) ABCDE

时间：2018-07-10 20:06:27 阅读：244 评论：0 收藏：0 [点我收藏+]

标签：row correct class find bre clipboard where dash sts

Little girl Tanya climbs the stairs inside a multi-storey building. Every time Tanya climbs a stairway, she starts counting steps from $1$

You are given all the numbers pronounced by Tanya. How many stairways did she climb? Also, output the number of steps in each stairway.

The given sequence will be a valid sequence that Tanya could have pronounced when climbing one or more stairways.

Input

The first line contains $n$

The second line contains integers $a_{1}, a_{2}, \dots, a_{n}$

The given sequence will be a valid sequence that Tanya could have pronounced when climbing one or more stairways.

Output

In the first line, output $t$

Examples

input

Copy

7
1 2 3 1 2 3 4

output

Copy

2
3 4

input

Copy

4
1 1 1 1

output

Copy

4
1 1 1 1

input

Copy

5
1 2 3 4 5

output

Copy

1
5

input

Copy

5
1 2 1 2 1

output

Copy

3
2 2 1 

签到题

 1 #include <bits/stdc++.h>
 2 #define ll long long
 3 using namespace std;
 4 const int N = 1010;
 5 int a[N];
 6 
 7 int main() {
 8     int n;
 9     cin >> n;
10     std::vector<int> v;
11     for(int i = 1; i <= n; i ++) cin >> a[i];
12     int tmp = 1;
13     for(int i = 2; i <= n; i ++) {
14         if(a[i] == 1) v.push_back(a[i-1]);
15     }
16     v.push_back(a[n]);
17     cout << v.size() << endl;
18     for(int i = 0; i < v.size(); i ++) {
19         cout << v[i] << ‘ ‘;
20     }
21 
22     return 0;
23 }

You are given two strings $s$

For example:

by applying a move to the string "where", the result is the string "here",
by applying a move to the string "a", the result is an empty string "".

You are required to make two given strings equal using the fewest number of moves. It is possible that, in the end, both strings will be equal to the empty string, and so, are equal to each other. In this case, the answer is obviously the sum of the lengths of the initial strings.

Write a program that finds the minimum number of moves to make two given strings $s$

Input

The first line of the input contains $s$

Output

Output the fewest number of moves required. It is possible that, in the end, both strings will be equal to the empty string, and so, are equal to each other. In this case, the answer is obviously the sum of the lengths of the given strings.

Examples

input

Copy

test
west

output

Copy

input

Copy

codeforces
yes

output

Copy

input

Copy

test
yes

output

Copy

input

Copy

b
ab

output

Copy

Note

In the first example, you should apply the move once to the first string and apply the move once to the second string. As a result, both strings will be equal to "est".

In the second example, the move should be applied to the string "codeforces" $8$

In the third example, you can make the strings equal only by completely deleting them. That is, in the end, both strings will be empty.

In the fourth example, the first character of the second string should be deleted.

求从右边开始相同的数量是多少。

 1 #include <bits/stdc++.h>
 2 #define ll long long
 3 using namespace std;
 4 const int N = 2e5+10;
 5 char s[N], t[N];
 6 
 7 int main() {
 8     cin >> s >> t;
 9     int lens = strlen(s), lent = strlen(t);
10     int i = lens-1, j = lent-1;
11     int ans = 0;
12     while(s[i] == t[j] && i >= 0 && j >= 0) {
13         i--;j--;
14         ans += 2;
15     }
16     cout << lens+lent-ans << endl;
17     return 0;
18 }

A sequence $a_{1}, a_{2}, \dots, a_{n}$

For example, the following sequences are good:

$[5, 3, 11]$
$[1, 1, 1, 1023]$
$[7, 39, 89, 25, 89]$
$[]$

Note that, by definition, an empty sequence (with a length of $0$

For example, the following sequences are not good:

$[16]$
$[4, 16]$
$[1, 3, 2, 8, 8, 8]$

You are given a sequence $a_{1}, a_{2}, \dots, a_{n}$

Input

The first line contains the integer $n$

The second line contains the sequence of integers $a_{1}, a_{2}, \dots, a_{n}$

Output

Print the minimum number of elements needed to be removed from the given sequence in order to make it good. It is possible that you need to delete all $n$

Examples

input

Copy

6
4 7 1 5 4 9

output

Copy

input

Copy

5
1 2 3 4 5

output

Copy

input

Copy

1
16

output

Copy

input

Copy

4
1 1 1 1023

output

Copy

Note

In the first example, it is enough to delete one element $a_{4} = 5$

找两个能够成2^d的数。

 1 #include <bits/stdc++.h>
 2 #define ll long long
 3 using namespace std;
 4 const int N = 2e5+10;
 5 int a[N], b[33];
 6 map<int,int> mp;
 7 int main() {
 8     int n, x;
 9     for(int i = 0; i < 31; i ++) b[i] = (1<<i);
10     cin >> n;
11     for(int i = 1; i <= n; i ++) {
12         scanf("%d", &a[i]);
13         mp[a[i]]++;
14     }
15     int ans = 0;
16     map<int,int>::iterator it = mp.begin();
17     for(; it != mp.end(); it ++) {
18         bool flag = false;
19         for(int j = 30; j > 0; j --) {
20             int tmp = b[j] - (*it).first;
21             if(tmp <= 0) break;
22             if(mp.count(tmp)) {
23                 if(tmp == (*it).first && mp[tmp] == 1) continue;
24                 // cout << (*it).first << ‘ ‘<< tmp << endl;
25                 flag = true;
26                 break;
27             }
28         }
29         if(!flag) {
30             ans += (*it).second;
31         }
32     }
33     cout << ans << endl;
34     return 0;
35 }

Polycarp likes numbers that are divisible by 3.

He has a huge number $s$

For example, if the original number is $s = 3121$

Polycarp can make an arbitrary number of vertical cuts, where each cut is made between a pair of adjacent digits. The resulting numbers cannot contain extra leading zeroes (that is, the number can begin with 0 if and only if this number is exactly one character ‘0‘). For example, 007, 01 and 00099 are not valid numbers, but 90, 0 and 10001 are valid.

What is the maximum number of numbers divisible by $3$

Input

The first line of the input contains a positive integer $s$

Output

Print the maximum number of numbers divisible by $3$

Examples

input

Copy

output

Copy

input

Copy

output

Copy

input

Copy

1000000000000000000000000000000000

output

Copy

input

Copy

201920181

output

Copy

Note

In the first example, an example set of optimal cuts on the number is 3|1|21.

In the second example, you do not need to make any cuts. The specified number 6 forms one number that is divisible by $3$

In the third example, cuts must be made between each pair of digits. As a result, Polycarp gets one digit 1 and $33$

In the fourth example, an example set of optimal cuts is 2|0|1|9|201|81. The numbers $0$

最多能分成多少份总和模3等于0 的数

 1 #include <bits/stdc++.h>
 2 #define ll long long
 3 using namespace std;
 4 const int N = 2e5+10;
 5 char str[N];
 6 int main() {
 7     scanf("%s", str);
 8     int len = strlen(str);
 9     int ans = 0, tmp = 0, sum = 0, n = 0;
10     for(int i = 0; i < len; i ++) {
11         tmp = (str[i]-‘0‘) % 3;
12         sum += tmp;
13         n++;
14         if(tmp == 0 || sum%3==0 || n == 3) {
15             ans++;
16             sum = n = 0;
17         }
18     }
19     cout << ans << endl;
20     return 0;
21 }

Polycarp likes numbers that are divisible by 3.

He has a huge number $s$

For example, if the original number is $s = 3121$

What is the maximum number of numbers divisible by $3$

Input

The first line of the input contains a positive integer $s$

Output

Print the maximum number of numbers divisible by $3$

Examples

input

Copy

output

Copy

input

Copy

output

Copy

input

Copy

1000000000000000000000000000000000

output

Copy

input

Copy

201920181

output

Copy

Note

In the first example, an example set of optimal cuts on the number is 3|1|21.

In the second example, you do not need to make any cuts. The specified number 6 forms one number that is divisible by $3$

In the third example, cuts must be made between each pair of digits. As a result, Polycarp gets one digit 1 and $33$

In the fourth example, an example set of optimal cuts is 2|0|1|9|201|81. The numbers $0$

找到m的位置，然后计算左边大于m的数与小于m的数的差值。接着从右边反向计算算出结果。

 1 #include <bits/stdc++.h>
 2 #define ll long long
 3 using namespace std;
 4 const int N = 2e5+10;
 5 int a[N], n, m, k;
 6 map<int,ll> mp;
 7 int main() {
 8     scanf("%d %d", &n, &m);
 9     for(int i = 1; i <= n; i ++) {
10         scanf("%d", &a[i]);
11         if(a[i] == m) k = i;
12     }
13     int s = 1;
14     for(int i = k; i > 0; i --) {
15         if(a[i] > m) s++;
16         else s--;
17         mp[s]++;
18     }
19     s = -1;
20     ll ans = 0;
21     for(int i = k; i <= n; i ++) {
22         if(a[i] > m) s--;
23         else s++;
24         ans += mp[s] + mp[s+1];
25     }
26     printf("%lld\n",ans);
27     return 0;
28 }

Codeforces Round #496 (Div. 3) ABCDE

标签：row correct class find bre clipboard where dash sts

原文地址：https://www.cnblogs.com/xingkongyihao/p/9290939.html

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年07月29日 (22)
2021年07月28日 (40)
2021年07月27日 (32)
2021年07月26日 (79)
2021年07月23日 (29)
2021年07月22日 (30)
2021年07月21日 (42)
2021年07月20日 (16)
2021年07月19日 (90)
2021年07月16日 (35)

周排行

Codeforces Round #496 (Div. 3) ABCDE

A. Tanya and Stairways

B. Delete from the Left

C. Summarize to the Power of Two

D. Polycarp and Div 3

D. Polycarp and Div 3