text stringlengths 1 1.05M |
|---|
AskName:
call SaveScreenTilesToBuffer1
call GetPredefRegisters
push hl
ld a, [wIsInBattle]
dec a
coord hl, 0, 0
lb bc, 4, 11
call z, ClearScreenArea ; only if in wild battle
ld a, [wcf91]
ld [wd11e], a
call GetMonName
ld hl, DoYouWantToNicknameText
call PrintText
coord hl, 14, 7
lb bc, 8, 15
ld a, TWO_O... |
<%
import collections
import pwnlib.abi
import pwnlib.constants
import pwnlib.shellcraft
%>
<%docstring>link(from, to) -> str
Invokes the syscall link.
See 'man 2 link' for more information.
Arguments:
from(char*): from
to(char*): to
Returns:
int
</%docstring>
<%page args="from=0, to=0"/>
<%
abi = pw... |
; Copyright 2019 IBM Corporation
;
; Licensed under the Apache License, Version 2.0 (the "License");
; you may not use this file except in compliance with the License.
; You may obtain a copy of the License at
;
; http://www.apache.org/licenses/LICENSE-2.0
;
; Unless required by applicable law or agreed to in writi... |
; w_vector_t *w_vector_init(void *p, size_t capacity, size_t max_size)
SECTION code_clib
SECTION code_adt_w_vector
PUBLIC w_vector_init
EXTERN asm_w_vector_init
w_vector_init:
pop af
pop hl
pop bc
pop de
push de
push bc
push hl
push af
jp asm_w_vector_init
; SDCC bridge for Cla... |
; QLSD Initilaise an SHDC card (via bit-banging) 1.00 (C) W. Lenerz 2017
;
; 2018-06-11 1.01 Take the QLSD hardware lock before initialising card (MK)
section procs
xdef inicrd
include 'dev8_dv3_qlsd_keys'
include 'dev8_keys_qlv'
include 'dev8_keys_err'
include 'dev8_keys_sys'
; algo :
; put into spi m... |
; ---------------------------------------------------------------------------
; Object 88 - chaos emeralds on the ending sequence
; ---------------------------------------------------------------------------
EndChaos:
moveq #0,d0
move.b obRoutine(a0),d0
move.w ECha_Index(pc,d0.w),d1
jsr ECha_Index(pc,d1.w)
j... |
#include "up16_core.asm"
nop
start:
lli r4, #0x71
; replace second nop with lli r3 #0xff for task 1
lli r3, #0xff
lli r1, #1
lli r2, #2
lui r4, r4, #0xf9
add r2, r1
mov r5, r3
addi r3, r1, #1
addi r6, r4, #5
jmp proc3
proc2:
nop
add r4, r1
or r2, r4
nop
pro... |
100: LD SP, #4000
108: LD R1, #10
116: ST a, R1
124: LD R2, #2
132: ST b, R2
function block
1000: SUB R3, R1, R2
1008: BLEZ R3, #1048
1016: AND R4, #true, #false
1024: LD R0, R4
1032: BR *0(SP)
1040: BR #1064
1048: LD R0, #false
1056: BR *0(SP)
function main
|
/*
* Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright noti... |
; A066534: Total number of walks with length > 0 in the Hasse diagram of a Boolean algebra of order n.
; 0,1,6,30,152,840,5232,37072,297600,2680704,26812160,294945024,3539364864,46011796480,644165265408,9662479226880,154599668154368,2628194359738368
lpb $0,1
add $2,1
lpb $0,1
mul $2,$0
mul $1,2
add $1,... |
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; Copyright(c) 2011-2020 Intel Corporation All rights reserved.
;
; Redistribution and use in source and binary forms, with or without
; modification, are permitted provided that the following conditions
; are met:
; * Redistributions of so... |
#include "common.hh"
#include <algorithm>
#include <iostream>
#include <memory>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include "args.hh"
#include "cgi.hh"
#include "config.hh"
#include "db.hh"
#include "event.hh"
#include "event_utils.hh"
#include "http.hh"
#include "sender_client.hh"
... |
UFO_SPAWN_BASE_TIME = 15
UFO_START_FRAME = 6
UFO_SHOT_TIME = 30
UFO_FRAMES = 4
.segment "BSS"
ufo_y: .res 1
ufo_x: .res 1
ufo_move_horizontal: .res 1
ufo_shot_wait: .res 1
ufo_shot_countdown: .res 1
ufo_active: .res 1
ufo_spawn_wait: .res 1
ufo_spawn_countdown: .res 1
ufo_frame: .res 1
ufo_temp: .res 1
... |
; A186316: Adjusted joint rank sequence of (f(i)) and (g(j)) with f(i) before g(j) when f(i)=g(j), where f and g are the squares and hexagonal numbers. Complement of A186315.
; 2,4,6,9,11,14,16,18,21,23,26,28,31,33,35,38,40,43,45,47,50,52,55,57,60,62,64,67,69,72,74,76,79,81,84,86,88,91,93,96,98,101,103,105,108,110,113... |
; A165826: Totally multiplicative sequence with a(p) = 5.
; 1,5,5,25,5,25,5,125,25,25,5,125,5,25,25,625,5,125,5,125,25,25,5,625,25,25,125,125,5,125,5,3125,25,25,25,625,5,25,25,625,5,125,5,125,125,25,5,3125,25,125,25,125,5,625,25,625,25,25,5,625,5,25,125,15625,25,125,5,125,25,125,5,3125,5,25,125,125,25,125,5,3125,625,25... |
#!/usr/bin/sisa16_asm -run
//use a separately compiled libc.
//..include"libc_pre.hasm"
//..(2):
//..dinclude"libc_pre.bin"
//use the normal libc.
..include"libc.hasm"
..(5):
length_of_input_string:
bytes %/0%;
..main(3):
lrx0 %/what%
proc_krenel
halt;
what:
la '\n'; interrupt;
lrx0 %0xc%,%0%;
proc_gets
l... |
// Copyright 2017 syzkaller project authors. All rights reserved.
// Use of this source code is governed by Apache 2 LICENSE that can be found in the LICENSE file.
// +build
#include <algorithm>
#include <errno.h>
#include <limits.h>
#include <signal.h>
#include <stdarg.h>
#include <stddef.h>
#include <stdint.h>
#inc... |
; A083036: Partial sums of A083035.
; 1,1,1,2,3,3,4,5,5,5,6,6,6,7,8,8,8,9,9,9,10,11,11,12,13,13,13,14,15,15,16,17,17,17,18,18,18,19,20,20,21,22,22,22,23,24,24,25,26,26,26,27,27,27,28,29,29,29,30,30,30,31,32,32,33,34,34,34,35,35,35,36,37,37,37,38
mov $2,$0
add $2,1
mov $4,$0
lpb $2,1
mov $0,$4
sub $2,1
sub $0,$2
... |
// utilUmpire.cpp
// This file is generated by Shroud 0.11.0. Do not edit.
// Copyright (c) 2016-20, Lawrence Livermore National Security, LLC and Umpire
// project contributors. See the COPYRIGHT file for details.
//
// SPDX-License-Identifier: (MIT)
#include "typesUmpire.h"
#include <cstddef>
#include <cstring>
#i... |
_main:
;EEPROM.c,18 :: void main() {
;EEPROM.c,19 :: unsigned short a=0, b=0, c=0, d=0;
CLRF main_a_L0+0
CLRF main_b_L0+0
CLRF main_c_L0+0
CLRF main_d_L0+0
;EEPROM.c,22 :: TRISD=1;
MOVLW 1
MOVWF TRISD+0
;EEPROM.c,23 :: PORTD=0;
CLRF PORTD+0
;EEPROM.... |
include 'macros.inc'
.8086
.MODEL SMALL
.STACK 256
DATA SEGMENT
TABLE_LETTERS DB 16 DUP(?)
TABLE_NUMBERS DB 16 DUP(?)
TABLE DB 16 (?)
DATA ENDS
CODE SEGMENT
MAIN PROC FAR
MOV AX,@DATA
MOV DS,AX
JMP BEGIN
START: NEW_LINE
BEGIN: MOV CL,0 ; total counter
MOV DX,0 ... |
#include <iostream>
#include <string>
int main()
{
std::string str;
std::cout<<"Enter any string and press enter: ";
getline(std::cin, str);
std::cout<<"You just entered: "<<str<<std::endl;
return 0;
}
|
; A103220: a(n) = n*(n+1)*(3*n^2+n-1)/6.
; 0,1,13,58,170,395,791,1428,2388,3765,5665,8206,11518,15743,21035,27560,35496,45033,56373,69730,85330,103411,124223,148028,175100,205725,240201,278838,321958,369895,422995,481616,546128,616913,694365,778890,870906,970843,1079143,1196260,1322660,1458821,1605233,1762398,1930830,2... |
Name: w-select.asm
Type: file
Size: 14878
Last-Modified: '1992-04-28T15:00:00Z'
SHA-1: 410AC308844A23550AF10833954B6AF690931807
Description: null
|
; A000204: Lucas numbers (beginning with 1): L(n) = L(n-1) + L(n-2) with L(1) = 1, L(2) = 3.
; 1,3,4,7,11,18,29,47,76,123,199,322,521,843,1364,2207,3571,5778,9349,15127,24476,39603,64079,103682,167761,271443,439204,710647,1149851,1860498,3010349,4870847,7881196,12752043,20633239,33385282,54018521,87403803,141422324,228... |
;=================================================================
;
; Copyright (c) 2014, Eric Blundell
;
; All rights reserved.
;
; libasm_io is distributed under the following BSD 3-Clause License
;
; Redistribution and use in source and binary forms, with or without modification, are permitted provided that the f... |
global _start
section .data
message: db 'hello, world!', 10
section .text
_start:
mov rax, 1 ; system call number should be stored in rax
mov rdi, 1 ; argument #1 in rdi: where to write?
mov rsi, message ; argument #2 in rsi: where does the string start?
mov rd... |
; A102731: Numbers k such that 11*k + 23 is prime.
; 0,4,6,16,28,30,34,36,40,54,58,60,64,76,78,84,88,90,100,114,118,126,130,144,160,168,180,186,190,196,204,208,210,214,216,228,240,244,246,258,264,268,274,286,288,294,298,300,306,310,316,328,334,336,348,354,364,366,370,376,394,400,418,420,448,450,456,468,474,478,480,484,... |
/* Copyright(c) 1998-2020, ALICE Experiment at CERN, All rights reserved. *
* See cxx source for full Copyright notice */
//*************************************************************************
// \class AliAnalysisTaskSEDstarPolarization
// \brief Analysis task to perform D*+ polari... |
;
; (c)2019 Phillip Stevens All rights reserved.
;
; Redistribution and use in source and binary forms, with or without
; modification, are permitted provided that the following conditions are
; met:
;
; Redistributions of source code must retain the above copyright notice, this
; list of conditions and the following d... |
OUTPUT "issue172_dup_zero.bin"
DUP 1
DB 'A'
EDUP
DUP 0
DB 'B'
EDUP
DUP 2
DB 'C'
EDUP
; check also error message for negative count
DUP -1
|
.global s_prepare_buffers
s_prepare_buffers:
push %r12
push %r15
push %rbp
push %rbx
push %rdx
push %rsi
lea addresses_A_ht+0xf5f, %rbx
nop
nop
nop
nop
nop
inc %rdx
mov (%rbx), %ebp
nop
nop
nop
nop
nop
and %rbp, %rbp
lea addresses_UC_ht+0x55a7, %r12
nop
nop
nop
and $21098, %r15
mov $0x6162636465666768, %rsi
movq %rsi, ... |
//
// Copyright © 2020 Arm Ltd. All rights reserved.
// SPDX-License-Identifier: MIT
//
#pragma once
#include <neon/workloads/NeonWorkloadUtils.hpp>
#include <arm_compute/runtime/NEON/functions/NEElementwiseOperations.h>
namespace armnn
{
arm_compute::Status NeonDivisionWorkloadValidate(const TensorInfo& input0,
... |
.global s_prepare_buffers
s_prepare_buffers:
push %r10
push %r11
push %r13
push %r8
push %rbx
push %rcx
push %rdi
push %rsi
lea addresses_UC_ht+0x10d3f, %r13
nop
nop
nop
nop
xor %r11, %r11
mov (%r13), %bx
nop
nop
nop
xor $54414, %r10
lea addresses_normal_ht+0x1042f, %rsi
lea addresses_WC_ht+0x1566f, %rdi
clflush (%rsi)... |
; A203194: (n-1)-st elementary symmetric function of the first n terms of (1,2,6,20,70,252,...)=A000984.
; Submitted by Jon Maiga
; 1,3,20,412,29080,7344960,6790976640,23310543674880,300020122552550400,14587151144134593024000,2695072097623041659787264000,1901191652075515716657381408768000,514111990801452190643230653877... |
.size 8000
.text@48
jp lstatint
.text@100
jp lbegin
.data@143
c0
.text@150
lbegin:
ld a, 00
ldff(ff), a
ld a, 30
ldff(00), a
ld a, 01
ldff(4d), a
stop, 00
ld a, ff
ldff(45), a
ld b, 91
call lwaitly_b
ld hl, fe00
ld d, 10
ld a, d
ld(hl++), a
ld a, 08
ld(hl++), a
inc l
inc l
ld a, d
ld(hl++), ... |
//USE32
.extern __arch_start
.extern __serial_print1
.global __multiboot_magic
.global __multiboot_addr
.global _start
.global __xsave_enabled
.global __avx_enabled
.set MB_MAGIC, 0x1BADB002
.set MB_FLAGS, 0x3 //;; ALIGN + MEMINFO
//;; stack base address at EBDA border
//;; NOTE: Multiboot can use 9d400 to 9ffff
.... |
; A344121: a(n) is the multiplicative inverse of 24 (mod 7^n).
; Submitted by Christian Krause
; 5,47,243,2301,11905,112747,583343,5524601,28583805,270705447,1400606443,13264566901,68629715705,649963778147,3362856069543,31848225129201,164779947407605,1560563031330847,8074217422972643,76467588535211501,39563665372565950... |
; A033375: [ 55/n ].
; 55,27,18,13,11,9,7,6,6,5,5,4,4,3,3,3,3,3,2,2,2,2,2,2,2,2,2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
add $0,1
mov $1,55
div $1,$0
|
/////////////////////////////////////////////////////////////////////////////
//
// Copyright (c) 2020, The Regents of the University of California
// All rights reserved.
//
// BSD 3-Clause License
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the... |
Map_3C906: dc.w word_3C7CE-Map_3C906
dc.w word_3C7D6-Map_3C906
dc.w word_3C916-Map_3C906
dc.w word_3C91E-Map_3C906
dc.w word_3C926-Map_3C906
dc.w word_3C92E-Map_3C906
dc.w word_3C936-Map_3C906
dc.w word_3C93E-Map_3C906
word_3C916: dc.w 1
dc.b $FC, $C, 0, $22, $FF, $F1
word_3C91E: dc.w 1
dc.... |
; A038558: Smallest number with derivative n.
; Submitted by Stefano Spezia
; 0,2,4,5,8,9,11,10,16,17,19,18,23,22,20,21,32,33,35,34,39,38,36,37,47,46,44,45,40,41,43,42,64,65,67,66,71,70,68,69,79,78,76,77,72,73,75,74,95,94,92,93,88,89,91,90,80,81,83,82,87,86,84,85,128,129,131,130,135,134,132,133,143,142,140,141,136,137,... |
/*
* This file is part of Nokia HEIF library
*
* Copyright (c) 2015-2018 Nokia Corporation and/or its subsidiary(-ies). All rights reserved.
*
* Contact: heif@nokia.com
*
* This software, including documentation, is protected by copyright controlled by Nokia Corporation and/ or its
* subsidiaries. All rights ar... |
; ===============================================================
; Apr 2014
; ===============================================================
;
; void in_wait_key(void)
;
; Busy wait until a key is pressed.
;
; ===============================================================
SECTION code_input
PUBLIC asm_in_wait_ke... |
;
; Default format table for scanf family
MODULE __scanf_format_table
SECTION rodata_clib
PUBLIC __scanf_format_table
EXTERN __scanf_handle_d
EXTERN __scanf_handle_s
EXTERN __scanf_handle_c
EXTERN __scanf_handle_x
EXTERN __scanf_handle_o
EXTERN __scanf_handle_B
EXTERN _... |
; A090326: Number of rules of a context-free grammar in Chomsky normal form that generates all permutations of n symbols.
; 1,4,15,54,185,608,1939,6058,18669,57012,173063,523262,1577953,4750216,14283387,42915666,128878037,386896220,1161212911,3484687270,10456158921,31372671024,94126401635,282395982074,847221500605,2541... |
.const_F DAT 0x1000
#include "asm_test_data_3.asm"
|
; ***************************************************************************************
; ***************************************************************************************
;
; Name : miscellany.asm
; Author : Paul Robson (paul@robsons.org.uk)
; Date : 31st October 2021
; Purpose : Miscellaneous words
;
... |
;
;
; ZX Maths Routines
;
; 9/12/02 - Stefano Bodrato
;
; $Id: floor.asm,v 1.5 2016-06-22 19:59:18 dom Exp $
;
;double floor(double)
;Number in FA..
IF FORts2068
INCLUDE "target/ts2068/def/ts2068fp.def"
ENDIF
IF FORzx
INCLUDE "target/zx/def/zxfp.def"
ENDIF
IF FORzx81
INCLUDE "target/zx8... |
.global s_prepare_buffers
s_prepare_buffers:
push %r13
push %r14
push %rax
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_WC_ht+0x1beb3, %rcx
nop
inc %rsi
mov (%rcx), %rax
nop
nop
nop
nop
add $63057, %r14
lea addresses_UC_ht+0x1ae0b, %rdx
nop
sub $7817, %rsi
mov (%rdx), %r13
nop
nop
nop
nop
nop
add $33192, %rcx
... |
// A BestCell keeps track only of the best path covering its span, in contrast
// to FullCell, which stores the best path covering the span with each start and
// end state.
#ifndef _PERMUTE_BEST_CELL_HH
#define _PERMUTE_BEST_CELL_HH
#include "Cell.hh"
namespace Permute {
class BestCell : public CellImpl {
publi... |
; double copysign(double x, double y)
SECTION code_fp_math48
PUBLIC am48_copysign
am48_copysign:
; Make sign of AC' the same as sign of AC
;
; enter : AC' = double x
; AC = double y
;
; exit : AC' = abs(x) * sgn(y)
;
; uses : af, b'
ld a,l
or a
jr z, zero ... |
// Include before boost::log headers
#include "restc-cpp/restc-cpp.h"
#include "restc-cpp/logging.h"
#include "restc-cpp/RequestBuilder.h"
#include "restc-cpp/IteratorFromJsonSerializer.h"
#ifdef RESTC_CPP_LOG_WITH_BOOST_LOG
#include <boost/log/core.hpp>
#include <boost/log/trivial.hpp>
#include <boost/log/expressi... |
; A053835: Sum of digits of n written in base 15.
; 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,5,6,7,8,9,10,11,12,13
lpb $0
dif $0,15
sub $0,1
add $1,1
lpe
mov $0,$1
|
;
; The Multi8 can operate in multiple modes
;
; - Text/character based - 40x25, 80x25 there's attributes there as well
; - Full RGB - they actually end up being superimposed on each other (when in text mode)
;
;
; Text mode = two bytes get written 2k apart
;
; In code_driver so we are low down in memory and hopef... |
; ---------------------------------------------------------------------------
; Pallet pointers
; ---------------------------------------------------------------------------
dc.l Pal_SegaBG ; pallet address
dc.w $FB00 ; RAM address
dc.w $1F ; (pallet length / 2) - 1
dc.l Pal_Title
dc.w $FB00
dc.w $1F
... |
#include "Window.h"
#include <iostream>
#include <stdexcept>
static void APIENTRY glDebugOutput(GLenum source, GLenum type, GLuint id, GLenum severity, GLsizei length,
const GLchar* message, const void* userParam)
{
// ignore non-significant error/warning codes
if (id == 131... |
; A142342: a(n) = 10*prime(n).
; 20,30,50,70,110,130,170,190,230,290,310,370,410,430,470,530,590,610,670,710,730,790,830,890,970,1010,1030,1070,1090,1130,1270,1310,1370,1390,1490,1510,1570,1630,1670,1730,1790,1810,1910,1930,1970,1990,2110,2230,2270
seq $0,6005 ; The odd prime numbers together with 1.
max $0,2
mul $0,1... |
_PokemonTower2Text_6062d::
text "<RIVAL>: Hey,"
line "<PLAYER>! What"
cont "brings you here?"
cont "Your #MON"
cont "don't look dead!"
para "I can at least"
line "make them faint!"
cont "Let's go, pal!"
done
_PokemonTower2Text_60632::
text "What?"
line "You stinker!"
para "I took it easy on"
line "you t... |
; A056119: a(n) = n*(n+13)/2.
; 0,7,15,24,34,45,57,70,84,99,115,132,150,169,189,210,232,255,279,304,330,357,385,414,444,475,507,540,574,609,645,682,720,759,799,840,882,925,969,1014,1060,1107,1155,1204,1254,1305,1357,1410,1464,1519,1575
add $0,7
bin $0,2
mov $1,$0
sub $1,21
|
#include "Platform.inc"
#include "FarCalls.inc"
#include "Arithmetic32.inc"
#include "TestFixture.inc"
radix decimal
udata
global expectedRAA
global expectedRAB
global expectedRAC
global expectedRAD
global expectedCarry
global expectedZero
global carry
global zero
expectedRAA res 1
expectedRAB res 1
ex... |
// Copyright (c) 2009-2010 Satoshi Nakamoto
// Copyright (c) 2009-2012 The Bitcoin developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "irc.h"
#include "db.h"
#include "net.h"
#include "init.h"
#include "addr... |
; =============================================================================
; Pure64 -- a 64-bit OS loader written in Assembly for x86-64 systems
; Copyright (C) 2008-2015 Return Infinity -- see LICENSE.TXT
;
; PCI Functions. http://wiki.osdev.org/PCI
; ==============================================================... |
.global s_prepare_buffers
s_prepare_buffers:
push %r10
push %r11
push %r13
push %r9
push %rbp
push %rbx
push %rcx
push %rdi
push %rsi
lea addresses_D_ht+0x1eb97, %r10
clflush (%r10)
nop
nop
nop
cmp %rdi, %rdi
movups (%r10), %xmm1
vpextrq $0, %xmm1, %r11
and $56458, %r9
lea addresses_A_ht+0xff17, %rbp
clflush (%rbp)
nop... |
; A152423: A variation of the Josephus problem, removing every other person, starting with person 1; a(n) is the last person remaining.
; 1,2,2,4,2,4,6,8,2,4,6,8,10,12,14,16,2,4,6,8,10,12,14,16,18,20,22,24,26,28,30,32,2,4,6,8,10,12,14,16,18,20,22,24,26,28,30,32,34,36,38,40,42,44,46,48,50,52,54,56,58,60,62,64,2,4,6,8,10... |
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < int(b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= int(a); --i)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, int(n) + 1)
#define RREP(i, n) RFOR(i, 0, n)
#define RREP1(i, n) RFOR(i, 1, int(n) + 1)
#def... |
; A133294: a(n) = 2*a(n-1) + 10*a(n-2), a(0)=1, a(1)=1.
; 1,1,12,34,188,716,3312,13784,60688,259216,1125312,4842784,20938688,90305216,389997312,1683046784,7266066688,31362601216,135385869312,584397750784,2522654194688,10889285897216,47005113741312,202903086454784,875857310322688,3780745485193216
mov $4,$0
mov $5,$0
ad... |
#include "menu.hpp"
#include "window.hpp"
#ifndef PATH_SAVING
#define PATH_SAVING "./tmp/data"
#endif
#ifndef PATH_RESOURSE
#define PATH_RESOURSE "./data"
#endif
int main() {
Settings settings(PATH_SAVING "/settings", PATH_RESOURSE);
Graphic::Window window(settings);
Menu menu(settings);
sf::Event event;
bool ... |
// Copyright (c) 2012 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "remoting/protocol/jingle_session.h"
#include <stdint.h>
#include <limits>
#include <memory>
#include <utility>
#include "base/bind.h"
#in... |
; A126446: Column 0 of triangle A126445; a(n) = binomial( binomial(n+2,3), n).
; 1,1,6,120,4845,324632,32468436,4529365776,840261910995,200063149171380,59473554359599446,21592914273609648996,9403538945961296957821,4838670732821812768919800,2904538537066424425438417800,2011833832070058843657188795040,1592750845170051165... |
;// Subtracting three integers (SubThree.asm)
INCLUDE Irvine32.inc
;// Data segment
.data
Rval SWORD ?
Int1 SWORD 26
Int2 SWORD 30
Int3 SWORD 40
;// Code Segment
.code
main PROC
;// AX register is lower half or EAX register
;// Therfore clear out the upper half with zer... |
// Copyright (c) 2018-2020 The Cash2 developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "gtest/gtest.h"
#include "Logging/LoggerMessage.h"
#include "Logging/ConsoleLogger.h"
using namespace Logging;
// con... |
; A259623: Strictly increasing list of F and F + 1, where F = A000045, the Fibonacci numbers.
; 1,2,3,4,5,6,8,9,13,14,21,22,34,35,55,56,89,90,144,145,233,234,377,378,610,611,987,988,1597,1598,2584,2585,4181,4182,6765,6766,10946,10947,17711,17712,28657,28658,46368,46369,75025,75026,121393,121394,196418,196419,317811,317... |
;bootload.asm
;Michael Black, 2007
;
;This is a simple bootloader that loads and executes a kernel at sector 3
bits 16
KSEG equ 0x1000 ;kernel goes into memory at 0x10000
KSIZE equ 10 ;kernel is at most 10 sectors (and probably less)
KSTART equ 3 ;kernel lives at sector 3 (makes room for map & dir)
;boot loader ... |
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
Copyright (c) GeoWorks 1991 -- All Rights Reserved
PROJECT: PC GEOS
MODULE:
FILE: intCommonMain.asm
AUTHOR: jimmy lefkowitz
REVISION HISTORY:
Name Date Description
---- ---- -----------
jimmy 4/15/92 Initial version.
D... |
; A212988: Number of (w,x,y) with all terms in {0,...,n} and 4*w = x+y.
; 1,1,2,4,7,9,12,16,21,25,30,36,43,49,56,64,73,81,90,100,111,121,132,144,157,169,182,196,211,225,240,256,273,289,306,324,343,361,380,400,421,441,462,484,507,529,552,576,601,625,650,676,703,729,756,784
mul $0,2
add $0,1
lpb $0
trn $0,4
add $1,1... |
; movingData.nasm
;
; Author : bigb0ss
; Created date : 05/19/2020
; Last update : 05/19/2020
;
; Description : This is just example of mine. You can modify anything to play the data.
; Global Entry Point
global _start
section .text
_start
; mov - Move data into register
mov eax, 0xaabbcc... |
.global s_prepare_buffers
s_prepare_buffers:
push %r11
push %r14
push %r15
push %rax
push %rbp
push %rdi
push %rsi
lea addresses_A_ht+0x10186, %rsi
clflush (%rsi)
sub $54196, %r15
movb (%rsi), %r14b
nop
nop
nop
dec %rbp
lea addresses_UC_ht+0x188f6, %rsi
nop
nop
nop
cmp $35720, %r14
mov (%rsi), %r11
nop
dec %rbp
lea add... |
; A035328: a(n) = n*(2*n-1)*(2*n+1).
; 0,3,30,105,252,495,858,1365,2040,2907,3990,5313,6900,8775,10962,13485,16368,19635,23310,27417,31980,37023,42570,48645,55272,62475,70278,78705,87780,97527,107970,119133,131040,143715,157182,171465,186588,202575,219450,237237,255960,275643,296310,317985,340692,364455,389298,415245,4... |
FanClub_h:
db INTERIOR ; tileset
db POKEMON_FAN_CLUB_HEIGHT, POKEMON_FAN_CLUB_WIDTH ; dimensions (y, x)
dw FanClubBlocks, FanClubTextPointers, FanClubScript ; blocks, texts, scripts
db $00 ; connections
dw FanClubObject ; objects
|
; int fscanf(FILE *stream, const char *format, ...)
INCLUDE "clib_cfg.asm"
SECTION code_clib
SECTION code_stdio
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
IF __CLIB_OPT_MULTITHREAD & $02
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
PUBLIC _fscanf
EXTERN asm_fscanf
_fscanf:
push ix
call asm_fscanf
pop ix
ret
;;;;;;... |
; TEXT STARTS HERE
; What does the sketch do? What it's output?
; Short answer: The sketch divides 200 by 5 and prints the result to stdout
; in binary form
; For detailed explanation, See Comments added in the sketch
; TEXT ENDS HERE
start:
mov AL, 200 ; Store dividend in 8-bit register AL
... |
.global s_prepare_buffers
s_prepare_buffers:
push %r12
push %r13
push %r8
push %rbp
push %rbx
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_WT_ht+0x5212, %rdi
nop
nop
nop
nop
sub %rbx, %rbx
mov $0x6162636465666768, %r12
movq %r12, %xmm1
movups %xmm1, (%rdi)
sub %r12, %r12
lea addresses_UC_ht+0x1323a, %rdi
nop
n... |
.size 8000
.text@48
jp lstatint
.text@100
jp lbegin
.data@143
c0
.text@150
lbegin:
ld a, 00
ldff(ff), a
ld a, 30
ldff(00), a
ld a, 01
ldff(4d), a
stop, 00
ld a, ff
ldff(45), a
ld b, 91
call lwaitly_b
ld hl, fe00
ld d, 10
ld a, d
ld(hl++), a
ld a, 08
ld(hl++), a
inc l
inc l
ld a, d
ld(hl++), ... |
SECTION code_fp_math48
PUBLIC asm_atan
EXTERN am48_atan
defc asm_atan = am48_atan
|
global flush_gdt
extern gp
flush_gdt:
lgdt [gp]
mov ax, 0x10
mov ds, ax
mov es, ax
mov fs, ax
mov gs, ax
mov ss, ax
jmp 0x08:flush2
flush2:
ret
|
#include <bits/stdc++.h>
#define watch(x) std::cout << (#x) << " is " << (x) << std::endl
#define print(x) std::cout << (x) << std::endl
using LL = long long;
const int N = 1e3 + 2;
int gcd[N][N];
void init() {
for (int i = 0; i < N; ++i) gcd[i][0] = gcd[0][i] = i;
for (int i = 1; i < N; ++i) {
for (int j = i; j < ... |
; A063522: a(n) = n*(5*n^2 - 3)/2.
; 0,1,17,63,154,305,531,847,1268,1809,2485,3311,4302,5473,6839,8415,10216,12257,14553,17119,19970,23121,26587,30383,34524,39025,43901,49167,54838,60929,67455,74431,81872,89793,98209,107135,116586,126577,137123,148239,159940,172241,185157,198703,212894,227745,243271,259487,276408,29404... |
_FuchsiaCityText1::
text "Did you try the"
line "SAFARI GAME? Some"
cont "#MON can only"
cont "be caught there."
done
_FuchsiaCityText2::
text "SAFARI ZONE has a"
line "zoo in front of"
cont "the entrance."
para "Out back is the"
line "SAFARI GAME for"
cont "catching #MON."
done
_FuchsiaCityText3::
text... |
RockTunnel1Script:
call EnableAutoTextBoxDrawing
ld hl, RockTunnel1TrainerHeaders
ld de, RockTunnel1ScriptPointers
ld a, [wRockTunnel1CurScript]
call ExecuteCurMapScriptInTable
ld [wRockTunnel1CurScript], a
ret
RockTunnel1ScriptPointers:
dw CheckFightingMapTrainers
dw DisplayEnemyTrainerTextAndStartBattle
dw... |
#ifdef BUILD_TESTS
// Copyright 2021 Hcnet Development Foundation and contributors. Licensed
// under the Apache License, Version 2.0. See the COPYING file at the root
// of this distribution or at http://www.apache.org/licenses/LICENSE-2.0
#include "invariant/OrderBookIsNotCrossed.h"
#include "invariant/test/Invarian... |
; A044672: Numbers n such that string 4,4 occurs in the base 9 representation of n but not of n+1.
; 40,121,202,283,368,445,526,607,688,769,850,931,1012,1097,1174,1255,1336,1417,1498,1579,1660,1741,1826,1903,1984,2065,2146,2227,2308,2389,2470,2555,2632,2713,2794,2875,2956,3037,3118
mul $0,2
seq $0,44632 ; Numbers n su... |
/*
* Copyright (c) 2017, Intel Corporation
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publi... |
CeladonMansion1Script:
call EnableAutoTextBoxDrawing
ret
CeladonMansion1TextPointers:
dw CeladonMansion1Text1
dw CeladonMansion1Text2
dw CeladonMansion1Text3
dw CeladonMansion1Text4
dw CeladonMansion1Text5
CeladonMansion1Text1:
TX_FAR _CeladonMansion1Text1
TX_ASM
ld a, MEOWTH
call PlayCry
jp TextScriptEnd... |
; Digger Remastered
; Copyright (c) Andrew Jenner 1998-2004
PUBLIC _olddelay,_getkips,_inittimer,_gethrt,_getlrt
PUBLIC _s0initint8,_s0restoreint8,_s0soundoff,_s0setspkrt2,_s0settimer0
PUBLIC _s0timer0,_s0settimer2,_s0timer2,_s0soundinitglob,_s0soundkillglob
PUBLIC _s1initint8,_s1restoreint8,_setsounddevice,_initsound... |
; DO NOT MODIFY THIS FILE DIRECTLY!
; author: @TinySecEx
; ssdt asm stub for 6.1.7601-sp1-windows-7 amd64
option casemap:none
option prologue:none
option epilogue:none
.code
; ULONG64 __stdcall NtMapUserPhysicalPagesScatter( ULONG64 arg_01 , ULONG64 arg_02 , ULONG64 arg_03 );
NtMapUserPhysicalPagesS... |
; A017072: a(n) = (8*n)^8.
; 0,16777216,4294967296,110075314176,1099511627776,6553600000000,28179280429056,96717311574016,281474976710656,722204136308736,1677721600000000,3596345248055296,7213895789838336,13685690504052736,24759631762948096,42998169600000000,72057594037927936,117033789351264256,184884258895036416,28493... |
%ifndef PRINT_INT
%define PRINT_INT
%include "include/printChar.asm"
%include "include/mathPow.asm"
printInt: ;print stuff in si to the screen as a number in the decimal system
;al -> printChar
call lengthInt
.loop:
call printIntDiv
push dx
push bx
sub bx, 1
mov ax, 10
call pow16
pop bx
pop d... |
// Copyright 2020 The Fuchsia Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "src/cobalt/bin/app/user_consent_watcher.h"
#include <lib/fit/result.h>
#include <lib/fostr/fidl/fuchsia/settings/formatting.h>
#include <lib/sys... |
// GENERATED FILE - DO NOT EDIT.
// Generated by generate_entry_points.py using data from gl.xml.
//
// Copyright 2020 The ANGLE Project Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
//
// entry_points_gles_1_0_autogen.cpp:
// Def... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.