1454A - Special Permutation - CodeForces Solution

constructive algorithms probabilities *800

Please click on ads to support us..

Python Code: 

for _ in range(int(input())):
    a = list(range(1, int(input()) + 1))
    print(' '.join(map(str, [a[-1]] + a[:-1])))

C++ Code: 

#include <bits/stdc++.h>

using namespace std;

int main()
{
    long long a,b,c=0,h,d,e,f=0,sum=0,j,cnt=0,flag=0,k=0,in1,in2,p1,p2,g,w,m=0,n;
    vector<int>v;
    stringstream a1,b1;
    cin>>n;
    while(n--)
    {
         cin>>a;
         if(a%2!=0)
         {
             c=(a/2)+1;
         }
      for(int i=a;i>=1;i--)
      {
          if(i==c)
          {
              m=i;
              continue;
          }
          else
          {
               cout<<i<<" ";
          }
          if(i==1)
          {
              if(m)
              {
                  cout<<m;
              }
          }

      }
      cout<<endl;
      c=0;
      m=0;
    }



}


Comments

Submit
0 Comments
More Questions

1582C - Grandma Capa Knits a Scarf
492A - Vanya and Cubes
217A - Ice Skating
270A - Fancy Fence
181A - Series of Crimes
1638A - Reverse
1654C - Alice and the Cake
369A - Valera and Plates
1626A - Equidistant Letters
977D - Divide by three multiply by two
1654B - Prefix Removals
1654A - Maximum Cake Tastiness
1649A - Game
139A - Petr and Book
1612A - Distance
520A - Pangram
124A - The number of positions
1041A - Heist
901A - Hashing Trees
1283A - Minutes Before the New Year
1654D - Potion Brewing Class
1107B - Digital root
25A - IQ test
785A - Anton and Polyhedrons
1542B - Plus and Multiply
306A - Candies
1651C - Fault-tolerant Network
870A - Search for Pretty Integers
1174A - Ehab Fails to Be Thanos
1169A - Circle Metro