size-1

Search BackLinks only
Display context of search results
Case-sensitive searching

• SpiralArray/Leonardong . . . . 22 matches
        self.assertEquals( (self.size-1,0), Down().move( (self.size-1,0), self.board ) )
        self.assertEquals( (self.size-1,0), Up().move( (self.size,0), self.board ) )
        self.assertEquals( (0,self.size-1), self.mover.position() )
        self.assertEquals( (self.size-1,0), points.pop().coordinate )
        self.mover._setPosition((self.size-1, self.size-1))
        self.assertEquals( self.size-1, points.pop().value )
        self.assertEquals( (self.size-1, self.size-1),
        self.array.get(self.size-1, self.size-1).coordinate )
        self.assertEquals( (0,self.size-1), self.mover.position() )
        self.assertEquals( (self.size-1,0), points.pop().coordinate )
        self.mover.setPosition((self.size-1, self.size-1))
        self.assertEquals( self.size-1, points.pop().value )
        self.assertEquals( (self.size-1) * 4 , len( points ) )
        self.assertEquals( (self.size-1, self.size-1),
        self.array.get(self.size-1, self.size-1).coordinate )
• RandomWalk/김아영 . . . . 6 matches
        case 2 : if(x!=arsize-1 && y!=0)
        case 3 : if(x!=arsize-1)
        case 4 : if(x!=arsize-1 && y!=arsize-1)
        case 5 : if(y!=arsize-1)
        case 6 : if(x!=0 && y!=arsize-1)
• 마방진/문원명 . . . . 5 matches
        if( (row == 0) && (col == size-1) )
        row = size-1;
        row = size-1;
        else if (col == size-1)
        if(row == size-1)
• MedusaCppStudy/세람 . . . . 4 matches
        row = size-1;
        if(col > size-1)
        if(row < 0 && col > size-1)
        row = size-1;
• JollyJumpers/임인택 . . . . 3 matches
        boolean isExist[] = new boolean[size-1];
        for(int i=0; i<size-1; ++i) {
        return (count == size-1)?"Jolly":"NotJolly";
• Code/RPGMaker . . . . 2 matches
        value = args[args.size-1]
        args.delete_at(args.size-1)
• JollyJumpers/강소현 . . . . 2 matches
        for(int i=0; i<size-1; i++){
        for(int i=1; i<=size-1;i++){
• RandomWalk/종찬 . . . . 2 matches
        if (x<size-1) {
        if (y<size-1) {
• Scheduled Walk/소영&재화 . . . . 2 matches
        i=length_size-1;
        j=width_size-1;
• ScheduledWalk/임인택 . . . . 2 matches
        if( curX<0 ) curX = size-1; // warp
        if( curY<0 ) curY = size-1; // warp
• whiteblue/MagicSquare . . . . 2 matches
        i = size-1;
        j = size-1;
• 마방진/장창재 . . . . 2 matches
        st_place_h = size-1;
        st_place_y = size-1;
• AcceleratedC++/Chapter3 . . . . 1 match
        * etc : vector의 맨 처음 인덱스는 [0]이다. 마지막은 [size-1]
• EightQueenProblem/강인수 . . . . 1 match
        if curRow == self.size-1:
• RandomWalk/동기 . . . . 1 match
        int MAX=size-1;
• StacksOfFlapjacks/이동현 . . . . 1 match
        for(int j=arr_size-1, n=1;j>=0;j--, n++){
• 마름모출력/zyint . . . . 1 match
        for i in range(size-1,0,-1):
• 마방진/변준원 . . . . 1 match
        for(mabang[size-1][size/2]) != size*size)
• 알고리즘8주숙제/문보창 . . . . 1 match
        priorPrioritySet(0, size-1, 0);
• 정모/2013.5.6/CodeRace . . . . 1 match
        if (j == size-1)

Found 20 matching pages out of 7540 total pages (5000 pages are searched)

You can also click here to search title.