1 like 1 dislike
6k views

The 13-digit International Standard Book Number (ISBN) is a unique code that identifies a book commercially. The last digit is a check digit used for error detection. To calculate its value, each digit of the first twelve digits is alternately multiplied, from left to right, by 1 or 3. The products are summed up and divided by 10. The check digit is the remainder of the division subtracted from 10. If it is 10, it becomes 0. 

ISBN檢查號的計算方法: 前12個數字,奇數項 乘以 1 , 偶數項乘以 3

For example, assume that the first twelve digits are 978960931961.  

假設號碼前12位是978960931961

(a) (9*1 + 7*3 + 8*1 + 9*3 + 6*1 + 0*3 + 9*1 + 3*3 + 1*1 + 9*3 + 6*1 + 1*3) = 126 

(b) The check digit = 10 – (126 % 10) = 10 – 6 = 4  

檢查號 = 10 - 餘數 = 10 – (126 % 10) = 10 – 6 = 4  

So the valid ISBN is: 9789609319614

Write a program that reads a 13-digit ISBN and checks the last digit to see if it is valid or not. 

寫一個輸入13位ISBN號碼 判斷最後一個數字是否檢查碼即可

#Try 1:

Input:

9789609319614

Output: 

Valid ISBN

 

#Try 2:

Input:

9781482214505

Output: 

Valid ISBN

 

#Try 3:

Input:

9780132936493

Output: 

Invalid ISBN

 

[Exam] asked in Midterm by (12.1k points)
ID: 32706 - Available when: 2017-11-15 14:10 - Due to: Unlimited
| 6k views

49 Answers

0 like 0 dislike
Hidden content!
#include<stdio.h>

