"Cycling through permutations can be done through functions like next_permutation in the C library or simply by recursion."

Or with 4 copypasted cycles + checking if they give a permutation (which can be done with just 4 conditions - three indices must be different and the sum of all 4 must be 0+1+2+3). In this case, it should be the simplest solution.

saikarthik12 Try this: 3 5 6 8 the answer should be impossible btw my answer was just an if condition the problem isn't that big of a deal :D

can anyone plz tell the case this code fails

#include<iostream> using namespace std; #include<algorithm> #include<vector> main() { vector <int> v; for(int i=0;i<4;i++) { int temp; cin>>temp; v.push_back(temp); } sort(v.begin(),v.end()); int k1=v[1]/v[0]; int k2=v[3]/v[2]; int r1=v[1]%v[0]; int r2=v[3]%v[2]; if(k1==k2 && r1==r2) { cout << "Possible"; } else { cout<<"Impossible"; } }

does these both a/b == c/d and a:b == c:d are equal in case of this question ?? because i was getting WA with a/b == c/d.

include<iostream>

using namespace std;

int main() { int a,b,c,d; cin>>a>>b>>c>>d; if((ab==cd) || (ac==bd) || (ad==bc)) { cout<<"Possible"<<endl;

}
else
cout<<"impossible";

} what is wrong in my code?