text stringlengths 1 1.05M |
|---|
/* Copyright 2018 The TensorFlow Authors. 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 a... |
; A212969: Number of (w,x,y) with all terms in {0,...,n} and w!=x and x>range{w,x,y}.
; 0,0,2,10,26,56,100,166,252,368,510,690,902,1160,1456,1806,2200,2656,3162,3738,4370,5080,5852,6710,7636,8656,9750,10946,12222,13608,15080,16670,18352,20160,22066,24106,26250,28536,30932,33478,36140
mov $14,$0
mov $16,$0
lpb $16
cl... |
/*
* Copyright (c) 2017-2019 THL A29 Limited, a Tencent company. 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
... |
// Copyright 2017 PDFium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
// Original code copyright 2014 Foxit Software Inc. http://www.foxitsoftware.com
#include "core/fpdfapi/page/cpdf_psfunc.h"
#include "core/fpdfapi/parser/cpdf... |
; A217360: a(n) = 2^n*binomial(4*n, n)/(3*n+1).
; Submitted by Christian Krause
; 1,2,16,176,2240,31008,453376,6888960,107707392,1721477120,28000141312,461964898304,7712495058944,130050777006080,2211737871974400,37892693797109760,653389823437701120,11330548232319664128,197475886172892823552,3457235990102304358400,60771... |
ParryPhoneCalleeScript:
gettrainername STRING_BUFFER_3, HIKER, PARRY1
checkflag ENGINE_PARRY
iftrue .WantsBattle
farscall PhoneScript_AnswerPhone_Male
checkflag ENGINE_PARRY_FRIDAY_AFTERNOON
iftrue .WantsRematch
readvar VAR_WEEKDAY
ifnotequal FRIDAY, .WantsRematch
checktime DAY
iftrue ParryFridayDay
.WantsRe... |
; A021145: Decimal expansion of 1/141.
; 0,0,7,0,9,2,1,9,8,5,8,1,5,6,0,2,8,3,6,8,7,9,4,3,2,6,2,4,1,1,3,4,7,5,1,7,7,3,0,4,9,6,4,5,3,9,0,0,7,0,9,2,1,9,8,5,8,1,5,6,0,2,8,3,6,8,7,9,4,3,2,6,2,4,1,1,3,4,7,5,1,7,7,3,0,4,9,6,4,5,3,9,0,0,7,0,9,2,1
add $0,1
mov $2,10
pow $2,$0
div $2,141
mov $0,$2
mod $0,10
|
; A158321: a(n) = 441n^2 + 2n.
; 443,1768,3975,7064,11035,15888,21623,28240,35739,44120,53383,63528,74555,86464,99255,112928,127483,142920,159239,176440,194523,213488,233335,254064,275675,298168,321543,345800,370939,396960,423863,451648,480315,509864,540295,571608,603803,636880,670839,705680,741403,778008,815495,853864... |
COMMENT @%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
Copyright (c) GeoWorks 1993 -- All Rights Reserved
PROJECT: GeoWrite/pizza
MODULE: Fixed Char/Line/Page controller
FILE: uiFixed.asm
AUTHOR: Brian Witt, Aug 24, 1993
ROUTINES:
Name Description
---- -----------
... |
INCLUDE "Config.asm"
;OUTPUT "build/AmstradDiag.rom"
OUTPUT OutFile
IFDEF PAD_TO_16K
SIZE #4000 ;; Round it up to 16 KB
ENDIF
;; *******************************
;; LOWER ROM BUILD
IFDEF LowerROMBuild
DISPLAY "Lower ROM build"
ORG #0000
ProgramStart:
INCLUDE "HardwareInit.asm"
ENDIF
;; *************... |
lc r4, 0x80000000
lc r5, 0x7fffffff
gts r6, r4, r5
halt
#@expected values
#r4 = 0x80000000
#r5 = 0x7fffffff
#r6 = 0x00000000
#pc = -2147483624
#e0 = 0
#e1 = 0
#e2 = 0
#e3 = 0
|
;
; CPC Maths Routines
;
; August 2003 **_|warp6|_** <kbaccam /at/ free.fr>
;
; $Id: cos.asm,v 1.4 2016-06-22 19:50:48 dom Exp $
;
SECTION smc_fp
INCLUDE "target/cpc/def/cpcfirm.def"
INCLUDE "target/cpc/def/cpcfp.def"
PUBLIC cos
PUBLIC cosc
EXTERN get_para
.cos call g... |
%TITLE "First Program -- HELLO.ASM"
.8086
.MODEL small
.STACK 256
.DATA
msg DB "Hello, World!$"
.CODE
MAIN PROC
mov ax,@data ;Initialize DS to address
mov ds,ax ; of data segment
lea dx,msg ;get message
mov ah,... |
// Copyright (C) 2004, 2006 International Business Machines and others.
// All Rights Reserved.
// This code is published under the Eclipse Public License.
//
// $Id$
//
// Authors: Carl Laird, Andreas Waechter IBM 2004-08-13
#include "IpTaggedObject.hpp"
namespace Ipopt
{
TaggedObject::Tag IPOPT_THREAD_LO... |
; A128445: Number of facets of the Alternating Sign Matrix polytope ASM(n).
; 20,8,4,8,20,40,68,104,148,200,260,328,404,488,580,680,788,904,1028,1160,1300,1448,1604,1768,1940,2120,2308,2504,2708,2920,3140,3368,3604,3848,4100,4360,4628,4904,5188,5480,5780,6088,6404,6728,7060,7400,7748,8104
sub $0,2
pow $0,2
add $0,1
mu... |
; A240603: Numbers that are the sum of two successive squarefree numbers.
; Submitted by Christian Krause
; 3,5,8,11,13,17,21,24,27,29,32,36,40,43,45,49,55,59,61,64,67,69,72,75,77,80,83,85,89,93,98,104,108,112,115,117,120,123,127,131,133,136,139,141,144,147,151,155,157,161,165,168,171,173,176,180,184,187,189,192,198,20... |
; A307294: If n is even, a(n) = A000201(n/2+1), otherwise a(n) = A000201((n-1)/2+1) + 1.
; Submitted by Jon Maiga
; 1,2,3,4,4,5,6,7,8,9,9,10,11,12,12,13,14,15,16,17,17,18,19,20,21,22,22,23,24,25,25,26,27,28,29,30,30,31,32,33,33,34,35,36,37,38,38,39,40,41,42,43,43,44,45,46,46,47,48,49,50,51,51,52,53,54,55
mov $2,$0
div... |
#include "common.asm"
#ifdef VERTEX
; variables
#define lv0 r0
#define lv1 r1
#define lv2 r2
#define lv3 r3
#define normal r4
#define tmp2 r5
#define viewVec r6
#define pos r7
; joint = int(aCoord.w)
mov a0.x, aCoord.w
; pos = mulQuatPos(uBasis[joint], aCoo... |
;;
;; Copyright (c) 2020, Intel Corporation
;;
;; 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 ... |
// Copyright (c) Lawrence Livermore National Security, LLC and other Conduit
// Project developers. See top-level LICENSE AND COPYRIGHT files for dates and
// other details. No copyright assignment is required to contribute to Conduit.
//-----------------------------------------------------------------------------
///... |
; stdio_out_I
; 09.2008 aralbrec
XLIB stdio_out_capi
LIB stdio_nextarg, htonl, stdio_numprec, stdio_outcommon
INCLUDE "../../stdio.def"
; output %I parameter
;
; IPv4 address in dotted decimal notation
; * precision affects each individual octet; can be 1 or 3 (1 is default)
; * width and justification applies to e... |
#include <bits/stdc++.h>
using namespace std;
class Solution {
public:
int dp[1001][1001];
int longestCommonSubsequence(string text1, string text2) {
for (int i = 1; i <= text1.size(); i++) {
for (int j = 1; j <= text2.size(); j++) {
if (text1[i - 1] == text2[j - 1]) {
... |
;******************************************************************************
;* MMX/SSE2-optimized functions for the RV40 decoder
;* Copyright (c) 2010 Ronald S. Bultje <rsbultje@gmail.com>
;* Copyright (c) 2010 Jason Garrett-Glaser <darkshikari@gmail.com>
;* Copyright (C) 2012 Christophe Gisquet <christophe.gisquet... |
; A056051: a(n) = (n-2)! - 1 (mod n).
; 0,0,1,0,-1,0,-1,-1,-1,0,-1,0,-1,-1,-1,0,-1,0,-1,-1,-1,0,-1,-1,-1,-1,-1,0,-1,0,-1,-1,-1,-1,-1,0,-1,-1,-1,0,-1,0,-1,-1,-1,0,-1,-1,-1,-1,-1,0,-1,-1,-1,-1,-1,0,-1,0,-1,-1,-1,-1,-1,0,-1,-1,-1,0,-1,0,-1,-1,-1,-1,-1,0,-1,-1,-1,0,-1,-1,-1,-1,-1,0,-1,-1,-1,-1,-1,-1,-1,0,-1,-1,-1,0
add $0... |
#include <string.h>
#include "../common.hpp"
#include "full.hpp"
#include <bitset>
#include <experimental/coroutine>
namespace {
struct FullFile final : File {
private:
async::result<frg::expected<Error, size_t>>
readSome(Process *, void *data, size_t length) override {
memset(data, 0, length);
co_return leng... |
; A275973: A binary sequence due to Harold Jeffreys.
; 1,0,1,1,0,0,0,0,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,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,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,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,1,1,1,1,1... |
#include<bits/stdc++.h>
using namespace std;
//Write a program to find Number of digits in an integer
int main(){
cout<<"hello";
return 0;
} |
<%
from pwnlib.shellcraft.arm.linux import syscall
%>
<%page args="fd, path, buf, length"/>
<%docstring>
Invokes the syscall readlinkat. See 'man 2 readlinkat' for more information.
Arguments:
fd(int): fd
path(char): path
buf(char): buf
len(size_t): len
</%docstring>
${syscall('SYS_readlinka... |
###############################################################################
# Copyright 2018 Intel Corporation
# All Rights Reserved.
#
# If this software was obtained under the Intel Simplified Software License,
# the following terms apply:
#
# The source code, information and material ("Material") containe... |
// Copyright 2017 PDFium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
// Original code copyright 2014 Foxit Software Inc. http://www.foxitsoftware.com
#include "xfa/fxfa/parser/cxfa_day.h"
#include "fxjs/xfa/cjx_node.h"
#include... |
/*
[auto_generated]
boost/numeric/odeint/stepper/symplectic_rkn_sb3a_mclachlan.hpp
[begin_description]
Implementation of the symplectic MacLachlan stepper for separable Hamiltonian system.
[end_description]
Copyright 2009-2011 Karsten Ahnert
Copyright 2009-2011 Mario Mulansky
Distributed under the Boost S... |
#include "stdafx.h"
#include "Headers/Input.h"
#include <SDL_keycode.h>
namespace Divide {
namespace Input {
struct KeyMapEntry {
SDL_Keycode _sdlKCode;
KeyCode _kCode;
};
constexpr KeyMapEntry KeyCodeSDLMap[] = {
{SDLK_ESCAPE, KeyCode::KC_ESCAPE},
{SDLK_1, KeyCode::KC_1}... |
//===--- TaskStatus.cpp - Unit tests for the task-status API --------------===//
//
// 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... |
.386p
ASSUME CS:CODE
PUBLIC BT_MEM_R32
PUBLIC BT_MEM_R16
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
EFLAGS_CF EQU 00001H
EFLAGS_PF EQU 00004H
EFLAGS_AF EQU 00010H
EFLAGS_ZF EQU 00040H
EFLAGS_SF EQU 00080H
EFLAGS_TRAP ... |
; A004767: a(n) = 4*n + 3.
; 3,7,11,15,19,23,27,31,35,39,43,47,51,55,59,63,67,71,75,79,83,87,91,95,99,103,107,111,115,119,123,127,131,135,139,143,147,151,155,159,163,167,171,175,179,183,187,191,195,199,203,207,211,215,219,223,227,231,235,239,243,247,251,255,259,263,267,271,275,279,283,287,291,295,299,303,307,311,315,31... |
#include <cstddef>
#include <sstream>
#include "yaml-cpp/ostream_wrapper.h"
#include "gtest/gtest.h"
namespace {
TEST(OstreamWrapperTest, BufferNoWrite) {
YAML::ostream_wrapper wrapper;
EXPECT_STREQ("", wrapper.str());
}
TEST(OstreamWrapperTest, BufferWriteStr) {
YAML::ostream_wrapper wrapper;
wrapper.write(... |
/******************************************************************************
* Copyright (c) 2013 Potential Ventures Ltd
* Copyright (c) 2013 SolarFlare Communications Inc
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that t... |
;*
;* x86_64-bios/bootboot.asm
;*
;* Copyright (C) 2017 - 2021 bzt (bztsrc@gitlab)
;*
;* 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 t... |
; A320829: Continued fraction of the positive constant t in (1,2) such that the partial denominators form the Beatty sequence {floor((n+1)*t), n >= 0}.
; 1,2,4,5,7,8,10,11,13,14,15,17,18,20,21,23,24,26,27,28,30,31,33,34,36,37,39,40,41,43,44,46,47,49,50,52,53,54,56,57,59,60,62,63,65,66,67,69,70,72,73,75,76,78,79,81,82,8... |
; Z88 Small C+ Run Time Library
; Long support functions
;
; djm 25/2/99
; Made work! - Seems a little messed up previously (still untested)
;
; aralbrec 01/2007
; shifts are faster than doubling and ex with de/hl
SECTION code_crt0_sccz80
PUBLIC l_long_asl
PUBLIC l_lon... |
; A013715: a(n) = 10^(2n+1).
; 10,1000,100000,10000000,1000000000,100000000000,10000000000000,1000000000000000,100000000000000000,10000000000000000000,1000000000000000000000,100000000000000000000000,10000000000000000000000000,1000000000000000000000000000,100000000000000000000000000000,10000000000000000000000000000000,1... |
/*
* Bwt.cpp
*
* Created on: Oct 30, 2016
* Author: frka
*/
#include "BWTree.h"
#include <vector>
#include <bitset>
#include <cmath>
#include <unordered_map>
#include <iostream>
#include "algorithms.h"
using namespace std;
BWTree::BWTree(const string &s, const Alphabet &a)
: alphabet_(a),
... |
; A184016: n+floor(3*sqrt(n)); complement of A184017.
; 4,6,8,10,11,13,14,16,18,19,20,22,23,25,26,28,29,30,32,33,34,36,37,38,40,41,42,43,45,46,47,48,50,51,52,54,55,56,57,58,60,61,62,63,65,66,67,68,70,71,72,73,74,76,77,78,79,80,82,83,84,85,86,88,89,90,91,92,93,95,96,97,98,99,100,102,103,104,105,106,108,109,110,111,112,1... |
;;*****************************************************************************
;;*****************************************************************************
;; Filename: SleepTimer.asm
;; Version: 1.0, Updated on 2015/3/4 at 22:26:59
;; Generated by PSoC Designer 5.4.3191
;;
;; DESCRIPTION: SleepTimer User Mo... |
; A029916: Convert n from meters to yards.
; 0,1,2,3,4,5,7,8,9,10,11,12,13,14,15,16,17,19,20,21,22,23,24,25,26,27,28,30,31,32,33,34,35,36,37,38,39,40,42,43,44,45,46,47,48,49,50,51,52,54,55,56,57,58,59,60,61,62,63,65,66,67,68,69,70,71,72,73
mov $3,$0
lpb $0,1
add $0,5
mov $2,$0
mov $0,1
mul $2,4
mov $1,$2
m... |
; A005029: 13*2^n.
; 13,26,52,104,208,416,832,1664,3328,6656,13312,26624,53248,106496,212992,425984,851968,1703936,3407872,6815744,13631488,27262976,54525952,109051904,218103808,436207616,872415232,1744830464,3489660928,6979321856,13958643712,27917287424,55834574848,111669149696,223338299392,446676598784,893353197568,1... |
srlv $5,$4,$3
sh $4,8($0)
sltu $3,$3,$3
srlv $3,$1,$3
lbu $6,5($0)
srl $6,$3,28
slti $5,$3,9749
sra $1,$3,27
sltu $6,$4,$3
xor $3,$4,$3
sllv $3,$4,$3
ori $5,$1,2579
lb $3,4($0)
sll $3,$3,27
sltiu $4,$3,25482
lbu $2,5($0)
srav $4,$0,$3
sllv $3,$6,$3
addu $5,$4,$3
srlv $5,$5,$3
lhu $6,0($0)
slti $3,$0,-7659
addu $5,$6,$3... |
; void dzx7_agile_rcs_callee(void *src, void *dst)
SECTION code_clib
SECTION code_compress_zx7
PUBLIC _dzx7_agile_rcs_callee
EXTERN asm_dzx7_agile_rcs
_dzx7_agile_rcs_callee:
pop af
pop hl
pop de
push af
jp asm_dzx7_agile_rcs
|
.global s_prepare_buffers
s_prepare_buffers:
push %rax
push %rbx
push %rcx
push %rdi
push %rsi
lea addresses_normal_ht+0x151c4, %rsi
lea addresses_D_ht+0x1d784, %rdi
nop
nop
nop
nop
nop
dec %rbx
mov $116, %rcx
rep movsq
nop
xor $45006, %rax
pop %rsi
pop %rdi
pop %rcx
pop %rbx
pop %rax
ret
.global s_faulty_load
s_f... |
; Disassembly of "metroid2.gb"
SECTION "ROM Bank $008", ROMX[$4000], BANK[$8]
or b ; $4000: $b0
or c ; $4001: $b1
or d ; $4002: $b2
or e ;... |
; mfm verify for write operation
cmdele lda #3
sta bufpnt+1 ; buffer #0
ldy #0 ; even page
sty bufpnt
ldx mfmsiz_hi ; get sector high
lda cmdbuf+3 ; get track address
sta wdtrk ; give track to wd
lda cmdbuf+4 ; get sector address
... |
; A188075: Positions of 0 in the zero-one sequence [nr]-[4r]-[nr-4r], where r=sqrt(3), n>=1.
; 4,15,30,45,56,71,86,101,112,127,142,157,168,183,198,209,224,239,254,265,280,295,310,321,336,351,366,377,392,407,418,433,448,463,474,489,504,519,530,545,560,575,586,601,616,627,642,657,672,683,698,713,728,739,754,769,780,795,8... |
.global s_prepare_buffers
s_prepare_buffers:
push %r10
push %r12
push %r13
push %r9
push %rax
push %rbp
push %rcx
push %rdi
push %rsi
lea addresses_WT_ht+0x1ee77, %rax
nop
nop
nop
nop
add %r13, %r13
mov $0x6162636465666768, %r10
movq %r10, (%rax)
nop
nop
dec %rax
lea addresses_A_ht+0x40f1, %rsi
nop
nop
nop
nop
xor %r12... |
; A069834: a(n) = n-th reduced triangular number: n*(n+1)/{2^k} where 2^k is the largest power of 2 that divides product n*(n+1).
; 1,3,3,5,15,21,7,9,45,55,33,39,91,105,15,17,153,171,95,105,231,253,69,75,325,351,189,203,435,465,31,33,561,595,315,333,703,741,195,205,861,903,473,495,1035,1081,141,147,1225,1275,663,689,14... |
; A130102: E.g.f.: (e^x - x)^2.
; 1,0,2,2,8,22,52,114,240,494,1004,2026,4072,8166,16356,32738,65504,131038,262108,524250,1048536,2097110,4194260,8388562,16777168,33554382,67108812,134217674,268435400,536870854,1073741764,2147483586,4294967232,8589934526,17179869116,34359738298,68719476664,137438953398,274877906868,5497... |
/******************************************************************************
* ____ _ _____ *
* / ___| / \ | ___| C++ *
* | | / _ \ | |_ Actor *
... |
; void *b_vector_size_fastcall(b_vector_t *v)
SECTION code_adt_b_vector
PUBLIC _b_vector_size_fastcall
EXTERN _b_array_size_fastcall
defc _b_vector_size_fastcall = _b_array_size_fastcall
INCLUDE "adt/b_vector/z80/asm_b_vector_size.asm"
|
;
; This file is automatically generated
;
; Do not edit!!!
;
; djm 12/2/2000
;
; ZSock Lib function: sock_setrsize
SECTION code_clib
PUBLIC sock_setrsize
PUBLIC _sock_setrsize
EXTERN no_zsock
INCLUDE "packages.def"
INCLUDE "zsock.def"
.sock_setrsize
._sock_setrsize
ld a,r_sock_setrsize
call_pkg(tcp_... |
// This file is part of www.nand2tetris.org
// and the book "The Elements of Computing Systems"
// by Nisan and Schocken, MIT Press.
// File name: projects/04/Mult.asm
// Multiplies R0 and R1 and stores the result in R2.
// (R0, R1, R2 refer to RAM[0], RAM[1], and RAM[2], respectively.)
@i
M = 1
@R2
... |
#include <utils/String8.h>
namespace android {
extern "C" void _ZN7android12ConsumerBase7setNameERKNS_7String8E(const String8& name);
extern "C" void _ZN7android9StopWatchC1EPKci(const char* name, int clock);
extern "C" void _ZN7android5FenceD1Ev() {}
extern "C" void _ZN7android10GLConsumer7setNameERK... |
;++
;
; Copyright (c) Microsoft Corporation. All rights reserved.
;
; Licensed under the MIT License.
;
; Module Name:
;
; SgemmKernelAvx512F.asm
;
; Abstract:
;
; This module implements the kernels for the single precision matrix/matrix
; multiply operation (SGEMM).
;
; This implementation uses AVX512F instruc... |
Name: zel_ram.asm
Type: file
Size: 65880
Last-Modified: '2016-05-13T04:20:48Z'
SHA-1: 9E1CD233488091DA27F11F959531927171112854
Description: null
|
; A166676: Totally multiplicative sequence with a(p) = 9p+2 for prime p.
; Submitted by Jon Maiga
; 1,20,29,400,47,580,65,8000,841,940,101,11600,119,1300,1363,160000,155,16820,173,18800,1885,2020,209,232000,2209,2380,24389,26000,263,27260,281,3200000,2929,3100,3055,336400,335,3460,3451,376000,371,37700,389,40400,39527,... |
#ifndef Statystyka__hh
#define Statystyka__hh
#include <iostream>
#include "film.hh"
using namespace std;
void statystyka(film *lista_kubelkowa,int rozmiar)
{
int liczba_powtorzen=0;
int tablica[11]={0,0,0,0,0,0,0,0,0,0,0};
int dominanta=0;
int mediana = 0;
float srednia= 0;
int suma =0;... |
; Ellipse Workstation 1100 (fictitious computer)
; Ellipse DOS command interpreter (CONSOLE.COM)
;
; Copyright (c) 2020 Sampo Hippeläinen (hisahi)
;
; Permission is hereby granted, free of charge, to any person obtaining a copy
; of this software and associated documentation files (the "Software"), to deal
; i... |
dseg segment
N1 DB ?,?,?,? ;first number
N2 DB ? ;second number
N3 DB ?,?,?,? ;answer number
MESSErr DB 0Ah,0Dh,"input is not correct",0Ah,0Dh, '$' ;error message
Number1 DB "Enter first number",0Ah,0Dh, '$' ;request message
Number2 DB 0Ah,0Dh,"Enter second number",0Ah,0Dh, '$' ;request message
... |
; A037530: Base-5 digits are, in order, the first n terms of the periodic sequence with initial period 1,1,2.
; Submitted by Christian Krause
; 1,6,32,161,806,4032,20161,100806,504032,2520161,12600806,63004032,315020161,1575100806,7875504032,39377520161,196887600806,984438004032,4922190020161,24610950100806,12305475050... |
//$Id$
//------------------------------------------------------------------------------
// GmatCommandPanel
//------------------------------------------------------------------------------
// GMAT: General Mission Analysis Tool
//
// Copyright (c) 2002 - 2017 United States Government as rep... |
; Ellipse Workstation 1100 (fictitious computer)
; Ellipse DOS console I/O functionality
;
; Copyright (c) 2020 Sampo Hippeläinen (hisahi)
;
; 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 So... |
.global s_prepare_buffers
s_prepare_buffers:
push %r10
push %r11
push %r15
push %rax
push %rbx
push %rcx
push %rdi
push %rsi
lea addresses_WT_ht+0x794f, %rsi
lea addresses_WT_ht+0x1998b, %rdi
nop
nop
nop
nop
and %rbx, %rbx
mov $8, %rcx
rep movsw
nop
nop
nop
nop
cmp $9109, %r10
lea addresses_WT_ht+0x15888, %r11
nop
nop
... |
; A212521: Number of (w,x,y,z) with all terms in {1,...,n} and w>=2x and y<=3z.
; Submitted by Jamie Morken(s3)
; 0,0,4,18,60,138,297,528,912,1440,2200,3180,4536,6174,8330,10920,14144,17928,22599,27900,34300,41580,50094,59664,70848,83148,97344,113022,130732,150150,172125,195840,222464,251328,283220,317628,355752,396378... |
; A303916: Constant term in the expansion of (Sum_{k=0..n} k*(x^k + x^(-k)))^3.
; 0,0,12,84,324,924,2184,4536,8568,15048,24948,39468,60060,88452,126672,177072,242352,325584,430236,560196,719796,913836,1147608,1426920,1758120,2148120,2604420,3135132,3749004,4455444,5264544,6187104,7234656,8419488,9754668,11254068,129323... |
; $Id: exceptionsR3-asm.asm $
;; @file
; exceptionsR3-asm.asm - assembly helpers.
;
;
; Copyright (C) 2009-2017 Oracle Corporation
;
; This file is part of VirtualBox Open Source Edition (OSE), as
; available from http://www.virtualbox.org. This file is free software;
; you can redistribute it and/or modify it under t... |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
#include<ctime>
#include<set>
typedef long long lld;
using namespace std;
#ifdef DEBUG
#define debug(x) cout<<__LINE__<<" "<<#x<<"="<<x<<endl;
#else
#define ... |
; A339684: a(n) = Sum_{d|n} 4^(d-1).
; 1,5,17,69,257,1045,4097,16453,65553,262405,1048577,4195413,16777217,67112965,268435729,1073758277,4294967297,17179935765,68719476737,274878169413,1099511631889,4398047559685,17592186044417,70368748389461,281474976710913,1125899923619845,4503599627436049,18014398576595013,720575940... |
; A058066: a(n) = floor(n*t), t = 1 + sqrt(5)/2.
; 0,2,4,6,8,10,12,14,16,19,21,23,25,27,29,31,33,36,38,40,42,44,46,48,50,52,55,57,59,61,63,65,67,69,72,74,76,78,80,82,84,86,88,91,93,95,97,99,101,103,105,108,110,112,114,116,118,120,122,124,127
mov $1,36
mul $1,$0
div $1,17
mov $0,$1
|
// Copyright (c) 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 "wallet.h"
#include "walletdb.h"
#include "sk21rpc.h"
#include "init.h"
#inclu... |
global _start
section .data
align 2
hello: db 'Hello world!', 0xa
helloLen: equ $-hello
section .bss
section .text
_start:
mov eax, 0x4
mov ebx, 0x1
mov ecx, hello
mov edx, helloLen
int 0x80
mov eax, 0x1
xor ebx, ebx
int 0x80
|
#include "scale.h"
#include <algorithm>
#include <cmath>
#include <set>
using namespace Vizzu;
using namespace Vizzu::Diag;
bool Vizzu::Diag::isAxis(ScaleId type)
{
return type == Diag::ScaleId::x
|| type == Diag::ScaleId::y;
}
Scale::Scale()
{
labelLevel.set(0);
}
Scale::Scale(Type type, double def, bool stac... |
#include "TestController.h"
using namespace example;
void TestController::asyncHandleHttpRequest(
const HttpRequestPtr &req,
std::function<void(const HttpResponsePtr &)> &&callback) {
// write your application logic here
LOG_WARN << req->matchedPathPatternData();
LOG_DEBUG << "index=" << threadIndex_.getThreadDa... |
/*******************************************************************************
Copyright (c) 2010, Jonathan Hiller
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... |
SECTION code_clib
SECTION code_fp_math48
PUBLIC _ldexp
EXTERN cm48_sdcciy_ldexp
defc _ldexp = cm48_sdcciy_ldexp
|
; void *heap_alloc_unlocked(void *heap, size_t size)
SECTION code_alloc_malloc
PUBLIC heap_alloc_unlocked
EXTERN asm_heap_alloc_unlocked
heap_alloc_unlocked:
pop af
pop hl
pop de
push de
push hl
push af
jp asm_heap_alloc_unlocked
|
; A047503: Numbers that are congruent to {0, 2, 3, 4, 5, 7} mod 8.
; 0,2,3,4,5,7,8,10,11,12,13,15,16,18,19,20,21,23,24,26,27,28,29,31,32,34,35,36,37,39,40,42,43,44,45,47,48,50,51,52,53,55,56,58,59,60,61,63,64,66,67,68,69,71,72,74,75,76,77,79,80,82,83,84,85,87
mov $1,1
add $1,$0
mov $2,$0
mod $0,2
add $1,$0
div $1,3
ad... |
// Copyright (c) 2012 The Chromium Embedded Framework Authors. All rights
// reserved. Use of this source code is governed by a BSD-style license that
// can be found in the LICENSE file.
//
// ---------------------------------------------------------------------------
//
// This file was generated by the CEF translato... |
;================================================================================
; Randomize Zora King
;--------------------------------------------------------------------------------
LoadZoraKingItemGFX:
LDA.l $1DE1C3 ; location randomizer writes zora item to
JML.l PrepDynamicTile
;-----------------------------... |
; A006859: From paths in the plane.
; 1,30,330,2145,10010,37128,116280,319770,793155,1808950,3848130,7719075,14725620,26898080,47303520,80454132,132835365,213578430,335304970,515175045,776173134,1148670600,1672307000,2398236750,3391791975,4735616886,6533333730,8913805255
mov $2,$0
add $2,1
mov $1,$2
cal $1,6333 ; From... |
/*
* Copyright (c) Meta Platforms, Inc. and affiliates.
*
* This source code is licensed under the MIT license found in the
* LICENSE file in the root directory of this source tree.
*/
#include <memory>
#include <gtest/gtest.h>
#include <react/renderer/componentregistry/ComponentDescriptorProviderRegistry.h>
#i... |
ITERATIONS = 32
fraction_bits = 12 ; including the bottom 0
integer_bits = 4
total_bits = fraction_bits + integer_bits
oswrch = &FFEE
osbyte = &FFF4
accon = &FE34
romsel = &FE30
romsel_ram = &F4
evntv = &220
sheila = &fe00
ifr = 13
ier = 14
system_via = &40
kbd_irq = 1<<0
v... |
; A169523: Number of reduced words of length n in Coxeter group on 30 generators S_i with relations (S_i)^2 = (S_i S_j)^34 = I.
; 1,30,870,25230,731670,21218430,615334470,17844699630,517496289270,15007392388830,435214379276070,12621216999006030,366015292971174870,10614443496164071230,307818861388758065670,8926746980273... |
; A024399: a(n) = [ (3rd elementary symmetric function of S(n))/(first elementary symmetric function of S(n)) ], where S(n) = {first n+2 positive integers congruent to 2 mod 3}.
; 5,31,101,248,515,952,1619,2586,3930,5738,8107,11141,14954,19670,25420,32345,40596,50331,61718,74935,90167,107609,127466,149950,175283,203697... |
include "../hardware.inc"
rsreset
def CHANA_START rw
def CHANA_FLAGS rb
def CHANA_SPEED rb
def CHANA_LENGTH rb
def CHANA_NOTE rb
def CHANA_POINTER rw
def sizeof_CHANNEL equ _RS
section "Timer interrupt", rom0[$0050]
ei
jp Timer
section "Audio ROM", rom0
;; Initialises the audio system
AudioInit::... |
user/_find: file format elf64-littleriscv
Disassembly of section .text:
0000000000000000 <find>:
#include "kernel/stat.h"
#include "user.h"
#include "kernel/fs.h"
void find(char *path, char *filename)
{
0: d8010113 addi sp,sp,-640
4: 26113c23 sd ra,632(sp)
8: 26813823 sd ... |
.global s_prepare_buffers
s_prepare_buffers:
push %r14
push %rax
push %rbp
push %rbx
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_WC_ht+0x2153, %rsi
lea addresses_normal_ht+0x1b57b, %rdi
clflush (%rdi)
nop
nop
sub %rdx, %rdx
mov $78, %rcx
rep movsq
nop
nop
nop
nop
nop
add $47698, %rdi
lea addresses_WC_ht+0x1cc... |
;
; LED BLINK for SBC-IO(PIA)
; KUNI-NET
CPU 6502
TARGET: EQU "6502"
;
; PIA ADDRESS
;
PIACTLB EQU $8053
PIADATB EQU $8052
PIACTLA EQU $8051
PIADATA EQU $8050
;
WORK_AD EQU $30
;
ORG $200
START:
JSR PIA_INIT
LDA #$20
... |
; A111368: The number of maximal determinant {-1,1} matrices of order n.
; 1,1,1,1,1,1,1,1,1,1,3,1,1,1,1,5,3,3,3,3,7
lpb $0,1
trn $0,4
mov $1,$0
add $2,$0
trn $0,1
add $1,$2
trn $1,2
sub $2,$0
lpe
mul $1,2
add $1,1
|
;******************************************************************************
;* V210 SIMD pack
;* Copyright (c) 2014 Kieran Kunhya <kierank@obe.tv>
;*
;* This file is part of Libav.
;*
;* Libav is free software; you can redistribute it and/or
;* modify it under the terms of the GNU Lesser General Public
;* License a... |
; A050461: a(n) = Sum_{d|n, n/d=1 mod 4} d^2.
; Submitted by Simon Strandgaard
; 1,4,9,16,26,36,49,64,82,104,121,144,170,196,234,256,290,328,361,416,442,484,529,576,651,680,738,784,842,936,961,1024,1090,1160,1274,1312,1370,1444,1530,1664,1682,1768,1849,1936,2132,2116,2209,2304,2402,2604,2610,2720,2810,2952,3146,3136,32... |
/**
* @Allen Chen
* Setup for this test:
* 1. Include all sensor libraries (Tools -> Manage Libraries -> Type in names of sensor libraries
* 2. Connect the pins of the sensor board (breadboard or integrated) to the main board in the following manner:
* - VIN (on Sensor Board) to 5V (Teensy)
* - GND o GND
*... |
.include "myTiny13.h"
.equ SCROLLSPEED, 230
; This Programm analysed 2 bytes to make a sequence of numbers
; who represents the LEDs, which have to be ON :
;
; Positions (0=off)
; ---------------------
; 11,10, 9, 8
; 15,14,13,12
; 23,22,21,20
; 19,18,17,16
; Register to Load up- and down-Byte
U = 21
D = 22
; Like ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.