I'm preparing for Team Selection Competition and these are some problems that I want to know how to solve. Problems are from previous competitions
Problem 1
Problem 2
Problem 3
Problem 4
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
Need help in problems from Team Selection Competition in Serbia
I'm preparing for Team Selection Competition and these are some problems that I want to know how to solve. Problems are from previous competitions
Given array with N < = 5 * 105 elements. Find number of subarrays such that every element in subarray appears even times
Given N < = 5000 strings. Find the number of pairs of strings such that after concatenating these strings, new string is palindrome
Given A, N, M . We perform this operation N times : A = (A+biggestDigit(A))%M . Find A after N operations. A < M < = 1018 and N < = 1018
Edit: biggestDigit(A) is digit with biggest value, not most significant one
Given N * N matrix A and Q < = 5 * 105 queries N < = 1000.
First query: 1 X Y, find farthest element in matrix such that its value is less than A[X][Y] (Manhattan distance)
Second query: 2 X Y VAL change element A[X][Y] to VAL
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en9 |
|
Vasiljko | 2018-04-28 17:20:43 | 96 | Tiny change: '$N<=10^18$\nEdit: $b' -> '$N<=10^18$ \nEdit: $b' | |
| en8 |
|
Vasiljko | 2018-04-28 16:49:28 | 134 | ||
| en7 |
|
Vasiljko | 2018-04-28 16:48:47 | 33 | Tiny change: 'nda easier\n' -> 'nda easier (Not easier, but most intersted)\n' | |
| en6 |
|
Vasiljko | 2018-04-28 16:46:51 | 2 | Tiny change: 's : $A=$(A+$biggestD' -> 's : $A=$($A$+$biggestD' | |
| en5 |
|
Vasiljko | 2018-04-28 16:46:11 | 3 | Tiny change: 'perform these operation' -> 'perform this operation' | |
| en4 |
|
Vasiljko | 2018-04-28 16:45:29 | 2 | Tiny change: 'lems are form previous' -> 'lems are from previous' | |
| en3 |
|
Vasiljko | 2018-04-28 16:45:07 | 105 | ||
| en2 |
|
Vasiljko | 2018-04-28 16:42:58 | 731 | Tiny change: ' : $ A=(A+biggestDigit(A))%M $. ' -> ' : $ A=(A+(A))%M $. ' (published) | |
| en1 |
|
Vasiljko | 2018-04-28 16:27:11 | 375 | Initial revision (saved to drafts) |
| Name |
|---|


