- 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++)
- 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;
- 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,};
- 데블스캠프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);
- 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];
- 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;
- 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];
- 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
- 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);
- 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;
- 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
BOOL bChangedHangulMode = (dwConversion==IME_CMODE_ALPHANUMERIC);
ImmSetConversionStatus(himc, IME_CMODE_ALPHANUMERIC, dwSentence);
- 최소정수의합/최경현 . . . . 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);
- 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
- 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 //유저 갯수
Found 26 matching pages out of 7557 total pages (2130 pages are searched)
You can also click here to search title.
