C (clang), (削除) 264 (削除ここまで) (削除) 212 (削除ここまで) (削除) 196 (削除ここまで) 175(削除) 175 (削除ここまで) 172 bytes
l,x;main(i){char*s;gets(s);int n[i=l=strlen(s)];for(;i--;)n[i]=s[i]-48;for(i=1;i<l;i+=2;(i+=2)n[i]*=2,n[i]>9<l;n[i]>9?n[i]=n[i]/10+n[i]%10:0;for0)n[i]*=2;for(;l--;)x+=n[l];printf(x%10<1?"True":"False");}
Simply the basic way of programming the algorithm, but all whitespace is removed. All I could say is that there are a bunch of for-loops in this one.
Thanks to ceilingcat for golfing 52 bytes, another 16 bytes, and another 21 bytes, and another 3 bytes.
C (clang), (削除) 264 (削除ここまで) (削除) 212 (削除ここまで) (削除) 196 (削除ここまで) 175 bytes
l,x;main(i){char*s;gets(s);int n[i=l=strlen(s)];for(;i--;)n[i]=s[i]-48;for(i=1;i<l;i+=2)n[i]*=2,n[i]>9?n[i]=n[i]/10+n[i]%10:0;for(;l--;)x+=n[l];printf(x%10<1?"True":"False");}
Simply the basic way of programming the algorithm, but all whitespace is removed. All I could say is that there are a bunch of for-loops in this one.
Thanks to ceilingcat for golfing 52 bytes, another 16 bytes, and another 21 bytes.
C (clang), (削除) 264 (削除ここまで) (削除) 212 (削除ここまで) (削除) 196 (削除ここまで) (削除) 175 (削除ここまで) 172 bytes
l,x;main(i){char*s;gets(s);int n[i=l=strlen(s)];for(;i--;)n[i]=s[i]-48;for(;(i+=2)<l;n[i]>9?n[i]=n[i]/10+n[i]%10:0)n[i]*=2;for(;l--;)x+=n[l];printf(x%10<1?"True":"False");}
Simply the basic way of programming the algorithm, but all whitespace is removed. All I could say is that there are a bunch of for-loops in this one.
Thanks to ceilingcat for golfing 52 bytes, another 16 bytes, and another 21 bytes, and another 3 bytes.
C (clang), (削除) 264 (削除ここまで) (削除) 212 (削除ここまで) 196(削除) 196 (削除ここまで) 175 bytes
l,m[2],x;main(i){char*s;gets(s);int n[i=l=strlen(s)];for(;i--;)n[i]=s[i]-48;for(i=1;i<l;i+=2)n[i]*=2,n[i]>9?*m=n[i]n[i]=n[i]/10,m[1]=n[i]%10,n[i]=*m+m[1]10+n[i]%10:0;for(;l--;)x+=n[l];printf(x%10<1?"True":"False");}
Simply the basic way of programming the algorithm, but all whitespace is removed. All I could say is that there are a bunch of for-loops in this one.
Thanks to ceilingcat for golfing 52 bytes and, another 16 bytes, and another 21 bytes.
C (clang), (削除) 264 (削除ここまで) (削除) 212 (削除ここまで) 196 bytes
l,m[2],x;main(i){char*s;gets(s);int n[i=l=strlen(s)];for(;i--;)n[i]=s[i]-48;for(i=1;i<l;i+=2)n[i]*=2,n[i]>9?*m=n[i]/10,m[1]=n[i]%10,n[i]=*m+m[1]:0;for(;l--;)x+=n[l];printf(x%10<1?"True":"False");}
Simply the basic way of programming the algorithm, but all whitespace is removed. All I could say is that there are a bunch of for-loops in this one.
Thanks to ceilingcat for golfing 52 bytes and another 16 bytes.
C (clang), (削除) 264 (削除ここまで) (削除) 212 (削除ここまで) (削除) 196 (削除ここまで) 175 bytes
l,x;main(i){char*s;gets(s);int n[i=l=strlen(s)];for(;i--;)n[i]=s[i]-48;for(i=1;i<l;i+=2)n[i]*=2,n[i]>9?n[i]=n[i]/10+n[i]%10:0;for(;l--;)x+=n[l];printf(x%10<1?"True":"False");}
Simply the basic way of programming the algorithm, but all whitespace is removed. All I could say is that there are a bunch of for-loops in this one.
Thanks to ceilingcat for golfing 52 bytes, another 16 bytes, and another 21 bytes.
C (clang), (削除) 264 (削除ここまで) 212(削除) 212 (削除ここまで) 196 bytes
i,l,m[2],x;main(i){char *s;x=!scanfchar*s;gets("%s",s);int n[i=l=strlen(s)];for(;i--;)n[i]=s[i]-48;for(i=1;i<l;i+=2)n[i]*=2,n[i]>9?*m=n[i]/10,m[1]=n[i]%10,n[i]=*m+m[1]:0;for(i=0;i<l;;l--;)x+=n[i++];printfx+=n[l];printf(x%10<1?"True":"False");}
Simply the basic way of programming the algorithm, but all whitespace is removed. All I could say is that there are a bunch of for-loops in this one.
Thanks to ceilingcat for golfing 52 bytes and another 16 bytes.
C (clang), (削除) 264 (削除ここまで) 212 bytes
i,l,m[2],x;main(){char *s;x=!scanf("%s",s);int n[i=l=strlen(s)];for(;i--;)n[i]=s[i]-48;for(i=1;i<l;i+=2)n[i]*=2,n[i]>9?*m=n[i]/10,m[1]=n[i]%10,n[i]=*m+m[1]:0;for(i=0;i<l;)x+=n[i++];printf(x%10<1?"True":"False");}
Simply the basic way of programming the algorithm, but all whitespace is removed. All I could say is that there are a bunch of for-loops in this one.
Thanks to ceilingcat for golfing 52 bytes.
C (clang), (削除) 264 (削除ここまで) (削除) 212 (削除ここまで) 196 bytes
l,m[2],x;main(i){char*s;gets(s);int n[i=l=strlen(s)];for(;i--;)n[i]=s[i]-48;for(i=1;i<l;i+=2)n[i]*=2,n[i]>9?*m=n[i]/10,m[1]=n[i]%10,n[i]=*m+m[1]:0;for(;l--;)x+=n[l];printf(x%10<1?"True":"False");}
Simply the basic way of programming the algorithm, but all whitespace is removed. All I could say is that there are a bunch of for-loops in this one.
Thanks to ceilingcat for golfing 52 bytes and another 16 bytes.