对象已移动

可在此处找到该文档 Find product of GCDs of all possible row-column pair of given Matrix – New Self New Life
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

Find product of GCDs of all possible row-column pair of given Matrix

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


Given a matrix of dimension N*M, the duty is to seek out the product of all attainable pairs of (i, j) the place i and j are the row quantity and column quantity respectively.

Observe: For the reason that reply could be very giant output the reply modulo 1000000007.

Examples:

Enter: N = 5, M = 6
Output: 5760
Rationalization: The values of GCD of every attainable pair

1 1 1 1 1 1
1 2 1 2 1 2
1  1 3 1 1 3
1 2 1 4 1 2
1 1 1 1 5 1

The product of grid = 1*1*1*1*1*1*1*2*1*2*1*2*1*1*3*1*1*3*1*2*1*4*1*2*1*1*1*1*5*1 = 5760

Enter: N = 34, M = 46
Output: 397325354

Naive Strategy: To unravel the issue traverse all of the attainable pairs of row and column and discover the GCD of them and multiply them with the required reply.

Comply with the steps talked about under to implement the thought:

  • Initialize a variable ans = 1 to retailer the product.
  • Iterate from i = 1 to N:
    • For every worth of i traverse from 1 to M.
    • Calculate the GCD of every pair.
    • Multiply this with ans.
  • Return the ultimate worth of ans because the required reply.

Beneath is the implementation of the above method.

C++

  

#embody <bits/stdc++.h>

utilizing namespace std;

  

int M = 1e9 + 7;

  

int gridPower(int n, int m)

{

    lengthy lengthy ans = 1;

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

        for (int j = 1; j <= m; j++) {

            ans = (ans * __gcd(i, j)) % M;

        }

    }

    return ans;

}

  

int foremost()

{

    int N = 5, M = 6;

  

    

    cout << gridPower(N, M) << endl;

    return 0;

}

Time Complexity: O(N*M*log(min(N, M)))
Auxiliary House: O(1)

Environment friendly Strategy: To unravel the issue comply with the under thought:

It may be noticed that for each row, a sample is fashioned until the row quantity and after that, the identical sample repeats.

1 1 1 1 1 1
1 2 1 2 1 2
1 1 3 1 1 3
1 2 1 4 1 2
1 1 1 1 5 1

For instance within the above grid of 4 rows and 6 columns

In row 1, all of the values are 1
In row 2, until index 2 a sample is fashioned and after that very same sample repeats
In row 3, until index 3 a sample is fashioned and after that very same sample repeats

Comparable observations could be made for all different rows.

Therefore for each row, we solely want to seek out the sample as soon as and multiply that sample energy the variety of instances it happens. This may be completed utilizing Modular exponentiation technique. And eventually we have to multiply the remaining sample energy that is the same as Mpercenti for ith row.

Additionally, we are able to take into account the row because the minimal of N and M to scale back time complexity additional.

Beneath is the implementation of the above method:

C++

  

#embody <bits/stdc++.h>

utilizing namespace std;

  

int M = 1e9 + 7;

  

int fastpower(lengthy lengthy a, int p)

{

    lengthy lengthy res = 1;

    whereas (p > 0) {

        if (p % 2)

            res = (res * a) % M;

        p /= 2;

        a = (a * a) % M;

    }

    return res;

}

  

int gridPower(int n, int m)

{

    lengthy lengthy res = 1;

    for (int i = 1; i <= min(n, m); i++) {

        lengthy lengthy patternPower = 1;

  

        

        

        lengthy lengthy patternOccurence = max(n, m) / i;

  

        

        

        lengthy lengthy stays = max(n, m) % i;

  

        

        

        lengthy lengthy remainsPower = 1;

  

        

        

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

            patternPower = (patternPower * __gcd(i, j)) % M;

  

            if (j == stays)

                remainsPower = patternPower;

        }

  

        res = (res

               * fastpower(patternPower, patternOccurence))

              % M;

        res = (res * remainsPower) % M;

    }

    return res;

}

  

int foremost()

{

    int N = 5, M = 6;

  

    

    cout << gridPower(N, M) << endl;

    return 0;

}

Time Complexity: min(N, M)*min(N, M)*log(min(N, M))
Auxiliary House: O(1)



