#include<stdio.h>constint N =54;char mp[5]={'S','H','C','D','J'};int start[N+1],end[N+1],next[N+1];intmain(){int k;scanf("%d",&k);for(int i =1;i<=N;i++)
start[i]= i;for(int i =1;i<=N;i++)scanf("%d",&next[i]);for(int step =0;step<k;step++){for(int i =1;i<=N;i++)
end[next[i]]= start[i];for(int i =1;i<=N;i++)
start[i]= end[i];}for(int i =1;i<=N;i++){if(i !=1)printf(" ");
start[i]--;printf("%c%d",mp[start[i]/13],start[i]%13+1);}return0;}
5.A1046
#include<stdio.h>#include<algorithm>usingnamespace std;constint MAXN =100005;int dis[MAXN],A[MAXN];intmain(){int sum =0,query,n,left,right;scanf("%d",&n);for(int i =1;i<=n;i++){scanf("%d",&A[i]);
sum += A[i];
dis[i]= sum;}scanf("%d",&query);for(int i =1;i<=query;i++){scanf("%d%d",&left,&right);if(left>right)swap(left,right);int temp = dis[right-1]- dis[left-1];printf("%d\n",min(temp,sum - temp));}//printf("%d",dis[0]);return0;}
6.A1065
#include<stdio.h>intmain(){int n,tcase =1;scanf("%d",&n);while(n--){longlong a,b,c;scanf("%lld%lld%lld",&a,&b,&c);longlong res = a + b;bool flag;if(a<0&&b<0&&res>=0) flag =false;elseif(a>0&&b>0&&res<0) flag =true;elseif(res>c) flag =true;else flag =false;if(flag==true)printf("Case #%d: true\n",tcase++);elseprintf("Case #%d: false\n",tcase++);}return0;}