Feel Free to Share your Opinion
এই ছোট ওয়েবসাইট টি View করার পর আপনার মনের মধ্যে আশা ভালো-মন্দ কথা গুলো এখানে শেয়ার করুন। এর দ্বারা আমি নতুন কিছু শিখতে পারবো। যা নাকি আমাকে সামনে ভালো কিছুর করার দিক নির্দেশনা দিবে। Thanks in Advance....
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 ...
Comments
Post a Comment