题目链接
思路:
倒序输出n-1即可。
代码:
#include<bits/stdc++.h>
#define int long long
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int N=1e5+3;
const int M=2e4+5;
const double eps=1e-8;
const int mod=998244353;
const int inf=0x7fffffff;
const double pi=3.1415926;
using namespace std;
int quick(int a,int n)
{
if(n==0)
{
return 1;
}
int x=quick(a,n/2),ans=x*x%mod;
if(n%2==1)
{
ans=ans*a%mod;
}
return ans;
}
signed main()
{
IOS;
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
for(int i=n;i>=1;i--)
{
cout<<i<<" ";
}
cout<<endl;
}
return 0;
}