Skip to main content

Nai soch( नई सोच)

hindi poem  नई सोच

जब ढक लिया अंधकार ने नभ को
समा गए   थे    मेघ    नभ  में
आभास हुआ था अमावस्या का
लगा था न होगा अंत तम का
       
       ऐसे में उत्पन्न हुआ था
        उत्साह का एक नया सवेरा
        नई किरण नए जोश से हम
      निर्माण करने चलें स्वर्णिम भारत का

प्रकृति इतनी धन्य हुई हम पर
मस्तक पर हिमालय सजाया
सागर से चरण धुलवाए
और हृदय से गंगा बहाई

               
  शहीदों की चिताओं से इसकी नींव बनाई थी    बापू के अरमानों पर खड़ा किया था भारत      परंतु    इस ।   व्यर्थ । ।  स्वार्थ।   से
    ढ़हने.  लगा है आज यह भारत ।


शहीदों की अस्थियां इतनी कमजोर तो नहीं थी बापू के अरमान इतने कमजोर तो नहीं थे ?
तो क्या कारण हो सकता है इसका ?
कहीं निर्माण में मिलावट तो शामिल  नहीं?


न ही भारत की नींव कमजोर थी
और ना ही इसके स्तंभ शायद
भारत निर्माण के अभियंता ही हैं  उद्दंड


              आओ मिलकर दंडित करें
              ऐसे उद्दंड अभियंता को
              जिन्होंने नींव को खोखला किया
              मिलकर करें उनका अंत

 आज हम मिलकर संकल्प लें
 मजबूत भारत हम बनाएंगे
 शांति का संदेश फैला कर
 विश्व गुरु हम बन जाएंगे।


         


     written by
             -Mahavir (silent writer)




key words

(तम= अंधकार,अभियंता = इंजीनियर)

thank you

Comments

Popular posts from this blog

codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster

 Codeforces rating system | Codeforces rating Newbie to Legendary Grandmaster- Codeforces is one of the most popular platforms for competitive programmers and  codeforces rating matters a lot  .  Competitive Programming  teaches you to find the easiest solution in the quickest possible way. CP enhances your problem-solving and debugging skills giving you real-time fun. It's brain-sport. As you start solving harder and harder problems in live-contests your analytical and rational thinking intensifies. To have a good codeforces profile makes a good impression on the interviewer. If you have a good  codeforces profile so it is very easy to get a referral for product base company like amazon, google , facebook etc.So in this blog I have explained everything about codeforces rating system. What are different titles on codeforces- based on rating codeforces divide rating into 10 part. Newbie Pupil Specialist Expert Candidate Codemaster Master International Master Grandmaster Internat

Merge Two sorted array Without Extra Space

Problem statement-  Given two sorted arrays arr1[] and arr2[] of sizes N and M in non-decreasing order. Merge them in sorted order without using any extra space. Modify arr1 so that it contains the first N elements and modify arr2 so that it contains the last M elements.    Example 1: Input:  N = 4, arr1[] = [1 3 5 7]  M = 5, arr2[] = [0 2 6 8 9] Output:  arr1[] = [0 1 2 3] arr2[] = [5 6 7 8 9] Explanation: After merging the two  non-decreasing arrays, we get,  0 1 2 3 5 6 7 8 9.   Example 2: Input:  N = 2, arr1[] = [10, 12]  M = 3, arr2[] = [5 18 20] Output:  arr1[] = [5 10] arr2[] = [12 18 20] Explanation: After merging two sorted arrays  we get 5 10 12 18 20. Your Task: You don't need to read input or print anything. You only need to complete the function merge() that takes arr1, arr2, N and M as input parameters and modifies them in-place so that they look like the sorted merged array when concatenated. Expected Time Complexity:  O((n+m) log(n+m)) Expected Auxilliary Space: O(1

Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code

 Apple Division CSES Problem Set Solution | CSES Problem Set Solution Apple division with code - Apple Division CSES Problem Solution Easy Explanation. Apple division is problem is taken form cses introductory problem set.Let's Read Problem statement first. Problem Statement- Time limit:  1.00 s   Memory limit:  512 MB There are  n n  apples with known weights. Your task is to divide the apples into two groups so that the difference between the weights of the groups is minimal. Input The first input line has an integer  n n : the number of apples. The next line has  n n  integers  p 1 , p 2 , … , p n p 1 , p 2 , … , p n : the weight of each apple. Output Print one integer: the minimum difference between the weights of the groups. Constraints 1 ≤ n ≤ 20 1 ≤ n ≤ 20 1 ≤ p i ≤ 10 9 1 ≤ p i ≤ 10 9 Example Input: 5 3 2 7 4 1 Output: 1 Explanation: Group 1 has weights 2, 3 and 4 (total weight 9), and group 2 has weights 1 and 7 (total weight 8). Join Telegram channel for code discussi