int main() {
* **** * * **** * a[13],i,sum=0;
* * ** ** ********** * * * *** {
*** *** ** * * * ** ** * ** * * **** ** * * * ***
* ** ****** *** ** * * ** * * * * * ***
**** * *
* * *** * * * * *** ** * ** {
** * **** **** * ** * ** ******** * * ******
**** * * ***** ******* * * * ** * * * *** **
    }
** ****** ** ***** * ***** ** * * {
* *** * *** ** * ** ** * * ** ** *** * * * * *
* ** * * * * * * *** ***** * *
    }
* **** *** *** ** ** ** * * *** {
*** * * ** * * ** ** * **** ** * ********* *** ***** ISBN");
* * *** ** ***** ***
*** * * * * ** ** * * {
* **** ** * ** **** ** ** *** * ** * * ISBN");
    }
}
answered by (-120 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
0 like 0 dislike
Hidden content!
#include <stdio.h>
int main()
{
   int *** *** * **** * * ** *

*** ** ** ** **** * ** * * %1d %1d %1d %1d %1d %1d %1d %1d %1d %1d %1d * * * ** *** *** *** * * * * * ** * * *** ** * * * * *** *** ** *** * ** * * ;

* **** * *** * * * * * ** * * * * ***** * * *** * * ** ** * ***

* *** * ** * ****** ** **
* * * ** ** * ** ** *** ***** * ISBN");}
* ** * * *** * *** * *
* * * * ** ** * * ***** * ***** ** ***** ** * ** ISBN");
** * * **** * *** ***
* ** * * * *** *** ***** ** 0;
}
answered by (-167 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
0 like 0 dislike
Hidden content!
#include <stdio.h>
int main()
{
** * **** * *** * * **** * * ****

* ******* *** * **** * %1d %1d %1d %1d %1d %1d %1d %1d %1d %1d %1d * * * * **** ** **** *** *** ** *** ** ** * **** * ** * ** * * *** * * *** * ;

***** * ** * * **** ** *** ** ** * ** * ** *** *** * ** ***** * ** ***

** ** ** ** * *** ** *
* **** ** *** ** * **** ***** *** ** ISBN\n");}
**** * * ** ** *** * * *
* * * *** * *** **** *** ** * ** * *** * ** ** * ** ISBN\n");
* * * * * * ** ** ****
*** ** *** * ** ** * * ** * 0;

}
answered by (-167 points)
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Wrong output
Case 3: Wrong output
0 like 0 dislike
Hidden content!
#include <stdio.h>
#include <stdlib.h>

int main()
{
* *** * * * *** * a,b,c,d,e,f,g,h,i,j,k,l,m,sum=0,check=0;
* ** ** ** * ** ** * * *** * * *** * **** *** * ** **** ** * * * * * ** ** * *** * ** * ** ********* ******** *** **** * ** ***** ***

* * * * * * * * * * ***** * ** *** **
* **** * *** ** ** * * * * ** *

* * **** *** * **** * *** ***** **** *
***** * ** ** *** * ***
***** * *** ** ** * * ** * * **** ***** * * * ** * * * ***** ISBN");
*** * * ** * ** ** * * ***

** *** * ******* *** * * *
    {
** ** **** * ** * ** ** * ***** * * * * ISBN");
** *** **** * * * * ** ***** **

* * * *** * 0;
}
answered by (-127 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
0 like 0 dislike
Hidden content!
* ** * * * * *** * *
int main()
{
* * * * ***** *** * * a,b,c,d,e,f,g,h,i,j,k,l,m,sum;
********* ** * **** ** * * ** * * ****** ** * ** ** ********** * * * ** ** * * * * *** * * ** * ******* * * * ** ** *** * *** ** ******** * ** *
*** * ** *** *** * * * * * (a*1 + b*3 + c*1 + d*3 + e*1 + f*3 + g*1 + h*3 + i*1 + j*3 + k*1 + l*3);
* ***** **** * * * 978960931961
* * ** **** *** **** *** ** * * *
* ***** * ** *** * *** ****
*** *** ** *** * *** **
** * ****** * ** *** * * * ** * ****** **** ** * ** ISBN");
** * ****** ** * * * ** **
*** * *** **** * *
**** * ** *** * * * *
**** * ****** * ** * * ** * ***** ****** * * * * ISBN");
* ** * ** *** ** *

//9781482214505
//9780132936493
}
answered by (-329 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
0 like 0 dislike
Hidden content!
#include<stdio.h>
int main (void)
{
* * * ** ** tab[13],s,i,m;
** *** **** ****** ***** *** (i=0;i<=12;i++)
**** * ** *** ** **** *
****** **** **** ** **** * *** * *** * *** * * * **** * * *****
** ** * * * *
* *** * *** * * ** ** * * * **** * *** **** ** ** ** ** * * * * * ** * ** ** *
* ***** * * * * * * * ***
** *** ** * * (m==tab[12])
    {
* * * ** * * * * * ******* * *** ****** ** * * ISBN");
*** * * ** * * * **
**** **** * * **
* ** * * * *** * * * * * **** ***** ** ** ** ISBN");}
*** **** **** **** * * 0;
}
answered by (-168 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
0 like 0 dislike
Hidden content!
#include<stdio.h>
int main (void)
{
** *** ** * ***** ** * ** * ********
* * * ** * * * ** * * **** * ** *** ** *** *** ** * * * *** ** **** * ***** * ** **** ** *** ** * * * **** ** **** ** * ****** *
* ****** * * *** **** * ** * * * * * **** ** ** *
* * * *** ** * * ** ** (10-(b%10)==a13){
* * **** * * *** *** *** *** * * * * * ("Valid ISBN");
***** ** * *** * * ***
*** * * ******* * * * ** * {
* * ** *** ** **** * **** ** ** * * ** * *** ** ("Invalid ISBN");
* * * * * **** * *** ****
}
answered by (-204 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
0 like 0 dislike
Hidden content!
#include <stdio.h>
#include <stdlib.h>

int main()
{
    int ** ** * ** * ** *** *****

* * * * * ** * * *** **** ** ** ** * *** * * * ** ** *** ** ****** * ** * * * * ***** * ** * ** ***** ** * * *** * *

*** ***** ** ** * = *** ** * ** * ** ******* *

* * * * * ** * * ** ** * *
*** **** * * ** ** ***** ** ** *** ** * *** * *** ** ** ** * * * * * * * ***** ISBN");
** ** ****** ** * *** * *
* *** * ** * * ** * * ******* * *** * * * *** * *** * * ** *** ** * ISBN");

** *** * * * ** * 0;
}
answered by (-168 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
0 like 0 dislike
Hidden content!
* ** ** ******* *

int main()
{
int *** ** * * **
* * **** * %1d %1d %1d %1d %1d %1d %1d %1d %1d %1d %1d *** * * *** ******* ** * * * * *** ******* ** * ** **** * ** * * * * ** ****** ***** ** **
*** ** * * * * ***
*** *
***
* ** ** ***** *
else
* * * * *** ** *
** 0;
}
answered by (-66 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
0 like 0 dislike
Hidden content!
******** * *
int **** ** * ** ** * *** * *
int main()
{
***** * ** * ** ** ** * **** * ** * * *** * * *** *** ****** ** ** * ** * ** * ** *** * ** **** *** * *
* ** ** * * * ** *
c=10-(b%10);
if(c==a13)
{
* **** ** * ** * * *** ** ISBN");
}else
{
*** * ** * ** * * * ISBN");
}

}
answered by (-336 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:172.69.59.26
©2016-2025

Related questions

0 like 0 dislike
26 answers
[Exam] asked Dec 9, 2017 in Midterm by thopd (12.1k points)
ID: 36751 - Available when: 2017-11-15 14:10 - Due to: Unlimited
| 3.9k views
2 like 0 dislike
77 answers
[Exercise] Coding (C) - asked Oct 19, 2017 in Chapter 5: Selection Statements by thopd (12.1k points)
ID: 27667 - Available when: Unlimited - Due to: Unlimited
| 10.2k views
12,783 questions
183,442 answers
172,219 comments
4,824 users