Contest Archive Link: https://devskill.com/ContestArchive/Con ... d4a7086716

Contest Rank List: https://devskill.com/home/contestrankli ... d4a7086716

Link:

Problem Setter: Bishal Gautam

In this problem, you are asked to change the lowercase letter to uppercase and vice versa.

So, you can simply check the whether the case of letter is lowercase or uppercase and then based upon that

change the case of letter to another one. you can do these transformation by adding/subtracting 32 with ascii

values . As ascii value of lowercase and uppercase letter differ by 32.

Link: http://devskill.com/CodingProblems/ViewProblem/217

Problem Setter: MD. Hasibul Hasan

The idea of the problem is very simple. If we can replace left most digits by highest digit, then we will get

largest number. The highest digit is 9. So, we will go through the number by checking its digits. If the

digit is less than 9 we will replace it with 9 until the replacement count is less than P ( Maximum Digit we can replace ).

Link: http://devskill.com/CodingProblems/ViewProblem/216

Problem Setter: Md.Ashraful Islam Shohag

In this problem, you are given a number containing exactly one alphabetic character. your task to

find out the shortest possible value of that alphabetic character for which the total number is divisible by 3.

Possible value should be 1 to 9. So, you can simply replace that particular character with numbers from

1 to 9, then check whether that number is divisible by 3 or not.

Link: http://devskill.com/CodingProblems/ViewProblem/232

Problem Setter: Tanmoy Tapos Datta

This is a complete search problem. You need to generate all the numbers you can make by deleting K

digits then the answer will be the maximum and minimum among them.

No the question arise how to generate all the numbers. As we can see the range of N is 0 to (10^10)-1

so if we select all the position in different combination, then there will be (2^9)-1 different combinations.

You can use backtrack or bit-mask to generate all this numbers and store the numbers in two array.

for example the arrays are maxi[] and mini [] now, maxi[i]=x then it means that x is the maximum number

you can get from N after deleting i digits. And it's same as mini. after this prepossesses for each query you

need to output the value of maxi[k] and mini[k].

Link: http://devskill.com/CodingProblems/ViewProblem/229

Problem Setter: Pranta Sarker

In this problem, you have to find difference between the positions which is Shafi or Rafi turned to pick a maximum

number exist in the array and similarly you have to check weather it is a Prime or not.

Look, Shafi always turn first and then Rafi . So, every time you may pick the maximum value **until your array

size is not 0**, do summation of all positions where Shafi got the maximum value and similarly all positions where

Rafi got the maximum value..If there are more than one maximum element then leftmost will be choosen.

Find the difference between them. Finally, check it out that is it a Prime or not. If the difference is Prime then

Rafi will win otherwise Shafi will win, you should check the sample input output to print the solution.

As the summation of n over all games will be 10000, you can simply simulate the game procedure ,each

time finding maximum from left side and adding to respective player's summation. So, there will be total

n*(n+1)/2 iteration at max. Then, finally you should check the absolute differences between two

scores is prime or not. Hope you can do this easily in O( Sqrt(N) ) complexity.