text stringlengths 1 1.05M |
|---|
# ORG 8000
MVI A,80
OUT 43
MVI A,01
OUT 40
RLC
JMP 8006
HLT
|
// Copyright 2020-2021 The Ray Authors.
//
// 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... |
.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++), ... |
; expected result: 0x100 = 64
mov r0, #6
mov r1, #1
l:
add r1, r1, r1
subs r0, #1
bne l
mov r6, #0x100
str r1, [r6]
|
_mv: file format elf32-i386
Disassembly of section .text:
00000000 <main>:
int mv(char *, char *);
int
main(int argc, char *argv[])
{
0: 55 push %ebp
int i = 0;
int res = -1;
char *src = NULL;
char *dest = NULL;
struct stat st;
char dirstr[DIRSTR] = {0};
1: 3... |
!to "build/timer.bin"
;;;;;;;;;;;;;;;;
;;;; Offset ;;;;
;;;;;;;;;;;;;;;;
*=$8000
;;;;;;;;;;;;;;
;;;; Data ;;;;
;;;;;;;;;;;;;;
year_1:
!word 1955
year_2:
!word 1956
year_3:
!word 1982
player_1_label:
!text "P1:"
!byte $00
player_2_label:
!text "P2:"
!byte $00
;;;;;;;;;;;;;;;;;;;
;;;; Variables ;;;;
;;;;;;;;;;;;... |
.byte MAPOBJ_HELP, MAPOBJ_EMPTY, MAPOBJ_W7PLANT, MAPOBJ_W7PLANT, MAPOBJ_EMPTY, MAPOBJ_EMPTY, MAPOBJ_EMPTY, MAPOBJ_EMPTY, MAPOBJ_EMPTY
|
<%
import collections
import pwnlib.abi
import pwnlib.constants
import pwnlib.shellcraft
%>
<%docstring>ipc(call, first, second, third, ptr, fifth) -> str
Invokes the syscall ipc.
See 'man 2 ipc' for more information.
Arguments:
call(unsigned): call
first(int): first
second(int): second
third(int): t... |
; Small C+ Math Library
; ceil(x)
SECTION code_fp
PUBLIC ceil
EXTERN floor
EXTERN odd
; return -(floor(-x))
.ceil CALL odd
jp floor
|
; A134834: Let {b_n(m)} be a sequence defined by b_n(0)=1, b_n(m) = the largest prime dividing (b_n(m-1) +n). Then a(n) is the smallest positive integer such that b_n(m+a(n)) = b_n(m), for all integers m that are greater than some positive integer M.
; 2,3,2,4,3,8,2,3,4,6
mul $0,2
mov $2,$0
lpb $2
lpb $0,8
mul $... |
section .text
global syscall
syscall:
push ebp
mov ebp, esp
push ebx
push esi
push edi
mov eax, [ebp + 8]
mov ebx, [ebp + 12]
mov ecx, [ebp + 16]
mov edx, [ebp + 20]
mov esi, [ebp + 24]
mov edi, [ebp + 28]
cmp eax, 2
jne... |
<%
from pwnlib.shellcraft.mips.linux import syscall
%>
<%page args="fd, file, owner, group, flag"/>
<%docstring>
Invokes the syscall fchownat. See 'man 2 fchownat' for more information.
Arguments:
fd(int): fd
file(char): file
owner(uid_t): owner
group(gid_t): group
flag(int): flag
</%docstrin... |
// Copyright (c) 2010 Satoshi Nakamoto
// Copyright (c) 2009-2014 The Bitcoin Core developers
// Copyright (c) 2014-2017 The Rapid Core developers
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "chainparams.h"
#includ... |
; A182409: Prime-generating polynomial: 4n^2 + 12n - 1583.
; -1583,-1567,-1543,-1511,-1471,-1423,-1367,-1303,-1231,-1151,-1063,-967,-863,-751,-631,-503,-367,-223,-71,89,257,433,617,809,1009,1217,1433,1657,1889,2129,2377,2633,2897,3169,3449,3737,4033,4337,4649,4969,5297,5633,5977,6329,6689,7057,7433,7817,8209,8609,9017,... |
/**
* @file
* @copyright This code is licensed under the 3-clause BSD license.\n
* Copyright ETH Zurich, Laboratory for Physical Chemistry, Reiher Group.\n
* See LICENSE.txt for details.
*/
#include "Repulsion.h"
#include "PairwiseRepulsion.h"
#include <Utils/Geometry/ElementInfo.h>
#include... |
//===--- SerializeSIL.cpp - Read and write SIL ----------------------------===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2014 - 2017 Apple Inc. and the Swift project authors
// Licensed under Apache License v2.0 with Runtime Library Exception
//
// See https://swift.org/L... |
; A184032: 1/16 the number of (n+1) X 3 0..3 arrays with all 2 X 2 subblocks having the same four values.
; 28,40,61,103,181,337,637,1237,2413,4765,9421,18733,37261,74317,148237,296077,591373,1181965,2362381,4723213,9443341,18883597,37761037,75515917,151019533,302026765,604028941,1208033293,2416017421,4831985677,966387... |
#pragma once
#include <map>
#include <string>
#include <vector>
#include "cstone/sfc/box.hpp"
#include "file_utils.hpp"
#include "mpi_file_utils.hpp"
#include "sph/particles_data.hpp"
namespace sphexa
{
template<typename Dataset>
struct IFileWriter
{
virtual void dump(Dataset& d, size_t firstIndex, size_t last... |
; void print(int stdout_stderr, char* str, size_t size);
global print
section .text
print:
mov eax,4 ; write syscall
int 0x80
ret
|
; A114799: Septuple factorial, 7-factorial, n!7, n!!!!!!!, a(n) = n*a(n-7) if n > 1, else 1.
; 1,1,2,3,4,5,6,7,8,18,30,44,60,78,98,120,288,510,792,1140,1560,2058,2640,6624,12240,19800,29640,42120,57624,76560,198720,379440,633600,978120,1432080,2016840,2756160,7352640,14418720,24710400,39124800,58715280,84707280,1185148... |
; A037625: Base 4 digits are, in order, the first n terms of the periodic sequence with initial period 2,3,0.
; 2,11,44,178,715,2860,11442,45771,183084,732338,2929355,11717420,46869682,187478731,749914924,2999659698,11998638795,47994555180,191978220722,767912882891,3071651531564,12286606126258,49146424505035
mul $0,2
... |
// Copyright (c) 2018, The Beldex Project
//
// 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 notice, this list of
// ... |
.global s_prepare_buffers
s_prepare_buffers:
push %r11
push %r13
push %r14
push %r15
push %r9
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_UC_ht+0x4abb, %r13
nop
cmp %r11, %r11
mov (%r13), %edx
nop
nop
nop
nop
nop
sub %r14, %r14
lea addresses_D_ht+0x1bb3b, %rdx
nop
inc %r13
mov (%rdx), %r15
nop
nop
nop
cmp $19... |
#include "stdafx.h"
#include "BandSteuerung.h"
void BandSteuerung::GeschwindigkeitRegeln()
{
}
BandSteuerung::BandSteuerung()
{
}
BandSteuerung::~BandSteuerung()
{
}
|
; A022377: Fibonacci sequence beginning 2, 30.
; 2,30,32,62,94,156,250,406,656,1062,1718,2780,4498,7278,11776,19054,30830,49884,80714,130598,211312,341910,553222,895132,1448354,2343486,3791840,6135326,9927166,16062492
mov $1,1
mov $3,15
lpb $0,1
sub $0,1
mov $2,$1
mov $1,$3
add $3,$2
lpe
add $1,1
mul $1,2
sub ... |
.global s_prepare_buffers
s_prepare_buffers:
push %r11
push %r12
push %r14
push %rax
push %rbx
push %rcx
push %rdi
push %rsi
lea addresses_UC_ht+0x158c, %rax
nop
nop
nop
nop
nop
and $7856, %r12
and $0xffffffffffffffc0, %rax
vmovaps (%rax), %ymm0
vextracti128 $0, %ymm0, %xmm0
vpextrq $0, %xmm0, %rbx
nop
nop
nop
nop
and ... |
; A017073: a(n) = (8*n)^9.
; 0,134217728,68719476736,2641807540224,35184372088832,262144000000000,1352605460594688,5416169448144896,18014398509481984,51998697814228992,134217728000000000,316478381828866048,692533995824480256,1423311812421484544,2773078757450186752,5159780352000000000,9223372036854775808,159165953517719... |
// Assembler: KickAssembler 4.4
// jumping text
.var irq_line = $d0
.var scr_clear_char = ' '
.var scr_clear_color = $0f
.var screen = $400
.var colram = $d800
.var jump_start_row = 2
.var jump_start_col = 10
.var jump_rows = 14
.var jump_start = screen + jump_start_row * 40 + jump_start_col
.var jump_start_colra... |
Name: zel_gsub1_fra.asm
Type: file
Size: 3376
Last-Modified: '2016-05-13T04:20:48Z'
SHA-1: DA0413A8DF0D642D4A281E896EAEA8B8205DD6CE
Description: null
|
; A329827: Beatty sequence for (5+sqrt(37))/6.
; 1,3,5,7,9,11,12,14,16,18,20,22,24,25,27,29,31,33,35,36,38,40,42,44,46,48,49,51,53,55,57,59,60,62,64,66,68,70,72,73,75,77,79,81,83,84,86,88,90,92,94,96,97,99,101,103,105,107,108,110,112,114,116
add $0,1
mov $1,24
mul $1,$0
div $1,13
|
;实验4 2) 将 0:200~0:23F 传送数据 0~63(3FH)，只用 9行代码
; 分析 因为 内存偏移地址 是 200h 那么就用 寄存器数组的方式来做
assume cs:code
code segment
mov ax, 0
mov ds, ax
mov bx, 0
mov cx, 40h
s: mov 200[bx], bl
inc bl
loop s
mov ax, 4c00h
int 21h
code ends
end
;anwser
; assume cs:codesg
; codesg s... |
; A154254: a(n) = 9n^2 - 8n + 2.
; 2,3,22,59,114,187,278,387,514,659,822,1003,1202,1419,1654,1907,2178,2467,2774,3099,3442,3803,4182,4579,4994,5427,5878,6347,6834,7339,7862,8403,8962,9539,10134,10747,11378,12027,12694,13379,14082,14803,15542,16299,17074,17867,18678,19507,20354,21219,22102,23003,23922,24859,25814,26787,... |
#include "Platform.inc"
#include "FarCalls.inc"
#include "Lcd.inc"
#include "../LcdStates.inc"
#include "TestFixture.inc"
radix decimal
udata
expectedState res 1
StateAfterEnabledSecondTimeTest code
global testArrange
testArrange:
fcall initialiseLcd
fcall enableLcd
banksel TMR0
movf TMR0, W
banksel ... |
#pragma once
#include <eosio/chain/types.hpp>
#include <eosio/chain/contract_types.hpp>
namespace eosio { namespace chain {
class apply_context;
/**
* @defgroup native_action_handlers Native Action Handlers
*/
///@{
void apply_eosio_newaccount(apply_context&);
void apply_eosio_updateauth(appl... |
<%
from pwnlib.shellcraft.amd64.linux import syscall
%>
<%page args="name"/>
<%docstring>
Invokes the syscall uname. See 'man 2 uname' for more information.
Arguments:
name(utsname): name
</%docstring>
${syscall('SYS_uname', name)}
|
.global s_prepare_buffers
s_prepare_buffers:
push %r10
push %r12
push %r15
push %r8
push %rax
push %rcx
push %rdi
push %rsi
lea addresses_A_ht+0x7543, %rcx
nop
nop
add %r12, %r12
vmovups (%rcx), %ymm4
vextracti128 $0, %ymm4, %xmm4
vpextrq $1, %xmm4, %rsi
nop
sub $27186, %rax
lea addresses_UC_ht+0x12e4d, %rcx
nop
nop
no... |
/* Copyright 2015 Google Inc. All Rights Reserved.
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 ... |
; A288826: Binary representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 515", based on the 5-celled von Neumann neighborhood.
; 1,11,101,1011,11011,110111,1110111,11101111,111101111,1111011111,11111011111,111110111111,11111101... |
; A014731: Squares of even Lucas numbers.
; 4,16,324,5776,103684,1860496,33385284,599074576,10749957124,192900153616,3461452808004,62113250390416,1114577054219524,20000273725560976,358890350005878084,6440026026380244496,115561578124838522884,2073668380220713167376,37210469265847998489924,667714778405043259651216,119816... |
; A170797: a(n) = n^10*(n^5+1)/2.
; 0,1,16896,7203978,537395200,15263671875,235122725376,2373921992596,17592722915328,102947309439525,500005000000000,2088637053420126,7703541745975296,25593015436291303,77784192406233600,218947233515625000,576461302059237376,1431212533751858121,3373322093472342528,7590566580470528050,16... |
;------------------------------------------------------------------------------
;
; Copyright (c) 2016 - 2020, Intel Corporation. All rights reserved.<BR>
; SPDX-License-Identifier: BSD-2-Clause-Patent
;
;
; Module Name:
;
; SecEntry.nasm
;
; Abstract:
;
; This is the code that goes from real-mode to protected mode.
... |
; A335285: a(n) is the greatest possible greatest part of any partition of n into prime parts.
; Submitted by Jon Maiga
; 2,3,2,5,3,7,5,7,7,11,7,13,11,13,13,17,13,19,17,19,19,23,19,23,23,23,23,29,23,31,29,31,31,31,31,37,31,37,37,41,37,43,41,43,43,47,43,47,47,47,47,53,47,53,53,53,53,59,53,61,59,61,61,61,61,67,61,67,67,7... |
; multi-segment executable file template.
data segment
tab db "lol$"
msg1 db "yes$"
msg2 db "no$"
ends
stack segment
dw 128 dup(0)
ends
code segment
start:
mov ax, data
mov ds, ax
mov es, ax
mov si,0
mov ax,0
mov cx,0
... |
COMMENT @----------------------------------------------------------------------
Copyright (c) GeoWorks 1989 -- All Rights Reserved
PROJECT: Preferences
MODULE: Link
FILE: prefLink.asm
AUTHOR: Chris Boyke
ROUTINES:
Name Description
---- -----------
REVISION HISTORY:
Name Date Description... |
; A314220: Coordination sequence Gal.5.306.1 where G.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
; Submitted by Jamie Morken(s2.)
; 1,5,11,17,22,28,34,39,45,51,56,61,67,73,78,84,90,95,101,107,112,117,123,129,134,140,146,151,157,163,168,173... |
#include <ice/Lexer.hpp>
#include <ice/Encoding.hpp>
#include <ice/Utility.hpp>
#include <algorithm>
#include <sstream>
#include <utility>
#ifdef _MSC_VER
# pragma warning(disable: 4100)
#endif
namespace ice {
const std::unordered_map<TokenType, std::string> Token::m_TypeNames = {
#define E(x) { TokenType:: x, #x ... |
; A104270: a(n) = 2^(n-2)*(C(n,2)+2).
; 1,3,10,32,96,272,736,1920,4864,12032,29184,69632,163840,380928,876544,1998848,4521984,10158080,22675456,50331648,111149056,244318208,534773760,1166016512,2533359616,5486149632,11844714496,25501368320,54760833024,117306294272,250718715904,534723428352,1138166333440,2418066587648,5... |
_ln: file format elf32-i386
Disassembly of section .text:
00000000 <main>:
#include "stat.h"
#include "user.h"
int
main(int argc, char *argv[])
{
0: f3 0f 1e fb endbr32
4: 8d 4c 24 04 lea 0x4(%esp),%ecx
8: 83 e4 f0 and $0xfffffff0,%esp
b: ff 71 fc ... |
// Test that fake stack (introduced by ASan's use-after-return mode) is included
// in the root set.
// RUN: LSAN_BASE="report_objects=1:use_registers=0"
// RUN: %clangxx_lsan %s -O2 -o %t
// RUN: ASAN_OPTIONS=$ASAN_OPTIONS:detect_stack_use_after_return=1 LSAN_OPTIONS=$LSAN_BASE:"use_stacks=0" not %t 2>&1 | FileCheck %... |
//------------------------------------------------------------------------------
//
// Copyright (c) 2008 - 2009, Apple Inc. All rights reserved.<BR>
//
// This program and the accompanying materials
// are licensed and made available under the terms and conditions of the BSD License
// which accompanies this distribut... |
; A160511: Number of weighings needed to find lighter coins among n coins.
; 1,2,3,3,4,4,5,6,6,7,7,8,9,9,10,11,11,12,13,13,14,14,15,16,16,17,18,18,19
mov $2,$0
add $2,7
mov $4,5
mov $5,5
lpb $2
add $3,$5
mul $4,2
lpb $4
trn $4,$3
add $5,1
lpe
lpb $5
add $2,3
add $2,$1
mov $5,$2
lpe
mo... |
global _gcd
global _lcm
global _gcd64
global _lcm64
segment .text align=16
_gcd:
test edi, edi
je .return0
test esi, esi
je .return0
cmp esi, edi
je .returnEsi
jl .bigger
sub esi, edi
jmp _gcd
.bigger:
sub edi, esi
jmp _gcd
.return0:
xor eax, eax
ret
.returnEsi:
mov eax, esi
ret
... |
.thumb
.org 0x0
@r0 has x, r1 has y, r2 has bitfield, r3 has halfword, r12 has ballista flag
push {r4-r7,r14}
mov r7,r8
push {r7}
mov r8,r12
mov r4,r0
mov r5,r1
mov r6,r2
cmp r3,#0x0
beq NoRangeHalfword @this should usually be the case
lsr r7,r3,#0x8 @r7 has min
lsl r2,r3,#0x18 @get max
lsr r2,r2,... |
;
; Fast background save
;
; Colour Genie EG2000 version By Stefano Bodrato
;
;
; $Id: bksave.asm,v 1.1 2015/10/28 07:18:49 stefano Exp $
;
PUBLIC bksave
EXTERN pixeladdress
.bksave
ld hl,2
add hl,sp
ld e,(hl)
inc hl
ld d,(hl) ;sprite address
pu... |
/******************************************************************************
* Copyright (c) 2014-2015, The Pennsylvania State University
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*... |
; A041478: Numerators of continued fraction convergents to sqrt(255).
; Submitted by Jon Maiga
; 15,16,495,511,15825,16336,505905,522241,16173135,16695376,517034415,533729791,16528928145,17062657936,528408666225,545471324161,16892548391055,17438019715216,540033139847535,557471159562751,17264167926730065,178216390862928... |
// Created on October 26, 2013 by Lu, Wangshan.
/// This is the implementation file of nostd::diffusion Shared Memory Writer.
/// For Writer and Reader maintainer:
/// Writer and Reader communicate with a shared memory file. File length is specified in writer's constructor.
/// Since the shared memory region contains a... |
#pragma once
#include <eosio/eosio.hpp>
#include <eosio/print.hpp>
#include <eosio/asset.hpp>
#include <eosio/crypto.hpp>
#include <eosio/time.hpp>
#include <eosio/singleton.hpp>
#include <eosio/transaction.hpp>
#include <string>
using namespace eosio;
inline uint32_t now() {
static uint32_t current_time = current... |
#include "nine/prg_rom/utils_static.asm"
|
.global s_prepare_buffers
s_prepare_buffers:
push %r10
push %r11
push %r14
push %r8
push %rbp
push %rcx
push %rdi
push %rsi
lea addresses_WT_ht+0x178f3, %rsi
lea addresses_UC_ht+0x30d3, %rdi
nop
nop
nop
nop
nop
inc %r14
mov $72, %rcx
rep movsq
nop
nop
nop
xor $34993, %rdi
lea addresses_A_ht+0x184f3, %r14
nop
nop
nop
no... |
; float __fsmul (float a1, float a2)
SECTION code_fp_math48
PUBLIC cm48_sdcciyp_dsmul
EXTERN cm48_sdcciyp_dread2, am48_dmul, cm48_sdcciyp_m482d
cm48_sdcciyp_dsmul:
; multiply two sdcc floats
;
; enter : stack = sdcc_float a2, sdcc_float a1, ret
;
; exit : dehl = sdcc_float(a1*a2)
;
; uses :... |
match ,{
include 'win32a.inc'
} match -,{
else
include 'selfhost.inc'
end match
_ equ }
format PE large console 4.0
entry start
include '../version.inc'
section '.text' code readable executable
start:
call system_init
call get_arguments
jc display_usage_information
cmp [... |
; A088128: Expansion of e.g.f.: cosh(x)/(1-x)^2.
; Submitted by Christian Krause
; 1,2,7,30,157,970,6931,56294,512569,5173074,57330271,692227822,9045871957,127205130650,1915394962027,30748771424310,524265894691441,9461374592096674,180184121539899319,3611206508019111614
add $0,1
lpb $0
mul $1,$2
cmp $3,0
mul $3,$... |
;================================================================================
; Dialog Pointer Override
;--------------------------------------------------------------------------------
DialogOverride:
LDA $7F5035 : BEQ .skip
LDA $7F5700, X ; use alternate buffer
RTL
.skip
LDA $7F1200, X
RTL
;---------------... |
CGROUP group code
code segment dword 'CODE'
assume cs:CGROUP,ds:CGROUP
;pj_unss2 decodes a FLI_LS chunk of a flic frame.
public pj_unss2
; pj_unss2(cbuf, screen, bpr, screen_seg)
; UBYTE *cbuf; /* points to a FLI_LC chunk after chunk header. */
; UBYTE *screen;
; int screen_seg
pj_unss2 proc n... |
puts:
puts.loop:
LOD $10, $0
CMP $11, $10, #0
BRA puts.end, !EQ $11
STO #1:#0, $10
ADD $0, $0, #1
BRA puts.loop
puts.end:
RET
|
;; last edit date: 2016/11/24
;; author: Forec
;; LICENSE
;; Copyright (c) 2015-2017, Forec <forec@bupt.edu.cn>
;; Permission to use, copy, modify, and/or distribute this code for any
;; purpose with or without fee is hereby granted, provided that the above
;; copyright notice and this permission notice appear in all ... |
.global s_prepare_buffers
s_prepare_buffers:
push %r10
push %r14
push %r15
push %r8
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_normal_ht+0xb23d, %rsi
nop
and $38747, %r10
mov (%rsi), %rdi
nop
nop
nop
and $63129, %r14
lea addresses_D_ht+0x8155, %r8
nop
nop
nop
nop
add %rdx, %rdx
mov (%r8), %esi
nop
nop
nop
no... |
; A055658: Number of (3,n)-partitions of a chain of length n^2.
; 0,0,1,35,286,1330,4495,12341,29260,62196,121485,221815,383306,632710,1004731,1543465,2303960,3353896,4775385,6666891,9145270,12347930,16435111,21592285,28032676,35999900,45770725,57657951,72013410,89231086,109750355,134059345,162698416,196263760,23541112... |
; A025685: Exponent of 10 (value of j) in n-th number of form 3^i*10^j.
; 0,0,0,1,0,1,0,1,2,0,1,2,0,1,2,3,0,1,2,3,0,1,2,3,4,0,1,2,3,4,0,1,2,3,4,5,0,1,2,3,4,5,0,1,2,3,4,5,6,0,1,2,3,4,5,6,0,1,2,3,4,5,6,7,0,1,2,3,4,5,6,7,0,1,2,3,4,5,6,7,8,0,1,2,3,4,5,6,7,8,0,1,2,3,4,5,6,7,8,9
mov $1,$0
lpb $1
sub $1,1
add $3,1
trn ... |
; A167337: Totally multiplicative sequence with a(p) = 2*(5p+1) = 10p+2 for prime p.
; Submitted by Jon Maiga
; 1,22,32,484,52,704,72,10648,1024,1144,112,15488,132,1584,1664,234256,172,22528,192,25168,2304,2464,232,340736,2704,2904,32768,34848,292,36608,312,5153632,3584,3784,3744,495616,372,4224,4224,553696,412,50688,4... |
SECTION code_clib
SECTION code_l_sccz80
PUBLIC dpush3
EXTERN fa
;------------------------------------------------------
; Push FA onto stack under ret address and stacked long
;------------------------------------------------------
dpush3:
exx
pop hl ;save return address
pop de ;save ... |
/*=========================================================================
Program: Visualization Toolkit
Module: vtkOpenGLPolyDataMapper2D.cxx
Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
All rights reserved.
See Copyright.txt or http://www.kitware.com/Copyright.htm for details.
This... |
; A186680: Total number of positive integers below 10^n requiring 17 positive biquadrates in their representation as sum of biquadrates.
; Submitted by Jon Maiga
; 0,3,33,63,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65... |
; A008673: Expansion of 1/((1-x)*(1-x^3)*(1-x^5)*(1-x^7)).
; 1,1,1,2,2,3,4,5,6,7,9,10,12,14,16,19,21,24,27,30,34,38,42,46,51,56,61,67,73,79,86,93,100,108,116,125,134,143,153,163,174,185,197,209,221,235,248,262,277,292,308,324,341,358,376,395,414,434,454,475,497,519,542,566,590,615,641,667,694,722,751,780,810,841,872,90... |
;
; Z88 Graphics Functions - Small C+ stubs
;
; Written around the Interlogic Standard Library
;
; Stubs Written by D Morris - 15/10/98
;
;
; Page the graphics bank in/out - used by all gfx functions
; Simply does a swap...
;
;
; Stefano - Sept 2011
;
;
; $Id: swapgfxbk.asm,v 1.6 201... |
/**
* Copyright (c) 2017, Timothy Stack
*
* 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 condi... |
; Listing generated by Microsoft (R) Optimizing Compiler Version 16.00.30319.01
TITLE C:\JitenderN\REBook\AddNumber\AddNumber\AddNumber.cpp
.686P
.XMM
include listing.inc
.model flat
INCLUDELIB LIBCMT
INCLUDELIB OLDNAMES
PUBLIC ?has_denorm@_Num_base@std@@2W4float_denorm_style@2@B ; std::_Num_base::h... |
;--------------------------------------------------------
; File Created by SDCC : free open source ANSI-C Compiler
; Version 4.1.6 #12419 (Linux)
;--------------------------------------------------------
; Processed by Z88DK
;--------------------------------------------------------
EXTERN __divschar
EXTERN __divsc... |
main.elf: file format elf32-littleriscv
Disassembly of section .text:
00000000 <_start>:
0: 00000037 lui zero,0x0
00000004 <__crt0_pointer_init>:
4: 80002117 auipc sp,0x80002
8: ff810113 addi sp,sp,-8 # 80001ffc <__ctr0_io_space_begin+0x800021fc>
c: 80000197 ... |
; A table that translates key presses on the zx keyboard into ascii
; codes. There are four tables mapping the 8x5 zx matrix to an
; ascii code, each corresponding to the states of the CAPS / SYM
; shift keys.
;
; An effort has been made to emulate the PC keyboard with the CTRL key
; represented by CAPS+SYM shifts si... |
/**
* Copyright 2017-2020 Stefan Ascher
*
* 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, pub... |
clc
adc {m2}
sta {m1}
lda #0
adc {m2}+1
sta {m1}+1 |
TITLE 'SEE IF MEMBER IS IN THE PDS'
SPACE 3
CLEQUM04
BASEREG EQU 12
CLASMS04 CSECT
*******************************************************************
** SAVE REGISTERS, ETC.
*******************************************************************
STM R14,R12,12(R13) ... |
.global s_prepare_buffers
s_prepare_buffers:
push %r10
push %r13
push %rbp
push %rbx
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_normal_ht+0x134e7, %rdi
nop
nop
nop
nop
nop
xor $35422, %rbp
mov (%rdi), %esi
nop
nop
nop
sub %r10, %r10
lea addresses_WT_ht+0x1b9e7, %rsi
lea addresses_normal_ht+0xc08f, %rdi
nop
n... |
; A130664: a(1)=1. a(n) = a(n-1) + (number of terms from among a(1) through a(n-1) which are factorials).
; 1,2,4,6,9,12,15,18,21,24,28,32,36,40,44,48,52,56,60,64,68,72,76,80,84,88,92,96,100,104,108,112,116,120,125,130,135,140,145,150,155,160,165,170,175,180,185,190,195,200,205,210,215,220,225,230,235,240,245,250,255,2... |
#include "tabtexteditor.h"
#include <QHBoxLayout>
#include <QSettings>
#include <QTreeWidget>
#include <QComboBox>
#include <QLabel>
#include <QTextEdit>
#include <QFontDatabase>
#include <QDebug>
TabTextEditor::TabTextEditor(QWidget *parent)
: QWidget(parent)
{
QHBoxLayout *mainLayout = new QHBoxLayout;
... |
; A024853: a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = (natural numbers >= 2).
; 3,4,13,16,34,40,70,80,125,140,203,224,308,336,444,480,615,660,825,880,1078,1144,1378,1456,1729,1820,2135,2240,2600,2720,3128,3264,3723,3876,4389,4560,5130,5320,5950,6160,6853,7084,7843,8... |
; int wa_priority_queue_resize(wa_priority_queue_t *q, size_t n)
SECTION code_clib
SECTION code_adt_wa_priority_queue
PUBLIC wa_priority_queue_resize_callee
EXTERN asm_wa_priority_queue_resize
wa_priority_queue_resize_callee:
pop hl
pop de
ex (sp),hl
jp asm_wa_priority_queue_resize
|
; A318236: a(n) = (3*2^(4*n+3) + 1)/5.
; 5,77,1229,19661,314573,5033165,80530637,1288490189,20615843021,329853488333,5277655813325,84442493013197,1351079888211149,21617278211378381,345876451382054093,5534023222112865485,88544371553805847757,1416709944860893564109,22667359117774297025741,362677745884388752411853,5802843... |
; A301730: Expansion of (x^8-x^7+x^6+5*x^5+4*x^4+3*x^3+5*x^2+5*x+1)/(x^6-x^5-x+1).
; 1,6,11,14,18,24,30,34,38,42,48,54,58,62,66,72,78,82,86,90,96,102,106,110,114,120,126,130,134,138,144,150,154,158,162,168,174,178,182,186,192,198,202,206,210,216,222,226,230,234,240,246,250,254,258,264
mov $1,$0
seq $0,315187 ; Coordin... |
; A254398: Final digits of A237424 in decimal representation.
; 1,4,7,4,7,7,4,7,7,7,4,7,7,7,7,4,7,7,7,7,7,4,7,7,7,7,7,7,4,7,7,7,7,7,7,7,4,7,7,7,7,7,7,7,7,4,7,7,7,7,7,7,7,7,7,4,7,7,7,7,7,7,7,7,7,7,4,7,7,7,7,7,7,7,7,7,7,7,4,7,7,7,7,7,7,7
mov $3,$0
lpb $3
mov $1,$2
sub $3,$4
mov $5,3
lpb $5
sub $5,$3
lpe
... |
.global s_prepare_buffers
s_prepare_buffers:
push %r12
push %r13
push %r15
push %rax
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_UC_ht+0x189c5, %r12
nop
nop
nop
nop
nop
add %rdx, %rdx
movb (%r12), %cl
add $4530, %rsi
lea addresses_D_ht+0x2145, %rax
nop
nop
nop
and %r15, %r15
movb $0x61, (%rax)
nop
nop
nop
inc... |
#include <internal/util/windows/wmi.hpp>
#include <facter/execution/execution.hpp>
#include <leatherman/logging/logging.hpp>
#include <boost/algorithm/string/join.hpp>
#include <boost/algorithm/string/trim.hpp>
#include <boost/range/iterator_range.hpp>
#include <boost/nowide/convert.hpp>
#define _WIN32_DCOM
#include <... |
; A163305: Numerators of fractions in the approximation of the square root of 5 satisfying: a(n)= (a(n-1)+ c)/(a(n-1)+1); with c=5 and a(1)=0. Also product of the powers of two and five times the Fibonacci numbers.
; Submitted by Jon Maiga
; 0,5,10,40,120,400,1280,4160,13440,43520,140800,455680,1474560,4771840,15441920... |
; A139612: 66n + 12.
; 12,78,144,210,276,342,408,474,540,606,672,738,804,870,936,1002,1068,1134,1200,1266,1332,1398,1464,1530,1596,1662,1728,1794,1860,1926,1992,2058,2124,2190,2256,2322,2388,2454,2520,2586,2652,2718,2784,2850,2916,2982,3048,3114,3180,3246,3312,3378,3444,3510,3576,3642,3708,3774,3840,3906,3972,4038,4104... |
TITLE "Spin Locks"
;++
;
; Copyright (c) 1989-1998 Microsoft Corporation
;
; Module Name:
;
; spinlock.asm
;
; Abstract:
;
; This module implements x86 spinlock functions for the PC+MP HAL.
;
; Author:
;
; Bryan Willman (bryanwi) 13 Dec 89
;
; Environment:
;
; Kernel m... |
/**
* @author : archit
* @GitHub : archit-1997
* @email : architsingh456@gmail.com
* @file : sortedArrayToHeightBalancedBST.cpp
* @created : Thursday Jul 29, 2021 10:26:02 IST
*/
#include <bits/stdc++.h>
using namespace std;
void init(){
freopen("input.txt","r",stdin);
freop... |
/*
* full_chain_test.cc
* EDMProto
*
* Created by Chris Jones on 4/3/05.
* Changed by Viji Sundararajan on 29-Jun-05.
*
*/
#include <iostream>
#include "FWCore/Framework/interface/EventSetup.h"
#include "FWCore/Framework/interface/EventSetupProvider.h"
#include "FWCore/Framework/interface/IOVSyncValue.h"
#in... |
; A079635: Sum of (2 - p mod 4) for all prime factors p of n (with repetition).
; Submitted by Christian Krause
; 0,0,-1,0,1,-1,-1,0,-2,1,-1,-1,1,-1,0,0,1,-2,-1,1,-2,-1,-1,-1,2,1,-3,-1,1,0,-1,0,-2,1,0,-2,1,-1,0,1,1,-2,-1,-1,-1,-1,-1,-1,-2,2,0,1,1,-3,0,-1,-2,1,-1,0,1,-1,-3,0,2,-2,-1,1,-2,0,-1,-2,1,1,1,-1,-2,0,-1,1,-4,1,... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.