Skip to content

Commit a6955a5

Browse files
megatron10megatron10
committed
cf
0 parents  commit a6955a5

File tree

483 files changed

+19550
-0
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

483 files changed

+19550
-0
lines changed

‎100247-C/100247-C-39351763.cpp

Whitespace-only changes.

‎100247-C/100247-C-Statement.html

+76
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,76 @@
1+
<div class="ttypography">
2+
<div class="problem-statement">
3+
<div class="header">
4+
<div class="title">
5+
C. Victor's Research
6+
</div>
7+
<div class="time-limit">
8+
<div class="property-title">
9+
time limit per test
10+
</div>2.0 s
11+
</div>
12+
<div class="memory-limit">
13+
<div class="property-title">
14+
memory limit per test
15+
</div>256 MB
16+
</div>
17+
<div class="input-file">
18+
<div class="property-title">
19+
input
20+
</div>standard input
21+
</div>
22+
<div class="output-file">
23+
<div class="property-title">
24+
output
25+
</div>standard output
26+
</div>
27+
</div>
28+
<div>
29+
<p>Unacknowledged scientist Victor conducts a pseudoscientific research of the relation between integers that cross his mind and the integer that comes into his assistant's mind. He wrote the integers <span class="tex-span"><i>a</i><sub class="lower-index">1</sub></span>, <span class="tex-span">...</span>, <span class="tex-span"><i>a</i><sub class="lower-index"><i>n</i></sub></span> which had crossed his mind. Then it turned up that the integer <span class="tex-span"><i>s</i></span> had come into his assistant's mind. Victor wants to determine how many consecutive non-empty sets of integers <span class="tex-span"><i>a</i><sub class="lower-index"><i>l</i></sub></span>, <span class="tex-span"><i>a</i><sub class="lower-index"><i>l</i> + 1</sub></span>, <span class="tex-span">...</span>, <span class="tex-span"><i>a</i><sub class="lower-index"><i>r</i></sub></span> (<span class="tex-span"><i>l</i> ≤ <i>r</i></span>) have the sum <span class="tex-span"><i>a</i><sub class="lower-index"><i>l</i></sub> + <i>a</i><sub class="lower-index"><i>l</i> + 1</sub> + ... + <i>a</i><sub class="lower-index"><i>r</i></sub> = <i>s</i></span>.</p>
30+
</div>
31+
<div class="input-specification">
32+
<div class="section-title">
33+
Input
34+
</div>
35+
<p>The first line contains two integers separated by space: <span class="tex-span"><i>n</i></span> and <span class="tex-span"><i>s</i></span> (<span class="tex-span">1 ≤ <i>n</i> ≤ 200000</span>, <span class="tex-span"> - 2·10<sup class="upper-index">14</sup> ≤ <i>s</i> ≤ 2·10<sup class="upper-index">14</sup></span>) — the number of integers which crossed Victor's mind and the integer that came into his assistant's mind.</p>
36+
<p>The second line contains <span class="tex-span"><i>n</i></span> integers separated by space: <span class="tex-span"><i>a</i><sub class="lower-index"><i>i</i></sub></span> (<span class="tex-span"> - 10<sup class="upper-index">9</sup> ≤ <i>a</i><sub class="lower-index"><i>i</i></sub> ≤ 10<sup class="upper-index">9</sup></span>) — the integers which crossed Victor's mind.</p>
37+
</div>
38+
<div class="output-specification">
39+
<div class="section-title">
40+
Output
41+
</div>
42+
<p>Output the only integer — the number of consecutive non-empty sets of integers which have the sum <span class="tex-span"><i>s</i></span>.</p>
43+
</div>
44+
<div class="sample-tests">
45+
<div class="section-title">
46+
Examples
47+
</div>
48+
<div class="sample-test">
49+
<div class="input">
50+
<div class="title">
51+
Input
52+
</div>
53+
<pre>5 2<br>-1 1 2 -1 1<br></pre>
54+
</div>
55+
<div class="output">
56+
<div class="title">
57+
Output
58+
</div>
59+
<pre>5<br></pre>
60+
</div>
61+
<div class="input">
62+
<div class="title">
63+
Input
64+
</div>
65+
<pre>6 3<br>3 -2 1 -1 1 2<br></pre>
66+
</div>
67+
<div class="output">
68+
<div class="title">
69+
Output
70+
</div>
71+
<pre>3<br></pre>
72+
</div>
73+
</div>
74+
</div>
75+
</div>
76+
</div>

‎101262-A/101262-A-41964328.cpp

Whitespace-only changes.

‎101262-A/101262-A-Statement.html

