Comment detail

循環関数 (Nested Flatten)
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
int modular(int n, int low, int high) {
    return low + (n + high - low + 1) % (high - low + 1);
}

unittest {
    assert(modular(0,100,200)   == 100);
    assert(modular(50,100,200)  == 150);
    assert(modular(100,100,200) == 200);
    assert(modular(101,100,200) == 100);
    assert(modular(-1,100,200)  == 200);
    assert(modular(1,-5,200)    ==  -4);
    assert(modular(-500,-5,-1)  ==  -5);
}

Index

Feed

Other

Link

Pathtraq

loading...