Is there any algorithm which can solve Rubik's cube ? If yes then plz. provide me the pseudo code.

This is the problem asked yesterday in icpc kanpur regionals.How should approach this problem?

Problem Statement You have an array A (1-indexed) of N integers. You can perform any number of operations on this array. An operation goes like this,

(1) You pick an index i such that 1 ≤ i ≤ n-2 and a[i] + a[i+2] > a[i+1]

(2) Then you swap a[i] and a[i+2]

You have to output if you can sort the array in non-decreasing order after performing any number of operations. Constraints 1 ≤ T ≤ 10^5 1 ≤ N ≤ 10^5 1 ≤ Sum of N over all testcases ≤ 10^5 1 ≤ Ai ≤ 10^9

I have problem , this might be a silly problem for some people but plz. tell me how to solve this problem. NOTED:I am not asking anything related to any ongoing contest.

the problem statement is: Given all the proper (all the divisors except 1 and N) positive divisors of a positive composite integer N, you need to find the value of N. You should assume that the divisors will be given in such a way so that the value of N will always be greater than 1 and less than or equal to 10^12.

In the previous contest , i was not able to solve problem B but when i saw the rating of problem it shows 800 i am feeling very bad for myself not solving 800 rated problem .So the question is that is it really 800 rating problem ?

Why there is no contest on TLX after 14th Apr.? UPD — Finally wait is over. Next contest on TLX is on 4th September.