tjut 5916

来源：互联网发布：php招聘系统编辑：程序博客网时间：2024/06/15 09:33
#include<iostream>  #include<algorithm>  #include<string>  #include<iomanip>  #include<map>  #include<stack>  #include<queue>  #include<set>  #include<bitset>  #include<memory.h>  #include<time.h>  #include<stdio.h>  #include<stdlib.h>  #include<string.h>  //#include<stdbool.h>  #include<math.h>  #define min(a,b) ((a)<(b)?(a):(b))  #define max(a,b) ((a)>(b)?(a):(b))  #define abs(a) ((a)>0?(a):(-(a)))  #define lowbit(a) (a&(-a))  #define sqr(a) ((a)*(a))  #define swap(a,b) ((a)^=(b),(b)^=(a),(a)^=(b))  #define mem(a,b) memset(a,b,sizeof(a))  #define eps (1e-10)  #define J 10000  #define mod 1000000007  #define MAX 0x7f7f7f7f  #define PI 3.14159265358979323  #pragma comment(linker,"/STACK:1024000000,1024000000")  #define N 104  using namespace std;  typedef long long LL;  double anss;  LL aans,sum;  int cas,cass;  int n,m,lll,ans;  int main()  {        int i,j,k;      for(scanf("%d",&cas),cass=1;cass<=cas;cass++)      {          scanf("%d%d",&n,&m);          printf("Case #%d: ",cass);          printf("%d %d",m+m,m);          for(i=m-1;i;i--)printf(" %d",i);          for(i=m+1;i<=n;i++)              if(i!=m+m)printf(" %d",i);          puts("");      }      return 0;  }
0 0