problem link:-https://codeforces.me/problemset/problem/1881/D↵
↵
↵
here we have to choose two element in the array let ai,aj↵
and choose a divisor of ai let x↵
and replace ai=ai/x ans aj=aj*x;↵
↵
after some operation we have to make all the element equal in that array↵
↵
now let consider an array of two elements a1,a2↵
now let ai=a1 and aj=a2↵
x the divisor a1↵
↵
↵
↵
↵
==>let say a1=a1/x and aj=aj*x;↵
==>now a1/x=a2*x now multiply these two we get (a1/x)*(aj*x)=a1*a2;↵
↵
↵
↵
↵
↵
we can generalise after all the operation when we multiply all the elements we get a1*a2*a3*a4......↵
so we can generalise if the nth root of a1*a2*a3....*an↵
is a whole number then return yes otherwise return no;↵
I don't no how to implement this idea.....↵
also please clarify that the idea is right or wrong. ↵
↵
↵
here we have to choose two element in the array let ai,aj↵
and choose a divisor of ai let x↵
and replace ai=ai/x ans aj=aj*x;↵
↵
after some operation we have to make all the element equal in that array↵
↵
now let consider an array of two elements a1,a2↵
now let ai=a1 and aj=a2↵
x the divisor a1↵
↵
↵
↵
↵
==>let say a1=a1/x and aj=aj*x;↵
==>now a1/x=a2*x now multiply these two we get (a1/x)*(aj*x)=a1*a2;↵
↵
↵
↵
↵
↵
we can generalise after all the operation when we multiply all the elements we get a1*a2*a3*a4......↵
so we can generalise if the nth root of a1*a2*a3....*an↵
is a whole number then return yes otherwise return no;↵
I don't no how to implement this idea.....↵
also please clarify that the idea is right or wrong. ↵
