Interview Question
- 0of 0 votes
AnswersI have been given an array whose elements lie between [1,70] and the size of array [1,10^5].
- urname September 20, 2018
I have to find the total number of subsets whose all elements multiply to give a perfect square number.
Since, count of subsets can be very large, I have to give the ans mod (10^9 + 7).
How should go on to solve this problem ?
One hint given to me is to utilise the range of value that every array element hold which is [1,70] and total no. of prime numbers between these [1,70] are 19.
link: https://codeforces.com/contest/895/problem/C| Report Duplicate | Flag | PURGE
Email me when people comment.
Email me when people comment.
Loading...
An error occurred in subscribing you.
Email me when people comment.
Email me when people comment.
Loading...
An error occurred in subscribing you.
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.