- RandomWalk2/조현태 . . . . 36 matches
#define NUMBER_PLAYER 2
string moveRotate[NUMBER_PLAYER];
int myPointX[NUMBER_PLAYER];
int myPointY[NUMBER_PLAYER];
for (int i = 0; i < NUMBER_PLAYER; ++i)
int moveNum[NUMBER_PLAYER] = {0,};
for (register int i = 0; i < NUMBER_PLAYER; ++i)
for (register int j = 0; j < NUMBER_PLAYER; ++j)
for (register int i = 0; i < NUMBER_PLAYER; ++i)
#define NUMBER_PLAYER 999
#define END_NUMBER 999
int numberPlayer = 0;
string moveRotate[NUMBER_PLAYER];
int myPointX[NUMBER_PLAYER];
int myPointY[NUMBER_PLAYER];
for (int i = 0; i < NUMBER_PLAYER; ++i)
if (END_NUMBER == myPointX[i])
++numberPlayer;
int moveNum[NUMBER_PLAYER] = {0,};
for (register int i = 0; i < numberPlayer; ++i)
- RandomWalk2/Insu . . . . 12 matches
#ifndef _RANDOM_WALK_H
#define _RANDOM_WALK_H
class RandomWalkBoard
RandomWalkBoard(int nRow, int nCol, int nCurRow, int nCurCol, char *szCourse, int DirectX[], int DirectY[]);
~RandomWalkBoard();
#include "RandomWalkBoard.h"
RandomWalkBoard::RandomWalkBoard(int nRow, int nCol, int nCurRow, int nCurCol, char *szCourse, int DirectX[], int DirectY[])
void RandomWalkBoard::CourseAllocate(char *szCourse)
void RandomWalkBoard::BoardAllocate()
void RandomWalkBoard::CourseFree()
void RandomWalkBoard::DirectionAllocate(int x[], int y[])
void RandomWalkBoard::BoardFree()
RandomWalkBoard::~RandomWalkBoard()
void RandomWalkBoard::ShowStatus()
void RandomWalkBoard::SetArrayAsZero()
bool RandomWalkBoard::CheckCompletelyPatrol()
void RandomWalkBoard::IncreaseVisitCount()
void RandomWalkBoard::IncreaseTotalVisitCount()
void RandomWalkBoard::StartProcedure()
bool RandomWalkBoard::CheckEndCourse()
- 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)
sum += testNumber / devideNum;
- 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,};
- 중위수구하기/조현태 . . . . 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";
while (input(input_number)) 요거 이해하는데 버벅거렸다; 입력값을 -999를 입력받을때까지 계속 입력받는걸로 했구낭ㅇㅅㅇ
if(input(input_number)==0) break; // 또는 if(!input(input_number)) break;
- 강희경/메모장 . . . . 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++){
Upload:RandomWalk.zip
int beverageNumber;
scanf("%d", &beverageNumber);
}while(beverageNumber < 0 || beverageNumber >=3);
printf("%C 음료수가 선택되었습니다\n", beverage[beverageNumber]);
if(money >= beveragePrice[beverageNumber]){
- 숫자를한글로바꾸기/조현태 . . . . 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;
char number;
number=getche();
if (47<number && number<58)
number-=CHAR_TO_NUMBER;
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)
const int CHAR_TO_NUMBER=48;
int input_number[13];
- 호너의법칙/조현태 . . . . 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];
- 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)
- 김재현 . . . . 4 matches
#define TITLE "[ LOTTO RANDOM NUMBER GENERATOR ]\n"
- 로마숫자바꾸기/조현태 . . . . 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];
- 식인종과선교사문제/조현태 . . . . 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)
- 정수민 . . . . 4 matches
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코딩연습 . . . . 4 matches
< 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
- Java/CapacityIsChangedByDataIO . . . . 3 matches
private static final int NUMBER_LIMIT_LEN = 10;
size = getShowedString(size, NUMBER_LIMIT_LEN);
capacity = getShowedString(capacity, NUMBER_LIMIT_LEN);
- 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)
- 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++)
- 이승한/임시 . . . . 2 matches
* ON_COMMAND_RANGE(NUMBERBUTTONS_BASEID, NUMBERBUTTONS_BASEID+24, OnCalcButtonPressed)
- 최소정수의합/최경현 . . . . 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);
- 데블스캠프2012/첫째날/후기 . . . . 1 match
* 당신을 위한 최고의 솔루션 - [http://random.org/ RANDOM.ORG]
Found 25 matching pages out of 7555 total pages (5000 pages are searched)
You can also click here to search title.
