10-19 Exercise 1: International Standard Book Number (ISBN)

2 like 0 dislike
8.5k 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

 

[Exercise] Coding (C) - asked in Chapter 5: Selection Statements by (12.1k points)
ID: 27667 - Available when: Unlimited - Due to: Unlimited
edited by | 8.5k views

77 Answers

1 like 0 dislike 
Hidden content!
#include   *   * * * *
int main(void)
{
int * * ** ****   *** **** *    ****  ,sum, check;

** ** **  *  *   ****  ** ** ** * **   ** * * *  **  *  * * ***** &i3, * *  ** *   *  ** &i6 *  * * * ** *   **  ** * * *    * ** *   * * ** * ***** **

sum *    *  *  *  ***  ** **   * ***    
 ***** ** ** *
if  **** 
 *  * * *  **
   * ***   ** * *   * *   ** ***  * ***** ***  *    * * **    ** * *** ** 

******  * *** 
else
 *     *       * *** *  ****   *   *     * * *   ***   ***  * *



return 0;
}
answered by (-304 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
commented by (4.3k points)
1 like 0 dislike 
Hidden content!
#include <stdio.h>


int main(void)

{


 *****    *     ****   *  * * ***      ** * *   **  *** * *  *  ** ** 
* *   ***** **  *   **  **** check_1,check_2;


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

*  * **  *  * ***        * *  *    ** ** * * *******  **     ****  * * * *** *****  ****    
**     * ***  * * ** * *   * *  10-(check_1%10);

* ** ***  **** ******** * (check_2 == num13)
** **  * ***** *  *****

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

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


********      *  ** * *** 0;

   }
answered by (-107 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
commented by (4.3k points)
1 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,x,y;
***** **  ** *  *   **** *    ***** *  *  ***   * *   *    *     ** *  **    *******   *      * ** * * *  *    * **   * *****     * ** **    *  ****   ** *** * * **     ** 
** **   * **  * **** *  ** * *  ** *****     *     ******  **  * * **
 *  ***  **     ***** *   ** * *   10-(x%10);

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

* * ***  ** * ***   ** ** 0;
}
answered by (-255 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include <stdio.h>


int main(void)

{


 ******  * ***   ***** * ****  * * *   *  *  **  ** **   ** * *** * **  * *    *
**   **   ** ** ***  *   *   * last_num, check_1,check_2;


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

   * * *  *   ****** * ***  ***  *      **       * * *** **      ***  **  *    *   **        ****  *
    *     *  *  *     *      10-(check_1%10);

***   **  *  ***** ** (check_2 == num13)
   ** ******  *  * * *  * 

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

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


* * *  ** ** ** ****    *** 0;

   }
answered by (-107 points)
0 0
prog.c: In function 'main':
prog.c:10:9: error: unused variable 'last_num' [-Werror=unused-variable]
     int last_num, check_1,check_2;
         ^~~~~~~~
cc1: all warnings being treated as errors
commented by (4.3k points)
1 like 0 dislike 
Hidden content!
#include   *** **** *  ** 
int   **   * * *     ** **** **  * **
int b,c;

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

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

b=b%10;

c=10-b;


if (c==a13)
*** *  ** * *  *      * ***    **  *          *  * *
else
 * **  ***** * **    **   ***      * ** ****  * *  ** ***

return 0;

}
answered by (-336 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
commented by (4.3k points)
1 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,x,y;

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

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

** ***    ****  **  ** * *    (y==m)
**   ** ****  * **  *  ** * * *  *** *  *   ***   ******** ** **** **  * 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
commented by (4.3k points)
0 like 0 dislike 
Hidden content!
#include    * * **** *   * * 
int    **     ****** *** ** * *
int b,c;

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

 ****    *     ***  *   * *  * *
***    **** * ** ***     
b=b%10;
 ***   *   *  *  ** * *****
c=10-b;
  ** * ***     * 
*** ** * ****   **       **

if (c==a13)
  **  ***  *  * ** *** *   * **   *  * *  ISBN");
else
* *     *****  *  **  ****** *  *   * ISBN");

return 0;

}
answered by (-336 points)
0 0
Case 0: Wrong output
Case 1: Wrong output
Case 2: Wrong output
Case 3: Wrong output
commented by (4.3k points)
1 like 0 dislike 
Hidden content!
#include ** * *****  * *

int main()
{
 int   * ** *   ****
  *      *   *** *  ** * *   ** ** ***  *  * ***  * **  *  *      *   ** **  ****  *   **       ****  *  **   *** ** *  *   ****    *   ****** *
*** * **  ** * *** *  * 
if (i == 10-h)
{
* **  ***** ** ***  **** * **  ** *  * *** **  * ***  *    **
}
else
{
* *    *** *  ****** **  *   *  *  ***      ISBN");
}
}
answered by (-229 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
commented by (4.3k points)
1 like 0 dislike 
Hidden content!
#include<stdio.h>

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

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

** *  *  * * ***   * *  **  ***** *   * **   *   ** *******  ****  *   *    *  * * *  *  *   *   *   ***    **  * * *   ** *** ** ** ***** *******   ***      *       * *  ***** * 
   // *     ***  *** * ***  *  *    *  **   **  * ****** *  *   ** **  **  *    
* ***** * *      ** ***    *** * *** * *   **   
 **     *  **    * ***** *  *  * ***  

   // printf("%d %d",total,check1);
    if (check1==check2)
  *  ***  * *     *  * **   ** **  **   * *    ** ***  **** 
*** **  **  ***** ** *** *  **     **** * *  * *    ***       *  * ISBN");
  ***  * *   **** **********  * *  * ***   *    * **
*  * **  *** * *  ******* 
*      **   **  * * **   ** *    ***   ** * **    * *
* ****** **     ** ** * ***** *     * *  *  * **** * ** *  *** *   ISBN");
** *    * *  *  * *  *  *  *   ***** * *** ***** *****  *
   ***** ** ***   ****   ** ***   *  0;
}
answered by (54 points)
0 0
Case 0: Correct output
Case 1: Correct output
Case 2: Correct output
Case 3: Correct output
commented by (4.3k points)
Page:
Welcome to Peer-Interaction Programming Learning System (PIPLS) LTLab, National DongHwa University
English 中文 Tiếng Việt
IP:172.70.179.45
©2016-2025

Related questions

0 like 0 dislike
26 answers
Midterm Question 2 - Makeup
[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.2k views
1 like 1 dislike
49 answers
Midterm Question 2
[Exam] asked Nov 15, 2017 in Midterm by thopd (12.1k points)
ID: 32706 - Available when: 2017-11-15 14:10 - Due to: Unlimited | 4.9k views
12,783 questions
183,442 answers
172,219 comments
4,824 users