这几天一直都在忙着这东西,花了不少时间终于搞定了,感想和收获很多。下面拿来给大家分享一下!总共5个题,其中的C题让我调试了很长时间!
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 2513 | Accepted: 840 |
Description
Input
Output
Sample Input
12345678,0,3
Sample Output
1234567c
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 1254 | Accepted: 806 |
Description
密码字母:A B C D E F G H I J K L M N O P Q R S T U V W X Y Z M
原文字母:V W X Y Z A B C D E F G H I J K L M N O P Q R S T U
注意:只有字母会发生替换,其他非字母的字符不变,并且消息原文的所有字母都是大写的。
Input
- 起始行:START
- 密码消息:由1到200个字符组成一行,表示凯撒发出的一条消息.
- 结束行:END
在最后一个数据集之后,是另一行:ENDOFINPUT
Output
Sample Input
START NS BFW, JAJSYX TK NRUTWYFSHJ FWJ YMJ WJXZQY TK YWNANFQ HFZXJX END START N BTZQI WFYMJW GJ KNWXY NS F QNYYQJ NGJWNFS ANQQFLJ YMFS XJHTSI NS WTRJ END START IFSLJW PSTBX KZQQ BJQQ YMFY HFJXFW NX RTWJ IFSLJWTZX YMFS MJ END ENDOFINPUT
Sample Output
IN WAR, EVENTS OF IMPORTANCE ARE THE RESULT OF TRIVIAL CAUSES I WOULD RATHER BE FIRST IN A LITTLE IBERIAN VILLAGE THAN SECOND IN ROME DANGER KNOWS FULL WELL THAT CAESAR IS MORE DANGEROUS THAN HE
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 1641 | Accepted: 722 |
Description
Input
接下来每行输入一个小孩的名字(人名不超过15个字符)
最后一行输入W,S (W < N),用逗号","间隔
Output
Sample Input
5 Xiaoming Xiaohua Xiaowang Zhangsan Lisi 2,3
Sample Output
Zhangsan Xiaohua Xiaoming Xiaowang Lisi
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 1387 | Accepted: 694 |
Description
对于给定的采用”yyyy/mm/dd”加24小时制(用短横线”-”连接)来表示日期和时间的字符串,请编程实现将其转换成”mm/dd/yyyy”加12小时制格式的字符串。
Input
接下来的总共T行,每行都是一个需要转换的时间日期字符串。
Output
Sample Input
2
2009/11/07-12:12:12
1970/01/01-00:01:01
Sample Output
11/07/2009-12:12:12pm
01/01/1970-12:01:01am
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 1861 | Accepted: 659 |
Description
A B C D E F G H
V W X Y Z A B I
U J K L M N C J
T I H G F E D K
S R Q P O N M L
Input
Output
Sample Input
4 9
Sample Output
A B C D E F G H I V W X Y Z A B C J U J I H G F E D K T S R Q P O N M L
下面是我这几天的劳动成果,顺便也给大家分享一下!
题A:
#include <stdio.h>
long r;
void main()
{
int x,y;
scanf("%x,%d,%d",&r,&x,&y);
r&=~(1<<x);
r|=3<<(y-1);
r&=~(1<<(y-2));
printf("%x/n",r);
}
题B:
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define uchar unsigned char
struct data
{
char a[10];
char b[200];
char c[3];
};
void main()
{
uchar i,j,t;
struct data p[100];
for(i=0;i<100;i++)
{
gets(p[i].a);
if(strlen(p[i].a)==10)
break;
gets(p[i].b);
gets(p[i].c);
t++;
}
for(i=0;i<t;i++)
for(j=0;j<200;j++)
{
if(p[i].b[j]>='F'&&p[i].b[j]<='Z')
p[i].b[j]-=5;
else if(p[i].b[j]>='A'&&p[i].b[j]<='E')
p[i].b[j]+=21;
}
for(i=0;i<t;i++)
puts(p[i].b);
}
题C:
#include<stdio.h>
#include<string.h>
void main()
{
unsigned int n,w,s,i,x,flag;
char a[64][15];
scanf("%u",&n);
for(i=0;i<n;i++)
scanf("%s",a[i]);
scanf("%u,%u",&w,&s);
printf("%s/n",a[w+s-2]);
x=w+s-2;
n--;
while(n)
{
for(i=x;i<n;i++)
{
if(flag==1) break;
else strcpy(a[i],a[i+1]);
}
if(n-x<s)
{
if(n-x==0){ if(n==1)printf("%s/n",a[0]);
else {printf("%s/n",a[x+s%n-n-1]);x+=s%n-n-1;flag=0;}
}
else { printf("%s/n",a[x+s-n-1]);x+=s-n-1;flag=0;}
}
else if(n-x==s)
{ printf("%s/n",a[x+s-1]);x+=s-n;flag=1;}
else
{ printf("%s/n",a[x+s-1]);x+=s-1;flag=0;}
n--;
}
}
题D:
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
void main()
{
int nian[10],yue[10],ri[10],shi[10],fen[10],miao[10];
int i,t;
char a[10];
scanf("%d",&t);
for(i=0;i<t;i++)
{
scanf("%d/%d/%d-%d:%d:%d",&nian[i],&yue[i],&ri[i],&shi[i],&fen[i],&miao[i]);
if(shi[i]==0)
{ shi[i]=12;a[i]='a';}
else if(shi[i]==12)
a[i]='p';
else if(shi[i]>12)
{ shi[i]-=12;a[i]='p';}
else a[i]='a';
}
for(i=0;i<t;i++)
{
printf("%02d/%02d/%d-%02d:%02d:%02d%cm/n",yue[i],ri[i],nian[i],shi[i],fen[i],miao[i],a[i]);
}
}
题E:
#include<stdio.h>
#include<stdlib.h>
void main()
{
int i,j,M,N,x1,y1,x2,y2;
char **a=NULL;
scanf("%d%d",&M,&N);
a=(char **)malloc(M*sizeof(char *));
for(i=0;i<M;i++)
a[i]=(char *)malloc(N*sizeof(char));
x2=M/2,y2=N/2;
x1=M,y1=N;
while(1)
{ for(i=M-x1,j=N-y1;j<y1-1;j++)
{
if(i==0&&j==0)
a[i][j]='A';
else
{
if(a[i][j-1]=='Z')
a[i][j]='A';
else a[i][j]=a[i][j-1]+1;
}
a[i][j+1]=a[i][j]+1;
}
for(i=M-x1,j=y1-1;i<x1-1;i++)
{
if(a[i][j]=='Z')
a[i+1][j]='A';
else a[i+1][j]=a[i][j]+1;
}
if(i==M-x1)break;
for(i=x1-1,j=y1-1;j>N-y1;j--)
{
if(a[i][j]=='Z')
a[i][j-1]='A';
else a[i][j-1]=a[i][j]+1;
}
for(i=x1-1,j=N-y1;i>M+1-x1;i--)
{
if(a[i][j]=='Z')
a[i-1][j]='A';
else a[i-1][j]=a[i][j]+1;
}
x1--;y1--;
if(x1==x2||y1==y2)break;
}
for(i=0;i<M;i++)
{
for(j=0;j<N;j++)
{
printf(" %c",a[i][j]);
}
printf("/n");
}
for(i=0;i<M;i++)
{ free(a[i]);a[i]=NULL; }
free(a);
a = NULL;
}