Love Android
I upload my android notes on google drive. Click Here to read my Android note from google drive.

Comments

Post a Comment

Popular posts from this blog

Solution - Codeforces Problem 327B - Hungry Sequence

B. Hungry Sequence Iahub and Iahubina went to a date at a luxury restaurant. Everything went fine until paying for the food. Instead of money, the waiter wants Iahub to write a Hungry sequence consisting of  n  integers. A sequence  a 1 ,  a 2 , ...,  a n , consisting of  n  integers, is  Hungry  if and only if: Its elements are in increasing order. That is an inequality  a i  <  a j  holds for any two indices  i ,  j   ( i  <  j ) . For any two indices  i  and  j   ( i  <  j ) ,  a j  must  not  be divisible by  a i . Iahub is in trouble, so he asks you for help. Find a Hungry sequence with  n  elements. Input The input contains a single integer:  n  ( 1 ≤  n  ≤ 10 5 ). Output Output a line that contains  n  space-separated integers  a 1   a 2 , ...,  a n   (1 ≤  a i  ≤ 10 7 ) , representing a ...
Read more...

Feel Free to Share your Opinion

এই ছোট ওয়েবসাইট টি View করার পর আপনার মনের মধ্যে আশা ভালো-মন্দ কথা গুলো এখানে শেয়ার করুন। এর দ্বারা আমি নতুন কিছু শিখতে পারবো। যা নাকি আমাকে সামনে ভালো কিছুর করার দিক নির্দেশনা দিবে। Thanks in Advance....
Read more...

Dhaka Regional ACM ICPC 2016 Preleminary Contest Solution B - Wrong Solution

B. Wrong Solution Score: 1 CPU: 1s Memory: 1200MB Given a list of stock values, where the i-th element is the value of the stock on the i-th day. Find the maximum money you can earn by buying and selling stocks, given that you can buy or sell (not both) only one stock on a particular day. However, you can have multiple stocks with you at any point of time. You have to buy a stock before you can sell it. Example: stock_prices[] = {2,4,6,8,10},Optimal solution would be {(1,5), (2,4)} (1-based indexing), which means : buy a stock on day 1 and sell that on day 5. buy a stock on day 2, and sell it on day 4. This way you can earn: 10 + 8 – 2 - 4 = 12. For this problem, someone has submitted the following code. The idea of the code is given briefly (initially all the stocks are unmarked): Find the day X where the stock value on day X is the maximum among all the days not yet marked. Choose the rightmost one in case of tie. Find the day Y where Y is before X (Y < X) a...
Read more...