Let write some permutations of positive integers.
1: 1 2 3 4 5 6 ...
2: 2 1 3 4 ...
3: 1 3 2 4 ...
4: 2 3 1 4 ...
5: 3 1 2 4 ...
6: 3 2 1 4 ...
25: 1 2 3 5 4 ...
120: 5 4 3 2 1 6 7 ...Given a permutation of integers in range 1:n, return it's index following above pattern.
See also: 42495
Solution Stats
Problem Recent Solvers7
Suggested Problems
-
Test if a Number is a Palindrome without using any String Operations
152 Solvers
-
Recurring Cycle Length (Inspired by Project Euler Problem 26)
46 Solvers
-
47 Solvers
-
Create a matrix X, where each column is a shifted copy of the vector v
111 Solvers
-
110 Solvers
More from this Author47
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
Select web siteYou can also select a web site from the following list:
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)
Problem Tags