- Java/CapacityIsChangedByDataIO . . . . 56 matches
data length: 0 capacity: 16
data length: 17 capacity: 34 <-- 현재 길이의 두배로
data length: 35 capacity: 70
data length: 71 capacity: 142
data length: 143 capacity: 286
data length: 287 capacity: 574
data length: 575 capacity: 1,150
data length: 1,151 capacity: 2,302
data length: 2,303 capacity: 4,606
data length: 4,607 capacity: 9,214
data length: 9,215 capacity: 18,430
data length: 18,431 capacity: 36,862
data length: 36,863 capacity: 73,726
data length: 73,727 capacity: 147,454
data length: 147,455 capacity: 294,910
data length: 294,911 capacity: 589,822
data length: 589,823 capacity: 1,179,646
data length: 1,000,000 capacity: 1,179,646 <-- 마지막 출력은 임의이다.
data length: 1,000,000 capacity: 1,179,646
data length: 0 capacity: 1,179,646 <-- 건드리지 않음
- 데블스캠프2011/셋째날/String만들기/서지혜 . . . . 28 matches
int length;
int lengthForSubs;
String(const String str, const int offset, const int length);
length = 0;
length = i;
values = (char*)malloc(sizeof(char) * length);
for(i=0 ; i<length; i++)
String::String(const String str, const int offset, const int length)
this->length = length;
values = (char*)malloc(sizeof(char) * length);
for(i=0; i<length; i++)
if(length <= 0)
int i, newLength;
newLength = this->length+i;
char* newValues = (char*)malloc(sizeof(char) * newLength);
for(i=0; i<newLength; i++)
if(i < this->length)
else if(i >= this->length)
newValues[i] = str[i-this->length];
temp.length = newLength;
- JavaStudy2002/영동-3주차 . . . . 24 matches
if(x>=aboard.board.length)
x=aboard.board.length-1;
if(y>=aboard.board[0].length)
y=aboard.board[0].length-1;
for(int i=0;i<board.length;i++)
for(int j=0;j<board.length;j++){
if (x >= board.length)
if (y >= board[0].length)
x = board.length - 1;
y = board[0].length - 1;
for (int i = 0; i < board.length; i++) {
for (int j = 0; j < board[i].length; j++) {
x = (x >= board.length) ? 0 : x;
y = (y >= board[0].length) ? 0 : y;
x = (x < 0) ? board.length - 1 : x;
y = (y < 0) ? board[0].length - 1 : y;
for (int i = 0; i < board.length; i++) {
for (int j = 0; j < board[i].length; j++) {
nowX = (nowX >= board.length) ? 0 : nowX;
nowY = (nowY >= board[0].length) ? 0 : nowY;
- AdventuresInMoving:PartIV/김상섭 . . . . 22 matches
int length;
static int totalLength; /* 워털루에서 대도시까지의 거리 */
return station[i].length - station[i-1].length;
cin >> totalLength;
totalLength += 100;
station[numStation].length = 0;
cin >> station[numStation].length >> station[numStation].price;
station[numStation].length = totalLength;
while(station[now].length + go >= station[search].length)
if(station[search].length - station[now].length >= tank)
cost += (station[search].length - station[now].length - tank)*station[now].price;
tank = tank - station[search].length + station[now].length;
if(now + 1 == search && station[now].length + go < station[search].length)
if(station[maxmin].length - station[now].length >= tank)
tank = go - station[maxmin].length + station[now].length;
tank = tank - station[maxmin].length + station[now].length;
- LoadBalancingProblem/임인택 . . . . 22 matches
for(int i=0; i<sData.length; i++)
assertEquals(10, data__.length);
for(int i=0; i<_processor.length; i++)
for(int i=0; i<data.length; i++)
int average = sum/_processor.length;
int remain = sum%_processor.length;
else if( pos<_processor.length-1 && checkRight(pos) && _processor[pos]!=0) {
if( pos==_processor.length ) {
for(int i=0; i!=_processor.length; i++) {
for(int i=0; i!=_processor.length; i++) {
int average = getSumOfJob() / _processor.length;
int remian = getSumOfJob() % _processor.length;
int partialLength = (index==0)? 1:index;
else if( leftSum/index < rightSum/(_processor.length-index) ) {
/*else if(leftSum/index == rightSum/(_processor.length-index)
int average = getSumOfJob() / _processor.length;
int remian = getSumOfJob() % _processor.length;
int partialLength = (index==0)? 1:index;
if( index==_processor.length-1 ) {
if( rightSum< (_processor.length-index-1) )
- ReverseAndAdd/허아영 . . . . 17 matches
unsigned int numLength(unsigned int num)
bool isPalindrome(unsigned int *num, unsigned int length)
if(length == 1)
for(i = 0; i < length/2; i++)
if(num[i] == num[length-i-1])
unsigned int ReverseAndAdd(unsigned int *num, unsigned int length)
unsigned int *temp = new unsigned int [length];
for(i = 0; i < length; i++)
temp[i] = num[length-i-1];
reverseNum += temp[i] * pow(10, length-i-1); // 모아서 더하기
Num += num[i] * pow(10, length-i-1);
unsigned int addNum, length, i, turn = 0, testCaseNum;
store_numbers = new unsigned int[numLength(num)];
for(i = 0; i < numLength(num); i++) // 나누어 넣기
store_numbers[i] = num / pow(10, (numLength(num)-i-1));
length = numLength(num);
for(i = 0; i < length; i++) // 나누어 넣기
store_numbers[i] = num / pow(10, (length-i-1));
if(isPalindrome(store_numbers, length))
if(length == 1)
- WheresWaldorf/Celfin . . . . 17 matches
int length = strlen(temp);
for(n=0; n<length && y>=0; n++, y--)
if(n==length-1)
for(n=0; n<length && x<row && y>=0; n++, x++, y--)
if(n==length-1)
for(n=0; n<length && x<row; n++, x++)
if(n==length-1)
for(n=0; n<length && x<row && y<col; n++, x++, y++)
if(n==length-1)
for(n=0; n<length && y<col; n++, y++)
if(n==length-1)
for(n=0; n<length && x>=0 && y<col; n++, x--, y++)
if(n==length-1)
for(n=0; n<length && x>=0; n++, x--)
if(n==length-1)
for(n=0; n<length && x>=0 && y>=0; n++, x--, y--)
if(n==length-1)
- MedusaCppStudy/석우 . . . . 16 matches
int length;
cin >> length;
for (int rows = 0 ; rows < length ; rows++)
for (int cols = 0 ; cols < length ; cols++)
if (rows == 0 || rows == length - 1 || cols == 0 || cols == length - 1)
int stringlength();
stringlength();
int stringlength()
vector<int> length;
length.push_back(word.size());
sort(length.begin(), length.end());
cout << "가장 짧은 string: " << length[0] << endl;
cout << "가장 긴 string: " << length[length.size() - 1] << endl;
- Slurpys/곽세환 . . . . 16 matches
int length = str.length();
if (length < 3)
if (temp == length - 1 && str[temp] == 'G')
return isSlump(str.substr(temp, length - temp));
int length = str.length();
if (length < 2)
if (length == 2 && str[1] == 'H')
if (length != 2 && str[length - 1] == 'C')
return isSlimp(str.substr(2, length - 3));
return isSlump(str.substr(1, length - 2));
int length = str.length();
if (temp != -1 && isSlimp(str.substr(0, temp + 1)) && isSlump(str.substr(temp + 1, length - temp - 1)))
- MobileJavaStudy/SnakeBite/FinalSource . . . . 15 matches
public Snake(int length, int xRange, int yRange) {
for(int i = length ; i >= 1 ; i--)
public int length() {
return (SnakeCell)cellVector.elementAt((headIndex + index) % length());
int length = length();
for(int i = 1 ; i < length ; i++) {
headIndex = (headIndex + length() - 1) % length();
int length = snake.length();
for(int i = 0 ; i < length ; i++) {
int length = snake.length();
for(int i = 0; i < length ; i++) {
private int snakeLength;
snakeLength = 4;
for(int i = 0;i < snakeLength;i++) {
snakeLength++;
if(appleX == ((SnakeCell)snakes.elementAt(snakeLength - 1)).x && appleY == ((SnakeCell)snakes.elementAt(snakeLength - 1)).y) {
((SnakeCell)snakes.elementAt(0)).x = ((SnakeCell)snakes.elementAt(snakeLength - 1)).x;
((SnakeCell)snakes.elementAt(0)).y = ((SnakeCell)snakes.elementAt(snakeLength - 1)).y;
for(int i = 0;i < snakeLength;i++) {
- JollyJumpers/임인택 . . . . 14 matches
int size = array.length;
int arr[] = new int[args.length];
for(int i=0; i<arr.length; ++i) {
assertEquals(2, jj.flags.length);
flags = new boolean[arr.length-1];
if( arr.length != array.length )
for(int i=0; i<arr.length; ++i) {
if( arr.length != flags.length )
for(int i=0; i<arr.length; ++i) {
for(int i=0; i<array.length-1; ++i) {
if( tmp<array.length && !flags[tmp-1]) {
return (offCnt==array.length-1)?"Jolly":"NotJolly";
- BabyStepsSafely . . . . 13 matches
for(int i = 0; i <primes.length; ++i)
assertEquals(centArray.length, 25);
for(int it = 0; it < primes.length; ++it)
int [] primes = GeneratePrimes.generatePrimes(m_primes[m_primes.length - 1]);
assertEquals(m_primes.length, primes.length);
for(int i = 0; i < primes.length; ++i)
List primes = GeneratePrimes.primes(m_primes[m_primes.length -1]);
assertEquals(m_primes.length, primes.size());
assertEquals(1, primes.length);
assertEquals(0, primes,length);
if(primes.length == 0) return false;
for(int i = 0; i < primes.length; ++i)
- 서지혜/Calendar . . . . 13 matches
private int length;
public Month(int month, int length, int startDate) {
this.length = length;
for (int i = 1; i <= length; i++) {
attr_accessor :month, :start_date, :length
def initialize(month, length, start_date)
@length = length
(1..@length).to_a.each { |day|
months << Month.new(month, length_of_month(year, month), start_date(year, month))
def length_of_month(year, month)
total += length_of_month(year, x)
- AdventuresInMoving:PartIV/문보창 . . . . 12 matches
int length;
static int totalLength; /* 워털루에서 대도시까지의 거리 */
return station[i].length - station[i-1].length;
cin >> totalLength;
cin >> station[numStation].length >> station[numStation].price;
station[0].length = 0;
if (100 - station[1].length < 0 || j < 100 - station[1].length)
d[1][j] = (j - 100 + station[1].length) * station[1].price;
if (totalLength - station[numStation].length > 100 || station[1].length > 100)
cout << d[1][totalLength - station[numStation].length + 100] << endl;
if (d[numStation%2][j] < MAX_NUM && d[numStation%2][j] < min && j - (totalLength - station[numStation].length) >= 100)
- EditStepLadders/황재선 . . . . 12 matches
int length1 = word1.length();
int length2 = word2.length();
int lengthGap = Math.abs(length1 - length2);
if (lengthGap < 0 || lengthGap > 1) {
int minLength = Math.min(length1, length2);
for(int i = 0; i < minLength; i++) {
if (lengthGap == 0) {
- LCD Display/Celfin . . . . 12 matches
int length;
length = strlen(str);
for(i=0; i<length; i++)
if(i!=length-1)
for(i=0; i<length; i++)
if(i!=length-1)
for(i=0; i<length; i++)
if(i!=length-1)
for(i=0; i<length; i++)
if(i!=length-1)
for(i=0; i<length; i++)
if(i!=length-1)
- MobileJavaStudy/SnakeBite/Spec2Source . . . . 12 matches
public Snake(int length, int xRange, int yRange) {
for(int i = length ; i >= 1 ; i--)
public int length() {
return (SnakeCell)snakeCellVector.elementAt((snakeHeadIndex + index) % length());
int length = length();
for(int i = 1 ; i < length ; i++) {
snakeHeadIndex = (snakeHeadIndex + length() - 1) % length();
int length = snake.length();
for(int i = 0; i < length ; i++) {
private int pathLength;
private int snakeLength;
pathLength = 4;
snakeLength = 4;
for(int i = 0;i < snakeLength;i++) {
((SnakeCell)snakes.elementAt(0)).x -= pathLength;
((SnakeCell)snakes.elementAt(0)).x += pathLength;
((SnakeCell)snakes.elementAt(0)).y -= pathLength;
((SnakeCell)snakes.elementAt(0)).y += pathLength;
return ga == Canvas.UP && ((SnakeCell)snakes.elementAt(snakeLength - 1)).y > boardY;
return ga == Canvas.DOWN && ((SnakeCell)snakes.elementAt(snakeLength - 1)).y < boardHeight + boardY - snakeRect * 2;
- MobileJavaStudy/SnakeBite/Spec3Source . . . . 12 matches
public Snake(int length, int xRange, int yRange) {
for(int i = length ; i >= 1 ; i--)
public int length() {
return (SnakeCell)cellVector.elementAt((headIndex + index) % length());
int length = length();
for(int i = 1 ; i < length ; i++) {
headIndex = (headIndex + length() - 1) % length();
int length = snake.length();
for(int i = 0; i < length ; i++) {
private int pathLength;
private int snakeLength;
pathLength = 4;
snakeLength = 4;
for(int i = 0;i < snakeLength;i++) {
((SnakeCell)snakes.elementAt(0)).x -= pathLength;
((SnakeCell)snakes.elementAt(0)).x += pathLength;
((SnakeCell)snakes.elementAt(0)).y -= pathLength;
((SnakeCell)snakes.elementAt(0)).y += pathLength;
return ga == UP && currentDirection != DOWN && ((SnakeCell)snakes.elementAt(snakeLength - 1)).y > boardY;
return ga == DOWN && currentDirection != UP && ((SnakeCell)snakes.elementAt(snakeLength - 1)).y < boardHeight + boardY - snakeRect * 2;
- ScheduledWalk/권정욱 . . . . 12 matches
int length;
fin >> length;
for (i = 0; i < length; i++){
for (j = 0; j < length; j++){
if (x < 0) x += length;
if (x == length) x -= length;
if (y < 0) y += length;
if (y == length) y -= length;
for (i = 0; i < length; i++){
for (j = 0; j < length; j++){
- TheLagestSmallestBox/하기웅 . . . . 12 matches
double length, width;
if(length<width)
cout << (length+width - sqrt(length*length - length*width + width*width))/6.0 << " 0.000 " << length/2.0 << endl;
cout << (length+width - sqrt(length*length - length*width + width*width))/6.0 << " 0.000 " << width/2.0 << endl;
while(cin>>length>>width)
- MineSweeper/황재선 . . . . 11 matches
int len = array.length;
int len = mineArr[0].length;
for (int row = 0; row < mineArr.length; row++) {
for (int i = 0; i < posRow.length; i++) {
row+posRow[i] < mineArr.length && col+posCol[i] < mineArr[0].length)
for (int row = 0; row < arr.length; row++) {
for (int col = 0; col < arr[0].length; col++) {
assertEquals(2, array.length);
assertEquals(4, arr.length);
assertEquals(4, arr[0].length);
- Where's_Waldorf/곽병학_미완.. . . . . 11 matches
int length;
length = 1; //첫 단어
for(int i=0; i<str.length; i++) { //찾을 단어 개수만큼
length =1;
int cnt = str.length();
length=1;
cnt = str.length();
length++;
if(length == str.length()) return true;
for(int i=0; i<caseArr.length; i++) {
- CivaProject . . . . 10 matches
int length;
Array(int length) throw() : length(length) {
values = new ElementType[length];
length = sizeof(newValues) / sizeof(ElementType);
values = new ElementType[length];
for (index = 0; index < length; index++) {
size_t getLength() {
return length;
virtual int length() = NULL;
- Steps/김상섭 . . . . 10 matches
unsigned int i, length1, length2, testnum, temp = 1;
vector<unsigned int> totallength;
cin >> length1 >> length2;
totallength.push_back(length2-length1);
for(i = 0; i < totallength.size(); i++)
cout << found(totallength[i]) << endl;
- JollyJumpers/iruril . . . . 9 matches
int length;
length = stringArray.length;
int [] intArray = new int [length];
for(int i = 0; i < length; i++ )
differenceValue = length-1;
differenceArray = new boolean [length];
if( tempDiffer < length)
for(int i = 0; i < temp.length; i++)
- JollyJumpers/황재선 . . . . 9 matches
int len = ch.length;
int len = nums.length - 1;
for(int i = 0; i < aNum.length; i++)
for(int j = 0; j < aNum.length; j++)
int len = nums.length;
int len = ch.length - 1;
return size == numbers.length ? true : false;
for(int i = 0; i < numbers.length - 1; i++) {
assertEquals(5, j.numbers.length);
- PrimeNumberPractice . . . . 9 matches
void SetScope(int scope[], int length);
void CalculatePrimeNumber(int scope[], int length);
void SetScope(int scope[], int length) {
for (int i = 0; i < length; i++)
void CalculatePrimeNumber(int scope[], int length) {
for (int masterIter = 2; masterIter < length; masterIter++) {
for (int i = 2, secondIter = masterIter * i; secondIter < length; secondIter = masterIter * ++i) {
void PrintPrimeNumber(int scope[], int length) {
for (int i = 1; i < length; i++) {
- ProgrammingWithInterface . . . . 9 matches
for(int i=0; i<articles.length; ++i)
for(int i=0; i<articles.length; ++i)
깔끔한 코드가 나왔다. 하지만 MonitorableStack은 pushMany 함수를 상속한다. MonitorableStack을 사용해 pushMany 함수를 호출하면 MonitorableStack의 입력 받은 articles의 articles.length 만큼 push가 호출된다. 하지만 지금 호출된 push 메소드는 MonitorableStack의 것이라는 점! 매번 size() 함수를 호출해 최대 크기를 갱신한다. 속도가 느려질 수도 있다. 그리고 만약 누군가 Stack의 코드를 보고 pushMany 함수의 비 효율성 때문에 Stack을 밑의 코드와 같이 수정했다면 어떻게 될 것인가???
assert((topOfStack + articles.length) < theData.length);
System.arraycopy(articles, 0, theData, topOfStack + 1, articles.length);
topOfStack += articles.length;
for(int i=0; i<articles.length; ++i)
for(int i=0; i<articles.length; ++i)
- 토이/숫자뒤집기/김정현 . . . . 9 matches
char[] reversedChar= new char[input.length()];
for(int i=0;i<input.length();i++) {
reversedChar[input.length-i-1]= input.charAt(i);
int range= numChars.length;
CharBox[] charBoxes= new CharBox[numChars.length];
for(int i=0;i<numChars.length;i++) {
for(int i=0;i<numChars.length;i++) {
for(int i=intput.length();i>0;i--) {
for(int i= number.length()-1;i>=0;i--) {
- 3N+1Problem/황재선 . . . . 8 matches
self.cycleLength = 0
self.cycleLength = 0
self.cycleLength += 1
return self.cycleLength + self.cycleDic[str(num)]
self.cycleLength += 1
return self.cycleLength
maxLength = 0
length = self.compute(n)
self.cycleDic[str(n)] = length
if length > maxLength:
maxLength = length
return maxLength
cycleLength = 1
return cycleLength + cycleDic[num]
cycleLength += 1
return cycleLength
maxLength = 0
length = compute(n)
cycleDic[n] = length
if length > maxLength:
- LC-Display/곽세환 . . . . 8 matches
for (i = 0; i < n.length(); i++)
void showDisplay(int s, int length) // 크기와 자리수를 입력받음
for (k = 0; k < length; k++)
for (k = 0; k < length; k++)
for (k = 0; k < length; k++)
for (k = 0; k < length; k++)
for (k = 0; k < length; k++)
showDisplay(s, n.length());
- ClassifyByAnagram/sun . . . . 7 matches
qsort2( 0, seq.length-1 );
for( int i=0; i<str.length(); i++ ) {
qsort2( 0, seq.length-1 );
qsort2( 0, seq.length-1 );
if( args.length != 1 ) {
if( readLine.length() != 0 )
if( args.length != 1 ) {
- ErdosNumbers/황재선 . . . . 7 matches
for (int i = 0; i < peopleName.length; i++)
String[] people = new String[peopleName.length/2];
for (int i = 0; i < peopleName.length; i+=2) {
assertEquals(6, person.length);
for (int i = 0; i < person.length; i++)
for (int i = 0; i < person.length; i+=2) {
for(int i = 0; i < person.length; i++)
- Java/ModeSelectionPerformanceTest . . . . 7 matches
for (int i = 0; i < modeExecute.length; i++) {
for (int i = 0; i < modeExecute.length; i++) {
for (int i = 0; i < modeExecute.length; i++) {
for (int i = 0; i < methodNames.length; i++) {
for (int i = 0; i < modeExecute.length; i++) {
for (int i = 0; i < modeExecute.length; i++) {
for (int i=0;i<inners.length;i++) {
- JavaScript/2011년스터디/JSON-js분석 . . . . 7 matches
length = value.length;
for (i = 0; i < length; i += 1) {
v = partial.length === 0 ? '[]' : gap ?
// 1. partial.length === 0 ? '{}' : gap, gap ? '{\n' + gap + partial.join(',\n' + gap) + '\n' + mind + '}' : '{' + partial.join(',') + '}'
// 2. gap ? '{\n' + gap + partial.join(',\n' + gap) + '\n' + mind + '}' : '{' + partial.join(',') + '}', partial.length === 0 ? '{}' : gap
v = partial.length === 0 ? '{}' : gap ?
- JavaScript/2011년스터디/URLHunter . . . . 7 matches
MapLength = 50;
this.where = (this.where+1)%MapLength;
this.where = (this.where-1<0)? (MapLength-1): this.where-1;
this.a1 = new Monster(Math.floor(Math.random()*MapLength));
this.a2 = new Monster(Math.floor(Math.random()*MapLength));
this.a3 = new Monster(Math.floor(Math.random()*MapLength));
this.a4 = new Monster(Math.floor(Math.random()*MapLength));
this.a5 = new Monster(Math.floor(Math.random()*MapLength));
this.H = new Hunter(Math.floor(Math.random()*MapLength));
this.s = new Array(MapLength);
for(i = 0; i<MapLength;i++){
var length = 50;
for(var i = 0; i < length; i++){
monsters[i] = new Character((i*20)%length);
player = new Character(length/2);
for(var i = 0; i < length; i++){
this.index = (this.index == 0) ? length - 1 : this.index - 1;
this.index = (this.index + 1) % length;
- 김재현 . . . . 7 matches
int num1, num2, cycle_length;
int cycle_length=1;
cycle_length+=1;
return cycle_length;
cycle_length = ThreeNOne(num1);
if(most<cycle_length)
most=cycle_length;
- 데블스캠프2011/둘째날/Machine-Learning/NaiveBayesClassifier/김동준 . . . . 7 matches
if(inputStr.length() == 1 || inputStr.equals("http") || inputStr.equals("blog") || inputStr.equals("com") ||
for(int i = 0; i < sectionTrain.length; i++) {
for(int i = 0; i < sectionTrain.length; i++) {
for(int i = 0; i < sectionTrain.length; i++) {
for(int i = 0; i < sectionTrain.length; i++) {
this.sectionTrain = new Trainer[dataList.length];
for(int i = 0; i < sectionTrain.length; i++) {
- 3N+1Problem/구자겸 . . . . 6 matches
int cycle_length(int n); // cycle_length를 구하는 함수
for ( ;i_num<j_num;i_num++ ) // 두 정수 사이의 정수의 cycle_length값중에
max = max<cycle_length(i_num)?cycle_length(i_num):max;
int cycle_length(int n)
- BusSimulation/태훈zyint . . . . 6 matches
for(i=0,j=0;i<=bus->BusLanelength();++i) {
if(i<bus->BusLanelength()) cout << "-";
for(i=0;i<=bus->BusLanelength()+BusStationNo;++i ) cout<< "-";
int BusLanelength() { return busStation[BusStationNo-1]; } // 버스 노선의 총 길이를 알아 냄
while(buspos > BusLanelength() + BusStationNo+1) buspos -= BusLanelength() + BusStationNo +1;
- Code/RPGMaker . . . . 6 matches
if args.length > 0
if args.length > 1
if args.length > 2
if args.length > 0
if args.length > 1
if args.length > 2
- DataStructure/List . . . . 6 matches
if(coordi <0 || coordi >= m_Node.length) //좌표는 0부터 시작됨, 입력 위치가 해당 범위를 벋어날 경우
Node tempNode[] = new Node[m_Node.length+1]; //m_Node에 하나의 자료를 더 넣기 위해서 이보다
for(int i=0;i<tempNode.length-1 && i<coordi;i++) //tempNode에 m_Node를 우선 coordi번째(0부터 시작해서) 전의 자리
for(int j = coordi+1; j<tempNode.length-1;j++)
m_Node = new Node[tempNode.length]; // m_Node의 크기를 늘린후 tempNode를 넣는다.
for(int i=0;i<tempNode.length;i++) // m_Node 에 tempNode를 복사한다.
- JavaNetworkProgramming . . . . 6 matches
for(int i=0; i<msg.length(); ++i)
for(int i=0; i<args.length;i++){
if(args.length !=2) //넘어오는 args가 파일이 원본 복사본 두개여야한다.
public long getLength() throws IOException{
return file.length(); //파일 길이를 돌려줌
private int offset,length,port;
return new DatagramPacket(data,offset,length,address,port);
- Lotto/강소현 . . . . 6 matches
int num = (int) (Math.pow(2,S.length-6)-1);
while(num < Math.pow(2, S.length)){
for(int i=0; i<S.length; i++){
if(bin[S.length-i-1]==0){
while(num<bin.length-1){
for(int k=0; k<bin.length;k++){
- Monocycle/김상섭 . . . . 6 matches
int length;
int length(int M, int N)
while(now.row != terminal_row || now.col != terminal_col || now.length%5 != 0)
next.length++;
return now.length;
cout << length(M,N) << endl;;
- RandomWalk/영동 . . . . 6 matches
void showBoard(int a_board[][MAX_X], int length_x, int length_y);
void showBoard(int a_board[][MAX_X], int length_x, int length_y)
for(int i=0;i<length_y;i++)
for(int j=0;j<length_x;j++)
- 김희성/MTFREADER . . . . 6 matches
long MFTLength;
MFTLength=ReadCluster((unsigned char*)$MFT+point+i,(unsigned char*)MFT);
__int64 length=0;
length=0;
length<<=8;
length+=*((point+i)+(*(point+i)&0x0F)-k);
length * boot_block.SectorsPerCluster,
j+=length;
fwrite((void*)MFT,BytesPerFileRecord,MFTLength,fp);
for(i=0;i<MFTLength*boot_block.BytesPerSector*boot_block.SectorsPerCluster/BytesPerFileRecord;i++)
- 덜덜덜/숙제제출페이지2 . . . . 6 matches
int pattern, length, a, b, c;
scanf("%d", &length);
for(a=1; a<=length; a++)
for(b=length-a; b>=1; b--)
for(a=length; a>=1; a--)
for(b=length-1; b>=a-1; b--)
- 마름모출력/임다찬 . . . . 6 matches
int B_length;
printf("변의 길이 입력 : "); scanf("%d",&B_length);
for(i=0;i<B_length;i++){
for(k=1;k<B_length-i;k++) printf(" ");
for(i=0;i<B_length-1;i++){
for(j=1;j<=(2*B_length-3)-2*i;j++) printf("%c",pattern);
- 새싹교실/2012/startLine . . . . 6 matches
int maxLength; // 배열을 사용할 때는 길이를 관리하는 구조체를 만들어서 쓰면 편하다.
AccountArray *createAccountArray(int maxLength);
int length;
(*res).length = 0;
int lengthOf(LinkedList *linkedList){
int length = 0;
for( ; temp->nextNode != NULL ; length++ ){
return length;
- 진법바꾸기/문보창 . . . . 6 matches
void show_num(const int * parse_num, const int length);
int length = 0;
parse_num[length++] = temp % base;
show_num(parse_num, length);
void show_num(const int * parse_num, const int length)
for (int i = length-1; i >= 0; i--)
- 호너의법칙/김정현 . . . . 6 matches
for(int i=0;i<a.length-1;i++)
for(int i=0;i<a.length;i++) System.out.print("====");
for(int i=0;i<a.length;i++)
for(int i=0;i<a.length;i++) System.out.print("====");
for(int i=0;i<a.length;i++)
for(int i=0;i<a.length;i++) System.out.print("====");
- 3N+1Problem/곽세환 . . . . 5 matches
int i, j, great_length;
great_length = cycle(temp_i);
if ((temp = cycle(temp_i)) > great_length)
great_length = temp;
cout << i << " " << j << " " << great_length << endl;
- AKnight'sJourney/강소현 . . . . 5 matches
for(int k=0; k<savePath.length; k++){
if(p>=path.length || q>=path[0].length || p<1 || q<1 || path[p][q] == 1)
if(count == savePath.length-1){
for(int i=0; i<direct.length; i++){
- AcceleratedC++/Chapter10 . . . . 5 matches
const int month_length[] = {
상기의 예제에서 month_length의 배열의 크기를 명시적으로 나타내지 않았다는 사실에 유의. 대신에 컴파일러가 초기화된 갯수에 맞추어서 배열을 할당한다.
size_t length = strlen(p) + 1;
char* result = new char[length];
copy(p, p+length, result);
- C99표준에추가된C언어의엄청좋은기능 . . . . 5 matches
* 알아본 결과 C99에서 지원되는 것으로 표준이 맞으며, 단지 VS의 컴파일러가 C99를 완전히 만족시키지 않기 때문이라고함. gcc도 3.0 이후버전부터 지원된 기능으로 variable-length array 이라고 부르는군요. (gcc는 C99발표이전부터 extension 의 형태로 지원을 하기는 했다고 합니다.) - [eternalbleu]
The new variable-length array (VLA) feature is partially available. Simple VLAs will work. However, this is a pure coincidence; in fact, GNU C has its own variable-length array support. As a result, while simple code using variable-length arrays will work, a lot of code will run into the differences between the older GNU C support for VLAs and the C99 definition. Declare arrays whose length is a local variable, but don't try to go much further.
- CuttingSticks/김상섭 . . . . 5 matches
int length, tokennum, token, l, i, j, m;
cin >> length;
while(length)
temp.push_back(length);
cin >> length;
- Gnutella-MoreFree . . . . 5 matches
Payload Length (4 byte): Header 다음에 따라오는 Descriptor 의 길이
|| DescriptorID || Payload Descriptor || TTL || hops || PayloadLength ||
|| ping || 네트워크상의 호스트를 찾을 때 쓰인다. Payload가 없기 때문에 header의 Payload_Length = 0x00000000 로 설정된다. ||
Content-length:435678rn
바로 다음에 데이터가 Content-length만큼 따라오게 된다.
Download->m_FileLength = Item.Size;
m_StartPos = m_pShell->m_BytesCompleted + ((m_pShell->m_FileLength - m_pShell->m_BytesCompleted) / 2);
m_pChunk->FileLength = m_pShell->m_FileLength - m_StartPos;
OnReceive(int nErrorCode) 에서 Content-length 만큼의 버퍼 데이타를 받아 청크와 연결 시킨다.
int length = 25 + m_Search.GetLength() + 1;
pNode->SendPacket(m_Packet, length, PACKET_QUERY, true);
while(HitsLeft > 0 && NextPos < Length - 16)
memcpy(&Item.PushID, &Packet[Length - 16], 16);
if(i < Length - 16)
if(i > Length - 16)
if(i + 1>= Length - 16)
void CGnuNode::Recieve_Ping(packet_Ping* Ping, int nLength)
- JSP/SearchAgency . . . . 5 matches
out.println(hits.length() + " total matching documents");
for (int start = 0; start < hits.length(); start += HITS_PER_PAGE) {
int end = Math.min(hits.length(), start + HITS_PER_PAGE);
if (hits.length() > end) {
if (line.length() == 0 || line.charAt(0) == 'n')
- RandomWalk/임인택 . . . . 5 matches
randNum = rand.nextInt()%dir_x.length;
_adjacentCellIdx = new int[adjHostIdxes.length];
for(int i=0; i<_adjacentCellIdx.length; i++)
int nextIdx = new Random().nextInt() % _adjacentCellIdx.length;
for(int i=6; i<args.length; i++) {
- Scheduled Walk/소영&재화 . . . . 5 matches
int length_size = 5;
int road[width_size][length_size]={{0}};
i=length_size-1;
if (i>=length_size)
for(i=0; i<length_size; i++)
- 데블스캠프2006/화요일/pointer/문제4/성우용 . . . . 5 matches
int length = strlen(buf);
for (i=0;i<length;i++)
buf_[i] = buf[length-i-1];
buf_[length] = '\0';
for (i=0;i<length;i++)
- 데블스캠프2006/화요일/pointer/문제4/이장길 . . . . 5 matches
int length = strlen(buf);
for(i=0; i<length ; i++){
reverse[(length-1)-i] = buf[i];
reverse[length] = '\0';
for(i=0; i<length; i++){
- 데블스캠프2006/화요일/pointer/문제4/정승희 . . . . 5 matches
int length=strlen(buf);//길이가 저장됨.
char*b=new char[length+1];
for(int i=(length-1);i>=0;i--)
b[(length-1)-i]=buf[i];
b[length]='\0';//NULL문자는 문자 집어넣고 바로 다음에 넣는거다.
- 만년달력/김정현 . . . . 5 matches
int reducedDays= getTotalDaysUntil(year, month, day)%dayNames.length;
for(int i=0;i<names.length;i++) {
if((startIndex + i)%names.length==0) {
public String getNames(int length) {
sw.write(name.substring(0, length) + "\t");
- 만년달력/인수 . . . . 5 matches
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) {
- 중위수구하기/문보창 . . . . 5 matches
private int length;
length = 0;
length++;
sortElement(0, length);
int mid = (int)Math.floor(0.5 * length + 0.5);
- 3n 1/이도현 . . . . 4 matches
int cycle_length(int input);
temp = cycle_length(i); // cycle legnth 찾기
// cycle length 구하기
int cycle_length(int input)
- IsBiggerSmarter?/문보창 . . . . 4 matches
lcs_length함수에서 cost table을 만들어주는 과정의 running time은 O(n*n), memory cost는 O(n*n)이다. 그리고 print_lcs 함수에서 longest path를 거슬러 올라가는 running time은 O(n + n) = O(n)이다.
int lcs_length(unsigned char t[][MAX_ELEPHANT]);
int len = lcs_length(table);
int lcs_length(unsigned char t[][MAX_ELEPHANT])
- [Lovely]boy^_^/USACO/PrimePalinDromes . . . . 4 matches
if( (str.length() % 2 == 0) && str.length() < 2)
int n = str.length()/2;
if( str[i] != str[str.length() - i - 1] )
- django/Model . . . . 4 matches
name= models.CharField(maxlength=10)
name= models.CharField(maxlength=100)
name= models.CharField(maxlength=100)
location= models.CharField(maxlength=200)
- html5practice/즐겨찾기목록만들기 . . . . 4 matches
for (i=0; i<=localStorage.length-1; i++) {
if (localStorage.length == 0){
for (i=0; i<=localStorage.length-1; i++) {
if (localStorage.length == 0){
- 데블스캠프2006/화요일/pointer/문제4/이송희 . . . . 4 matches
int length = strlen(buf);
for(i=length-1; i>=length/2; i--)
if(buf[i]!=buf[length-1-i])
- 데블스캠프2010/일반리스트 . . . . 4 matches
while ( (i<first.length()) && (i<second.length()) )
if (first.length()<second.length()) return true;
- 미로찾기/상욱&인수 . . . . 4 matches
int x = boardMatrix[0].length;
int y = boardMatrix.length;
for(int i = 0 ; i < pt.length ; ++i)
for(int i = 0 ; i < expected.length ; i++)
- 3N+1Problem . . . . 3 matches
입력으로 22가 주어졌을때, 출력되는 값의 수 n(22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1) 는 22 16이다. 이를 n에 대한 cycle-length 라고 한다.
정수 i와 j 에 대해 두 수 사이에 존재하는 cycle-length 값들중의 최대값을 구할 것이다. 입력은 아래와 같이 한 줄에 한 쌍의 정수로 이루어져 있다. 출력값은 이 두 정수 사이의 cycle-length 중에서 최대값을 구하는 것이다.
* 기존의 코드를 수정해서 가장 큰 Cycle Length 가 아닌 3번째로 큰 Cycle Length 를 구해보세요.
- 3N+1Problem/강소현 . . . . 3 matches
int length(int n){
int maxLength(int num1, int num2){
if(max < length(i))
max = length(i);
cout<<num1<<" "<<num2<<maxLength(num1, num2);
- AnEasyProblem/강소현 . . . . 3 matches
while(num<bin.length-1){
for(int k=0; k<bin.length;k++){
* printJ 함수 내에서 while(num<bin.length-1)문의 1을 빼주지 않아 bin[num+1]가 index bound of exception이 났었습니다.
- AncientCipher/강소현 . . . . 3 matches
for(int i=0; i<c.length; i++){
for(int i=0; i<cSpread.length; i++)
for(int i=0; i<cSpread.length;i++)
- Android/WallpaperChanger . . . . 3 matches
for (int i = 0; i < mArray.length; i++) {
int len = localArray.length;
String.length() 호출 5
- ClassifyByAnagram/Passion . . . . 3 matches
return line.trim().length() > 0;
for(int i=0; i<buffer.length()-1 ; i++)
for(int j=i+1; j<buffer.length() ; j++)
- JSP/FileUpload . . . . 3 matches
int formDataLength = request.getContentLength();
byte dataBytes[] = new byte[formDataLength];
while (totalBytesRead < formDataLength) {
byteRead = in.read(dataBytes, totalBytesRead, formDataLength);
String boundary = contentType.substring(lastIndex + 1,contentType.length());
int startPos = ((file.substring(0, pos)).getBytes()).length;
int endPos = ((file.substring(0, boundaryLocation)).getBytes()).length;
- JTDStudy/첫번째과제/정현 . . . . 3 matches
assertEquals(3, number.length());
return number.length()==3 && !duplicated(number);
for(int i=0;i<numbers.length;i++) {
- Java Script/2011년스터디/박정근 . . . . 3 matches
document.write("arr[" + i + "] = " + arr[i] + " <br> length : " + arr[i].length,"<br>");
throw person.ID.length;
- JavaScript/2011년스터디/박정근 . . . . 3 matches
document.write("arr[" + i + "] = " + arr[i] + " <br> length : " + arr[i].length,"<br>");
throw person.ID.length;
- JollyJumpers/임인택3 . . . . 3 matches
case (length(Ori)-1 =:= length(Res) andalso lists:sum(Res) =:= trunc((hd(Res)+lists:last(Res))*length(Res)/2)) of
- MedusaCppStudy/세람 . . . . 3 matches
int width, length ;
cin >> width >> length ;
int rows = length ;
- Ones/송지원 . . . . 3 matches
|| Run ID || User || Problem || Result || Memory || Time || Language || Code Length ||
int length;
pns->length = len;
int i = ARRBOUND - (pns->length + 3) / 4;
- OurMajorLangIsCAndCPlusPlus/2006.2.06/김상섭 . . . . 3 matches
int newstring::length() const
cout << s.length() << endl;
cout << s.length() << endl;
- StringOfCPlusPlus/영동 . . . . 3 matches
void str_length(); //길이 측정
void Anystring::str_length()
string0.str_length();
- TheTrip/황재선 . . . . 3 matches
for(int i = 0; i < money.length; i++) {
for(int i = 0; i < money.length; i++)
average = convertToTwoDigits(sum / money.length);
- WERTYU/허아영 . . . . 3 matches
int length, i, j;
length = strlen(input);
for(i = 0; i < length; i++)
- WebGL . . . . 3 matches
gl.drawElements(gl.TRIANGLES, buffer.index.length, gl.UNSIGNED_SHORT, 0);
this.index.length = model.indices.length;
- [Lovely]boy^_^/USACO/WhatTimeIsIt? . . . . 3 matches
for(int i = 0 ; i < str.length() ; ++i)
ret += CharToInt(str[i]) * Jegob(10,(str.length() - i));
for(int i = 0 ; i < a.length() ; ++i)
- 그래픽스세미나/3주차 . . . . 3 matches
float Length();
float length = (float)Length();
temp.e[i]= e[i]/length;
e[i] = e[i]/length;
float CGX_Vector<T>::Length()
- 데블스캠프2006/화요일/pointer/문제4/주소영 . . . . 3 matches
int length = strlen(buf);
for(i=0; i<length ; i++){
if(buf[i] != buf[length-i-1]){
- 데블스캠프2011/둘째날/Machine-Learning/NaiveBayesClassifier/변형진 . . . . 3 matches
for (int i = 0; i < readers.length; i++) {
for (int i = 0; i < trainers.length; i++) {
for (int i = 0; i < trainers.length; i++) {
- 문자반대출력/김정현 . . . . 3 matches
char charArray[]=new char[text.length()];
for( int count=0; count<text.length(); count++)
charArray[count]=text.charAt(text.length()-count-1);
- 손동일 . . . . 3 matches
int length;
if(ver1[j].length == between[last] && ver1[j].goal == last)
ver1[soo].length = between[j] + Vertex[j][k];
- 알고리즘5주숙제/하기웅 . . . . 3 matches
double x, y, length;
length = sqrt(x*x+y*y);
if(length<=1)
- 영호의바이러스공부페이지 . . . . 3 matches
Eff Length: 163 Bytes
be infected. Files are infected only if their original length is
Infected .COM files will increase in length by 163 bytes, and have
filler db 8 dup (90h) ; Pad out the file length to 666 bytes
- 오목/인수 . . . . 3 matches
for(int i = 0 ; i < expectedSet.length ; ++i) {
for(int i = 0 ; i < turnSet.length ; ++i) {
for(int j = 0 ; j < turnSet[i].length ; ++j) {
- 05학번 . . . . 2 matches
void copy(char *src, char *dest, int length )
for(size_t i(0);i<length; i++ )
- 2010php/방명록만들기 . . . . 2 matches
이름 <input type='text' name='input_name' maxlength='10' size='10'>
비밀번호 <input type="password" name='input_pw'size='4' maxlength='4'>
- ACE/CallbackExample . . . . 2 matches
cerr << "\tlength: " << log_record.length() << endl;
- BeeMaja/문보창 . . . . 2 matches
int length = 1;
cruise_comb(length++, n, curCoord);
- Doublets/황재선 . . . . 2 matches
if (word1.length() != word2.length()) {
- EffectiveC++ . . . . 2 matches
if(password.length() < MINIMUM_PASS_LENGTH)
if(password.length() < MINIMUM_PASS_LENGTH)
- Fmt/문보창 . . . . 2 matches
for (int i = 0; i < str.length(); i++)
for (int i = 0; i < str.length(); i++)
- HowManyZerosAndDigits/임인택 . . . . 2 matches
for(int i=0; i<number.length(); ++i) {
for(int i=0; i<arr.length; ++i) {
- JavaScript/2011년스터디/3월이전 . . . . 2 matches
* var a = [1,,3]; a.length -> 3, var a = [,,]; a.length -> 2; 인 이유
- JavaStudy2002/입출력관련문제 . . . . 2 matches
for ( int i=0;i<input.length;i++)System.out.println(input[i]);
for ( int i=0;i<input.length;i++)System.out.println(input[i]);
- LUA_2 . . . . 2 matches
> string_length = "123456"
> print(#string_length)
- OurMajorLangIsCAndCPlusPlus/2006.2.06/하기웅 . . . . 2 matches
int length() const
cout << s.length();
- OurMajorLangIsCAndCPlusPlus/2006.2.06/허준수 . . . . 2 matches
int length() const {
cout << s << s.length() << endl;
- PowerOfCryptography/문보창 . . . . 2 matches
int find_length(char * p)
int len = find_length(p);
- PrimaryArithmetic/sun . . . . 2 matches
numPointer = numbers.length - 1;
for( int i=0; i<sets.length; i++ ) {
- Refactoring/ComposingMethods . . . . 2 matches
for (int i = 0; i < people.length; i++) {
for (int i = 0; i < people.length; i++)
- SuperMarket/인수 . . . . 2 matches
for(int i = 0 ; i < str.length() ; ++i)
ret += CharToInt(str[i]) * Power(10,(str.length() - i));
- WikiSandPage . . . . 2 matches
<input type="hidden" size="15" maxlength="20" name="password" value="">
<input type="hidden" size="15" maxlength="20" name="passwordagain" value="">
- ZPBoard/PHPStudy/MySQL . . . . 2 matches
이름 <INPUT type="text" name="name" value="" size=10 maxlength=10>
전화번호 <INPUT type="text" name="phone" value="" size=15 maxlength=15>
- ZeroPage_200_OK/소스 . . . . 2 matches
<form action="http://zeropage.org/act" method="post" onsubmit="if (this.password.value.length < 1) {alert('required pw'); return false;} else {return true;}">
<label for="form_id">ID </label><input id="form_id" size="5" maxlength="5" name="id" type="text" value="abc" /> <br/>
- html5practice/계층형자료구조그리기 . . . . 2 matches
var childLen = node.child.length;
var childLen = node.child.length;
- zennith/dummyfile . . . . 2 matches
fprintf(stderr, "Usage : %s [length of dummy file] [dummy file name]", argv[0]);
fprintf(stderr, "Usage : %s [length of dummy file] [dummy file name]", argv[0]);
- 데블스캠프2011/둘째날/Machine-Learning/NaiveBayesClassifier/강성현 . . . . 2 matches
for (int i = 0; i < wordset.length; i++) {
for (int i = 2; i < data.length; i++) {
- 데블스캠프2011/둘째날/Machine-Learning/NaiveBayesClassifier/송지원 . . . . 2 matches
if(str.length() > 1 && str.charAt(0) != '.' && str.charAt(0) != ','&& str.charAt(0) != '!'&& str.charAt(0) != '"' && str.charAt(0) != ':' && str.charAt(0) != '-' && str.charAt(0) != ';'){
public int getArticleLength(){ return articles.size(); }
if(str.length() > 1 && str.charAt(0) != '.' && str.charAt(0) != ','&& str.charAt(0) != '!'&& str.charAt(0) != '"' && str.charAt(0) != ':' && str.charAt(0) != '-' && str.charAt(0) != ';'){
- 데블스캠프2011/셋째날/String만들기 . . . . 2 matches
|| length || str.length() == 6 ||
- 레밍즈프로젝트/프로토타입/파일스트림 . . . . 2 matches
|| GetLength || Retrieves the length of the file. ||
|| SetLength || Changes the length of the file. ||
UINT FileLength = (UINT)Rfile.GetLength();
char* ps = new char[FileLength];
Rfile.Read(ps,FileLength);
- 압축알고리즘/희경&능규 . . . . 2 matches
int length = strlen(pass);
for(int i = (length-1); i < 0; i--)
- 토이/메일주소셀렉터/김정현 . . . . 2 matches
if(args.length==0)
if(splitedStrings.length == 2 && splitedStrings[1].equals("txt")) {
- 3 N+1 Problem/조동영 . . . . 1 match
cout << "MAX cycle-length값은 " << CheckCount(num1,num2) << "입니다." << endl;
- ASXMetafile . . . . 1 match
* <Duration value = "00:00:00">: Sets the value attribute for the length of time a streaming media file is to be played.
- ClassifyByAnagram/김재우 . . . . 1 match
for ( int i = 0; i < word.Length; i++ )
for( int i = 0; i < source.length(); i++ ) {
- CleanCode . . . . 1 match
/* You can handle empty array with "array.length === 0" statement in anywhere after array is set. */
- CodeRace/20060105/민경선호재선 . . . . 1 match
for(int j = 0; j < temp.length(); ++j) {
- Data전송 . . . . 1 match
for(int i=0; i < hobby.length; i++) {
- DelegationPattern . . . . 1 match
for (int i=0;i<anArray.length;i++) {
- EightQueenProblem/이선우 . . . . 1 match
if( args.length != 1 ) throw new Exception();
- EightQueenProblem/이선우2 . . . . 1 match
if( args.length != 1 ) throw new Exception();
- EightQueenProblem/이선우3 . . . . 1 match
if( args.length != 1 ) throw new Exception();
- EightQueenProblem/임인택/java . . . . 1 match
if(args.length!=1)
- JUnit/Ecliipse . . . . 1 match
if(index < array.length && index >= 0) {
- JavaScript/2011년스터디 . . . . 1 match
CREATE [UNIQUE] INDEX index_name ON tbl_name (col_name[(length]),... )
- JavaScript/2011년스터디/서지혜 . . . . 1 match
document.write(arguments.length);
- JavaScript/2011년스터디/윤종하 . . . . 1 match
for (var i = 0; i < items.length; i++ ) {
- JollyJumpers/신재동 . . . . 1 match
for(int i = 0; i < numbersStr.length; i++) {
- MoreEffectiveC++/Exception . . . . 1 match
| +-length_error
- MySQL/PasswordFunctionInJava . . . . 1 match
int size = aStr.length();
- NamedPipe . . . . 1 match
strlen(lpvMessage) + 1, // message length
- OurMajorLangIsCAndCPlusPlus/string.h . . . . 1 match
|| size_t strlen(const char *string) || Get the length of a string. ||
- PPProject/20041001FM . . . . 1 match
int n = str.length();
- PPProject/Colume2Exercises . . . . 1 match
int n = str.length();
- ProgrammingLanguageClass/Report2002_2 . . . . 1 match
1. To find out the maximum length of a variable name
- PythonForStatement . . . . 1 match
These represent finite ordered sets indexed by non-negative numbers. The built-in function len() returns the number of items of a sequence. When the length of a sequence is n, the index set contains the numbers 0, 1, ..., n-1. Item i of sequence a is selected by a[i].
- Refactoring/MakingMethodCallsSimpler . . . . 1 match
if (periodNumber >= _values.length) return 0;
- Ruby/2011년스터디 . . . . 1 match
* 이 때 음수 인덱스는 배열의 요소를 뒤에서부터 읽어온다.({{{a[-n] = a[a.length - n]}}})
- RubyLanguage/Container . . . . 1 match
* {{{a[-n] = a[a.length - n]}}}
- ScheduledWalk/임인택 . . . . 1 match
for(int i=0; i<schedule.length(); ++i) {
- TheJavaMan/숫자야구 . . . . 1 match
if ( aStr.length() != 3)
- ViImproved/설명서 . . . . 1 match
taglength(tl=) tab 화일의 내용중에 의미있는 문자수를 결정
- [Lovely]boy^_^/Arcanoid . . . . 1 match
* Now sources become very dirty, because I add a new game skill. I always try to eliminate a duplication, and my source has few duplication. but method's length is so long, and responsiblity of classes is not divided appropriately. All collision routine is focusing on CArcaBall class.
- [Lovely]boy^_^/USACO/BrokenNecklace . . . . 1 match
string back(str,pos-1,str.length());
- django/ModifyingObject . . . . 1 match
name= models.CharField(maxlength=100)
- html5/form . . . . 1 match
<form onforminput="ta2.value = ta1.value;textLength.value=ta1.value.length;">
글자 수:<output id="textLength"></output>
- html5/web-storage . . . . 1 match
readonly attribute unsigned long length;
- html5/webSqlDatabase . . . . 1 match
for (var i=0; i < rs.rows.length; i++) {
- java/reflection . . . . 1 match
for (int i = 0; i < declaredMethods.length; i++) {
- 경시대회준비반/BigInteger . . . . 1 match
// Determines the length upto valid data
- 데블스캠프2006/화요일/tar/김준석 . . . . 1 match
size = _filelength(_fileno(item));
- 데블스캠프2010/넷째날/DHTML . . . . 1 match
<input type="text" size="10" maxlength="10">
- 데블스캠프2011/셋째날/String만들기/김준석 . . . . 1 match
int length(){
- 데블스캠프2013/셋째날/머신러닝 . . . . 1 match
for (int j = 0; j < saveMatrix.length; j++) {
- 떡장수할머니/강소현 . . . . 1 match
for(int i=2; i<num.length; i++){
- 문자반대출력/문보창 . . . . 1 match
for (int i = 0; i < str.length(); i++)
- 안혁준/class.js . . . . 1 match
for(var i = 0; i < arguments.length; i++)
- 작은자바이야기 . . . . 1 match
* 리플렉션과 제네릭스를 써서 map -> object와 object -> map을 하는 부분을 해봤습니다. 자바의 일반적인 세 가지 방식의 클래스 내 변수에 대해 getClass, getFields, getMethods를 사용해 private, 나 접근자가 있는 경우의 값을 받아왔습니다. getter를 사용해서 변수 값을 받아올 때 이름이 get으로 시작하는 다른 함수를 제외하기 위해 method.getParameterTypes().length == 0 같은 부분은 이렇게 체크해야 된다는 부분은 나중에 제네릭스 관련으로 써먹을만 할 것 같습니다. 그리고 mapToObject에서는 문제가 없었지만 objectToMap의 경우에는 제네릭스의 type erase때문에 Class<T> expectedType = T.class; 같은 코드를 사용할 수 없어서 map.put(field.getName(), (T)field.get(obj));에서 형변환의 타입 안전성을 위해 인자로 Class<T> valueType을 받아오고 valueType.isAssignableFrom(field.getType())로 체크를 하는 부분도 공부가 많이 됐습니다. - [서영주]
- 토이/숫자뒤집기/김남훈 . . . . 1 match
for (int i = c.length - 1; i >= 0; i--)
- 프로그래밍/Pinary . . . . 1 match
int size = number.length();
- 프로그래밍/Score . . . . 1 match
int size = each.length();
Found 179 matching pages out of 7555 total pages (5000 pages are searched)
You can also click here to search title.
