- 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):
- 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)
- 새싹교실/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)
- 만년달력/인수 . . . . 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) {
- 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)
- 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)
- 새싹교실/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);
- 큰수찾아저장하기/김태훈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);
- 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)
- 숫자를한글로바꾸기/허아영 . . . . 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)
- 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)
- 문자반대출력/허아영 . . . . 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);
- 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의 몇몇의 선형결합과 같이 나타낼 수 있습니다.
- 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 에 놓을수 있을때..
- 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);
- 권영기/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')
- 알고리즘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++/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]; }
- 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)
- 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) {
- 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);
- 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;
- 김재현 . . . . 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/셋째날/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)
- 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)
- 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){
- 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)
- 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) {
- [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)
- 데블스캠프2011/다섯째날/HowToWriteCodeWell/강소현,구자경 . . . . 4 matches
goTo(i);//있는 장소로 이동
goTo(i);
public void in(int i) {
public void out(int 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)
- 수/구구단출력 . . . . 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
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);
- 3N+1Problem/Leonardong . . . . 3 matches
cycleLength = self.getCycleLength(i)
if self.getCycleLen(i) > maximum:
maximum = self.getCycleLen(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)
- CppStudy_2002_1/과제1/Yggdrasil . . . . 3 matches
setgolf(golfer1, name, handi);
handicap(golfer1, handi);
void max<char *>(char * arr[], int i);
- HanoiProblem/임인택 . . . . 3 matches
towers[0].putOnDisc(i);
discsAtPillar.add(i);
System.out.println(i);
- JSP/SearchAgency . . . . 3 matches
out.println("doc="+hits.id(i)+" score="+hits.score(i));
Document doc = hits.doc(i);
- Map/임영동 . . . . 3 matches
/*for(int i=0;i!=input.size();++i)
(*i)=(*it)[(*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)
- 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)
- StacksOfFlapjacks/조현태 . . . . 3 matches
for (register int i=number_cake-1; i>=0; --i)
if (maximum!=i)
printf("%d ",number_cake-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)
- 빵페이지/도형그리기 . . . . 3 matches
memset(odd, '*', i);
string odd = asterisks.substr(0,i);
} while(--i);
- 새싹교실/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;
- 소수구하기/임인택 . . . . 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++) }}}
- 코드레이스/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;
- 8queen/곽세환 . . . . 2 matches
find(0, i);
find(row + 1, i);
- ACM_ICPC/PrepareAsiaRegionalContest . . . . 2 matches
gamer.flipLine(i);
gamer.flipLine(i);
- ClassifyByAnagram/sun . . . . 2 matches
byte t = buf.get(i);
do i++; while (i <= u && buf.get(i) < buf.get(l));
- 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은 연속한 바이트로 매스킹한후 출력
- JollyJumpers/황재선 . . . . 2 matches
System.out.println(v.get(i));
System.out.println((String) list.get(i));
- One/박원석 . . . . 2 matches
printf("%3d",i);
printf("%3d",i);
- Ones/송지원 . . . . 2 matches
ones(&ns, i);
if( i <= LENBOUND ) printf("%d\n", i);
- TermProject/재니 . . . . 2 matches
grade(i); // 학점을 산출하는 함수 포출
void grade(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
for (register int i = 1; i < (int)nodes.size(); ++i)
for (register int i = 0; i < testNumber; ++i)
- 데블스캠프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;
- 문제풀이/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 << endl;
cout << (*i).score << endl;
- 벡터/임영동 . . . . 2 matches
cout<<(*i).name<<" "<<(*i).score<<endl;
- 비밀키/임영동 . . . . 2 matches
(*i)+=key;
(*i)-=key;
- 새싹교실/2012/아우토반/앞반/4.5 . . . . 2 matches
for(j=0;j<(10-i);j++)
for(j=0;j<(10-i);j++)
- 오목/재니형준원 . . . . 2 matches
pDC->MoveTo(20, i);
pDC->LineTo(560, i);
- 큰수찾아저장하기/김영록 . . . . 2 matches
space[i][3] = width_sort(i);
space[3][i] = height_sort(i);
- 2010php/방명록만들기 . . . . 1 match
if($page == $i){
- 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)
- Basic알고리즘/팰린드롬/조현태 . . . . 1 match
for (register unsigned int i = 0; i < strSize / 2; ++i)
- BusSimulation/영동 . . . . 1 match
bus[i].show(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/String . . . . 1 match
f(j) = largest i such that i < j and 문자열의 0 ~ i번째 = 문자열의 (j - i) ~ j번째, if such an i exists
- FastSearchMacro . . . . 1 match
{{{[[FastSearch(Moniwiki)]]}}}
- FileInputOutput . . . . 1 match
a,b=[int(i) for i in fin.read().split()]
- Hartals/상협재동 . . . . 1 match
process(i);
- JTDStudy/첫번째과제/정현 . . . . 1 match
numbers.add(String.valueOf(i));
- JollyJumpers/허아영 . . . . 1 match
if(compare[i] == i)
- Linux . . . . 1 match
Linus (torv...@kruuna.helsinki.fi)
- Linux/필수명령어/용법 . . . . 1 match
- Z : 좀비(zombi) 프로세서
- 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);
- One/구구단 . . . . 1 match
printf("단을 입력하세요."); scanf("%d",&i);
- OurMajorLangIsCAndCPlusPlus/math.h . . . . 1 match
|| 함수명(Ascii) || 내용 ||
- ReverseAndAdd/김회영 . . . . 1 match
returnValue+=arrayOfDigit[i]*pow(10,count-i);
- Slurpys/강인수 . . . . 1 match
if IsSlimp(Copy(S,1,i)) and IsSlump(Copy(S,i+1,MAX_STR_LEN)) then
- Steps/문보창 . . . . 1 match
else if (n <= i * i)
- TicTacToe/노수민 . . . . 1 match
g.drawLine(100, 100 + 100 * i, 400, 100 + 100 * i);
- UglyNumbers/구자겸 . . . . 1 match
if ( !unum(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)]
- [Lovely]boy^_^/USACO/BrokenNecklace . . . . 1 match
for(i = 0 ; i < len ; ++i)
- matlab . . . . 1 match
arr(1,i) = a;
- 데블스캠프2009/금요일/연습문제/ACM2453/송지원 . . . . 1 match
printf("b = %d, i = %d\n", b, i);
- 데블스캠프2010/다섯째날/ObjectCraft/미션3/김상호 . . . . 1 match
a[i].init_unit(i);
- 데블스캠프2011/다섯째날/HowToWriteCodeWell/권순의,김호동 . . . . 1 match
public void goTo(int i) {
- 만년달력/방선희,장창재 . . . . 1 match
array[y][i] = def_max_month(y,i);
- 반복문자열/황세연 . . . . 1 match
{printf("%d CAUCSE LOVE.\n",i);
- 벡터/김태훈 . . . . 1 match
cout << (*i).name << endl;
- 비행기게임/BasisSource . . . . 1 match
shot = Shots((x,i), curGun, (i-y)/30)
- 새싹교실/2011/씨언어발전/2회차 . . . . 1 match
printf("%d",i);
- 새싹교실/2012/startLine . . . . 1 match
char *printMonthName(int 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
printf("%d\n", i);
- 숫자를한글로바꾸기/김태훈zyint . . . . 1 match
for( i=0 ; i<(int)strlen(getdata) ; ++i){
- 숫자야구/민강근 . . . . 1 match
if(a == i)
- 윤성준 . . . . 1 match
printf("%d×%d=%d\n",a,i,a*i);
- 조동영 . . . . 1 match
for (j=2*(num-i)-3;j>0;j--){
- 주민등록번호확인하기/문보창 . . . . 1 match
sum += ((int)num.charAt(i) - 48) * validateNum[i];
- 진법바꾸기/김영록 . . . . 1 match
temp = get_count(num1,num2,i);
- 테트리스만들기2006/예제1 . . . . 1 match
for(int i = 0; i < SCREEN_HEIGHT; ++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);
- 프로그래밍잔치/첫째날후기 . . . . 1 match
* 계층위키에 대해서는 좀 더 신중할 필요가 있다. (NoSmok:HierarchicalWiki)
- 피보나치/허아영 . . . . 1 match
scanf("%d", &i);
- 호너의법칙/김태훈zyint . . . . 1 match
for(i=0;i<asize;i++) fprintf(file," %d |",i);
Found 152 matching pages out of 7557 total pages (2040 pages are searched)
You can also click here to search title.
