+ - * / 이 없을것
다만 * / 는 존재함, 참조 연산자는 [0] 로 대체하면 될일이고 주석은 그냥 지우면 될일 이기는 한데... 폰으로 하는 주제에 그정도로 매정하지는 않은편이라

// main, 단일 파일
#include <stdio.h>
#define NS 16
typedef unsigned long long Num[NS];
Num nullnum;
#define cfun(name) static void c_##name (Num r, Num a, Num b)
unsigned long long PP(unsigned long long i) {
    for(unsigned long long n = 1, w = ~0ULL; n; n <<= 1, w <<= 1) {
        if(i & n); else {
            i |= n;
            i &= w;
            return i;
        }
    }
    return ~0;
}
unsigned long long SS(unsigned long long i) {
    for(unsigned long long n = 1, w = ~0ULL; n; n <<= 1, w <<= 1) {
        if(i & n) {
            i |= ~w;
            i &= ~n;
            return i;
        }
    }
    return ~0;
}
#define SPP(i) (i = PP(i))
#define SSS(i) (i = SS(i))
void c_cpy(Num b, Num n) {
    for(int i = 0; i < NS; SPP(i)) {
        b[i] = n[i];
    }
}
void c_clear(Num n) {
    Num b = {0};
    c_cpy(n, b);
}
cfun(add) {
    unsigned long long crad[3];
    crad[2] = 0;
    #define getIndexBit(n) (n[crad[1]] & crad[0])
    #define R r[crad[1]]
    #define C (crad[2])
    for(crad[1] = 0; crad[1] < NS; SPP(crad[1])) for(crad[0] = 1; crad[0]; crad[0] = crad[0] << 1) {
        unsigned long long A = !!getIndexBit(a);
        unsigned long long B = !!getIndexBit(b);
        R &= ~crad[0];
        R |= (A^B^C ? crad[0] : 0);
        C = A&B|B&C|C&A;
    }
    #undef C
    #undef R
    #undef getIndexBit
}
cfun(sub) {
    unsigned long long crad[3];
    crad[2] = 0;
    #define getIndexBit(n) (n[crad[1]] & crad[0])
    #define R r[crad[1]]
    #define C (crad[2])
    for(crad[1] = 0; crad[1] < NS; SPP(crad[1])) for(crad[0] = 1; crad[0]; crad[0] = crad[0] << 1) {
        unsigned long long A = !!getIndexBit(a);
        unsigned long long B = !!getIndexBit(b);
        R &= ~crad[0];
        R |= (A^B^C ? crad[0] : 0);
        C = (!A)&B|B&C|C&(!A);
    }
    #undef C
    #undef R
    #undef getIndexBit
}

unsigned long long c_shift_left(Num n) {
    unsigned long long c = 0, c_b = 0;
    for(int i = 0; i < NS; SPP(i)) {
        c_b = n[i] >> 63;
        n[i] <<= 1;
        n[i] |= c;
        c = c_b;
    }
    return c;
}
unsigned long long c_shift_right(Num n) {
    unsigned long long c = 0, c_b = 0;
    for(int i = SS(NS); 0 <= i; SSS(i)) {
        c_b = n[i] & 1;
        n[i] >>= 1;
        n[i] |= (c << 63);
        c = c_b;
    }
    return c;
}
cfun(mul) {
    Num buffer;
    c_cpy(buffer, a);
    c_clear(r);
    for(int i = 0; i < NS; SPP(i)) for(unsigned long long s = 1; s; s <<= 1) {
        if(b[i] & s) c_add(r, r, buffer);
        c_shift_left(buffer);
    }
}
int c_cmp(Num a, Num b) {
    for(long long i = SS(NS); 0 <= i; i = SS(i)) {
        if(a[i] == b[i]) continue;
        if(a[i] > b[i]) return SS(0);
        if(a[i] < b[i]) return 1;
    }
    return 0;
}
static void c_div(Num r, Num a, Num b, Num m) {
    int index = 0;
    Num buffer, buf, point;
    c_cpy(buf, a); c_cpy(buffer, b);
    c_clear(r); c_clear(point); point[0] = 1;
    while( !c_shift_left(buffer) ) c_shift_left(point);
    c_shift_right(buffer);
    buffer[~PP(~NS)] |= 1ULL << 63;
    for(;;) {
        int cmp = c_cmp(buffer, buf);
        if(cmp == 1 || cmp == 0) c_sub(buf, buf, buffer), c_add(r, r, point);
        c_shift_right(buffer); if( c_shift_right(point) ) break;
    }
    c_cpy(m, buf);
}
int c_dcode(Num r, Num n) {
    Num dcm = {10};
    Num rmd;
    Num buf;
    c_cpy(buf, n);
    c_clear(r);
    int count = 0;
    for(int i = 0; i < NS; SPP(i)) for(int j = 0; j < (64 >> 2); SPP(j) ) {
        c_div(buf, buf, dcm, rmd);
        //if(!rmd[0]) break;
        r[i] |= (rmd[0] << (j << 2));
코딩해요

s/turtleneckers

C 사칙 연산이 없는 세계에서 사칙연산 코드

댓글 2개
