Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Visit Stack Exchange
Stack Internal
Knowledge at work
Bring the best of human thought and AI automation together at your work.
Explore Stack Internal
map(\x->head$[-1|x<2]++[d|d<-[x-1,x>last$[d|d<-2[1..]x-1],mod x d<1]d<1]++[-1|x<2]) map -- for each element in the input array \x-> -- apply the lambda function headlast -- pick the firstlast element of the following list [[d|d<-1|x<2]++[1..x-1] -- all d --from 1 to x-1 if x<2, followed by [d|d<-[x-1 ,mod x-2..] d<1] -- all d from x-1where downd todivides negativex infinity ++[-1|x<2] ,mod x d<1] -- wherefollowed dby divides-1 xif x<2 map(\x->head$[-1|x<2]++[d|d<-[x-1,x-2..],mod x d<1]) map -- for each element in the input array \x-> -- apply the lambda function head -- pick the first element of the following list [-1|x<2]++ -- -1 if x<2, followed by [d|d<-[x-1,x-2..] -- all d from x-1 down to negative infinity ,mod x d<1] -- where d divides x map(\x->last$[d|d<-[1..x-1],mod x d<1]++[-1|x<2]) map -- for each element in the input array \x-> -- apply the lambda function last -- pick the last element of the following list [d|d<-[1..x-1] -- all d from 1 to x-1 ,mod x d<1] -- where d divides x ++[-1|x<2] -- followed by -1 if x<2 map(\x->head$[-1|x<2]++[d|d<-[x-1,x-2..],mod x d<1]) map -- for each element in the input array \x-> -- apply the lambda function head -- pick the first element of the following list [-1|x<2]++ -- -1 if x<2, followed by [d|d<-[x-1,x-2..] -- all d from x-1 down to negative infinity ,mod x d<1] -- where d divides x