- MineSweeper/이승한 . . . . 18 matches
if M[i-1][j-1]!= '*' and i-1>=0 and j-1>=0 and i-1<width and j-1<height:
M[i-1][j-1]=M[i-1][j-1]+1
if M[i][j-1]!= '*' and i>=0 and j-1>=0 and i<width and j-1<height:
M[i][j-1]=M[i][j-1]+1
if M[i+1][j-1]!= '*' and i+1>=0 and j-1>=0 and i+1<width and j-1<height:
M[i+1][j-1]=M[i+1][j-1]+1
if(map[i-1][j-1]=='*')minecount++;
if(map[i][j-1]=='*')minecount++;
if(map[i+1][j-1]=='*')minecount++;
- IsBiggerSmarter?/문보창 . . . . 7 matches
t[i][j] = t[i-1][j-1] + 1;
else if (t[i-1][j] >= t[i][j-1])
t[i][j] = t[i][j-1];
return t[i-1][j-1];
print_lcs(i-1, j-1, t);
else if (t[i-1][j] >= t[i][j-1])
print_lcs(i, j-1, t);
- 파스칼삼각형/구자겸 . . . . 5 matches
array[i-1][j-1] = 1;
printf("%d ", array[i-1][j-1]);
array[i-1][j-1] = array[i-2][j-2]+array[i-2][j-1];
printf("%d ", array[i-1][j-1]);
- ClassifyByAnagram/sun . . . . 4 matches
qsort2( l, j-1 );
qsort2( l, j-1 );
qsort2( l, j-1 );
qsort2( buf, l, j-1 );
- EuclidProblem/차영권 . . . . 4 matches
coefficient[j+1].X = coefficient[j+1].Y * coefficient[j].X + coefficient[j-1].X;
coefficient[j+1].Y = coefficient[j+1].Y * coefficient[j].Y + coefficient[j-1].Y;
cout << coefficient[j-1].X << " " << coefficient[j-1].Y << " " << GCD << endl;
- Hartals/차영권 . . . . 4 matches
if ((j-1)%7 == 5 || (j-1)%7 == 6 || Days[j-1] == true)
Days[j-1] = true;
- TugOfWar/문보창 . . . . 4 matches
right[rcount++] = weight[j-1];
sumright += weight[j-1];
left[lcount++] = weight[j-1];
sumleft += weight[j-1];
- EightQueenProblem/임인택 . . . . 3 matches
for(y=j-1; y>=0 && sum==0; y--) /* 위로 */
for(x=i-1, y=j-1; x>=0 && y>=0 && sum==0; x--, y--) /* 대각선 */
for(x=i+1, y=j-1; x<QUEEN && y>=0 && sum==0; x++, y--) /* 대각선 */
- EightQueenProblem/임인택/java . . . . 3 matches
for(y=j-1; y>=0 && sum==0; y--) /* 위로 */
for(x=i-1, y=j-1; x>=0 && y>=0 && sum==0; x--, y--) /* 대각선 */
for(x=i+1, y=j-1; x<QUEEN && y>=0 && sum==0; x++, y--) /* 대각선 */
- MineSweeper/김회영 . . . . 3 matches
arrayOfMine[(i-1)*width+(j-1)]++;
arrayOfMine[(i)*width+(j-1)]++;
arrayOfMine[(i+1)*width+(j-1)]++;
- MineSweeper/허아영 . . . . 3 matches
outputField[i-1][j-1] += 1; // 대각선 왼쪽 위
outputField[i+1][j-1] += 1; // 대각선 왼쪽 아래
outputField[i][j-1] += 1; // 왼쪽
- WeightsAndMeasures/문보창 . . . . 3 matches
if (j != 0 && dynamic[(i-1)%2][j-1] + t[i].weight < dynamic[(i-1)%2][j] &&
dynamic[(i-1)%2][j-1] + t[i].weight <= t[i].strength)
dynamic[i%2][j] = dynamic[(i-1)%2][j-1] + t[i].weight;
- minesweeper/Celfin . . . . 3 matches
if(mine[j-1][i-1]=='*')
if(mine[j-1][i]=='*')
if(mine[j-1][i+1]=='*')
- whiteblue/MyTermProject . . . . 3 matches
if ( *(x+j*14) >= *(x+(j-1)*14) )
copy_data[j] = copy_data[j-1];
copy_data[j-1] = temp;
- BusSimulation/조현태 . . . . 2 matches
humans[j-1]=humans[j];
humans[j-1]=humans[j];
- CuttingSticks/하기웅 . . . . 2 matches
stick[i][j].len = stick[i][j-1].len+stick[i+1][j].len-stick[i+1][j-1].len;
- PascalTriangle . . . . 2 matches
Array[i][j]=Array[i-1][j-1]+Array[i-1][j];
row[current][j]=row[!current][j-1]+row[!current][j];
- TheJavaMan/스네이크바이트 . . . . 2 matches
tSnake[j].Move(tSnake[j-1]);
tSnake[j].Move(tSnake[j-1]);
- TicTacToe/유주영 . . . . 2 matches
ticbox[i-1][j-1]=2;
ticbox[i-1][j-1]=3;
- XOR삼각형/aekae . . . . 2 matches
if (arr[j-1][k] == arr[j-1][k+1])
- 파스칼삼각형/허아영 . . . . 2 matches
pascaltri[i][j] = pascaltri[i-1][j-1] + pascaltri[i-1][j];
pascaltri[i][j] = pascaltri[i-1][j-1] + pascaltri[i-1][j]; // 이 for 문들 역시 ver.3에서 더 나아져야 함.
- 2002년도ACM문제샘플풀이/문제D . . . . 1 match
partTotal -= (weights[j] + weights[j-1]);
- DataStructure/List . . . . 1 match
tempNode[j] = m_Node[j-1];
- Lotto/송지원 . . . . 1 match
dmy[5-j-1]++;
- MatrixAndQuaternionsFaq . . . . 1 match
jdst = tj-1;
- MineSweeper/김상섭 . . . . 1 match
if(temp_char[j-1] == '*')
- MineSweeper/문보창 . . . . 1 match
for (p=j-1; p<=j+1; p++)
- POLY/김태진 . . . . 1 match
dp[level][i] += (i+j-1)*dp[level-i][j];
- RabbitHunt/김태진 . . . . 1 match
c[i][0]=c[i][j-1];
- UpgradeC++/과제1 . . . . 1 match
string spaces(row-(middle+j-1), ' ');
- WERTYU/문보창 . . . . 1 match
str[i] = diction[j-1];
- WERTYU/허아영 . . . . 1 match
result = data[j-1];
- WeightsAndMeasures/김상섭 . . . . 1 match
tem = value[j-1] + test[i].weight;
- XOR삼각형/곽세환 . . . . 1 match
ar[i][j] = (ar[i-1][j] == ar[i-1][j-1]) ? 0 : 1;
- XOR삼각형/허아영 . . . . 1 match
xortri[i+1][j] = (xortri[i][j-1] ^ xortri[i][j]);
- Yggdrasil/파스칼의삼각형 . . . . 1 match
sum[j]=temp[j-1]+temp[j];
- 데블스캠프2006/월요일/연습문제/switch/김대순 . . . . 1 match
}while(t[j-1]!=999);
- 새싹교실/2012/AClass/3회차 . . . . 1 match
w=b[p][j-1];
- 성우용 . . . . 1 match
y_point = j-1;
- 파스칼삼각형/sksmsvlxk . . . . 1 match
arr[i][j] = arr[i-1][j-1] + arr[i-1][j+1];
- 파스칼삼각형/강희경 . . . . 1 match
array[j] = foreArray[j-1] + foreArray[j];
- 파스칼삼각형/김준석 . . . . 1 match
else pas[i][j] = pas[i-1][j-1] + pas[i-1][j];
Found 42 matching pages out of 7555 total pages (5000 pages are searched)
You can also click here to search title.