+94
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,94 @@
1+
<div class="ttypography">
2+
<div class="problem-statement">
3+
<div class="header">
4+
<div class="title">
5+
A. Vera and Outfits
6+
</div>
7+
<div class="time-limit">
8+
<div class="property-title">
9+
time limit per test
10+
</div>2.0 s
11+
</div>
12+
<div class="memory-limit">
13+
<div class="property-title">
14+
memory limit per test
15+
</div>256 MB
16+
</div>
17+
<div class="input-file">
18+
<div class="property-title">
19+
input
20+
</div>standard input
21+
</div>
22+
<div class="output-file">
23+
<div class="property-title">
24+
output
25+
</div>standard output
26+
</div>
27+
</div>
28+
<div>
29+
<p>Vera owns <span class="tex-span"><i>N</i></span> tops and <span class="tex-span"><i>N</i></span> pants. The <span class="tex-span"><i>i</i></span>-th top and <span class="tex-span"><i>i</i></span>-th pants have colour <span class="tex-span"><i>i</i></span>, for <span class="tex-span">1 ≤ <i>i</i> ≤ <i>N</i></span>, where all <span class="tex-span"><i>N</i></span> colors are different from each other.</p>
30+
<p>An outfit consists of one top and one pants. Vera likes outfits where the top and pants are not the same colour. </p>
31+
<p>How many different outfits does she like?</p>
32+
<p><span class="tex-font-style-bf">Constraints:</span></p>
33+
<p><span class="tex-span">1 ≤ <i>N</i> ≤ 2017</span></p>
34+
<p><span class="tex-span"><i>N</i></span> is integer</p>
35+
</div>
36+
<div class="input-specification">
37+
<div class="section-title">
38+
Input
39+
</div>
40+
<p>The input will be in the format:</p>
41+
<p><span class="tex-span"><i>N</i></span></p>
42+
</div>
43+
<div class="output-specification">
44+
<div class="section-title">
45+
Output
46+
</div>
47+
<p>Output one line with the number of different outfits Vera likes.</p>
48+
</div>
49+
<div class="sample-tests">
50+
<div class="section-title">
51+
Examples
52+
</div>
53+
<div class="sample-test">
54+
<div class="input">
55+
<div class="title">
56+
Input
57+
</div>
58+
<pre>1<br></pre>
59+
</div>
60+
<div class="output">
61+
<div class="title">
62+
Output
63+
</div>
64+
<pre>0<br></pre>
65+
</div>
66+
<div class="input">
67+
<div class="title">
68+
Input
69+
</div>
70+
<pre>2<br></pre>
71+
</div>
72+
<div class="output">
73+
<div class="title">
74+
Output
75+
</div>
76+
<pre>2<br></pre>
77+
</div>
78+
<div class="input">
79+
<div class="title">
80+
Input
81+
</div>
82+
<pre>5<br></pre>
83+
</div>
84+
<div class="output">
85+
<div class="title">
86+
Output
87+
</div>
88+
<pre>20<br></pre>
89+
</div>
90+
</div>
91+
</div>
92+
</div>
93+
<p> </p>
94+
</div>

‎101262-B/101262-B-41965677.cpp

Whitespace-only changes.

‎101262-B/101262-B-Statement.html

