OJ Board

My source code.
I was solve this problem with Dynamic Algorithm

#include<stdio.h>
#include<string.h>
void main(){
char a[1001];
char b[1001];
int tb[1001][1001]={0,};
int alen, blen;
int i, j;
char dap[101]={0,};
int cnt;
int t=1;
while(1){
gets(a);
if(a[0] == '#')
break;
gets(b ...

Output...
If minute of the longest nap start time is 0
You must print 00
No 0


p.s

I'm Korean Middle School Student..
I can't English very well.
sorry,