i-1

MineSweeper/이승한 . . . . 17 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-1][j]!= '*' and i-1>=0 and j>=0 and i-1<width and j<height:
 M[i-1][j]=M[i-1][j]+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][j+1]+1
 if(map[i-1][j-1]=='*')minecount++;
 if(map[i-1][j]=='*')minecount++;
 if(map[i-1][j+1]=='*')minecount++;
PNGFileFormat/FormatUnitTestInPythonLanguage . . . . 15 matches
      filteredR += scanline[i-1].r
      filteredG += scanline[i-1].g
      filteredB += scanline[i-1].b
      leftR = scanline[i-1].r
      leftG = scanline[i-1].g
      leftB = scanline[i-1].b
      filteredR += self.paethDictor(scanline[i-1].r, 0, 0)
      filteredG += self.paethDictor(scanline[i-1].g, 0, 0)
      filteredB += self.paethDictor(scanline[i-1].b, 0, 0)
      filteredR += self.paethDictor(scanline[i-1].r, rgbmap[-1][i].r, rgbmap[-1][i-1].r)
      filteredG += self.paethDictor(scanline[i-1].g, rgbmap[-1][i].g, rgbmap[-1][i-1].g)
      filteredB += self.paethDictor(scanline[i-1].b, rgbmap[-1][i].b, rgbmap[-1][i-1].b)
CubicSpline/1002/NaCurves.py . . . . 7 matches
      if ((self.pieceSize-1)*(i-1)+self.pieceSize) > self.getCountControlPoints():
      return (self.pieceSize-1)*(i-1)
      return (self.pieceSize-1)*(i-1)+self.pieceSize
      matrixA[i-1][i] = self.deltaX(i)
      matrixA[i][i-1] = self.deltaX(i)
      matrixB.append([6 * ( self.deltaY(i)/self.deltaX(i) - self.deltaY(i-1)/self.deltaX(i-1) )])
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-1][j];
      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-1, j, t);
신기호/중대생rpg(ver1.0) . . . . 7 matches
      tmpName[i-1]='\0';
      tmpName[i-1]='\0';
      tmpName[i-1]='\0';
      inven[i-1]=inven[i];
      name[i-1]='\0';
      tmpName[i-1]='\0';
      tmpName[i-1]='\0';
BusSimulation/조현태 . . . . 6 matches
      humans[i-1]=humans[i];
      if (i-1!=where)
      cars[i-1]=cars[where];
      return i-1;
      humans[i-1]=humans[i];
      temp[i-1]=cars[i];
ReverseAndAdd/허아영 . . . . 6 matches
      if(num[i] == num[length-i-1])
      temp[i] = num[length-i-1];
      reverseNum += temp[i] * pow(10, length-i-1); // 모아서 더하기
      Num += num[i] * pow(10, length-i-1);
      store_numbers[i] = num / pow(10, (numLength(num)-i-1));
      store_numbers[i] = num / pow(10, (length-i-1));
SOLDIERS/정진경 . . . . 6 matches
      k+=(i-1)*(x[i]-x[i-1]);
      k-=(n-i+1)*(x[i]-x[i-1]);
      k+=(i-1)*(y[i]-y[i-1]);
      k-=(n-i+1)*(y[i]-y[i-1]);
CubicSpline/1002/test_NaCurves.py . . . . 5 matches
      if i-1 >= 0:
      self.assertEquals (round(actual[i-1][i], 1), 0.2)
      self.assertEquals (round(actual[i][i-1], 1), 0.2)
      expected.append([6 * ( self.deltaY(i)/self.deltaX(i) - self.deltaY(i-1)/self.deltaX(i-1) )])
WeightsAndMeasures/문보창 . . . . 5 matches
 dynamic[i%2][j] = dynamic[(i-1)%2][j];
 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;
문자반대출력/허아영 . . . . 5 matches
     *(pCh+lenstr-i-1) = temp[i]; 이 부분에서 자꾸
      *(pCh+lenstr-i-1) = temp[i];
      *(pCh+lenstr-i-1) = *(temp+i);
      *(pCh+lenstr-i-1) = *(temp+i+1);
      str_temp[str_len-i-1] = ch[i];
JollyJumpers/허아영 . . . . 4 matches
      if(numbers[i] >= numbers[i-1])
      value = numbers[i] - numbers[i-1];
      value = numbers[i-1] - numbers[i];
      if(compare[i-1] != value)
