New Self New Life
No Result
View All Result
  • Home
  • Entertainment
  • Celebrity
  • Cinema
  • Music
  • Digital Lifestyle
  • Social Media
  • Softwares
  • Devices
  • Home
  • Entertainment
  • Celebrity
  • Cinema
  • Music
  • Digital Lifestyle
  • Social Media
  • Softwares
  • Devices
New Self New Life
No Result
View All Result
Home Softwares

Construct an Array of length N containing exactly K elements divisible by their positions

by admin
3 years ago
in Softwares
Best Coding Practices For Rest API Design
Share on FacebookShare on Twitter


Given two integers N and Okay, the duty is to assemble an array of size N containing precisely Okay components divisible by their positions.

Examples:

Enter: N = 6, Okay = 2
Output: {5, 1, 2, 3, 4, 6}
Rationalization: Contemplating the above array:
At Place 1, factor 5 is divisible by 1
At Place 2, factor 1 will not be divisible by 2
At Place 3, factor 2 will not be divisible by 3
At Place 4, factor 3 will not be divisible by 4
At Place 5, factor 4 will not be divisible by 5
At Place 6, factor 6 is divisible by 6
Due to this fact, there are precisely Okay components in array divisible by their positions, assembly the required standards.
Therefore the resultant array can be {5 1 2 3 4 6}.

Enter: N = 5, Okay = 5
Output: {1, 2, 3, 4, 5}

 

Strategy: The issue could be solved simply utilizing Grasping method based mostly on under observations:

For any integer X, we all know that:

  • X can be divisible by 1 and X all the time.
  • No integer better than X will ever be capable to divide X.

So utilizing these observations, we will assemble the array containing precisely Okay components divisible by their positions, as follows:

  • For place 1, place any factor better than 1, as a result of 1 will divide all integers
  • For positions better than 1, select Okay-1 positions, and place them within the array at corresponding indices.
  • The remaining N-Okay positions could be positioned at another place to match the required standards.

Illustrations:

Take into account an instance: N = 6, Okay = 5

The empty array of dimension 6 can be: 
arr[]:         _  _ _  _ _  _
positions: 1 2 3 4 5 6

Step 1: Fill place 1 with any integer better than 1

  • For 1st worth equal to its place, we’ve 2 choices – to insert 1 at 1, and to insert some integer better than 1 at 1. If we insert 1 at 1, there can be a case once we can not have Okay=5 values identical as their positions. So we are going to insert another worth better than 1 at place 1 (say 5):
    • arr[]:         5 _ _  _ _  _
      positions: 1 2 3 4 5 6

Step 2: Fill Okay-1 (=4) positions at corresponding indices

  • For 2nd worth equal to its place:
    • arr[]:         5 2 _  _ _ _
      positions: 1 2 3 4 5 6
  • For third worth equal to its place:
    • arr[]:         5 2 3  _ _ _
      positions: 1 2 3 4 5 6
  • For 4th worth equal to its place:
    • arr[]:         5 2 3 4 _ _
      positions: 1 2 3 4 5 6
  • For fifth worth equal to its place, we can not insert 5 at place 5, as it’s already used at place 1. So we are going to insert 1 at place 5, and 6 at place 6:
    • arr[]:         5 2 3 4 1 6
      positions: 1 2 3 4 5 6

Due to this fact the ultimate array can be: 5 2 3 4 1 6

Observe the steps under to implement the above method:

  • Create an array of N consecutive optimistic integers from 1 to N.
  • After the index N-Okay, there can be Okay-1 components left, we won’t intrude with these components. So, we’ve Okay-1 components, that are divisible by their place.
  • We’ll make First factor of the array equal to the factor at index N-Okay. This may even be divisible by its place.
  • We’ll make the remaining components (i.e. from index 1 to N-Okay) equal to the weather instant left to them. These all N-Okay components won’t be divisible by their place then and remaining Okay components could be divisible by their place.

Beneath is the implementation of the above method:

C++

#embody <bits/stdc++.h>

utilizing namespace std;

  

vector<int> constructArray(int N, int Okay)

{

    

    vector<int> A(N, 0);

  

    

    for (int i = 0; i < N; i++) {

        A[i] = i + 1;

    }

  

    

    

    

    int goal = N - Okay;

  

    

    

    int prev = A[0];

  

    

    

    A[0] = A[target];

  

    

    

    

    

    for (int i = 1; i <= goal; i++) {

        int temp = A[i];

        A[i] = prev;

        prev = temp;

    }

  

    return A;

}

  

int major()

{

    int N = 6, Okay = 2;

  

    

    

    vector<int> A = constructArray(N, Okay);

  

    

    for (int i = 0; i < N; i++)

        cout << A[i] << " ";

    cout << endl;

}

Time Complexity:  O(N)
Auxiliary House:  O(N)



Source link

Tags: arrayConstructdivisibleElementslengthpositions
Previous Post

