18女生赛 - HDU - 6297（模拟）+ HDU - 6292 （水题）

HDU - 6297

代码：

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int t;
	int n , num ;
	char a[100] , b[100];
	scanf("%d" , &t);
	while(t--)
	{
		scanf("%d%s%d%s" , &n , &a , &num , &b);
		int op;
		string str;
		int len = strlen(a);
		if(b[0] == 'R' && b[1] =='u') 
		{
			scanf("%d" , &op);
			char h = 'X';
			printf("%3d|" , n);
			for(int i = 0 ; i < 16 ; i++)
			{
				if(i < len)
				{
					printf("%c" , a[i]);
				}
				else
				{
					printf(" ");
				}
			}
			printf("|%d|[" , num );
			for(int i = 0 ; i < 10 ; i++)
			{
				if(i < op)
				printf("%c" , h);
				else
				printf(" ");
			}
			printf("]\n");
		}
		else if(b[0] == 'F')
		{
			str = "AC*";
			printf("%3d|" , n);
			for(int i = 0 ; i < 16 ; i++)
			{
				if(i < len)
				{
					printf("%c" , a[i]);
				}
				else
				{
					printf(" ");
				}
			}
			printf("|%d|[    " , num);
			cout << str;
			printf("   ]\n");
		}
		else 
		{
			printf("%3d|" , n); 
			for(int i = 0 ; i < 16 ; i++)
			{
				if(i < len)
				{
					printf("%c" , a[i]);
				}
				else
				{
					printf(" ");
				}
			}
			printf("|%d|[    " , num);
			int p = strlen(b);
			for(int i = 0 ; i < 6 ; i++)
			{
				if(i < p)
				printf("%c" , b[i]);
				else
				{
					printf(" ");
				}
			}
			    
			printf("]\n" , num );
		}
		
		
	}
	return 0;
 } 
 /*
 5
19 qqqqq_University 1001 Running 7
125 quailty_U_2 1002 WA
4 quailty_U_3 1003 TLE
1 quailty_U_4 1003 FB
2 qqqqq 1001 AC
 */

HDU - 6292 

代码：

#include <bits/stdc++.h>
using namespace std;
int a[600] , b[600];
int main()
{
	int t , n , m;
	scanf("%d" , &t);
	for(int num = 1 ; num <= t ; num++)
	{
		int minn = 999999 , minn1 = 999999;
		scanf("%d %d" , &n , &m);
		for(int i = 1 ; i <= n ; i++)
		{
			scanf("%d" , &a[i]);
			minn = min(minn , a[i]);
		}
		for(int i = 1 ; i <= m ; i++)
		{
			scanf("%d" , &b[i]);
			minn1 = min(minn1 , b[i]);
		}
		printf("Problem %d:\n" , num+1000);
		printf("Shortest judge solution: %d bytes.\n" , minn);
		if(minn1 == 999999)
		{
			printf("Shortest team solution: N/A bytes.\n");
		}
		else
		{
			printf("Shortest team solution: %d bytes.\n" , minn1);
		}
		
	}
	return 0;
 }