Division 2 (A) Problems From Codeforces
| Serial | Problem Link | Difficulty | Time | Status | Approach | tags |
|---|---|---|---|---|---|---|
| 1 | https://codeforces.com/contest/2059/problem/A | 1000 | 00.23.00 | AC | Two set to store the input array and check for the size of the sets to get the answer. | constructive algorithms, greedy, sortings |
| 2 | https://codeforces.com/contest/2062/problem/A | 800 | 00.04.00 | AC | Check the number ‘1’ in the input strings and the count is the answer. | constructive algorithms, greedy, math, strings |
| 3 | https://codeforces.com/contest/2063/problem/A | 800 | 00.08.00 | AC | [n,n] is the segment that meats the requirements. So n-m is the solution accept the input 1 1. In that case answer is 1. | math, number theory |
| 4 | https://codeforces.com/contest/2061/problem/A | 800 | 00.35.00 | AC | If there is an even number exists, answer is odd_count+1 otherwise odd_count-1. | math |
| 5 | https://codeforces.com/contest/2056/problem/A | 800 | 00.22.00 | AC | calculate all the x and y sides changes and add to the m*4 to get the answer. | constructive algorithms, math |
| 6 | http://codeforces.com/contest/2055/problem/A | 800 | 00.15.00 | AC | difference between alice and bob needs to be 2 to print ‘YES’ otherwise ‘NO’. | constructive algorithms, games, greedy, math |
| 7 | https://codeforces.com/contest/2043/problem/A | 800 | 00.18.00 | AC | count of the operation n/4 and then 2 to the power count is the answer. | brute force, math |
| 8 | https://codeforces.com/contest/2049/problem/A | 800 | 00.30.00 | WA | greedy, implementation | |
| 9 | https://codeforces.com/contest/2040/problem/A | 800 | 00.18.00 | AC | O(n^2) approach to calculate the divisible or not. | games, math |
| 10 | https://codeforces.com/contest/2047/problem/A | 800 | 00.60.00 | AC | check the consecutive sum with the 1^2, 3^2, 5^2, …, 99^2 vector to increase the count. | implementation, math |
| 11 | https://codeforces.com/contest/2042/problem/A | 800 | 00.25.00 | AC | Prefix sum and then a loop to find the answer. | greedy, sortings |
| 12 | https://codeforces.com/contest/2034/problem/A | 800 | 00.04.30 | AC | lcm of a,b | brute force, chinese remainder theorem, math, number theory |
| 13 | https://codeforces.com/contest/2039/problem/A | 800 | 00.05.00 | AC | print odd number n times | constructive algorithms, number theory |
| 14 | https://codeforces.com/contest/2031/problem/A | 800 | 00.38.00 | AC | size minus most frequency of a number | constructive algorithms, dp, greedy, math |
| 15 | https://codeforces.com/contest/2028/problem/A | 900 | 00.21.00 | AC | iterate over the strings for the 100th time and check wheather it reaches to the (a. b) | brute force, implementation, math |
| 16 | https://codeforces.com/contest/2032/problem/A | 800 | 00.14.00 | AC | Check for the count of zero’s and one’s to get the answer. | greedy, implementation, math, number theory |
| 17 | ||||||
| 18 | ||||||
| 19 | ||||||
| 20 | ||||||
| 21 | ||||||
| 22 | ||||||
| 23 | ||||||
| 24 | ||||||
| 25 | ||||||
| 26 | ||||||
| 27 | ||||||
| 28 | ||||||
| 29 | ||||||
| 30 | ||||||
| 31 | ||||||
| 32 | ||||||
| 33 | ||||||
| 34 | ||||||
| 35 | ||||||
| 36 | ||||||
| 37 | ||||||
| 38 | ||||||
| 39 | ||||||
| 40 |