[challenge] check if 11 is a Divisor of an input number without modulo

Question

For this dont use modulo operator but use following rule: +first digit - second digit + third digit...
result should be 0 or devisible by 11

Eg 187 : 7-8+1 = 0

use your preferred weapon and have fun

Answer 1

here is mine ☺
https://code.sololearn.com/crTPF7H2KkEl/?ref=app

Answer 2

https://code.sololearn.com/c8yJskT1Y3jC/?ref=app

Answer 3

https://code.sololearn.com/c87PgGBHIK48/?ref=app

Answer 4

Cool
https://code.sololearn.com/cwoRC2v4lKGv/?ref=app

Answer 5

#python is cool.
#another method..
#without using %
print('False' if int(str(int(input())/11).split('.')[-1])>0 else 'True')

Answer 6

https://code.sololearn.com/ccDWkWvwGEIg/?ref=app

ver2

Answer 7

@younes, I've edited my code to cater for this condition.

Answer 8

@Louis yep!

Answer 9

@younes ok... repeat the procedure

Answer 10

my try
https://code.sololearn.com/c9MEQRwUmzO3/?ref=app

Answer 11

My try:

https://code.sololearn.com/W8h14w1xn6wV/?ref=app

Answer 12

print(sum((-1)**k)*(n//10**k)%10 for k in range(99) if n<10**k))

Answer 13

https://code.sololearn.com/c1GBOd9jP9OU/?ref=app

Answer 14

I checked a few random multiples of 11 just to see, and in the case of 11*46=506, the result is interestingly 11 :D
it would've been a 4 - 10 + 6 if it weren't for the decimal base ^^

Answer 15

I hope I created the Simplest Version of all,
Created Using Python !

https://code.sololearn.com/cC0I1p8kYD7V/?ref=app