Educational Codeforces Round 123 (Rated for Div. 2) 1644B Anti-Fibonacci Permutation Solution


Problem Link: https://codeforces.com/contest/1644/problem/B
 

Solve in C++:

///La ilaha illellahu muhammadur rasulullah
///******Bismillahir-Rahmanir-Rahim******///
///Abul Hasnat  Tonmoy
///Department of CSE,23rd batch
///Islamic University,Bangladesh
#include<bits/stdc++.h>
using namespace std;
int  main()
{
    long long t,n,i,j;
    cin>>t;
    while(t--)
    {
        cin>>n;
        for(i=1; i<=n; i++)
        {
            cout<<i<<" ";
            for(j=n; j>=1; j--)
            {
                if(i!=j)
                    cout<<j<<" ";
            }
            cout<<endl;
        }
    }
    return 0;
}

No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.