Source link

Tags: FindGCDsMatrixpairproductrowcolumn
Previous Post

Britney Spears slammed for ‘body shaming’ dancers with ‘offensive’ post. : entertainment

Next Post

The Denim Superlatives: 12 Cuts So Good, They Deserve an Award

Related Posts

Google to mandate verification for all Android app developers
Softwares

Google to mandate verification for all Android app developers

by admin
August 26, 2025
Further Tab Button work and Chromium 140 – Vivaldi Browser snapshot 3787.3
Softwares

Further Tab Button work and Chromium 140 – Vivaldi Browser snapshot 3787.3

by admin
August 23, 2025
Find a Software Development Company in Europe
Softwares

Find a Software Development Company in Europe

by admin
August 24, 2025
Xero Salesforce Integration – The Definitive Guide
Softwares

Xero Salesforce Integration – The Definitive Guide

by admin
August 20, 2025
BrowserStack launches Chrome extension that bundles 10+ manual web testing tools
Softwares

BrowserStack launches Chrome extension that bundles 10+ manual web testing tools

by admin
August 18, 2025
Next Post
The Denim Superlatives: 12 Cuts So Good, They Deserve an Award

The Denim Superlatives: 12 Cuts So Good, They Deserve an Award

Klarus XT11GT Pro 2.0 flashlight review – Copious photons to vanquish the shadows!

Klarus XT11GT Pro 2.0 flashlight review - Copious photons to vanquish the shadows!

  • Trending
  • Comments
  • Latest
10 Best Netflix Original Thriller Shows, Ranked

10 Best Netflix Original Thriller Shows, Ranked

June 22, 2025
Lil Nas X hospitalized in Los Angeles for ‘possible overdose,’ say reports – National

Lil Nas X hospitalized in Los Angeles for ‘possible overdose,’ say reports – National

August 22, 2025
Itch.io starts reindexing free NSFW content

Itch.io starts reindexing free NSFW content

August 1, 2025
Google to mandate verification for all Android app developers

Google to mandate verification for all Android app developers

August 26, 2025
Best AI Webcams For Video Calls In 2025

Best AI Webcams For Video Calls In 2025

August 21, 2025
The Projector closed down. So what?

The Projector closed down. So what?

August 21, 2025
Bass Canyon 2025: Excision’s Festival Evolves With Stunning Crater Stage and Rising Stars

Bass Canyon 2025: Excision’s Festival Evolves With Stunning Crater Stage and Rising Stars

August 22, 2025
12 Forgotten 2005 Movies That Deserve to Be Rediscovered

12 Forgotten 2005 Movies That Deserve to Be Rediscovered

August 24, 2025
Morgan Wallen Fined After Gillette Stadium Show Breaks Curfew

Morgan Wallen Fined After Gillette Stadium Show Breaks Curfew

August 26, 2025
Tatiana Zagorovski Sounds the Alarm with a New Book About How to Avoid Real Estate Scams

Tatiana Zagorovski Sounds the Alarm with a New Book About How to Avoid Real Estate Scams

August 26, 2025
Google to mandate verification for all Android app developers

Google to mandate verification for all Android app developers

August 26, 2025
Apple Watch Series 11: Key Updates and WatchOS 26 Features

Apple Watch Series 11: Key Updates and WatchOS 26 Features

August 26, 2025
Selena Gomez Seems To Have Had Her Bachelorette Party – Without Taylor Swift!

Selena Gomez Seems To Have Had Her Bachelorette Party – Without Taylor Swift!

August 26, 2025
Ex-Boyfriends, Current Relationship – Hollywood Life

Ex-Boyfriends, Current Relationship – Hollywood Life

August 26, 2025
Where AI Gets Its Facts [Infographic]

Where AI Gets Its Facts [Infographic]

August 26, 2025
Apple might opt for a curved glass design for 20th anniversary iPhone

Apple might opt for a curved glass design for 20th anniversary iPhone

August 25, 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

  • Morgan Wallen Fined After Gillette Stadium Show Breaks Curfew
  • Tatiana Zagorovski Sounds the Alarm with a New Book About How to Avoid Real Estate Scams
  • Google to mandate verification for all Android app developers
  • 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