Uva - 1588 - Kickdown
2017-05-06 16:24
288 查看
Wrong Anwser:
Acceped:
#include<stdio.h>
#include<string.h>
#define MAX_LEN 233
int main () {
int i,j,lm,lp,min1,min2,slocation;
char tbottom[MAX_LEN],ttop[MAX_LEN],temp[MAX_LEN];
while( scanf("%s%s",tbottom,ttop) != EOF ) {
lp=strlen(ttop);
lm=strlen(tbottom);
if(lp>lm) {
strcpy(temp,ttop);
strcpy(ttop,tbottom);
strcpy(tbottom,temp);
i=lp;
lp=lm;
lm=i;
}
for(i=0,j=0,slocation=0; i<lp;) {
if((ttop[i]+tbottom[j]-'0'-'0')>3) {
i=0;
slocation++;
j=slocation;
tbottom[lm+slocation-1]='0';
continue;
} else {
i++;
j++;
}
}
min1=((slocation+lp)<lm?lm:(slocation+lp));
for(i=0; i<(lm-lp); i++) {
ttop[lp+i]='0';
}
for(i=0,j=0,slocation=0; i<lp;) {
if((ttop[j]+tbottom[i]-'0'-'0')>3) {
i=0;
slocation++;
j=slocation;
ttop[lm+slocation-1]='0';
ttop[lm+slocation]='\0';
continue;
} else {
i++;
j++;
}
}
min2=(slocation+lm);
printf("%d\n",(min1>min2?min2:min1));
}
return 0;
}
#include<stdio.h> #include<string.h> #define MAX_LEN 233 int main () { int i,j,lm,lp,min1,min2,slocation; char tbottom[MAX_LEN],ttop[MAX_LEN],temp[MAX_LEN]; while( scanf("%s",tbottom) != EOF ) { scanf("%s",ttop); lp=strlen(ttop); lm=strlen(tbottom); for(i=0,j=0,slocation=0; i<lp;) { if((ttop[i]+tbottom[j]-'0'-'0')>3) { i=0; slocation++; j=slocation; tbottom[lm+slocation-1]='0'; tbottom[lm+slocation]='\0'; continue; } else { i++; j++; } } min1=((slocation+lp)<lm?lm:(slocation+lp)); strcpy(temp,ttop); strcpy(ttop,tbottom); strcpy(tbottom,temp); for(i=0;i<lm-lp;i++) { ttop[lp+i]='0'; } ttop[lm]='\0'; for(i=0,j=0,slocation=0; i<lp;) { if((ttop[i]+tbottom[j]-'0'-'0')>3) { i=0; slocation++; j=slocation; ttop[lm+slocation-1]='0'; ttop[lm+slocation]='\0'; continue; } else { i++; j++; } } min2=(slocation+lm); printf("%d\n",(min1>min2?min2:min1)); } return 0; }
Acceped:
#include<stdio.h>
#include<string.h>
#define MAX_LEN 233
int main () {
int i,j,lm,lp,min1,min2,slocation;
char tbottom[MAX_LEN],ttop[MAX_LEN],temp[MAX_LEN];
while( scanf("%s%s",tbottom,ttop) != EOF ) {
lp=strlen(ttop);
lm=strlen(tbottom);
if(lp>lm) {
strcpy(temp,ttop);
strcpy(ttop,tbottom);
strcpy(tbottom,temp);
i=lp;
lp=lm;
lm=i;
}
for(i=0,j=0,slocation=0; i<lp;) {
if((ttop[i]+tbottom[j]-'0'-'0')>3) {
i=0;
slocation++;
j=slocation;
tbottom[lm+slocation-1]='0';
continue;
} else {
i++;
j++;
}
}
min1=((slocation+lp)<lm?lm:(slocation+lp));
for(i=0; i<(lm-lp); i++) {
ttop[lp+i]='0';
}
for(i=0,j=0,slocation=0; i<lp;) {
if((ttop[j]+tbottom[i]-'0'-'0')>3) {
i=0;
slocation++;
j=slocation;
ttop[lm+slocation-1]='0';
ttop[lm+slocation]='\0';
continue;
} else {
i++;
j++;
}
}
min2=(slocation+lm);
printf("%d\n",(min1>min2?min2:min1));
}
return 0;
}
相关文章推荐
- UVa 1588:Kickdown
- Uva 1588 Kickdown
- UVa-1588 Kickdown
- UVA - 1588 Kickdown
- UVA-1588-Kickdown:简单字符串匹配
- UVa 1588 - Kickdown
- UVA1588 - Kickdown
- Uva - 1588 - Kickdown
- UVa-1588 Kickdown
- UVa 1588 - Kickdown(BUG)
- 算法竞赛入门经典(紫书)第三章——Kickdown UVA-1588
- UVa 1588 - Kickdown
- Problem 021 —— UVa 1588 - Kickdown
- Kickdown, ACM/ICPC NEERC 2006, UVa 1588
- UVA 1588 - Kickdown
- UVA - 1588 Kickdown
- Uva 1588 - Kickdown
- 3-11 uva 1588 - Kickdown
- UVA - 1588 Kickdown
- UVA 1588 Kickdown & ACM/ICPC NEERC 2006 解题报告