Book of Potion making

Problem:-

Harry wants to find Voldemort's potion making book but he is confused about how to get it.
The book has a special ISBN(International Standard Book Number) which is  unique numeric book identifier only for Voldemort's book printed on it. The ISBN is based upon a 10-digit code. The ISBN is valid if:
1xdigit1 + 2xdigit2 + 3xdigit3 + 4xdigit4 + 5xdigit5 + 6xdigit6 + 7xdigit7 + 8xdigit8 + 9xdigit9 + 10xdigit10 is divisible by 11.
Help Harry to find the book!
Input:
 Input the ISBN code as a 10-digit integer.
Output:
If the ISBN is not a 10-digit integer, output the message “Illegal ISBN” and terminate the program.
If the number is 10-digit, extract the digits of the number and compute the sum as explained in the explanation.
If the sum is divisible by 11, output the message, “Legal ISBN”. If the sum is not divisible by 11, output the message, “Illegal ISBN”.

SAMPLE INPUT

 

1401601499

SAMPLE OUTPUT

 

Legal ISBN

Explanation

For an ISBN 1401601499
Sum=1×1 + 2×4 + 3×0 + 4×1 + 5×6 + 6×0 + 7×1 + 8×4 + 9×9 + 10×9 = 253 which is divisible by 11.

Time Limit:5.0 sec(s) for each input file.

Memory Limit:256 MB

Source Limit:1024 KB

solution:-

#include<stdio.h>

void main()

{

int isbn,sum=0,s=0,r,n,i=1;

scanf("%d",&isbn);

n=isbn;

while(isbn!=0)

{

s=s+1;

isbn=isbn/10;

}

if(s<10)

{

printf("Illegal ISBN");

}

else

{

while(n!=0)

{

r=n%10;

sum=sum+(i*r);

n=n/10;

i++;

}

if(sum%11==0)

printf("Legal ISBN");

else

printf("Illegal ISBN");

}

}