1992C - Gorilla and Permutation - CodeForces Solution


2-sat constructive algorithms fft math math

Please click on ads to support us..

Python Code:

import math
n=int(input())
for i in range(0,n,1):
    l=list(map(int,input().split()))
    n=l[0]
    m=l[1]
    k=l[2]
    l1=[0]*n
    x=n-m
    j=1
    p=n
    for i in range(x,n):
        l1[i]=j
        j+=1
    for i in range(0,x):
        l1[i]=p
        p-=1
    for i in range(0,n):
        print(l1[i],end=" ")
    print(end="\n")


Comments

Submit
0 Comments
More Questions

1716A - 2-3 Moves
1670B - Dorms War
1716B - Permutation Chain
987A - Infinity Gauntlet
1676G - White-Black Balanced Subtrees
1716D - Chip Move
1352F - Binary String Reconstruction
1487B - Cat Cycle
1679C - Rooks Defenders
56A - Bar
1694B - Paranoid String
35A - Shell Game
1684A - Digit Minimization
43B - Letter
1017A - The Rank
1698B - Rising Sand
235A - LCM Challenge
1075B - Taxi drivers and Lyft
1562A - The Miracle and the Sleeper
1216A - Prefixes
1490C - Sum of Cubes
868A - Bark to Unlock
873B - Balanced Substring
1401D - Maximum Distributed Tree
1716C - Robot in a Hallway
1688B - Patchouli's Magical Talisman
99A - Help Far Away Kingdom
622B - The Time
1688C - Manipulating History
1169D - Good Triple