- 새싹교실/2012/startLine . . . . 53 matches
그리고 addAccount()와 deleteAccount()는 이 이후 수업을 위한 하나의 포인트가 될 것입니다.
Account.h
typedef struct Account {
} Account;
typedef struct AccountArray {
struct Account **accounts;
int currentAccountNumber;
} AccountArray;
Account *createAccount(char *name); // Account에 깔끔하게 이름을 할당하기 위해서는 문자열 함수가 필요할 것이다.
AccountArray *createAccountArray(int maxLength);
void addAccount(AccountArray *accountArray, char *name);
bool isFull(AccountArray *accountArray); // 배열이 다 차면 어떻게 하면 좋을까??????
AccountArray *extendArray(AccountArray *before); // 다 찬 배열은 새로 확장을 해 주어야 합니다.
void deleteAccount(AccountArray *accountArray, char *name); // 배열의 중간 원소 삭제? 중간에 구멍만 뻥 뚫어두면 되나?
void deposit(AccountArray *accountArray, char *name, int money); // accountArray 내부에서 이름으로 비교할 필요가 있겠지.
void withdraw(AccountArray *accountArray, char *name, int money);
void addAccountMenu();
void deleteAccountMenu();
#include "Account.h"
addAccountMenu();
- TicTacToe/조재화,신소영 . . . . 38 matches
int counter=0;
if(counter%2 == 0)
else//(counter%2 == 1)
array[0][0] = counter%2;
counter ++;
if(counter%2 == 0)
else//(counter%2 == 1)
array[0][1] = counter%2;
counter ++;
if(counter%2 == 0)
else//(counter%2 == 1)
array[0][2] = counter%2;
counter ++;
if(counter%2 == 0)
else//(counter%2 == 1)
array[1][0] = counter%2;
counter ++;
if(counter%2 == 0)
else//(counter%2 == 1)
array[1][1] = counter%2;
- 비행기게임/BasisSource . . . . 38 matches
count = 0
imageCount = 0
self.count=self.count+1
self.count = self.count + 1
if self.count%self.imagefrequence == 0:
if self.imageCount <self.imageMax :
self.image = self.images[self.imageCount]
self.imageCount= self.imageCount + 1
self.count=0
self.imageCount = 0
count = 0
imageCount = 0
self.count = self.count + 1
if self.count%self.imagefrequence == 0:
if self.imageCount <self.imageMax :
self.image = self.images[self.imageCount]
self.imageCount= self.imageCount + 1
self.count=0
self.imageCount = 0
imageCount = 0
- BeeMaja/허준수 . . . . 37 matches
void firstStep(int count, int &start, int input)
for(; count>0; count--){
void secondStep(int count, int &start, int input)
for(; count>0; count--){
void thirdStep(int count, int &start, int input)
for(; count>0; count--){
void firthStep(int count, int &start, int input)
for(; count>0; count--){
void fifthStep(int count, int &start, int input)
for(; count>0; count--){
void sixthStep(int count, int &start, int input)
for(; count>0; count--){
int count = 0;
for(count; count<100000; count++)
if((3*(count*count + count) + 1) >= input)
x = count;
int start = (3*(count*count + count)+1) - 6*count + 1;
int index = (input-start)/count + 1;
firstStep(count,start,input);
secondStep(count,start,input);
- 그래픽스세미나/3주차 . . . . 34 matches
for(int count=0;count<DG;count++){
temp.e[count]=e[count] + in.e[count];
for(int count=0;count<DG;count++){
temp.e[count]=e[count] + in[count];
for(int count=0;count<DG;count++){
temp.e[count]=e[count] - in.e[count];
for(int count=0;count<DG;count++){
temp.e[count]=e[count] - in[count];
for(int count=0;count<DG;count++){
e[count] = in.e[count];
for(int count=0;count<DG;count++){
e[count] = in[count];
- RandomWalk/이진훈 . . . . 33 matches
int count = 1;
int count00 = 0;
int count01 = 0;
int count02 = 0;
int count10 = 0;
int count11 = 0;
int count12 = 0;
int count20 = 0;
int count21 = 0;
int count22 = 0;
int countz();
int z = countz();
count00++;
count01++;
count02++;
count10++;
count11++;
count12++;
count20++;
count21++;
- 강희경/메모장 . . . . 33 matches
int count = 0;
while(count < NUMBER_OF_SCORES){
printf("\nEnter a number for score[%d] : ", count);
scanf("%d", &(aArray[count].score));
aArray[count].rank = 1;
if(count == 0){
aArrayData->min = aArray[count].score;
aArrayData->max = aArray[count].score;
aArrayData->sum = aArray[count].score;
if(aArray[count].score < aArrayData->min){
aArrayData->min = aArray[count].score;
if(aArray[count].score > aArrayData->max){
aArrayData->max = aArray[count].score;
aArrayData->sum += aArray[count].score;
count++;
int count;
for(count = 0; count < NUMBER_OF_SCORES; count++){
printf("%d\t", aArray[count].score);
int count;
int cmpCount;
- MoreEffectiveC++/Techniques2of3 . . . . 32 matches
== Item 29: Reference counting ==
Reference counting(이하 참조 세기, 단어가 길어 영어 혼용 하지 않음)는 같은 값으로 표현되는 수많은 객체들을 하나의 값으로 공유해서 표현하는 기술이다. 참조 세기는 두가지의 일반적인 동기로 제안되었는데, '''첫번째'''로 heap 객체들을 수용하기 위한 기록의 단순화를 위해서 이다. 하나의 객체가 만들어 지는데, new가 호출되고 이것은 delete가 불리기 전까지 메모리를 차지한다. 참조 세기는 같은 자료들의 중복된 객체들을 하나로 공유하여, new와 delete를 호출하는 스트레스를 줄이고, 메모리에 객체가 등록되어 유지되는 비용도 줄일수 있다. '''두번째'''의 동기는 그냥 일반적인 생각에서 나왔다. 중복된 자료를 여러 객체가 공유하여, 비용 절약 뿐아니라, 생성, 파괴의 과정의 생략으로 프로그램 수행 속도까지 높이고자 하는 목적이다.
그리고 여기의 5에 해당 하는 숫자를 '''''Reference count''''' 라고 부른다. 혹자는 ''use count''라고 부르기도 하는데, 학술 용어의 당파에 따른거니 별 상관 안한다. 하지만 나(scott mayer) 그렇게 안부른다.
=== Implementing Reference Counting : 참조 세기 적용 ===
int refCount; // 참조를 세기위함 카운터
// StringValue의 복사 생성자, 초기화 목록으로 refCount 인자 1로 초기화
String::StringValue::StringValue(const char *initValue): refCount(1)
++value->refCount; // 참조 카운터를 올린다.
생성자의 손쉬운 구현같이 파괴자 구현도 그리 어려운 일이 아니다. StringValue의 파괴는, 서로가 최대한 사용하고, 값이 파괴 시점은 참조 카운터가(reference counter:이하 참조 카운터만) 1인 경우 더이상 사용하는 객체가 없으므로 파괴하도록 구성한다.
if (--value->refCount == 0) delete value; // 참조 카운터가 1인 상태
if (--value->refCount == 0) { // 현재 값이 자신 외에 아무도 참조하고
++value->refCount; // 참조 카운터를 올린다.
if (value->refCount > 1) { // if 안쪽은 새로운 객체를 생성해야 할 경우
--value->refCount; // 새로운 객체의 생성을 위해서 현재 참조하는
// 자료의 refCount를 감소 시킨다.
int refCount;
: refCount(1),
++value->refCount;
if (value->refCount > 1) {
--value->refCount;
- LIB_3 . . . . 31 matches
for (int count = 0;count<LIB_MAX_HEAP;count++) {
pSuspend_heap[count] = NULL;
pReady_heap[count] = NULL;
pFreeTCB[count] = &TCB[count];
TCB[count].priority = NULL;
TCB[count].StackSeg = NULL;
TCB[count].StackOff = NULL;
TCB[count].NextEvent = NULL;
LIB_INT_COUNT = 0;
int temp_count = ready_tcb_ptr;
if ( pReady_heap[temp_count]->priority > pReady_heap[tree_parent(temp_count)]->priority ){
Temp_TCB = pReady_heap[temp_count];
pReady_heap[temp_count] = pReady_heap[tree_parent(temp_count)];
pReady_heap[tree_parent(temp_count)] = Temp_TCB;
temp_count = tree_parent(temp_count);
int temp_count;
temp_count = i;
if ( pReady_heap[tree_left(temp_count)] != NULL) {
if ( pReady_heap[tree_left(temp_count)]->priority > pReady_heap[temp_count]->priority ){
Temp_TCB = pReady_heap[temp_count];
- SuperMarket/인수 . . . . 31 matches
int count = StringConvertToInt(cnt);
user.buyGoods(sm, sm.findGoods(good), count);
int count = StringConvertToInt(cnt);
user.cancleGoods(sm, sm.findGoods(good), count);
int _count;
Packages(const Goods& good, int count) : _good(good), _count(count) {}
int getCount() const
return _count;
void setCount(int n)
_count = n;
void sellGoods(const Goods& goods, int count)
_receivedMoney -= goods.getCost() * count;
cout << _buyedGoods[i].getGoods().getName() << " " << _buyedGoods[i].getCount() << endl;
void buyGoods(SuperMarket& sm, const Goods& goods, int count)
if(sm.getRestMoney() < goods.getCost() * count)
sm.sellGoods(goods, count);
Packages p(goods, count);
void cancleGoods(SuperMarket& sm, const Goods& goods, int count)
if(_buyedGoods[nth].getCount() < count)
else if(_buyedGoods[nth].getCount() == count)
- IsBiggerSmarter?/문보창 . . . . 29 matches
void count_elephant(Elephant * elephant, int num_elephant);
count_elephant(elephant, num_elephant);
int count = 0;
while (fin >> e[count].weight >> e[count].IQ)
e[count].index = count + 1;
count++;
return count;
void count_elephant(Elephant * e, int num)
int max_count = 0;
int count;
count = 1;
count++;
if (count > max_count)
max_count = count;
cout << max_count << endl;
for (i = 0; i < max_count; i++)
int count = 0;
count++;
cin >> elephant_weight[count].weight >> elephant_weight[count].IQ;
elephant_weight[count].index = count;
- Omok/은지 . . . . 26 matches
void checkcount(int check[], int , char);
int count;
count = 1;
row--; count++;
row = row + count-1;
row++; count++;
check[0] = count;
count = 1;
col--; count++;
col = col + count-1;
col++; count++;
check[1] = count;
count = 1;
row++; col--; count++;
col = col + count-1;
row = row - count+1;
row--; col++; count++;
check[2] = count;
count = 1;
row++; col++; count++;
- RandomWalk/영동 . . . . 26 matches
int count=1;//이동 횟수
count++;
count++;
count++;
count++;
count++;
count++;
count++;
count++;
cout<<count<<"회 이동\n";
void increaseEndCount(int & a_count, Bug & a_bug, int a_board[][MAX_X]);
bool isEnd(int a_count);
int count=0; // 종료 조건
increaseEndCount(count, bug, board);
}while(isEnd(count));
void increaseEndCount(int & a_count, Bug & a_bug, int a_board[][MAX_X])
a_count++;
bool isEnd(int a_count)
if(a_count<(MAX_X*MAX_Y-1))
int count;
- 데블스캠프2011/셋째날/String만들기/김준석 . . . . 26 matches
int count;
count = 0;
count = strlen(original);
count++;
value = new char[count];
String(const String& str, const int offset,const int count){
if(offset >= str.count){
this->count = count;
for(int i =0;i<count;i++){
if(at>count) return '\0';
for(int i =0; i < this->count; i++){
for(int j = 0; j < str.count-1;j++){
for(int i =0; i < this->count; i++){
for(int j = 0; j < str.count-1;j++){
if(count == 0) return true;
int tempCount = this->count + str.count -2 + 1;
char * temp = new char[tempCount];
this->count = tempCount;
return this->count;
String * subString(int offset, int count){
- 방울뱀스터디/Thread . . . . 26 matches
def counter(id):
thread.start_new_thread( counter, (i,) )
g_count = 0
def counter(id, count):
global g_count
for i in range(count):
g_count = g_count +1
thread.start_new_thread(counter,(i,5))
print 'Total Counter =', g_count
g_count = g_count+1 #필요한 코드 수행
g_count = 0
def counter(id, count):
global g_count
for i in range(count):
g_count = g_count +1
thread.start_new_thread(counter,(i,5))
print 'Total Counter =', g_count
def CountTime():
count=0
while count<80:
- 조영준/파스칼삼각형/이전버전 . . . . 26 matches
private int _count; //현재 반환중인 줄
public int count { get { return _count; } }
_count = 1;
if (_count > _row) return new int[0];
_count++;
return _triangle[_count-2];
public void resetCount()
_count = 1;
private int count; //좌우로 출력해야할 빈 공간의 수 (4칸이 한 단위)
count = lines - nums.Length;
if (count % 2 == 1)
count--;
for (int i = 0; i < count / 2; i++)
private int count; //현재 반환중인 줄
count = 1;
if (count == 1)
count++;
current = new int[count];
current[count-1] = 1; //줄의 맨 마지막
count++;
- StringOfCPlusPlus/영동 . . . . 25 matches
int count;
void str_count_same_char(); //같은 문자를 찾기
count=0;
while(str[count]!='')
count++;
cout<<"문자열의 길이는 "<<count<<"이다."<<endl;
count=0;
while(str[count]!='')
count++;
while(count!=0){
cout<<str[count-1];
count--;
void Anystring::str_count_same_char()
count=0;
count++;
cout<<input_char<<"는 문자열 안에 "<<count<<"개 있다."<<endl;
count=0;
while(str[count]!='')
count++;
for(int j=i;j<count;j++)
- 오목/재선,동일 . . . . 22 matches
int count,count1,count2;
count = 0;
count1 = 0;
count2 = 0;
count1++;
count1++;
count1++;
if(count1 ==5)
count2++;
if(count2==5)
count1 = 0;
count2 = 0;
count1++;
if(count1 ==5)
count2++;
if(count2==5)
count1 = 0;
count2 = 0;
if (count % 2 ==0 )
count++;
- 허아영/C코딩연습 . . . . 22 matches
Enter the game count : 5
int countbit(char ch);
printf("n 0의 갯수 : %dn", countbit(ch));
int countbit(char ch)
int count = 0;
count++;
return count;
int i = 0, count = 0;
count++;
printf("단어의 수 : %d n", count+1);
int i = 0, countBig = 0, countSmall = 0, countSpe = 0, countNum = 0;
countNum++;
countBig++;
countSmall++;
countSpe++;
printf("소문자 : %d, 대문자 : %d, 수치문자 : %d, 특수문자 : %d", countSmall, countBig, countNum, countSpe);
- MagicSquare/재동 . . . . 21 matches
self.count = 1
while self.count != self.boardLength*self.boardLength+1:
self.board[row][col] = self.count
self.count+=1
class CounterTestCase(unittest.TestCase):
self.counter = Counter()
self.counter.setBoard(expectBoard,boardLength)
def testCreateCounter(self):
self.assert_(self.counter)
self.assertEquals(expectBoard,self.counter.getBoard())
self.counter.writeFirstCell()
self.assertEquals(expectBoard,self.counter.getBoard())
self.counter.writeFirstCell()
self.counter.writeNextCell()
self.assertEquals(expectBoard,self.counter.getBoard())
class Counter:
self.count = 1
self.board[self.row][self.col] = self.count
self.count += 1
self.counter = Counter()
- 오목/곽세환,조재화 . . . . 20 matches
void VictoryMessage(int count, int z);
int count = 1;
count++;
count++;
VictoryMessage(count, z);
count =1;
count++;
count++;
VictoryMessage(count, z);
count =1;
count++;
count++;
VictoryMessage(count, z);
count =1;
count++;
count++;
VictoryMessage(count, z);
void COhbokView::VictoryMessage(int count, int z)
if(count==5)
Invalidate(count);
- 큐와 스택/문원명 . . . . 20 matches
int select, count;
for(count = 0 ; count < tail ; count++)
array[count] = array[count+1]; // string의 경우와 달리, Pointer 값만 복사됩니다.
for(count = 0 ; count < tail ; count++)
cout << array[count] << "] "; // 역시, 의미없는 영역을 가리키는 Pointer를 출력하려는 시도
int select, count;
for(count = 0 ; count < tail ; count++)
array[count] = array[count+1];
for(count = 0 ; count < tail ; count++)
cout << array[count] << "]\t";
- PokerHands/문보창 . . . . 19 matches
int count, i, j;
count = 0;
black.value[count++] = j;
count = 0;
white.value[count++] = j;
int count = 1;
count++;
count = 1;
if (count == 4)
if (count == 4)
int count = 1;
count++;
count = 1;
if (count == 3)
if (count == 3)
int stickCount = 0;
stick[stickCount++] = i;
int count = 0;
count++;
if (count == 4 || (count == 3 && po.value[4] == 12 && po.value[0] == 0))
- TicTacToe/임민수,하욱주 . . . . 19 matches
int count = 0;
if (count % 2 == 0)
count++;
if (count % 2 == 0)
count++;
if (count % 2 == 0)
count++;
if (count % 2 == 0)
count++;
if (count % 2 == 0)
count++;
if (count % 2 == 0)
count++;
if (count % 2 == 0)
count++;
if (count % 2 == 0)
count++;
if (count % 2 == 0)
count++;
- TicTacToe/조동영 . . . . 19 matches
int count;
if(count%2 == 0)
count++;
if(count%2 == 0)
count++;
if(count%2 == 0)
count++;
if(count%2 == 0)
count++;
if(count%2 == 0)
count++;
if(count%2 == 0)
count++;
if(count%2 == 0)
count++;
if(count%2 == 0)
count++;
if(count%2 == 0)
count++;
- 데블스캠프2013/셋째날/머신러닝 . . . . 19 matches
int count = 0;
sampleNews[count].words[i] = Convert.ToInt32(temp1[i]);
count++;
count = 0;
if (temp1[i] == "1") sampleNews[count].category = i;
count++;
count = 0;
testNews[count].words[i] = Convert.ToInt32(temp1[i]);
count++;
short counter = 0;
counter++;
saveMatrix[i] = counter;
int count[20] = {0,};
count[k]++;
if( count[i] != 0 ) {
avr[i] = total[i] / (double)count[i];
int count[20] = {0};
count[index]++;
trained_data.data()[i][j] /= count[i];
- 숫자야구/강희경 . . . . 19 matches
void ballcount();
void strcount();
int strike, ball, select, count;
void ballcount()
void strcount()
count = 1;
cout << endl << count << "번째 시도☞ "
count++;
strcount();
ballcount();
count = 0;
if(count != 0 && count <= 6)
cout << count-1 << "번만에 맞췄습니다." << endl;
else if(count > 5 && count <= 11)
cout << count-1 << "번만에 맞췄습니다." << endl;
else if(count > 11)
cout << count-1 << "번만에 맞췄습니다." << endl;
- EightQueenProblem/햇병아리 . . . . 18 matches
register int count;
for (count = 0, j = 0; j < 8; j++) {
if (count)
count = 1;
if (! count)
register int count;
for (count = 0, k = 0; k < 8-j; k++) {
if (count)
count = 1;
for (count = 0, k = 0; k < 8-i; k++) {
if (count)
count = 1;
for (count = 0, k = 0; k < j+1; k++) {
if (count)
count = 1;
for (count = 0, k = 0; k < 8-i; k++) {
if (count)
count = 1;
- TicTacToe/김홍선 . . . . 18 matches
int count =1 ;
if(count==1)
count=2;
else count=1;
if(count==2)
if(count==2)
if(count==2)
if(count==2)
if(count==2)
if(count==2)
if(count==2)
if(count==2)
if(count==2)
if(count==1)
if(count==1)
if(count==1)
if(count==1)
if(count==1)
- RandomWalk2/재동 . . . . 17 matches
def testCount(self):
self.assertEquals(11,self.moveRoach.getCount())
self.count = 0
self.count += 1
cellCount = 0
cellCount += 1
if cellCount != self.rowLength * self.colLength:
def getCount(self):
return self.count
def printCount(self):
print self.count,'\n\n'
moveRoach.printCount()
def testCount(self):
self.assertEquals((11,12),self.moveRoach.getCount())
self.count = [0,0]
if self.count[who] < len(self.path[who]):
self.count[who] += 1
cellCount = 0
cellCount += 1
if cellCount != self.rowLength * self.colLength:
- CheckTheCheck/문보창 . . . . 16 matches
int endCount = 0;
endCount++;
if (endCount == 8)
int count = 0;
count++;
if (col - count >= 0 && !temp[0])
if (chess[i][col-count] == enemy)
else if (chess[i][col-count] == '.')
if (col + count < 8 && !temp[1])
if (chess[i][col+count] == enemy)
else if (chess[i][col+count] == '.')
count = 0;
count++;
if (col - count >= 0 && !temp[0])
if (chess[i][col-count] == enemy)
else if (chess[i][col-count] == '.')
if (col + count < 8 && !temp[1])
if (chess[i][col+count] == enemy)
else if (chess[i][col+count] == '.')
- NumberBaseballGame/영록 . . . . 16 matches
int count1=0,count2=0,count3=0;
count1++;
count2++;
count2++;
count1++;
count2++;
count1++;
count3 = 3- count1- count2;
cout <<"스트라이크" <<" "<<count1<<" "<<"볼"<<" "<<count2<< " " <<"아웃"<<" "<<count3<<"\n";
if(count1 == 3)
- whiteblue/자료구조다항식구하기 . . . . 16 matches
int countNode(poly_pointer a);
int count_ = 0;
int countnodeA = 0;
int countnodeB = 0;
count_ = 0;
countnodeA = countNode(a);
count_ = 0;
countnodeB = countNode(b);
for (int i = 0 ; i < countnodeA ; i++)
for (int j = 0 ; j < countnodeB ; j++)
int countNode(poly_pointer a)
count_++;
countNode(a->link);
return count_;
- 새싹교실/2012/해보자 . . . . 16 matches
int count = 0;
count++;
if(sum==0&&count==0)
printf("%d",sum/count);
int count = 0;
count++;
if(sum==0&&count==0)
printf("%d",sum/count);
int num,tmp,count=0;
count++;
for(i=0;i<count-1;i++){
for(j=0;j<count-2;j++)
for(j=0;j<count-2-i;j++)
int count=2//여기서 count 변수까지 동원하는 데에는 이유가 있습니다. 나중에 배열 배울 때 다시 알려드립니다.
return (a+b)/count;
- 정모/2013.5.6/CodeRace . . . . 16 matches
public int count;
p[j].count++;
p[point].count++;
Console.Write(p[i].word+" "+p[i].count+"\n");
int count=0,i;
int store_count[1000]={0,};
for(i=0;i<count;i++)
if(i==count)
strcpy(store[count],buffer);
store_count[count]=1;
count++;
store_count[i]++;
for(i=0;i<count;i++)
printf("%s %d\n",store[i],store_count[i]);
int count;
- IndexedTree/권영기 . . . . 15 matches
int count;
void Init_IndexedTree(node *current, int limit, int *count, int *items){
if(*count >= N)return;
current->item = items[*count];
(*count)++;
Init_IndexedTree(current->left, limit, count, items);
Init_IndexedTree(current->right, limit, count, items);
void insert_item(node *current, int item, const int address, int st, int end, const int *count, const int *level){
insert_item(current->left, item, address, st, (st+end)/2, count, level);
insert_item(current->right, item, address, (st+end)/2 + 1, end, count, level);
it.count = 0;
const int maxcount = pow((double)2, level);
Init_IndexedTree(it.root, level, &it.count, items);
insert_item(it.root, 9, 2, 1, 100000, &maxcount, &level);
printf("%d", find(it.root, 2, 8, 1, maxcount));
- MineSweeper/이승한 . . . . 15 matches
mine_count = 0;
while(mine_count<quantityMine){
if( map[i][j]!= -1 && mine_count < quantityMine && !( random(100) % 5 ) ){
trace("지뢰 배치 " + i + " " + j + " 지금 까지 배치된 지뢰의 갯수 : " + ++mine_count);
minecount = 0;
if(map[i-1][j-1]=='*')minecount++;
if(map[i-1][j]=='*')minecount++;
if(map[i-1][j+1]=='*')minecount++;
if(map[i][j-1]=='*')minecount++;
if(map[i][j+1]=='*')minecount++;
if(map[i+1][j-1]=='*')minecount++;
if(map[i+1][j]=='*')minecount++;
if(map[i+1][j+1]=='*')minecount++;
map[i][j]=minecount;
minecount=0;
- 렌덤워크/조재화 . . . . 15 matches
int count[40][20]; //maximum size of the count array is 40*20
int counter = 0;
init(); //inital count array
output(); //print result about count_array and Total_count_Number
void init() //inital count array
count[i][j] = 0;
count[ibug][jbug]++; //inital the start point
count[ibug][jbug]++;//check the visiting room.
counter++;
if(counter >= 50000) //excute limitation
if(count[i][j] == 0)
cout<<"Total moving Number : "<<counter<<endl;
cout<<count[i][j]<<" ";
- 몸짱프로젝트/BinarySearchTree . . . . 15 matches
count = 0
count += 1
count += 1
return count
count = 0
count += 1
count += 1
return count
count = 0
count += 1
count += 1
return count
int count = 0;
count++;
if (count == 0)
- 빵페이지/숫자야구 . . . . 15 matches
int bcount=0;
int scount=0;
scount++;
bcount++;
if(scount==0 && bcount==0)
else if(scount==0 && bcount!=0)
cout << "출력 : "<< bcount << "볼\n";
else if(bcount==0 && scount!=0)
{ cout << "출력 : " << scount << "스트라이크\n";
if(scount==3)
cout << "출력 : "<< scount << "스트라이크 " << bcount << "볼\n";
- HighResolutionTimer . . . . 14 matches
A counter is a general term used in programming to refer to an incrementing variable. Some systems include a high-resolution performance counter that provides high-resolution elapsed times.
If a high-resolution performance counter exists on the system, the QueryPerformanceFrequency function can be used to express the frequency, in counts per second. The value of the count is processor dependent. On some processors, for example, the count might be the cycle rate of the processor clock.
The '''QueryPerformanceCounter''' function retrieves the current value of the high-resolution performance counter (if one exists on the system). By calling this function at the beginning and end of a section of code, an application essentially uses the counter as a high-resolution timer. For example, suppose that '''QueryPerformanceFrequency''' indicates that the frequency of the high-resolution performance counter is 50,000 counts per second. If the application calls '''QueryPerformanceCounter''' immediately before and immediately after the section of code to be timed, the counter values might be 1500 counts and 3500 counts, respectively. These values would indicate that .04 seconds (2000 counts) elapsed while the code executed.
- JollyJumpers/서지혜 . . . . 14 matches
* 왜 Accept가 안되나 했더니 검사하는 부분에서 count-1이어서......
int count;
scanf("%d", &count);
for(int i=0; i<count; i++){
if(count == 1)
for(int i=1; i<count; i++){
for(int i=1; i<count; i++){
if(i==count-1) goto JOLLY;
if(count==2&&isJ[1])
int count;
scanf("%d", &count);
for(int i=0; i<count; i++){
for(int i=1; i<count; i++){
for(int i=1; i<count; i++){
- RandomWalk/황재선 . . . . 14 matches
int row, col, ibug, jbug, count;
count = 0;
count++;
cout << "\n총 이동 횟수 : " << count << endl;
int count = 0;
count++;
if (count >= ITER_LIMIT)
return count;
void printRoomCount(int **aRoom, int n, int m) {
cout << "\n(2)The final count array:" << endl;
void printNumOfMove(int count) {
if (count == -1)
cout << "\n(1)The total number of legal moves: " << count << endl;
int count = moveRoach(room, n, m, ibug, jbug);
printNumOfMove(count);
printRoomCount(room, n, m);
- TicTacToe/유주영 . . . . 14 matches
int count=0; // 이쪽은 계속 갱신되는 것은 아닌듯.
if(count%2==0)
count++; // 순서가 매우중요하다.
if((count%2) == 0 && count!=0)
else if(count!=0)
if(ticbox[k][0] == 2 && ticbox[k][1]==2 && ticbox[k][2] == 2 && count!=0)
else if(ticbox[k][0] == 3 && ticbox[k][1]==3 && ticbox[k][2] == 3 && count!=0)
if(ticbox[0][l] == 2 && ticbox[1][l]==2 && ticbox[2][l] == 2 && count!=0)
else if(ticbox[0][l] == 3 && ticbox[1][l]==3 && ticbox[2][l] == 3 && count!=0)
if(ticbox[0][0] == 2 && ticbox[1][1]==2 && ticbox[2][2] == 2 && count!=0)
if(ticbox[0][0] == 3 && ticbox[1][1]==3 && ticbox[2][2] == 3 && count!=0)
if(ticbox[0][2] == 2 && ticbox[1][1]==2 && ticbox[2][0] == 2 && count!=0)
if(ticbox[0][2] == 3 && ticbox[1][1]==3 && ticbox[2][0] == 3 && count!=0)
- 새싹교실/2011/무전취식/레벨10 . . . . 14 matches
int count ,i;
count = strlen(pel) ;
for(i=0 ; i<= count*0.5 ; i++)
//if(pel[i]==pel[count-i-1])
if(pel[i]!=pel[count-i-1])
if(i<=count*0.5) ;
int count=0;
newnum[count]=num[i];
count++;
int line_count=0,i=0;
gets(line_str[line_count]);
if (strcmp(line_str[line_count],"!")==0) break;
line_count++;
for (i=0;i<line_count;i++) {
- 정수민 . . . . 14 matches
void randem_x(int count);
void randem_y(int count, int save);
int count, save;
count = 1;
scanf("%d", &count);
randem_x(count);
randem_y(count, save);
void randem_x(int count){
void randem_y(int count, int save){
while ( save <= count ){
int count, save, randem[6], i, j;
printf("n== LOTTO RANDOM NUMBER GENERATOR ==nnEnter the game count : ");
scanf("%d", &count);
for ( save = 1; save <= count; save++)
- ACM_ICPC/PrepareAsiaRegionalContest . . . . 13 matches
int count;
count = 0;
count++;
if ( count > max )
max = count;
void storeCounts(Gamer & gamer, int count);
void GameEngine::storeCounts(Gamer & gamer, int count )
count++;
minimum = ( minimum > count ) ? count : minimum;
else if ( count < MAX )
storeCounts( gamer, count );
count--;
engine.storeCounts(gamer, 0);
- OurMajorLangIsCAndCPlusPlus/string.h . . . . 13 matches
|| void * memcpy(void * dest, const void * scr, size_t count) || Copies characters between buffers. ||
|| void * memccpy(void * dest, const void * scr, int c, unsigned int count) || Copies characters from a buffer. ||
|| void * memmove(void * dest, const void * scr, size_t count) || Moves one buffer to another. ||
|| int memcmp(const void * buf1, const void * buf2, size_t count) || Compare characters in two buffers. ||
|| int memicmp(const void * buf1, const void * buf2, unsigned int count) || Compares characters in two buffers (case-insensitive). ||
|| void * memset(void * dest, int c, size_t count) || Sets buffers to a specified character. ||
|| void * memchr(const void * buf, int c, size_t count) || Finds characters in a buffer. ||
|| char * strncpy(char * strDestination, const char * strSource, size_t count) || Copy characters of one string to another ||
|| char * strncat(char * strDestination, const char * strSource, size_t count) || Append characters of a string. ||
|| int strncmp(const char *string1, const char *string2, size_t count) || Compare characters of two strings. ||
|| int strnicmp(const char *string1, const char *string2, size_t count) || Compare characters of two strings without regard to case. ||
|| char * strnset(char *stirng, int c, size_t count) || Initialize characters of a string to a given format. ||
|| size_t strxfrm (char *strDest, const char *strSource, size_t count) || Transform a string based on locale-specific information ||
- 3N 1/김상섭 . . . . 12 matches
int pre_count;
int i, j, k, count;
count = 1;
temp.pre_count = count++;
temp.pre_count = count++;
table[i] = count;
table[j] = count++;
count = table[i] - data[k].pre_count;
table[j] = count++;
- 3N+1/김상섭 . . . . 12 matches
int pre_count;
int i, j, k, count;
count = 1;
temp.pre_count = count++;
temp.pre_count = count++;
table[i] = count;
table[j] = count++;
count = table[i] - data[k].pre_count;
table[j] = count++;
- AseParserByJhs . . . . 12 matches
#define NUM_TEXTURE "*MATERIAL_COUNT"
// 각각의 본에 할당되는 PV의 개수 count
pNodeList [i]->GetPSQInfo()->nPVertexCount++;
pNodeList [i]->GetPSQInfo()->nPVertexCount++;
int count = 0;
int pv_count[50] = {0,};
if (count == 0)
pM = pNodeList [count];
count++;
static int nTmpCount = 0;
// fscanf (s, "%d", &(pM->pRotKey[nTmpCount].time)); fgetchar ();
fscanf (s, "%d", &(pM->pRotKey[nTmpCount].time)); fgetchar ();
if (pM->pRotKey[nTmpCount].time > *max_time) *max_time = pM->pRotKey[nTmpCount].time;
// AngleAxis2Quat (&pM->pRotKey[nTmpCount].q, v, -t);
AngleAxis2Quat (&pM->pRotKey[nTmpCount].q, v, t);
nTmpCount++;
if (nTmpCount == pM->rotkeyNum)
nTmpCount = 0;
static int nTmpCount2 = 0;
fscanf (s, "%d", &(pM->pPosKey[nTmpCount2].time)); fgetchar ();
- CryptKicker2/문보창 . . . . 12 matches
int count2, count3, count4;
count2 = count3 = count4 = 0;
count2++;
count3++;
count4++;
if (!(count2 == 4 && count3 == 1 && count4 == 1)) // 알파벳 빈도수 조사
- DataStructure/String . . . . 12 matches
int str_count=0; // 카운터
int ptn_count=0;
if(strstr[str_count]==ptnptn[ptn_count]) // 문자 비교해서 같을때
ptn_count++; // 패턴과 스트링을 가르키는 걸 한개 증가
str_count++;
if(ptn_count==0)
str_count++;
ptn_count=0; // 다를때는 패턴은 0으로
if(ptn_count==ptn_len) // 패턴이 문자열 내에 있을때 그 시작 위치 리턴
return str_count-ptn_len+1;
else if(str_count==str_len) // 패턴이 문자열 내에 없을때 거짓(다 돌았는데 카운트가
- Hessian/Counter . . . . 12 matches
화일로 저장을 안하기 때문에 resin 이 죽으면 데이터가 날라가지만 -_-; 암튼 간단하게 구현할 수 있는 counter.
=== Counter ===
public class RpcCounter extends HessianServlet implements Count {
int counter=0;
public int getCount() {
return counter;
public void count() {
counter++;
counter--;
counter =0;
>>> counter = Hessian("http://localhost:8080/servlet/RpcCounter")
>>> counter.getCount()
>>> counter.count()
>>> counter.getCount()
- HowManyZerosAndDigits/김회영 . . . . 12 matches
int zero_count;
int total_count;
cout<<temp.zero_count<<","<<temp.total_count;
int zero_count=0;
int total_count=1;
zero_count++;
total_count++;
(*temp).total_count=total_count;
(*temp).zero_count=zero_count;
- MedusaCppStudy/석우 . . . . 12 matches
for (int count = 2 ; count < board.size() * board.size() + 1 ; count++)
board[r][c] = count;
int count;
roach.count = 0;
roach.count++;
cout << "총 움직인 횟수는 " << roach.count << "입니다." << endl;
int count;
word.count = 1;
sentence[i].count++;
cout << sentence[j].name << "\t" << sentence[j].count << endl;
- 몸짱프로젝트/CrossReference . . . . 12 matches
node.increaseCount()
print 'Word\t\tCount\t\tLines'
self.count = 0
def increaseCount(self):
self.count += 1
print self.getWord() + '\t\t' + str(self.count) + '\t\t' + self.lines
self.assertEqual(c.getNode(t, 'and').count, 1)
int wordCount;
Node * setNode(Node * ptr, string aWord, int aLineCount);
void insertToNode(Node * ptr, string aWord, int aLineCount);
void duplicatedWord(Node * ptr, string aWord, int aLineCount);
int count = 0;
int lineCount = 1;
insertToNode(root, word, lineCount);
insertToNode(root, word, lineCount);
lineCount++;
cout << "WORD\t\tCOUNT\t\tLINES" << endl;
cout << "TOTAL\t\t" << count << endl;
void insertToNode(Node * ptr, string aWord, int aLineCount)
duplicatedWord(ptr, aWord, aLineCount);
- 새싹교실/2011/무전취식/레벨2 . . . . 12 matches
int count = 0;
while(count < 10){
count = count + 1;
int count = 0;
count = count + 1;
}while(count > 0);
int count = 0;
for(count = 0; count <10;count++){
- 새싹교실/2012/AClass/1회차 . . . . 12 matches
int counter=1;
while(counter <= 3){
counter= counter +1;
int counter =1;
counter = counter +1;
}while(counter<=3);
int counter =1;
for(counter<=3){
counter = counter +1;
- 숫자야구/손동일 . . . . 12 matches
int count =0;
int count2=0;
count++ ;
cout << count << " strike"<<"\t";
count2++;
count2++;
count2++;
count2++;
count2++;
count2++;
cout << count2 << " ball" << endl;
if (count == 3)
- Bicoloring/문보창 . . . . 11 matches
bool paintColor(int count, int vertex, int * color);
int count = 0; // count = vertex number
while (count != nVertex)
if (count == edge[i][0]) //
if (paintColor(count, edge[i][1], color) == false)
if (count == edge[i][1])
if (paintColor(count, edge[i][0], color) == false)
count++;
bool paintColor(int count, int vertex, int * color)
if (color[count] == BLACK)
- CodeRace/20060105/민경선호재선 . . . . 11 matches
int count = 0;
count = count + temp.toCharArray()[j];
System.out.printf("%-15s\t%d\t%d\n", temp, list.get(i).getCount(), count);
int count = map.get(key2);
list.add(new Data(key2, count));
private int count;
public Data(String name, int count) {
this.count = count;
public int getCount() {
return count;
- CppStudy_2002_1/과제1/상협 . . . . 11 matches
static int count=0;
cout<<in<<"\t"<<count<<"\n";
int tempcount=count;
while(tempcount>0)
cout<<in<<"\t"<<count<<"\n";
tempcount--;
count++;
int count=0;
int maxCount=0;
count=strlen(in[j]);
if(count>strlen(max))
- KnightTour/재니 . . . . 11 matches
for (int counter = 0 ; counter < 64 ; counter++){
printf(" %d", m_Footprint[counter]);
if (counter % 32 == 31)
for (int counter = 1 ; counter < 65 ; counter++) {
m_ChessBoard[m_CurrentRow][m_CurrentColumn] = counter;
direction = m_Footprint[--counter];
m_Footprint[counter] = direction;
- Minesweeper/이도현 . . . . 11 matches
char count = '0';
count++;
count++;
count++;
count++;
count++;
count++;
count++;
count++;
data[i][j] = count;
count = '0';
- RandomWalk2/상규 . . . . 11 matches
int count;
count=walk(m,n,starti,startj,journey,board);
cout << count << endl;
int count=0;
int journeycount=0;
if(quit==true || journey[journeycount]=='\0')
currenti+=move[journey[journeycount]-'0'][0];
currentj+=move[journey[journeycount]-'0'][1];
journeycount++;
count++;
return count;
- 가위바위보/영록 . . . . 11 matches
int count1=0,count2=0,count3=0;
count3++;
count1++;
count2++;
count1++;
count3++;
cout << count1 << " " << count2 << " " << count3 << endl;
- 김영록/연구중/지뢰찾기 . . . . 11 matches
int mine_count;
mine_count = 0;
mine_count++;
mine_count++;
mine_count++;
mine_count++;
mine_count++;
mine_count++;
mine_count++;
mine_count++;
space[X][Y] = mine_count;
- 미로찾기/황재선허아영 . . . . 11 matches
int count = 0;
int count2 = 0;
count = 0;
count2 = 0;
count++;
count2++;
if (count == 1 && count2 == 0)
else if (count == 1 && count2 >= 1)
else if (count >= 2) {
- 진법바꾸기/김영록 . . . . 11 matches
int get_jegob(int num,int count);
int get_count(int num1,int num2,int num3);
int count=1;
dividing = get_jegob(num2,count);
count++;
return count;
get_count 자리수의 값 얻기 함수
int get_count(int num1,int num2,int num3) //num1 = 숫자 ,num2 = 진법,num3 = 자리수
int get_jegob(int num,int count) //num =제곱할수 num2 =제곱할횟수
for (i=0;i<count;i++)
temp = get_count(num1,num2,i);
- 3n 1/이도현 . . . . 10 matches
int max_count = -1;
if (temp > max_count)
max_count = temp; // 큰 수를 max_count로
cout << max_count << endl;
int count = 0; // 카운트 변수
count++;
count++;
count += 2;
return count;
- AntOnAChessboard/하기웅 . . . . 10 matches
int step, i, j, temp, counting;
counting=1;
return counting;
counting++;
return counting;
counting++;
return counting;
counting--;
return counting;
counting--;
- Calendar환희코드 . . . . 10 matches
int endday, count일, count줄;
for(count일 = 1, count줄 = 몇요일 + 1;count일 <= endday; count일++, count줄++){
printf("%d\t", count일);
if(count줄 == 7){
count줄 = 0;
- ErdosNumbers/차영권 . . . . 10 matches
int count = 0, n = 0, m = 0, number = 0;
while (count < nDataBase)
saveBound[count] = number;
m++; count++; number=0;
int count2 = 0;
count=0; n=0;
count2++;
if (count2 == 0)
save[count++] = i;
count2 = 0;
- JollyJumpers/김회영 . . . . 10 matches
bool seqCheck(int* array,int count);
int count=0;
count++;
if(count!=1)
array[count-2]=abs(oldInput-input);
if(seqCheck(array,count))
bool seqCheck(int* array,int count)
for(int i=count-1;i>0;i--)
for(int j=0;j<count-1;j++)
if(checker==count-1)
- PrimaryArithmetic/Leonardong . . . . 10 matches
def countUpCarry( n, m ):
count = 0
count += carry( getValueOfDegree( n, degree ),
return count
def testCountUpCarryEqualDegreeOne(self):
self.assertEquals( 0, countUpCarry( 0,0 ) )
self.assertEquals( 1, countUpCarry( 9,1 ) )
def testCountUpCarryEqualDegreeTwo(self):
self.assertEquals( 0, countUpCarry( 10,10 ) )
self.assertEquals( 1, countUpCarry( 10,90 ) )
self.assertEquals( 4, countUpCarry( 1, 9999 ) )
self.assertEquals( 2, countUpCarry( 1, 9099 ) )
- PrimaryArithmetic/sun . . . . 10 matches
int counts = 0;
counts ++;
if( sum >= 10 ) counts ++;
return counts;
int counts = PrimaryArithmetic.add( num1, num2 );
print( counts );
private static void print( int counts ) {
String occurs = (counts == 0) ? "No" : String.valueOf(counts);
String postfix = (counts > 1) ? "s" : "";
- RandomWalk2/Insu . . . . 10 matches
int _nTotalVisitCount;
void IncreaseVisitCount();
void IncreaseTotalVisitCount();
_nTotalVisitCount = 0;
cout << _nTotalVisitCount << endl << endl;
void RandomWalkBoard::IncreaseVisitCount()
void RandomWalkBoard::IncreaseTotalVisitCount()
_nTotalVisitCount ++;
direction = _szCourse[ _nTotalVisitCount ] - 48;
IncreaseVisitCount();
IncreaseTotalVisitCount();
if( _nTotalVisitCount == strlen( _szCourse ) )
int _nTotalVisitCount;
void IncreaseVisitCount();
void IncreaseTotalVisitCount();
_nTotalVisitCount = 0;
cout << _nTotalVisitCount << endl << endl;
void RandomWalkBoard::IncreaseVisitCount()
void RandomWalkBoard::IncreaseTotalVisitCount()
_nTotalVisitCount ++;
- RandomWalk2/영동 . . . . 10 matches
int count=0;//총 움직인 수
count++;
count++;
count++;
count++;
count++;
count++;
count++;
count++;
cout<<"\n총 이동 횟수는 "<<count<<"회\n";
- SummationOfFourPrimes/김회영 . . . . 10 matches
void find_four_number(int* prime_array,int count,int number);
int count=0; //만들어진 소수의 총 수를 구한다.
find_four_number(prime_array,count,number);
prime_array[count]=i;
count++;
void find_four_number(int* prime_array,int count,int number)
for(int a=0;a<count;a++)
for(int b=0;b<count;b++)
for(int c=0;c<count;c++)
for(int d=0;d<count;d++)
- TugOfWar/문보창 . . . . 10 matches
int lcount, rcount;
lcount = rcount = 0;
left[lcount++] = weight[j];
right[rcount++] = weight[j-1];
right[rcount++] = weight[j];
left[lcount++] = weight[j-1];
for (j=0; j<lcount; j++)
for (k=0; k<rcount; k++)
- 미로찾기/최경현김상섭 . . . . 10 matches
int count = 0;
count++;
count++;
count++;
count++;
count++;
count++;
count++;
count++;
printf("%d",count);
- 빵페이지/소수출력 . . . . 10 matches
int count = 0;
count++;
if(count==(i-2))
int count=0;
count++;
if(count==1)
int count;
count++;
if (count == 0)
count = 0;
- 새싹교실/2011/무전취식/레벨9 . . . . 10 matches
int i,count = 0 ;
savePoint[count] = float_val;
count++;
ave = sum/count;
for(i = 0;i<count;i++){
val = val / count;
int sum_count[13] = {0}; // all initialized to 0
sum_count[one+two]++;
printf("%d : %d(%f)\n",i,sum_count[i], (float)sum_count[i]/36000 );
- 수학의정석/집합의연산/이영호 . . . . 10 matches
int count;
for(j = 0, count = 0; buf[j] != '\0';){
temp[count++] = 99;
temp[count++] = buf[j+t];
temp[count++] = 99;
temp[count++] = buf[j+t];
temp[count++] = next;
temp[count++] = 99;
temp[count++] = next;
temp[count] = '\0';
- 오목/재니형준원 . . . . 10 matches
int count;
count = 0;
if (count == 4)
count = 0;
if (count == 4)
count = 0;
if (count == 4)
count = 0;
if (count == 4)
count++;
- 이영호/숫자를한글로바꾸기 . . . . 10 matches
int count=0; // 자릿수.
++count;
for(--count; count>=0 ; --count){ // stack이니 끝에서부터 다시 꺼내줌.
// if(strcmp(data[count], "일") != 0) // 일의 자리를 제외한 각자리의 일을 빼준다.
strcat(ret, data[count]);
// if(i == 0 && strcmp(data[count], "일") == 0) strcat(ret, data[count]); // 일의 자리는 따로.
switch(count){ // 단위 붙임.
- 주민등록번호확인하기/김영록 . . . . 10 matches
int count = 0;
for (count = 0 ; count <12 ;count++)
reg_num[count] -=48 ;
if (count <8)
sum = sum + reg_num[count]*(count+2);
sum = sum + reg_num[count]*(count-6);
- AKnight'sJourney/강소현 . . . . 9 matches
int count = sc.nextInt();
for(int i=1; i<=count; i++){
private static boolean isPromising(int p, int q, int [][] path, int count){
if(count == savePath.length-1){
savePath[count][0] = p;
savePath[count][1] = q;
if(isPromising(p+direct[i][0], q+direct[i][1], path, count+1)){
savePath[count][0] = p;
savePath[count][1] = q;
- AcceleratedC++/Chapter3 . . . . 9 matches
int count = 0;
// we hava read count grades so far, and
// sum is the sum of the first count grades
++count;
<< 0.2 * midterm + 0.4 * final + 0.4 * sum / count
++count;
// count에 1을 더한다.
int count = 0;
++count;
- CleanCode . . . . 9 matches
* Account를 만들면 되지 AccountInfo라는 클래스를 만들 필요는 없다. Account 클래스 내부에 들어가는 정보가 Info니까.
* 아래와 같은 식으로 Account내부의 정보를 하나로 묶으면 AccountInfo 클래스와 getAccountInfo()등이 있을법하지 않은가? -> 저런 구조 자체가 잘못됐을 수 있다. getAccountInfo()와 같은 방법이 아니라 다른 방법으로 일을 시키는 모양이 더 낫다.
Class Account {
private AccountInfo info;
- EightQueenProblem/용쟁호투SQL . . . . 9 matches
CREATE PROCEDURE p_create_queen @queen_count int, @create_limit int
WHILE @queen_count <= 8
SET @queen_count = 1
SET @queen_count = @queen_count + 1
UPDATE temp_queen_attack SET fx = @l_x, fy = @l_y WHERE y = @queen_count - 1
DECLARE @queen_count int, @create_limit int, @rtn_create int
SET @queen_count = 1
EXEC @rtn_create = p_create_queen @queen_count,@create_limit
- HowManyZerosAndDigits/임인택 . . . . 9 matches
int count = 0;
++count;
return count;
int count = 0;
count += howManyZeros(l.longValue());
return count;
int count = 1, value = _fact;
++count;
return count;
- MedusaCppStudy/재동 . . . . 9 matches
int count;
roach.count = 0;
cout << "count of roach: " << roach.count << endl;
roach.count++;
int count;
cout << words[i].name << "\t" << words[i].count << endl;
words[i].count++;
newWord.count = 1;
- MoreEffectiveC++/Efficiency . . . . 9 matches
=== Reference Counting (참조 세기) ===
reference-counting 을 토대로한 문자열의 구현 예제를 조금만 생각해 보면 곧 lazy evaluation의 방법중 우리를 돕는 두번째의 것을 만나게 된다. 다음 코드를 생각해 보자
String s = "Homer's Iliad"; // 다음 문자열이 reference-counting으로
첫번째 operator[]는 문자열을 읽는 부분이다,하지만 두번째 operator[]는 쓰기를 수행하는 기능을 호출하는 부분이다. 여기에서 '''읽기와 쓰기를 구분'''할수 있어야 한다.(distinguish the read all from the write) 왜냐하면 읽기는 refernce-counting 구현 문자열로서 자원(실행시간 역시) 지불 비용이 낮고, 아마 저렇게 스트링의 쓰기는 새로운 복사본을 만들기 위해서 쓰기에 앞서 문자열 값을 조각내어야 하는 작업이 필요할 것이다.
size_t countChar(const string& str, char ch);
cout << "There are " << countChar(buffer, c)
countChar을 호출하는 곳을 보라. 처음에 구문에서 char 배열이 함수로 전달된다. 하지만 함수의 인자는 const string& 이다. 이런 호출은 오직 형(type)이 알맞지 않은것이 제거되거나 당신의 컴파일러는 훌륭히도 string 형의 임시 객체(temporary object)를 만들어서 그러한 맞지 않는 형문제를 제가하면 성공할수 있다. 그러한 임시 객체는 string 생성자가 buffer인자를 바탕으로 초기화 된다. 그러면 constChar의 str인자는 임시(temporary) string 객체를 받아들인다.(bind-bound) countChar이 반환될때 임시(temporary)객체는 자동 소멸된다.
글자 세기(charter-counting)예제에서 char 배열은 성공적으로 countChar로 전달된다. 그렇지만 이것과 같은 함수에서는 에러가 발생한다. 다음과 같은 코드 말이다.
- OurMajorLangIsCAndCPlusPlus/print/하기웅 . . . . 9 matches
int count = va_arg(l, int);
for(int i=0; i<count; i++)
if(i!=(count-1))
int count = va_arg(l, int);
for(int i=0; i<count; i++)
if(i!=(count-1))
int count = va_arg(l, int);
for(int i=0; i<count; i++)
if(i!=(count-1))
- radiohead4us/SQLPractice . . . . 9 matches
8. Find the average account balance at each branch. (4.4 Aggregate Functions)
10. Find the average balance for all accounts. (4.4 Aggregate Functions)
11. Find the average balance for each customer who lives in Harrison and has at least three accounts. (4.4 Aggregate Functions)
12. Find all customers who have both a loan and an account at the bank. (4.6.1 Set Membership)
13. Find all customers who have both an account and a loan at the Perryridge branch. (4.6.1 Set Membership)
16. Find all customers who have both an account and a loan at the bank. (4.6.3 Test for Empty Relations)
17. Find all customers who have an account at all the branches located in Brooklyn. (4.6.3 Test for Empty Relations)
18. Find all customers who have at most one account at the Perryridge branch. (4.6.4 Test for the Absence of Duplicate Tuples)
19. Find all customers who have at least two accounts at the Perryridge branch. (4.6.4 Test for the Absence of Duplicate Tuples)
- 데블스캠프2009/목요일/연습문제/MFC/김태욱 . . . . 9 matches
int count = 0;
for(int i = 0;i < count;i++){
count++;
count = 0;
count = 0;
count = 0;
count = 0;
count = 0;
count = 0;
- 마방진/조재화 . . . . 9 matches
int count = 2;
arr[x+1][y-1]=count;
x=x+1, y=y-1, count++;
arr[xx+1][yy-1] = count;
x=xx+1, y=yy-1, count++;
arr[x][y+1] = count;
y=y+1, count++;
arr[x][y+1]=count;
count++;
- 새싹교실/2012/AClass/4회차 . . . . 9 matches
int count=1;
a[i][j]=count;
count++;
a[i][j]=count;
count++;
int count=0;
count++;
printf("%d개 존재\n",count);
if(count == 0){
- 새싹교실/2012/세싹 . . . . 9 matches
U16 UsaCount;
U16 LinkCount;
void ReadSector(U64 sector, U32 count, void* buffer);
void ReadSector(U64 sector, U32 count, void* buffer)
ReadFile(hVolume, buffer, count * boot_block.BytesPerSector, &n, &overlap);
void ReadSector(U64 sector, U32 count, void* buffer);
void ReadSector(U64 sector, U32 count, void* buffer)
ReadFile(hVolume, buffer, count * boot_block.BytesPerSector, &n, &overlap);
void ReadSector(U64 sector, U32 count, void* buffer);
void ReadSector(U64 sector, U32 count, void* buffer)
ReadFile(hVolume, buffer, count * boot_block.BytesPerSector, &n, &overlap);
- 호너의법칙/김태훈zyint . . . . 9 matches
int i,x,f,addcount,mulcount;
f=addcount=mulcount=0;
addcount--; // 처음 대입하는 것은 덧셈이 아니므로 보정값 -1
addcount++;
mulcount++;
fprintf(file,"# Horner ADD Count ----> %d\n",addcount);
fprintf(file,"# Horner Multiply Count ----> %d\n",mulcount);
- BasicJAVA2005/실습2/허아영 . . . . 8 matches
그냥 count, 루프에서 숫자만 넣어봤따.ㅋㅋ
for(int count = 0; count < 25; count++) {
buttons[count] = new JButton(Integer.toString(count));
buttons[count].addActionListener(this);
container.add(buttons[count]);
- Counting/황재선 . . . . 8 matches
public class Counting {
public BigInteger count(int n) {
BigInteger numOfEachCounting = zero;
numOfEachCounting = numOfEachCounting.add(first.add(second));
sum[input] = numOfEachCounting;
public void printCount(BigInteger number) {
Counting c = new Counting();
BigInteger number = c.count(n);
c.printCount(number);
public class TestCounting extends TestCase {
Counting c = new Counting();
assertEquals(new BigInteger("2"), c.count(1));
Counting c = new Counting();
assertEquals(new BigInteger("5"), c.count(2));
Counting c = new Counting();
assertEquals(new BigInteger("13"), c.count(3));
Counting c = new Counting();
assertEquals(new BigInteger("33"), c.count(4));
Counting c = new Counting();
assertEquals(new BigInteger("84"), c.count(5));
- EightQueenProblem2/이강성 . . . . 8 matches
def decidePositions(self, count=8):
if count == 0:
x = self.sizeX - count
res = self.decidePositions(count-1)
if count == 1:
def mark(self, board, startX, startY, count):
board[startX][startY] += count
board[x][y] += count
- Interpreter/Celfin . . . . 8 matches
int i, counting;
counting =0;
while(ram[counting]!=100)
a = ram[counting]/100;;
b = (ram[counting]/10)%10;
c = ram[counting]%10;
counting++;
counting = regist[b];
- Omok/상규 . . . . 8 matches
int count;
count=1;
count++;
if(count==n) return 1;
int count;
count=1;
count++;
if(count==3)
- SeminarHowToProgramIt/Pipe/vendingmachine.py . . . . 8 matches
self.account=0
self.account += aMoney
return self.account
if self.account >= price:
self.account -=price
return self.account == aMoney
returnMoney = self.account
self.account =0
- 구구단/강희경 . . . . 8 matches
int count = 0;
count++;
if(count==4)
count = 0;
count=0;
count++;
if(count==4)
count = 0;
- 데블스캠프2011/둘째날/후기 . . . . 8 matches
double count_economy=0, count_politics=0, count_total=0;
count_economy++;
count_politics++;
count_total=count_economy+count_politics;
- 2002년도ACM문제샘플풀이/문제C . . . . 7 matches
int count;
count = inputData[i].f - inputData[i].s - 1;
count -= 1;
if( ((count / inputData[i].k) % 2 == 1 && (count % inputData[i].k) == 0)
|| ((count / inputData[i].k) % 2 == 0 && (count % inputData[i].k) != 0))
- CppStudy_2002_1/과제1/Yggdrasil . . . . 7 matches
int count=0;//함수가 호출된 횟수를 셈
say(p,count);
count++;
int count=0;
count=0;
count++;
if(count==4){
- MagicSquare/동기 . . . . 7 matches
int count= 1;
number[y][x]=count;
for(count=2;count<=final;count++)
number[y][x]=count;
number[newy][newx]=count;
- MedusaCppStudy/희경 . . . . 7 matches
int count = 0;
lenth[word] = count;
count = 0;
count++;
int count2 = 1;
count2++;
return count2;
- MoreEffectiveC++/Techniques1of3 . . . . 7 matches
이런 디자인은 단일 Printer객체에 관해서 행하여 질수는 없다. 하지만 서로 다른 프로그램의 서로 다른 부분에서 Printer객체는 이렇게 사용되어 질수 있다. 이것 역시 허용하지 못하게하는 것까지는 필요 없을것 같은데, 아무튼 오직 하나의 프린터 객체만 유지 시킨다는 것에는 벗어나지는 않는 거다. 하지만 여기에 우리가 해왔던 object-counting방법과, 일찍이 쓴 가짜 생성자(pseudo-constructor)를 혼합해서 기능을 구현해 본다.
=== An Object-Counting Base Class : Object-counting에 기본 클래스를 만들어 본다. ===
이제까지 거쳐왔던 코드들은 어느 정도의 형태가 잡혀 있다. 이것을 라이브러리로 만들어 놓고, 일정한 규칙으로 만들수는 없을까? (참고로 이와 비슷한 기술이 Item 29 reference-counting에 등장한다. 참고 해보자.) template가 이를 가능하게 해준다.
template<class BeingCounted>
class Counted {
static int objectCount() { return numObjects; }
Counted();
Counted(const Counted& rhs);
~Counted() { --numObjects; }
template<class BeingCounted>
Counted<BeingCounted>::Counted()
template<class BeingCounted>
Counted<BeingCounted>::Counted(const Counted<BeingCounted>&)
template<class BeingCounted>
void Counted<BeingCounted>::init()
해당 클래스는 오직 기본 클래스로만 쓰이도록 설계되어 졌다. 그러므로, 생성자와 파괴자가 모두 protected(보호)인자로 설정되어 있다. 그리고 init로서 object-counting을 구현한다. init는 설정된 객체의 숫자가 넘어가면, TooManyObjects 예외 객체를 발생 시킨다.
이제 위의 template를 바탕으로 글 초반에 누누히 설명한 object-counting에 기반한 Printer클래스를 만들어 본다.
class Printer: private Counted<Printer> {
using Counted<Printer>::objectCount; // 왜 사용하는지 아래 참고
using Counted<Printer>::TooManyObjects; // 마찬가지~
- PrimaryArithmetic/문보창 . . . . 7 matches
int i, j, temp, count, carry, sumCarry;
count = 0;
num1[count++] = str[i] - 48;
for (j=count; j<10; j++)
count = 0;
num2[count++] = str[i] - 48;
for (j=count; j<10; j++)
- ProjectPrometheus/AT_BookSearch . . . . 7 matches
self.assert_(data.count("<TR>") > 70)
self.assert_(data.count("<TR>") > 10)
self.assert_(data.count("<TR>") > 10)
self.assert_(data.count("<TR>") > 10)
self.assert_(data.count("김불꾼") > 0)
self.assert_(data.count("<TR>") > 10)
self.assert_(data.count("<TR>") > 10)
- ReverseAndAdd/김회영 . . . . 7 matches
int testCount=0;
cin>>testCount;
long* number=new long[testCount];
int* calCount=new int[testCount];
for(i=0;i<testCount;i++)
for(i=0;i<testCount;i++)
calCount[i]=0;
calCount[i]++;
for(i=0;i<testCount;i++)
cout<<calCount[i]<<" "<<number[i]<<endl;
int count=-1;
arrayOfDigit[++count]=num%10;
for(int i=count ; i>=0 ; i--)
returnValue+=arrayOfDigit[i]*pow(10,count-i);
int count=-1;
arrayOfDigit[++count]=num%10;
int j=count;
- ReverseAndAdd/문보창 . . . . 7 matches
int makePalim(unsigned int * pal, unsigned int originN, int count);
int makePalim(unsigned int * pal, unsigned int originN, int count)
pal[count] = originN;
def ReverseAndAdd(n, count):
print count, n
count += 1
ReverseAndAdd(str(int(n) + int(n[::-1])), count)
- ReverseAndAdd/황재선 . . . . 7 matches
MAX_COUNT = 1000
count = 0
count+= 1
if self.overBoundary(count, n):
if self.overBoundary(count, n):
return count, n
def overBoundary(self, count, n):
if count >= MAX_COUNT or n > MAX_VALUE:
- ShellSort/문보창 . . . . 7 matches
int count = nTurt-1;
if (code[count] != count)
isMove[count] = true;
count--;
if (code[i] != count)
count--;
- Steps/김상섭 . . . . 7 matches
unsigned int count;
for(count = 1; max[count-1] < temp; count++)
max[count] = max[count-1] + (count+1)/2;
- VendingMachine/재니 . . . . 7 matches
* 그러면 주문을 할 때 돈이 필요하니까 돈을 세는 계수기 비슷한 것(CoinCounter)도 필요할 것 같다..^^
class CoinCounter{
CoinCounter coin_counter;
coin_counter.resetCoins();
coin_counter.showRemainders();
coin_counter.insertCoins();
usedmoney = drink.buy(coin_counter.remainders);
coin_counter.pay(usedmoney);
coin_counter.resetCoins();
''클래스 수가 많아서 복잡해진건 아닌듯(모 VendingMachine 의 경우 Requirement 변경에 따라 클래스갯수가 10개 이상이 되기도 함; 클래스 수가 중요하다기보다도 최종 완료된 소스가 얼마나 명료해졌느냐가 복잡도를 결정하리라 생각). 단, 역할 분담할때 각 클래스별 역할이 명료한지 신경을 쓰는것이 좋겠다. CoinCounter 의 경우 VendingMachine 안에 멤버로 있어도 좋을듯. CRC 세션을 할때 클래스들이 각각 따로 존재하는 것 같지만, 실제론 그 클래스들이 서로를 포함하고 있기도 하거든. 또는 해당 기능을 구현하기 위해 다른 클래스들과 협동하기도 하고 (Collaboration. 실제 구현시엔 다른 클래스의 메소드들을 호출해서 구현한다던지 식임). 역할분담을 하고 난 다음 모의 시나리오를 만든뒤 코딩해나갔다면 어떠했을까 하는 생각도 해본다. 이 경우에는 UnitTest 를 작성하는게 좋겠지. UnitTest 작성 & 진행에 대해선 ["ScheduledWalk/석천"] 의 중반부분이랑 UnitTest 참조.--["1002"]''
- randomwalk/홍선 . . . . 7 matches
int count,t,R_count=0; // 바퀴벌레의 이동횟수, 랜덤 숫자, 바퀴벌레가 모든 타일을 돌아다니도록 하는 카운터
count++; // 바퀴벌레가 총 움직인 횟수를 구하기 위한 카운터
R_count++; // 바퀴벌레가 모든 타일을 방문하면 멈추게 하기 위한 카운터
cout << "바퀴벌레의 총 이동횟수는 " << count << " 입니다.\n";
while(R_count!=size_x*size_y || count < 50000) // 바퀴벌레가 모든 타일을 거치면 멈추거나 횟수가 50000을 넘으면 멈추게 한다
- 개인키,공개키/김태훈,황재선 . . . . 7 matches
int count = 0;
array[count] = char(temp+KEY);
count++;
for(int j=0;j<count;j++) // 암호값 출력
for(int i=0;i<count;i++)
int count = 0;
count++;
- 신기호/중대생rpg(ver1.0) . . . . 7 matches
int count=0;
int count=0;
printf("%d, %s\n",count+1,T[i].name);
T_ptr[count++]=i;
int count=0;
printf("%d, %s\n",count+1,TOWN[i].getName());
T_ptr[count++]=i;
- 압축알고리즘/동경,세환 . . . . 7 matches
int count=0;
b=Str[count];
b= Str[count];
count++;
cout << Str[count];
count =count+1;
- 3N+1Problem/신재동 . . . . 6 matches
int getCount(int aNumber)
int count = 0;
count++;
return count;
int getMaxCount(int aStart, int aFinish)
int maxCount = 0;
int count = getCount(i);
if(maxCount < count)
maxCount = count;
return maxCount;
int maxCount = getMaxCount(start, finish);
cout << maxCount << endl;
- AcceleratedC++/Chapter7 . . . . 6 matches
== 7.2 Counting words ==
map<string, int> counters; // store each word and an associated counter
++counters[s];
// write the words and associated counts
for (std::map<string, int>::const_iterator it = counters.begin();
it != counters.end(); ++it) {
- EightQueenProblem/용쟁호투 . . . . 6 matches
Integer il_attack [8,8] , il_limit = 1, il_queen_count = 1
Do While il_queen_count <= 8
il_queen_count = 1
is_solution[il_queen_count] = 'Queen No : ' + String(il_queen_count) + ' / X : ' + String(li_x) + ' / Y : ' + String(li_y)
il_queen_count++
- EightQueenProblem/이선우2 . . . . 6 matches
public int countAnswers()
return countAnswers( null );
public int countAnswers( final PrintStream out )
System.out.println( "number of answers: " + nq.countAnswers());
System.out.println( "number of answers: " + nq.countAnswers( System.out ));
System.out.println( "number of answers: " + nq.countAnswers( System.out ));
- EightQueenProblem/이창섭 . . . . 6 matches
bool count();
if (count())
bool count()
int counter = 0;
counter++;
if (counter == 8)
- JTDStudy/첫번째과제/상욱 . . . . 6 matches
def Show(sbo,count, end=True):
if isEnd:print '%d 회 스트라이크 아웃!' % count
else: print '%d 회 %d 스트라이크 %d 볼 %d 아웃' % tuple([count]+sbo)
for count in xrange(1,TURN_LIMIT+1):
Show(sbo,count,isEnd)
else:print '%d회 시도 실패하였습니다.' %count
- JTDStudy/첫번째과제/정현 . . . . 6 matches
public void testStrikeCount() {
assertEquals(0, beholder.getStrikeCount("000"));
assertEquals(1, beholder.getStrikeCount("001"));
assertEquals(2, beholder.getStrikeCount("110"));
public void testBallCount() {
assertEquals(0, beholder.getBallCount("000"));
assertEquals(1, beholder.getBallCount("102"));
assertEquals(2, beholder.getBallCount("321"));
assertEquals(3, beholder.getBallCount("231"));
return beholder.getStrikeCount(number);
return beholder.getBallCount(number);
public int getStrikeCount(String string) {
int count= 0;
count += numbers[i]==inputChars[i]? 1:0;
return count;
public int getBallCount(String string) {
int count= 0;
count++;
return count - getStrikeCount(string);
- Java/CapacityIsChangedByDataIO . . . . 6 matches
for (int counter = stringBuffer.length(); counter > 0; counter--) {
for (int counter = aVector.size(); counter > 0; counter--) {
- JavaStudy2002/영동-3주차 . . . . 6 matches
* 우선 상민이형이 써 주신 것에서 1번을 해 보았습니다.(버그 수정 완료)...이제 2번 할 차례...그리고 어쩌다가 count변수가 다시 필요해져서 다시 넣었습니다.
* 헉 참고의 의미였는데.. 뭐 해보는것도 좋을것 같습니다. 지금 디자인을 유지하고 3번째 까지 시도하신다면, count 변수는 자연스럽게 사라질것입니다.
public int count=0;
if(count==0)
count++;
* 안쓰이는 Board.count 인자 제거
- Marbles/문보창 . . . . 6 matches
int count = n/n1; // n1의 개수
int temp = n - (n1 * count);
marble.box1 = count;
while (count >= 0)
marble.box1 = count;
count--;
- MineSweeper/문보창 . . . . 6 matches
int count = 0;
size[count++] = n;
size[count++] = m;
int count = 0;
row = size[count++];
col = size[count++];
- One/구구단 . . . . 6 matches
int count; /*구구단의 2에서 9까지의 수*/
for(count=2; count<=9; ++count)
printf("%d*%d=%d\n", number, count, number*count);
- PPProject/Colume2Exercises . . . . 6 matches
// for ( int count = 0 ; count * gcd < i ; count ++ )
for ( int count = 0 ; count < i ; count += gcd)
- StringOfCPlusPlus/세연 . . . . 6 matches
int count;
count = 0;
count ++;
count++;
cout << "count : " << count << "\n";
- TheJavaMan/스네이크바이트 . . . . 6 matches
int count = 0;
apple.count++;
if(apple.count>=1)
static int count = 0;
Snake.count++;
if(Snake.count>=1)
- ThePriestMathematician/하기웅 . . . . 6 matches
int i, k, number, counting, exponent;
counting = 1;
while(counting<=MAX_DISK)
for(k=counting; k<=counting+exponent && k<=MAX_DISK; k++)
counting = k;
- TheTrip/문보창 . . . . 6 matches
void showExchange(const int * ex, const int count);
int count = 0;
exchangeCost[count++] = exchangeMoney(costs, n);
showExchange(exchangeCost, count);
void showExchange(const int * ex, const int count)
for (i=0; i<count; i++) // dollor단위로 출력
- 강성현 . . . . 6 matches
var count = [];
if (count[array[i]] == undefined) count[array[i]] = 0;
count[array[i]]++;
for (var i in count) {
console.log(i + ' ' + count[i]);
- 개인키,공개키/박능규,조재화 . . . . 6 matches
int count=0;
count ++;
for (i=0; i<count-1 ; i++)
for (i=0; i<count-1 ; i++)
for (i=0; i<count-1 ; i++)
for (i=0; i<count-1 ; i++)
- 김희성/MTFREADER . . . . 6 matches
void ReadSector(U64 sector, U32 count, void* buffer);
void _MFT_READER::ReadSector(U64 sector, U32 count, void* buffer)
ReadFile(hVolume, buffer, count * boot_block.BytesPerSector, &n, &overlap);
long filecounter=0;
filecounter++;
fprintf(fp,"A number of Files : %d\n",filecounter);
- 데블스캠프2009/금요일/연습문제/ACM2453/송지원 . . . . 6 matches
int input, i=2, b=1, count=0, temp = 0;
for(;1;count++, temp >>= 1)
printf("count : %d\n", count);
input = ((input >> b+count) + 1);
for(i=0; i<count-b; i++){
- 데블스캠프2011/둘째날/Machine-Learning/NaiveBayesClassifier/변형진 . . . . 6 matches
private int docsCount;
private int wordsCount;
private Map<String, Integer> wordCount = new HashMap<String, Integer>();
Integer count = wordCount.get(word);
wordCount.put(word, count == null ? 1 : count + 1);
wordsCount++;
docsCount++;
public int getDocsCount() {
return docsCount;
public int getWordCount(String word) {
Integer count = wordCount.get(word);
return count == null ? 1 : count;
public int getWordsCount() {
return wordsCount;
sum += trainers[i].getDocsCount();
return Math.log((double)trainers[index].getDocsCount()/sum);
sum += trainers[i].getWordCount(word);
total += trainers[i].getWordsCount();
return Math.log(((double)trainers[index].getWordCount(word)/trainers[index].getWordsCount()) / ((double)sum/total));
- 랜웍/이진훈 . . . . 6 matches
int count = 1;
int countz();
int z = countz();
count++;
z = countz();
int countz()//빈칸없나 체크하는 함수.
- 문제풀이/1회 . . . . 6 matches
def myproc(count,mx,mn):
if count != 0 :
return myproc(count-1, val, val)
return myproc(count-1, max(mx, val),min(mn,val))
def iterproc(count):
for i in range(0,count):
- 비밀키/조재화 . . . . 6 matches
int counter = 0;
counter++;
for(i=0; i< counter-1; i++)
for(i=0; i<counter-1; i++)
for(i=0; i<counter-1; i++)
for(i=0; i<counter-1;i++)
- 새싹교실/2012/AClass/2회차 . . . . 6 matches
int count=0;
count+=1;
printf("1이 %d번째에 있습니다.", count);
int count=0;
count+=1;
printf("2가 %d번째에 있습니다.\n", count);
- 새싹교실/2012/주먹밥 . . . . 6 matches
int count = 0;
a[count++] = temp;
}while(count != 10);
int count = 0;
count++;
System.out.println("Count : " + count);
- 오목/인수 . . . . 6 matches
int count = 0;
if( checkHeight(x,y,3) == 3 ) ++count;
if( checkWidth(x,y,3) == 3 ) ++count;
if( checkBackSlash(x,y,3) == 3 ) ++count;
if( checkSlash(x,y,3) == 3 ) ++count;
return count == 2;
- 조영준/다대다채팅 . . . . 6 matches
int count = 0;
count++;
toRemove.Enqueue(count);
count = 0;
while (!(toRemove.Count == 0))
count++;
ClientList.RemoveAt(toRemove.Dequeue()-count);
- 토비의스프링3/오브젝트와의존관계 . . . . 6 matches
public AccountDao accountDao( ){
return new AccountDao(new DConnectionMaker());
public AccountDao accountDao( ){
return new AccountDao(connectionMaker());
- 피보나치/김준석 . . . . 6 matches
int num1, num2, count;
scanf("%d",&count);
pivo(num1,num2,count,count);
printf("\n %d 번째까지 구했습니다.\n",count);
count이 10을 받고 p_num에 10이 들어간다
- 2thPCinCAUCSE/ProblemA/Solution/상욱 . . . . 5 matches
int count;
count = 0;
count = 0;
count++;
cout << count << endl;
- 2학기파이선스터디/if문, for문, while문, 수치형 . . . . 5 matches
>>> count = 1
>>> while count < 11:
print count
count = count + 1
- 3 N+1 Problem/조동영 . . . . 5 matches
int CheckCount (int low, int high){
int count = 1;
int maxCount = 0;
count = 1;
count++;
if(count > maxCount)
maxCount = count;
return maxCount;
cout << "MAX cycle-length값은 " << CheckCount(num1,num2) << "입니다." << endl;
- 3N+1/임인택 . . . . 5 matches
doCycle 1 count = count
doCycle n count =
then doCycle (3*n+1) (count+1)
else doCycle (div n 2) (count+1)
- 3n 1/Celfin . . . . 5 matches
int countNum, cycle, i, start, end;
countNum=1;
countNum++;
countNum+=2;
return countNum;
- A_Multiplication_Game/김태진 . . . . 5 matches
long long int n=0,p,count=0;
count=0;
if(count%2==0){
count++;
if(count%2!=0){
- BeeMaja/김상섭 . . . . 5 matches
int count = 0, temp = 6, x, y, i;
count++;
x = count;
if(-1*num < count)
temp = count;
- Fmt/문보창 . . . . 5 matches
int count_char = 0;
count_char = 0;
count_char++;
count_char++;
if (count_char >= 73 && str[i] != ' ')
- Hartals/차영권 . . . . 5 matches
int count = 0;
count--;
count++;
Save_Result[n++]=count;
count = 0;
- JTDStudy/첫번째과제/장길 . . . . 5 matches
public int count= 0;
ball[count++]= ((int)number/(100/i));
public int count= 0;
count=0;
ball[count++]= ((int)number/(100/i));
- LC-Display/문보창 . . . . 5 matches
int count = 0;
strcpy(d[count].num, str);
d[count].size = size;
count++;
return count;
- MineSweeper/황재선 . . . . 5 matches
countMine(row, col);
private void countMine(int row, int col) {
int count = 0;
count++;
mineArr[row][col] = Integer.toString(count);
- PrimaryArithmetic/1002 . . . . 5 matches
self.assertEquals(0,carryCount(123,456))
def carryCount(one,two):
self.assertEquals(0,carryCount(123,456))
def carryCount(one,two):
resultCount = 0
resultCount += 1
return resultCount
self.assertEquals(0,carryCount('123','456'))
self.assertEquals(3,carryCount('123','456'))
self.assertEquals(1,carryCount('123','456'))
def carryCount(one,two):
resultCount = 0
resultCount += 1
return resultCount
self.assertEquals(expected,carryCount(one,two))
def carryCount(one,two):
resultCount = 0
resultCount += 1
return resultCount
def nullList(nullCount):
- RandomWalk/신진영 . . . . 5 matches
int count=1, direction=0, walk=0;
while(count != 0)
count = 0;
count++;
count++;
- Refactoring/MakingMethodCallsSimpler . . . . 5 matches
discountLevel = getDiscountLevel ();
double finalPrice = discountedPrice (basePrice, discountLevel);
double finalPrice = discountedPrice (basePrice);
- WOWAddOn/2011년프로젝트/초성퀴즈 . . . . 5 matches
local count = 1
if count > 10000 then
base[count] = baseName
count = count+1
- 데블스캠프2012/넷째날/묻지마Csharp/Mission4/서영주 . . . . 5 matches
switch(count){
count++;
count++;
count++;
count = 0;
- 데블스캠프2012/첫째날/배웠는데도모르는C . . . . 5 matches
int count=0,num=0;
scanf("%d",&count);
if(count==0)
if(count==num)
for(n=0;n<count;n++)
- 만년달력/이진훈,문원명 . . . . 5 matches
int countday = 0; //날짜 세는 변수.
countday += 31;
countday += (28+fyun);
countday += 30;
findday = (findday%7+countday)%7;//각 월 첫째날의 요일.
- 문자반대출력/김정현 . . . . 5 matches
for( int count=0; count<text.length(); count++)
charArray[count]=text.charAt(text.length()-count-1);
- 소수구하기/재니 . . . . 5 matches
int premium[5133], count = 0;
for (int j = 0 ; j <= count ; j++)
count++;
premium[count] = i;
cout << premium[count] << ' ';
- 손동일/TelephoneBook . . . . 5 matches
int count; // 등록되는 전화번호의 개수 ( 한명 등록시 1씩 증가 )
count = 0;
count = count + 1;
for(int i=0; i<(base_save+count)*4; i++)
- 압축알고리즘/슬이,진영 . . . . 5 matches
int count=0;
/*int count=1;
count++;
cout<<count<<input[index];
count =1;
- 압축알고리즘/정욱&자겸 . . . . 5 matches
int num, count=1;
if (temp == zip[i]) count++;
cout << count << temp;
count = 1;
cout << count << temp << endl;
- 조영준/CodeRace/130506 . . . . 5 matches
public int count;
for (int j = 0; j < p.Count+1; j++)
if (j == p.Count)
temp.count = 1;
temp.count = p[j].count + 1;
for (int i = 0; i < p.Count; i++)
Console.Write(p[i].word+" "+p[i].count+"\n");
- 2dInDirect3d/Chapter2 . . . . 4 matches
DWROD count,
1. 앞쪽의 두 변수는 함께 움직인다. count에는 0을 넣으면 되고 pRect는 NULL을 넣어주면 된다. count가 0이 아니라면 pRect에는 count의 개수만큼 D3DRECT의 배열이 들어간다. 그 Rect부분만 클리어할 수 있다.
- 3N+1Problem/강희경 . . . . 4 matches
count = 1
count = count + 1
return count
- 8queen/문원명 . . . . 4 matches
int endFind = 0, count = 0;
if( firstBoard[y7th][x7th] != board[y7th][x7th]) count++;
if (count == 0) endFind = 1; //종료조건
else count = 0;
- AcceleratedC++/Chapter14 . . . . 4 matches
== 14.2 Reference-counted handles ==
이경우 대상객체의 해제는 객체를 가리키는 마지막 핸들이 소멸될때 행해져야한다. 이를 위해 '''레퍼런스 카운트(reference count, 참조계수)'''를 사용한다.
이를 위해서 우리는 이전의 클래스에 '''카운터(counter, 계수기)'''를 추가하고 객체의 생성, 복사, 소멸시 이 카운터를 적절하게 갱신한다.
// manage reference count as well as pointer
- AnEasyProblem/김태진 . . . . 4 matches
int bincount(int X);
k=bincount(N);
for(n=N+1;k!=bincount(n);n++){}
int bincount(int X)
- Android/WallpaperChanger . . . . 4 matches
private static final int COUNT = 10;
private int mCounter;
mCounter = COUNT;
} else if (--mCounter <= 0) {
Log.e("MyService", "mCounter : " + mCounter);
C++와 같은 네이티브 언어에서 필드에 직접적으로 접근하는 것 (예. i = mCount) 보다 getter를 사용하는 것 (i = getCount())은 일반적인 관습입니다. 이 방법은 C++에서는 훌륭한 습관입니다. 왜냐하면 항상 접근을 inline화 할 수 있는 컴파일러를 사용하고 있고, 필드에 접근을 제한하거나 디버그 해야 한다면 언제나 코드를 추가할 수 있기 때문입니다.
for (int i = 0; i < this.mCount; i++)
int count = this.mCount;
for (int i = 0; i < count; i++)
유사한 가이드라인은, 결코 "for"문의 두 번째 조건에서 메소드를 호출하지 말라는 것입니다. 예를 들어, 다음 코드는 간단하게 int 값으로 캐쉬 할 수 있는 경우임에도 큰 낭비가 되는 getCount()메소드를 매번 반복 마다 실행하게 됩니다:
for (int i = 0; i < this.getCount(); i++)
int count = list.size();
for (int n = 0; n < count; n++)
- BabyStepsSafely . . . . 4 matches
int count = 0;
count++;; // bump count.
int [] primes = new int[count];
- CeeThreadProgramming . . . . 4 matches
unsigned Counter;
while ( Counter < 100 ){
printf( "Thread ID %d => %dn", pArguments, Counter);
Counter++;
// below, Counter will not be correct because the thread has not
// terminated, and Counter most likely has not been incremented to
//printf( "Counter should be 1000000; it is-> %dn", Counter );
int count= 0;
while( count < 100000 )
count++;
printf("%s: %d \n", message, count);
- CodeRace/20060105/도현승한 . . . . 4 matches
int count;
cout << aVec[i].word << " " << aVec[i].count << endl;
struct_str.count = 1;
aVec2[vecIndex].count++;
- CodeRace/20060105/아영보창 . . . . 4 matches
int count;
container[i]->count++;
word->count = 1;
cout << container[i]->data << ' ' << container[i]->count << ' ' << container[i]->asciiSum << endl;
- CommonPermutation/문보창 . . . . 4 matches
int len, min, count;
count = 0;
str[count++] = i + 97;
str[count] = '\0';
- ContestScoreBoard/차영권 . . . . 4 matches
int count = 0;
while (count < nCase)
if (count < nCase-1)
count++;
- CppStudy_2002_1/과제1/CherryBoy . . . . 4 matches
static int count=0;
cout << "당신은 출력 함수를 " << count << " 번 사용하셨습니다.\n";
for(int i=0;i<count;i++)
count++;
- ErdosNumbers/문보창 . . . . 4 matches
int rest_count = 0;
rest_count++;
if (rest_count == 2 && thesis[i] == ',')
rest_count = 0;
- Gof/Composite . . . . 4 matches
virtual Currency DiscountPrice ();
virtual Currency DiscountPrice ();
virtual Currency DiscountPrice ();
virtual Currency DiscountPrice ();
- Google/GoogleTalk . . . . 4 matches
my $close_counter=0;
$close_counter++;
if($close_counter>1) { exit; }
$close_counter=0;
- HardcoreCppStudy/첫숙제/Overloading/김아영 . . . . 4 matches
int count =0 ;
count++;
count-=3 ;
for(bang = 0 ; bang<count ; bang++)
- Hartal/Celfin . . . . 4 matches
int counting;
counting=0;
counting++;
return counting;
- HowManyFibs?/하기웅 . . . . 4 matches
int i, counting;
counting=0;
counting++;
return counting;
- Lotto/강소현 . . . . 4 matches
int count = 0;
if(++count != 6)
int num = 0, count=0;
bin[count++] = 1;
- MineSweeper/Leonardong . . . . 4 matches
def computeMineCount( self, aRow, aCol ):
count = 0
count = count + 1
return count
result[row] = result[row] + str( self.computeMineCount(row, col) )
def testComputeMineCount(self):
self.assertEquals( 0, sweeper.computeMineCount(0,0) )
self.assertEquals( 1, sweeper.computeMineCount(0,1) )
self.assertEquals( 0, sweeper.computeMineCount(0,0) )
- OOP/2012년스터디 . . . . 4 matches
int count=0;
evt[count].M=eMonth;
evt[count].D=eDate;
count++;
- Omok/재니 . . . . 4 matches
int countStone;
countStone = 0;
countStone++;
if (countStone == 4)
- RandomWalk/대근 . . . . 4 matches
int count;
count=0;
count++;
}while(count!=0);
- RandomWalk/유상욱 . . . . 4 matches
int count, question, random, x = 0 , y = 0;
count = 0;
count++;
if ( count == 0 )
- RandomWalk/현민 . . . . 4 matches
int line,col,count=0; // count는 총 움직인 횟수
count++;
cout << "총 움직인 횟수는 " << count << "번 입니다.\n";
- Randomwalk/조동영 . . . . 4 matches
int count = 0; // 총이동한 횟수를 계산하게될 integer 값
while(count<50000 && existZero == false){
count++;
cout << "\n총 이동한 횟수 :" << count << endl;
- ReverseAndAdd/Celfin . . . . 4 matches
int testcase, number, i, counting;
counting=0;
counting++;
cout << counting << " ";
- ReverseAndAdd/남상협 . . . . 4 matches
self.count=0
self.count=self.count+1
for i in range(1,self.count+1):
- ScheduledWalk/석천 . . . . 4 matches
OutputMoveCount();
void OutputMoveCount() {
void OutputMoveCount();
OutputMoveCount();
void OutputMoveCount() {
IncrementBoardBlockCount();
void IncrementBoardBlockCount() {
void IncrementBoardBlockCount();
void OutputMoveCount();
IncrementBoardBlockCount();
비슷한 방법으로 IncrementBoardBlockCount 를 구현합니다.
void IncrementBoardBlockCount(int* board, IntPair roachPosition, int maxRow, int maxCol) {
void testIncrementBoardBlockCount() {
IncrementBoardBlockCount(board, currentRoachPosition, 10, 10);
전체 MoveNext 에 대해서 Test Case를 작성합니다. 그러면서 필요한 인자들을 생각해내고, 채워갑니다. MoveNext 에서 필요한 인자들은 GetMoveVector 와 MoveRoach, IncrementBoardBlockCount 에서 필요한 인자들의 총 집합이 됩니다.
testIncrementBoardBlockCount();
MoveNext 부분 test case 를 pass 하기 위해 실제 구현을 합니다. 이미 구현해둔 GetMoveVector, MoveRoach, IncrementBoardBlockCount 들을 조합하는 일만 하면 됩니다.
testIncrementBoardBlockCount();
IncrementBoardBlockCount(board, updatedRoachPosition, maxRow, maxCol);
int totalMoveCount = 0;
- Self-describingSequence/문보창 . . . . 4 matches
int count = 0;
if (count == 0)
count = table[number];
count--;
- SpiralArray/영동 . . . . 4 matches
bool isEnd(int endCount);//루프 끝날지 검사
int countMove=0;//총 이동횟수
checkAtBoard(board, &mover, &countMove);//첫 위치에 번호를 찍어줌
checkAtBoard(board, &mover, &countMove);//배열에 표시
}while(isEnd(countMove));//종료조건
bool isEnd(int endCount)
if(endCount<MAX_X*MAX_Y)
- TheGrandDinner/김상섭 . . . . 4 matches
int totalcount = 0;
totalcount++;
totalcount++;
if(test_table[j].maxNum - totalcount < 0)
- TugOfWar/김회영 . . . . 4 matches
void sort(int* array,int count);
int nCount;
cin>>nCount;
int* rightOfTotal=new int[nCount];
int* leftOfTotal=new int[nCount];
for(int k=0;k<nCount;k++)
for(int j=0;j<nCount;j++)
void sort(int* array,int count)
for(int i=0;i<count;i++)
for(int j=i;j<count;j++)
- UglyNumbers/김회영 . . . . 4 matches
int count=1;
while(count!=situation)//2번째 수까지
count++;
cout<<count<<":"<<number<<endl;
- UglyNumbers/승한 . . . . 4 matches
count = 1;
while count != 1500:
print n , count
count+=1
- XMLStudy_2002/Start . . . . 4 matches
<currency><country>영국</country><name>파운드</name><unit>£</unit></currency>
<currency><country>일본</country><name>엔</name><unit>¥</unit></currency>
- subsequence/권영기 . . . . 4 matches
int n, c, temp, count;
count = 0;
count++;
if(count >= c-1){
- whiteblue/LinkedListAddressMemo . . . . 4 matches
unsigned int count=0;
count++;
if ( count > 0 )
count--;
- whiteblue/MagicSquare . . . . 4 matches
int i = x, j = 0, count = 1;
while(count <= size*size)
arr[i][j] = count;
count++;
- whiteblue/만년달력 . . . . 4 matches
int yearInput, monthInput, count = 0, dateNumber = 1 , locationOf1stDay, addm;
locationOf1stDay = (addm + yearInput + count - 1 + 6) % 7; //
locationOf1stDay = (addm + yearInput + count + 6 ) % 7; //
count++;
- 개인키,공개키/임영동,김홍선 . . . . 4 matches
int key=30, count=0, i=0,temp;
count++;
for(i=0;i<count;i++)
for(i=0;i<count;i++)
- 데블스캠프2011/둘째날/Machine-Learning/NaiveBayesClassifier/강성현 . . . . 4 matches
int isP = 0, isE = 0, count = 0;
count++;
count++;
System.out.println((isP + isE)/(double)count);
- 마방진/곽세환 . . . . 4 matches
int input, count, row, col;
count = 0;
while (count != input * input)
mabang[row][col]=++count;
- 마방진/김아영 . . . . 4 matches
for(int count=2;count<26;count++)
a[y][x]=count;
- 반복문자열/이정화 . . . . 4 matches
int count;
for(count=0; count<5; count++)
- 비밀키/김홍선 . . . . 4 matches
int key, count=0, i=0;
count++;
for(i=0;i<count;i++)
for(i=0;i<count;i++)
- 비밀키/황재선 . . . . 4 matches
int count = 0;
data[count] = input;
count++;
data[count] = NULL;
- 새싹교실/2011/學高/8회차 . . . . 4 matches
int count=0;
count++;
printf("총 실행회수: %d\n",count);
* 음... 헤더는 제가 실수한거구요. 하노이의 탑을 짤 때 제대로 짰는지 확인해보라는 의미로 count를 넣었기 때문에 굳이 함수의 형태를 건들기보단 전역변수를 임시로 선언해서 쓰는것이 더 좋을 것 같아서 이렇게 작성했습니다. - [윤종하]
- 새싹교실/2012/AClass/5회차 . . . . 4 matches
int count=0;
for(count=0;count < a;count++)
- 새싹교실/2012/열반/120409 . . . . 4 matches
int N, counter;
counter=0;
counter++;
printf("%d\n", counter);
- 새싹교실/2013/양반/3회차 . . . . 4 matches
while(count <= 100){
total = total + count;
count = count + 2;
- 소수구하기/영동 . . . . 4 matches
int count;
count=0;
count++;
if(count==0)
- 소수구하기/영록 . . . . 4 matches
int counter = 0;
counter=0;
counter++;
if (counter == 2)
- 압축알고리즘/수진,재동 . . . . 4 matches
int i=0, count=1;
count++;
cout << count << input[i];
count=1;
- 이영호/끄적끄적 . . . . 4 matches
int count; // 총 몇 번 체크해야하는가?
// (count - 1) 번 체크 (미완성)
// File에서 array로 바뀐 것을 읽어와 함수를 수행 하는 것을 count-1번 반복한다.
for(i=1; i<count; i++)
- 피보나치/SSS . . . . 4 matches
int count;
count = pvio;
count-- ;
if (count == 0)
- 02_C++세미나 . . . . 3 matches
int count=1,sum=0;
while(count<=100)
sum+=count;
- 3N+1Problem/구자겸 . . . . 3 matches
int count = 1; // 카운터
count++;
return count;
- 3N+1Problem/김회영 . . . . 3 matches
int count = 1;//사이클의 길이 가진다
count++;
return count;
- 3N+1Problem/황재선 . . . . 3 matches
int findMaxCycle(int aNum, int aCount);
int count = 1;
count = 1;
temp = findMaxCycle(interNum, count);
int findMaxCycle(int aNum, int aCount)
return aCount;
aCount++;
findMaxCycle(aNum, aCount);
- 8queen/강희경 . . . . 3 matches
int count = 0;
}while(count < 8);
count++;
- AcceleratedC++/Chapter10 . . . . 3 matches
int fail_count = 0;
++fail_count;
return fail_count;
- Boost/SmartPointer . . . . 3 matches
// is still valid because the type is complete where it counts - in the
{ std::cout << "use_count() is " << _imp.use_count() << "\n"; }
- BoostLibrary/SmartPointer . . . . 3 matches
// is still valid because the type is complete where it counts - in the
{ std::cout << "use_count() is " << _imp.use_count() << "\n"; }
- C/C++어려운선언문해석하기 . . . . 3 matches
"Start reading the declaration from the innermost parentheses, go right, and then go left. When you encounter parentheses, the
3. Jump out of parentheses and encounter (int) --------- to a function that takes an int as argument
5. Go left, encounter * ----------------------------- that return pointers
- ContestScoreBoard/문보창 . . . . 3 matches
int count = 1;
rankTeam[count++] = i;
return count;
- ContestScoreBoard/허아영 . . . . 3 matches
int case_count = 0;
while(case_count < case_num)
case_count++;
- DataStructure/Queue . . . . 3 matches
int count=m_nFront;
cout<<m_nData[++count];
if(count==m_nRear)
- Doublets/문보창 . . . . 3 matches
int count = 0;
if (count % 2 == 0)
count++;
- EightQueenProblem/lasy0901 . . . . 3 matches
int t[8],check(int),count=0;
count++;
printf("[%d] : ",count);
- EightQueenProblem/강인수 . . . . 3 matches
self.count = 0
self.count+=1
print self.count , ' : ',
- EightQueenProblem/이선우3 . . . . 3 matches
public int countChessman()
if( countChessman() == (sizeOfBoard^2) ) return false;
if( board.countChessman() == board.getSizeOfBoard() ) {
- EightQueenProblem/최태호소스 . . . . 3 matches
static int count=0;
count++;
printf("solv %d\n",count);
- Euclid'sGame/강소현 . . . . 3 matches
int g, r, count=0;
if(r1>=r2) count++;
if(count%2 == 1){
- FactorialFactors/1002 . . . . 3 matches
F(n) = Count(n) + F(n-1)
Count(n) = 해당 n 에 대한 인수항 총합
그리고 F, Count 들에 대해서 caching 을 진행할 수 있으리라 생각, 다음과 같이 풀음.
class Counter:
return self.count(n)
def count(self,n,start=0):
result = self.count(n/e,start+1)
CountFunc = Counter()
total = sum((CountFunc(i) for i in xrange(2,n+1)))
* 알고리즘의 속도를 보니 Counter 부분이 O(n^2) 이다. caching 을 함에도 그렇다는 것은 무언가 다른 접근법이 있으리라.
- HASH구하기/조동영,이재환,노수민 . . . . 3 matches
int count=0;
na[count%5] += ch;
count++;
- HowManyFibs?/1002 . . . . 3 matches
i,count=1,0
if a < fiboI < b: count+=1
if fiboI > b: return count
- HowManyFibs?/문보창 . . . . 3 matches
int i, count = 0;
count++;
cout << count << endl;
- JavaStudy2002/영동-2주차 . . . . 3 matches
public int count=0;
while(count<24)
count++;
- JollyJumpers/임인택 . . . . 3 matches
int count=0;
++count;
return (count == size-1)?"Jolly":"NotJolly";
- LazyInitialization . . . . 3 matches
int getCount()
if(!count) // --; 어쩔수 없다. 그냥 옮긴거다.
count = defaultCount();
return count;
int defaultCount()
- LinkedList/학생관리프로그램 . . . . 3 matches
int counter = 0;
counter++;
printf("현재 총 %d명의 학생이 등록되었습니다.\n", counter);
- MatrixAndQuaternionsFaq . . . . 3 matches
seem counter-intuitive. The use of two dimensional arrays may seem
the use of CPU registers to handle loop counters on-board data caches
Using basic matrix calculations, the operation count would reach
- MedusaCppStudy/신애 . . . . 3 matches
int count = 0;
count++;
if (count >= 4) {
- MineSweeper/김상섭 . . . . 3 matches
int count = 1;
if(count != 1)
cout << "Field #" << count++ << ":\n";
- MineSweeper/김회영 . . . . 3 matches
int count=0;
count++;
cout<<endl<<"Field# :"<<count<<endl;
- MoreEffectiveC++ . . . . 3 matches
* Item 29: Reference counting - 참조 세기
1. 2002.02.15 드디어 스마트 포인터를 설명할수 있는 skill을 획득했다. 다음은 Reference counting 설명 skill을 획득해야 한다. Reference counting은 COM기술의 근간이 되고 있으며, 과거 Java VM에서 Garbage collection을 수행할때 사용했다고 알고 있다. 물론 현재는 Java Garbage Collector나 CLR이나 Tracing을 취하고 있는 것으로 알고 있다. 아. 오늘이 프로젝트 마지막 시점으로 잡은 날인데, 도저히 불가능하고, 중도 포기하기에는 뒤의 내용들이 너무 매력있다. 칼을 뽑았으니 이번달 안으로는 끝장을 본다.
1. 2002.02.17 Reference Counting 설명 스킬 획득. 이제까지중 가장 방대한 분량이고, 이책의 다른 이름이 '''More Difficult C++''' 라는 것에 100% 공감하게 만든다. Techniques가 너무 길어서 1of2, 2of2 이렇게 둘로 쪼갠다. (세개로 쪼갤지도 모른다.) 처음에는 재미로 시작했는데, 요즘은 식음을 전폐하고, 밥 먹으러가야지. 이제 7개(부록까지) 남았다.
- MySQL 설치메뉴얼 . . . . 3 matches
account that you created in the first step to use for running the
9. You can set up new accounts using the `bin/mysql_setpermission'
*Note*: The accounts that are listed in the MySQL grant tables
- RandomWalk/변준원 . . . . 3 matches
int count=0, number=0;//엔딩수, 이동수 지정
while(count<24)
count++;
- RandomWalk/은지 . . . . 3 matches
int count = 0;
count += walk[i][j];
cout << "총 움직인 횟수 : " << count << "\n";
- RandomWalk/재니 . . . . 3 matches
int n, l_or_r, line, row, passed, count = 0;
count++;
cout << count << "회 이동하였습니다.\n";
- RandomWalk/창재 . . . . 3 matches
int count = 0;
count ++;
cout << "총 움직인 횟수 = " << count << endl ;
- RandomWalk2/현민 . . . . 3 matches
int count = 0;
board[next_y][next_x]++; count++;
cout << "총 움직인 횟수는 " << count << "번 입니다.\n\n";
- ReverseAndAdd/신재동 . . . . 3 matches
count = 0
count += 1
return (count, number)
- ReverseAndAdd/이동현 . . . . 3 matches
def reverse(n, count):
if(count ==1000):
reverse(n+int(str(n)[::-1]), count+1)
- ReverseAndAdd/임인택 . . . . 3 matches
reverseAndAddSub count number =
then [count, number]
else reverseAndAddSub (count+1) (number + (read (reverse (show number))) )
- Ruby/2011년스터디/서지혜 . . . . 3 matches
int countProcess=0;
countProcess += 1;
printf("number of process = %d", countProcess);
- ScheduledWalk/재니&영동 . . . . 3 matches
int count = 0;
count += BoardArray[i * maxRow + j];
cout << "총 이동횟수 : " << count - 1 << endl;
- SignatureSurvey . . . . 3 matches
count = 1
print count, line
count +=1
- Slurpys/김회영 . . . . 3 matches
int testCount=0;
cin>>testCount;
result = new bool[testCount];
for(int i=0;i<testCount;i++)
for(int j=0;j<testCount;j++)
int count=0;
count++;
if(count>0)
- Slurpys/박응용 . . . . 3 matches
for count, t in enumerate(target):
if count == 0 : return False
self._remain = target[count:]
- SummationOfFourPrimes/문보창 . . . . 3 matches
int countPrimes = 6;
prim[countPrimes++] = i;
if (countPrimes > MAX)
- UglyNumbers/1002 . . . . 3 matches
def uglyNumber(count):
if count == 1: return 1
currentCount = 2
print idx,currentCount
if currentCount == count:
currentCount += 1
- UglyNumbers/문보창 . . . . 3 matches
int count = 0;
num[count++] = pow(2,expo2) * pow(3,expo3) * pow(5,expo5);
qsort(num, count, sizeof(int), comp);
- c++스터디_2005여름/실습코드 . . . . 3 matches
Mirror count;
count.input();
count.reverse();
- django/AggregateFunction . . . . 3 matches
= count =
Django에서 기본적으로 count 함수를 통해 레코드 개수를 셀 수 있다.
RiskReport.objects.count()
- 금고/조현태 . . . . 3 matches
int countNumber = 0;
++countNumber;
return countNumber;
- 데블스캠프2006/월요일/연습문제/if-else/김준석 . . . . 3 matches
int i,j,count =0;
count++;
if(count%5==0) cout << endl;
- 마방진/Leonardong . . . . 3 matches
int i=1, count=0 ,x=input/2 ,y=0;
while ( count < input*input )
++i, ++count, ++x, --y;
- 몸짱프로젝트/HanoiProblem . . . . 3 matches
int count = 0;
cout << "Steps : " << count << endl;
count++;
- 문자반대출력/남도연 . . . . 3 matches
Mirror count;
count.input();
count.reverse();
- 변준원 . . . . 3 matches
int count=0, number=0;//엔딩수, 이동수 지정
while(count<24)
count++;
- 비밀키/임영동 . . . . 3 matches
int count=1;
count++;
for(int i=0;i<count;i++)
- 소수구하기/zennith . . . . 3 matches
int i, j, flag, arr_p, tmp, count = 0;
count++;
printf("#%d prime numbers.\n", count);
- 알고리즘5주숙제/김상섭 . . . . 3 matches
int count = 0;
count++;
cout << 4*(double)count/max << endl;
- 압축알고리즘/홍선,수민 . . . . 3 matches
int max,count;
count++;
cout << buffer[i] << count;
- 영호의바이러스공부페이지 . . . . 3 matches
and AX will contian the error code. If no error is encountered
mov files_found,0 ; Count infected files found
mov files_infected,4 ; BX counts file infected so far
dec files_infected ; This counts as infecting a file
- 윤종하/지뢰찾기 . . . . 3 matches
void count_time(int iSecond);
count_time(3);
void count_time(int iSecond)
- 이영호/지뢰찾기 . . . . 3 matches
// srand(GetTickCount()); 를 이 함수 밖에서 수행한다.
int count = 0x0A; // 지뢰 갯수(10)
count--;
} while(count);
- 프로그래밍/Pinary . . . . 3 matches
int count = 0;
count++;
if (count == limit) {
- 피보나치/유선 . . . . 3 matches
int count;
scanf("%d",&count);
for(i=0;i<count-2;i++)
- 하노이탑/윤성복 . . . . 3 matches
int Mcount = 0; //이동횟수세기 위한 전역변수
Mcount++; //함수가 호출될때 마다 1씩 증가
return Mcount;
int disk,MoveCount;
MoveCount = hanoi(disk,1,2,3);
cout << endl << "최소 이동횟수" << MoveCount << endl;
- ALittleAiSeminar . . . . 2 matches
count(self,aStone)
return board.count(stone)
- AnEasyProblem/강소현 . . . . 2 matches
int num = 0, count=0;
bin[count++] = 1;
- AustralianVoting/Leonardong . . . . 2 matches
int votedCount;
if ( candidator.votedCount >= n / 2 )
candidators[ current(sheets[i]) ].votedCount++;
if ( candidators[i].votedCount <= limit )
if ( result > candidators[i].votedCount )
result = candidators[i].votedCount;
if ( candidators[i].votedCount != minVotedNum(candidators) )
int countRemainCandidators( const CandidatorVector & candidators )
int remainNum = countRemainCandidators(candidators);
candidator.votedCount = 0;
candidators[ num ].votedCount++;
- AutomatedJudgeScript/문보창 . . . . 2 matches
int count = 1;
cout << "Run #" << count++;
- CivaProject . . . . 2 matches
/** The count is the number of characters in the String. */
int count;
- CodeRace/20060105/Leonardong . . . . 2 matches
for word, count in result.items():
report.append((word, count))
- ComputerNetworkClass/Report2006/PacketAnalyzer . . . . 2 matches
count;
count = 0;
- DebuggingSeminar_2005/AutoExp.dat . . . . 2 matches
CPtrList =cnt=<m_nCount>
CByteArray =count=<m_nCount>
CStringList =count=<m_nCount>
_bstr_t=<m_Data->m_wstr,su> (<m_Data->m_RefCount,u>)
- FortuneCookies . . . . 2 matches
* Words must be weighed, not counted.
* You will step on the soil of many countries.
- Gof/Visitor . . . . 2 matches
virtual Currency DiscountPrice ();
_total += e->DiscountPrice ();
- HanoiTowerTroublesAgain!/하기웅 . . . . 2 matches
int counting(int num)
cout << counting(test[i]) <<endl;
- ImmediateDecodability/문보창 . . . . 2 matches
int count = 1;
cout << "Set " << count++;
- Linux/필수명령어/용법 . . . . 2 matches
- Enter login name for new account (^C to quit): blade
wc라는 이름은 word counter를 의미하는 것이 아닌가 생각한다. 아무런 옵션을 주지 않고서 사용하면 행수, 단어수, 문자수를 모두 검사해서 보고한다. 텍스트 문서 속에서 단어란 공백(space)문자, 탭(tab)문자 그리고 개행(newline)문자에 의해 구분되는 문자들의 집합을 의미한다.
- MoinMoinTodo . . . . 2 matches
* Add change counter to RecentChanges
* Wiki:WikiWordStatistics (or just add counters to the WordIndex?)
- RandomWalk/성재 . . . . 2 matches
int count,i,j;
count++;
- Refactoring/ComposingMethods . . . . 2 matches
int descount ( int inputVal, int Quantity, int yearToDate) {
int descount ( int inputVal, int Quantity, int yearToDate) {
- SpiralArray/Leonardong . . . . 2 matches
self.moveCount = 0
self.history.append( Point( self.coordinate, self.moveCount+1 ) )
self.moveCount += 1
self.history.append( Point( self.coordinate, self.moveCount+1 ) )
def _setMoveCount(self, count):
self.moveCount = count
self._setMoveCount( self.history.pop().value - 1 )
self.mover._setMoveCount(1)
self.mover.mark( point, self.mover.moveCount )
def testStoreMoveCount(self):
goStraight 전 버전은 Direction클래스를 이용해서 이동한(벽을 만나면 이동하지 않음) 위치를 얻어내고, 이동한 기록을 저장하는 형식이었다. 벽에 대한 검사가 겹치는 것 같아 mover에서 바로 벽을 검사하고 벽에 들어서면 종료하는 것으로 만들었다. 그러고 보니 따로 카운트 할 필요가 없어 moveCount변수를 없앴다. mover가 종료 조건도 검사하는데 board 넓이만큼 이동했으면 끝나는 것이기 때문이다.
self.history.append( Point( self.coordinate, self.moveCount() ) )
def moveCount(self):
return board.size * board.size < self.moveCount()
def testStoreMoveCount(self):
- SystemEngineeringTeam . . . . 2 matches
* zeropage's accounts
* mail account in [:domains.live.com/ Microsoft Live Domains]
- VonNeumannAirport/1002 . . . . 2 matches
void intVectorInit (vector<int>& vec, int* intList, int count) {
for (int i=0;i<count;i++) {
void movePeople (Configuration* conf, int moveDataSet[][3], int moveCount) {
for (int i=0;i<moveCount;i++) {
- WikiTextFormattingTestPage . . . . 2 matches
| *You type* | *You see* | *Note* | | =\tab+++ title= | <h3>title</h3> | (we count "+") | | =\tab\tab+ title= | <h2>title</h2> | (we count tabs) | | =\tab*H4: title= | <h4>title</h4> |
- biblio.xsl . . . . 2 matches
<a name="top"><xsl:value-of select="$lang-title"/> [<xsl:value-of select="count(book[not(@type='ref')])"/>]</a>
[<xsl:value-of select="count(../book[not(@type='ref') and @topic=$topic])"/>]
- 논문번역/2012년스터디/이민석 . . . . 2 matches
강도 분포의 평균값의 변화 뿐 아니라 하단 contour와 상단 contour의 방향을 고려하기 위해 추가적으로 세 가지 방향성 특징을 계산한다. 말인 즉 우리는 네 lower countour 점, upper contour 점, sliding window 내 평균값을 통해 줄들을 재고 선 방향들을 (8), (9), (10) 특성으로 각각 사용한다. (뭔 소리) 더 넓은 temporal context를 고려하여 우리는 특징 벡터의 각 성분마다 근사적인 수평 미분을 추가로 계산하고 결과로 20 차원 특징 벡터를 얻는다. (윈도우당 특징 10개, 도함수 10개)
위 식에서 P(W)는 글자 시퀀스 w의 언어 모형 확률이고 P(X|W)는 이 글자 시퀀스를 그 글자 모형에 따라 입력 데이터 x로서 관찰한 확률이다. 우리의 경우 absolute discounting과 backing-off for smoothing of probability distribution을 이용한 바이그램 언어 모형을 적용하였다. (cf. e.g. [3])
- 데블스캠프2006/월요일/연습문제/switch/이차형 . . . . 2 matches
int count = 0;
}while(n != 999 && count < 10);
- 반복문자열/김태훈zyint . . . . 2 matches
void repeat_prt(char* string,int count)
for(i=0;i<count;i++)
- 새싹교실/2012/아우토반/앞반/4.19 . . . . 2 matches
int account;
int account_inf;
- 서지혜/단어장 . . . . 2 matches
'''Accountable'''
(문제등에) 계속 시달리는 : Wine lovers in this country are under siege.
- 1002/책상정리 . . . . 1 match
* 주로 현재 작업중인 일에 촛점을 맞춘다. 이 경우 LRU 알고리즘을 궁리할 수 있다. 자신이 해당 자료를 다시 본지 몇일이 지났는가? 해당 자료들에 대해서 count 를 세보자. 그리하여 가장 자주 이용하는 책들을 가장 꺼내기 쉬운 위치에 놓자.
- 2학기파이선스터디/모듈 . . . . 1 match
['_StringTypes', '__builtins__', '__doc__', '__file__', '__name__', '_float', '_idmap', '_idmapL', '_int', '_long', 'ascii_letters', 'ascii_lowercase', 'ascii_uppercase', 'atof', 'atof_error', 'atoi', 'atoi_error', 'atol', 'atol_error', 'capitalize', 'capwords', 'center', 'count', 'digits', 'expandtabs', 'find', 'hexdigits', 'index', 'index_error', 'join', 'joinfields', 'letters', 'ljust', 'lower', 'lowercase', 'lstrip', 'maketrans', 'octdigits', 'printable', 'punctuation', 'replace', 'rfind', 'rindex', 'rjust', 'rstrip', 'split', 'splitfields', 'strip', 'swapcase', 'translate', 'upper', 'uppercase', 'whitespace', 'zfill']
- 2학기파이선스터디/문자열 . . . . 1 match
>>> s.count('like')
- 3DGraphicsFoundationSummary . . . . 1 match
glGenTextures(count,&tex[0])
- 3N+1Problem/1002_2 . . . . 1 match
숫자들을 주욱 나열해보면서 해당 n 값 대비 count cycle Length 의 값은 고정적일것이라는 점과, 이 값을 일종의 caching 을 하여 이용할 수 있겠다는 생각이 들다.
- AcceleratedC++ . . . . 1 match
|| ["AcceleratedC++/Chapter2"] || Looping and counting || ||
- AcceleratedC++/Chapter4 . . . . 1 match
<< grade(midterm, final, sum / count)
- C++/SmartPointer . . . . 1 match
// reference countable smart point
- CodeRace/20060105 . . . . 1 match
count 뒤에 하나의 아스키값 총합을 하나 더 출력한다.
- Counting/김상섭 . . . . 1 match
int count;
- DirectDraw . . . . 1 match
ddsd.dwFlags = DDSD_CAPS|DDSD_BACKBUFFERCOUNT; // 구조체와 backbuffercount를 사용가능
ddsd.dwBackBufferCount = 1; // 2차표면의 개수
- Eclipse . . . . 1 match
혹시 그 큰 규모라는 것이 어느정도 인지 알수 있을까요? 라인을 쉽게 세기 위해서 현 Eclipse를 새로 하나 복사해서 Eclipse용 metric 툴은 http://metrics.sourceforge.net/ 를 설치하시고 metric전용으로 사용하여 쓰면 공정-'Only counts non-blank and non-comment lines inside method bodies'-하게 세어줍니다. (구지 복사하는 이유는 부하를 많이 줍니다.) -- NeoCoin
- EffectiveC++ . . . . 1 match
static unsigned int numTanks; // object counter for tanks
- EffectiveSTL/Container . . . . 1 match
= Item5. Prefer range member functions to their single-element counterparts. =
- EffectiveSTL/ProgrammingWithSTL . . . . 1 match
= Item45. Distinguish among count, find, binary_search, lower_bound, upper_bound, and equal_range. =
- EffectiveSTL/VectorAndString . . . . 1 match
* reference count라는 게 있는데.. 뭐하는 걸까.. 참조 변수 세는건가?--a AfterCheck
- ExplicitInitialization . . . . 1 match
count = 0;
- FocusOnFundamentals . . . . 1 match
Students usually demand to be taught the language that they are most likely to use in the world outside (FORTRAN or C). This is a mistake. A well taught student (viz. one who has been taught a clean language) can easily pick up the languages of the world, and he [or she] will be in a far better position to recognize their bad features as he [or she] encounters them.
- HowManyZerosAndDigits/허아영 . . . . 1 match
// ->N/8이 1보다 작아질 때 까지. count 센다.
unsigned int zeroCount = 0, numCount = 0;
++zeroCount;
++numCount;
numCount = 0;
zeroCount = 1;
cout << zeroCount << " " << numCount << endl;
zeroCount = 0;
numCount = 0;
- HowToStudyDesignPatterns . . . . 1 match
Read Design Patterns like a novel if you must, but few people will become fluent that way. Put the patterns to work in the heat of a software development project. Draw on their insights as you encounter real design problems. That’s the most efficient way to make the GoF patterns your own.''
- LinuxProgramming/SignalHandling . . . . 1 match
SIGVTALRM - signal raised by timer counting virtual time -- "virtual timer expired"(SUS)
- Microsoft . . . . 1 match
{{|Microsoft Corporation (NASDAQ: MSFT) is the world's largest software company, with over 50,000 employees in various countries as of May 2004. Founded in 1975 by Bill Gates and Paul Allen, it is headquartered in Redmond, Washington, USA. Microsoft develops, manufactures, licenses, and supports a wide range of software products for various computing devices. Its most popular products are the Microsoft Windows operating system and Microsoft Office families of products, each of which has achieved near ubiquity in the desktop computer market.|}}
- MoinMoinNotBugs . . . . 1 match
I suspect this problem is pervasive, and I also suspect that the solution is almost moot; probably a one-off counting problem, or a mis-ordered "case" sort of sequence. If the /UL closing tag were to precede the P opening tag, all would be well.
- MoniWikiOptions . . . . 1 match
`'''$use_counter'''`
- MoreEffectiveC++/Appendix . . . . 1 match
Murray's book is especially strong on the fundamentals of template design, a topic to which he devotes two chapters. He also includes a chapter on the important topic of migrating from C development to C++ development. Much of my discussion on reference counting (see Item 29) is based on the ideas in C++ Strategies and Tactics.
- MoreEffectiveC++/Operator . . . . 1 match
*작성자 사설: 아 나는 정말 이런 리턴이 이해가 안간다. 참조로 넘겨 버리면 대체 컴파일러는 어느 시점에서 oldValue의 파괴를 하냔 말이다. C++이 reference counting으로 자원 관리를 따로 해주는 것도 아닌대 말이다. 1학년때 부터의 고민이단 말이다. 좀 명쾌한 설명을 누가 해줬으면..
- NeoCoin/Server . . . . 1 match
dd if=/dev/zero of=/swapfile bs=1024 count=10240
- OperatingSystemClass/Exam2002_2 . . . . 1 match
* countable semaphore class 를 구현. 단, default 생성자에서 세마포어 값은 0으로 설정.
- PHP-방명록만들기 . . . . 1 match
$count = mysql_num_rows($result);
- PageHitsMacro . . . . 1 match
$use_counter=1;
특정 사용자명, 가령 개인위키라면 그 위키 주인, 은 제외하고 incCounter()하는 게 어떨까요?
- Postech/QualityEntranceExam06 . . . . 1 match
- 어떤 경우에 counting semaphore 를 쓰는지,,
- PrettyPrintXslt . . . . 1 match
<xsl:when test="count(*)=0 and .=''">
- ProgrammingLanguageClass . . . . 1 match
"Students usually demand to be taught the language that they are most likely to use in the world outside (FORTRAN or C). This is a mistake. A well taught student (viz. one who has been taught a clean language) can easily pick up the languages of the world, and he [or she] will be in a far better position to recognize their bad features as he [or she] encounters them."
- ProgrammingLanguageClass/2006/EndTermExamination . . . . 1 match
up to ... (1) <어느 위치·정도·시점이> …까지(에), …에 이르기까지;<지위 등이> …에 이르러:up to this time[now] 지금껏, 지금[이 시간]까지는/I am up to the ninth lesson. 나는 제 9과까지 나가고 있다./He counted from one up to thirty. 그는 1에서 30까지 세었다./He worked his way up to company president. 그는 그 회사의 사장으로까지 출세했다. (2) [대개 부정문·의문문에서] 《구어》 <일 등>을 감당하여, …을 할 수 있고[할 수 있을 정도로 뛰어나]:You’re not up to the job. 너는 그 일을 감당하지 못한다./This novel isn’t up to his best. 이 소설은 그의 최고작에는 미치지 못한다./This camera is not up to much. 《구어》 이 카메라는 별로 대단한 것은 아니다./Do you feel up to going out today? 오늘은 외출할 수 있을 것 같습니까? 《병자에게 묻는 말》 (3) 《구어》 <나쁜 짓>에 손을 대고;…을 꾀하고:He is up to something[no good]. 그는 어떤[좋지 않은] 일을 꾀하고 있다./What are they up to? 그들은 무슨 짓을 하려는 것인가? (4) 《구어》 <사람이> 해야 할, …나름인, …의 의무인:It’s up to him to support his mother. 그야말로 어머니를 부양해야 한다./I’ll leave it up to you. 그것을 네게 맡기마./It’s up to you whether to go or not. 가고 안가고는 네 맘에 달려 있다./The final choice is up to you. 마지막 선택은 네 손에 달려 있다.
- ProjectSemiPhotoshop/SpikeSolution . . . . 1 match
int GetBitCount();
int GetRealWidth() {return WIDTHBYTES((GetWidth()*GetBitCount()));}
WORD wBitCount; // DIB bit count
wBitCount = ((LPBITMAPINFOHEADER)lpbi)->biBitCount;
wBitCount = ((LPBITMAPCOREHEADER)lpbi)->bcBitCount;
switch (wBitCount)
dwBmBitsSize = WIDTHBYTES((lpBI->biWidth)*((DWORD)lpBI->biBitCount)) * lpBI->biHeight;
- ProjectZephyrus/간단CVS사용설명 . . . . 1 match
cvs_man:*:548:536:Pubilc CVS Account for Project Dummy:/home/CVS/:/bin/false
- Python/DataBase . . . . 1 match
print cur.rowcount
- PythonThreadProgramming . . . . 1 match
* 문제 상황 예 : count 변수를 각 쓰레드들이 1식 증가를 시키는데 한 스레드가 증가 시키는 동안 다른 스레드도 동시에 증가 시키다 보면 원래 2 증가 해야하는데 1증가 하는 수가 생긴다..
- RandomWalk2/ClassPrototype . . . . 1 match
int m_nMoveCount;
m_nMoveCount=0;
void printMoveCount () {
cout << "move count : " << m_nMoveCount << endl;
roach->printMoveCount ();
- RuminationOnC++ . . . . 1 match
* Handle (use count를 분리시킨 핸들)
- UpgradeC++/과제2 . . . . 1 match
int count = 0;
- WhyWikiWorks . . . . 1 match
So that's it - insecure, indiscriminate, user-hostile, slow, and full of difficult, nit-picking people. Any other online community would count each of these strengths as a terrible flaw. Perhaps wiki works because the other online communities don't. --PeterMerel
- WikiSlide . . . . 1 match
* '''Simple''' - ''Content over Form'' (content counts, not the super-pretty appearance)
- ZeroPage/회비 . . . . 1 match
[http://zeropage.org/?mid=accounts&category=&search_target=title&search_keyword=2008 회계게시판]
- ZeroPageServer/SubVersion . . . . 1 match
= Account? =
- ZeroPageServer/set2002_815 . . . . 1 match
* [[HTML( <STRIKE> ZeroPage 좌측 하단 카운터의 cgi</STRIKE> )]] : counter.txt의 writing 권한 문제
- [Lovely]boy^_^/영작교정 . . . . 1 match
* [[HTML(<STRIKE>)]] Developing Countrys strive for technical and economical advancement for years. [[HTML(</STRIKE>)]]
* Developing countries have striven for technological and economical advancement for years.
- aekae/code . . . . 1 match
// roach moves, if unvisited place, count it!
- 김재현 . . . . 1 match
#define COUNT 6 // 당첨번호개수
printf("Enter the game count: ");
for (k=0; k < COUNT; k++) { //질문
- 논문번역/2012년스터디/서민관 . . . . 1 match
우리의 경우에는 absolute discounting 을 이용한 bi-gram언어 모델과 backing-off for smoothing of probability distributions가 적용되었다.
- 데블스캠프2005/java . . . . 1 match
According to the available accounts, Bill Joy had ideas of a new language combining the best of Mesa and C. He proposed, in a paper called Further, to Sun that its engineers should produce an object-oriented environment based on C++. James Gosling's frustrations with C++ began while working on Imagination, an SGML editor. Initially, James attempted to modify and extend C++, which he referred to as C++ ++ -- (which is a play on the name of C++ meaning 'C++ plus some good things, and minus some bad things'), but soon abandoned that in favor of creating an entirely new language, called Oak named after the oak tree that stood just outside his office.
- 마스코트이름토론 . . . . 1 match
전체 투표자 : 명 (투표하신 분들은 1씩 count를.~ history 남씀다.~ 조작 짤없슴다.~)
- 만년달력/김정현 . . . . 1 match
public void testDayCount() {
public void testActualDaycount() {
public void testAcutalDayCountInYear() {
- 만년달력/방선희,장창재 . . . . 1 match
int count = 0;
- 새싹교실/2012/우리반 . . . . 1 match
* printf,\n,\t,\a,\\,\",return 0; in main,compile, link, scanf, int ==> variables, c=a+b;, %d, + => operator, %,if, ==, !=, >=, else, sequential execution, for, a?b:c, total variable, counter variable, garbage value, (int), 연산우선순위, ++a a++ pre/post in/decrement operator, math.h // pow,%21.2d, case switch, break, continue, logical operator || && ! 등.
- 서지혜 . . . . 1 match
* Accountable Goal Setting
- 소수구하기 . . . . 1 match
static int i, j, flag, primeArr_p, limit, count = 0;
- 알고리즘8주숙제 . . . . 1 match
Given the denominations of coins for a newly founded country, the Dairy Republic, and some monetary amount, find the smallest set of coins that sums to that amount. The Dairy Republic is guaranteed to have a 1 cent coin.
- 오목/민수민 . . . . 1 match
int count;
- 정모/2012.8.29 . . . . 1 match
* 2학기 사용계획 [http://zeropage.org/accounts/62922 홈페이지] 참고.
- 졸업논문/본론 . . . . 1 match
웹 애플리케이션 개발자가 가장 많이 쓰는 기능은 SQL을 이용하여 데이터베이스 내용을 삽입, 삭제, 수정, 조회하는 것이다. 그 중에도 데이터를 조회하는 SQL문은 다양한 구조를 가진다. 기본 구조는 select from 이다. 여기서 from절에 테이블이 여러 번 나오는 경우 조인 연산을 수행한다. 조인 연산은 다른 테이블 또는 같은 테이블끼리 가능하다. select from where문을 사용하면 where절에 있는 조건을 만족하는 데이터만 조회한다. aggregate function을 사용하면 원하는 결과를 좀더 쉽게 얻을 수 있다. 이에는 개수(count), 합계(sum), 최소(min), 최대(max), 평균(avg)이 있다. aggregate function에 group by문을 사용하면 그룹 단위로 결과를 얻는다. group by절에는 having을 이용해 조건을 제한할 수 있다. 또한 순서를 지정하는 order by문과 집합 연산인 union, intersect, except 등이 있다. where절 이하에 다시 SQL문이 나타나는 경우를 중첩질의라고 한다. 중첩 질의를 사용할 때는 특별히 (not) exist, (not) unique와 같은 구문을 사용할 수 있다.
- 프로그래밍 . . . . 1 match
2번 : 5분 단위 count down
- 프로그래밍/Score . . . . 1 match
int count = 1;
- 헝가리안표기법 . . . . 1 match
솔직히 필자도 얼마전까지 이런 변수 명명에 대한 관례를 잘 지키지 않았다. 그러나 변수 명명에 관한 표준화된 관례를 지켜주면 코드의 가독성을 높여줄 뿐 아니라 예를 들어 카운터 변수를 count라고 지을지 cnt라고 지을지 고민하지 않아도 되는 편리함을 누릴 수 있다. - [http://dasomnetwork.com/~leedw/mywiki/moin.cgi/_c7_eb_b0_a1_b8_ae_be_c8_20_c7_a5_b1_e2_b9_fd?action=edit 출처]
Found 396 matching pages out of 7540 total pages (5000 pages are searched)
You can also click here to search title.
