MMGameslogo  MMGames  Introduction to
C Language  C Language
Development  C language
in the browser  Handy App
TwitterSharebutton  FacebookSharebutton  はてブbutton  RSSbutton  Japanese Version 
MMGameslogo  MMGames
TwitterSharebutton  FacebookSharebutton   

Introduction to
C Language

C language
in the browser

Handy App
Read it right next to your computer.
Book version bitter C
Read it right next to your computer.
Book version bitter C
Read it right next to your computer.
Book version bitter C
Read it right next to your computer.
Book version bitter C
learn through sufferingC Language
learn through sufferingC Language

The screen goes black in an instant.

The screen went black instantly, and I can't see the results.
Placing the following command at the end of the program will pause the execution screen.

sum.c 
fflush(stdin);
getchar();

In practice, this is incorporated at the end of the main function like this.

sum.c 
int main(void)
{
    /* 他の処理 */

    fflush(stdin);
    getchar();

    return 0;
}

However, this is not the correct way to use these two commands.
For training purposes only.


About This Site

Learning C language through suffering (Kushi C) is
This is the definitive introduction to the C language.
It systematically explains the basic functions of the C language.
The quality is equal to or higher than commercially available books.

Part 0: Program Overview
  1. What is a program?
Chapter 1: The World's Smallest Program
  1. A do-nothing program.
  2. A compiler is a translation software.
  3. Practice Problem 1
Chapter 2: How to Write Programs
  1. Rules of Writing
  2. Conventions of writing
  3. Practice Problem 2
Chapter 3: Displaying on the Screen
  1. String Display
  2. newline character
  3. Practice Problem 3
Chapter 4: Displaying and Calculating Numbers
  1. Display of numbers
  2. Basic calculations
  3. Numeric types
  4. Practice Problem 4
Chapter 5: Numerical Memory and Calculation
  1. Memorizing numbers.
  2. Types of Variables
  3. Type conversion
  4. Number formatting
  5. Practice Problem 5
Chapter 6: Input from the Keyboard
  1. input function
  2. The fear of input
  3. Practice Problem 6
Chapter 7: Comparison and Judgment
  1. Comparative sentences
  2. Comparison operators
  3. Execution of multiple processes
  4. Problem 7
Chapter 8: Performing Case-by-Case Processing
  1. Two cases
  2. Cases with three or more possibilities.
  3. Case by case basis
  4. Practice Problem 8
Chapter 9: Repeating a Fixed Number of Times
  1. Iterative sentence
  2. How Loops Work
  3. Practice Problem 9
Chapter 10: Repeating Without Knowing the Number of Times
  1. Unspecified loop
  2. Input validation
  3. Practice Problem 10
Chapter 11: How to Create Functions
  1. Creating custom functions
  2. Passing a number to a function.
  3. Return a number from a function.
  4. Practice Problem 11
Chapter 12: Variable Lifetime
  1. Variables with limited scope
  2. The last variable standing
  3. Variables that survive within a function
  4. Practice Problem 12
Chapter 13: Handling Multiple Variables at Once
  1. Handling multiple variables collectively.
  2. Arrays
  3. Practice Problem 13
Chapter 14: How to handle strings
  1. Handling Characters
  2. Ways to handle strings
  3. String manipulation functions
  4. Practice Problem 14
Chapter 15: How Pointer Variables Work
  1. The Mechanism of Memory
  2. Variables and Memory
  3. &付けが必要なvariableの正体
  4. Variable to store an address
  5. Let's try using pointer variables.
  6. Passing information through arguments
  7. &The Peculiar Relationship Between Arrays and Pointers
  8. Practice Problem 15
Chapter 16: Combining Multiple Types
  1. Combining variables of different types.
  2. Structure arguments
  3. Array of Structures
  4. Practice Problem 16
Chapter 17: Handling Files
  1. Reading and writing text files
  2. Reading and writing binary files
  3. Drug response
  4. Practice Problem 17
Chapter 18: Macro Functions
  1. Handling Immutable Values
  2. Constants by other means
  3. Implementing simple functions.
  4. Practice Problem 18
Chapter 19: Dynamic Arrays
  1. Create arrays freely.
  2. Practice Problem 19
Chapter 20: Multiple Source Files
  1. Minimal partitioning
  2. The Divide Principle
  3. Practice Problem 20