- RandomWalk2/조현태 . . . . 36 matches
cout << "input End Num 999\n>>";
int endNum;
cin >> endNum;
int moveNum = 0;
++moveNum;
cout << moveNum << endl;
#define NUMBER_PLAYER 2
string moveRotate[NUMBER_PLAYER];
int myPointX[NUMBER_PLAYER];
int myPointY[NUMBER_PLAYER];
for (int i = 0; i < NUMBER_PLAYER; ++i)
cout << "input End Num 999\n>>";
int endNum;
cin >> endNum;
int moveNum[NUMBER_PLAYER] = {0,};
for (register int i = 0; i < NUMBER_PLAYER; ++i)
for (register int j = 0; j < NUMBER_PLAYER; ++j)
++moveNum[j];
for (register int i = 0; i < NUMBER_PLAYER; ++i)
cout << moveNum[i] << endl;
- C++스터디_2005여름/학점계산프로그램/허아영 . . . . 21 matches
char name[STUDENT_NUM][10];
double credit_average[STUDENT_NUM];
//char sort_grade_name[STUDENT_NUM][10];
//double sort_grade[STUDENT_NUM];
double grade[STUDENT_NUM][SUBJECT_NUM];
#define SUBJECT_NUM 4
#define STUDENT_NUM 120
#define SCHOLARSHIP_NUM 12
char grade_input[SUBJECT_NUM][3];
for(int student_num = 0; student_num < 120; student_num++)
for(int i = 0; i < SUBJECT_NUM; i++)
a.grade[student_num][i] = credit[j];
for(int j = 0; j < STUDENT_NUM; j++)
for(int i = 0; i < SUBJECT_NUM; i++)
for(int i = 0; i < STUDENT_NUM; i++)
for (int j = 0; j < STUDENT_NUM; j++)
for(int i = 0; i < SUBJECT_NUM; i++)
credit_average[j] = (double)(sum/SUBJECT_NUM);
for(int i = 0; i < STUDENT_NUM; i++)
for(i = 0; i < SCHOLARSHIP_NUM; i++)
- AseParserByJhs . . . . 16 matches
#define NUM_VERTEX "*MESH_NUMVERTEX"
#define NUM_FACES "*MESH_NUMFACES"
#define NUM_TVERTEX "*MESH_NUMTVERTEX"
#define NUM_TFACES "*MESH_NUMTVFACES"
#define NUM_TEXTURE "*MATERIAL_COUNT"
#define PV_NUM "*PHYSIQUE_NUMVERTEXASSIGNMENT" // 전체 PV 개수. 별로 의미 없다.. 본 개개에 할당된 PV수가 필요하므로..
for (int i=0; i<nNodeNum; i++)
for (int i1=0; i1<nNodeNum; i1++)
for (int i2=0; i2<nNodeNum; i2++)
pNodeList [i2]->AddChildNum (); // 부모의 자식수 카운트를 1 늘림
CHS_Model** pDest = new CHS_Model* [pNodeList [i2]->GetChildNum ()]; // 새 메모리 할당
memcpy (pDest, pChildTmp, sizeof (CHS_Model*) * (pNodeList [i2]->GetChildNum ()-1)); // 복사
pDest[pNodeList [i2]->GetChildNum ()-1] = pNodeList [i1]; // 부모에게 추가된 새 자식 저장
for (i=0; i<nNodeNum; i++) {
pNodeList[i]->CreateVolumn (pNodeList[i]->verts, pNodeList[i]->numVertex);
for (i=0; i<nNodeNum; i++) {
pRootList [nRootNum] = pTmp;
nRootNum++;
for (int i=0; i<nNodeNum; i++)
pNodeList [nNodeNum] = pM;
- C++스터디_2005여름/학점계산프로그램/문보창 . . . . 13 matches
static const int NUM_STUDENT; // 학생 수(상수 멤버)
const int CalculateGrade::NUM_STUDENT = 121;
student = new Student[NUM_STUDENT];
for (int i = 1; i < NUM_STUDENT; i++)
for (int i = 1; i < NUM_STUDENT; i++)
for (int j = i + 1; j < NUM_STUDENT; j++)
int num = NUM_STUDENT / 10;
for (int i = 1; i <= num; i++)
for (int i = 1; i < NUM_STUDENT; i++)
static const int NUM_GRADE; // 과목 수 (상수 멤버)
int number; // 학번
const int Student::NUM_GRADE = 4;
number = 0;
fin >> number;
for (int i = 0; i < NUM_GRADE; i++)
for (int i = 0; i < NUM_GRADE; i++)
average = sum / NUM_GRADE;
cout << "학번 : " << number << " 평점 : " << average << endl;
- SmithNumbers/신재동 . . . . 12 matches
=== SmithNumbers/신재동 ===
const int MAX_PRIME_NUMBER = 100000;
int MAIN_PRIME_NUMBER[MAX_PRIME_NUMBER] = {0,};
int number;
int smithNumbers[MAX_TEST] = {0,};
int sumPositionOfNumber(int testNumber);
int sumFactorizationOfNumber(int testNumber);
bool isSmithNumber(int n);
int factorization(int testNumber);
void makePrimeNumbers();
void makePrimeNumbers()
MAIN_PRIME_NUMBER[primeCount++] = 2;
for (int i = 3; primeCount < MAX_PRIME_NUMBER; i += 2)
if (i % MAIN_PRIME_NUMBER[j] == 0)
else if (i / MAIN_PRIME_NUMBER[j] <= MAIN_PRIME_NUMBER[j])
MAIN_PRIME_NUMBER[primeCount++] = i;
//number = 4937774;
cin >> number;
int sumPositionOfNumber(int testNumber)
int devideNum = 1;
- ContestScoreBoard/문보창 . . . . 10 matches
const int NUMBER_TEAM = 101;
const int NUMBER_PROBLEM = 10;
int timeProblem[NUMBER_PROBLEM];
int numberSuccessProblem;
void concludeRank(ContestTeam * team, int * rankTeam, int numberSumitTeam);
void printRank(ContestTeam * team, int * rankTeam, int numberSumitTeam);
int numberCase;
cin >> numberCase;
ContestTeam team[NUMBER_TEAM];
bool isSumit[NUMBER_TEAM];
int rankTeam[NUMBER_TEAM];
int numberSumitTeam;
for (i = 0; i < numberCase; i++)
numberSumitTeam = settingRank(isSumit, rankTeam);
concludeRank(team, rankTeam, numberSumitTeam);
printRank(team, rankTeam, numberSumitTeam);
if (i != numberCase - 1)
for (int i = 1; i < NUMBER_TEAM; i++)
for (int j = 1; j < NUMBER_PROBLEM; j++)
team[i].numberSuccessProblem = 0;
- Marbles/신재동 . . . . 10 matches
const int MAX_NUMBER = 1000;
unsigned int marbles[MAX_NUMBER] = {0,};
unsigned int c1[MAX_NUMBER] = {0,};
unsigned int n1[MAX_NUMBER] = {0,};
unsigned int c2[MAX_NUMBER] = {0,};
unsigned int n2[MAX_NUMBER] = {0,};
unsigned int m1[MAX_NUMBER] = {MAX_NUMBER,};
unsigned int m2[MAX_NUMBER] = {MAX_NUMBER,};
- 그래픽스세미나/5주차 . . . . 9 matches
*MESH_NUMVERTEX 8
*MESH_NUMFACES 12
*MESH_NUMTVERTEX 0
*MESH_NUMVERTEX 6
*MESH_NUMFACES 8
*MESH_NUMTVERTEX 0
*MESH_NUMVERTEX 25
*MESH_NUMFACES 32
*MESH_NUMTVERTEX 0
- 데블스캠프2010/다섯째날/ObjectCraft/미션3/김상호 . . . . 9 matches
#define NUM 4
void init_unit(unit a[NUM]){
for(n=0 ; n<NUM ; n++){
unit a[NUM];
sel=rand()%(NUM*2);
#define NUM 4
unit a[NUM];
for(int i=0 ; i<NUM ; i++)
sel=rand()%(NUM*2);
- 중위수구하기/조현태 . . . . 9 matches
그래도 뭐 나름대로 MAX_NUMBER에 3이외의 값을 넣으면(단 홀수! 아닐경우 정확한 가운데 값이 아니닷! ) 여러가지로 늘릴 수 있다.^^
const int MAX_NUMBER=3;
const int BREAK_NUMBER=-999;
void change(int *number1, int *number2)
int temp=*number1;
*number1=*number2;
*number2=temp;
int input(int *input_number)
for (int i=0; i<MAX_NUMBER; ++i)
cin >> input_number[i];
if (0==i && input_number[0]==BREAK_NUMBER)
int input_number[MAX_NUMBER]={0,};
while (input(input_number))
for (int i=0; i<MAX_NUMBER-1; ++i)
for (int j=0; j<MAX_NUMBER-i-1; ++j)
if (input_number[j]>input_number[j+1])
change(&input_number[j],&input_number[j+1]);
cout << "가운데 값은 " << input_number[MAX_NUMBER/2] << "입니다.\n";
getMiddle(NumA, NumB, NumC) -> [_, A, _] = lists:sort([NumA, NumB, NumC]), A.
while (input(input_number)) 요거 이해하는데 버벅거렸다; 입력값을 -999를 입력받을때까지 계속 입력받는걸로 했구낭ㅇㅅㅇ
- 강희경/메모장 . . . . 8 matches
#define NUMBER_OF_SCORES 5
struct ScoreData scoreArray[NUMBER_OF_SCORES];
/*Enter a number for score[0] : 80
Enter a number for score[1] : 50
Enter a number for score[2] : 99
Enter a number for score[3] : 74
Enter a number for score[4] : 88
while(count < NUMBER_OF_SCORES){
printf("\nEnter a number for score[%d] : ", count);
aArrayData->avg = (float)aArrayData->sum/NUMBER_OF_SCORES;
for(count = 0; count < NUMBER_OF_SCORES; count++){
for(count = 0; count < NUMBER_OF_SCORES; count++){
for(cmpCount = 0; cmpCount < NUMBER_OF_SCORES; cmpCount++){
for(count = 0; count < NUMBER_OF_SCORES; count++){
int beverageNumber;
scanf("%d", &beverageNumber);
}while(beverageNumber < 0 || beverageNumber >=3);
printf("%C 음료수가 선택되었습니다\n", beverage[beverageNumber]);
if(money >= beveragePrice[beverageNumber]){
money -= beveragePrice[beverageNumber];
- AdventuresInMoving:PartIV/문보창 . . . . 7 matches
#define MAX_NUM 1000000000
static int numStation; /* 주유소 수 */
numStation = 0;
numStation++;
cin >> station[numStation].length >> station[numStation].price;
d[1][j] = MAX_NUM;
if (numStation == 1)
if (totalLength - station[numStation].length > 100 || station[1].length > 100)
cout << d[1][totalLength - station[numStation].length + 100] << endl;
for (i = 2; i <= numStation; i++)
min = MAX_NUM;
if (k - getDistance(i) < 0 || d[(i-1)%2][k] >= MAX_NUM || j < k - getDistance(i))
min = MAX_NUM;
if (d[numStation%2][j] < MAX_NUM && d[numStation%2][j] < min && j - (totalLength - station[numStation].length) >= 100)
min = d[numStation%2][j];
if (min >= MAX_NUM)
int numCase;
cin >> numCase;
for (int i = 0; i < numCase; i++)
if (i != numCase - 1)
- 숫자를한글로바꾸기/조현태 . . . . 7 matches
const int MAX_NUMBER=10000;//최대가 10000이기때문.
const char NUMBER_TO_HAN[10][3]={"영","일","이","삼","사","오","육","칠","팔","구"};
const char NUMBER_TO_JARI[5][3]={"","십","백","천","만"};
stack print_number(MAX_LONG);
int input_number=-1;
while (input_number<0 || input_number>=MAX_NUMBER)
cin >> input_number;
while (input_number>0)
print_number.get_in(input_number%10);
input_number/=10;
cout << NUMBER_TO_HAN[0];
while (print_number.get_out(&temp))
cout << NUMBER_TO_HAN[temp] << NUMBER_TO_JARI [jari];
- SmithNumbers/조현태 . . . . 6 matches
unsigned int Creat_base_and_process(unsigned int number);
const int MAX_NUMBER=10000000;
int number_simulation;
scanf("%d",&number_simulation);
for (;number_simulation>0;--number_simulation)
unsigned int minimum_number;
scanf("%d",&minimum_number);
printf("결과 : %d\n",Creat_base_and_process(minimum_number+1));
unsigned int Get_right(unsigned int number, unsigned int* log_number)
while (number>1)
if (1==log_number[number])
sum+=number;
sum+=Sum_jari(log_number[number]);
number/=log_number[number];
unsigned int Sum_jari(unsigned int number)
while (number>0)
sum+=number%10;
number/=10;
unsigned int Creat_base_and_process(unsigned int number)
unsigned int *log_number=(unsigned int*)malloc((MAX_NUMBER+2)*sizeof(unsigned int));
- TowerOfCubes/조현태 . . . . 6 matches
const int BOX_FACE_NUMBER = 6;
const char FACE_NAME[BOX_FACE_NUMBER][7] = {"front", "back", "left", "right", "top", "bottom"};
int color[BOX_FACE_NUMBER];
SBoxBlock(int inputNumber, int inputTopFace)
number = inputNumber;
int number;
inline int GetOppositeFace(int faceNumber)
if (1 == faceNumber % 2)
return faceNumber - 1;
return faceNumber + 1;
void SuchNextBox(vector<SMyBox*>& myBoxs, int boxNumber, int lastColor, vector<SBoxBlock>& myBoxStack, vector<SBoxBlock>& bestHeight)
if (0 > boxNumber)
suchFaceList.reserve(BOX_FACE_NUMBER);
for (register int i = 0; i < BOX_FACE_NUMBER; ++i)
for (register int i = 0; i < BOX_FACE_NUMBER; ++i)
if (lastColor == myBoxs[boxNumber]->color[i])
myBoxStack.push_back(SBoxBlock(boxNumber, suchFaceList[i]));
for (register int j = boxNumber - 1; j >= -1 ; --j)
SuchNextBox(myBoxs, j, myBoxs[boxNumber]->color[suchFaceList[i]], myBoxStack, bestHeight);
cout << showStack[i].number + 1 << " ";
- 주민등록번호확인하기/조현태 . . . . 6 matches
const int CHAR_TO_NUMBER=48;
int input_number[13];
char number;
number=getche();
if (47<number && number<58)
number-=CHAR_TO_NUMBER;
sum+=input_number[i];
if ((11-sum%11)%10==number)
else input_number[cursur]=number*(cursur%8+2);
}else if (BACK_SPACE==number)
const int CHAR_TO_NUMBER=48;
int put_num[13];
char number;
number=getche();
if (47<number && number<58)
number-=CHAR_TO_NUMBER;
sum+=put_num[i]*(i%8+2);;
if ((11-sum%11)%10==number && put_num[2]*10+put_num[3]<13 && put_num[4]*10+put_num[5]<32 && put_num[6]<3)
else put_num[cursur]=number;
}else if (BACK_SPACE==number)
- ContestScoreBoard/허아영 . . . . 5 matches
#define MAX_OF_TEAM_NUM 100
int case_num;
int team_data[MAX_OF_TEAM_NUM+1][MAX_OF_Q+1]; // 0번째 배열은 시간 벌점 다음부터는
int temp_team_num, q_num, q_index[MAX_OF_TEAM_NUM]; // 문제 푼 index
for(i = 0; i <= MAX_OF_TEAM_NUM; i++)
cin >> case_num; // case num
while(case_count < case_num)
cin >> temp_team_num;
if(temp_team_num == 0) // case 끝은 0으로
cin >> q_num;
team_data[temp_team_num][0] += temp_time;
team_data[temp_team_num][q_index[temp_team_num]] = q_num; // 문제번호 넣기
q_index[temp_team_num]++;
team_data[temp_team_num][0] += 20;
team_data[temp_team_num][q_index[temp_team_num]] = q_num;
for(i = 1; i <= MAX_OF_TEAM_NUM; i++)
cout << "team number : " << i << endl;
cout << "team num of q : " << q_index[i] << endl;
- 호너의법칙/조현태 . . . . 5 matches
int number_of_sum=0;
int number_of_multiply=0;
const int NUMBER_TO_CHAR=48;
write_temp[1][i*SIZE_OF_BLOCK+8]=i/10+NUMBER_TO_CHAR;
write_temp[1][i*SIZE_OF_BLOCK+9]=i%10+NUMBER_TO_CHAR;
write_temp[3][i*SIZE_OF_BLOCK+8]=input[i]/10+NUMBER_TO_CHAR;
write_temp[3][i*SIZE_OF_BLOCK+9]=input[i]%10+NUMBER_TO_CHAR;
outputFile << "# Horner ADD Count ----> "<< number_of_sum << "\n";
outputFile << "# Horner Multiply Count ----> "<< number_of_multiply << "\n";
int Horner(int number)
if (INPUT_MAX-1==number)
return input[number];
++number_of_multiply;
++number_of_sum;
return Horner(number+1)*x+input[number];
- EightQueenProblem/서상현 . . . . 4 matches
#define NUM 8
int n = NUM;
int board[NUM][NUM] = {0,};
- ErdosNumbers/문보창 . . . . 4 matches
const int MAX_ERNUM = 100;
pNode head[MAX_ERNUM];
int ernum;
void input_thesis(int num_thesis);
void input_writer(int num_writer);
bool make_map(char name[][MAX_STR], int num);
int serch_erdos_num(char * name);
int num_case, num_thesis, num_writer;
cin >> num_case;
for (int i = 0; i < num_case; i++)
cin >> num_thesis >> num_writer;
input_thesis(num_thesis);
input_writer(num_writer);
for (int i = 0; i < MAX_ERNUM; i++)
for (int i = 1; i < MAX_ERNUM; i++)
ernum = 0;
void input_thesis(int num_thesis)
char ** thesis = new char * [num_thesis];
for (int i = 0; i < num_thesis; i++)
bool * ischeck = new bool[num_thesis];
- Hartals/조현태 . . . . 4 matches
const int NUMBER_NOMAL_DAY=2;
const int NOMAL_DAYS[NUMBER_NOMAL_DAY]={6,7};
int day_simulate(int input_day, int input_number_mans, int* input_mans)
for (j=0;j<NUMBER_NOMAL_DAY;++j)
if (j==NUMBER_NOMAL_DAY)
for (j=0;j<input_number_mans;++j)
- OurMajorLangIsCAndCPlusPlus/locale.h . . . . 4 matches
#define LC_NUMERIC (integer constant expression) 금액이 아닌 숫자 표현(천단위, 소수점, 숫자 그룹핑 등)을 위한 로케일 설정
char* decimal_point; "." LC_NUMERIC
char* grouping; "" LC_NUMERIC
char* thousands_sep; "" LC_NUMERIC
- VendingMachine_참관자 . . . . 4 matches
# define TOKEN_NUM 5
# define MENU_NUM 5
int Menu_num;
void SetMenuM(int i);
for(int i=1;i<=TOKEN_NUM && strcmp( Data[0] , tok[i-1]) ;i++) ;
if(i<=TOKEN_NUM) return i;
void VendingMachine::SetMenuM(int i)
M[Menu_num]=i;
for(int i=0;i<Menu_num;i++){
strcpy(Menu[Menu_num],name);
Price[Menu_num]=price;
Menu_num++;
Menu_num=0;
SetMenuM(321);
SetMenuM(341);
- 로마숫자바꾸기/조현태 . . . . 4 matches
void print_number(int);
int number=-1;
while (number<1 || number>99)
scanf("%d",&number);
print_number(number);
void print_number(int number)
const int NUMBER_DATA[DATA_SIZE]={1,5,10};
if (i+1<DATA_SIZE && number==NUMBER_DATA[i+1]-1)
while (number>=NUMBER_DATA[i])
number-=NUMBER_DATA[i];
getString(Num) when 0 == Num -> "";
getString(Num) when 10 < Num -> "X " ++ getString(Num - 10);
getString(Num) -> lists:nth(Num, ["I ", "II ", "III ", "IV ", "V ", "VI", "VII", "VIII", "IX"]).
- 식인종과선교사문제/조현태 . . . . 4 matches
const int NUMBER_MOVE_TYPE = 5;
const int CAN_MOVE_WHITE[NUMBER_MOVE_TYPE] = {0, 0, 1, 1, 2};
const int CAN_MOVE_BLACK[NUMBER_MOVE_TYPE] = {1, 2, 0, 1, 0};
for (register int i = 0; i < NUMBER_MOVE_TYPE; ++i)
- EffectiveC++ . . . . 3 matches
static const int NUM_TURNS = 5; // 상수 선언! (선언만 한것임)
int scores[NUM_TURNS]; // 상수의 사용.
const int GamePlayer::NUM_TURNS; // 정의를 꼭해주어야 한다.
EnemyTarget() { ++numTargets; }
EnemyTarget(const EnemyTarget&) { ++numTargets; }
~EnemyTarget() { --numTargets; }
static unsigned int numberOfTargets()
{ return numTargets; }
static unsigned int numTargets; // 객체 카운터
unsigned int EnemyTarget::numTargets;
EnemyTank() { ++numTanks; }
{ ++numTanks; }
~EnemyTank() { --numTanks; }
static unsined int numberOfTanks()
{ return numTanks; }
static unsigned int numTanks; // object counter for tanks
unsigned int EnenyTank::numTanks;
EnemyTarget의 객체를 카운트 하기 위해 정적 멤버 변수 numTargets를 두었으며 EnemyTarget을 상속한 EnemyTank에서도[[BR]]
객체의 카운트를 위해 정적 멤버 변수 numTanks를 두었다. [[BR]]
Num a(10);
- Java/CapacityIsChangedByDataIO . . . . 3 matches
private static final int NUMBER_LIMIT_LEN = 10;
private int totalNumOfData = 1000000;
size = getShowedString(size, NUMBER_LIMIT_LEN);
capacity = getShowedString(capacity, NUMBER_LIMIT_LEN);
for (int length = 0; length < totalNumOfData; length++) {
for (int size = 0; size < totalNumOfData; size++) {
- PrimaryArithmetic/1002 . . . . 3 matches
def toList(number):
def toList(numberStr):
return [int(each) for each in numberStr]
def withNullList(numberStr):
result = [0 for each in range(10-len(numberStr))]
numbers = [int(each) for each in numberStr]
return result + numbers
LIMIT_NUMBER = 10
for idx in range(LIMIT_NUMBER-1,-1,-1):
return [0 for each in range(LIMIT_NUMBER-nullCount)]
def numberList(numberStr):
return [int(each) for each in numberStr]
def withNullList(numberStr):
return nullList(len(numberStr)) + numberList(numberStr)
- RandomWalk/임인택 . . . . 3 matches
int sizeX, sizeY, xPos, yPos, NumOfBlock, loop=0;
NumOfBlock--;
NumOfBlock--;
if(NumOfBlock==0)
NumOfBlock=sizeX*sizeY;
int NumberOfUnvisitedBlocks = 0, LoopCount= 0 ;
NumberOfUnvisitedBlocks = sizeX * sizeY;
NumberOfUnvisitedBlocks--;
NumberOfUnvisitedBlocks--;
if(NumberOfUnvisitedBlocks==0)
#define NUMOFDIRECTIONS 8
moveRoachRecursively(rand()%NUMOFDIRECTIONS);
static int numOfUnVstdPlces = sizeX*sizeY;
numOfUnVstdPlces--;
if( numOfUnVstdPlces != 0) // choose next direction
moveRoachRecursively((unsigned)(rand())%NUMOFDIRECTIONS);
int randNum;
randNum = rand.nextInt()%dir_x.length;
_board.walkOn(dir_x[randNum], dir_y[randNum]);
private int _numOfVisited;
- 간단한C언어문제 . . . . 3 matches
float num;
num = atof(data);
printf("%f", num);
옳지않다. atof함수로 float변환은 되었지만, atof함수의 프로토 타입이 있는 헤더를 추가하지 않았기 때문에 int형으로 return된다. 즉, num엔 숫자 123이 담긴다. ANSI C99에서는 프로토타입이 선언되지 않으면 컴파일되지 않도록 변했다. - [이영호]
#define NUM 100
int num1;
int num2;
#define NUM 200
test.num1 = 100;
test.num2 = 200;
printf("%d", test.num1+test.num2);
옳지 않다. NUM 상수가 2번 define 되었다. 이 경우 나중 define된 200으로 처리된다. - [이영호]
int mul(int num)
return num*num;
- Chopsticks/문보창 . . . . 2 matches
#define MAX_NUM 1000000000
d[1][nStick] = MAX_NUM;
- Counting/하기웅 . . . . 2 matches
#define MAX_NUM 1000
BigInteger number[MAX_NUM+1];
void init(int num)
number[0]=1;
number[1]=2;
number[2]=5;
for(i=3; i<num+1; i++)
number[i]=2*number[i-1]+number[i-2]+number[i-3];
cout<< number[input] <<endl;
- CuttingSticks/문보창 . . . . 2 matches
#define MAX_NUM 0x7fffffff
static int lenStick, numCut;
cin >> numCut;
for (int i = 1; i <= numCut; i++)
cut[0] = 0, cut[numCut+1] = lenStick;
for (int i = 0; i <= numCut; i++)
for (int step = 1; step <= numCut; step++)
for (int i = 0; i <= numCut - step; i++)
min = MAX_NUM;
return d[0][numCut+1] - lenStick;
- EightQueenProblem/허아영 . . . . 2 matches
#define QUEEN_MAX_NUM 8
unsigned int queenNum = 0;
if(queenNum == QUEEN_MAX_NUM)
- JTDStudy/첫번째과제/원명 . . . . 2 matches
private int correctNumber;
oneGame.setCorrectNumber();
public void setCorrectNumber()
int setNumber = 0;
setNumber = (int) (Math.random() * 10);
}while (setNumber == 0);
correctNumber = setNumber;
setNumber = (int) (Math.random() * 10);
}while (correctNumber == setNumber);
correctNumber = correctNumber * 10 + setNumber;
setNumber = (int) (Math.random() * 10);
}while (((int)(correctNumber / 10)) == setNumber
|| ((int)(correctNumber % 10)) == setNumber);
correctNumber = correctNumber * 10 + setNumber;
String input = JOptionPane.showInputDialog("Enter three different number\n");
int compareResult = 0, cCorrect = correctNumber;
cCorrect = correctNumber;
JOptionPane.showMessageDialog(null, "You are right!\n Answer is " + correctNumber);
void setCorrectNumber(int in) {
correctNumber = in;
- ProgrammingPearls/Column3 . . . . 2 matches
const int NUM_ITEMS = 10;
for(int i = 0 ; i < NUM_ITEMS ; ++i)
- TAOCP/Exercises . . . . 2 matches
NUM 1 - 0 0 10000
NUM 1 - 0 0 10000
- XMLStudy_2002/Start . . . . 2 matches
5. PHONENUMBER 엘리먼트에 OFFICE 또는 HOME 또는 MOBILE 엘리먼트 중에서 하나가 위치하거나 또는 오지 않는 예
<!ELEMENT PHONENUMBER (OFFICE|HOME|MOBILE)?>
- 반복문자열/최경현 . . . . 2 matches
#define NUMBER_OF_REPEAT 5
for(i=0;i<NUMBER_OF_REPEAT;i++)
- 새싹교실/2012/AClass/4회차 . . . . 2 matches
int num=0;
for(j=0 ; j<=i ; j++) arr[i][j]=++num;
for(j=i ; j>=0 ; j--) arr[i][j]=++num;
AA num=500;
int num;
printf("%s %d %d\n",aclass[i].name,aclass[i].num,aclass[i].age);
typedef int Num;
Num a=10;
먼저 typedef을 전역 변수 지역에 선언 해준다. 예제에서는 int형을 NUM으로 명칭을 바꾼 것이다.
그리고 보통 자료형 int 처럼 사용하면 된다. NUM을 이용한 변수 값과, int를 이용한 변수의 값을 서로 연산을 해보면 정확하게 값이 나온다.
- 이승한/임시 . . . . 2 matches
* ON_COMMAND_RANGE(NUMBERBUTTONS_BASEID, NUMBERBUTTONS_BASEID+24, OnCalcButtonPressed)
- 임인택/코드 . . . . 2 matches
BOOL bChangedHangulMode = (dwConversion==IME_CMODE_ALPHANUMERIC);
ImmSetConversionStatus(himc, IME_CMODE_ALPHANUMERIC, dwSentence);
- 중위수구하기/문보창 . . . . 2 matches
==== Number.java ====
public class Number
final int SENTINEL_NUM = -999;
public Number()
public void inputNumber()
if (elements[i] == SENTINEL_NUM)
public int findMidiumNumber()
==== {{{~cpp TestNumber.java}}} ====
public class testNumber
Number number = new Number();
number.inputNumber();
int midNum = number.findMidiumNumber();
System.out.println(midNum);
- 최소정수의합/조현태 . . . . 2 matches
const int COMPARENUM=3000;
while (COMPARENUM>sum(n))
int sum(int end_number)
if (1==end_number)
return end_number*(end_number+1)/2;
minSum(I, SumNum) when SumNum >= 3000 -> {I - 1, SumNum};
minSum(I, SumNum) -> minSum(I + 1, SumNum + I).
- 최소정수의합/최경현 . . . . 2 matches
#define COMPARE_NUMBER 3000
int number = 1 ; // 시작 숫자는 1
int minimumNumber;
sum+=number;
if(sum>=COMPARE_NUMBER)
minimumNumber = number;
number++;
printf("min number = %d , sum = %d ",minimumNumber,sum);
- 2dInDirect3d/Chapter1 . . . . 1 match
3. [IN] 두번째 인자는 플래그이다. 0이나 D3D_ENUM_NO_WHQL_LEVEL을 넣을 수 있지만, 대개 0을 넣는다.
== Enumeration Display Mode ==
HRESULT IDirect3D8::EnumAdapterModes(
- 5인용C++스터디/키보드및마우스의입출력 . . . . 1 match
VK_NUMLOCK / 90 / Num Lock
- AdventuresInMoving:PartIV/김상섭 . . . . 1 match
#define MAX_NUM 1000000000
static int numStation; /* 주유소 수 */
numStation = 1;
station[numStation].length = 0;
station[numStation].price = 0;
numStation++;
cin >> station[numStation].length >> station[numStation].price;
numStation++;
station[numStation].length = totalLength;
station[numStation].price = 0;
while(now != numStation)
int numCase;
cin >> numCase;
for (int i = 0; i < numCase; i++)
if (i != numCase - 1)
- GDBUsage . . . . 1 match
FILE:LINENUM, to edit at that line in that file,
- Ieee754Standard . . . . 1 match
* [http://docs.sun.com/htmlcoll/coll.648.2/iso-8859-1/NUMCOMPGD/ncg_goldberg.html What Every Computer Scientist Should Know About Floating-Point Arithmetic] (''강추'')
전산/컴공과 학생이 NumericalAnalysisClass를 통틀어서 오로지 한가지만 배워야 한다면 나는 부동소수점 연산을 들고 싶다. --JuNe
- LIB_1 . . . . 1 match
LIB_VRAM_NUM(26,12,LIB_INT_COUNT,0x07);
- LinuxSystemClass/Exam_2004_1 . . . . 1 match
NUMA
- TAOCP/BasicConcepts . . . . 1 match
NUM은 rAX를 가지고 숫자로 바꾸어 rA에 저장한다. 각 바이트가 한 자리로 바뀌는데, 일의 자리만 가지고 바꾼다(10 -> 0, 23->3 )
- 김재현 . . . . 1 match
#define TITLE "[ LOTTO RANDOM NUMBER GENERATOR ]\n"
int ThreeNOneTwoNum(int aInput, int aInput2);
int num1, num2, cycle_length;
printf ("input 2 nums : \n ");
scanf ("%d%d",&num1,&num2);
printf ("%d", ThreeNOneTwoNum(num1, num2));
int ThreeNOneTwoNum(int aInput, int aInput2){
for (num1;num1<=num2;num1++)
cycle_length = ThreeNOne(num1);
- 데블스캠프2011/넷째날/Git/권순의 . . . . 1 match
char inputArgv[ARG_NUM][ARG_SIZE] = {0,};
- 새싹교실/2012/주먹밥/이소라때리기게임 . . . . 1 match
#define USERNUM 1 //유저 갯수
- 정수민 . . . . 1 match
void winning_number();
void make_number(int k);
winning_number();
void make_number(int k){
make_number(k);
make_number(k);
winning_number();
void winning_number(){
printf("n== LOTTO RANDOM NUMBER GENERATOR ==nnEnter the game count : ");
printf("Enter a number for score[%d] : ", i);
- 허아영/C코딩연습 . . . . 1 match
int pattern_num;
scanf("%d", &pattern_num);
for(i = 1; i <= pattern_num; i++)
for(blank = 0; blank < pattern_num - i; blank++)
for(i = 1; i < pattern_num; i++)
for(j = 0; j < 2*(pattern_num-i)-1; j++)
< LOTTO RANDOM NUMBER GENERATOR >
Enter a number for score[0] : 80
Enter a number for score[1] : 50
Enter a number for score[2] : 99
Enter a number for score[3] : 74
Enter a number for score[4] : 88
int calcul(int num);
int calcul(int num)
num /= 2;
return num;
int num, result;
scanf("%d", &num);
result = fac(num);
int i = 0, countBig = 0, countSmall = 0, countSpe = 0, countNum = 0;
Found 58 matching pages out of 7555 total pages (5000 pages are searched)
You can also click here to search title.
