content
stringlengths 19
11k
|
|---|
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int main()
{
int i=0,count1,count2;
char string1[200001],string2[200001];
scanf("%s %s",string1,string2);
count1=strlen(string1);
count2=strlen(string2);
while(string1[count1-i]==string2[count2-i] && count1-i>=0&&count2-i>=0)
{
// printf("%d %d\n",count1-i,count2-i);
i++;
}
printf("%d",count1-i+count2-i+2);
}
|
#include <stdio.h>
#include <string.h>
int main ()
{
char s[200001],t[200001];
unsigned p,u,ok=1,k=0;
scanf ("%s%s", s, t);
p=strlen(s)-1;
u=strlen(t)-1;
while (ok==1 && p>=0 && u>=0)
{
if (s[p]!=t[u])
ok=0;
p--;
u--;
k++;
}
k--;
if (strcmp(s,t)==0)
printf ("0");
else
printf ("%d", strlen(s)+strlen(t)-2*k);
}
|
#include<stdio.h>
#include<string.h>
int main()
{
char str[200001],ara[200001];
scanf("%s",str);
scanf("%s",ara);
long int i,l,p,m,s=0,c,k;
l=strlen(str);
k=l;
p=strlen(ara);
for(i=p-1;i>=0;i--)
{
l--;
if(ara[i]==str[l]) {s++;
if(l==0) break;}
else break;
}
if(s==0) c=k+p;
else {c=(k-s)+(p-s);}
printf("%ld\n",c);
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main()
{
char kh[1000000],arr[1000000];
int a=0,b=0,c,d,i=0,j=0,k=0,l=0,tep,temp,m,n,x,y;
scanf("%s %s",kh,arr);
a=strlen(kh);
b=strlen(arr);
j=a;
i=b;
while(1)
{
j--;
i--;
if(kh[j]==arr[i])
{
k++;
if(i==0 || j==0)
break;
}
else
break;
}
printf("%d\n",(a-k)+(b-k));
} |
#include<stdio.h>
#include<string.h>
char a[200005],b[200005];
int main ()
{ int n,m,count=0,j;
scanf("%s%s",a,b);
n=strlen(a);
m=strlen(b);
if(m>n)
{j=m-1;
for(int i=n-1;i>=0;i--)
{
if(b[j]==a[i])
{
count=count+2;
j--;
}
else
break;
}
}
else
{
j=n-1;
for(int i=m-1;i>=0;i--)
{
if(b[i]==a[j])
{
count=count+2;
j--;
}
else
break;
}
}
printf("%d",(m+n-count));
}
|
#include <stdio.h>
#include <string.h>
int main()
{
int i,j,count=0,k,l,m,n;
char s[200005],p[200005];
scanf("%s%s",&s,&p);
k=strlen(s);
m=k;
l=strlen(p);
n=l;
for(i=(k-1),j=(l-1);i>=0,j>=0;i--,j--)
{
if(s[i]==p[j])
{
count++;
}
else
{
break;
}
}
printf("%d",(m+n)-(2*count));
} |
#include <stdio.h>
#include <stdlib.h>
#include<string.h>
int main()
{
char a[200005],b[200005];
long sum,fa,fb;
while (scanf("%s%s",a,b)!=EOF)
{
fa=strlen(a);
fb=strlen(b);
while (a[fa-1]==b[fb-1])
{
fa--;
fb--;
if (fa==0||fb==0)
break;
}
sum=fa+fb;
printf("%ld\n",sum);
}
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main()
{
int l1,l2,i,j,k,h,cnt=0;
char s1[1000000],s2[1000000];
scanf("%s%s",s1,s2);
l1=strlen(s1);
l2=strlen(s2);
if(l1>=l2)
{
h=l2;
}
if(l2>l1)
{
h=l1;
}
for(i=0,j=l1-1,k=l2-1;i<h;i++,j--,k--)
{
if(s1[j]==s2[k]){
cnt++;}
else break;
}printf("%d",(l1+l2-(2*cnt)));
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define ll long long
#define Min(a,b) (a>b?b:a)
#define Max(a,b) (a>b?a:b)
#define MAX 100100
int n,m,arr[MAX],occ[MAX],pre=1,tmp;
int i,j,ans;
char a[3*MAX], b[3*MAX];
int main(){
scanf("%s%s", a,b);
strrev(a);
strrev(b);
int len_a = strlen(a);
int len_b = strlen(b);
a[len_a]='.';
b[len_b]='!';
for(i=0;a[i]==b[i];i++);
printf("%i\n",len_a+len_b-2*i);
}
|
#include<stdio.h>
#include<string.h>
int main(void)
{
char s[300000];
char t[300000];
scanf("%s",s);
scanf("%s",t);
int a,b,c,i;
a=strlen(s);
b=strlen(t);
int count=0;
if(a>=b)
c=b;
else
c=a;
for( i=0;i<c;i++)
{
if(s[a-1-i]==t[b-1-i]){
count++;
}
else{
break;
}
}
printf("%d\n",a+b-count*2);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
char s[200020], t[200020] ;
int main()
{
int count=0, len1, len2, sum ;
gets(s) ;
gets(t) ;
len1=strlen(s) ;
len2=strlen(t) ;
int i=len1-1, j=len2-1 ;
for(; i>=0 && j>=0; i--,j--)
{
if(s[i]==t[j])
count+=2 ;
else
break ;
}
sum=len1+len2-count ;
printf("%d",sum) ;
return 0;
}
|
//Delete from the left
//Bismillahir Rahmanir Rahim
#include<stdio.h>
#include<string.h>
int main()
{
int n,i,len1,len2,j,y=0;
char s[200001],x[200001];
scanf("%s %s",s,x);
len1 = strlen(s);
len2 = strlen(x);
for(i=len1-1,j=len2-1; i>=0; i--,j--)
{
if(s[i]==x[j])
y++;
else break;
}
printf("%d\n",(len1-y)+(len2-y));
return 0;
}
// test west
// codeforces yes
// test yes |
#include<stdio.h>
#include<string.h>
int main()
{
char a[200002],b[200002];
int a1,b1;
scanf("%s",a);
scanf("%s",b);
a1=strlen(a);
b1=strlen(b);
int an=0;
int big;
if(a1>b1)
big=b1;
else
big=a1;
for(int i=1;i<=big;i++)
{
if(a[a1-i]==b[b1-i]){
an++;
}
else{
break;
}
}
an=a1-an+b1-an;
printf("%d",an);
}
|
#include<stdio.h>
#include<string.h>
char s[200001];
char t[200001];
int main(){
int ls,lt,count=0,i,min;
scanf(" %s %s",s,t);
ls=strlen(s);
lt=strlen(t);
min=ls;
if(lt<min)
min=lt;
strrev(s);
strrev(t);
for(i=0;i<min;i++){
if(s[i]==t[i])
count++;
else
break;
}
printf("%d\n",ls+lt-(2*count));
return 0;
} |
#include<stdio.h>
#include<string.h>
char a[1000000],b[1000000];
int main()
{
int i,j,l1,l2=0,ans,c=0;
char ch;
gets(a);
gets(b);
l1=strlen(a);
l2=strlen(b);
for(i=l1,j=l2;i>=0&&j>=0;i--,j--)
{
if(a[i-1]==b[j-1])
c=c+2;
else
break;
}
ans=l1+l2-c;
if(ans>=0)
printf("%d",ans);
else
printf("0");
}
|
#include<stdio.h>
#include<string.h>
int main()
{
char s1[200005],s2[200005];
scanf("%s%s",s1,s2);
int i,num,j;
i=strlen(s1)-1;
j=strlen(s2)-1;
num=i;
while(i>=0&&j>=0)
{
if(s1[i]==s2[j])
{
i--;
j--;
}
else
break;
}
if(i==num)
printf("%d",strlen(s1)+strlen(s2));
else
printf("%d",(strlen(s1)+strlen(s2))-((num-i)*2));
} |
#include<stdio.h>
#include<string.h>
char a[200001];
char b[200001];
void rev(char a[],int n)
{
char temp;
for(int i=0;i<n/2;i++)
{
temp=a[i];
a[i]=a[n-1-i];
a[n-1-i]=temp;
}
}
int main()
{
int i,p,q,count=0,l;
scanf("%s",a);
scanf("%s",b);
p=strlen(a);
q=strlen(b);
rev(a,p);
//printf("%s",a);
rev(b,q);
//printf("%s",b);
if(p>q)
l=p;
else l=q;
for(i=0;i<l;i++)
{ if(a[i]==b[i])
count++;
else
break;
}
printf("%d",p+q-2*count);
}
|
#include <stdio.h>
#include <string.h>
int main()
{
char s1[200000], s2[200000];
int x, y, z, i, j, result;
int count = 0, lcnt = 0;
scanf("%s", s1);
y = strlen(s1);
scanf("%s", s2);
z = strlen(s2);
if (y < z)
x = y;
else
x = z;
for (i = y - 1, j= z - 1; lcnt < x; i--, j--, lcnt++)
{
if (s1[i] == s2[j])
count++;
else
break;
}
result = (y - count) + (z - count);
printf("%d", result);
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main(){
char s1[200005], s2[200005];
long long l1,l2,c,res,i,j;
gets(s1);
gets(s2);
c=0;
l1=strlen(s1);
l2=strlen(s2);
//(l1<=l2) l=l1; else l=l2;
i = l1-1; j = l2-1;
while(1){
if(i<0 || j<0)
break;
if(s1[i]!=s2[j])
break;
else
c++;
i--;j--;
}
res = (l1-c)+(l2-c);
printf("%lld",res);
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main()
{
int n=0, i, j;
char a[210000], b[210000];
gets(a);
gets(b);
if(strlen(a)==0||strlen(b)==0)
{
printf("0");
}
else{
i = strlen(a)-1;
j = strlen(b)-1;
while(i>=0&&j>=0){
if(a[i]==b[j])
{
n=n+2;
}
else break;
i--;
j--;
}
int e = strlen(a)+strlen(b)-n;
printf("%d", e);}
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main()
{
char s[200001], t[200001];
scanf("%s", s);
scanf("%s", t);
int ls = strlen(s);
int lt = strlen(t);
//printf("%d %d", ls, lt);
int i=ls-1, j=lt-1, count=0;
while(i>=0 && j>=0)
{
if(s[i]==t[j])
count++;
else
break;
i--, j--;
}
int st = (ls+lt)-count*2;
printf("%d", st);
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main()
{char s[200001],r[200001],*s1,*r1;
scanf("%s%s",s,r);
long int l1,l2,i=0,j=0;
l1=strlen(s);
l2=strlen(r);
s1=strrev(s);
r1=strrev(r);
//printf("%c %c",s1[1],r1[1]);
if(s1[0]!=r1[0])
printf("%li",l1+l2);
//printf("\n1");
else
{
while(i<l1 && j<l2 && s1[i]==r1[j])
{
i++;
j++;
}
//printf("%li %li",i,j);
if(i==l1)
printf("%li",l2-j);
else if(j==l2)
printf("%li",l1-i);
else
printf("%li",l1-i+l2-j);
}
} |
#include <stdio.h>
#include <string.h>
int main(void)
{
char str1[200005], str2[200005];
int count=0, l1, l2, i;
gets(str1);
gets(str2);
l1=strlen(str1);
l2=strlen(str2);
for(i=0; i<l1 && i<l2; i++)
{
if(str1[l1-1-i]!=str2[l2-1-i])
{
count= 2*i;
break;
}
}
if(i==l1 || i==l2)
{
count=2*i;
}
printf("%d\n", l1+l2-count);
return 0;
}
|
//Avanish K A
//Amrita Vishwa Vidyapeetham
//Delete from left
#include<stdio.h>
#include<string.h>
char s[1000000],x[1000000];
int delete(){
long int count=0,m,n,i,j;
m=strlen(s)+strlen(x);
n=(strlen(s)>strlen(x))?strlen(x):strlen(s);
i=strlen(s)-1;
j=strlen(x)-1;
while(n--){
if(s[i]==x[j]){
count+=2;
i--;
j--; } }
count=m-count;
printf("%ld\n",count);
return 0;
}
int main(){
gets(s);
gets(x);
delete();
return 0;
}
|
#include<stdio.h>
#include<string.h>
#include<math.h>
int main()
{
char str3[300000], str4[300000];
int i, n, len1, j, len2, index, test=0, len;
gets(str3);
gets(str4);
len1 = strlen(str3);
len2 = strlen(str4);
strrev(str3);
strrev(str4);
for(i=0, j=0; str3[i], str4[j]; i++, j++){
if(str3[i] == str4[j]){
test++;
}
else break;
}
printf("%d", len1 + len2 - (2*test));
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main(){
long long i,j,s1,a1,e,f,c,d;
char s[200009],a[200009];
scanf("%s %s",s,a);
s1=strlen(s);
a1=strlen(a);
e=s1;
f=a1;
if(a[a1-1]!=s[s1-1]){
printf("%lld\n",e+f);
}
else{
c=0;
for(i=s1-1,j=a1-1;i>=0,j>=0;i--,j--){
if(s[i]==a[j])c++;
else break;
}
d=s1-c+a1-c;
printf("%lld\n",d);
}
return 0;
}
|
#include<stdio.h>
#include<string.h>
char a[222222],b[222222];
int main()
{
while(~scanf("%s%s",a,b))
{
int i,j,l=0;
i=strlen(a)-1;
j=strlen(b)-1;
while(a[i]==b[j])
{
if(i>=0&&j>=0)
{
i--;
j--;
l++;
}
else
{
break;
}
}
printf("%d\n",strlen(a)+strlen(b)-2*l);
}
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main()
{
char s1[1000000],s2[1000000];
scanf("%s",s1);
scanf("%s",s2);
int l1=strlen(s1);
int l2=strlen(s2);
int count=0;
int l3;
if(strcmp(s1,s2)==0)
printf("0\n");
else
{
if(l1<=l2)
l3=l1;
else
l3=l2;
int i,j,f=0;
for(i=l1-1,j=l2-1;i>=0,j>=0;i--,j--)
{
if(s1[i]==s2[j])
{
f++;
continue;
}
else
{
count=l1+l2-2*f;
break;
}
}
if(count==0)
{
count=count+l1+l2-2*l3;
}
printf("%d\n",count);
}
}
|
#include<stdio.h>
#include<string.h>
int main()
{
char a[1000000]={0},b[1000000]={0};
scanf("%s %s",&a ,&b);
int a1,b1;
a1=strlen(a);
b1=strlen(b);
int ma,mi;
int i;
int sum=0;
if(a1>b1)
{
ma=a1-1;
mi=b1;
for(i=mi-1;i>=0;i--)
{
if(b[i]==a[ma])
{
sum++;
ma--;
}
else
break;
}
}
else
{mi=a1;
ma=b1-1;
for(i=mi-1;i>=0;i--)
{
if(a[i]==b[ma])
{
sum++;
ma--;
}
else
break;
}
}
printf("%d",a1+b1-2*sum);
} |
#include<stdio.h>
#include<string.h>
long long i,j,l,l1,ini,fin,ans,count;
char name[1000004],name1[1000004];
int main()
{
scanf("%s",name);
scanf("%s",name1);
l=strlen(name);
l1=strlen(name1);
i=l-1;
j=l1-1;
while(i>=0 && j>=0)
{
if(name[i]==name1[j])
{
count++;
i--;
j--;
}
else
{
break;
}
}
ini=l+l1;
fin=2*count;
ans=ini-fin;
printf("%lld\n",ans);
} |
#include <stdio.h>
#include <string.h>
int main()
{
char str1[200001], str2[200001];
char aux;
int i, j;
int str1len, str2len;
scanf("%s", str1);
scanf("%s", str2);
str1len = strlen(str1);
str2len = strlen(str2);
for (i = str1len - 1, j = str2len - 1; i >= 0 && j >= 0; --i, --j)
{
if (str1[i] != str2[j])
{
printf("%d", i + j + 2);
return 0;
}
}
printf("%d", i >= 0 ? i + 1 : j + 1);
return 0;
}
|
#include<stdio.h>
int main()
{
int i,j,k,d,m,n;
char c1[200001],c2[200001],ch1,ch2;
i=0;
while((ch1=getchar())!='\n')
{
c1[i++]=ch1;
m=i;
}
j=0;
while((ch2=getchar())!='\n')
{
c2[j++]=ch2;
n=j;
}
if(c2[j-1]!=c1[i-1])
d=j+i;
else
{
i=i-1;j=j-1;k=0;
while((j>=0)&&(i>=0)&&(c1[i--]==c2[j--]))
{
k++;
}
d=(n-k)+(m-k);
}
printf("%d",d);
return 0;
} |
#include <stdio.h>
static char s[200003];
static char t[200003];
static int slen;
static int tlen;
int main(void)
{
fgets(s, sizeof s, stdin);
fgets(t, sizeof t, stdin);
slen = 0;
tlen = 0;
while (s[slen] >= 'a' && s[slen] <= 'z')
slen++;
while (t[tlen] >= 'a' && t[tlen] <= 'z')
tlen++;
while (slen && tlen && s[slen-1] == t[tlen-1]) {
slen--;
tlen--;
}
printf("%d\n", slen + tlen);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
int main()
{
char s1[200001];
char s2[200001];
scanf("%s",s1);
scanf("%s",s2);
int min,j;
long l1=strlen(s1);
long l2=strlen(s2);
if(l1>l2)
min=l2;
else
min=l1;
long l=l1+l2;
int count=0;
for(j=min-1;j>=0;j--)
{
if(s1[l1-1]==s2[l2-1])
{
l1--;
l2--;
count++;
}
else
break;
}
printf("%d",l-(2*count));
return 0;
}
|
#include <stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
int compare (const void * a, const void * b)
{
return ( *(int*)a - *(int*)b );
}
int main(void){
long long int test,i,j,n,k,count,flag,flag2,b1,l,m,u,r,q,d,x,max,max2,min,f,sum,b,c[100];
char s[1000000],s1[1000000];
scanf("%s\n%s",s,s1);
max=strlen(s)+strlen(s1);
l=strlen(s);
r=strlen(s1);
l-=1;
r-=1;
if(strcmp(s,s1)==0){
printf("0");
}else{
while(s[l]==s1[r]){
max-=2;
l--;
r--;
}
printf("%lld",max);
}
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main()
{
int n,len1,len2;
char str1[200001];
char str2[200001];
while(gets(str1)){
gets(str2);
int sum=0;
len1=strlen(str1);
len2=strlen(str2);
int i=0;
if(len1>=len2){
while(len2-1-i>=0){
if(str1[len1-1-i]!=str2[len2-1-i]){
break;
}
i++;
}
sum=len1-i+len2-i;
}
if(len2>len1){
while(len1-1-i>=0){
if(str1[len1-1-i]!=str2[len2-1-i]){
break;
}
i++;
}
sum=len1-i+len2-i;
}
printf("%d\n",sum);
}
return 0;
}
|
#include<stdio.h>
int main()
{
char s[200007],t[200007];
int m=0,sum=0;
scanf("%s%s",&s,&t);
int lens=strlen(s);
int lent=strlen(t);
for(int i=lens-1,j=lent-1;i>=0&&j>=0;i--,j--)
{
if(s[i]==t[j])
{
m++;
}
else{
break;
}
}
if(lent-m>=0)
{
sum+=(lent-m);
}
else
{
sum+=lent;
}
if(lens-m>=0)
{
sum+=(lens-m);
}
else{
sum+=lens;
}
printf("%d",sum);
}
|
#include<stdio.h>
int main()
{
char s[200001]={'\0'},t[200001]={'\0'};
int n,m;
scanf("%s%s",s,t);
n=strlen(s);
m=strlen(t);
if(n!=m)
{
if(n>m)
{
while(s[n-1]==t[m-1]&&m>=0)
{
n--;
m--;
}
printf("%d",n+m);
}
else
{
while(s[n-1]==t[m-1]&&n>=0)
{
n--;
m--;
}
printf("%d",n+m);
}
}
else
{
if(strcmp(s,t)==0)
printf("%d",0);
else
{
while(s[n-1]==t[m-1]&&n>=0)
{
n--;
m--;
}
printf("%d",n+m);
}}
return 0;
} |
#include<stdio.h>
int main()
{
char a[200001]={0,}, b[200001]={0,};
int k, j;
int ans;
scanf("%s", a);
scanf("%s", b);
for(int i=0; a[i]; i++) k=i+1;
for(int i=0; b[i]; i++) j=i+1;
if(k>=j){
ans=k-j;
for(int i=0; i<j; i++){
a[i]=a[ans+i];
}
for(int i=j-1; i>=0; i--){
if(a[i]!=b[i]){
ans=ans+2*i+2;
break;
}
}
}
else if(k<j){
ans=j-k;
for(int i=0; i<k; i++){
b[i]=b[ans+i];
}
for(int i=k-1; i>=0; i--){
if(a[i]!=b[i]){
ans=ans+2*i+2;
break;
}
}
}
printf("%d", ans);
} |
#include<stdio.h>
#include<string.h>
int main()
{
char s[1000000],t[1000000];
gets(s);
gets(t);
int l1=0,l2=0,t1,x,y,count=0,min;
l1=strlen(s);
l2=strlen(t);
x=l1-1;
y=l2-1;
if(l1<=t1)
{
t1=l1;
}
else
{
t1=l2;
}
for(int i=0;i<t1;i++)
{
if(s[x]==t[y])
{
count++;
x--;
y--;
}
else
{
break;
}
}
min=(l1-count)+(l2-count);
printf("%d",min);
return 0;
}
|
#include <stdio.h>
#include <ctype.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
/*โโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโ
โโโโโโโโโโโโโโโโโโโโโ*/
char s1[200005], s2[200005], a;
int i, j, len1, len2, sum;
int main(){
scanf("%s%s", s1, s2);
len1 = strlen(s1) - 1;
len2 = strlen(s2) - 1;
sum = len1 + len2 + 2;
int cnt = 0;
for(; len1 >= 0 && len2 >= 0; len1--, len2--){
if(s1[len1] == s2[len2]){cnt++;}
else{break;}
}
printf("%d", sum - 2*cnt);
} |
#include <stdio.h>
#include <ctype.h>
const int M = 200002;
int main(){
int i,j,k=0,ls,lt;
char s[M],t[M],c;
i=0;
while(isalpha(c=getchar())){
s[i]=c;
i++;
}
ls = i;
i=0;
while(isalpha(c=getchar())){
t[i]=c;
i++;
}
lt = i;
//printf("%s\n%s\n",s,t);
if(lt==0 || ls==0){
printf("%i",ls+lt);
}
else{
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,flag=0,min;
scanf("%s%s",st,s);
a=strlen(st);
b=strlen(s);
min=a;
if(min>b)
{
flag=1;
min=b;
}
if(flag=1)
{
for(i=b-1,j=a-1;i>=0;i--,j--)
{
if(s[i]==st[j])
count++;
else
break;
}
printf("%d\n",a+b-(2*count));
}
else
{
for(i=b-1,j=a-1;j>=0;i--,j--)
{
if(s[i]==st[j])
count++;
else
break;
}
printf("%d\n",a+b-(2*count));
}
}
|
#include<stdio.h>
#include<string.h>
int main()
{
char str[200001];
scanf("%s",str);
int len=strlen(str);
char str1[200001];
scanf("%s",str1);
int len1=strlen(str1);
if(len<=len1)
{
int i=0;
for(i=0; i<len; i++)
{
if(str[len-1-i]!=str1[len1-1-i])
break;
}
int same=i;
printf("%d",len+len1-2*same);
}
else
{
int i=0;
for(i=0; i<len; i++)
{
if(str[len-1-i]!=str1[len1-i-1])
break;
}
int same=i;
printf("%d",len+len1-2*same);
}
} |
#include <stdio.h>
#include <string.h>
char s[200010],ss[200010],t;
int main ()
{
int i,j,u,cum,e=0;
scanf("%s",s);
getchar();
scanf("%s",ss);
int l1=strlen(s),l2=strlen(ss);
int sum=l1+l2;
if(s[l1-1]!=ss[l2-1]) printf("%d",sum);
else
{
int min=l1<l2?l1:l2;
for(i=0; i<=min; i++)
{
if(s[l1-1-i]!=ss[l2-1-i])
{
break;
}
e++;
}
if(i>min)
printf("0");
else
{
cum=l1+l2-2*e;
printf("%d",cum);
}
}
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <stdbool.h>
#include <string.h>
int main()
{
char* A = malloc(sizeof(char) * 200005);
char* B = malloc(sizeof(char) * 200005);
scanf("%s %s", A, B);
int length_A = strlen(A), length_B = strlen(B), totalamt = length_A + length_B;
for(int index_A = length_A - 1, index_B = length_B - 1; index_A >= 0 && index_B >= 0;)
{
if(A[index_A] != B[index_B])
{
break;
}
else
{
index_A--;
index_B--;
totalamt -= 2;
}
}
printf("%i", totalamt);
free(A);
free(B);
} |
#include<stdio.h>
#include<string.h>
int main()
{ char s[2000000],t[2000000];
gets(s);
gets(t);
int a,b,cnt=0,i,k,j,c;
a=strlen(s);
b=strlen(t);
k=b-1;
j=a-1;
if(a<b)
{ for(i=a-1;i>=0;i--)
{ if(s[i]==t[k])
{ cnt=cnt+1;
k--;
}
else
{ break;}
}
}
else
{ for(i=b-1;i>=0;i--)
{ if(t[i]==s[j])
{ cnt=cnt+1;
j--;
}
else
{ break;}
}
}
c=a+b-2*cnt;
printf("%d",c);
}
|
#include<stdio.h>
#include<string.h>
int main(int argc, char const *argv[])
{
char a[1000001],b[1000001];
int l1,l2,i,r,c=0;
gets(a);
gets(b);
l1=strlen(a);
l2= strlen(b);
if(a[l1-1]!=b[l2-1]) r=l1+l2;
else
{
c++;
for(i=2;l1-i>=0&&l2-i>=0;i++)
{
if (a[l1-i]==b[l2-i]) {
c++;
}
else
{
break;
}
}
r=l1+l2-(2*c);
}
printf("%d\n",r);
return 0;
}
|
/*
* check to see if the rhs of both strings match
* if so, count the number of pairs that match
* subtract from the original lengths and add - result
*/
#include <stdio.h>
#include <string.h>
int main()
{
char s1[200000], s2[200000];
int n, n1, n2, i, j, result;
int count = 0, lc = 0; //lc - loop count
scanf("%s", s1);
n1 = strlen(s1);
scanf("%s", s2);
n2 = strlen(s2);
if (n1 < n2)
{
n = n1;
}
else
{
n = n2;
}
for (i = n1 - 1, j= n2 - 1; lc < n; i--, j--, lc++)
{
if (s1[i] == s2[j])
{
count++;
}
else
{
break;
}
}
result = (n1 - count) + (n2 - count);
printf("%d", result);
return 0;
}
|
#include <stdio.h>
#include <string.h>
long min(long x, long y) {
if (x<=y) {
return x;
} else {
return y;
}
}
long left_delete(char *str1, char *str2, long len1, long len2) {
long lim=min(len1,len2),pos=0,count=0;
int flag=1;
while (pos<lim && flag) {
if (str1[len1-1-pos]==str2[len2-1-pos]) {
count++;
} else {
flag=0;
}
pos++;
}
return (len1+len2-2*count);
}
int main() {
char first[200001],second[200001];
scanf("%s\n%s",first,second);
int len1=strlen(first),len2=strlen(second);
printf("%ld",left_delete(first,second,len1,len2));
return 0;
} |
#include <stdio.h>
int main()
{
char ch1[200001],ch2[200001];
int i,k=0,m,l1,l2,j;
scanf("%s%s",ch1,ch2);
l1=strlen(ch1);
l2=strlen(ch2);
if(l1>l2)
{
for(i=l1-1,j=l2-1;i>=0;i--,j--)
{
if(ch1[i]==ch2[j])
{
k++;
}
else
{
m=l1-k+l2-k;
break;
}
}
}
else
for(i=l1-1,j=l2-1;j>=0;i--,j--)
{
if(ch1[i]==ch2[j])
{
k++;
}
else
{
m=l1-k+l2-k;
break;
}
}
printf("%d",m);
return 0;
}
|
#include<stdio.h>
int main()
{
char s[200001],t[200001];
int i=0,count=0,result=0,num=0,sum=0;
scanf("%s %s",&s,&t);
while(s[i]!=0)
{
count=count+1;
i=i+1;
}
i=0;
while(t[i]!=0)
{
result=result+1;
i=i+1;
}
int j=count-1,k=result-1;
while(j>=0)
{
while(k>=0)
{
if(s[j]==t[k])
{
num=num+2;
}
else
{
sum=sum+1;
}
k=k-1;
break;
}
j=j-1;
if(sum==1)
{
break;
}
}
printf("%d",(count+result)-num);
} |
#include<stdio.h>
char str1[200001],str2[200001];
int main()
{ int i,j,m=0,count=0,max;
gets(str1);
gets(str2);
int n1=strlen(str1);
int n2=strlen(str2);
if(str1[n1-1]==str2[n2-1])
{
for(i=n1-1,j=n2-1;i>=0,j>=0;i--,j--)
{
if(str1[i]==str2[j])
count++;
else
{m++;
printf("%d\n",n1-count+n2-count);
break;
}
}
if(m==0)
printf("%d\n",n1-count+n2-count);
}
else
printf("%d\n",n1+n2);
} |
#include<stdio.h>
#include<string.h>
int main()
{
char str1[200001],str2[200001];
gets(str1);
gets(str2);
int l1,l2,c=0,c1,i,j;
l1= strlen(str1);
l2= strlen(str2);
if(l2>l1)
{
for(i=l1-1, j= l2-1; i>=0; i--, j--)
{
if(str1[i] != str2[j])
{
c1= l1+ l2- 2*c;
break;
}
c++;
}
if(i== -1)
c1= l2-l1;
}
else
{
for(i=l1-1, j= l2-1; j>=0; i--, j--)
{
if(str1[i] != str2[j])
{
c1= l1+ l2- 2*c;
break;
}
c++;
}
if(j== -1)
c1= l1- l2;
}
printf("%d",c1);
}
|
#include<stdio.h>
int main()
{
unsigned long long int sl,pl,i,j,k,cnt=0,c,ans=0;
char s[1000000],p[1000000];
scanf("%s %s",s,p);
sl=strlen(s);
pl=strlen(p);
if(pl>sl)
{
c=sl;
for(i=pl-1;i>=0;i--)
{
if(p[i]==s[c-1])
{
cnt++;
c--;
}
else
{
break;
}
}
ans=strlen(s)+strlen(p)-2*cnt;
}
else
{
c=pl;
for(i=sl-1;i>=0;i--)
{
if(s[i]==p[c-1])
{
cnt++;
c--;
}
else
{
break;
}
}
ans=strlen(s)+strlen(p)-2*cnt;
}
if(strcmp(s,p)==0) printf("0");
else
printf("%I64d",ans);
}
|
#include <stdio.h>
#include <string.h>
main(){
int i, l1, l2, count=0, diff, proceed;
char name1[200010], name2[200010];
scanf("%s%s", name1, name2);
l1= strlen(name1);
l2= strlen(name2);
if(l1<=l2){
diff= l2-l1;
for(i=l1-1; i>=0; --i){
proceed= 0;
if(name1[i]== name2[i+diff]){
++count;
proceed= 1;
}
if(proceed){
}
else{
break;
}
}
}
else{
diff= l1-l2;
for(i=l2-1; i>=0; --i){
proceed= 0;
if(name1[i+diff]== name2[i]){
++count;
proceed= 1;
}
if(proceed){
}
else{
break;
}
}
}
printf("%i", l1+l2-2*count);
} |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main()
{
char s1[200001];
char s2[200001];
char s3[200001];
unsigned long long leng=0;
unsigned long long leng2=0;
scanf("%s %s", &s1, &s2);
if(strlen(s1)<strlen(s2)){
leng=(strlen(s2)-strlen(s1));
leng2 = strlen(s1);
strcpy(s3, s1);
strcpy(s1, s2);
strcpy(s2, s3);
}else if(strlen(s1)>=strlen(s2)){
leng=(strlen(s1)-strlen(s2));
leng2 = strlen(s2);
}
long long int pos=-1;
int a = 0;
for(int i=0; i<leng2; i++){
if(s1[i+leng]==s2[i]){
pos=i;
a++;
}
if(s1[i+leng]!=s2[i]){
pos=-1;
a=0;
}
}
if(a==0){
leng=leng+leng2*2;
}else{
leng=(leng2-a)*2+leng;
}
printf("%llu", leng);
return 0;
}
|
#include<stdio.h>
#include<string.h>
char a[1000000],b[1000000],k[1000000],t[1000000];
int main(){
int i;
scanf("%s%s",a,b);
if(strlen(a)==1 && strlen(b)==1){
if(a[0]==b[0])
printf("0\n");
else printf("2\n");
}
else if(strlen(a)==strlen(b)){
int q=0;
for(i=strlen(a)-1;i>=0;i--){
if(a[i]==b[i])
q++;
else break;
}
printf("%d\n",2*strlen(a)-2*q);
}
else{
if(strlen(a)>strlen(b)){
strcpy(k,a);
strcpy(t,b);
}
else{
strcpy(k,b);
strcpy(t,a);
}
//if(k[0]==t[0])
//printf("%c %c %c %c\n",k[0],k[1],t[0],t[1]);
//printf("%s %s\n",k,t);
int q=0;
for(i=strlen(k)-1;i>=strlen(k)-strlen(t);i--){
if(k[i]==t[i-(strlen(k)-strlen(t))]){
//printf("%c %c\n",k[i],t[i-(strlen(k)-strlen(t))]);
q++;
//printf("%d\n",q);
}
else break;
}
//printf("%d\n",q);
if(q==0)printf("%d\n",strlen(k)+strlen(t));
else{
printf("%d\n",strlen(t)-q+strlen(k)-q);
}
}
}
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main(){
char stringA[200001], stringB[200001];
scanf("%s%s", stringA, stringB);
int tamA, tamB;
tamA=strlen(stringA);
tamB=strlen(stringB);
int moves=0, aux = 0, achou = 0;
if(tamA > tamB){
moves = tamA-tamB;
tamA= moves;
for(int i = 0; i < tamB; i++){
if(stringA[tamA] != stringB[i]){
moves = moves+2;
moves = moves+ aux;
aux= 0;
}else{
aux = aux+2;
}
tamA++;
}
}else if(tamB > tamA){
moves = tamB-tamA;
tamB = moves;
for(int i = 0; i < tamA; i++){
if(stringA[i] != stringB[tamB]){
moves = moves+2;
moves = moves+aux;
aux = 0;
}else{
aux = aux+2;
}
tamB++;
}
}else{
moves = 0;
for(int i = 0;i <tamA; i++){
if(stringA[i] !=stringB[i]){
moves = moves+2;
moves = moves+aux;
aux = 0;
}else{
aux = aux+2;
}
}
}
printf("%d\n", moves);
return 0;
} |
#include <stdio.h>
#include <string.h>
int main() {
char s1[200001];
char s2[200001];
scanf("%s",s1);
scanf("%s",s2);
//printf("%s^^^^%s",s1,s2);
int a,b,count=0,i;
a=strlen(s1);
b=strlen(s2);
int min=b;
if(a<b)
{
min=a;
}
for(i=0;i<min;i++)
{
if(a>b)
{
//printf("%c^^^^%c^^^^\n",s1[(a+b-min)-1-i],s2[min-1-i]);
if(s1[(a+b-min)-1-i]==s2[min-1-i])
{
count++;
}
else
{
break;
}
}
else
{
//printf("%c^^^^%c^^^^\n",s2[(a+b-min)-1-i],s1[min-1-i]);
if(s1[min-1-i]==s2[a+b-min-1-i])
{
count++;
}
else
{
break;
}
}
}
// printf("%d^^^",count);
printf("%d\n",a+b-count-count);
//code
return 0;
} |
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int main(void)
{
int i,j,k,l,length,length1,min,count=0;
char string[200005],string1[200005];
scanf("%s",string);
scanf("%s",string1);
length=strlen(string);
length1=strlen(string1);
min=length<length1?length:length1;
count+=(length-min)+(length1-min);
for(i=length-min,k=length1-min;string[i]!='\0';i++,k++)
{
if(string[i]==string1[k])
{
j=i+1;
l=k+1;
while(string[j]==string1[l]&&string[j]!='\0')
{
j++;
l++;
}
if(j==length)
{
printf("%d\n",count);
exit(0);
}
else
{
count+=(j-i+1)*2;
i=j;
k=l;
}
}
else
count+=2;
}
printf("%d\n",count);
return 0;
}
|
#include<stdlib.h>
#include<stdio.h>
#include<string.h>
int main (void){
int i , lenA , lenB , min , j , flag = 0 , del = 0;
char a[200001];
char b[200001];
gets(a);
gets(b);
lenA = strlen(a);
lenB = strlen(b);
//็จไบๅคๆญ้ฟ็ญ๏ผๅ่ฎก็ฎๆฌกๆฐ
if (lenA > lenB){//ไธบไปๆซๅฐพๅผๅงๅๅๅค
min = lenB;
j = lenA - lenB;//็ธๅทฎๅคๅฐไธช
for (i = min;i >= 0;i-- ){
if (a[i+j] != b[i]){flag++;break;}
//ไปๆๆซๅฐพๅผๅง็ๆฏๅฆ็ธๅ๏ผๅฐไธ็ธๅๆ็ญไธฒๅฐๅคด็ๆถๅๅๆญข
}
}else{
min = lenA;
j = lenB - lenA;
for (i = min;i >= 0;i-- ){
if (a[i] != b[i+j]){flag++;break;}
}
}
if(flag){//ๅบ็ฐไธ็ธๅๆถ
i++;
del += 2*i + j;
}else{//็ญไธฒๅฐๅคดไน็ธๅๆถ
del += j;
}
printf ("%d" ,del);
return 0;
}
|
#include<stdio.h>
#include<string.h>
int main()
{
char x[200005],y[200005];
int i,temp=-1,new1,new2,new3;
long long int mohi;
scanf("%s",x);
scanf("%s",y);
if(strcmp(x,y)==0)
printf("0\n");
else
{
new1=strlen(x);
new2=strlen(y);
if(new1>new2)
mohi=new2;
else
mohi=new1;
strrev(x);
strrev(y);
for(i=0;i<mohi;i++)
{
if(x[i]!=y[i])
{
temp=i;
break;
}
else{
new3=i+1;
}
}
if(new3==new1 || new3==new2)
{
mohi=new1-new3;
mohi+=new2-new3;
printf("%I64d\n",mohi);
}
else if(temp==-1)
{
mohi=new1+new2;
printf("%I64d\n",mohi);
}
else
{
mohi=new1-temp;
mohi+=new2-temp;
printf("%I64d\n",mohi);
}
}
}
|
#include <stdio.h>
#include<string.h>
int main(void) {
char s[200001],t[200001];
scanf("%s",s);
scanf("%s",t);
long int l1,l2;
long int count=0;
l1=strlen(s);
l2=strlen(t);
if(l1>=l2)
{
while(l2>0)
{
l2--;l1--;
if(s[l1]==t[l2])
count++;
else
break;
}
}
else
{
while(l1>0)
{
l2--;l1--;
if(s[l1]==t[l2])
count++;
else
break;
}
}
l1=strlen(s);
l2=strlen(t);
l1=l1+l2-count-count;
printf("%ld\n",l1);
// your code goes here
return 0;
}
|
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
int getString(char ** str){
char tmp = fgetc(stdin);
int len = 0;
while(tmp != '\n' && tmp != EOF){
len++;
*str = realloc(*str, sizeof(char) * len);
(*str)[len - 1] = tmp;
tmp = fgetc(stdin);
};
len++;
*str = realloc(*str, sizeof(char) * len );
(*str)[len -1] = '\0';
return len-1;
};
void reverseString(char * str){
int l = strlen(str);
for(int i = 0; i < l / 2; i++){
char tmp = str[i];
str[i] = str[l - i - 1];
str[l - i - 1] = tmp;
};
};
int main(void){
char* strA = NULL;
char* strB = NULL;
int lenA = getString(&strA);
int lenB = getString(&strB);
reverseString(strA);
reverseString(strB);
int compAmount = 0;
if(lenA <= lenB){
compAmount = lenA;
} else {
compAmount = lenB;
};
int count = 0;
for(int i = 0; i < compAmount; i++){
if(strA[i] == strB[i]){
count ++;
} else {
break;
};
};
fprintf(stdout, "%d \n", (lenA - count) + (lenB - count));
free(strA);
free(strB);
return 0;
};
|
#include <stdio.h>
long x=0, y=0, z;
struct ch{
char a;
struct ch *nextch;
}*head1=0, *head2=0;
void f1();
void f2();
main()
{
f1();
f2();
}
void f1(){
struct ch *newch, *temp;
for(int i=0; ; i++)
{
newch=(struct ch *)malloc(sizeof(struct ch));
scanf("%c", &newch->a);
if(newch->a=='\n'){
free(newch);
x=i;
break;
}
newch->nextch=0;
if(head1==0)
{
head1=newch;
}
else
{
temp=head1;
head1=newch;
head1->nextch=temp;
}
}
for(int i=0; ; i++)
{
newch=(struct ch *)malloc(sizeof(struct ch));
scanf("%c", &newch->a);
if(newch->a=='\n'){
free(newch);
y=i;
break;
}
newch->nextch=0;
if(head2==0)
{
head2=newch;
}
else
{
temp=head2;
head2=newch;
head2->nextch=temp;
}
}
}
void f2(){
struct ch *temp1=head1, *temp2=head2;
for(int i=0; ;i++)
{
if(temp1==0 || temp2==0)
{
z=i*2;
break;
}
else if(temp1->a==temp2->a)
{
temp1=temp1->nextch;
temp2=temp2->nextch;
}
else
{
z=i*2;
break;
}
}
printf("%d", (x+y)-z);
} |
#include <stdio.h>
#include <string.h>
int sub ( char aa, char bb )
{
if (aa==bb)
return 1;
else
return 0;
}
int main(){
char ara1[200002],ara2[200002];
//while(1){
gets(ara1);
gets(ara2);
int len1 = strlen(ara1);
int len2 = strlen(ara2);
int count=0,one,two,i,j,final;
one = len1 - len2;
if(len1>len2){
for(i=len1-1,j=len2-1;i>= one;i--,j--){
if(ara1[i] != ara2[j]){
break;}
else
{count = count+1;}
}
final = len2 - count;
printf("%d\n",(one+(final*2)));
}
else if(len1 == len2)
{
for(i=len1-1;i>= 0;i--){
if(ara1[i] != ara2[i]){
break;}
else
{count = count+1;}
}
printf("%d\n",2*(len1 - count));
}
else{
two = len1;
len1 = len2;
len2 =two;
one = len1 - len2;
for(i=len1-1,j=len2-1;i>= one;i--,j--){
if(ara2[i] != ara1[j]){
break;}
else
{count = count+1;}
}
final = len2 - count;
printf("%d\n",(one+(final*2)));
}
}
|
#include "stdio.h"
#include "stdlib.h"
#include "string.h"
char str1[200002];
char str2[200002];
void revString(char* str, int len);
int main() {
int i;
int len1, len2;
int counter;
scanf("%s\n", str1);
revString(str1, strlen(str1));
scanf("%s\n", str2);
revString(str2, strlen(str2));
counter = 0;
len1 = strlen(str1);
len2 = strlen(str2);
if (len1 > len2) {
for (i = 0; i < len1; i++) {
if (str1[i] != str2[i])
break;
}
} else {
for (i = 0; i < len2; i++) {
if (str1[i] != str2[i])
break;
}
}
counter += len1 - i + len2 - i;
/*
if (len1 > len2) {
while (len1 > len2) {
str1[len1 - 1] = '\0';
len1--;
counter++;
}
} else if (len2 > len1) {
while (len2 > len1) {
str2[len2 - 1] = '\0';
len2--;
counter++;
}
}
while (strcmp(str1, str2) != 0) {
if (len2 > len1) {
str2[len2 - 1] = '\0';
len2--;
} else {
str1[len1 - 1] = '\0';
len1--;
}
counter++;
}
*/
printf("%d\n", counter);
return 0;
}
void revString(char* str, int len) {
int i;
char aux;
for (i = 0; i < len / 2; i++) {
aux = str[i];
str[i] = str[len - i - 1];
str[len - i - 1] = aux;
}
}
|
#include<stdio.h>
#include<string.h>
int main()
{
char s[200005],t[200005];
scanf("%s",s);
scanf("%s",t);
long long int ps = strlen(s)-1;
long long int pt = strlen(t)-1;
while(s[ps]==t[pt] && (ps>=0) && (pt>=0))
{
ps--;
pt--;
}
printf("%lld\n",ps+pt+2);
return 0;
}
/*
โJudgement Protocol
Test: #1, time: 15 ms., memory: 384 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
test
west
Output
2
Answer
2
Checker Log
ok answer is '2'
Test: #2, time: 30 ms., memory: 384 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
codeforces
yes
Output
9
Answer
9
Checker Log
ok answer is '9'
Test: #3, time: 0 ms., memory: 384 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
test
yes
Output
7
Answer
7
Checker Log
ok answer is '7'
Test: #4, time: 15 ms., memory: 380 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
b
ab
Output
1
Answer
1
Checker Log
ok answer is '1'
Test: #5, time: 15 ms., memory: 384 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
z
z
Output
0
Answer
0
Checker Log
ok answer is '0'
Test: #6, time: 0 ms., memory: 384 KB, exit code: 0, checker exit code: 0, verdict: OK
Input
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...
Output
399991
Answer
399991
Checker Log
ok answer is '399991'
Test: #7, time: 31 ms., memory: 380 KB, exit code: 0, checker exit code: 1, verdict: WRONG_ANSWER
Input
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...
Output
200000
Answer
0
Checker Log
wrong answer expected '0', found '200000'
*/
|
#include <stdio.h>
#include <stdlib.h>
#define M 994009
#define N 222222
typedef struct _list
{
int val, id;
struct _list *next;
} list;
int n, inp[N], power[31], ans, i, j;
list *table[M];
void add(int val, int id)
{
list *ptr=(list *) malloc(sizeof(list));
ptr->val=val;
ptr->id=id;
ptr->next=table[val%M];
table[val%M]=ptr;
}
int find(int val, int id)
{
list *ptr=table[val%M];
while (ptr)
{
if ((ptr->val==val)&&(ptr->id!=id)) return 1;
ptr=ptr->next;
}
return 0;
}
int main()
{
for (i=1, j=0; j<31; j++, i<<=1) power[j]=i;
scanf("%d", &n);
for (i=1; i<=n; i++) {scanf("%d", &inp[i]); add(inp[i], i);}
for (i=1; i<=n; i++)
{
ans++;
for (j=30; j>=0; j--)
{
if (power[j]<=inp[i]) break;
if (find(power[j]-inp[i], i)) {ans--; break;}
}
}
printf("%d", ans);
}
|
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define N 120000
#define HASHSIZE 2001
int a[N + 1];
int p_[31];
struct info{
struct info *next;
int val;
int c;
} *m[HASHSIZE];
int hash (int x) {
return (x + 4889246639 + 31 * x) % HASHSIZE;
}
struct info *find (int x) {
int h;
struct info *p;
h = hash (x);
for (p = m[h]; p != NULL; p = p->next) {
if ( p->val == x ) {
return p;
}
}
return NULL;
}
void update (int x) {
int h;
struct info *p;
p = find (x);
if (p == NULL) {
p = (struct info *) malloc (sizeof *p);
p->val = x;
p->c = 0;
h = hash (x);
p->next = m[h];
m[h] = p;
}
p->c += 1;
}
void pre () {
int i;
for (i = 0; i < 31; i++) {
p_[i] = pow (2, i);
}
}
int main () {
pre ();
int n, i, j, f, t, cnt;
struct info *p;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
update ( a[i] );
}
cnt = 0;
for (i = 0; i < n; i++) {
f = 0;
for (j = 0; j < 31; j++) {
t = p_[j] - a[i];
p = find (t);
if ( p != NULL && (p->c >= 2 || (p->c == 1 && t != a[i])) ) {
f = 1;
break;
}
}
cnt += f;
}
printf("%d\n", n - cnt);
} |
#include<stdio.h>
#include<math.h>
#include<stdlib.h>
#include<stdbool.h>
void mergesort(long long int a[], long long int i, long long int j);
long long int binsrch(long long int a[],long long int l,long long r,long long x);
void merge(long long int a[], long long int i, long long int mid, long long int j);
long long int n;
int main()
{
long long int i,j,count,twos[31],val,max,rem=0,res;
bool flag;
scanf("%lld",&n);
long long int a[n];
for(i=0;i<n;i++)
scanf("%lld",a+i);
for(i=0;i<31;i++)
twos[i]=pow(2,i);
mergesort(a, 0, n - 1);
/* for(i=0;i<n;i++)
printf("%d ",a[i]);
for(i=0;i<31;i++)
printf("%lld ",twos[i]);
printf("\n");*/
max=a[n-1];
for(i=0;i<n;i++)
{
val=a[i];
count=0;
if(i>0 && a[i]==a[i-1])
{
if(flag==false)
rem++;
continue;
}
while(val>=twos[count] && count<31)
count++;
while(count<31 && (twos[count]-val)<=max) // go upto diference is maximum of array or 2^30
{
res=binsrch(a,0,n-1,(twos[count]-val));
if(res!=-1)
{
if((res==i && (res<n-1 && a[res+1]==val)||a[res-1]==val)) // checking for more than one occurrence of val
{
flag=true;
break;
}
else if(res!=i)
{
flag=true;
break;
}
}
count++;
}
if((twos[count]-val)>max)
{
flag=false;
rem++;
}
}
printf("%lld",rem);
return 0;
}
long long int binsrch(long long int a[],long long int l,long long r,long long x)
{
while (l<=r)
{
long long int mid = l + (r - l)/2;
if (a[mid] == x)
return mid;
if (a[mid] > x)
r=mid-1;
else
l=mid+1;
}
return -1;
}
void mergesort(long long int a[], long long int i, long long int j)
{
long long int mid = 0;
if(i < j) {
mid = (i + j) / 2;
mergesort(a, i, mid);
mergesort(a, mid + 1, j);
merge(a, i, mid, j);
}
}
void merge(long long int a[], long long int i, long long int mid, long long int j)
{
long long int temp[n];
long long int l = i;
long long int r = j;
long long int m = mid + 1;
long long int k = l;
while(l <= mid && m <= r) {
if(a[l] <= a[m]) {
temp[k++] = a[l++];
}
else {
temp[k++] = a[m++];
}
}
while(l <= mid)
temp[k++] = a[l++];
while(m <= r) {
temp[k++] = a[m++];
}
for(long long int i1 = i; i1 <= j; i1++) {
a[i1] = temp[i1];
}
} |
#include <stdio.h>
char a[200001];
int main(){
scanf("%s",a);
int m=1,r=0,s=0;
for(char*p=a;*p;++p){s+=*p;if(m&1<<s%3){m=0;++r;}m|=1<<s%3;}
printf("%d",r);
} |
#include <stdio.h>
int ans,s,last,i,j;
char str[200200];
int main(){
for(scanf("%s",str),last--;str[i];i++,s=0)
for(j=i;j>last;j--){
s+=str[j]-'0';
if(!(s%3))
last=i, ans++;
}
printf("%i\n", ans);
} |
#include<stdio.h>
#include<string.h>
const int n = 200000;
int main()
{
char a[n];
scanf("%s",&a);
int d=strlen(a);
int i;
int ans=0,sum=0,nu=0,t;
for(i=0;i<d;i++)
{
t=(a[i]-'0')%3;
sum+=t;
nu++;
if(t==0||sum%3==0||nu==3)
{
ans++;
nu=sum=0;
}
}
printf("%d\n",ans);
} |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX 200005
int main()
{
char s[MAX];
int i, sum = 0, m = 0;
long long unsigned int cuts = 0;
scanf("%s", s);
i = strlen(s) - 1;
while (i>=0)
{
sum += s[i] - '0'; m++;
if (s[i] % 3 == 0 || sum % 3 == 0 || m == 3)
{
cuts++; m = 0;
sum = 0;
}
i--;
}
printf("%I64d", cuts);
return 0;
} |
#include<stdio.h>
#include<string.h>
int main()
{
int temp=0,count=0,n=0,l,i,y=0;
char x[200005];
scanf("%s",&x);
l=strlen(x);
for(i=0;n==0;i++){
if(x[i]=='0'&&n==0){
continue;
}else{
i--;
n=1;
}
}
for(;i<l;i++){
if(x[i]%3==0){
count++;
temp=0;
y=0;
}else{
y+=x[i];
temp++;
if(y%3==0||temp>=3){
count++;
temp=0;
y=0;
}
}
}
printf("%d\n",count);
return 0;
} |
#include <stdio.h>
#include <string.h>
#define max 200010
int zhengchu( char n[] )
{
int count = 0, sum = 0, num[5];
int i = 0, t = 0;
while( n[i] == '0' ) i++;
for( ; n[i] != '\0' ; i++ )
{
num[t++] = n[i] - '0';
sum += num[t-1];
if( num[t-1] % 3 == 0 || sum % 3 == 0 || t >= 3 )
{
count++;
t = 0;
sum = 0;
}
}
return count;
}
int main()
{
char n[max];
while( scanf("%s", n ) != EOF )
printf("%d\n", zhengchu( n ));
return 0;
}
|
#include <stdio.h>
#include <string.h>
#define N 200000
char s[N + 1];
int div3 (char *s, int p, int q) {
int i, m;
for (i = q, m = 0; i >= p; i--) {
m = ( m * 10 + s[i] - 48 ) % 3;
if(m == 0) {
return m;
}
}
return 1;
}
int main () {
int i, len, p, q, t, cnt;
scanf("%s", s);
len = strlen (s);
cnt = 0, p = q = -1;
for (i = 0; i < len; i++) {
t = (s[i] - 48) % 3;
if (t == 0) {
++cnt;
p = q = -1;
}
else {
if (p == -1) {
p = i;
}
else {
q = i;
}
if ( div3 (s, p, q) == 0 && p != -1 && q != -1) {
++cnt;
p = q = -1;
}
}
}
printf("%d\n", cnt);
} |
#include<stdio.h>
long long i,l,a,b1,b[10],ans;
char name[1000007];
int main()
{
scanf("%s",name);
l=strlen(name);
for(i=0;i<l;i++)
{
a=(name[i]-'0')%3;
if(a==0)
{
b1=0;
ans++;
b[0]=0;
b[1]=0;
b[2]=0;
}
else
{
b1=(b1+a)%3;
if(b[b1]>0 || b1==0)
{
ans++;
b1=0;
b[0]=0;
b[1]=0;
b[2]=0;
}
else
{
b[b1]++;
}
}
}
printf("%lld\n",ans);
} |
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int check(char *str, int a, int b) {
char s[b-a+2];
s[b-a + 1] = '\0';
for (int i = a; i <= b; i++) {
s[i-a] = str[i];
}
return atoi(s);
}
int main(void) {
char s[200001];
scanf("%s", s);
int len = strlen(s);
int dp[len+1];
dp[0] = 0;
for (int i = 1; i <= len; i++) {
if (s[i-1] == '0') {
dp[i] = dp[i-1]+1;
continue;
}
int max = 0;
for (int j = i; j > 0; j--) {
if (max < dp[j-1]) {
max = dp[j-1];
} else if (max > dp[j-1]) {
break;
}
if (check(s, j-1, i-1)%3 == 0) {
max++;
break;
}
}
dp[i] = max;
}
printf("%d\n", dp[len]);
}
|
#include <stdio.h>
#include <string.h>
#define N 200005
char s[N];
int dp[N][3];
int max(int x, int y) {
return x > y ? x : y;
}
int main(int argc, char* argv[]) {
int i, j, n, ans;
gets(s);
n = strlen(s);
dp[0][0] = 0;
dp[0][1] = -N;
dp[0][2] = -N;
for (i = 0; i < n; i++) {
int d = (s[i] - '0') % 3;
dp[i+1][0] = dp[i+1][1] = dp[i+1][2] = -N;
dp[i+1][d] = max(dp[i][0], max(dp[i][1], dp[i][2]));
for (j = 0; j < 3; j++) {
int nd = (d + j) % 3;
dp[i+1][nd] = max(dp[i+1][nd], dp[i][j]);
}
if (dp[i+1][0] >= 0)
dp[i+1][0]++;
}
ans = max(dp[n][0], max(dp[n][1], dp[n][2]));
printf("%d\n", ans);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#define MAX 200200
int n,m,A[MAX],O[MAX<<1],*occ=&O[MAX],tmp,mid,sum,i,j;
long long ans;
int main(){
for(scanf("%i%i",&n,&m);i<n;i++){
scanf("%i", &tmp);
if(tmp==m) mid=i;
A[i]=tmp>m?1:-1;
}
for(i=mid+1;i<n;i++)
sum+=A[i], occ[sum]++;
for(sum=0,i=mid;i>=0;i--){
sum+=A[i];
ans+= occ[-sum] + occ[-sum-1];
if(sum==-1 || !sum) ans++;
}
printf("%I64d\n", ans);
} |
#include<stdio.h>
#include<string.h>
#include<ctype.h>
typedef long long ll;
#define P (114514 << 1)
#define maxn (114514 << 2)
ll rd() {
ll k = 0, f = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == '-')f = -1;
c = getchar();
}
while (isdigit(c)) {
k = (k << 1) + (k << 3) + c - 48;
c = getchar();
}
return f > 0 ? k : -k;
}
void wr(ll x) {
if (x < 0) putchar('-'), x = -x;
if (x > 9)wr(x / 10);
putchar(x % 10 + '0');
}
ll n, k, pos;
ll a[maxn], s[maxn], cnt[maxn];
ll solve(ll p) {
s[0] = 0;
ll ret = 0, i = 0;
memset(cnt, 0, sizeof(cnt));
for (i = 1; i <= n; ++i) {
if (i == p) s[i] = s[i - 1];
else if (a[i] < a[p] || (a[i] == a[p] && i < p)) s[i] = s[i - 1] - 1;
else s[i] = s[i - 1] + 1;
}
cnt[P] = 1;
for (i = 1; i < p; ++i) ++cnt[s[i] + P];
for (i = p; i <= n; ++i) ret += cnt[s[i] + P] + cnt[s[i] + P - 1];
return ret;
}
int main() {
n = rd(), k = rd();
ll i = 0;
for (i = 1; i <= n; ++i) { a[i] = rd(); if (a[i] == k) pos = i; }
wr(solve(pos));
}
|
int n,x;main(){scanf("%d",&n);while(n--){scanf("%d",&x);printf("%d ",(x&1?x:--x));}} |
#include<stdio.h>
int n,m,a,b;
main()
{
scanf("%d",&n);
for(;n--;)
{
scanf("%d",&a);
printf("%d ",++a/2*2-1);
}
} |
main(){
int n,x ;
scanf("%d",&n);
for(int i=1 ; i<=n ; i++){
scanf("%d",&x);
printf("%d ",(x%2==1)? x : x-1);}}
|
#include<stdio.h>
int main(){
unsigned n,k;
scanf("%u", &n);
for(;n;n--){
scanf("%u", &k);
printf("%u ", k%2==0?k-1:k);
}
return 0;
}
|
#include<stdio.h>
int main() {
int n, pos;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &pos);
if (pos % 2 == 0)
pos -= 1;
printf("%d ", pos);
}
puts("");
} |
#include <stdio.h>
int A[1111],n,i;
int main(){
for(scanf("%i",&n);i<n;i++)
scanf("%i",&A[i]);
for(i=0;i<n;i++)
if(A[i]%2) A[i]++;
for(i=0;i<n;i++)
printf("%i ",--A[i]);
}
|
#include<stdio.h>
int main()
{ unsigned int t,n;
scanf("%u",&t);
for(;t>0;t--)
{
scanf("%u",&n);
if(!(n&1))
{
n-=1;
}
printf("%u ",n);
}
}
|
#include <stdio.h>
int main()
{
int i;
scanf("%d",&i);
int number[i];
int j;
for(j=0;j<i;j++)
{
scanf("%d",&number[j]);
if(number[j]%2==0&&number[j]!=0)
number[j]--;
}
for(j=0;j<i;j++)
{
if(j!=0)
printf(" ");
printf("%d",number[j]);
}
return 0;
} |
#include <stdio.h>
main()
{
int n;
scanf("%d",&n);
const int maxn = 1e3 +7;
long x[maxn];
int i=1;
while (i<=n)
{
scanf("%ld",&x[i]);
if (x[i]%2==0)
x[i]--;
i++;
}
i=1;
while (i<=n)
{
if (i!=n)
printf("%d ",x[i]);
else
printf("%d\n",x[i]);
i++;
}
}
|
#include<stdio.h>
#include<math.h>
int main()
{
int n;
scanf("%d",&n);
double x[n];
int y;
for(y=0;y<n;y++)
{
scanf("%lf",&x[y]);
}
int z,max;
for(y=0;y<n;y++)
{
if(fmod(x[y],2)==0)
{
x[y]--;
}
printf("%.0lf ",x[y]);
}
} |
#include <stdio.h>
int main(void)
{
unsigned short size;
scanf("%hu", &size);
for (unsigned short i = 0; i < size; ++i)
{
unsigned int integer;
scanf("%u", &integer);
if (integer % 2 == 0)
--integer;
printf("%u ", integer);
}
return 0;
} |
#include<stdio.h>
int main(void)
{
int n, i;
long int max = 0;
scanf("%d", &n);
long int nums[n];
for(i=0; i < n; i++)
{
scanf("%ld", &nums[i]);
if(nums[i] > max) max = nums[i];
}
for(int i = 0; i < n; i++)
{
if(nums[i]%2 == 0) nums[i]--;
printf("%ld ", nums[i]);
}
} |
#include <stdio.h>
int main()
{
int a ;
scanf("%d",&a) ;
int ara[a] ;
for(int b=0;b<a;b++) {
scanf("%d",&ara[b]) ;
if(ara[b]%2==0) ara[b] = ara[b] - 1 ;
}
for(int c=0;c<a;c++) {
printf("%d ",ara[c]) ;
}
printf("\n") ;return 0 ;
} |
#include<stdio.h>
#include<stdlib.h>
int main()
{
int N;
scanf("%d",&N);
long long int V[N];
int I,J;
for (I=0;I<N;I++)
{
scanf("%lld",&V[I]);
}
//for( I=0;I<2;I++)
//{
// if (V[I]%2!=0)
// V[I]++;
//}
for( I=0;I<N;I++)
{
if (V[I]%2==0)
V[I]--;
}
for( I=0; I<N;I++){printf("%lld ",V[I]);}
return 0;
}
|
#include <stdio.h>
//CODED BY SAYEM MD. NAFI
int main()
{
int SIZE, N;
scanf("%d", &SIZE);
int ELEMENTS[SIZE + 1];
for(N = 0; N < SIZE; N++) {
scanf("%d", &ELEMENTS[N]);
if(ELEMENTS[N] % 2 == 0) ELEMENTS[N] -= 1;
}
for(N = 0; N < SIZE; N++) printf("%d ", ELEMENTS[N]);
return 0;
} |
#include <stdio.h>
int main()
{
int howManyNumbers;
scanf("%d", &howManyNumbers);
int gift[howManyNumbers];
// Input numbers and do the trick and print.
for (int whichNumber = 0; whichNumber < howManyNumbers; whichNumber++)
{
scanf("%d", &gift[whichNumber]);
if (gift[whichNumber] % 2 == 0)
{
gift[whichNumber]--;
}
printf("%d ", gift[whichNumber]);
}
return 0;
} |