+91
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,91 @@
1+
<div class="ttypography">
2+
<div class="problem-statement">
3+
<div class="header">
4+
<div class="title">
5+
B. Vera And LCS
6+
</div>
7+
<div class="time-limit">
8+
<div class="property-title">
9+
time limit per test
10+
</div>2.0 s
11+
</div>
12+
<div class="memory-limit">
13+
<div class="property-title">
14+
memory limit per test
15+
</div>256 MB
16+
</div>
17+
<div class="input-file">
18+
<div class="property-title">
19+
input
20+
</div>standard input
21+
</div>
22+
<div class="output-file">
23+
<div class="property-title">
24+
output
25+
</div>standard output
26+
</div>
27+
</div>
28+
<div>
29+
<p>Vera is learning about the longest common subsequence problem. </p>
30+
<p>A string is a (possibly empty) sequence of lowercase letters. A subsequence of a string <span class="tex-span"><i>S</i></span> is a string obtained by deleting some letters of <span class="tex-span"><i>S</i></span> (possibly none or all). For example <span class="tex-span">"<i>vra</i>"</span>, <span class="tex-span">"<i>a</i>"</span>, <span class="tex-span">""</span>, and <span class="tex-span">"<i>vera</i>"</span> are all subsequences of <span class="tex-span">"<i>vera</i>"</span>. The longest common subsequence (LCS) of two strings <span class="tex-span"><i>A</i></span>, <span class="tex-span"><i>B</i></span> is a string that is a subsequence of <span class="tex-span"><i>A</i></span> and <span class="tex-span"><i>B</i></span> and has the maximum length among all strings that are a subsequence of <span class="tex-span"><i>A</i></span> and <span class="tex-span"><i>B</i></span>. There could be multiple LCS for two given strings. For example a LCS of <span class="tex-span">"<i>vera</i>"</span> and <span class="tex-span">"<i>eats</i>"</span> is <span class="tex-span">"<i>ea</i>"</span>.</p>
31+
<p>For homework she was given two strings <span class="tex-span"><i>A</i></span>, <span class="tex-span"><i>B</i></span>, both of length <span class="tex-span"><i>N</i></span> and she had to determine the length of the LCS of <span class="tex-span"><i>A</i></span> and <span class="tex-span"><i>B</i></span>. She determined the answer to be <span class="tex-span"><i>K</i></span> but lost <span class="tex-span"><i>B</i></span>. Given <span class="tex-span"><i>A</i></span> and <span class="tex-span"><i>K</i></span>, help her find a possible value of <span class="tex-span"><i>B</i></span>. It's possible that Vera may have made a mistake and no such <span class="tex-span"><i>B</i></span> exists, in that case output <span class="tex-span">"<i>WRONGANSWER</i>"</span> (without quotes).</p>
32+
<p><span class="tex-font-style-bf">Constraints:</span></p>
33+
<p><span class="tex-span">1 ≤ <i>N</i> ≤ 2000</span></p>
34+
<p><span class="tex-span">0 ≤ <i>K</i> ≤ 2000</span></p>
35+
<p><span class="tex-span"><i>N</i>, <i>K</i></span> are integers</p>
36+
<p><span class="tex-span"><i>A</i></span> consists of <span class="tex-span"><i>N</i></span> lowercase letters</p>
37+
</div>
38+
<div class="input-specification">
39+
<div class="section-title">
40+
Input
41+
</div>
42+
<p>The input will be in the format:</p>
43+
<p><span class="tex-span"><i>N</i></span> <span class="tex-span"><i>K</i></span></p>
44+
<p><span class="tex-span"><i>A</i></span></p>
45+
</div>
46+
<div class="output-specification">
47+
<div class="section-title">
48+
Output
49+
</div>
50+
<p>Output one line consisting of the string <span class="tex-span"><i>B</i></span> of <span class="tex-span"><i>N</i></span> lowercase letters, or <span class="tex-span">"<i>WRONGANSWER</i>"</span> if no <span class="tex-span"><i>B</i></span> is valid. If there are multiple correct <span class="tex-span"><i>B</i></span> output any of them.</p>
51+
</div>
52+
<div class="sample-tests">
53+
<div class="section-title">
54+
Examples
55+
</div>
56+
<div class="sample-test">
57+
<div class="input">
58+
<div class="title">
59+
Input
60+
</div>
61+
<pre>4 2<br>vera<br></pre>
62+
</div>
63+
<div class="output">
64+
<div class="title">
65+
Output
66+
</div>
67+
<pre>eats<br></pre>
68+
</div>
69+
<div class="input">
70+
<div class="title">
71+
Input
72+
</div>
73+
<pre>4 5<br>vera<br></pre>
74+
</div>
75+
<div class="output">
76+
<div class="title">
77+
Output
78+
</div>
79+
<pre>WRONGANSWER<br></pre>
80+
</div>
81+
</div>
82+
</div>
83+
<div class="note">
84+
<div class="section-title">
85+
Note
86+
</div>
87+
<p>For the first example, another possible answer is <span class="tex-span">"<i>uber</i>"</span>.</p>
88+
</div>
89+
</div>
90+
<p> </p>
91+
</div>

‎101262-C/101262-C-41966716.py

Whitespace-only changes.

‎101262-C/101262-C-41967004.cpp

Whitespace-only changes.

‎101262-C/101262-C-Statement.html