PPProject/Colume2Exercises . . . . 4 matches
      start = 0; end = i-1;
      swap(str,0,i-1, n-i, n-1);
     // swap(str, 0, i-1, n - i, n-1);
     // swap(str, 0, i-1, i, n-i);
PascalTriangle . . . . 4 matches
 Array[i][j]=Array[i-1][j-1]+Array[i-1][j];
 row[current][i-1]=1; // 마지막 열도 항상 1
 for(int j=1;j<i-1;j++) // 나머지 열을 계산
문자반대출력/최경현 . . . . 4 matches
      string[numberOfString-i] = string[i-1];
      string[i-1] = broker;
      string[numberOfString-i] = string[i-1];
      string[i-1] = broker;
파스칼삼각형/구자겸 . . . . 4 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]);
파스칼삼각형/허아영 . . . . 4 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에서 더 나아져야 함.
AdventuresInMoving:PartIV/문보창 . . . . 3 matches
 return station[i].length - station[i-1].length;
 if (k - getDistance(i) < 0 || d[(i-1)%2][k] >= MAX_NUM || j < k - getDistance(i))
 cost = d[(i-1)%2][k] + (j - k + getDistance(i)) * station[i].price;
Chopsticks/문보창 . . . . 3 matches
 {{| D[a][n-3a+2 ~ (k+9-a)*2] = (L(i) - L(i-1))^2 + mini+2<=k{ D[a-1][k] } |}}
 int x = stick[i] - stick[i-1];
 for (i = i-1; i >= (nPerson + 9 - seti) * 2; i--)
LongestNap/문보창 . . . . 3 matches
 if (naptime < (pro[i].start - pro[i-1].end))
 naptime = pro[i].start - pro[i-1].end;
 nap.start = pro[i-1].end;
MedusaCppStudy/희경 . . . . 3 matches
 for(int j = (x-i-1); j > 0; j--)
 for(int j = (x-i-1); j > 0; j--)
 for(int k = 0; k < (2*i-1); k++)
MineSweeper/김회영 . . . . 3 matches
      arrayOfMine[(i-1)*width+(j-1)]++;
      arrayOfMine[(i-1)*width+(j)]++;
      arrayOfMine[(i-1)*width+(j+1)]++;
MineSweeper/허아영 . . . . 3 matches
      outputField[i-1][j-1] += 1; // 대각선 왼쪽 위
      outputField[i-1][j] += 1; // 위쪽
      outputField[i-1][j+1] += 1; // 대각선 오른쪽 위
WorldCupNoise/정진경 . . . . 3 matches
Table[i][0]=Table[i-1][1]+Table[i-1][0];
Table[i][1]=Table[i-1][0];
minesweeper/Celfin . . . . 3 matches
      if(mine[j-1][i-1]=='*')
      if(mine[j+1][i-1]=='*')
      if(mine[j][i-1]=='*')
usa_selfish/권영기 . . . . 3 matches
if(check[d[i-1]] <= rc[i].s1)d[i] = d[i-1]+1;
else d[i] = d[i-1];
만년달력/이진훈,문원명 . . . . 3 matches
      if((i-1)%4 == 0)
      if((i-1)%100 ==0)
      if((i-1)%400 == 0)
새싹교실/2011/AmazingC/과제방 . . . . 3 matches
 for(k=1;k<=2*i-1;k++,j++) printf(" ");
 for(j=1;j<=(13-(2*i-1))/2;j++) printf("*");
 for(k=1;k<=2*i-1;k++,j++) printf(" ");
토이/숫자뒤집기/김정현 . . . . 3 matches
      reversedChar[input.length-i-1]= input.charAt(i);
      numChars[i]= numChars[range-i-1];
      numChars[range-i-1]= temp;
