This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| AL: EQU 80H | |
| AH: EQU 81H | |
| BL: EQU 82H | |
| BH: EQU 83H | |
| RL: EQU 84H | |
| RH: EQU 85H | |
| LD ACC, 0 | |
| ST ACC, [RL] | |
| ST ACC, [RH] |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // To parse this data: | |
| // | |
| // import { Convert, IndexD } from "./file"; | |
| // | |
| // const indexD = Convert.toIndexD(json); | |
| // | |
| // These functions will throw an error if the JSON doesn't | |
| // match the expected interface, even if the JSON is valid. | |
| export interface IndexD { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <ncurses.h> | |
| #include <stdlib.h> | |
| int main(void){ | |
| int x = 10, y = 10; | |
| int key; | |
| int w, h; | |
| char * lt = "d^))"; | |
| char * rt = "(( ^b"; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <stdio.h> | |
| #include <stdlib.h> // rand() を使うために必要 | |
| #define MAX_SIZE 75 | |
| #define true 1 | |
| typedef struct { | |
| int x; | |
| int y; | |
| int answer; | |
| int input; | |
| } Question; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <stdio.h> | |
| #include <stdlib.h> | |
| #include <string.h> | |
| // Linked list learning | |
| struct node { | |
| int umur; | |
| char nama[30]; | |
| //Points to the next node | |
| struct node *nextNode; | |
| }; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| int arr[] = {0, 1, 2, 3}; | |
| void merge(int l, int m, int r){ | |
| int temp[100]; | |
| int idx = 0; | |
| int leftPivot = l; | |
| int rightPivot = m + 1; | |
| while(leftPivot <= m && rightPivot <= r){ | |
| if(arr[leftPivot] < arr[rightPivot]){ | |
| temp[idx++] = arr[leftPivot++]; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| const axios = require('axios') | |
| const express = require("express") | |
| const app = new express() | |
| app.all("/", (req, res) =>{ | |
| return res.send("Pong!") | |
| }) | |
| app.listen(3000, () =>{ | |
| console.log("Application listening on port 3000") | |
| }) |