- CubicSpline/1002/NaCurves.py . . . . 45 matches
def _basedFunction(self, x, i):
return (x - self._getX(j)) / (self._getX(i) - self._getX(j))
lg += self._basedFunction(x, i) * self._getY(i)
def _getX(self, i):
def _getY(self, i):
def getPiece(self, i):
return self.controlPointListX[self.getFirstPiecePoint(i) : self.getEndPiecePoint(i)]
def getFirstPiecePoint(self, i):
def getEndPiecePoint(self, i):
def getAi(self, i):
return (self.getDoublePrimeY(i+1) - self.getDoublePrimeY(i)) / (6 * self.deltaX(i))
def getBi(self, i):
return (self.getDoublePrimeY(i) / 2)
def getCi(self, i):
return (self.deltaY(i) / self.deltaX(i) ) - (self.deltaX(i) / 6) * (self.getDoublePrimeY(i+1) + (2*self.getDoublePrimeY(i)) )
def getDi(self, i):
return self.getYi(i)
def getXi(self, i):
def getYi(self, i):
def getDoublePrimeY(self, i):
- RandomWalk2/조현태 . . . . 32 matches
for (register int i = 0; i < worldSizeX; ++i)
for (register int i = 0; i < worldSizeX; ++i)
for (register int i = 0; i < strlen(moveRotate.c_str()); ++i)
for (register int i = 0; i < worldSizeY; ++i)
for (register int i = 0; i < worldSizeX; ++i)
for (register int i = 0; i < worldSizeX; ++i)
for (int i = 0; i < NUMBER_PLAYER; ++i)
for (register int i = 0; i < NUMBER_PLAYER; ++i)
for (register int i = 0; isChanged; ++i)
for (register int i = 0; i < NUMBER_PLAYER; ++i)
for (register int i = 0; i < worldSizeY; ++i)
for (register int i = 0; i < worldSizeX; ++i)
for (register int i = 0; i < worldSizeX; ++i)
for (int i = 0; i < NUMBER_PLAYER; ++i)
for (register int i = 0; i < numberPlayer; ++i)
for (register int i = 0; isChanged; ++i)
for (register int i = 0; i < numberPlayer; ++i)
for (register int i = 0; i < worldSizeY; ++i)
for (register int i = 0; i < worldSizeX; ++i)
for (register int i = 0; i < worldSizeX; ++i)
- BusSimulation/조현태 . . . . 29 matches
for (register int i=1; i<20; ++i)
for (register int i=0; i<station_size; ++i)
for (register int i=0; i<station_size; ++i)
for (register int i=1; i<number_man; ++i)
for (register int i=0; i<number_man; ++i)
for (register int i=0; i<bus_size; ++i)
for (register int i=0; i<bus_size; ++i)
for (register int i=0; i<road_long; ++i)
for (register int i=0; i<road_long; ++i)
for (register int i=road_long-1; i>=0; --i)
for (i=where+1; i<=where+speed; ++i)
for (register int i=1; i<20; ++i)
for (register int i=0; i<station_size; ++i)
for (register int i=0; i<station_size; ++i)
for (register int i=1; i<number_man; ++i)
for (register int i=0; i<number_man; ++i)
for (register int i=0; i<bus_size; ++i)
for (register int i=0; i<bus_size; ++i)
for (register int i=0; i<number_bus; ++i)
for (register int i=0; i<number_station; ++i)
- Java/ModeSelectionPerformanceTest . . . . 29 matches
public void doOne(int i) {
public void doTwo(int i) {
public void doThree(int i) {
public void doFour(int i) {
public void doFive(int i) {
public void doDefault(int i) {
private void doDefault(int i) {
public void doOne(int i) {
public void doTwo(int i) {
public void doThree(int i) {
public void doFour(int i) {
public void doFive(int i) {
private void doDefault(int i) {
public void doOne(int i) {
public void doTwo(int i) {
public void doThree(int i) {
public void doFour(int i) {
public void doFive(int i) {
public void execute(int i) {
public void execute(int i) {
- 새싹교실/2012/세싹 . . . . 19 matches
printf("First Attribute : 0x%02x%02x%02x%02x\n",*((unsigned char*)MFT+i+3),*((unsigned char*)MFT+i+2),*((unsigned char*)MFT+i+1),*((unsigned char*)MFT+i));
printf("First Attribute Size : 0x%02x%02x%02x%02x\n",*((unsigned char*)MFT+i+3),*((unsigned char*)MFT+i+2),*((unsigned char*)MFT+i+1),*((unsigned char*)MFT+i));
*((unsigned char*)MFT+i)
printf("Second Attribute : 0x%02x%02x%02x%02x\n",*((unsigned char*)MFT+i+3),*((unsigned char*)MFT+i+2),*((unsigned char*)MFT+i+1),*((unsigned char*)MFT+i));
printf("Second Attribute Size : 0x%02x%02x%02x%02x\n",*((unsigned char*)MFT+i+3),*((unsigned char*)MFT+i+2),*((unsigned char*)MFT+i+1),*((unsigned char*)MFT+i));
*((unsigned char*)MFT+i)
printf("Third Attribute : 0x%02x%02x%02x%02x\n",*((unsigned char*)MFT+i+3),*((unsigned char*)MFT+i+2),*((unsigned char*)MFT+i+1),*((unsigned char*)MFT+i));
printf("Third Attribute Size : 0x%02x%02x%02x%02x\n",*((unsigned char*)MFT+i+3),*((unsigned char*)MFT+i+2),*((unsigned char*)MFT+i+1),*((unsigned char*)MFT+i));
unsigned int LoadAttribute(int i);
for(j=0;j<(*((unsigned char*)MFT+point+i)&0x0F);j++)//*((unsigned __int64*)((unsigned char*)MFT+point+24));j++)
for(k=0;k<(*((unsigned char*)MFT+point+i)&0x0F);k++)
printf("%02x",*((unsigned char*)MFT+point+i+(*((unsigned char*)MFT+point+i)&0x0F)-k));
for(;k<(*((unsigned char*)MFT+point+i)&0x0F)+((*((unsigned char*)MFT+point+i)&0xF0)>>4);k++)
+(*((unsigned char*)MFT+point+i)&0x0F)+((*((unsigned char*)MFT+point+i)&0xF0)>>4)
-k+(*((unsigned char*)MFT+point+i)&0x0F)));
i+=(*((unsigned char*)MFT+point+i)&0x0F)+((*((unsigned char*)MFT+point+i)&0xF0)>>4)+1;
- 김희성/MTFREADER . . . . 16 matches
if(sub_mask&flag && *(long*)point==0x10*i)
while(*(point+i))
for(k=0;k<(*(point+i)&0x0F);k++)
length+=*((point+i)+(*(point+i)&0x0F)-k);
for(;k<(*(point+i)&0x0F)+((*(point+i)&0xF0)>>4);k++)
offset+=*((point+i)+(*(point+i)&0x0F)+((*(point+i)&0xF0)>>4)-k+(*(point+i)&0x0F));
if(offset&(0x80<<(8*(((*(point+i)&0xF0)>>4)-1))) && ((*(point+i)&0xF0)>>4)<8)
offset=offset^(0x80<<(8*(((*(point+i)&0xF0)>>4)-1)));
i+=(*(point+i)&0x0F)+((*(point+i)&0xF0)>>4)+1;
- CompleteTreeLabeling/조현태 . . . . 13 matches
for (register int i=0; i<number_nodes; ++i)
for (register int i=0; i<deep; ++i)
for (register int i=0; i<input_degree; ++i)
for (register int i=block_number; i<max_nodes; ++i)
for (register int i=0; i<number_nodes; ++i)
for (register int i=0; i<deep; ++i)
for (register int i=0; i<degree; ++i)
for (register int i=0; i<remain; ++i)
for (register int i=0; i<number_of_one; ++i)
for (register int i=number_of_one-1; i>=0; --i)
for (register int i=sub_nodes; i<now_nodes; ++i)
for (register int i=sub_nodes; i<now_nodes; ++i)
for (register int i=0; i<number_right; ++i)
- i++VS++i . . . . 13 matches
scanf("%d", &i);
printf("%d", i);
scanf("%d", &i);
printf("%d", i); // 문제가 되는건 함수(i++)또는 함수(++i)이런데에서 문제가 생길거 같은데..
간단히 생각하면 되는 것이었습니다.. i++ 이나 ++i 모두 값(value)을 생성하는 연산자 입니다. 그러므로.. i 가 5 일때 i++ 의 값은 5이므로.. printf("%d", i) 는 5를 찍어주겠지요.
for(int i = 0 ; i < 10 ; ++i)
printf("%d", i);
printf("%d", i);
scanf("%d", &i);
printf("%d", ++i);
scanf("%d", &i);
for(vector<int>::iterator i = intArray.begin(); i != intArray.end(); ++i){
- 데블스캠프2005/게임만들기/제작과정예제 . . . . 13 matches
for (register int i=0;i<3;++i)
for (register int i=0;i<3; ++i)
for (register int i=0;i<4; ++i)
for (i=0;i<4; ++i)
for (i=0;i<4; ++i)
for (i=0;i<4; ++i)
for (register int i=0;i<4; ++i)
for (i=0;i<4; ++i)
for (i=0;i<4; ++i)
for (register int i=0;i<4; ++i)
for (i=0;i<4; ++i)
for (register int i=0; i<10; ++i)
if (9==i) //블럭이 다 차있을 경우에는 한줄을 삭제한다.
- 만년달력/인수 . . . . 13 matches
for(int i = start ; i < getNumOfDays() + start ; ++i)
for(int i = 1 ; i < year ; ++i)
if( isLeapYear(i) ) ++ret;
for(int i = 0 ; i < month - 1 ; ++i)
for(int i = start ; i < calendar.getNumOfDays() + start ; ++i)
for(int i = 0 ; i < 42 ; ++i)
for(int i = 0 ; i < expectedSet.length ; ++i) {
for(int i = 0 ; i < monthSet.length ; ++i) {
for(int i = 0 ; i < expectedSet.length ; ++i) {
for(int i = 0 ; i < expectedSet.length ; ++i) {
for(int i = 0 ; i < monthSet.length ; ++i) {
for(int i = 0 ; i < 6 ; ++i) {
for(int i = 0 ; i < 6 ; ++i) {
- ProjectSemiPhotoshop/SpikeSolution . . . . 12 matches
LPSTR WINAPI FindDIBBits(LPSTR lpbi)
return (lpbi + *(LPDWORD)lpbi + ::PaletteSize(lpbi));
WORD WINAPI PaletteSize(LPSTR lpbi)
if (IS_WIN30_DIB (lpbi))
return (WORD)(::DIBNumColors(lpbi) * sizeof(RGBQUAD));
return (WORD)(::DIBNumColors(lpbi) * sizeof(RGBTRIPLE));
WORD WINAPI DIBNumColors(LPSTR lpbi)
if (IS_WIN30_DIB(lpbi))
dwClrUsed = ((LPBITMAPINFOHEADER)lpbi)->biClrUsed;
if (IS_WIN30_DIB(lpbi))
wBitCount = ((LPBITMAPINFOHEADER)lpbi)->biBitCount;
wBitCount = ((LPBITMAPCOREHEADER)lpbi)->bcBitCount;
dwDIBSize = *(LPDWORD)lpBI + ::PaletteSize((LPSTR)lpBI);
bmfHdr.bfOffBits=(DWORD)sizeof(BITMAPFILEHEADER)+lpBI->biSize + PaletteSize((LPSTR)lpBI);
- ErdosNumbers/조현태 . . . . 11 matches
for (int i=0; i<number_books; ++i)
for (int i=0; i<number_writers; ++i)
for (register int i=0; i<number_line; ++i)
for (register int i=0; i<number_books; ++i)
for (register int i=0; i<number_mans; ++i)
for (register int i=0; 0!=target_b[i] ; ++i)
for (register int i=0; i<number_mans; ++i)
for (register int i=0; i<number_books; ++i)
for (register int i=0; i<number_mans; ++i)
for (register int i=0; i<target_number_line; ++i)
line_data* temp_book=books[target_man->get_line_number(i)];
- FromDuskTillDawn/조현태 . . . . 11 matches
for (register unsigned int i = 0; i < g_myTowns.size(); ++i)
for(register int i = 0; i < sizeOfTimeTable; ++i)
for (register int i = 0; i < (int)(suchTown->nextTown.size()); ++i)
for (register int i = newAddPoint; i < (int)allSuchList.size(); ++i)
allSuchList.erase(allSuchList.begin() + i);
allDelay.erase(allDelay.begin() + i);
allSuchList.erase(allSuchList.begin() + i);
allDelay.erase(allDelay.begin() + i);
for (register int i = 1; i < (int)allSuchList.size(); ++i)
for (register int i = 0; i < (int)g_myTowns.size(); ++i)
for (register int i = 0; i < numberOfTestCase; ++i)
- Robbery/조현태 . . . . 11 matches
for (register int i = 0; i < (int)g_cityMap.size(); ++i)
for (register int i = left - 1; i < right; ++i)
for (register int i = 0; i < (int)g_cityMap.size(); ++i)
for (register int i = 0; i < (int)g_saveMessageTime.size(); ++i)
for (register int i = 0; i < (int)g_canMovePoints[suchTime].size(); ++i)
for (register int i = 0; i < 5; ++i)
for (register int i = 0; i < (int)g_maxPoints.size(); ++i)
for (register int i = 0; i < numberOfMessage; ++i)
for (register int i = 0; i < keepTime; ++i)
for (register int i = 0; i < (int)g_canMovePoints[0].size(); ++i)
for (register int i = 0; i < (int)g_maxPoints[0].size(); ++i)
- [Lovely]boy^_^/3DLibrary . . . . 11 matches
for(int i = 0 ; i < _nRow ; ++i)
for(int i = 0 ; i < _nRow ; ++i)
for(int i = 0 ; i < _nRow ; ++i)
for(int i = 0 ; i < m._nRow ; ++i)
for(int i = 0 ; i < _nRow ; ++i)
for(int i = 0 ; i < _nRow ; ++i)
for(int i = 0 ; i < ret._nRow ; ++i)
for(int i = 0 ; i < _nRow ; ++i)
for(int i = 0 ; i < _nRow ; ++i)
for(int i = 0 ; i < 4 ; ++i)
for(int i = 0 ; i < 4 ; ++i)
- whiteblue/파일읽어오기 . . . . 11 matches
void lendBook(UserInfo * pUi) { pLendPeople = pUi; bLone = true; }
nT.push_back(i);
userinfo.push_back(ui);
nT2.push_back(i);
bookinfo.push_back(bi);
void insertUserData(UserInfo * ui)
userinfo.push_back(ui);
userinfo.erase(userinfo.begin()+i);
void insertBookData(BookInfo * bi)
bookinfo.push_back(bi);
bookinfo.erase(bookinfo.begin()+i);
- 기본데이터베이스/조현태 . . . . 11 matches
for (register int i=0; i<MAX_MENU; ++i)
for (register int i=0; i<HANG_MOK; ++i)
for (register int i=target+1; i<how_many_data; ++i)
for (register int i=how_many_data-1; prv_del<=i; --i)
for (register int i=0; i<HANG_MOK; ++i)
for (register int i=0; i<MAX_MENU; ++i)
for (register int i=0; i<HANG_MOK; ++i)
for (register int i=0; i<how_many_data; ++i)
for (register int i=0; i<HANG_MOK; ++i)
for (register int i=0; i<how_many_data; ++i)
for (register int i=0; i<HANG_MOK; ++i)
- 미로찾기/상욱&인수 . . . . 11 matches
for(int i = 0 ; i < x ; ++i)
for (int i = 0; i < 4; ++i) {
if ( isValidMove(curPoint,i) ) {
for(int i = 0 ; i < X+2 ; ++i)
for(int i = 0 ; i < 4 ; ++i) {
for(int i = 0 ; i < pt.length ; ++i)
for(int i = 0 ; i < 5 ; ++i)
assertEquals(expected[i], (Point) player.tracedPath.get(i));
for(int i = 0 ; i < 20 ; ++i) {
for(int i = 1 ; i < player.tracedPath.size() ; ++i) {
Point pt = (Point)player.tracedPath.get(i);
- 새싹교실/2011/데미안반 . . . . 11 matches
printf("%d번째 출력\n",i);
printf("%d번째 출력\n",i);
printf("%d번째 출력\n",i);
printf("j for문 실행 전 i값=%d\n",i);
printf("j for문 실행 후 i값=%d\n",i);
scanf("%d",&i);
if(num>i){
if(min<i){
}else if(num<i){
if(max>i){
scanf("%d",&i);
- AcceleratedC++/Chapter5 . . . . 10 matches
for(vector<Student_info>::size_type i = 0; i != students.size() ; ++i)
students.erase(students.begin() + i);
students.erase(students.begin() + i);
for(vector<Student_info>::size_type i = 0 ; i != students.size() ; ++i)
for(vector<Student_info>::const_iterator i = students.begin() ; i != students.end() ; ++i)
cout << (*i).name << endl;
* (*i).name : 반복자 i가 가리키는 요소의 멤버 name을 말한다. 괄호를 꼭 써주자. 우선순위가 .이 *보다 높기 때문에 에러난다.
* (*i).name 이렇게 하기 귀찮다. i->name 이렇게 하면 된다.
=== 5.2.4 The meaning of students.erase(students.begin() + i) ===
for(vector<string>::const_iterator i = bottom.begin(); i != bottom.end(); ++i)
- C++스터디_2005여름/도서관리프로그램/조현태 . . . . 10 matches
for (register int i=0; 0!=original[i];++i)
for (register int i=0; 0!=target_a[i];++i)
for (register int i=0; i<MAX_HANGMOK; ++i)
for (register int i=0; i<number_data; ++i)
for (register int i=0; i<MAX_HANGMOK; ++i)
for (register int i=0; i<MAX_HANGMOK; ++i)
for (register int i=0; i<MAX_HANGMOK; ++i)
for (register int i=0; i<MAX_HANGMOK; ++i)
for (register int i=0; i<MAX_HANGMOK; ++i)
for (register int i=0; i<number_data; ++i)
- CubicSpline/1002/test_NaCurves.py . . . . 10 matches
def _getX(self, i):
expected = (x - self._getX(j)) / (self._getX(i) - self._getX(j))
expected *= (x - self._getX(i)) / (self._getX(0) - self._getX(i))
expected *= (x - self._getX(i)) / (self._getX(1) - self._getX(i))
expected.append([6 * ( self.deltaY(i)/self.deltaX(i) - self.deltaY(i-1)/self.deltaX(i-1) )])
def deltaX(self, i):
def deltaY(self, i):
- SuperMarket/인수 . . . . 10 matches
for(int i = 0 ; i < _havingGoods.size() ; ++i)
for(int i = 0 ; i < _havingGoods.size() ; ++i)
for(int i = 0 ; i < _havingGoods.size() ; ++i)
for(int i = 0 ; i < _buyedGoods.size() ; ++i)
for(int i = 0 ; i < _buyedGoods.size() ; ++i)
for(int i = 0 ; i < str.size() ; ++i)
for(int i = 0 ; i < str.length() ; ++i)
ret += CharToInt(str[i]) * Power(10,(str.length() - i));
for(int i = 0 ; i < e - 1 ; ++i)
for(i = _tableCmd.begin() ; i != _tableCmd.end() ; ++i)
- TheGrandDinner/조현태 . . . . 10 matches
for (register int i = 0; i < numberOfTeam; ++i)
if (0 != i)
teamSize.push_back(SNumberAndPosition(buffer, i));
for (register int i = 0; i < numberOfTable; ++i)
if (0 != i)
tableSize.push_back(SNumberAndPosition(buffer, i));
for (register int i = 0; i < (int)tableSize.size(); ++i)
for (register int i = 0; i < (int)teamSize.size(); ++i)
for (register int i = 0; i < (int)teamSize.size(); ++i)
for (register int i = 0; i < (int)teamTableNumber.size(); ++i)
- 큰수찾아저장하기/김태훈zyint . . . . 10 matches
for(i=0;i<ROW-1;++i){
for(i=0;i<ROW-1;++i){
for(i=0;i<ROW-1;++i) if(max < value[i][3]) max=value[i][3];
for(i=0;i<COL-1;++i) if(max < value[3][i]) max=value[3][i];
for(i=0;i<ROW;++i) {
for(i=0;i<ROW-1;++i) if(max < value[i][3]) max=value[i][3];
for(i=0;i<COL-1;++i) if(max < value[3][i]) max=value[3][i];
for(i=0;i<ROW;++i){
for(i=0;i<COL-1;++i){
for(i=0;i<ROW;++i)
- AcceleratedC++/Chapter11 . . . . 9 matches
T& operator[](size_type i) { return data[i]; }
const T& operator[](size_type i) const { return data[i]; }; // 이경우에도 레퍼런스를 쓰는 이유는 성능상의 이유때문이다.
T& operator[](size_type i) { return data[i]; }
const T& operator[](size_type i) const { return data[i]; }; // 이경우에도 레퍼런스를 쓰는 이유는 성능상의 이유때문이다.
d = median (vi); // copy constructor work
T& operator[](size_type i) { return data[i]; }
const T& operator[](size_type i) const { return data[i]; }
data = alloc.allocate(j - i);
data = alloc.allocate(j - i);
- BabyStepsSafely . . . . 9 matches
for(int i = 0; i <primes.length; ++i)
for(j=2*1; j<s; j+=i)
if(isPrime(i))
if(isPrime(i))
assert("contains primes", primes.contains(new Integer(i)));
assert("doesn't contain composites", !primes.contains(new Integer(i)));
for(int i = 0; i < primes.length; ++i)
result = (0 != n % i);
for(int i = 0; i < primes.length; ++i)
- OurMajorLangIsCAndCPlusPlus/XML/조현태 . . . . 9 matches
for (i = 0; i < tabCount; ++i)
for (i = 0; i < showBlock->nextBlockNumber; ++i)
for (i = 0; i < tabCount; ++i)
for (i = 0; i < showBlock->nextBlockNumber; ++i)
for (i = 0; i < suchBlock->nextBlockNumber; ++i)
for (i = 0; i < suchBlock->nextBlockNumber; ++i)
for (i = 0; i < (int)(*suchedBlocks); ++i)
for (i = 0; i < suchBlock->nextBlockNumber; ++i)
for ( ; i < suchBlock->nextBlockNumber; ++i)
- 데블스캠프2011/둘째날/Machine-Learning/NaiveBayesClassifier/송지원 . . . . 9 matches
if(str.equals(data.get(i))){
frequency.set(i, frequency.get(i)+1);
str = data.get(i) + "\t" + frequency.get(i) + "\n";
System.out.println(articles.get(i));
System.out.print(data.get(i));
System.out.println(" " + frequency.get(i));
for(int i=0; i<articleWords.size(); i++) System.out.println(articleWords.get(i));
str = bayes.get(i) + "\n";
- 숫자를한글로바꾸기/허아영 . . . . 9 matches
void print_num_korean(char *korean_data, int *number_data, int i);
void print_num_position(char *num_position, int number_len, int i);
print_num_position(num_position, number_len, i);
print_num_korean(korean_data, number_data, i);
print_num_position(num_position, number_len, i);
print_num_korean(korean_data, number_data, i);
print_num_position(num_position, number_len, i);
void print_num_korean(char *korean_data, int *number_data, int i)
void print_num_position(char *num_position, int number_len, int i)
- 오목/인수 . . . . 9 matches
for(int i = 0 ; i < width ; ++i)
for(int i = 1 ; i <= wanted - 1 ; ++i) {
for(int i = 0 ; i < WIDTH ; ++i)
for(int i = 0 ; i < HEIGHT ; ++i)
for(int i = 0 ; i < WIDTH ; ++i) {
for(int i = 0 ; i < height ; ++i)
assertEquals(0,board.getState(j,i));
for(int i = 0 ; i < expectedSet.length ; ++i) {
for(int i = 0 ; i < turnSet.length ; ++i) {
- 파스칼삼각형/구자겸 . . . . 9 matches
if ( getcol(i)==1 ): arr[i] = 1
elif ( getcol(i)==getrow(i) ): arr[i] = 1
a = arr[getindex(getrow(i)-1,getcol(i)-1)]
b = arr[getindex(getrow(i)-1,getcol(i))]
if ( getcol(i)==getrow(i) ):
- OurMajorLangIsCAndCPlusPlus/print/조현태 . . . . 8 matches
for (register int i = 0; i < leftGab - numberSize; ++i)
for (register int i = 0; i < numberSize; ++i)
for (register int i = 0; i < variableSize; ++i)
if (0 != i)
for (register int i = 0; i < variableSize; ++i)
if (0 != i)
for (register int i = 0; i < variableSize; ++i)
if (0 != i)
- PowerOfCryptography/조현태 . . . . 8 matches
for (register unsigned __int64 i=0; i<gaesu; ++i)
get_number=plus_target->call_number(i);
get_number=plus_target->call_number(i);
this_number=call_number(i);
taget_get_number=target_number->call_number(i);
this_number=call_number(i);
taget_get_number=target_number->call_number(i);
if (this_number==taget_get_number && 0==i)
- TowerOfCubes/조현태 . . . . 8 matches
for (register int i = 0; i < BOX_FACE_NUMBER; ++i)
suchFaceList.push_back(i);
for (register int i = 0; i < BOX_FACE_NUMBER; ++i)
suchFaceList.push_back(GetOppositeFace(i));
for (register int i = 0; i < (int)suchFaceList.size(); ++i)
for (register int i = (int)showStack.size() - 1; i >= 0 ; --i)
for (register int i = 0; i < (int)myBoxs.size(); ++i)
for (register int i = 0; i < boxNumber; ++i)
- 데블스캠프2011/다섯째날/HowToWriteCodeWell/임상현,서민관 . . . . 8 matches
public void goTo(int i) throws Exception {
Turn = Math.abs(this.currentFloor - i);
public void downTo(int i) throws Exception {// 외부에서 엘리베이터가 내려오도록 함.
goTo(i);
public void push(int i) throws Exception { // 엘리베이터 내부에서 i층으로 이동.
goTo(i);
public void upTo(int i) throws Exception { // 외부에서 엘리베이터가 올라오도록 함.
goTo(i);
- 데블스캠프2013/셋째날/머신러닝 . . . . 8 matches
firstDataList = [int(i) for i in firstData.split(',')];
secondDataList = [int(i) for i in secondData.split(',')];
f.write(i);
if(min==i)
Concurrency::parallel_for(0, TEST_SIZE, [&](int i) {
for(int i=0; i<SIZE; ++i) {
printf("%d...\n", i);
for(int i=0; i<7528; ++i) {
- 문자반대출력/허아영 . . . . 8 matches
*(pCh+lenstr-i) = temp[i]; 이렇게 코딩해서, 컴파일은 되는데, 결과물이 안나와서 답답했었다.
temp[i] = *(pCh+i);
*(temp+i) = *(pCh+i);
*(pCh+lenstr-i-1) = *(temp+i);
*(temp+i) = *(pCh+i);
*(pCh+lenstr-i-2) = *(temp + i);
- 중위수구하기/나휘동 . . . . 8 matches
sum += (i+1)*(factorial(k)/factorial(i)/factorial(k-i))**2
print i, metric(i), i**2, i*math.log(i)
sum += (i+1)*(factorial(k)/factorial(i)/factorial(k-i))**2
print i,'\t', metric(i), '\t',i**2, '\t', i*math.log(i)
- SoJu/숙제제출 . . . . 7 matches
scanf("%d",&i);
printf("%d단입니다.\n",i);
printf(" %d x %d = %d \n",j,i,j*i);
scanf("%d",&i);
for(i=0; i<9; ++i) {
for(int i=1; i<=9; ++i)
printf("%d * %d = %d\n", iTimes, i, iTimes * i);
- Star/조현태 . . . . 7 matches
for (register int i = 0; i < (int)calculatePoint[bigNumber[number]].size(); ++i)
for (register int i = 0; i < (int)lines[number].size(); ++i)
for (map<SavePoint, int>::iterator i = points.begin(); i != points.end(); ++i)
sum += (*i).second;
for (register int i = 0; i < 12; ++i)
for (register int i = 2; i < 6; ++i)
for (register int i = 0; i < 10; ++i)
- 논문번역/2012년스터디/신형준 . . . . 7 matches
||(i) u+v = v+u||
||(ii) (u+v)+w = u+(v+w)||
||(iii) u + 0 = 0 + u = u||
||(vi) (c+d)u = cu + du ||
||(vii) c(du) = (cd)u ||
||(viii) 1u = u||
그리고 이것은 c1,...cp의 weights를 같는 v1,..,vp의 선형결합이라고 불려집니다. 이와 같은 선형결합을 실행할때, 위의 속성 (ii)는 우리에게 괄호를 누락시키는걸 허용해줍니다. 선형결합에서 weights는 0을 포함한 어느 실수라도 될 수 있습니다. 예를들어 벡터 (p28의 벡터 3개) v1과 v2의 몇몇의 선형결합과 같이 나타낼 수 있습니다.
- 신기호/중대생rpg(ver1.0) . . . . 7 matches
tmp=itemFind(i);
tmp=_inventory.find(i);
item tmp=inven.find(i);
att_plus+=INVENTORY.find(i).getatt();
def_plus+=INVENTORY.find(i).getdef();
tmp=INVENTORY.find(i);
tmp=INVENTORY.find(i);
- BusSimulation/태훈zyint . . . . 6 matches
for(i=0,j=0;i<=bus->BusLanelength();++i) {
if(bus->BusStationPos(j)==i) {
for(i=0;i<BusNo;++i) {
for(i=0;i<BusNo;++i)
int BusStationPos(int i) { return busStation[i]; } // 버스 정류장의 위치 반환
if(BusStationNo-1 < i) return -1; //버스정류장이 아닐경우
- Chopsticks/문보창 . . . . 6 matches
{{| D[a][n-3a+2 ~ (k+9-a)*2] = (L(i) - L(i-1))^2 + min<sub>i+2<=k</sub>{ D[a-1][k] } |}}
inline int calcDegree(int i)
d[1][i] = calcDegree(i);
d[seti&0x1][i] = calcDegree(i) + min;
for (i = i-1; i >= (nPerson + 9 - seti) * 2; i--)
d[seti&0x1][i] = calcDegree(i) + min;
- EightQueenProblem/조현태 . . . . 6 matches
for (register int i=0; i<8; ++i)
for (register int i=0; i<8; ++i)
for (register int i=-7; i<8; ++i)
for (register int i=-7; i<8; ++i)
for (register int i=0; i<8; ++i)
for (register int i=0; i<8; ++i){
- EightQueenProblem/최태호소스 . . . . 6 matches
if((in-i)>=0 && P[c-i][in-i] ==1){//왼쪽으로..
if( (in+i)<SIZE && P[c-i][in+i]==1 ){//오른쪽으로..
if(Check(i)>0 ){//I 에 놓을수 있을때..
if((in-i)>=0 && P[c-i][in-i] ==1){//왼쪽으로..
if( (in+i)<SIZE && P[c-i][in+i]==1 ){//오른쪽으로..
if(Check(i)>0 ){//I 에 놓을수 있을때..
- Hartals/조현태 . . . . 6 matches
for (int i=0; i<stage; ++i)
scanf("%d",days+i);
scanf("%d",mans+i);
for (register int i=0; i<stage; ++i)
for (int i=0; i<stage; ++i)
for (register int i=1; i<=input_day; ++i)
- JTDStudy/첫번째과제/장길 . . . . 6 matches
public int getBall(int i) {
ball[count++]= ((int)number/(100/i));
number%= (100/i);
public int getBall(int i) {
ball[count++]= ((int)number/(100/i));
number%= (100/i);
- LoveCalculator/zyint . . . . 6 matches
for(vector<string>::iterator i=instr.begin();i<instr.end();++i)
for(i=0;i<strlen(str);++i)
for(i=0;i<strlen(c);++i)
for(i=1;i<numlen(a);++i) jari *= 10;
for(i=numlen(a);i>=1;--i)
while( (a - j * jari) >= 0)
- MineFinder . . . . 6 matches
if (IsNumber (GetData (j,i))) {
nCount = GetAroundClosedCount (j,i) + GetAroundFlagCount (j,i);
if (nCount == GetData(j,i) && GetAroundClosedCount (j,i)) {
SetFlagsAround (j,i);
- PascalTriangle . . . . 6 matches
*(buffer + i) = (int *)malloc( (i + 1) * sizeof(int) );
if(*(buffer + i) == NULL) {
if(j == 0 || j == i) {
*(*(buffer + i) + j) = 1;
*(*(buffer + i) + j) =
free(*(buffer + i));
- 권영기/web crawler . . . . 6 matches
url = 'http://comic.naver.com/webtoon/detail.nhn?titleId=449854&no=' + str(i) + '&weekday=wed'
path = currentpath + '/' + str(i)
prepare.readpage(url, str(i) + '.html')
prepare.extractwt(str(i) + '.html', str(i) + 'file.html')
prepare.download(str(i) + 'file.html')
- 데블스캠프2011/다섯째날/HowToWriteCodeWell/송지원,성화수 . . . . 6 matches
public void move(int i) {
floor = -Math.abs(i);
public void up(int i) {
else move(floor + i);
public void down(int i) {
else move(floor - i);
- 새싹교실/2012/AClass/2회차 . . . . 6 matches
scanf("%d",&i);
diamond(i);
첫번째 인덱스 값(i)이 의미하는 바는 세로줄(열)의 길이이고, 두번째 인덱스 값(j)이 의미하는 바는 가로줄(행)의 길이.
- arr[i]와 *(p+i)는 같음
- *(arr+i) 혹은 *(p+i)가 가능
- 알고리즘3주숙제 . . . . 6 matches
where p(i) = ( x(i), y(i) ).
Note: The distance DELTA( i, j ) between p(i) and p(j) is defined by the expression:
Square root of { (x(i)-x(j))^2 + (y(i)-y(j))^2 }
- 2002년도ACM문제샘플풀이/문제E . . . . 5 matches
for(int i = 0 ; i < num ; ++i)
for(int i = 0 ; i < weights.size() ; ++i)
if(!isSamePos(weights, sortedWeights, i))
for(int i = 0 ; i < weights.size() ; ++i)
if(!isSamePos(weights, sortedWeights, i))
- AcceleratedC++/Chapter10 . . . . 5 matches
i = (*fp)(i);
i = fp(i); // 마찬가지로 이 2개의 표현모두 유효한 표현이된다.
for (size_t i = 0; i < ngrades; ++i) {
for (int i = 2; i != argc; ++i)
for (int i = 1; i < argc; ++i) {
- AcceleratedC++/Chapter12 . . . . 5 matches
char& operator[](size_type i) { return data[i]; }
const char& operator[](size_type i) const { return data[i]; }
for(Str::size_type i=0; i!= s.size(); ++i)
char& operator[](size_type i) { return data[i]; }
const char& operator[](size_type i) const { return data[i]; }
- CToAssembly . . . . 5 matches
printf("%d\n",i);
print(int i)
printf("%d\n",i);
scanf("%d",&i);
my_print(i);
- CppStudy_2002_1/과제1/상협 . . . . 5 matches
void Print(char *in,int i)
template <> char* max(char* in[], int i);
Any max(Any in[], int i);
Any max(Any in[], int i)
char* max(char* in[], int i)
- DispatchedInterpretation . . . . 5 matches
for(int i = 0 ; i < aShape.size() ; ++i)
void* command = aShape.commandAt(i); // 문법 맞나?--;
Arguments& argument = aShape.argumentsAt(i);
for(int i = 0 ; i < aShape.size() ; ++i)
for(int i = 0 ; i < size() ; ++i)
- EffectiveSTL/Iterator . . . . 5 matches
Iter i(ci); // 안된다. 암시적인 형변환은 성립하지 않는다.
Iter i( const_cast<Iter>(ci) ) // 역시 안된다. vector와 string에서는 될지도 모르지만... 별루 추천하지는 않는것 같다.
advance(i, distance(i,ci)); // 요렇게 하면 된다.... 인줄 알았는데 밑에 또 안된다고 써있다--;
advance(i, distance<CIter>(i,ci)); // 이렇게 하면 진짜 된다.
v.erase( (++ri).base() ); // 끝. 이러면 ri는 2를 가르키게 되고 base() 호출후 리턴되는 반복자는 3을 가르킨다. 그걸 지우면 된다.
- EightQueenProblem/강인수 . . . . 5 matches
for(int i = 2 ; i <= n ; ++i)
for(int i = 0 ; i < ar.size() ; ++i)
for(int i = 0 ; i < fac( ar.size() ) ; ++i)
for(int i = 0 ; i < result.size() ; ++i)
for(int i = 0 ; i < N ; ++i)
- EightQueenProblem/김준엽 . . . . 5 matches
for (int i=0; i<8; ++i)
for (int i=0; i<8; ++i)
if (i==x | j==y | (y-j)==(x-i) | (y-j)==-(x-i))
for (int i=0; i<8; ++i)
- JollyJumpers/임인택 . . . . 5 matches
for(int i=0; i<size-1; ++i) {
for(int i=0; i<arr.length; ++i) {
for(int i=0; i<arr.length; ++i) {
for(int i=0; i<arr.length; ++i) {
for(int i=0; i<array.length-1; ++i) {
- LUA_3 . . . . 5 matches
> for i = 1, 10, 2 do print(i) end
> for i = 1,3 do print(i) end
>> print (i)
>> print (i)
>> print(i)
- LoveCalculator/조현태 . . . . 5 matches
for (register int i=0; i<2; ++i)
for (register int i=0; i<2; ++i)
calculate(temp_save_name, input_and_return_cursur(temp_save_name, i), name_score, i);
int input_and_return_cursur(char *temp_save_name, int i)
- MobileJavaStudy/NineNine . . . . 5 matches
dan[i-2] = String.valueOf(i) + " dan";
str += String.valueOf(dan)+" * "+i+" = "+String.valueOf(dan*i)+"\n";
nineDanList.append(String.valueOf(i) + " dan", null);
danForm.append(String.valueOf(dan) + " * " + String.valueOf(i)
+ " = " + String.valueOf(dan * i) + "\n");
- MobileJavaStudy/SnakeBite/FinalSource . . . . 5 matches
cell = getSnakeCell(i);
cell = snake.getSnakeCell(i);
cell = snake.getSnakeCell(i);
g.fillRect(((SnakeCell)snakes.elementAt(i)).x,
((SnakeCell)snakes.elementAt(i)).y, cellRect, cellRect);
- MoreEffectiveC++/Basic . . . . 5 matches
C++에서의 배열은 '''array[i]''' 의 의미는 '''*(array+i)''' 인데 이것의 주소 추적을 위해서 엄밀히 따지면 [[BR]]
for( int i = the number of elements in the array -1; i>0; --i)
for ( int i = 0; i< 10; ++i)
for ( int i = 0; i< 10; ++i)
for ( int i = 9; i>= 0; --i)
- PPProject/20041001FM . . . . 5 matches
roll(str, i);
void roll(int i);
void roll(int i)
strncpy(buffer1, string, i);
strcpy(buffer2,string+i);
- ReverseAndAdd/문보창 . . . . 5 matches
nAdd[i] = makePalim(palim, num, i);
showPalim(palim, nAdd, i);
t = temp / pow(10, len-1-i);
reverseN += t * pow(10, i);
temp -= t * pow(10, len-1-i);
- STL/map . . . . 5 matches
for(map<int, int>::iterator i; i = m.begin() ; i != m.end() ; ++i) {
cout << "key: " << (*i).first
<< "value: " << (*i).second << endl;
cout << "이름:" << (*i).first
<< " 전화번호: " << (*i).second << endl;
- VonNeumannAirport/인수 . . . . 5 matches
for(int i = 0 ; i < _departureGateNums.size(); ++i)
for(int i = 0 ; i < _traffics.size() ; ++i)
for(int i = 0 ; i < numCity ; ++i)
for(int i = 0 ; i < numCity ; ++i)
for(int i = 0 ; i < numCity ; ++i)
- 김재현 . . . . 5 matches
printf("(b+%d) = %p *(b+%d) = %d (pf+%d) = %p *(pf+%d) = %.1f\n", i, (b+i), i, *(b+i), i, (pf+i), i, *(pf+i));
printf("a[%d]=%d *(b+%d)=%d\n", i, a[i], i, *(b+i));
- 데블스캠프2011/다섯째날/HowToWriteCodeWell/김준석,서영주 . . . . 5 matches
public void goTo(int i) {
public String callElevator(int i) {
if(floor < i){
goTo(i);
goTo(i);
- 데블스캠프2011/다섯째날/HowToWriteCodeWell/박정근,김수경 . . . . 5 matches
public void up(int i) {
public void goTo(int i) {
if (floor < i)
if (floor > i)
public void down(int i) {
- 데블스캠프2011/셋째날/String만들기/김준석 . . . . 5 matches
cout << *(value+i);
if(this->charAt(i) == str.charAt(0)){
if(this->charAt(i) == str.charAt(0)){
*(temp + i) = *(offvalue+i);
- 수학의정석/집합의연산/조현태 . . . . 5 matches
for (register int i=0; i<*number_gaesu; ++i)
scanf("%d",numbers+i);
for (register int i=0; i<temp_gaesu; ++i)
for (register int i=0; i<gaesu; ++i)
for (register int i=0; i<combination; ++i)
- 이연주/공부방 . . . . 5 matches
= %.1f\n", i, (pi+i), i, *(pi+i), i, (pf+i), i, *(pf+i));
printf("a[%d]=%d *(b+%d)=%d\n", i, a[i], i, *(b+i));
- 8queen/민강근 . . . . 4 matches
if(arr[(a+i)%8][b]==1)
if(arr[a][(b+i)%8]==1)
if(arr[(a+i)%8][b]==1)
if(arr[a][(b+i)%8]==1)
- AcceleratedC++/Chapter13 . . . . 4 matches
for (vector<Core>::size_type i = 0; i != students.size(); ++i) {
for (vector<Grad>::size_type i = 0; i != students.size(); ++i) {
i != students.size(); ++i) {
i != students.size(); ++i) {
- AdventuresInMoving:PartIV/문보창 . . . . 4 matches
int getDistance(int i)
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;
- AnEasyProblem/강소현 . . . . 4 matches
printJ(i);
private static void printJ(int i){
int [] bin = binI(i);
private static int [] binI(int i){
- Android/WallpaperChanger . . . . 4 matches
//Intent i = new Intent(Intent.ACTION_PICK,android.provider.MediaStore.Images.Media.EXTERNAL_CONTENT_URI);
selectedImagePath = getPath(selectedImageUri);
public String getPath(Uri uri) {
if (stopService(i))
dumpItems(this.getItem(i));
- BasicJAVA2005/실습1/조현태 . . . . 4 matches
for (int i = 0; i < 3; ++i)
for (int i = 0; i < 3; ++i)
for (int i = 0; i < 3; ++i)
for (int i = 0; i < 3; ++i)
- ChocolateChipCookies/조현태 . . . . 4 matches
for (register int i = 0; i < (int)g_points.size(); ++i)
for (register int i = 0; i < (int)g_points.size(); ++i)
for (register int i = 0; i < (int)g_hitPoints.size(); ++i)
for (register int i = 0; i < testCaseNumber; ++i)
- CppStudy_2002_2/STL과제/성적처리 . . . . 4 matches
for(unsigned int i = 0 ; i < _Scores.size() ; ++i)
for(unsigned int i = 0 ; i < _StudentList.size() ; ++i)
for(int i = 0 ; i < 4 ; ++i)
for(unsigned int i = 0 ; i < _StudentList.size() ; ++i)
- EffectiveSTL/Container . . . . 4 matches
for(vector<Object>::const_itarator VWCI = a.begin() + a.size()/2 ; VWCI != a.end() ; ++VWCI)
b.push_back(*VWCI)
for(int i = 0 ; i < 10 ; ++i)
for(vector<Object*>::iterator i = v.begin() ; i != v.end() ; ++i)
for(int i = 0 ; i < 10 ; ++i)
if(badValue(*i))
- EightQueenProblem/강석천 . . . . 4 matches
if self.GetData (x,i) == 1:
if self.GetData (FirstCornerX + i, FirstCornerY + i) == 1:
if self.GetData (FirstCornerX + i, FirstCornerY - i) == 1:
line += "%d" % self.GetData (j,i)
- EightQueenProblem/밥벌레 . . . . 4 matches
if CountRow(i) > 1 then
if CountColumn(i) > 1 then
if CountSlash(i) > 1 then
if CountBackSlash(i) > 1 then
- EightQueenProblem/조현태2 . . . . 4 matches
for (register int i=-7; i<8; ++i)
if (-1<i)
for (register int i=0; i<8; ++i){
for(register int i=0; i<8; ++i)
- HowManyZerosAndDigits/임인택 . . . . 4 matches
for(int i=1; i<n+1; ++i) {
for(int i=0; i<number.length(); ++i) {
if( number.charAt(i)== '0' )
for(int i=0; i<arr.length; ++i) {
- MobileJavaStudy/SnakeBite/Spec2Source . . . . 4 matches
cell = getSnakeCell(i);
cell = snake.getSnakeCell(i);
g.fillRect(((SnakeCell)snakes.elementAt(i)).x,
((SnakeCell)snakes.elementAt(i)).y, snakeRect, snakeRect);
- MobileJavaStudy/SnakeBite/Spec3Source . . . . 4 matches
cell = getSnakeCell(i);
cell = snake.getSnakeCell(i);
g.fillRect(((SnakeCell)snakes.elementAt(i)).x,
((SnakeCell)snakes.elementAt(i)).y, snakeRect, snakeRect);
- OOP/2012년스터디 . . . . 4 matches
printHeader(year, i);
printMonth(year, i);
sum += isLeapYear(i);
sum += numberOfDays(year, i);
- ProgrammingWithInterface . . . . 4 matches
for(int i=0; i<articles.length; ++i)
for(int i=0; i<articles.length; ++i)
for(int i=0; i<articles.length; ++i)
for(int i=0; i<articles.length; ++i)
- ScheduledWalk/임인택 . . . . 4 matches
for(int i=0; i<schedule.length(); ++i) {
char c = schedule.charAt(i);
for(int i=0; i<size; ++i) {
for(int i=0; i<size; ++i) {
- SummationOfFourPrimes/1002 . . . . 4 matches
if self.isPrimeNumber(i):
self.resultTable.append(i)
if self.isPrimeNumber(i):
self.resultTable.append(i)
- TicTacToe/임인택 . . . . 4 matches
for(int i=0; i<3; ++i) {
for(int i=x,j=y; i<3 && j<3 && i>=0 && j>=0; ++i) {
for(int i=x,j=y; i<3 && j<3 && i>=0 && j>=0; --i) {
for(int i=0; i<3; ++i) {
- [Lovely]boy^_^/Temp . . . . 4 matches
SAFE_DELETE(i);
SAFE_DELETE(i);
SAFE_DELETE(i);
SAFE_DELETE(i);
- [Lovely]boy^_^/USACO/WhatTimeIsIt? . . . . 4 matches
for(int i = 0 ; i < str.length() ; ++i)
ret += CharToInt(str[i]) * Jegob(10,(str.length() - i));
for(int i = 0 ; i < e - 1 ; ++i)
for(int i = 0 ; i < a.length() ; ++i)
- [Lovely]boy^_^/USACO/YourRideIsHere . . . . 4 matches
for(i = comet.begin() ; i != comet.end() ; ++i)
a *= AlphabetToNumber(*i);
for(i = group.begin() ; i != group.end() ; ++i)
b *= AlphabetToNumber(*i);
- 간단한C언어문제 . . . . 4 matches
printf("%d", i);
while(scanf("%d", &i), i)
printf("%d", i);
- 데블스캠프2011/다섯째날/HowToWriteCodeWell/강소현,구자경 . . . . 4 matches
goTo(i);//있는 장소로 이동
goTo(i);
public void in(int i) {
public void out(int i) {
- 만년달력/김정현 . . . . 4 matches
totalDays += getDaysInYear(i);
totalDays += getDaysInYearMonth(year, i);
sw.write(String.valueOf(i)+space);
if((startIndex + i)%names.length==0) {
- 방울뱀스터디/Thread . . . . 4 matches
print 'id %s --> %s' % (id, i)
print 'id %s -> %s' % (id, i)
print 'id %s -> %s' % (id, i)
text.insert(1.0, i)
- 벡터/황재선 . . . . 4 matches
cout << (*i).name << "\t" << (*i).score << endl;
cout << (*i).name << "\t" << (*i).score << endl;
- 보드카페 관리 프로그램/강석우 . . . . 4 matches
int price(vector<board>& vec, int hour, int minute, const int& i);
<< vec[i].person << "Person : " << price(vec, hour, minute, i) << "won" << endl;
vec.erase(vec.begin() + i);
int price(vector<board>& vec, int hour, int minute, const int& i)
- 서지혜/Calendar . . . . 4 matches
months.add(new Month(i, getDaysOfMonth(year, i), getStartDate(year, i)));
totalDays += getDaysOfYear(i);
totalDays += getDaysOfMonth(year, i);
- 수/구구단출력 . . . . 4 matches
printf("%dX%d=%d\n",Number,i,Number*i);
printf ("%dX%d=%2d\n",number,i,number*i);
scanf("%d", &i);
printf("%d x %d = %d\n", num, i, num*i);
- 수학의정석/행렬/조현태 . . . . 4 matches
for (register int i=0; i<size_y[0]; ++i)
for (register int i=0; i<size_y[0]; ++i)
for (register int i=0; i<BAE_YOL_SU; ++i)
for (register int i=0; i<BAE_YOL_SU; ++i)
- 오목/곽세환,조재화 . . . . 4 matches
pDC->MoveTo(50 ,50+30*i); // 줄을 입력
pDC->LineTo(320 ,50+30*i);
pDC->Ellipse(35+30*j,35+30*i, 65+30*j,65+30*i);
pDC->Ellipse(35+30*j,35+30*i, 65+30*j,65+30*i);
- 05학번만의C++Study/숙제제출4/조현태 . . . . 3 matches
for (register int i=0; i<classNumber; ++i)
for (register int i=suchNumber+1; i<classNumber; ++i)
for (register int i=0; i<classNumber; ++i)
- 3N+1Problem/Leonardong . . . . 3 matches
cycleLength = self.getCycleLength(i)
if self.getCycleLen(i) > maximum:
maximum = self.getCycleLen(i)
- AcceleratedC++/Chapter14 . . . . 3 matches
i != students.size(); ++i) {
char& operator[](size_type i) {
const char& operator[](size_type i) const { return (*data)[i]; }
- C 스터디_2005여름/학점계산프로그램/김태훈김상섭 . . . . 3 matches
for(vector<double>::iterator i=score.begin();i !=score.end();++i)
for(vector<Score>::iterator i=ban.begin();i!=ban.begin()+ban.size()/10;++i)
for(i=ban.begin();i!=ban.end();++i)
- ClassifyByAnagram/Passion . . . . 3 matches
item = (String)lines.get(i);
if (buffer.charAt(i) > buffer.charAt(j))
tmpChar = buffer.charAt(i);
- ClassifyByAnagram/인수 . . . . 3 matches
for(int i = 0 ; i < str.size() ; ++i)
for(int i = 0 ; i < str.size() ; ++i)
for(MALSI i = _anagramTable.begin() ; i != _anagramTable.end() ; ++i)
- CppStudy_2002_1/과제1/Yggdrasil . . . . 3 matches
setgolf(golfer1, name, handi);
handicap(golfer1, handi);
void max<char *>(char * arr[], int i);
- EightQueenProblem/da_answer . . . . 3 matches
== Project2.exe (Delphi) ==
showMessage(inttostr(i));
showMessage(inttostr(i));
- HanoiProblem/임인택 . . . . 3 matches
towers[0].putOnDisc(i);
discsAtPillar.add(i);
System.out.println(i);
- HaskellExercises/Wikibook . . . . 3 matches
(i) list 0 = head list
(i) list index = (i) (tail list) (index-1)
- JSP/SearchAgency . . . . 3 matches
out.println("doc="+hits.id(i)+" score="+hits.score(i));
Document doc = hits.doc(i);
- JollyJumpers/신재동 . . . . 3 matches
if(listSize - 1 < getGap(aList, i))
public int getGap(Vector aList, int i) {
int gap = ((Integer)aList.get(i)).intValue() - ((Integer)aList.get(i + 1)).intValue();
- MagicSquare/인수 . . . . 3 matches
for(int i = 0 ; i < _size ; ++i)
for(int i = 1 ; i <= _size*_size ; ++i) {
for(int i = 0 ; i < _size ; ++i) {
- Map/임영동 . . . . 3 matches
/*for(int i=0;i!=input.size();++i)
(*i)=(*it)[(*i)];
- Map연습문제/임영동 . . . . 3 matches
/*for(int i=0;i!=input.size();++i)
(*i)=(*it)[(*i)];
- MedusaCppStudy/석우 . . . . 3 matches
void vend(int& won, vector<Drinks>& vec, const vector<Drinks>::size_type& i);
vend(won, vec, i);
void vend(int& won, vector<Drinks>& vec, const vector<Drinks>::size_type& i)
- Monocycle/조현태 . . . . 3 matches
for (register int i = 0; i < (int)g_cityMap.size(); ++i)
for (register int i = 0; i < 4; ++i)
for (register int i = 0; i < mapHeight; ++i)
- MoreEffectiveC++/Operator . . . . 3 matches
for ( int i = 0; i<10; ++i)
for ( int i = 0; i < 10; ++i)
for ( int i = 0; i<10; ++i)
- MySQL/PasswordFunctionInJava . . . . 3 matches
if(aStr.charAt(i) == ' ' || aStr.charAt(i) == '\t') continue; /* skipp space in password */
int tmp = (aStr.charAt(i));
- OurMajorLangIsCAndCPlusPlus/print/김상섭 . . . . 3 matches
print_d(*(temp+i), 0);
print_s(*(temp+i), 0);
print_f(*(temp+i), 0);
- PPProject/Colume2Exercises . . . . 3 matches
cout << "after shifting : " << roll(str, n, i) << endl;
int gcd = getGcd(n, i);
// swap(str, 0, i-1, i, n-i);
- ProgrammingLanguageClass/2006/EndTermExamination . . . . 3 matches
int fun(int *i)
return 2*(*i)-1;
SUM = fun(&i) + fun(&j) +(i+j)/2
- RandomWalk2/Insu . . . . 3 matches
IncreaseVisitCount(i);
IncreaseVisitCount(i);
IncreaseVisitCount(i);
- STL/vector/CookBook . . . . 3 matches
for(int i = 0 ; i < num ; ++i)
for(int i = 0 ; i < num ; ++i)
for(int i = 0 ; i < ar.size() ; ++i)
- Self-describingSequence/1002 . . . . 3 matches
for i in [100,9999,123456,1000000000]: print selfDescrib(i)
theGroupIdx = findGroupIdx(table,i)
theGroupIdx = finder.find(i)
- SmithNumbers/문보창 . . . . 3 matches
if (sum_digit_number(i) == sum_digit_prime_factor(i))
sumDigitPrimeFactor += sum_digit_number(i);
- SmithNumbers/신재동 . . . . 3 matches
void process(int i);
void process(int i)
process(i);
- StacksOfFlapjacks/조현태 . . . . 3 matches
for (register int i=number_cake-1; i>=0; --i)
if (maximum!=i)
printf("%d ",number_cake-i);
- Steps/조현태 . . . . 3 matches
for (register int i = 1; i < (int)initNumbers.size(); ++i)
makedNumbers.push_back(i);
for (int i = 0; i < testCaseNumber; ++i)
- TheJavaMan/숫자야구 . . . . 3 matches
if ( correct_answer.charAt(i) == aStr.charAt(i))
if ( correct_answer.charAt(i) == aStr.charAt(j))
- TheJavaMan/지뢰찾기 . . . . 3 matches
map[((Point)mines.get(i)).y][((Point)mines.get(i)).x] = -1;
kan[i][j] = new Kan(map[i][j], j, i);
- WOWAddOn/2011년프로젝트/초성퀴즈 . . . . 3 matches
baseName = GetItemInfo(i)
baseName = GetItemInfo(i)
len = charLen(str:sub(i,i))
- [Lovely]boy^_^/USACO/PrimePalinDromes . . . . 3 matches
if(IsPalinDromes(IntConvertToString(i)))
if(IsPrime(i))
if(!(n%i))
- [Lovely]boy^_^/[Lovely]boy^_^/USACO/Barn . . . . 3 matches
for(int i = 0 ; i < ar.size() - 1 ; ++i)
for(int i = 0 ; i < iter ; ++i)
for(int i = 0 ; i < pivots.size() ; ++i)
- 데블스캠프2009/목요일/연습문제/다빈치코드/박준호 . . . . 3 matches
void CmpColor(hand handsort[], int i);
void CmpColor(hand handsort[],int i)
CmpColor(handsort, i);
- 데블스캠프2011/다섯째날/HowToWriteCodeWell/정의정,김태진 . . . . 3 matches
public void goTo(int i) {
public void callElevatorUp(int i) {
public void callElevatorDown(int i) {
- 데블스캠프2012/넷째날/묻지마Csharp/Mission3/김수경 . . . . 3 matches
milli.Text = string.Format("{0}", time.milli);
listBox1.Items.Add(string.Format("{0:D2}:{1:D2}:{2:D2}.{3}", time.hour, time.minute, time.second, time.milli));
this.Controls.Add(this.milli);
- 빵페이지/도형그리기 . . . . 3 matches
memset(odd, '*', i);
string odd = asterisks.substr(0,i);
} while(--i);
- 새싹교실/2011/쉬운것같지만쉬운반/2011.4.6 . . . . 3 matches
printf("----- %d단 -----\n", i);
printf("%d\n", i);
printf("%d\n", i);
- 새싹교실/2012/AClass/5회차 . . . . 3 matches
printf("%d*%d=%d\n",a,i,a*i);
printf("%d*%d=%d ",j,i,j*i);
* 한번 비교 동작이 끝난 후, 그 결과를 이용하여 다음에 비교할 대상(K<Ki)을 선택하는 방법으로 검색한다.
- 새싹교실/2012/새싹교실강사교육/3주차 . . . . 3 matches
printf("%s\t", (pcal+i)->name);
if(strcmp(name, (pcal+i)->name) == 0){
totalcal += (pcal+i)->value * gram /100.0;
- 새싹교실/2012/열반/120402 . . . . 3 matches
printstar(N-i);
printstar(i)
printstar(N+1-i);
- 새싹교실/2012/주먹밥 . . . . 3 matches
printf("%s\t", (pcal+i)->name); //이름을. 출력합니다
if(strcmp(name, (pcal+i)->name) == 0){
totalcal += (pcal+i)->value * gram /100.0;
- 새싹교실/2013/라이히스아우토반/2회차 . . . . 3 matches
scanf(" %c",&i);
printf("%c",i);
printf("%c",i);
- 소수구하기/임인택 . . . . 3 matches
for(j=0; tmp_arr[j]<=sqrt(i); j++)
for(j=0; tmp_arr[j]<sqrt(i); j++) }}}
for(j=0; tmp_arr[j]<=sqrt(i); j++) }}}
- 식인종과선교사문제/변형진 . . . . 3 matches
function ferry($canni, $missi)
elseif($canni<=0&&$missi<=0) echo "좌측 식인종 {$this->left[canni]}+".(-$canni).", 선교사 {$this->left[missi]}+".(-$missi)."<br>";
- 영어학습방법론 . . . . 3 matches
* 주의점 : i) 듣기가 일차적임[[BR]]
ii) 사전을 찾지 않는다.[[BR]]
iii) 책은 듣기를 위한 참고 자료로 삼는다.[[BR]]
- 오목/재선,동일 . . . . 3 matches
pDC ->MoveTo(5,i);
pDC ->LineTo(1005,i);
if (x>5+30*i && x < 35+30*i)
- 주민등록번호확인하기/조현태 . . . . 3 matches
for (register int i=0; i<12; ++i)
for (register int i=0; i<12; ++i)
for (register int i=0; i<12; ++i)
- 코드레이스/2007.03.24상섭수생형진 . . . . 3 matches
return ((((Y * 12 + m) * 30 + d) * 24 + H) * 60 + i) * 60 + s;
return ((((Y * 12 + m) * 30 + d) * 24 + H) * 60 + i) * 60 + s;
return ((((Y * 12 + m) * 30 + d) * 24 + H) * 60 + i) * 60 + s;
- 2002년도ACM문제샘플풀이/문제A . . . . 2 matches
for(int i = 0 ; i < 4 ; ++i)
rect1Line = GenerateLine(i);
- 2002년도ACM문제샘플풀이/문제D . . . . 2 matches
for(int i = 0 ; i < num ; ++i)
for(int i = 0 ; i < weights.size() ; ++i)
- 2학기파이선스터디/채팅창 . . . . 2 matches
self.show.insert(END, str(i))
self.list.insert(END, str(i))
- 2학기파이선스터디/클라이언트 . . . . 2 matches
self.show.insert(END, str(i))
self.list.insert(END, str(i))
- 3N+1Problem/강소현 . . . . 2 matches
if(max < length(i))
max = length(i);
- 3N+1Problem/곽세환 . . . . 2 matches
great_length = cycle(temp_i);
if ((temp = cycle(temp_i)) > great_length)
- 3n 1/Celfin . . . . 2 matches
if(cycleNumber(i)>cycle)
cycle = cycleNumber(i);
- 5인용C++스터디/더블버퍼링 . . . . 2 matches
Position.x + i, Position.y + i);
Position.x + 10 + i, Position.y + 10 + i);
- 8queen/곽세환 . . . . 2 matches
find(0, i);
find(row + 1, i);
- ACM_ICPC/PrepareAsiaRegionalContest . . . . 2 matches
gamer.flipLine(i);
gamer.flipLine(i);
- AcceleratedC++/Chapter7 . . . . 2 matches
for(Rule::const_iterator i = r.begin(); i != r.end(); ++i)
for (Rule::const_iterator i = r.begin(); i != r.end(); ++i)
- BlueZ . . . . 2 matches
ba2str(&(ii+i)->bdaddr, addr);
if (hci_read_remote_name(sock, &(ii+i)->bdaddr, sizeof(name),
- CNight2011/고한종 . . . . 2 matches
arr[i] = *&(arr[0]+sizeof(int)*i);
arr[i][j] *&(arr[0][0] sizeof(int)*i*j+sizeof(int)*i); -> 맞겠지여...?
- CPPStudy_2005_1/STL성적처리_3 . . . . 2 matches
for(vector<student_type>::iterator i=ztable.begin();i<ztable.end();++i)
for(vector<student_type>::iterator i=ztable.begin() ;i<ztable.end();++i)
- CPPStudy_2005_1/STL성적처리_3_class . . . . 2 matches
for(vector<student_table>::iterator i=ztable.begin();i<ztable.end();++i)
for(vector<student_table>::iterator i=ztable.begin() ;i<ztable.end();++i)
- CarmichaelNumbers/조현태 . . . . 2 matches
for (register int i=2; i<number; ++i)
for (register int i=3; i<=number; ++i)
- Chapter II - Real-Time Systems Concepts . . . . 2 matches
-- E(i) 1/n
-- T(i)
- ClassifyByAnagram/sun . . . . 2 matches
byte t = buf.get(i);
do i++; while (i <= u && buf.get(i) < buf.get(l));
- CodeRace/20060105/민경선호재선 . . . . 2 matches
String temp = list.get(i).getName();
System.out.printf("%-15s\t%d\t%d\n", temp, list.get(i).getCount(), count);
- CubicSpline/1002/LuDecomposition.py . . . . 2 matches
self._writeL(i)
self._writeU(i)
- EcologicalBinPacking/김회영 . . . . 2 matches
if(j%3 == i)
save[2]=bgc[3-((j%3)+i)];
- EightQueenProblem/김형용 . . . . 2 matches
result.append((num, y+i))
result.append((num, y+i))
- EightQueenProblem/이준욱 . . . . 2 matches
map[i] |= (MASK << x) | (MASK << (x - y + i)) | (MASK << (x + y - i));
- FactorialFactors/1002 . . . . 2 matches
total = sum((CountFunc(i) for i in xrange(2,n+1)))
for i in [2,5,8,1996,123456,1000000]: print factorialFactor(i)
- FactorialFactors/조현태 . . . . 2 matches
for (register unsigned int i=3; i<=suchEnd; ++i)
for (register unsigned int i = suchEnd + 1; i <= answer; ++i)
- HanoiTowerTroublesAgain!/조현태 . . . . 2 matches
for (register int i = 0; i < stickNumber; ++i)
for (int i = 0; i < testCaseNumber; ++i)
- HowManyZerosAndDigits/문보창 . . . . 2 matches
nDigit += log(i) / log(B);
backTemp = int(i);
- JavaNetworkProgramming . . . . 2 matches
for(int i=0; i<msg.length(); ++i)
System.out.write(msg.charAt(i) & 0xff); //16비트 유니코드로 구성된 String은 연속한 바이트로 매스킹한후 출력
- JavaScript/2011년스터디/URLHunter . . . . 2 matches
if(mop[i]==1 || hunter==i){
if(mop[i]==1 && hunter==i){
- JavaScript/2011년스터디/김수경 . . . . 2 matches
document.write(dan + " X " + i + " = " + (dan * i) + "<br/>");
gugu(i);
- JollyJumpers/오승균 . . . . 2 matches
if (temp == i)
if (temp != i)
- JollyJumpers/조현태 . . . . 2 matches
for (int i = 0; i < nums.Length; ++i)
for (int i = 1; i < nums.Length - 1; ++i)
- JollyJumpers/황재선 . . . . 2 matches
System.out.println(v.get(i));
System.out.println((String) list.get(i));
- MineSweeper/김회영 . . . . 2 matches
arrayOfMine[(i)*width+(j-1)]++;
arrayOfMine[(i)*width+(j+1)]++;
- Omok/상규 . . . . 2 matches
if(check(board,x,y,3,i)) return 1;
if(check(board,testx,testy,3,i)) return 1;
- One/박원석 . . . . 2 matches
printf("%3d",i);
printf("%3d",i);
- One/윤현수 . . . . 2 matches
printf("%d ",i);
printf("숫자를 입력하세요"); scanf("%d" ,&i);
- Ones/송지원 . . . . 2 matches
ones(&ns, i);
if( i <= LENBOUND ) printf("%d\n", i);
- PNGFileFormat/FormatUnitTestInPythonLanguage . . . . 2 matches
idx = self.png.getIdx(0,i)-1
c = long(i)
- PrimaryArithmetic/허아영 . . . . 2 matches
nums1[i] = big_num / pow(10, i);
nums2[i] = small_num / pow(10, i);
- ProgrammingPearls/Column3 . . . . 2 matches
for(int i = 0 ; i < 4 ; ++i)
for(int i = 0 ; i < NUM_ITEMS ; ++i)
- ReverseAndAdd/Celfin . . . . 2 matches
if((int)(tempNum/pow(10, i))!=0)
input[number]=(int)(tempNum/pow(10, i))%10;
- STL/list . . . . 2 matches
for(i = l.begin() ; i != l.end() ; ++i)
for(i = l.begin() ; i != l.end() ; ++i)
- STL/set . . . . 2 matches
for(set<int>::iterator i = s.begin() ; i != s.end() ; ++i) {
for(set<int>::iterator i = s.begin() ; i != s.end() ; ++i) {
- STL/vector . . . . 2 matches
for(i = ar.begin() ; i != ar.end() ; ++i)
for(vecIter i = nums.begin() ; i != nums.end() ; ++i)
- SmallTalk/강좌FromHitel/소개 . . . . 2 matches
경GUI), 모든 것이 객체이며 이 객체들 간에 존재하는 상속성, 그리고 기억 공간
ShowMessage( IntToStr(i) );
(data at: i) = key ifTrue: [
- SmallTalk_Introduce . . . . 2 matches
경GUI), 모든 것이 객체이며 이 객체들 간에 존재하는 상속성, 그리고 기억 공간
ShowMessage( IntToStr(i) );
(data at: i) = key ifTrue: [
- SmithNumbers/남상협 . . . . 2 matches
if(getEachSum(i)==getPrimeFactorSum(i))
- Steps/김상섭 . . . . 2 matches
unsigned int found(unsigned int i)
while(max[temp] < i)
- SummationOfFourPrimes/곽세환 . . . . 2 matches
if (isPrime(i))
if (is_prime(i))
- TermProject/재니 . . . . 2 matches
grade(i); // 학점을 산출하는 함수 포출
void grade(int i) // 학점을 산출하는 함수
- TriDiagonal/1002 . . . . 2 matches
self._writeL(i)
self._writeU(i)
- UglyNumbers/이동현 . . . . 2 matches
if (((Double) arr.get(i)).doubleValue() > n) {
} else if (((Double) arr.get(i)).doubleValue() == n)
- VendingMachine_참관자 . . . . 2 matches
void SetMenuM(int i);
void VendingMachine::SetMenuM(int i)
- ViImproved/설명서 . . . . 2 matches
텍스트 파일 응용 프로그램의 source data 또는 문서화된 파일(ASCII)
Screen editor 문자 단위 편집(vi)
autoindent(ai) noai 들여 쓰기 기능 자동설정
- [Lovely]boy^_^/USACO/MixingMilk . . . . 2 matches
for(int i = 0 ; i < numf ; ++i)
for(int i = 0 ; i < numlist.size() ; ++i)
- html5practice/즐겨찾기목록만들기 . . . . 2 matches
key = localStorage.key(i);
key = localStorage.key(i);
- 경시대회준비반/BigInteger . . . . 2 matches
if(V.End>=i) temp = (long)qhat*(long)V.TheNumber[V.End-i] + temp;
if(V.End>=i) y += (long)V.TheNumber[V.End-i];
- 구구단/이태양 . . . . 2 matches
printf("%d * %d = %d \t",dan,i,dan*i);
printf("%d * %d = %d \t",dan,i,dan*i);
- 구구단/주요한 . . . . 2 matches
printf("%d * %d = %d\t", j, i, j*i);
printf("%d * %d = %d\t", j, i, j*i);
- 금고/조현태 . . . . 2 matches
for (register int i = 1; i < (int)nodes.size(); ++i)
for (register int i = 0; i < testNumber; ++i)
- 논문번역/2012년스터디/김태진 . . . . 2 matches
(i) T의 정의역에서 모든 u,v에 대하여 T(u+v) = T(u) + T(v)
(ii) T의 공역에서 모든 스칼라 c와 모든 u에 대하여 T(cu) = cT(u)
- 데블스캠프2005/금요일/OneCard/이동현 . . . . 2 matches
Card card = ((Card)arr.get(i));
card = (Card)arr.get(i);
- 데블스캠프2006/월요일/연습문제/switch/이장길 . . . . 2 matches
cout<<char('A'+i)<<" --> "<<*(n+i)<<endl;
- 데블스캠프2006/화요일/pointer/문제1/윤성준 . . . . 2 matches
void swap(int *n, int *i);
void swap(int *n, int *i)
- 데블스캠프2009/금요일/연습문제/ACM2453/김홍기 . . . . 2 matches
int b(n){int a=0;for(;;n/=2){if(n%2)a++;if(!n)break;}return a;}main(i,n){for(;;){scanf("%d",&n);if(!n)break;for(i=n+1;b(n)!=b(i);i++);printf("%d\n",i);}}
- 떡장수할머니/강소현 . . . . 2 matches
if((k-x*i)%y==0){
System.out.println(i+"\n"+(k-x*i)/y);
- 마름모출력/zyint . . . . 2 matches
print spc*(size-i) + pattern*(2*i-1)
print spc*(size-i) + pattern*(2*i-1)
- 마름모출력/김범준 . . . . 2 matches
print ' '*((n-i)/2), p*i
print ' '*((n-i)/2), p*i
- 마름모출력/문보창 . . . . 2 matches
print ' ' * (size - i),
print pattern * ((size-i) * 2 + 1)
- 마름모출력/허아영 . . . . 2 matches
print ' '*(n-i),
print p*(2*(n-1-i)-1)
- 문제풀이/1회 . . . . 2 matches
inNums = [ int(i) for i in raw_input('input numbers with space:\n').split() ]
news.append(int(i))
- 벡터/권정욱 . . . . 2 matches
cout << (*i).name << "의 성적은 : " << (*i).score << endl;
- 벡터/김홍선,노수민 . . . . 2 matches
cout << (*i).name << endl;
cout << (*i).score << endl;
- 벡터/임영동 . . . . 2 matches
cout<<(*i).name<<" "<<(*i).score<<endl;
- 복/숙제제출 . . . . 2 matches
printf("%dX%d=%d\n",input,i,input*i);
scanf("%d",&i);
- 비밀키/임영동 . . . . 2 matches
(*i)+=key;
(*i)-=key;
- 새싹교실/2011/씨언어발전/5회차 . . . . 2 matches
if (isPrime(i)==TRUE) printf(“%d\n”,i);
- 새싹교실/2012/아우토반/앞반/4.5 . . . . 2 matches
for(j=0;j<(10-i);j++)
for(j=0;j<(10-i);j++)
- 소수구하기/인수 . . . . 2 matches
else if(IsPrime(i))
printf("%d ",i);
- 식인종과선교사문제/조현태 . . . . 2 matches
for (register int i = 0; i < NUMBER_MOVE_TYPE; ++i)
for (register int i = 0; i < (int)moveData.size(); ++i)
- 알고리즘8주숙제/문보창 . . . . 2 matches
void insertNode(int i)
insertNode(i);
- 오목/재니형준원 . . . . 2 matches
pDC->MoveTo(20, i);
pDC->LineTo(560, i);
- 자료병합하기/조현태 . . . . 2 matches
for (register int i=0; a[i]!=END_OF_DATA; ++i)
for (register int i=0; i<size; ++i)
- 중위수구하기/조현태 . . . . 2 matches
for (int i=0; i<MAX_NUMBER; ++i)
for (int i=0; i<MAX_NUMBER-1; ++i)
- 큰수찾아저장하기/김영록 . . . . 2 matches
space[i][3] = width_sort(i);
space[3][i] = height_sort(i);
- 큰수찾아저장하기/조현태 . . . . 2 matches
for (register int i=0; i<MAX_SAERO-1; ++i)
for (register int i=0; i<MAX_SAERO; ++i)
- 토이/숫자뒤집기/김정현 . . . . 2 matches
reversedChar[input.length-i-1]= input.charAt(i);
sw.write(number.charAt(i));
- 호너의법칙/조현태 . . . . 2 matches
if (10<=i)
for (register int i=0; i<SIZE_OF_LINE; ++i){
- .bashrc . . . . 1 match
DISPLAY=$(who am i)
- 2002년도ACM문제샘플풀이/문제B . . . . 1 match
for(int i = 1 ; i <= 40320 ; ++i)
- 2010php/방명록만들기 . . . . 1 match
if($page == $i){
- 2thPCinCAUCSE/ProblemA/Solution/상욱 . . . . 1 match
} else if ( i+j <= k || i+k <= j || j+k <= i) {
- 3N+1Problem/신재동 . . . . 1 match
int count = getCount(i);
- 3n 1/이도현 . . . . 1 match
temp = cycle_length(i); // cycle legnth 찾기
- ACM_ICPC/2013년스터디 . . . . 1 match
* Longest increasing subsequence : DAG로 바꾼다.(increasing하는 곳에만 edge생성됨) 이후 가장 많이 방문하도록 L(j) = 1+ max{L(i) : (i,j)}수행
- AcceleratedC++/Chapter9 . . . . 1 match
i != students.size(); ++i) {
- AdventuresInMoving:PartIV/김상섭 . . . . 1 match
int getDistance(int i)
- AnEasyProblem/권순의 . . . . 1 match
output += (int)(getBinary[i] * pow(2.0, i));
- Basic알고리즘/팰린드롬/조현태 . . . . 1 match
for (register unsigned int i = 0; i < strSize / 2; ++i)
- BeeMaja/조현태 . . . . 1 match
for (register int i = 0; i < 6; ++i)
- BeeMaja/허준수 . . . . 1 match
switch(i)
- BigBang . . . . 1 match
arr.delete(i);
- BuildingWikiParserUsingPlex . . . . 1 match
(interwiki, repl_interwiki),
- BusSimulation/영동 . . . . 1 match
bus[i].show(i);
- CPP_Study_2005_1/Basic Bus Simulation/김태훈 . . . . 1 match
for(i=1;i<=BUS_NO;++i) { //버스 속도
- ChocolateChipCookies/허준수 . . . . 1 match
cookies.push_back(cooki);
- ClipMacro . . . . 1 match
[[Clip(OneStarKospi)]]
- Code/RPGMaker . . . . 1 match
return Color.new(value[0].to_i, value[1].to_i, value[2].to_i, value[3].to_i)
- DataStructure/List . . . . 1 match
boolean Delete_Special(int coordi)
- DataStructure/String . . . . 1 match
f(j) = largest i such that i < j and 문자열의 0 ~ i번째 = 문자열의 (j - i) ~ j번째, if such an i exists
- ErdosNumbers/황재선 . . . . 1 match
if (person.compareTo(nameList.get(i)) == 0)
- FactorialFactors/문보창 . . . . 1 match
for (j = i + i; j <= MAXN; j+=i)
- FastSearchMacro . . . . 1 match
{{{[[FastSearch(Moniwiki)]]}}}
- FileInputOutput . . . . 1 match
a,b=[int(i) for i in fin.read().split()]
- Hartals/상협재동 . . . . 1 match
process(i);
- HowManyFibs?/1002 . . . . 1 match
fiboI = fibo(i)
- JTDStudy/첫번째과제/상욱 . . . . 1 match
if (resultNumber.charAt(i) == userNumber.charAt(j)) {
- JTDStudy/첫번째과제/정현 . . . . 1 match
numbers.add(String.valueOf(i));
- Java2MicroEdition/MidpHttpConnectionExample . . . . 1 match
for(int i=0; i<4; ++i) {
- JavaStudy2002/영동-3주차 . . . . 1 match
aboard.move((String) jouney.get(i));
- JollyJumpers/Celfin . . . . 1 match
numList.erase(numList.begin()+i);
- JollyJumpers/김회영 . . . . 1 match
if(array[j]==i)
- JollyJumpers/임인택3 . . . . 1 match
case (length(Ori)-1 =:= length(Res) andalso lists:sum(Res) =:= trunc((hd(Res)+lists:last(Res))*length(Res)/2)) of
- JollyJumpers/허아영 . . . . 1 match
if(compare[i] == i)
- Linux . . . . 1 match
Linus (torv...@kruuna.helsinki.fi)
- Linux/필수명령어/용법 . . . . 1 match
- Z : 좀비(zombi) 프로세서
- LongestNap/문보창 . . . . 1 match
show(nap, i);
- Lotto/강소현 . . . . 1 match
private static int[] decToBin(int i){
- MatrixAndQuaternionsFaq . . . . 1 match
first (i), column second (j) ie.
Then the interpolated rotation matrix (MI) is specified as:
- MineSweeper/황재선 . . . . 1 match
String [][] arr = (String [][]) v.get(i);
- MoinMoinTodo . . . . 1 match
* Setup tool (cmd line or cgi): fetch/update from master set of system pages, create a new wiki from the master tarball, delete pages, ...
- MoniWiki/HotKeys . . . . 1 match
||R(not Safari)||action=show ||Refresh||
- MoreEffectiveC++/Exception . . . . 1 match
double sqrtOfi = sqrt(i);
- MultiplyingByRotation/곽세환 . . . . 1 match
dec += number[i] * pow(base, i);
- NSIS . . . . 1 match
NSIS installer들은 'MakeNSIS' 프로그램에 의해서 NSI script (.NSI) 를 컴파일함으로서 만들어진다.
NSIS Script File (.nsi) 는 command 들의 묶음인 batch-file와도 같아보이는 text file이다.
- One/구구단 . . . . 1 match
printf("단을 입력하세요."); scanf("%d",&i);
- OperatingSystemClass/Exam2002_1 . . . . 1 match
만약, 예상 초기치 (J0 는 10 이라고 가정하고, 실제 CPU burst(ti) 가 6, 4, 6, 4, 13, 13, 13 ....
- OurMajorLangIsCAndCPlusPlus/Class . . . . 1 match
X(int ii, const string& n, Date d, Club& c) : i(ii), c(n, d), pc(c) {}
- OurMajorLangIsCAndCPlusPlus/ctype.h . . . . 1 match
|| 함수명(Ascii) || 내용 ||
- OurMajorLangIsCAndCPlusPlus/math.h . . . . 1 match
|| 함수명(Ascii) || 내용 ||
- PokerHands/문보창 . . . . 1 match
switch (i)
- PolynomialCoefficients/문보창 . . . . 1 match
if (coeffi)
- PrimeNumberPractice . . . . 1 match
for (int i = 2, secondIter = masterIter * i; secondIter < length; secondIter = masterIter * ++i) {
- ProgrammingLanguageClass/2006/Report3 . . . . 1 match
print( sum(i, 1, 100, 1/i))
- ProjectPrometheus/개요 . . . . 1 match
하지만, 현재의 도서관 시스템은 사용하면 할 수록 불편한 시스템이다. "Ease of Learning"(MS 워드)과 "Ease of Use"(Emacs, Vi) 어느 것도 충족시키지 못한다.
지금 도서관의 온라인 시스템은 상당히 오래된 레거시 코드와 아키텍춰를 거의 그대로 사용하면서 프론트엔드만 웹(CGI)으로 옮긴 것으로 보인다. 만약 완전한 리스트럭춰링 작업을 한다면 얼마나 걸릴까? 나는 커스터머나 도메인 전문가(도서관 사서, 학생)를 포함한 6-8명의 정예 요원으로 약 5 개월의 기간이면 데이타 마이그레이션을 포함, 새로운 시스템으로 옮길 수 있다고 본다. 우리과에서 이 프로젝트를 하면 좋을텐데 하는 바램도 있다(하지만 학생의 사정상 힘들 것이다 -- 만약 풀타임으로 전념하지 못하면 기간은 훨씬 늘어날 것이다). 외국의 대학 -- 특히 실리콘벨리 부근 -- 에서는 SoftwareEngineeringClass에 근처 회사의 실제 커스터머를 데려와서 그 사람이 원하는 "진짜" 소프트웨어를 개발하는 실습을 시킨다. 실습 시간에 학부생과 대학원생이, 혹은 저학년과 고학년이 어울려서(대학원생이나 고학년이 어울리는 것이 아주 중요하다. see also SituatedLearning ) 일종의 프로토타입을 만드는 작업을 하면 좋을 것 같다. 엄청나게 많은 것을 배우게 될 것이다.
- RandomWalk/ExtremeSlayer . . . . 1 match
SetArrayAsZero(i);
- ReverseAndAdd/김회영 . . . . 1 match
returnValue+=arrayOfDigit[i]*pow(10,count-i);
- SOLDIERS/송지원 . . . . 1 match
sumXmove += abs(x[j] - i);
- Self-describingSequence/조현태 . . . . 1 match
for (register int i = 1; nowNumber < pointNumber; ++i)
- ShellSort/문보창 . . . . 1 match
if (isMove[j] && code[j] == i)
- Slurpys/강인수 . . . . 1 match
if IsSlimp(Copy(S,1,i)) and IsSlump(Copy(S,i+1,MAX_STR_LEN)) then
- SmithNumbers/조현태 . . . . 1 match
for (register unsigned int i=3; i<=MAX_NUMBER; ++i)
- SpiralArray/임인택 . . . . 1 match
for j in range(i):
- StacksOfFlapjacks/문보창 . . . . 1 match
flip(s, i);
- Steps/문보창 . . . . 1 match
else if (n <= i * i)
- SummationOfFourPrimes/김회영 . . . . 1 match
if(check_prime_number(i)==true)
- SummationOfFourPrimes/문보창 . . . . 1 match
for (int j=3; j <= sqrt(i); j+=2)
- ThePriestMathematician . . . . 1 match
"하노이의 탑(Tower of Hanoi)" 퍼즐에 관한 고대 신화는 이미 잘 알려져 있다. 최근 밝혀진 전설에 의하면, 브라흐마나 수도사들이 64개의 원반을 한 쪽 침에서 다른 쪽 침으로 옮기는 데 얼마나 오래 걸리는지를 알아내고 나서는 더 빠르게 옮기는 방법을 찾아내자는 결론을 내렸다. 다음 그림은 침이 네 개인 하노이의 탑이다.
- TheTrip/황재선 . . . . 1 match
Double num = (Double) list.get(i);
- TheWarOfGenesis2R/Temp . . . . 1 match
for(int i = 0 ; i < con.size() ; ++i)
- TicTacToe/노수민 . . . . 1 match
g.drawLine(100, 100 + 100 * i, 400, 100 + 100 * i);
- UML . . . . 1 match
This diagram describes the sequences of messages of the (simple) Restaurant System. This diagram represents a Patron ordering food and wine; drinking wine then eating the food; finally paying for the food. The dotted lines extending downwards indicate the timeline. The arrows represent messages (stimuli) from an actor or object to other objects. For example, the Patron sends message 'pay' to the Cashier. Half arrows indicate asynchronous method calls.
- UbuntuLinux . . . . 1 match
SCIM이란 녀석이 있는데 참 좋다. 그 전에 쓰던 나비(Nabi)는 마지막 글자가 완성되지 않는 경우가 생기곤 했다.
- UglyNumbers/구자겸 . . . . 1 match
if ( !unum(i) ) {
- UglyNumbers/황재선 . . . . 1 match
numberList = [pow(2,i)*pow(3,j)*pow(5,k) for k in xrange(30) \
- UpgradeC++/과제1 . . . . 1 match
string space(abs(size/2-i),' ');
- UseSTL . . . . 1 match
for (int i=0; i<10000; ++i)
- VonNeumannAirport/Leonardong . . . . 1 match
self.assertEquals( 1, self.distMatrix.getDistance(i, i) )
- WeightsAndMeasures/신재동 . . . . 1 match
>>> l=[A(i) for i in xrange(5,0,-1)]
- WeightsAndMeasures/황재선 . . . . 1 match
def putInStack(self, i):
- WikiSlide . . . . 1 match
* WordIndex: A list of all words in page titles (i.e. a list of keywords/concepts in the Wiki)
- WikiStyle . . . . 1 match
위키위키에 좋은문체에 대해 생각하고 제로위키(ZeroWiki)에 적용했으면 합니다.
- [Lovely]boy^_^/USACO/BrokenNecklace . . . . 1 match
for(i = 0 ; i < len ; ++i)
- [Lovely]boy^_^/USACO/GreedyGiftGivers . . . . 1 match
for(int i = 0 ; i < max_num ; ++i)
- html5/webSqlDatabase . . . . 1 match
rowOutput += renderTodo(rs.rows.item(i));
- matlab . . . . 1 match
arr(1,i) = a;
- ㄷㄷㄷ숙제1 . . . . 1 match
printf("%d×%d=%d\n",a,i,a*i);
- 가독성 . . . . 1 match
printf("%d", i);
- 권영기/채팅프로그램 . . . . 1 match
pthread_create(&pthread[i], NULL, rcv, (void *)i);
- 금고/김상섭 . . . . 1 match
height = pow(2,i) -1;
- 김동준/Project/Data_Structure_Overview/Chapter1 . . . . 1 match
Item retrive(A, i) => if(i include index)
- 김희성/리눅스계정멀티채팅2차 . . . . 1 match
if(thread_id[k]==i)
- 단어순서/방선희 . . . . 1 match
content += temp * pow(strlen(input), strlen(input)-1-i);
- 달리기/강소현 . . . . 1 match
System.out.println(i);
- 덜덜덜/숙제제출페이지2 . . . . 1 match
for(j = 0; j < 2*(pattern_num-i)-1; j++)
- 데블스캠프2003/ToyProblems . . . . 1 match
오목(gui)
- 데블스캠프2005/월요일 . . . . 1 match
Wiki:ObjectOrientedProgramming (OriginalWiki)
- 데블스캠프2006/월요일/연습문제/switch/임다찬 . . . . 1 match
cout << (char)(g+i)<< " : " <<grade[i]<<" 명"<<endl;
- 데블스캠프2009/금요일/연습문제/ACM2453/송지원 . . . . 1 match
printf("b = %d, i = %d\n", b, i);
- 데블스캠프2009/금요일/연습문제/ACM2453/정종록 . . . . 1 match
r+=a[19-i]*pow(2.0,i);
- 데블스캠프2010/다섯째날/ObjectCraft/미션3/김상호 . . . . 1 match
a[i].init_unit(i);
- 데블스캠프2011/다섯째날/HowToWriteCodeWell/권순의,김호동 . . . . 1 match
public void goTo(int i) {
- 데블스캠프2013/다섯째날/구구단 . . . . 1 match
def gugu(dan, i):
- 로마숫자바꾸기/조현태 . . . . 1 match
for (register int i=DATA_SIZE-1; i>=0; --i)
- 마름모출력/윤성복 . . . . 1 match
print ' ' * (n-i) + '*' * ((i*2)+1)
- 만년달력/방선희,장창재 . . . . 1 match
array[y][i] = def_max_month(y,i);
- 미로찾기/김태훈 . . . . 1 match
if(p.col==j &&p.row ==i)
- 반복문자열/김유정 . . . . 1 match
printf("%dCAUCSE LOVE.\n",i);
- 반복문자열/이재경 . . . . 1 match
printf ("%dCAUSE LOVE. \n,"i);
- 반복문자열/조현태 . . . . 1 match
for (register int i=0; i<5; ++i)
- 반복문자열/황세연 . . . . 1 match
{printf("%d CAUCSE LOVE.\n",i);
- 벡터/김수진 . . . . 1 match
cout<<(*i).score<<endl;
- 벡터/김태훈 . . . . 1 match
cout << (*i).name << endl;
- 벡터/조동영 . . . . 1 match
cout<<(*i).score<<endl;
- 비행기게임/BasisSource . . . . 1 match
shot = Shots((x,i), curGun, (i-y)/30)
- 삼각형매크로/임다찬 . . . . 1 match
printf("밑변 입력 : "); scanf("%d",&wi);
- 새싹C스터디2005/pointer . . . . 1 match
int array[5] = {1,2,3,4,5}에서 array[i]가 뜻하는 것은 *(array+i)이다.
- 새싹교실/2011/Pixar/실습 . . . . 1 match
positional = pow(10, i);
- 새싹교실/2011/씨언어발전/2회차 . . . . 1 match
printf("%d",i);
- 새싹교실/2012/AClass/4회차 . . . . 1 match
printf("777이I arr[%d]에 있습니다",i);
- 새싹교실/2012/startLine . . . . 1 match
char *printMonthName(int i);
- 새싹교실/2012/강력반 . . . . 1 match
printf("%d\n", i);
- 새싹교실/2012/사과나무 . . . . 1 match
/*switch(i){
- 새싹교실/2012/아우토반/뒷반/4.13 . . . . 1 match
printf("%c", i);
- 새싹교실/2012/우리반 . . . . 1 match
printf("%d\n",i);
- 새싹교실/2012/해보자/과제방 . . . . 1 match
for(j=0;j<(i<=4?i:8-i);j++)
- 새싹교실/2013/록구록구/3회차 . . . . 1 match
while(j<=i)
- 소수구하기 . . . . 1 match
limit = (int)sqrt((double)i);
- 소수구하기/상욱 . . . . 1 match
printf("%d\n", i);
- 소수구하기/재니 . . . . 1 match
for (int i = 3 ; i <= 50000 ; ++++i)
- 숫자를한글로바꾸기/김태훈zyint . . . . 1 match
for( i=0 ; i<(int)strlen(getdata) ; ++i){
- 숫자야구/민강근 . . . . 1 match
if(a == i)
- 쓰레드에관한잡담 . . . . 1 match
printf("%d: sum+=%d\n", num, i);
- 알고리즘2주숙제 . . . . 1 match
시그마(i=1~n)i*(Hi) = n*(n+1)/2*(Hn) -(n-1)*n/4의 식이 사실임을 증명하라
- 압축알고리즘/홍선,수민 . . . . 1 match
if(test(i))
- 윤성준 . . . . 1 match
printf("%d×%d=%d\n",a,i,a*i);
- 윤정훈 . . . . 1 match
printf("%dX%d=%d\n",input,i,input*i);
- 이영호/nProtect Reverse Engineering . . . . 1 match
게임 : 마비노기(Mabinogi)
- 이영호/숫자를한글로바꾸기 . . . . 1 match
for(i=0; num>0; ++i){
- 임인택/삽질 . . . . 1 match
for(int i=0; i<maskSize; ++i)
- 잔디밭/권순의 . . . . 1 match
*(lawn + i) = (int*)malloc(sizeof(int) * getCol);
- 정모 . . . . 1 match
-> Offline 에서 충분이 결정할 수 있는 일들을 Online(Wiki) 으로 미루어버린다.
- 정수민 . . . . 1 match
printf("Enter a number for score[%d] : ", i);
- 조동영 . . . . 1 match
for (j=2*(num-i)-3;j>0;j--){
- 조영준/파스칼삼각형/이전버전 . . . . 1 match
private int[] savePrv(int[] i)
- 주민등록번호확인하기/문보창 . . . . 1 match
sum += ((int)num.charAt(i) - 48) * validateNum[i];
- 중앙도서관 . . . . 1 match
하지만, 현재의 도서관 시스템은 사용하면 할 수록 불편한 시스템이다. "Ease of Learning"(MS 워드)과 "Ease of Use"(Emacs, Vi) 어느 것도 충족시키지 못한다.
지금 도서관의 온라인 시스템은 상당히 오래된 레거시 코드와 아키텍춰를 거의 그대로 사용하면서 프론트엔드만 웹(CGI)으로 옮긴 것으로 보인다. 만약 완전한 리스트럭춰링 작업을 한다면 얼마나 걸릴까? 나는 커스터머나 도메인 전문가(도서관 사서, 학생)를 포함한 6-8명의 정예 요원으로 약 5 개월의 기간이면 데이타 마이그레이션을 포함, 새로운 시스템으로 옮길 수 있다고 본다. 우리과에서 이 프로젝트를 하면 좋을텐데 하는 바램도 있다(하지만 학생의 사정상 힘들 것이다 -- 만약 풀타임으로 전념하지 못하면 기간은 훨씬 늘어날 것이다). 외국의 대학 -- 특히 실리콘벨리 부근 -- 에서는 SoftwareEngineeringClass에 근처 회사의 실제 커스터머를 데려와서 그 사람이 원하는 "진짜" 소프트웨어를 개발하는 실습을 시킨다. 실습 시간에 학부생과 대학원생이, 혹은 저학년과 고학년이 어울려서(대학원생이나 고학년이 어울리는 것이 아주 중요하다. see also NoSmok:SituatedLearning ) 일종의 프로토타입을 만드는 작업을 하면 좋을 것 같다. '''엄청나게''' 많은 것을 배우게 될 것이다. --JuNe
- 진법바꾸기/김영록 . . . . 1 match
temp = get_count(num1,num2,i);
- 테트리스만들기2006/예제1 . . . . 1 match
for(int i = 0; i < SCREEN_HEIGHT; ++i)
- 파스칼삼각형/강희경 . . . . 1 match
printArray(array, i); //행의 내용을 출력한다.
- 파스칼삼각형/김수경 . . . . 1 match
for j in range(0, n-i):
- 파스칼삼각형/조현태 . . . . 1 match
for (register int i=0; i<yol-1; ++i)
- 프로그래밍/DigitGenerator . . . . 1 match
String str = Integer.toString(i);
- 프로그래밍/Pinary . . . . 1 match
number = Integer.toBinaryString(i);
- 프로그래밍잔치/첫째날후기 . . . . 1 match
* 계층위키에 대해서는 좀 더 신중할 필요가 있다. (NoSmok:HierarchicalWiki)
- 피보나치/aekae . . . . 1 match
int fivo(int i)
- 피보나치/김재성,황재선 . . . . 1 match
int fivo(int i) {
- 피보나치/허아영 . . . . 1 match
scanf("%d", &i);
- 한유선 . . . . 1 match
printf("%d×%d=%d\n",a,i,a*i);
- 허아영/C코딩연습 . . . . 1 match
for(j = 0; j < 2*(pattern_num-i)-1; j++)
- 호너의법칙/김태훈zyint . . . . 1 match
for(i=0;i<asize;i++) fprintf(file," %d |",i);
Found 416 matching pages out of 7540 total pages (5000 pages are searched)
You can also click here to search title.