8queen/손동일 . . . . 2 matches
i==x?arr[0][i-1]=x :arr[0][i-1]=0;
AproximateBinaryTree/김상섭 . . . . 2 matches
left_sum += dp->nodes[i-1].value;
temp = left_sum*sqrt(i-1) + right_sum*sqrt(dp->nodes.size() - i - 1);
Basic알고리즘/팰린드롬/허아영 . . . . 2 matches
if(string[i] == string[len-i-1])
if(string[i] == string[len-i-1])
EightQueenProblem/임인택 . . . . 2 matches
for(x=i-1; x>=0 && sum==0; x--) /* 왼쪽으로 */
for(x=i-1, y=j-1; x>=0 && y>=0 && sum==0; x--, y--) /* 대각선 */
EightQueenProblem/임인택/java . . . . 2 matches
for(x=i-1; x>=0 && sum==0; x--) /* 왼쪽으로 */
for(x=i-1, y=j-1; x>=0 && y>=0 && sum==0; x--, y--) /* 대각선 */
HardcoreCppStudy/첫숙제/Overloading/임민수 . . . . 2 matches
if(direction[i-2]=='9' && direction[i-1]=='9' && direction[i]=='9')
if(array[i-2]=='9' && array[i-1]=='9' && array[i]=='9')
HowManyFibs?/문보창 . . . . 2 matches
digit[i] = temp[len-i-1] - 48;
pib[i].findPibNum(pib[i-1], pib[i-2]);
HowManyFibs?/하기웅 . . . . 2 matches
fibNum[i] = fibNum[i-1]+ fibNum[i-2];
temp = temp + (*(number++)-48)*decimalNum.Power(charLen-i-1);
JTDStudy/첫번째과제/장길 . . . . 2 matches
return ball[i-1];
return ball[i-1];
JollyJumpers/서지혜 . . . . 2 matches
int index = abs(a[i]-a[i-1]);
int index = abs(a[i]-a[i-1]);
JollyJumpers/이승한 . . . . 2 matches
if( ( differ < ( array[i] - array[i-1])) || (differ < ( array[i-1] - array[i])) || (differ < ( array[i] - array[i+1]) ) || (differ < ( array[i+1] - array[i]) ) ) { //절대값 판단
PPProject/20041001FM . . . . 2 matches
str[tag] = str[i-1];
str[i-1] = temp;
PokerHands/Celfin . . . . 2 matches
if(card[i].color!=card[i-1].color)
if(card[i].number != card[i-1].number-1)
StringOfCPlusPlus/상협 . . . . 2 matches
st[i]=temp[k-i-1];
st[k-i-1]=temp[i];
TicTacToe/유주영 . . . . 2 matches
ticbox[i-1][j-1]=2;
ticbox[i-1][j-1]=3;
XOR삼각형/곽세환 . . . . 2 matches
ar[i][j] = (ar[i-1][j] == ar[i-1][j-1]) ? 0 : 1;
aekae/code . . . . 2 matches
in[i-1] = ' ';
cout << char(in[i-1]) << endl;
ricoder . . . . 2 matches
cout << array[i-1] << "를 뺐습니다.\n";
factorials[i] = i * factorials[i-1];
usa_selfish/곽병학 . . . . 2 matches
Arrays.fill(ans, p[i-1].b, p[i].b, ans[p[i-1].b]);
경시대회준비반/BigInteger . . . . 2 matches
End = i-1;
End += i-1;
구구단/곽세환 . . . . 2 matches
cout << k+(i-1)*4 << " * " << j << " = " << (k+(i-1)*4) * j << "\t";
데블스캠프2009/금요일/연습문제/ACM2453/정종록 . . . . 2 matches
if(a[i-1]==0)
a[i-1]=1;
마름모출력/zyint . . . . 2 matches
print spc*(size-i) + pattern*(2*i-1)
print spc*(size-i) + pattern*(2*i-1)
마름모출력/김민경 . . . . 2 matches
print ' '*(n-i-1)+pattern*((i+1)*2-1)
print ' '*(i+1)+pattern*((n-i-1)*2-1)
새싹교실/2011/무전취식/레벨10 . . . . 2 matches
//if(pel[i]==pel[count-i-1])
if(pel[i]!=pel[count-i-1])
새싹교실/2012/아우토반/뒷반/4.13 . . . . 2 matches
for( a=0 ; a <= (i-1) ; a++ ) {
for( b=i-1; b>a ; b-- ) {
새싹교실/2012/아우토반/앞반/4.5 . . . . 2 matches
for(j=0;j<(2*i-1);j++)
for(j=0;j<(2*i-1);j++)
수/마름모출력 . . . . 2 matches
for(j=1; j<=(2*i-1); j++)
for(j=1; j<=(2*i-1); j++)
숫자를한글로바꾸기/허아영 . . . . 2 matches
number_data[number_len-i-1] = (number % 10);
number_data[number_len-i-1] = (number % 10);
조영준/파스칼삼각형/이전버전 . . . . 2 matches
_triangle[i][j+1] = _triangle[i-1][j] + _triangle[i-1][j+1]; //파스칼 삼각형 규칙
파스칼삼각형/sksmsvlxk . . . . 2 matches
arr[i][j] = arr[i-1][j-1] + arr[i-1][j+1];
파스칼삼각형/김준석 . . . . 2 matches
else pas[i][j] = pas[i-1][j-1] + pas[i-1][j];
05학번만의C++Study/숙제제출4/조현태 . . . . 1 match
makedClass[i-1]=makedClass[i];
05학번만의C++Study/숙제제출4/최경현 . . . . 1 match
for(int l = k; k<i-1;k++)
2thPCinCAUCSE/ProblemA/Solution/상욱 . . . . 1 match
for (int j = i ; j <= inputNumber-i-1 ; j++)
AdventuresInMoving:PartIV/김상섭 . . . . 1 match
return station[i].length - station[i-1].length;
BusSimulation/상협 . . . . 1 match
if(i!=0 && m_buses[i-1].GetMinute()==m_MinuteOfInterval) //앞차가 15분이 될때 뒷차 출발
CompleteTreeLabeling/하기웅 . . . . 1 match
factorial[i] = factorial[i-1] * i;
Counting/김상섭 . . . . 1 match
n[i] += 2*n[i-1] + n[i-2] + n[i-3];
Counting/문보창 . . . . 1 match
Tn[i] = 2 * Tn[i-1] + Tn[i-2] + Tn[i-3];
Counting/하기웅 . . . . 1 match
number[i]=2*number[i-1]+number[i-2]+number[i-3];
DataStructure/List . . . . 1 match
tempNode[coordi-1].next = tempNode[coordi]; //낀 곳의 바로 앞에 있는 자료가 첨가한 자료를 참조하게 한다.
DataStructure/Tree . . . . 1 match
* 레벨 i의 최대 노드수 = 2^(i-1)
EuclidProblem/차영권 . . . . 1 match
for (j=1 ; j<i-1 ; j++)
HelpOnInstallation . . . . 1 match
$ tar --same-permissions -xzvf moniwiki-1.1.x.tgz
HelpOnInstallation/MultipleUser . . . . 1 match
$ zcat moniwiki-1.x.x.tgz |tar xvf -
InterWikiIcons . . . . 1 match
* [[Icon(moin-new.gif)]][http://www.worrynet.com/jandi/wiki.cgi/%C0%DC%B5%F0%B9%E7 Jandi] - http://puzzlet.org/imgs/jandi-16.png (16x16x16M)
IpscLoadBalancing . . . . 1 match
last=min(leftSum-avg*i,rightSum-avg*(listLen-i-1),last)
JavaScript/2011년스터디/URLHunter . . . . 1 match
if(arr[i-1]!='O'||arr[i]!='O'||arr[i+1]!='O') {
JollyJumpers/황재선 . . . . 1 match
if (i != nums[i-1])
Lotto/강소현 . . . . 1 match
if(bin[S.length-i-1]==0){
MatrixAndQuaternionsFaq . . . . 1 match
idst = ti-1;
OOP/2012년스터디 . . . . 1 match
if(isLeapYr(i-1)==1&&i!=1){
PowerOfCryptography/문보창 . . . . 1 match
lnP += log10(double(temp) / pow(10, i-1));
ReverseAndAdd/Celfin . . . . 1 match
carry[i-1]=1;
ReverseAndAdd/태훈 . . . . 1 match
r = r + n[len(str(n))-i-1]
Scheduled Walk/김홍선 . . . . 1 match
if(j==i-1)
Self-describingSequence/shon . . . . 1 match
seq(I) = seq(i-1) + b;
Self-describingSequence/문보창 . . . . 1 match
if (n == table[i-1])
Slurpys/강인수 . . . . 1 match
Result := i-1;
StacksOfFlapjacks/이동현 . . . . 1 match
if(cake[i-1]>cake[i])
StuPId/김태진 . . . . 1 match
id[unr]='0'+i-1;
UpgradeC++/과제1 . . . . 1 match
for (j=number-i-1; j>0; j--)
VendingMachine_참관자 . . . . 1 match
for(int i=1;i<=TOKEN_NUM && strcmp( Data[0] , tok[i-1]) ;i++) ;
XOR삼각형/임인택 . . . . 1 match
newList.append( list[i-1]^list[i] )
Yggdrasil/파스칼의삼각형 . . . . 1 match
if(j==0 || j==i-1)
c++스터디_2005여름/실습코드 . . . . 1 match
str_temp[str_len-i-1] = ch[i];
koi_cha/곽병학 . . . . 1 match
for(int j=i-1; j>0; j--) {
subsequence/권영기 . . . . 1 match
sum[i] = sum[i-1] + e[i];
금고/김상섭 . . . . 1 match
height += calculate(i-1,j);
기본데이터베이스/조현태 . . . . 1 match
strcpy(datas[i-1][j],datas[i][j]);
덜덜덜/숙제제출페이지2 . . . . 1 match
for(j = 0; j < 2*i-1; j++)
데블스캠프2006/월요일/연습문제/switch/윤영준 . . . . 1 match
}while((student[i-1] != 999) && (i<10));
데블스캠프2006/화요일/pointer/문제2/김준석 . . . . 1 match
b[i] = a[lengh-i-1];
데블스캠프2006/화요일/pointer/문제4/김준석 . . . . 1 match
b[i] = a[lengh-i-1];
데블스캠프2006/화요일/pointer/문제4/성우용 . . . . 1 match
buf_[i] = buf[length-i-1];
데블스캠프2006/화요일/pointer/문제4/주소영 . . . . 1 match
if(buf[i] != buf[length-i-1]){
떡장수할머니/강소현 . . . . 1 match
num[i] = num[i-1]+num[i-2];
마름모출력/허아영 . . . . 1 match
print p*(2*i-1)
만년달력/영동 . . . . 1 match
totalDays+=daysOfMonth[i-1];
보드카페 관리 프로그램/강석우 . . . . 1 match
if (vec[i-1].game == vec[i].game)
새싹교실/2011/學高/6회차 . . . . 1 match
for(j=1;2*i-1>=j;j++)
새싹교실/2012/AClass . . . . 1 match
for(j=1;j<=2*i-1;j++)
새싹교실/2012/AClass/2회차 . . . . 1 match
for(star=1;star<=2*i-1;star++)
새싹교실/2012/AClass/5회차 . . . . 1 match
if(arr[i]!=arr[len-i-1])
성우용 . . . . 1 match
x_point = i-1;
수면과학습 . . . . 1 match
1. 수면중 학습 - 수면동안에 어휘를 짝지어 연합학습을 시킨다. (Tani & Yoshii-1970)
수학의정석/집합의연산/이영호 . . . . 1 match
next = set[i-1];
숫자를한글로바꾸기/김태훈zyint . . . . 1 match
printf("%s",jari[strlen(getdata)-pjari-1]);
스택/aekae . . . . 1 match
for(int j=i-1; j>=0; j--)
알고리즘2주숙제 . . . . 1 match
1. ∑(i=1~k)i*2 i-1 = 2k (k-1) + 1. Prove it.
오목/민수민 . . . . 1 match
if(board[i-1][j+1]==temp && board[i-2][j+2]==temp && board[i-3][j+3]==temp && board[i-4][j+4]==temp)
정렬/Leonardong . . . . 1 match
fout << sorted[i-1] << endl;
중위수구하기/조현태 . . . . 1 match
for (int j=0; j<MAX_NUMBER-i-1; ++j)
큐/aekae . . . . 1 match
for(int j=i-1; j>=k; j--)
피보나치/aekae . . . . 1 match
return fivo(i-1) + fivo(i-2);
피보나치/김재성,황재선 . . . . 1 match
return fivo(i-1) + fivo(i-2);
피보나치/김홍선 . . . . 1 match
ar[i+1]=ar[i]+ar[i-1];
피보나치/방선희 . . . . 1 match
arr[i] = arr[i-1] + arr[i-2];
피보나치/현정,현지 . . . . 1 match
suyul[i]=suyul[i-2]+suyul[i-1];
허아영/C코딩연습 . . . . 1 match
for(j = 0; j < 2*i-1; j++)

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

Full text search for "i-1"

You can also click here to search title.