+92
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,92 @@
1+
<div class="ttypography">
2+
<div class="problem-statement">
3+
<div class="header">
4+
<div class="title">
5+
C. Vera and Mean Sorting
6+
</div>
7+
<div class="time-limit">
8+
<div class="property-title">
9+
time limit per test
10+
</div>2.0 s
11+
</div>
12+
<div class="memory-limit">
13+
<div class="property-title">
14+
memory limit per test
15+
</div>256 MB
16+
</div>
17+
<div class="input-file">
18+
<div class="property-title">
19+
input
20+
</div>standard input
21+
</div>
22+
<div class="output-file">
23+
<div class="property-title">
24+
output
25+
</div>standard output
26+
</div>
27+
</div>
28+
<div>
29+
<p>The harmonic mean of a sequence of positive integers <span class="tex-span"><i>x</i><sub class="lower-index">1</sub>, ..., <i>x</i><sub class="lower-index"><i>N</i></sub></span> is </p>
30+
<center class="tex-equation">
31+
<img align="middle" class="tex-formula" src="/predownloaded/09/85/098579b2373453d207c0ff642bdbb5d3a3789d73.png" style="max-width: 100.0%;max-height: 100.0%;">
32+
</center>
33+
<p>Vera thinks that an array of positive integers <span class="tex-span"><i>A</i> = [<i>A</i><sub class="lower-index">1</sub>, ..., <i>A</i><sub class="lower-index"><i>N</i></sub>]</span> of length <span class="tex-span"><i>N</i></span> is <span class="tex-span"><i>K</i></span>-mean-sorted if <span class="tex-span"><i>M</i>(<i>i</i>) ≥ <i>M</i>(<i>i</i> + 1)</span> for <span class="tex-span">1 ≤ <i>i</i> ≤ <i>N</i> - <i>K</i></span> where </p>
34+
<center class="tex-equation">
35+
<span class="tex-span"><i>M</i>(<i>i</i>) = <i>H</i>(<i>A</i><sub class="lower-index"><i>i</i></sub>, ..., <i>A</i><sub class="lower-index"><i>i</i> + <i>K</i> - 1</sub>)</span>
36+
</center>
37+
<p>A permutation <span class="tex-span"><i>P</i></span> is an ordered set of integers <span class="tex-span"><i>P</i><sub class="lower-index">1</sub>, <i>P</i><sub class="lower-index">2</sub>, ..., <i>P</i><sub class="lower-index"><i>N</i></sub></span>, consisting of <span class="tex-span"><i>N</i></span> distinct positive integers, each of them doesn't exceed <span class="tex-span"><i>N</i></span>. We'll call number <span class="tex-span"><i>N</i></span> the size or the length of permutation.</p>
38+
<p>Permutation <span class="tex-span"><i>P</i></span> is lexicographically smaller than permutation <span class="tex-span"><i>Q</i></span> if there is <span class="tex-span"><i>i</i></span> (<span class="tex-span">1 ≤ <i>i</i> ≤ <i>n</i></span>), such that <span class="tex-span"><i>P</i><sub class="lower-index"><i>i</i></sub> &lt; <i>Q</i><sub class="lower-index"><i>i</i></sub></span>, and for any <span class="tex-span"><i>j</i></span> (<span class="tex-span">1 ≤ <i>j</i> &lt; <i>i</i></span>) <span class="tex-span"><i>P</i><sub class="lower-index"><i>j</i></sub> = <i>Q</i><sub class="lower-index"><i>j</i></sub></span>. </p>
39+
<p>Given integers <span class="tex-span"><i>N</i></span> and <span class="tex-span"><i>K</i></span>, help Vera find the lexicographically smallest permutation <span class="tex-span"><i>P</i></span> of integers <span class="tex-span">1</span> to <span class="tex-span"><i>N</i></span> such that <span class="tex-span"><i>P</i></span> is <span class="tex-span"><i>K</i></span>-mean-sorted but not <span class="tex-span"><i>L</i></span>-mean-sorted for <span class="tex-span">1 ≤ <i>L</i> ≤ <i>N</i> - 1, <i>L</i> ≠ <i>K</i></span>.</p>
40+
<p>If no such permutation exists output <span class="tex-span">0</span>.</p>
41+
<p><span class="tex-font-style-bf">Constraints:</span></p>
42+
<p><span class="tex-span">2 ≤ <i>N</i> ≤ 100</span></p>
43+
<p><span class="tex-span">1 ≤ <i>K</i> ≤ <i>N</i> - 1</span></p>
44+
<p><span class="tex-span"><i>N</i>, <i>K</i></span> are integers</p>
45+
</div>
46+
<div class="input-specification">
47+
<div class="section-title">
48+
Input
49+
</div>
50+
<p>The input will be in the format:</p>
51+
<p><span class="tex-span"><i>N</i></span> <span class="tex-span"><i>K</i></span></p>
52+
</div>
53+
<div class="output-specification">
54+
<div class="section-title">
55+
Output
56+
</div>
57+
<p>Output one line with the desired permutation. If such permutation does not exist output one line with <span class="tex-span">0</span>.</p>
58+
</div>
59+
<div class="sample-tests">
60+
<div class="section-title">
61+
Examples
62+
</div>
63+
<div class="sample-test">
64+
<div class="input">
65+
<div class="title">
66+
Input
67+
</div>
68+
<pre>3 2<br></pre>
69+
</div>
70+
<div class="output">
71+
<div class="title">
72+
Output
73+
</div>
74+
<pre>2 3 1<br></pre>
75+
</div>
76+
<div class="input">
77+
<div class="title">
78+
Input
79+
</div>
80+
<pre>4 1<br></pre>
81+
</div>
82+
<div class="output">
83+
<div class="title">
84+
Output
85+
</div>
86+
<pre>0<br></pre>
87+
</div>
88+
</div>
89+
</div>
90+
</div>
91+
<p> </p>
92+
</div>

‎101262-D/101262-D-41969178.cpp

Whitespace-only changes.

0 commit comments

Comments
 (0)