What Is a Development Environment? How to Get Started Now

Next Post

What Renee Zellweger Did While On A Break From Acting

Related Posts

Applications of Artificial Intelligence in Business
Softwares

Applications of Artificial Intelligence in Business

by admin
June 4, 2025
How to Add Custom Style Variations to WordPress Blocks — Speckyboy
Softwares

How to Add Custom Style Variations to WordPress Blocks — Speckyboy

by admin
June 2, 2025
Smart software replaces expensive sensors for glass wall detection with 96% accuracy
Softwares

Smart software replaces expensive sensors for glass wall detection with 96% accuracy

by admin
June 1, 2025
User Guide For UnoPim PDF Generator
Softwares

User Guide For UnoPim PDF Generator

by admin
May 31, 2025
Infragistics Ultimate 25.1 includes updates across several of its UI toolkit components
Softwares

Infragistics Ultimate 25.1 includes updates across several of its UI toolkit components

by admin
May 29, 2025
Next Post
What Renee Zellweger Did While On A Break From Acting

What Renee Zellweger Did While On A Break From Acting

International Women’s Day – #ShutTheStereotype – Noise

International Women’s Day - #ShutTheStereotype – Noise

  • Trending
  • Comments
  • Latest
How to Build a JavaScript Search [Article]

How to Build a JavaScript Search [Article]

August 30, 2022
I Tried Calocurb For 90 Days. Here’s My Review.

I Tried Calocurb For 90 Days. Here’s My Review.

January 8, 2025
Advancement in predicting software vulnerabilities

Advancement in predicting software vulnerabilities

May 21, 2022
Product Information Management Trends (PIM)

Product Information Management Trends (PIM)

February 4, 2022
15 Best Movies Like Parasite

15 Best Movies Like Parasite

February 20, 2022
Trends in Mobile App Development

Trends in Mobile App Development

December 1, 2021
Phantom Parade Gets Opening Movie, Cast Announced

Phantom Parade Gets Opening Movie, Cast Announced

March 8, 2022
The Owl House: 10 Funniest Quotes

The Owl House: 10 Funniest Quotes

September 7, 2022
Michael Strahan delivers statement on future with GMA after eight year run

Michael Strahan delivers statement on future with GMA after eight year run

June 6, 2025
Netflix’s Blood-Soaked Revenge Thriller Is the Unofficial John Wick Spinoff We Always Wanted

Netflix’s Blood-Soaked Revenge Thriller Is the Unofficial John Wick Spinoff We Always Wanted

June 6, 2025
With Their New Single, 2ŁØT and Aloe Blacc Inspire Us to Become ‘Immortal’

With Their New Single, 2ŁØT and Aloe Blacc Inspire Us to Become ‘Immortal’

June 5, 2025
Has The Survivors Season 2 Been Canceled or Renewed?

Has The Survivors Season 2 Been Canceled or Renewed?

June 5, 2025
Turning Disaster Into Relief: The Purpose-Driven Growth of Insurance Claim HQ

Turning Disaster Into Relief: The Purpose-Driven Growth of Insurance Claim HQ

June 5, 2025
Rogue Traders singer Natalie Bassingthwaighte celebrates second anniversary with partner Pip Loth

Rogue Traders singer Natalie Bassingthwaighte celebrates second anniversary with partner Pip Loth

June 5, 2025
X Adds Verification Explainers To Avoid EU Fines

X Adds Verification Explainers To Avoid EU Fines

June 5, 2025
Leah Remini Addresses Rumors of a Rift with Jennifer Lopez

Leah Remini Addresses Rumors of a Rift with Jennifer Lopez

June 5, 2025
New Self New Life

Your source for entertainment news, celebrities, celebrity news, and Music, Cinema, Digital Lifestyle and Social Media and More !

Categories

  • Celebrity
  • Cinema
  • Devices
  • Digital Lifestyle
  • Entertainment
  • Music
  • Social Media
  • Softwares
  • Uncategorized

Recent Posts

  • Michael Strahan delivers statement on future with GMA after eight year run
  • Netflix’s Blood-Soaked Revenge Thriller Is the Unofficial John Wick Spinoff We Always Wanted
  • With Their New Single, 2ŁØT and Aloe Blacc Inspire Us to Become ‘Immortal’
  • Home
  • Disclaimer
  • DMCA
  • Privacy Policy
  • Cookie Privacy Policy
  • Terms and Conditions
  • Contact us

Copyright © 2021 New Self New Life.
New Self New Life is not responsible for the content of external sites. slotsfree  creator solana token

No Result
View All Result
  • Home
  • Entertainment
  • Celebrity
  • Cinema
  • Music
  • Digital Lifestyle
  • Social Media
  • Softwares
  • Devices

Copyright © 2021 New Self New Life.
New Self New Life is not responsible for the content of external sites.

New Self New Life