content
stringlengths 19
11k
|
|---|
#include<stdio.h>
int main()
{
int a,i,count=0,j=0;
scanf("%d",&a);
int A[a],B[a];
for(i=0;i<a;i++)
scanf("%d",&A[i]);
for(i=0;i<a-1;i++)
{
if(A[i]>=A[i+1])
{
count++;
B[j]=A[i];
j++;
}
}
B[j]=A[a-1];
count++;
if(count)
{
printf("%d\n",count);
for(i=0;i<j+1;i++)
printf("%d ",B[i]);
}
else
{
printf("1\n");
printf("%d",A[a-1]);
}
return 0;
}
|
#include<stdio.h>
int main ()
{
int N, X[1000], Y[1000], j=0, i, k, Count=0, Max=-1;
scanf("%d", &N);
for(i=0; i<N; i++)
{
scanf("%d", &X[i]);
{
if(X[i]==1)
{
Count++;
}
}
if(X[i]>Max)
{
Max=X[i];
}
else
{
Y[j]=Max;
Max=X[i];
j++;
}
}
k=i-1;
printf("%d\n", Count);
for(i=0; i<j; i++)
{
printf("%d ", Y[i]);
}
printf("%d", X[k]);
return 0;
}
|
#include<stdio.h>
int main()
{
int a,b,n[1005],t[1005],i,k=1,j=1,c=1,o=0,l,m=1;
scanf("%d",&a);
for(i=1;i<=a;i++)
{
scanf("%d",&n[i]);
}
for(i=2;i<=a;i++)
{
k++;
if(n[i]==1)
{
if(c>1){
t[j++]=k;}
else
t[j++]=k-1;
k=0;
c=c+1;
o=1;
}
}
if(o==1){
t[j++]=k+1;
printf("%d\n",c);
for(l=1;l<j;l++)
{
printf("%d ",t[l]);
}}
else{
printf("%d\n",m);
printf("%d",a);}
}
|
#include <stdio.h>
#include <stdlib.h>
//CODED BY SAYEM MD. NAFI
int main()
{
int N, I, *STEPS, STAIRWAY = 0, COUNT = 1;
scanf("%d", &N);
STEPS = (int *) malloc (sizeof(int) * N + 1);
for(I = 0; I < N; I++) {
scanf("%d", &STEPS[I]);
if(STEPS[I] == 1) STAIRWAY++;
}
printf("%d\n", STAIRWAY);
for(I = 1; I < N; I++) {
if(STEPS[I] == 1) {
printf("%d ", COUNT);
COUNT = 1;
}
else COUNT++;
}
printf("%d\n", COUNT);
return 0;
}
|
#include<stdio.h>
#include<string.h>
int nump,numo,v;
long int tstwc=0;
int p=0,num,v=-1,vp,vo,vi,idx=0,loop=0;
int size(long int jkl[]){
int cp=0;
for(int vu=0;jkl[vu]!='\0';vu++){
cp++;
}
return cp;
}
int main(){
scanf("%d",&num);
long int entnum[num+1],spst[num+1];
for(vp=0;vp<num;vp++){
scanf("%li",&entnum[vp]);
}
entnum[vp]=-1;
for(vo=0;vo<num;vo++){
if(entnum[vo+1]==entnum[0]){
tstwc++;
spst[idx++]= entnum[vo] ;
}}
spst[idx++]= entnum[vo-1] ;
if(entnum[0]==1)tstwc+=1;
printf("%li\n",tstwc);
for(vi=0;vi<idx;vi++){
printf("%li\n",spst[vi]);
}
}
|
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <stdbool.h>
int N;
int main()
{
scanf("%i", &N);
int stairs[N + 100];
for(int i = 0; i < N; i++)
{
scanf("%i", &stairs[i]);
}
int index = 0, ans[N + 100];
for(int i = 0; i < N - 1; i++)
{
if(stairs[i] == 1 && stairs[i + 1] == 1)
{
ans[index++] = stairs[i];
}
else if(stairs[i + 1] == 1)
{
ans[index++] = stairs[i];
}
}
ans[index++] = stairs[N - 1];
printf("%i\n", index);
for(int i = 0; i < index; i++)
{
printf("%i ", ans[i]);
}
}
|
#include <stdio.h>
int main(void)
{
unsigned short steps;
scanf("%hu", &steps);
unsigned short stairways[steps];
for (unsigned short i = 0; i < steps; ++i)
stairways[i] = 0;
unsigned short stairway_counter = 0;
for (unsigned short i = 0; i < steps; ++i)
{
unsigned short curr_step;
scanf("%hu", &curr_step);
if (curr_step == 1)
++stairway_counter;
++stairways[stairway_counter - 1];
}
printf("%hu\n", stairway_counter);
for (unsigned short i = 0; i < stairway_counter; ++i)
printf("%hu ", stairways[i]);
return 0;
}
|
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>
int main()
{
int i,j=0,k,m,n,count,val,previous,arry[1005];
scanf("%d",&n);
for(i=0,count=0;i<n;i++)
{
scanf("%d",&val);
val==1?count++:count;
if(val==1)
arry[j++]=previous;
previous=val;
}
if(count==1) printf("1\n%d\n",previous);
else{
printf("%d\n%d",count,arry[1]);
for(i=2;i<count;i++) //the first array value will be garbage not for print
{
printf(" %d",arry[i]);
}
printf(" %d\n",previous);
}
return 0;
}
|
#include<stdio.h>
int main()
{
int n,arr[1000],i,count=0,out_arr[1000],j=0;
scanf(" %d", &n);
for(i=0; i<n; i++)
{
scanf(" %d", &arr[i]);
}
if(n>1)
{
for(i=0,j=0; i<n-1; i++)
{
if(arr[i]>=arr[i+1])
{
count++;
out_arr[j]=arr[i];
j++;
}
if(i+1==n-1)
{
count++;
out_arr[j]=arr[i+1];
j++;
}
}
}
else
{
count=1;
out_arr[0]=arr[0];
}
printf("%d\n", count);
for(i=0; i<count; i++)
{
printf("%d ", out_arr[i]);
}
}
|
#include <stdlib.h>
#include <stdio.h>
int main(void){
int stepsAmount = 0;
fscanf(stdin, "%i", &stepsAmount);
int * ladders = NULL;
int laddersAmount = 0;
for(int i = 0; i < stepsAmount; i++){
int tmp = 0;
fscanf(stdin, "%i", &tmp);
if(tmp == 1){
laddersAmount++;
ladders = realloc(ladders, sizeof(int) * laddersAmount);
ladders[laddersAmount - 1] = 1;
} else {
ladders[laddersAmount - 1]++;
};
};
fprintf(stdout, "%d \n", laddersAmount);
for(int i = 0; i < laddersAmount; i++){
fprintf(stdout, "%d ", ladders[i]);
};
fprintf(stdout, "\n");
return 0;
};
|
#include <stdio.h>
#include <stdlib.h>
int main()
{
int n=0 ,i ,p=0 , j ,pos=1;
scanf("%d" ,&n);
int a[n] ,b[n] ;
for (i=0 ;i<n ;i++)
{
scanf("%d" ,&a[i]);
if (a[i]==1) p++ ;
}
for (j=0 ;j<p ;j++)
{
// printf("j= %d \n" ,j);
for (i=pos ;i<n ;i++)
{
// printf("i= %d \n" ,i);
if (a[i]==1)
{
b[j]=a[i-1] ;
pos=i+1;
// printf("bj = %d \n " ,b[j]) ;
break ;
}
}
}
b[p-1]=a[n-1];
printf("%d \n " ,p);
for (j=0 ;j<p ;j++)
{
printf("%d " ,b[j]);
}
return 0;
}
|
// 1005A
#include <stdio.h>
#include <stdlib.h>
#define BASE "%d"
typedef int Base;
int main()
{
Base PrevStep = 0;
Base CurrentStep = 0;
Base StairwaysCount = 0;
Base StepsCount = 0;
Base *Stairways = malloc(0);
scanf(BASE, &StepsCount);
for (Base i = 0; i < StepsCount; i++)
{
PrevStep = CurrentStep;
scanf(BASE, &CurrentStep);
if ((CurrentStep - PrevStep) != 1)
{
StairwaysCount++;
Stairways = (Base *)realloc(Stairways, sizeof(Base) * StairwaysCount);
Stairways[StairwaysCount - 1] = PrevStep;
}
}
printf(BASE"\n", StairwaysCount + 1);
for (Base i = 0; i < StairwaysCount; i++)
{
printf(BASE" ", Stairways[i]);
}
printf(BASE"\n", CurrentStep);
return 0;
}
|
/* Problem: 1005A - Tanya and Stairways */
/* Author: Gusztav Szmolik */
#include <stdio.h>
int main ()
{
unsigned short n;
unsigned short nDec;
unsigned short t;
unsigned short aPrev;
unsigned short i;
unsigned short a;
unsigned short stepCount[1000];
unsigned short tDec;
if (scanf("%hu",&n) != 1)
return -1;
if (n < 1 || n > 1000)
return -1;
nDec = n-1;
t = 0;
aPrev = 0;
for (i = 0; i < n; i++)
{
if (scanf("%hu",&a) != 1)
return -1;
if (a < 1 || a > 1000)
return -1;
if (a > 1 && (!aPrev || aPrev != a-1))
return -1;
if (a == 1 && aPrev)
{
stepCount[t] = aPrev;
t++;
}
aPrev = a;
}
stepCount[t++] = a;
printf ("%hu\n",t);
tDec = t-1;
for (i = 0; i < t; i++)
{
printf ("%hu",stepCount[i]);
putchar (i == tDec ? '\n' : ' ');
}
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
int main() {
int i = 0, j = 0, totalNbrsSpoken = 0, totalStairsClimbed = 0;
scanf("%d", &totalNbrsSpoken);
int *nbrs = (int *)calloc(totalNbrsSpoken, sizeof(int));
for (i = 0; i < totalNbrsSpoken; i++)
{
scanf("%d", &(*(nbrs + i)));
if (*(nbrs + i) == 1)
{
totalStairsClimbed += 1;
}
}
printf("%d\n", totalStairsClimbed);
//int index = 0, *stepsEachClimb = (int *)(totalStairsClimbed, sizeof(int));
int count_steps = 0;
for (i = 0; i < totalNbrsSpoken; i = j)
{
if (*(nbrs + i) == 1)
{
count_steps = 1;
for (j = i + 1; j < totalNbrsSpoken; j++)
{
if(*(nbrs + j) == 1)
{
break;
}
else
{
count_steps += 1;
}
}
/*
*(stepsEachClimb + index) = count_steps;
index++;
*/
printf("%d ", count_steps);
}
}
free(nbrs);
return 0;
}
// End of main
|
z=200001,n,N;main(){char s[z],S[z];for(n=strlen(gets(s)),N=strlen(gets(S));--n>=0&--N>=0&&s[n]==S[N];);printf("%d",n+N+2);}
|
#include<stdio.h>
#include<string.h>
int main()
{
char s[200001],t[200001];
scanf("%s %s",s,t);
int i=0,j=0;
for(i=strlen(s)-1,j=strlen(t)-1;i>=0&&j>=0&&s[i]==t[j];i--,j--)
{
}
printf("%d",i+j+2);
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main()
{
char x[200001],y[200001];
gets(x); gets(y);
int a=strlen(x),b=strlen(y),i;
for(i=1;i<=a&&i<=b;i++) if(x[a-i]!=y[b-i]) break;
printf("%d",a+b-2*(i-1));
}
|
#include<stdio.h>
#include<string.h>
char s[200005],t[200005];
int main()
{
scanf("%s %s", s, t);
int l=strlen(s),r=strlen(t);
int i;
for(i=0;i<l && i<r;i++) if(s[l-1-i]!=t[r-1-i]) break;
printf("%d", l+r-2*i);
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main()
{
char s1[200002],s2[200002];
scanf("%s%s",s1,s2);
int i,j;
for( i=strlen(s1)-1,j=strlen(s2)-1;((i>=0)&&(j>=0)); i--,j--)
{
if(s1[i]!=s2[j])
{
break;
}
}
printf("%d\n",i+j+2);
}
|
#include<stdio.h>
#include<string.h>
char a[200005],b[200005];
int A,B,M,C,i;
int main()
{
scanf("%s %s",a,b);
A=strlen(a);
B=strlen(b);
M=A<B?A:B;
for(i=1;i<=M;i++)
{
if(a[A-i]!=b[B-i])
{
break;
}
}
i--;
printf("%d",A+B-i-i);
return 0;
}
|
#include <stdio.h>
#include <string.h>
main()
{
char s1[200001],s2[200001];
int l1,l2,i,j,res;
scanf("%s%s",s1,s2);
l1=strlen(s1);
l2=strlen(s2);
res=l1+l2;
for(i=l1-1,j=l2-1;i>=0 && j>=0;i--,j--)
if(s1[i]==s2[j])res-=2;
else break;
printf("%d",res);
}
|
#include<stdio.h>
#include<string.h>
int main()
{char a[300000],t[300000];
while(scanf("%s",&a)!=EOF)
{scanf("%s",t);
int b1=strlen(a),b2=strlen(t),d=0;
while(a[b1-d-1]==t[b2-d-1]&&b1-d-1>=0&&b2-d-1>=0)
{d++;
}
int c=b1+b2-2*d;
printf("%d\n",c);
}return 0;
}
|
#include<stdio.h>
#include<string.h>
int main()
{
int i,j,l,l1,result;
char s[200001],t[200001];
scanf("%s%s",&s,&t);
l = strlen(s);
l1 = strlen(t);
for(i=l-1,j=l1-1;l>=0,l1>=0&&s[l]==t[l1];l--,l1--)
result = l+l1;
printf("%d",result);
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main()
{
char s[200001],t[200001];
scanf("%s %s",s,t);
int i=strlen(s)-1,j=strlen(t)-1;
while (s[i]==t[j]&&i>=0&&j>=0)
{
i--,j--;
}
printf("%d",i+j+2);
return 0;
}
|
#include<stdio.h>
int main()
{
char s1[200001],s2[200001];
scanf("%s%s",s1,s2);
int n1,n2,p=0,i,j;
n1=strlen(s1);
n2=strlen(s2);
for(i=n1-1,j=n2-1;(s1[i]==s2[j] && i>=0 &&j>=0);i--,j--)
p++;
printf("%d\n",(n1-p)+(n2-p));
return 0;
}
|
#include<stdio.h>
int main()
{
char a[300000],b[300000];
scanf("%s %s",a,b);
int i=0,j=0,s,c=0,n[27]={0};
while(a[i]!='\0')
{
i++;
}
i--;
while(b[j]!='\0')
{
j++;
}
j--;
while(a[i]==b[j] && i!=-1 && j!=-1)
{
i--;
j--;
}
printf("%d\n",i+j+2);
}
|
#include <stdio.h>
#include <string.h>
char a1[200005];
char a2[200005];
int main()
{ int a,b,n=0,i,c,d=0;
gets(a1); a=strlen(a1);
gets(a2); b=strlen(a2);
while(a1[a-1-d]==a2[b-1-d])
{ if(a-1-d<0||b-1-d<0) break;
n=n+2; d++;
}
printf("%d\n",a+b-n);
return 0;
}
|
#include <stdio.h>
#include <string.h>
char s[200003], t[200003];
int sl, tl;
int main() {
scanf("%s %s", s, t);
for (sl=strlen(s), tl=strlen(t); sl>=0 && tl>=0 && s[sl-1]==t[tl-1]; sl--, tl--);
sl = sl>0 ? sl : 0;
tl = tl>0 ? tl : 0;
printf("%d\n", sl+tl);
return 0;
}
|
#include<stdio.h>
#include<string.h>
char s[200005],t[200005];
int main()
{
scanf("%s %s", s, t);
int los=strlen(s),lot=strlen(t);
int i;
for(i=0;i<los && i<lot;i++) {
if(s[los-1-i]!=t[lot-1-i]) break;
}
printf("%d\n", los+lot-2*i);
return 0;}
|
#include<stdio.h>
#include<string.h>
int main()
{
char s1[200002],s2[200002];
scanf("%s%s",&s1,&s2);
int l1,l2,i,j,k;
l1=strlen(s1);
l2=strlen(s2);
k=0;
j=l2-1;
for(i=l1-1;i>=0;i--)
{
if(s1[i]==s2[j])
k++;
if(s1[i]!=s2[j])
break;
j--;
}
printf("%d",l1+l2-k-k);
}
|
#include<stdio.h>
#include<string.h>
main()
{ int l1,l2,k,q;
char s1[200005],s2[200005];
scanf("%s%s",s1,s2);
l1=strlen(s1);
l2=strlen(s2);
if(strcmp(s1,s2)==0) printf("0"); else {
k=1; q=0;
while(q!=1) {
if(s1[l1-k]==s2[l2-k]) k++; else q=1;
}
printf("%d",l1-k+l2-k+2);
}}
|
#include <stdio.h>
int main()
{
int s1,t1,m,p,k,l=0,j,i;
char s[200001],t[200001];
scanf("%s%s",s,t);
s1=strlen(s);
t1=strlen(t);
for(i=s1-1,j=t1-1; (s[i]==t[j])&&i>=0&&j>=0;i--,j--)
{
l++;
}
printf("%d\n",s1-l+t1-l);
return 0;
}
|
#include <stdio.h>
#include <string.h>
int main(){
char s[200001],t[200001];
scanf("%s""%s",s,t);
int p,n;
for(p=strlen(s),n=strlen(t);p>=0&&n>=0;p=p-1,n=n-1){
if(s[p]!=t[n]){
break;
}
}
printf("%d",p+n+2);
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main()
{
char a[200001],b[200001];
long long i,j,l1,l2;
scanf("%s",a);
scanf("%s",b);
l1=strlen(a);
l2=strlen(b);
i=l1-1;
j=l2-1;
while(i>=0&&j>=0&&a[i]==b[j])
{
i=i-1;
j=j-1;
}
printf("%lld\n",i+j+2);
return 0;
}
|
#include <stdio.h>
#include <string.h>
const int N=2e5+10;
int main()
{
char s1[N], s2[N];
int i, j;
gets(s1);
gets(s2);
int len1=strlen(s1), len2=strlen(s2);
for (i=len1-1,j=len2-1;i>=0&&j>=0;i--,j--)
{
if (s1[i]!=s2[j])
break;
}
printf("%d\n",2+i+j);
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main()
{
char s1[200005];
char s2[200005];
while(scanf("%s%s",&s1,&s2)!=EOF){
int l1=strlen(s1);
int l2=strlen(s2);
while(l1&&l2){
if(s1[l1-1]==s2[l2-1]){
l1--;
l2--;
}else{
break;
}
}
printf("%d\n",l1+l2);
}
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main()
{char s[2000005],t[2000005];
long long int sl=0,tl=0,w=0,i,j;
scanf("%s %s",s,t);
sl=strlen(s);
tl=strlen(t);
for(i=sl-1,j=tl-1;i>=0,j>=0;i--,j--)
{
if(s[i]!=t[j])
break;
}
printf("%lld",(i+j+2));
return 0;
}
|
#include <stdio.h>
int len(char *s)
{
int i = 0;
while (s[i])
i++;
return i;
}
int main()
{
char s[200001],t[200001];
int m,n;
int i,j;
scanf("%s",s);
scanf("%s",t);
m = len(s);
n = len(t);
i = m-1;
j = n-1;
while (i>=0 && j>=0 && s[i]==t[j])
{
i--;
j--;
}
printf("%d\n",i+j+2);
return 0;
}
|
#include<stdio.h>
#include<string.h>
#define maxn 210000
int main()
{
char s[maxn],t[maxn];
while(gets(s),gets(t))
{
int a=strlen(s);
int b=strlen(t);
int ans=0;
for(int i=a-1,j=b-1;i>=0,j>=0;i--,j--)
{
if(s[i]==t[j]) ans+=2;
else break;
}
printf("%d\n",a+b-ans);
}
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main()
{
int i,count;
char s[200001],t[200001];
scanf("%s %s", s, t);
int lens=strlen(s),lent=strlen(t);
for(i=0;i<lens && i<lent;i++) if(s[lens-1-i]!=t[lent-1-i]) break;
count=(lens+lent)-(2*i);
printf("%d",count);
return 0;
}
|
#include<stdio.h>
#include<stdlib.h>
#include<ctype.h>
#include<string.h>
#include<math.h>
int main()
{
char s1[200005],s2[200005];
int i;
gets(s1);
gets(s2);
int x=strlen(s1);
int y=strlen(s2);
int z=x+y;
for(i=0;i<x && i<y;i++)
{
if(s1[x-1-i]!=s2[y-1-i])
break;
}
printf("%d",z-2*i);
return 0;
}
|
#include <stdio.h>
#include <string.h>
int main()
{ int k=0,i,p,q,n;
char s[200001],t[200001];
scanf("%s%s",&s,&t);
p=strlen(s);
q=strlen(t);
while(s[p]==t[q]&&p>=0&&q>=0)
{ k++;
p--;
q--;}
k--;
p=strlen(s);
q=strlen(t);
printf("%d",p+q-2*k);
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main() {
int c,d;
char a[200005],b[200005];
gets(a);
gets(b);
int n1=strlen(a)-1;
int n2=strlen(b)-1;
c=n1;
d=n2;
while(n1>=0&&n2>=0) {
if(a[n1]!=b[n2]) {
break;
} else {
n1--;
n2--;
}
}
printf("%d\n",n1+n2+2);
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main()
{
char s1[1000000],s2[1000000];
int i,j,len1,len2,x=0,a;
scanf("%s %s",&s1,&s2);
len1=strlen(s1);
len2=strlen(s2);
for(i=len1-1,j=len2-1;i>=0,j>=0;i--,j--)
{
if(s1[i]==s2[j])
x++;
else
break;
}
a=len1+len2-(2*x);
printf("%d\n",a);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
int main()
{
int n1,n2,i,j,count=0;
char s[200001],t[200001];
scanf("%s%s",s,t);
n1=strlen(s);
n2=strlen(t);
i=n1-1;
j=n2-1;
while(i>=0 && j>=0){
if(s[i]==t[j]){
i--;
j--;
continue;
}
break;
}
printf("%d",i+j+2);
return 0;
}
|
#include <stdio.h>
#include <string.h>
#define m 200001
int main()
{
int a, b;
char ss[m], cc[m];
scanf("%s%s",ss,cc);
a = strlen(ss);
b = strlen(cc);
while(a>=0&&b>=0 && ss[a]==cc[b])
{
a--;
b--;
}
a++;
b++;
printf("%d\n", a+b);
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main()
{
int i,sum,num,l,s,k;
sum=0;
num=0;
char a[200001],b[200001];
gets(a);
gets(b);
l=strlen(a);
s=strlen(b);
k=1;
for(i=l-1;i>=0;i--)
{
if(a[i]==b[s-k])
{
sum+=1;
}
else
{
break;
}
k++;
}
printf("%d\n",s+l-sum*2);
return 0;
}
|
#include <stdio.h>
#include <math.h>
#include <string.h>
int main()
{
char a[1000000],b[1000000];
// gets(a);
// gets(b);
scanf("%s",a);
scanf("%s",b);
int l1=strlen(a);
int l2=strlen(b);
int i,j;
for(i=l1-1, j=l2-1;i>=0,j>=0;i--,j--)
{
if(a[i]!=b[j])
{
break;
}
}
printf("%d\n",i+j+2);
}
|
#include<stdio.h>
#include<string.h>
main(){
char s[200001] , t[200001];
scanf("%s",s);
scanf("%s",t);
int x=strlen(s),y=strlen(t),len;
for(int i=0; ;i++){
if(s[x-1]==t[y-1]){
x--; y--;
if(x==0||y==0){
len=x+y;
break; }
}
else{
len=x+y;
break ;
}
}
printf("%d",len);
}
|
#include<stdio.h>
#include<string.h>
char a[200001],b[200001];
int main()
{
int i,d1,d2,j,ans,count=0;
scanf("%s%s",a,b);
d1=strlen(a);
d2=strlen(b);
for(i=d1-1,j=d2-1;i>=0||j>=0;i--,j--,count+=2)
if(!(a[i]==b[j]))
break;
ans=d1+d2-count;
printf("%d\n",ans);
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main()
{
char ch1[200001],ch2[200001];
int s=0,i1,i2;
scanf("%s %s",ch1,ch2);
if(!strcmp(ch1,ch2)){printf("0");
}
else{i1=strlen(ch1)-1;
i2=strlen(ch2)-1;
while((ch1[i1]==ch2[i2])&&(i1>=0)&&(i2>=0))
{i1--;i2--;s++;
}
printf("%d",strlen(ch1)+strlen(ch2)-2*s);
}
}
|
#include<stdio.h>
char s[200010], t[200010];
int i, j;
int counter = 0;
int sum;
int main()
{
gets(s);
gets(t);
i = strlen(s) - 1;
j = strlen(t) - 1;
sum = i+j+2;
for (; i >= 0 && j >= 0; i--, j--)
{
if (s[i] == t[j])
{
counter += 2;
}
else
break;
}
printf("%d\n", sum - counter);
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main(){
char a[200001],b[200001];
int l1,l2;
scanf("%s",a);int k=2;///4th test case
scanf("%s",b);
int m;
l1=strlen(a);
l2=strlen(b);
m=l1<l2?l1:l2;
int i;
for(i=0;i<=m-1;i++){
if(a[l1-1-i]!=b[l2-1-i]){
break;
}
}
int req;
req=l2+l1-2*i;
printf("%d",req);
return 0;}
|
#include <stdio.h>
#include <string.h>
int n = 2*100000+1;
int main()
{
char s[n],t[n];
scanf("%s%s",s,t);
int a= strlen(s),b=strlen(t);
int i,j=0,c;
if(a<=b)
c=b;
else
c=a;
while(c!=0)
{
if(s[a-1]==t[b-1])
j++,a--,b--,c--;
else
break;
}
a= strlen(s),b=strlen(t);
printf("%d\n",a+b-2*j);
}
|
#include <stdio.h>
int main()
{
int a=0,b=0;
char c[200050]={};
char d[200050]={};
while(c[a]!='\n') {
a++;
c[a]=getchar();
}
while(d[b]!='\n') {
b++;
d[b]=getchar();
}
a--;
b--;
while(a>0 && b>0) {
if(c[a]!=d[b]) {
printf("%d\n",a+b);
return 0;
}
a--;
b--;
}
printf("%d\n",a+b);
}
|
#include <stdio.h>
#include<string.h>
int main()
{
char s[200001],t[200001];
int l,i,m,p,tot;
scanf("%s",&s);
scanf("\n%s",&t);
l=strlen(s);
m=strlen(t);
if(l<m)p=l;
else p=m;
tot=l+m;
for(i=0;i<=p-1;i++)
{
if(s[l-i-1]==t[m-i-1])tot=tot-2;
else break;
}
printf("%d",tot);
return 0;
}
|
#include <stdio.h>
#include <string.h>
int main()
{
char str[200001],str1[200001];
scanf("%s",str);
scanf("%s",str1);
int n1,n2,m1=0,m2=0;
n1=strlen(str);
n2=strlen(str1);
n1--;
n2--;
int i,j;
for(n1,n2;str[n1]==str1[n2]&&n1>-1&&n2>-1;n1--,n2--){
}
int sum;
sum=n1+n2+2;
printf("%d",sum);
return 0;
}
|
#include<stdio.h>
int main()
{
char a[200000], b[200000];
int i,j,k,s=0,la,lb,count=0;
gets(a);
la=strlen(a);
gets(b);
lb=strlen(b);
for(i=la-1,j=lb-1;i>=0,j>=0;i--,j--)
{
if(a[i]==b[j]) count++;
else break;
}
s=la-count+lb-count;
printf("%d\n",s);
return 0;
}
|
#include <stdio.h>
#include <string.h>
char a[200010];
char b[200010];
int main()
{
while (~scanf("%s%s", a, b))
{
int l1 = strlen(a), l2 = strlen(b), temp = 1;
while (l1 - temp >= 0 && l2 - temp >= 0)
{
if (a[l1 - temp] == b[l2 - temp])
temp++;
else
break;
}
printf("%d\n", l1 + l2 - (temp - 1) * 2);
}
}
|
#include <stdio.h>
#include <string.h>
int main()
{
char s[200001],t[200001];
scanf("%s",s);
scanf("%s",t);
int num,sl=strlen(s),tl=strlen(t),i,mov=0;
if(strlen(s)<strlen(t))
num=strlen(s);
else
num=strlen(t);
for(i=0;i<num;i++)
{
if(s[sl-1-i]!=t[tl-1-i])
{
break;
}
}
mov=sl+tl-2*i;
printf("%d\n",mov);
}
|
#include<stdio.h>
#include<string.h>
int main()
{
char a[2000005],b[2000005];
int i,j,s=0;
gets(a);
gets(b);
for(i=strlen(a)-1,j=strlen(b)-1;i>=0,j>=0;i--,j--)
{
if(a[i]==b[j])
s+=2;
else
break;
}
printf("%d",strlen(a)+strlen(b)-s);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main()
{
char s[1000000],t[1000000];
long long int i,j,z,z1,shu;
scanf("%s%s",s,t);
z=strlen(s)-1;
z1=strlen(t)-1;
for(;;)
{
if(z==-1||z1==-1||s[z]!=t[z1])
break;
z--;z1--;
}
shu=z+z1+2;
printf("%lld\n",shu);
return 0;
}
|
#include <stdio.h>
#include <string.h>
int cantMoves(char s[],char t[]);
int main(){
char s[200001],t[200001];
scanf("%s",s);
getchar();
scanf("%s",t);
printf("%d",cantMoves(s,t));
}
int cantMoves(char s[],char t[]){
int sl=strlen(s);
int tl=strlen(t);
while(sl>0 && tl>0 && s[sl-1]==t[tl-1]){
sl--;
tl--;
}
return sl+tl;
}
|
#include<stdio.h>
#include<string.h>
char s1[200005],s2[200005];
int main(){
int l1,l2,ln1,ln2,to,cnt,c=0;
scanf("%s %s",s1,s2);
ln1=strlen(s1);
ln2=strlen(s2);
l1=ln1; l2=ln2;
to=l1<l2? l1:l2;
while(to--){
if(s1[l1-1]==s2[l2-1]){
l1--; l2--;
c++;
}
else break;
}
cnt=(ln1-c)+(ln2-c);
printf("%d\n",cnt) ;
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main(){
char a[200001],b[200001];
int count=0,p,i;
scanf("%s",a);
scanf("%s",b);
int n=strlen(a);
int m=strlen(b);
if(n>m)
p=m;
else
p=n;
for(i=0;i<p;i++)
{
if(a[n-1-i]!=b[m-1-i])
break;
}
printf("%d",n+m-2*i);
}
|
#include<stdio.h>
#include<string.h>
int main(){
int sum=0 , len1 , len2 , i , min;
char s[200001] , t[200001];
gets(s);
gets(t);
len1=strlen(s);
len2=strlen(t);
min=len1>len2 ? len2 : len1;
for(i=0;i<min;i++){
if(s[len1-1-i] == t[len2-1-i]) sum++;
else break;
}
printf("%d\n",len1+len2-2*sum);
return 0;
}
|
#include<stdio.h>
#include<string.h>
char x[2000000],y[2000000];
int main()
{
int ck=1,i=0;
scanf("%s %s",&x,&y);
int a=strlen(x),b=strlen(y);
while(ck)
{
i++;
if(i>a || i>b) ck=0;
else if(x[a-i]!=y[b-i]) ck=0;
}
i--;
int ans= (a-i)+(b-i);
printf("%d\n",ans);
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main()
{
int i, j, cnt=0, a, b, n;
char s[200020],t[200020];
gets(s);
gets(t);
a=strlen(s);
b=strlen(t);
while(1){
if (!s[a-1-i]) break;
if (!t[b-1-i]) break;
if (s[a-1-i] == t[b-1-i]) cnt++;
else break;
i++;
}
n=a+b-(2*cnt);
printf("%d\n",n);
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main()
{
char a[200005],b[200005];
int i,j,str1,str2,m=0;
scanf("%s%s",a,b);
str1=strlen(a);
str2=strlen(b);
i=str1-1;
j=str2-1;
for(;i>=0,j>=0;i--,j--){
if(a[i]==b[j]) m=m+2;
else break;
}
m=str1+str2-m;
printf("%d\n",m);
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main(){
char a[200007],b[200007];
int lena,lenb,ans,equal,i;
scanf("%s",a);getchar();
scanf("%s",b);getchar();
lena=strlen(a);
lenb=strlen(b);
for(i=0;i<lena&&i<lenb;i++)
if(a[lena-1-i]!=b[lenb-1-i])
break;
ans=lena+lenb-2*i;
printf("%d\n",ans);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <limits.h>
#include <string.h>
#define max 2000002
int main()
{
char s1[max],s2[max];
scanf("%s %s",s1,s2);
int l1 = strlen(s1),l2 = strlen(s2);
int p1 = l1-1,p2 = l2-1;
for (;(p1>=0) && (p2>=0) && s1[p1] == s2[p2];p1--,p2--)
;
int sum = p1 + p2 + 2;
printf("%d",sum );
return 0;
}
|
#include<stdio.h>
#include<math.h>
#include<string.h>
int main()
{
int n,t,i,j,k=0,p;
char c[200002],d[200002];
scanf("%s",c);
scanf("%s",d);
t=strlen(c);
n=strlen(d);
for(i=t-1,j=n-1;i>=0,j>=0;i--,j--){
if(c[i]==d[j]){
k++;
}
else break;
}
p=(t-k)+(n-k);
printf("%d\n",p);
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main()
{
char a[2000000],b[2000000];
long long int i,s=0,min,al,bl,moves;
gets(a);
gets(b);
al=strlen(a);
bl=strlen(b);
moves=al+bl;
if(a[al-1]==b[bl-1])
{
if(al<=bl)
min=al;
else
min=bl;
for(i=0;i<min;++i)
if(a[al-1-i]==b[bl-1-i])
++s;
else
break;
}
printf("%lld",moves-2*s);
return 0;
}
|
#include <stdio.h>
#include <string.h>
const int M = 200002;
int main(){
int i,j,k=0,ls,lt;
char s[M],t[M];
fgets(s,M,stdin);
ls = strlen(s);
fgets(t,M,stdin);
lt = strlen(t);
for(i=lt-1,j=ls-1,k=0; i>=0 && j>=0; --i, --j,k++)
if(s[j]!=t[i])
break;
printf("%i",lt+ls-2*k);
return 0-0-0;
}
|
#include<stdio.h>
#include<string.h>
char st[200002],s[200002];
int main()
{
int i,j,a,b,count=0,min;
scanf("%s%s",st,s);
a=strlen(st);
b=strlen(s);
min=a;
if(min>b)
{
min=b;
}
strrev(st);
strrev(s);
for(i=0;i<min;i++)
{
if(st[i]==s[i])
count++;
else
break;
}
printf("%d\n",a+b-(2*count));
}
|
#include<stdio.h>
#include<string.h>
int len1,len2,len;
char s1[200005],s2[200005];
int main()
{
int sum=0;
scanf("%s",s1);
scanf("%s",s2);
len1=strlen(s1);
len2=strlen(s2);
int i,j;
i=len1-1;
j=len2-1;
while(s1[i]==s2[j]&&i>=0&&j>=0)
{
i--;
j--;
}
sum=i+j+2;
printf("%d",sum);
}
|
#include<stdio.h>
#include<string.h>
char x[200005],y[200005];
int min(int e,int f)
{
if(e>f)
return f;
return e;
}
int main( )
{
while(scanf("%s %s",x,y)!=EOF)
{
int len1=strlen(x);
int len2=strlen(y);
int b=min(len1,len2),a;
for(a=1;a<=b;a++)
{
if(x[len1-a]!=y[len2-a])
break;
}
a=a-1;
a=len1+len2-2*a;
printf("%d\n",a);
}
}
|
#include <stdio.h>
#include <string.h>
const int m=200010;
int main()
{
char a[m], b[m], c[m], d[m];
scanf("%s",a);
scanf("%s",b);
int i,l1=strlen(a), l2=strlen(b);
for (i=0; i<l1; i++)
c[i]=a[l1-i-1];
for (i=0; i<l2; i++)
d[i]=b[l2-i-1];
i=0;
while (i<l1 && i<l2 && c[i]==d[i])
i++;
int s=(l1+l2)-(2*i);
printf("%d",s);
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main()
{
char a[200005],b[200005];
int la,lb,i,j,k,t,n;
gets(a);
gets(b);
la=strlen(a);
lb=strlen(b);
t=0;
for(j=la-1,k=lb-1;j>=0,k>=0;j--,k--)
{
if(a[j]==b[k])
t++;
else
break;
}
n=la+lb-t*2;
printf("%d",n);
return 0;
}
|
#include<stdio.h>
#include<string.h>
#define N 200001
int main(void)
{
int i,j,k,l1,l2,m,n,c=0;
char s1[N],s2[N];
scanf("%s%s",s1,s2);
l1= strlen(s1);
l2=strlen(s2);
for(i=l1-1,j=l2-1; i>= 0 && j>= 0;i--,j--,c++)
{
if(s1[i] != s2[j])
break;
}
c= c*2;
printf("%d\n",l1+l2-c);
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main()
{
int i,j,n,m,x=0,p,q;
char a[200002],b[200002];
gets(a);
gets(b);
n=strlen(a);
m=strlen(b);
strrev(a);
strrev(b);
for(i=0,j=0;i<n,j<m;i++,j++)
{
if(a[i]==b[j])
{
x++;
}
else
break;
}
printf("%d\n",m+n-(2*x));
}
|
#include<stdio.h>
#include<string.h>
int main()
{
char s1[200010];
char s2[200010];
scanf("%s",&s1);
scanf("%s",&s2);
long int num=0;
long int a=strlen(s1);
long int b=strlen(s2);
int i=a-1;
int j=b-1;
while(i>=0&&j>=0)
{
if(s1[i]==s2[j])
{
num+=2;
i--;
j--;
}
else if(s1[i]!=s2[j])
break;
}
printf("%ld",a+b-num);
return 0;
}
|
#include <stdio.h>
#include <string.h>
int main()
{
char s[200010],ss[200010],stack[200010];
gets(s);
gets(ss);
int l1,l2,top=0,i,j,l;
l1=strlen(s);
l2=strlen(ss);
for(i=l1-1,j=l2-1; i>=0&&j>=0; i--,j--)
{
if(s[i]!=ss[j])
break;
stack[top++]=s[i];
}
printf("%d",l1+l2-2*top);
return 0;
}
|
#include<stdio.h>
#include<string.h>
char str1[200005],str2[200005];
int main(void)
{
gets(str1);
gets(str2);
int len1=strlen(str1),len2=strlen(str2);
char *p1=str1+len1,*p2=str2+len2;
int same=0;//ָ��\0
while((*(p1-1)==*(p2-1))&&p1>str1&&p2>str2){
same+=2;
p1--;
p2--;
}
printf("%d\n",len1+len2-same);
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main(void){
char a[2000000],b[2000000];
scanf("%s",&a);
scanf("%s",&b);
int sl1,sl2;
sl1=strlen(a);
sl2=strlen(b);
int temp;
if(sl1>=sl2){
temp=sl2;}
else{temp=sl1;}
int bonus=0;
for(int t=0;t<temp;t++){
if(a[sl1-t-1]==b[sl2-t-1]){
bonus+=2;
}else{t=temp+1;}
}
printf("%d",sl1+sl2-bonus);
return(0);
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main()
{
char s1[200001], s2[200001];
int len1, len2, i, j, x;
scanf("%s%s", s1, s2);
len1 = strlen(s1);
len2 = strlen(s2);
x = len1 + len2;
for (i = len1 - 1, j = len2 - 1; i >= 0 && j >= 0; i--, j--)
{
if (s1[i] == s2[j])
{
x -= 2;
}
else
{
break;
}
}
printf("%d\n",x);
return 0;
}
|
#include <stdio.h>
int getlen(char *s) {
int j;
for(j = 0; s[j] != '\0'; ++ j);
return j;
}
int main() {
char s1[200001], s2[200001];
scanf("%s%s", s1, s2);
int l1 = getlen(s1), l2 = getlen(s2), count = 0, p1, p2;
for(p1 = l1 - 1, p2 = l2 - 1; p1 >= 0 && p2 >= 0; -- p1, -- p2) {
if(s1[p1] != s2[p2]) {
break;
}
++ count;
}
printf("%d", l1 + l2 - 2 * count);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include<string.h>
#include<ctype.h>
int main()
{
int i,min,count=0;
char a[200005],b[200005];
scanf("%s%s",a,b);
min=(strlen(a)<strlen(b))?strlen(a):strlen(b);
for(i=1;i<=min;i++){
if(a[strlen(a)-i]==b[strlen(b)-i]){
count++;
}
else
break;
}
printf("%d",strlen(a)+strlen(b)-2*count);
return 0;
}
|
#include<stdio.h>
#include<string.h>
char a[900015],b[900005];
int main ()
{
int i,j,d,e;
scanf("%s",&a);
d= strlen(a);
scanf("%s",&b);
e= strlen(b);
int s = 0;
for (i=d-1,j=e-1; i>=0,j>=0; i--,j--)
if (a[i] != b[j])
break;
if (i != -1)
s += (i+1);
if (j != -1)
s += (j+1);
printf("%d\n",s);
return 0;
}
|
#include<stdio.h>
#include<string.h>
#include<conio.h>
int main()
{
int l1,l2,i,j;
char S1[200000],S2[200000];
gets(S1);
l1=strlen(S1);
gets(S2);
l2=strlen(S2);
for(;l1!=0&&l2!=0;)
{
if(S1[l1-1]==S2[l2-1])
{
l1--;
l2--;
}
else
{
break;
}
}
i=l1+l2;
printf("%d\n",i);
return 0;
}
|
#include<stdio.h>
#include<string.h>
char s[200010],t[200010];
int main(){
int sl,tl,r;
gets(s);
gets(t);
sl=strlen(s)-1;
tl=strlen(t)-1;
if(s[sl]==t[tl] && (sl<=0 && tl<=0)){
r=0;
}
else{
while(s[sl]==t[tl] && !(sl<0 || tl<0)){
tl--;
sl--;
}
r=sl+tl+2;
}
printf("%d",r);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
int main(void){
char s[2000000],t[2000000];
long l1,l2;
long i=0;
scanf("%s",&s);
scanf("%s",&t);
l1=strlen(s);
l2=strlen(t);
if(s[l1-1]!=t[l2-1]){
printf("%ld",l1+l2);
return 0;
}
while(s[l1-1-i]==t[l2-1-i]){
i++;}
if(l1+l2-2*i>=0)
printf("%ld",l1+l2-2*i);
else
printf("0");
return 0;
}
|
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int main(){
char t1[1000000],t2[1000000];
scanf("%s%s",t1,t2);
int t1Le = strlen(t1);
int t2Le = strlen(t2);
int temp=0,count=0;
int i,j;
for(i=t1Le-1,j=t2Le-1;i>=0&&j>=0;j--,i--){
if(t1[i]!=t2[j]){
break;
}
}
count = (i+1)+(j+1);
printf("%d",count);
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main()
{
char str1[200001],str2[200001];
int len1,len2,move=0,i,j;
scanf(" %[^\n]",str1);
scanf(" %[^\n]",str2);
len1=strlen(str1);
len2=strlen(str2);
for(i=0,j=0;i<len1&& j<len2;i++,j++)
{
if(str1[len1-i-1]!=str2[len2-j-1])
{
break;
}
}
move=len1-i+len2-j;
printf("%d\n",move);
}
|
#include <stdio.h>
#include <string.h>
#define N 200001
char s[N];
char t[N];
int main()
{
int len1,len2;
scanf("%s%s",s,t);
len1=strlen(s);
len2=strlen(t);
int i,j;
int num=0;
int len=len1+len2;
for(i=len1-1,j=len2-1;i>=0,j>=0;i--,j--)
{
if(s[i]==t[j])
{
num=num+2;
}
else
{
break;
}
}
printf("%d\n",len-num);
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main()
{
int i,j;
char a[200001];
char b[200001];
scanf("%s",a);
scanf("%s",b);
int a1=strlen(a),b1=strlen(b);
int min=a1>b1?b1:a1;
a1=a1-1;
b1=b1-1;
int a11=0;
while(min)
{
if(a[a1]!=b[b1])
break;
a1--;
b1--;
min--;
}
int max=a1>b1?a1:b1;
if(min==0)
printf("%d",max+1);
else
printf("%d",a1+b1+2);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define N 222222
char s[N], t[N];
int sl, tl, cnt, sum;
int main()
{
scanf("%s%*c%s", s, t);
sl=strlen(s);
tl=strlen(t);
sum=sl+tl;
if (sl<tl) for (int i=tl-1, j=sl-1; i>=(tl-sl); i--, j--, cnt+=2) {if (s[j]!=t[i]) break;}
else for (int i=sl-1, j=tl-1; i>=(sl-tl); i--, j--, cnt+=2) {if (s[i]!=t[j]) break;}
printf("%d", sum-cnt);
}
|
#include <stdio.h>
#include <string.h>
#define max 200010
int main()
{
char a[max], b[max];
int ans, sa, sb, i, j;
while( scanf("%s%s", a, b ) != EOF )
{
sa = strlen( a );
sb = strlen( b );
ans = sa+sb;
for( i = sa-1 , j = sb-1 ; i >= 0 && j >= 0 ; i--, j-- )
{
if( a[i] == b[j] ) ans = i+j;
else break;
}
printf( "%d\n", ans );
}
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include<string.h>
int main()
{
char s[200001],t[200001];
int count=0;
scanf("%s",s);
getchar();
scanf("%s",t);
int a=strlen(t)-1;
for(int i=strlen(s)-1;i>=0;i--)
{
if(s[i]==t[a])
{
count+=2;
a--;
}
else{break;}
}
printf("%d",strlen(s)+strlen(t)-count);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAXLEN 200000
int min(int a, int b) {
return a < b ? a : b;
}
int main(void) {
char s[MAXLEN+1], t[MAXLEN+1];
scanf("%s%s", s, t);
int slen = strlen(s), tlen = strlen(t);
int min = slen < tlen ? slen : tlen;
int i;
for (i = 0; i < min; i++) {
if (s[slen-i-1] != t[tlen-i-1]) {
break;
}
}
printf("%d\n", slen+tlen - 2*i);
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.