- PowerOfCryptography/조현태 . . . . 171 matches
unsigned __int64 such_target_number(unsigned __int64 mokpyo, unsigned __int64 gaesu)
unsigned __int64 intput_number=0;
while (intput_number<1)
scanf("%I64d",intput_number);
if (1==intput_number)
while (intput_number<gob_gaesu || gob_gaesu<1)
unsigned __int64 answer=such_target_number(intput_number,gob_gaesu);
class save_number{
unsigned __int64 number;
save_number *next;
save_number *prv;
save_number(int input_number, save_number *who_next)
number=input_number;
save_number(save_number *input_number, save_number *who_next)
number=0;
plus_number(input_number);
~save_number()
void link(save_number *new_prv)
save_number *get_prv()
save_number *get_next()
- CompleteTreeLabeling/조현태 . . . . 140 matches
int number;
int get_number_nodes(int , int);
int degree, deep, number_nodes, answer_number;
number_nodes=get_number_nodes(degree,deep);
line=(block**)malloc(sizeof(block*)*number_nodes);
process_block(&answer_number, 0, number_nodes, degree, deep, line);
printf("결과 : %dn",answer_number);
for (register int i=0; i<number_nodes; ++i)
int get_number_nodes(int degree, int deep)
void change(int* number_a,int* number_b)
int temp=*number_a;
*number_a=*number_b;
*number_b=temp;
block* create_block(int input_number, int input_deep, int input_all_deep, int input_degree, block** line, block* input_head)
line[input_number]=temp_block;
temp_block->number=input_number+1;
temp_block->maximum=get_number_nodes(input_degree, input_all_deep)-input_degree*(get_number_nodes(input_degree, input_all_deep-input_deep));
temp_block->next[i]=create_block(i+get_number_nodes(input_degree, input_deep)+input_degree*(input_number-get_number_nodes(input_degree, input_deep-1)),input_deep+1,input_all_deep,input_degree, line, temp_block);
void process_block(int* number, int block_number, int max_nodes, int input_degree, int input_deep, block** line)
block* temp_block=line[block_number];
- BusSimulation/조현태 . . . . 124 matches
station::station(int input_station_number, char *input_name, int input_percent, int input_size )
number_man=0;
station_number=input_station_number;
void station::make_people(int numbers_station)
if (station_size!=number_man && numbers_station!=station_number+1)
humans[number_man]=new man(station_number,station_number+rand()%(numbers_station-station_number-1)+1);
++number_man;
if (0==number_man)
for (register int i=1; i<number_man; ++i)
--number_man;
return station_number;
void station::act(int numbers_station)
make_people(numbers_station);
cout << number << "번 버스가 " << where << "로 이동하였습니다.\n";
humans[number_man]=in_people;
++number_man;
cout << number << "번 버스가 승객을 승차하였습니다.\n";
for (register int i=0; i<number_man; ++i)
for (register int j=i+1; j<number_man; ++j)
--number_man;
- 숫자를한글로바꾸기/허아영 . . . . 117 matches
int num_len(int number);
void number_data_input(int number, int number_data[10]);
int number, number_len, i = 0;
int number_data[10];
char num_position[15] = " 십백천만"; //<-사실 여기도 그냥 "십백천만"이라고 해도 된다.
scanf("%d", &number);
if(number == 0)
number_len = num_len(number);
number_data_input(number, number_data);
while(i < number_len)
if(number_data[i] == 0)
printf("%c", korean_data[2*number_data[i] - 2]);
printf("%c", korean_data[2*number_data[i] - 1] );
printf("%c", num_position[2*(number_len - i - 1)]);
printf("%c", num_position[2*(number_len - i - 1)+1]);
int num_len(int number)
while(number > 9)
number /= 10;
void number_data_input(int number, int number_data[10])
int number_len;
- ErdosNumbers/조현태 . . . . 73 matches
int number_books, number_writers;
cin >> number_books >> number_writers;
for (int i=0; i<number_books; ++i)
datas->process_erdos_number(TARGET_NAME);
for (int i=0; i<number_writers; ++i)
int number_line;
int* line_numbers;
int get_number_line();
int get_line_number(int );
int number_mans, number_books;
void process_erdos_number(human_data* );
void process_erdos_number(char* );
number_line=0;
line_numbers=NULL;
if (line_numbers!=NULL)
delete line_numbers;
void human_data::input_line(int input_line_number)
int* temp_numbers=new int[number_line+1];
for (register int i=0; i<number_line; ++i)
temp_numbers[i]=line_numbers[i];
- 진법바꾸기/김영록 . . . . 50 matches
static int input_10,input_num;
int get_maxjarisu(int num1,int num2);
int get_jegob(int num,int count);
void behavior(int num1,int num2);
int get_count(int num1,int num2,int num3);
int get_maxjarisu(int num1,int num2)// num1 = 숫자 num2 = 진법
dividing = get_jegob(num2,count);
if (num1>=dividing){
int get_count(int num1,int num2,int num3) //num1 = 숫자 ,num2 = 진법,num3 = 자리수
if (num3 ==1){
return num1 % num2;
temp = num1 % get_jegob(num2,num3-1);
num1 = num1 - temp; //나머지를 없앰으로서 소숫점을 남기지 않는다.
return (num1 % get_jegob(num2,num3))/get_jegob(num2,num3-1);
int get_jegob(int num,int count) //num =제곱할수 num2 =제곱할횟수
sum=sum*num;
void behavior(int num1,int num2) //num1 = 숫자 ,num2 = 나눌수
for (i=get_maxjarisu(num1,num2);i>0;i--)
temp = get_count(num1,num2,i);
scanf("%d",&input_num);
- 빵페이지/도형그리기 . . . . 49 matches
int num;
cin >> num;
for (int i = 1; i < num + 1; i++)
for (int a = num + 1; a > i; a--)
for (int k = 1; k < num + 1; k++)
for (int l = num + 1; l > k; l--)
for (int m = 1; m < num + 1; m++)
for (int n = num; n > m; n--)
for (int p = 1; p < num + 1; p++)
for (int r = num + 1; r > p; r--)
int num;
cin >> num;
for (int i = 1; i < num + 1; i++)
for (int a = num + 1; a > i; a--)
for (int l = num + 1; l > i; l--)
for (int n = num; n > i; n--)
for (int r = num + 1; r > i; r--)
num = input("plz input number of asterisk: ")
format = ( '%%%ds '% (num) ) * 4
for odd,even in zip(range(1,num+1), range(num,0,-1)):
- 빵페이지/숫자야구 . . . . 47 matches
int num[3];
while(num[0]==num[1] || num[1]==num[2] || num[0]==num[2])
num[i] = rand()%9 +1;
cout <<"컴퓨터가 생각한 숫자 : " << num[0] << num[1] << num[2] << "\n";
if(num[i]==person[j])
int rand_num[3]; //난수생성에 사용될 변수입니다.
int i, j, k, num; //i,j,k 는 포문용, num 은 사용자 입력입니다.
int player_num[3]; //사용자가 입력한 값을 각 자리 숫자로 나눠서 rand_num과 비교하기 쉽게 만듭니다.
rand_num[i] = rand()%10; //한 자리수 난수를 생성합니다.
if (i == 1 && rand_num[i] == rand_num[0])
else if (i == 2 && (rand_num[i] == rand_num[0] || rand_num[i] == rand_num[1]))
cin >> num;
ext = num;
if (num < 100 || num > 999) {
player_num[j] = ext%10;
if (player_num[j] == player_num[k]) {
if (rand_num[j] == player_num[k] && j==k) strike++;
if (rand_num[j] == player_num[k] && j!=k) ball++;
int num[3];
num[i]=rand()%9+1;
- 새싹교실/2012/해보자 . . . . 47 matches
2. swap(int num1, int num2)함수를 구현하시오. 함수 호출을 배우지 않았기 때문에, 그리고 포인터를 아직 배우지 않았기 때문에 기본적인 코드를 제공합니다.
void swap(int num1,int num2);
int num1, num2;
scanf("%d %d",&num1,&num2);
printf("num1: %d, num2: %d\n",num1, num2);
swap(num1,num2);
void swap(int num1,int num2){
printf("after swap\nnum1: %d, num2: %d\n",num1, num2);
int num;
scanf_s("%d",&num);
if(num%2==0)
int number;
scanf_s("%d",&number);
while(number!=-1){
sum += number;
scanf_s("%d",&number);
int number;
scanf_s("%d",&number);
while(number!=-1){
if(number%2==0){
- NumberBaseballGame/jeppy . . . . 45 matches
void make_number(char *p); /* 임의 세자리 숫자를 생성하는 함수 */
void check_num(char *dest, char *src); /* 입력된 숫자와 비밀숫자를 맞춰보는 함수 */
char hidden_num[3] = {'\0',};
char number_log[10][4] = {'\0',};
char num[3];
// make hidden_number;
make_number(hidden_num);
printf("%d input number : ", i+1);
scanf("%s", &num);
if (num[0] == num[1] || num[0] == num[2] || num[1] == num[2])
else strncpy(number_log[i], num, 3);
//printf("%d : %s\n", i, number_log[i]);
check_num(number_log[i], hidden_num);
printf("You lose~\nThe answer is %c%c%c", hidden_num[0], hidden_num[1], hidden_num[2]);
void make_number(char *p) {
int number[3];
int i, temp_i, num, j;
printf("Make number..\n");
num = rand() % 10;
if (i<1) number[i] = num;
- 데블스캠프2009/목요일/연습문제/MFC/정종록 . . . . 44 matches
enum { IDD = IDD_ABOUTBOX };
m_number = 0.0;
DDX_Text(pDX, IDC_EDIT3, m_number);
m_number = m_number*10 + 2;
m_number = m_number*10 + 3;
m_number = m_number*10 + 1;
m_number = m_number*10 + 4;
m_number = m_number*10 + 5;
m_number = m_number*10 + 6;
m_number = m_number*10 + 7;
m_number = m_number*10 + 8;
m_number = m_number*10 + 9;
m_number = m_number*10;
temp = m_number;
m_number = 0;
temp = m_number;
m_number = 0;
m_number = m_number + temp;
m_number = m_number - temp;
m_number = m_number * temp;
- ErdosNumbers/문보창 . . . . 42 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];
- ContestScoreBoard/문보창 . . . . 40 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;
- JTDStudy/첫번째과제/정현 . . . . 40 matches
public void testNumberCreation() {
String number= extractor.getRandomBall();
assertEquals(3, number.length());
assertFalse(baseBall.duplicated(number));
game.inputNumber("152");
game.inputNumber("123");
String number= input.nextLine();
if(baseBall.isProper(number)) {
baseBall.inputNumber(number);
private String number;
number= "000";
public void inputNumber(String string) {
number= string;
return beholder.getStrikeCount(number);
return beholder.getBallCount(number);
public boolean isProper(String number) {
Integer.parseInt(number);
return number.length()==3 && !duplicated(number);
public boolean duplicated(String number) {
char[] chars= number.toCharArray();
- 주민등록번호확인하기/조현태 . . . . 38 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)
- MedusaCppStudy/세람 . . . . 36 matches
int num;
cin >> num;
int rows = num ;
int cols = num ;
cols=num*2-1;
int num;
cin >> num ;
int rows = num ;
int cols = num ;
cols=num*2-1;
if(c==num-r-1)
vector<int> number;
int num;
while(cin >> num)
number.push_back(num);
int size= number.size();
sort(number.begin(), number.end());
while(i < number.size() && i < 4)
cout << number[i] << ", ";
cout << number[size - 4] << ", " << number[size - 3] << ", "
- ReverseAndAdd/허아영 . . . . 36 matches
unsigned int numLength(unsigned int num)
while(num >= 10)
num /= 10;
bool isPalindrome(unsigned int *num, unsigned int length)
if(num[i] == num[length-i-1])
unsigned int ReverseAndAdd(unsigned int *num, unsigned int length)
unsigned int i, reverseNum = 0, Num = 0;
temp[i] = num[length-i-1];
reverseNum += temp[i] * pow(10, length-i-1); // 모아서 더하기
Num += num[i] * pow(10, length-i-1);
return (Num+reverseNum);
unsigned int addNum, length, i, turn = 0, testCaseNum;
unsigned int num;
unsigned int * store_numbers;
cin >> testCaseNum;
while(testCaseNum >= 1)
cin >> num;
store_numbers = new unsigned int[numLength(num)];
for(i = 0; i < numLength(num); i++) // 나누어 넣기
store_numbers[i] = num / pow(10, (numLength(num)-i-1));
- TheJavaMan/지뢰찾기 . . . . 35 matches
private int row, col, numMines;
private int numClick; // 왼쪽 버튼 누른 수
// numClick + numMines == row * col => 겜종료
private int numFlags; // 깃발 꼿은 수
// numMines - numFlags = 남은 폭탄 수
numLeftMines = new JTextField(3),
setMapSize(row, col, numMines);
numLeftMines.setText(String.valueOf(numMines));
top.add(numLeftMines, BorderLayout.WEST);
numLeftMines.setText(String.valueOf(numMines));
numMines = nm;
while (i < numMines) {
for (int i = 0; i < numMines; i++)
numFlags = 0;
numClick = 0;
private int numAroundMines; // 0~8
numAroundMines = nam;
numFlags--;
numLeftMines.setText(String.valueOf(numMines - numFlags));
numFlags++;
- 데블스캠프2009/목요일/연습문제/MFC/김태욱 . . . . 33 matches
enum { IDD = IDD_ABOUTBOX };
m_number = 0.0;
DDX_Text(pDX, IDC_EDIT2, m_number);
void CZxczxcDlg::AddNum(int num)
operand = operand * 10 + num;
m_number = operand;
underdot = underdot * 10 + num;
m_number = operand + underdot;
m_number = m_number * 10 + 1;
AddNum(1);
AddNum(2);
AddNum(3);
AddNum(4);
AddNum(5);
AddNum(6);
AddNum(7);
AddNum(8);
AddNum(9);
AddNum(0);
int operatornum;
- 3N+1Problem/황재선 . . . . 32 matches
int findMaxCycle(int aNum, int aCount);
int inputNum[2];
cin >> inputNum[0] >> inputNum[1];
int interNum = inputNum[0];
while (interNum <= inputNum[1])
temp = findMaxCycle(interNum, count);
interNum++;
int findMaxCycle(int aNum, int aCount)
if (aNum == 1)
if (aNum % 2)
aNum = 3 * aNum + 1;
aNum = aNum / 2;
findMaxCycle(aNum, aCount);
def compute(self, num):
while (num != 1):
if num % 2:
num = 3 * num + 1
num /= 2
if str(num) in self.cycleDic:
return self.cycleLength + self.cycleDic[str(num)]
- MedusaCppStudy/신애 . . . . 32 matches
int num;
cin >> num;
int rows = num;
int cols = num * 2 - 1;
int num;
cin >> num;
int rows = num;
int cols = num * 2 - 1;
if ( c == num - 1)
if (c == num - 1 - r || c == num - 1 + r)
vector<int> number;
number.push_back(x);
sort(number.begin (),number.end());
cout << number[number.size() - 4] << "," << number[number.size() - 3] << "," <<number[number.size() - 2] << "," <<number[number.size() - 1];
for ( int i=0; i < number.size() ;i++)
cout << number[i] << ",";
int num;
cin >> num;
vector< vector <int> > board(num);
for ( int i = 0 ; i < num ; i++)
- Star/조현태 . . . . 31 matches
int bigNumber[12];
int minimumNumber = 0;
int Calculate(int number);
bool IsItCan(int number = 0, int sum = 0)
if (12 == number)
minimumNumber = sum;
else if (minimumNumber > sum)
minimumNumber = sum;
if (isCanPut && minimumNumber < sum)
for (register int i = 0; i < (int)calculatePoint[bigNumber[number]].size(); ++i)
for (register int j = 0; j < (int)lines[number].size(); ++j)
if (calculatePoint[bigNumber[number]][i] == lines[number][j])
IsItCan(number + 1, sum);
for (register int i = 0; i < (int)lines[number].size(); ++i)
if (bigNumber[number] <= points[lines[number][i]])
if (calculatePoint[j][k] == lines[number][i])
calculatePoint[bigNumber[number]].push_back(lines[number][i]);
IsItCan(number + 1, sum + bigNumber[number]);
calculatePoint[bigNumber[number]].pop_back();
return minimumNumber;
- 데블스캠프2009/목요일/연습문제/MFC/서민관 . . . . 31 matches
enum { IDD = IDD_ABOUTBOX };
m_number = 0.0;
DDX_Text(pDX, IDC_EDIT2, m_number);
m_number = m_number * 10 + 1;
m_number = m_number * 10 + 2;
m_number = m_number * 10 + 3;
m_number = m_number * 10 + 4;
m_number = m_number * 10 + 5;
m_number = m_number * 10 + 6;
m_number = m_number * 10 + 7;
m_number = m_number * 10 + 8;
m_number = m_number * 10 + 9;
temp = m_number;
m_number = 0;
temp = m_number;
m_number = 0;
m_number = temp + m_number;
m_number = temp - m_number;
m_number = 0;
enum { IDD = IDD_ABOUTBOX };
- JollyJumpers/황재선 . . . . 29 matches
int [] nums;
public int [] inputNumbers() {
nums = new int[len];
nums[i] = Integer.parseInt(ch[i]);
return nums;
int len = nums.length - 1;
differValue[i] = Math.abs(nums[i+1] - nums[i]);
nums = sort(differValue);
return nums;
private int[] sort(int[] aNum) {
for(int i = 0; i < aNum.length; i++)
for(int j = 0; j < aNum.length; j++)
if (aNum[i] < aNum[j])
aNum = swap(aNum, i, j);
return aNum;
private int[] swap(int [] aNum, int i, int j) {
int temp = aNum[i];
aNum[i] = aNum[j];
aNum[j] = temp;
return aNum;
- One/김태형 . . . . 29 matches
int number; /*각각의 수*/
for(number=0; number<=10; number=number+2)
printf("%d ", number);
int number=1; /* 1부터 10까지 각각의 수*/
while(number<=10)
printf("%d\n", number);
++number;
int number; /* 각각의 수 */
for(number=1; number<11; ++number)
{ if(number==3 || number==4 || number==7 || number==9)
printf("%d ", number);
int number; /*1부터 10까지 각각의 수*/
for(number=1; number<=10; ++number)
total=total+number;
int number; /*입력받을 숫자*/
scanf("%d", &number);
if(number==1)
else if(number==2)
else if(number==3)
- [Lovely]boy^_^/USACO/MixingMilk . . . . 28 matches
void InputInitData(int& suf, int& numf, map<int,int>& data, vector<int>& numlist);
int Process(int& suf, int& numf, map<int,int>& data, vector<int>& numlist);
void OutputData(int& numf, map<int,int>& data, vector<int>& numlist);
int numf, suf;
vector<int> numlist;
InputInitData(suf, numf, data, numlist);
fout << Process(suf, numf, data, numlist) << endl;
void InputInitData(int& suf, int& numf, map<int,int>& data, vector<int>& numlist)
fin >> numf;
for(int i = 0 ; i < numf ; ++i)
numlist.push_back(cost);
sort(numlist.begin(), numlist.end());
int Process(int& suf, int& numf, map<int,int>& data, vector<int>& numlist)
for(int i = 0 ; i < numlist.size() ; ++i)
if(suf > until + data[numlist[i]])
ret += numlist[i] * data[numlist[i]];
until += data[numlist[i]];
if(whenstop < numlist.size())
ret += numlist[whenstop] * (suf - until);
- WinampPluginProgramming/DSP . . . . 27 matches
int modify_samples1(struct winampDSPModule *this_mod, short int *samples, int numsamples, int bps, int nch, int srate);
int modify_samples2(struct winampDSPModule *this_mod, short int *samples, int numsamples, int bps, int nch, int srate);
int modify_samples3(struct winampDSPModule *this_mod, short int *samples, int numsamples, int bps, int nch, int srate);
int modify_samples4(struct winampDSPModule *this_mod, short int *samples, int numsamples, int bps, int nch, int srate);
int modify_samples5(struct winampDSPModule *this_mod, short int *samples, int numsamples, int bps, int nch, int srate);
int modify_samples1(struct winampDSPModule *this_mod, short int *samples, int numsamples, int bps, int nch, int srate)
s = numsamples*nch;
return numsamples;
int modify_samples3(struct winampDSPModule *this_mod, short int *samples, int numsamples, int bps, int nch, int srate)
int rlen =numsamples*bps/8*nch;
if (quit_pitch || g_pitch==100) return numsamples;
n=(numsamples*pitch)/1000;
dindex=(numsamples<<14)/n;
return numsamples;
int modify_samples4(struct winampDSPModule *this_mod, short int *samples, int numsamples, int bps, int nch, int srate)
int rlen =numsamples*bps/8*nch;
n=(numsamples*pitch)/1000;
dindex=(numsamples<<14)/n;
return numsamples;
int modify_samples5(struct winampDSPModule *this_mod, short int *samples, int numsamples, int bps, int nch, int srate)
- 피보나치/조현태 . . . . 26 matches
int fibonacci1( int prv_answer,int sub_answer, int number )
if( number!=0)
prv_answer=fibonacci1(sub_answer+prv_answer, prv_answer, number-1 );
void prin(unsigned int num, unsigned int prv_answer )
cout << num <<"번째 값은 "<< prv_answer <<"입니다.\n";
void fibonacci2( unsigned int prv_answer,unsigned int sub_answer, unsigned int number, int call)
unsigned int num=1;
while (number!=0)
--number;
++num;
if (0==call && number>0)
prin (num, prv_answer);
prin (num, prv_answer);
unsigned int number;
cin >> number;
//cout << fibonacci1( 1 , 0 , number-1) << "\n";
cout << fibonacci2( 1 , 0 , number-1) << "\n";
cin >> number;
cout << number <<"번째 숫자까지의 값을 출력하겠습니까?(1.예 2.아니오)";
fibonacci2( 1 , 0 , number-1, call-1);
- 데블스캠프2009/목요일/연습문제/다빈치코드/박준호 . . . . 25 matches
int num;
int cardnum = 3;
int number;
void CmpNum();
for(index = 0; index <= cardnum; index++)
CmpNum();
for(index = 0; index <= cardnum; index ++)
printf("%c%d ",handsort[index].color1, handsort[index].number);
scanf("%c %d", &color, &num);
handsort[index].number = w_block[num];
handsort[index].number = b_block[num];
b = handsort[i].number;
handsort[i].number = handsort[i+1].number;
handsort[i+1].number = b;
void CmpNum(){
int i =0, j = cardnum;
for(j = (cardnum - 1); j >= 0; j--)
if(handsort[i].number >= handsort[(i+1)].number)
if(handsort[i].number == handsort[i+1].number)
a = handsort[i].number;
- 3N 1/김상섭 . . . . 24 matches
int num;
unsigned long num;
num = i;
while(num != 1)
if(num % 2 == 0)
temp.num = num /=2;
if(num > Min && num < Max && table[num] == 0)
else if(num % 2 != 0)
temp.num = num = num*3 + 1;
if(num < 0)
if(num > Min && num < Max && table[num] == 0)
for(j = data[k].num; j < Max; j *=2)
int i, j, k, max_num;
max_num = 0;
if(table[k] > max_num)
max_num = table[k];
cout << max_num << endl;
- 3N+1/김상섭 . . . . 24 matches
int num;
unsigned long num;
num = i;
while(num != 1)
if(num % 2 == 0)
temp.num = num /=2;
if(num > Min && num < Max && table[num] == 0)
else if(num % 2 != 0)
temp.num = num = num*3 + 1;
if(num < 0)
if(num > Min && num < Max && table[num] == 0)
for(j = data[k].num; j < Max; j *=2)
int i, j, k, max_num;
max_num = 0;
if(table[k] > max_num)
max_num = table[k];
cout << max_num << endl;
- MineFinder . . . . 24 matches
* [http://zeropage.org/~reset/zb/download.php?id=KDP_board_image&page=1&page_num=20&category=&sn=&ss=on&sc=on&keyword=&prev_no=&select_arrange=headnum&desc=&no=57&filenum=1 1차일부분코드] - 손과 눈에 해당하는 부분 코드를 위한 간단한 예제코드들 모음. 그리고 지뢰찾기 프로그램을 제어하는 부분들에 대해 Delegation 시도. (CMinerControler 클래스는 처음 '막 짠' 코드로부터 지뢰찾기 제어부분 함수들을 클래스화한것임)
* [http://zeropage.org/~reset/zb/download.php?id=KDP_board_image&page=1&page_num=20&category=&sn=&ss=on&sc=on&keyword=&prev_no=&select_arrange=headnum&desc=&no=58&filenum=1 1차제작소스]
155.178 0.1 42649.225 19.1 9944 CMinerBitmapAnalyzer::ConvertBitmapToNumber(int,int) (minerbitmapanalyzer.obj)
* [http://zeropage.org/~reset/zb/download.php?id=KDP_board_image&page=1&page_num=20&category=&sn=&ss=on&sc=on&keyword=&prev_no=&select_arrange=headnum&desc=&no=59&filenum=1 2차제작소스]
if (IsNumber (GetData (j,i))) {
* [http://zeropage.org/~reset/zb/download.php?id=KDP_board_image&page=1&page_num=20&category=&sn=&ss=on&sc=on&keyword=&prev_no=&select_arrange=headnum&desc=&no=60&filenum=1 3차제작소스]
* [http://zeropage.org/~reset/zb/download.php?id=KDP_board_image&page=1&page_num=20&category=&sn=&ss=on&sc=on&keyword=&prev_no=&select_arrange=headnum&desc=&no=60&filenum=2 4차제작소스]
* [http://zeropage.org/~reset/zb/download.php?id=KDP_board_image&page=1&page_num=20&category=&sn=&ss=on&sc=on&keyword=&prev_no=&select_arrange=headnum&desc=&no=61&filenum=1 5차제작소스]
* [http://zeropage.org/~reset/zb/download.php?id=KDP_board_image&page=1&page_num=20&category=&sn=&ss=on&sc=on&keyword=&prev_no=&select_arrange=headnum&desc=&no=62&filenum=1 6차제작소스]
* [http://zeropage.org/~reset/zb/download.php?id=KDP_board_image&page=1&page_num=20&category=&sn=&ss=on&sc=on&keyword=&prev_no=&select_arrange=headnum&desc=&no=63&filenum=1 98호환버그수정소스]
- MoreEffectiveC++/Techniques1of3 . . . . 24 matches
== Item 26: Limiting the number of objects of a class ==
static size_t numObjects;
이런 아이디어는 numObject를 사용해서 Printer객체의 수를 제한 시켜 버리는 것이다. 위에도 언급하였듯이 객체의 수가 1개를 초과하면, TooManyObject 예외를 발생시킨다.
size_t Printer::numObjects = 0;
if (numObjects >= 1) {
++numObjects;
--numObjects;
static size_t numObjects;
size_t Printer::numObjects = 0;
if (numObjects >= 1) {
++numObjects;
static size_t numObjects;
size_t Printer::numObjects = 0;
if (numObjects >= maxObjects) {
if (numObjects >= maxObjects) {
같은 코드 써서 내용만 늘린 것 같다. 하지만 조금더 언급해 본다면. Printer::maxObjects는 클래스 내부에서 10으로 초기화 시켰는데, 이는 컴파일러의 지원 여부에 따라 static const 멤버의 경우 초기화가 가능한 C++의 규칙이다.(주:참고 내용이 있었는데 몇 장인지 기억 안난다.) 그리고 maxObject에 관하여 변하지 않는 값이기에 enum으로도 쓸수 있는데, 다음과 같다.
enum { maxObjects = 10 }; // 위의 10 제한과 같은 역할을 한다.
static int objectCount() { return numObjects; }
~Counted() { --numObjects; }
static int numObjects;
- RandomWalk/성재 . . . . 22 matches
int num,b,c;
cin >> num;
int ** data = new int *[num];
for(i=0;i<num;i++)
data[i] = new int [num];
b = rand() % num;
c = rand() % num; //end
for(i=0;i<num;i++)
for(j=0;j<num;j++)
for(i=0;i<num;i++) {
for(j=0;j<num;j++) {
if(b>=0 && b<num && c-1>=0)
if(b+1<num && c-1>=0)
if(b+1< num && c>= 0 && c<num)
if(b+1<num && c+1<num)
if(c+1<num)
if(b-1>=0 && c+1<num)
for(i=0;i<num;i++) {
for(j=0;j<num;j++) {
for(i=0;i<num;i++)
- VendingMachine/세연/1002 . . . . 22 matches
2. 소위 magic number (ex : 배열의 범위를 설정하는 숫자들) 라 불리는 것들에 대해 - const 변수 선언[[BR]]
enum {
enum {
근데.. 좀 명확해 보이진 않는군요. enum 에서 설정된 것을 재정의해주면
enum {
max_num = TOTAL_DRINK_TYPE;
for (int i=0; i<max_num; i++) {
enum {
int max_num;
max_num = TOTAL_DRINK_TYPE;
for (int i=0; i<max_num; i++) {
for(int i = 0 ; i < max_num ; i++)
for(int i = 0 ; i < max_num ; i++)
for(i = 0 ; i < max_num ; i++)
for(int drinkIndex = 0 ; drinkIndex < max_num ; drinkIndex++)
enum {
int max_num;
max_num = TOTAL_DRINK_TYPE;
for (int i=0; i<max_num; i++) {
for(int drinkIndex = 0 ; drinkIndex < max_num ; drinkIndex++)
- 문자열검색/허아영 . . . . 21 matches
int word_num = 1, search_str_num = 0;
word_num = 1; search_str_num = 0; found = 0; temp = 0;
fprintf(fp, "\nfirst found -> %d\n\n", exist_str[word_num]+1);
int num = 2, x_n = 0;
exist_str[num] = x_n + 1; //빈칸 다음에 문자열이 나온다고 가정.
++num;
if(x[exist_str[word_num]] != search_str[search_str_num])
++word_num;
if(exist_str[word_num] >= 0)
temp = exist_str[word_num];
while(search_str[search_str_num])
if(x[temp] == search_str[search_str_num]){
++search_str_num;
int found_num = search();
if(found_num == 0){
}else if(0 < found_num && found_num < strlen(str)){
cout << "Found!! >>>" <<found_num+1;
- 05학번만의C++Study/숙제제출4/최경현 . . . . 20 matches
int m_number;
String(int input_number);
int check(int check_number);
String::String(int input_number)
m_number = input_number;
m_number = 0;
cout << m_number << "를 가진 클래스가 파괴 되었습니다." << endl ;
int String::check(int check_number)
if( m_number == check_number )
int number;
cin >> number;
int check_number[255] ;
check_number[a]=0;
if( number ==0 )
check_number[k] = test[k]->check(number);
if(check_number[k] == 1)
test[i] = new String(number);
- ContestScoreBoard/허아영 . . . . 20 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;
- EffectiveC++ . . . . 20 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);
- 벡터/권정욱 . . . . 20 matches
student student_num1;
student student_num2;
student student_num3;
student student_num4;
student student_num5;
student_num1.name = "Park Jin-young";
student_num1.score = 80;
student_num2.name = "Kwon Jung-wook";
student_num2.score = 100;
student_num3.name = "Lee Jae-hwan";
student_num3.score = 80;
student_num4.name = "Kim Su-jin";
student_num4.score = 70;
student_num5.name = "Kim Hong-bem";
student_num5.score = 90;
vec.push_back(student_num1);
vec.push_back(student_num2);
vec.push_back(student_num3);
vec.push_back(student_num4);
vec.push_back(student_num5);
- 새싹교실/2012/startLine . . . . 20 matches
int num1 , num2 = 1, num3, num4 = 2;
scanf("%d", &num1);
num3 = num1 - 1;
while(num2 <= num1){
while(num3 < num1){
num3++;
num3 = num3 - num4;
num2 = num2 + 1;
num4++;
해 봐야 할 것 : reverse(number) 정의 - 수 배열을 뒤집는 함수
int reverse(int number);
int currentAccountNumber;
assert(stack->elementNumber == 0);
assert(stack->elementNumber == 1);
assert(stack->elementNumber == 2);
assert(stack->elementNumber == 1);
- JollyJumpers/허아영 . . . . 19 matches
int num, i, j, value, temp;//, maxNum;
int numbers[3000], compare[3000];
while(cin >> num)
if(num == 0 && num <= 0)
for(i = 0; i <= num-1; i++)
cin >> numbers[i];
for(i = num-1; i > 0; i--)
if(numbers[i] >= numbers[i-1])
value = numbers[i] - numbers[i-1];
value = numbers[i-1] - numbers[i];
for(i = 1; i <= num-1; i++)
for(j = i; j <= num-1; j++)
for(i = 1; i <= num-1; i++)
if(num == 1)
num = 0;
- MultiplyingByRotation/곽세환 . . . . 19 matches
int number[MAX] = {0};
number[0] = factor1;
int number_jarisu = 1;
for (int i = 0; i < number_jarisu; i++)
dec += number[i] * pow(base, i);
for (i = 1; i < number_jarisu; i++)
dec2 += number[i] * pow(base, i - 1);
dec2 += number[0] * pow(base, number_jarisu - 1);
number[1]++;
for (i = 1; i < number_jarisu; i++)
if (number[i] == base)
number[i + 1]++;
number[i] = 0;
if (i == number_jarisu)
number_jarisu++;
cout << number_jarisu << endl;
//for (int i = number_jarisu - 1; i >= 0; i--)
// cout << number[i] << " ";
- ReverseAndAdd/김회영 . . . . 19 matches
long inverseDigit(long num);
bool isCircularLetter(long num);
long* number=new long[testCount];
cin>>number[i];
while(!isCircularLetter(number[i]))
number[i]=number[i]+inverseDigit(number[i]);
cout<<calCount[i]<<" "<<number[i]<<endl;
long inverseDigit(long num)
while(num!=0)
arrayOfDigit[++count]=num%10;
num=num/10;
bool isCircularLetter(long num)
while( num !=0 )//10으로 나눈 나머지가 몇인가?1이상이면
arrayOfDigit[++count]=num%10;
num=num/10;
- ReverseAndAdd/신재동 . . . . 19 matches
def reverse(self, number):
numberStr = str(number)
for i in range(len(numberStr)):
reverseStr += numberStr[len(numberStr) - i - 1]
def isPalindrome(self, number):
numberStr = str(number)
for i in range(len(numberStr)):
if(numberStr[i] != numberStr[len(numberStr) - i - 1]):
def reverseAndAdd(self, number):
number = number + self.reverse(number)
if(self.isPalindrome(number)):
return (count, number)
- 데블스캠프2009/월요일/연습문제/svn코드레이스/박준호 . . . . 19 matches
int number;
int maxnum = 50;
int minnum = 1;
number = rand() % 50;
printf("%d\n", number);
if( maxnum - minnum == 0)
printf("숫자를 입력하시오 범위는 %d 부터 %d 입니다. \n", minnum, maxnum);
if( (guess > maxnum) || (guess < minnum) )
if( number > guess)
up(&guess, &minnum);
else if(number < guess)
down(&guess, &maxnum);
void up(int *guess, int* minnum)
* minnum = (*guess) + 1;
void down(int * guess, int * maxnum)
* maxnum = (*guess) - 1;
- 새싹교실/2012/개차반 . . . . 19 matches
* float: 4 byte, floating type number. Specification in IEEE 754-2008
* Binary numeral system
* 2진법 (Binary numeral system)
int num ;
printf ("enter a number : ");
scanf ("%d", &num);
temp1 = num & 1 ;
printf ("%d\n", num - 1);
printf ("%d\n", num - 2);
int num = 1 ;
num = num<<7;
printf ("%d\n", num);
int num2 ;
num2 = num ;
num2 = num2>>2;
printf ("%d\n", num2);
- 진법바꾸기/문보창 . . . . 19 matches
bool input(int & num, int & base);
void parse_base(const int num, const int base);
void show_num(const int * parse_num, const int length);
int num, base;
isEnd = input(num, base);
parse_base(num, base);
bool input(int & num, int & base)
cin >> num;
if (num == 0)
void parse_base(const int num, const int base)
int parse_num[LEN];
int temp = num;
parse_num[length++] = temp % base;
show_num(parse_num, length);
void show_num(const int * parse_num, const int length)
cout << parse_num[i] << " ";
- 3N+1Problem/강소현 . . . . 18 matches
int maxLength(int num1, int num2){
j = num1<num2? num2 : num1;
for(i = num1<num2? num1 : num2; i <=j; i++){
int num1, num2;
while(cin>>num1>>num2)
cout<<num1<<" "<<num2<<maxLength(num1, num2);
- EuclidProblem/조현태 . . . . 18 matches
void Get_x_y(int number_a, int number_b, int* x, int* y, int gcm)
if (number_a>number_b)
while(number_a*(*x)+number_b*(*y)!=gcm)
if (temp_plus>0 && number_a*(*x)+number_b*(*y)>gcm)
else if (temp_plus<0 && number_a*(*x)+number_b*(*y)<gcm)
int Get_GCM(int number_a, int number_b)
while (temp=number_a%number_b)
number_a=number_b;
number_b=temp;
return number_b;
- LoadBalancingProblem/Leonardong . . . . 18 matches
self.numOfCPU = 0
for i in range( 1, self.numOfCPU):
def input(self, aNumOfCPU, aEachWorks):
self.numOfCPU = aNumOfCPU
if aID != self.numOfCPU:
assert 0 < aID <= self.numOfCPU
assert 0 < aID <= self.numOfCPU
assert 0 < aID <= self.numOfCPU
for id in range( 1, self.numOfCPU+1 ):
numOfCPU = 3
com.input( numOfCPU, eachWork )
numOfCPU = 3
com.input( numOfCPU, eachWork )
numOfCPU = 8
com.input( numOfCPU, eachWork )
numOfCPU = 10
com.input( numOfCPU, eachWork )
numOfCPU = 10
com.input( numOfCPU, eachWork )
- NumberBaseballGame/동기 . . . . 18 matches
NumberBaseballGame/동기
int number[3];
number[0] = rand()%10;
number[1] = rand()%10;
number[2] = rand()%10;
if (number[0]!=0 && number[0]!=number[1] && number[1]!=number[2] && number[0]!=number[2])
cout<<number[0]<<number[1]<<number[2]<<endl;
if (number[k]==input[k])
if (number[0]==input[k])
if (number[1]==input[k])
if (number[2]==input[k])
- UglyNumbers/구자겸 . . . . 18 matches
== Unum.c ==
int unum(int num); // 심술쟁이수인지 검사한다
if ( !unum(i) ) {
int unum(int num)
if ( num==3 || num==2 || num==5 )
if ( num%2==0 )
return unum(num/2);
else if ( num%3==0 )
return unum(num/3);
else if ( num%5==0 )
return unum(num/5);
[UglyNumbers]
- WikiTextFormattingTestPage . . . . 18 matches
The next line (4 dashes) should show up as a horizontal rule. In a few wikis, the width of the rule is controlled by the number of dashes. That will be tested in a later section of this test page.
The following nested list is numbered. Numbers are created by replacing the "*" with "1."
View the page in the original Wiki:WardsWiki, note the numbering, and then compare it to what it looks like in the wiki being tested.
Aside: I wonder if any wikis provide multilevel numbering -- I know that Wiki:MicrosoftWord, even back to the Dos 3.0 version, can number an outline with multiple digits, in "legal" or "outline" style numbering. I forget which is which -- one is like 2.1.2.4, the other is like II.A.3.c., and I think there is another one that includes ii.
The next 10 double spaced lines are a succession of lines with an increasing number of dashes on each line, in other words, the first line is one dash, the second is two, ... until the tenth is 10 dashes.
In at least one wiki (which? ''PikiPiki, and thus MoinMoin''), the weight (thickness) of the lines increases based on the number of dashes (starting at 4 dashes).
This8IsNotValidInTheOriginalWiki -- Numbers
[ThisIsNotValid8InTheOriginalWiki] -- Enclosed in square brackets, with number.
[[ThisIsNotValid8InTheOriginalWiki]] -- Enclosed in double square brackets, with number.
Remote references are created by inserting a number in square brackets, they are not automatically numbered. To make these links work, you must go to Wiki:EditLinks and fill in URLs.
In WardsWiki the URL for a remote reference in the [number] syntax must be entered using EditLinks. The image is placed where the [number] is located.
[ISBN: 0-13-748310-X] -- ISBN, with colon, entire string surrounded by square brackets, followed by 10 digits with optional hyphens, last digit an X ''"X" is the "digit" ten (the roman numeral, actually), which is a possible value for the checksum (last) digit.''
Note: I've noticed some inconsistency with Swiki in handling this page, maybe because of the size? Earlier, headings did not work properly, but bulleted lists did. (The numbered and nested lists were added later.) Now headings are working but lists are not. (And I won't be surprised if, when I save this page either everything works, or something different breaks -- no headings still work, lists do not, but I wonder about the next save?)
Numbered lists start each line with '#', with no space before the text.
Numbered lists are marked up using multiple leading pound signs
<alt>159 with numlock off: ƒ
<alt>0159 with numlock on: Ÿ
- 허아영/C코딩연습 . . . . 18 matches
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;
- AdventuresInMoving:PartIV/문보창 . . . . 17 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)
- IsBiggerSmarter?/문보창 . . . . 17 matches
void count_elephant(Elephant * elephant, int num_elephant);
int num_elephant = input_elephant_info(elephant);
sort(&elephant[0], &elephant[num_elephant], Elephant());
count_elephant(elephant, num_elephant);
void count_elephant(Elephant * e, int num)
// for (int t = 0; t < num; t++)
for (int k = 0; k < num - 1; k++)
for (i = k + 1; i < num; i++)
int num_elephant;
num_elephant = input_elephant_info();
print_lcs(num_elephant, num_elephant, table);
sort(&elephant_weight[1], &elephant_weight[num_elephant+1], Elephant());
sort(&elephant_IQ[1], &elephant_IQ[num_elephant+1], Elephant());
for (i = 0; i <= num_elephant; i++)
for (i = 1; i <= num_elephant; i++)
for (j = 1; j <= num_elephant; j++)
- 새싹교실/2012/아우토반/뒷반/5.11 . . . . 17 matches
char num,num1;
char num2=97;
scanf( "%d", &num );
for( j=1 ; j<=num ; j++ ) {
for( t=num ; t>j ; t-- ) {
printf( "%c", num2+num-j );
printf( "%c", num2+num+j-2 );
for( j=1 ; j<num ; j++ ) {
printf( "%c", num2+4*num-j-4 );
for( t=0 ;t<2*num-3-2*j ; t++)
if( j!=num-1 )
printf( "%c", num2+2*num+j-2 );
- MagicSquare/재니 . . . . 16 matches
int num, line, row;
cin >> num;
while (num > 9 || num < 0 || num % 2 == 0)
cin >> num;
line = num - 1;
row = num / 2;
for (int i = 0 ; i < num * num ; i++)
if (line == num - 1)
if (row == num - 1)
line = num - 2;
row = num - 1;
for (i = 0 ; i < num; i++)
for (int j = 0 ; j < num ; j++)
- OurMajorLangIsCAndCPlusPlus/print/조현태 . . . . 16 matches
void PrintNumber(int leftGab, int number, double lowNumber)
if (0 > number || 0 > lowNumber)
number = abs(number);
lowNumber = abs(lowNumber);
int numberSize = 0;
for (int tempNumber = number; tempNumber > 0; ++numberSize)
tempNumber /= 10;
int powNumber = (int)pow((int)10, numberSize);
for (register int i = 0; i < leftGab - numberSize; ++i)
for (register int i = 0; i < numberSize; ++i)
fputchar((number % powNumber) / (powNumber / 10) + '0');
powNumber /= 10;
if (0 != lowNumber)
while(0 != lowNumber)
lowNumber *= 10;
int printNumber = (int)lowNumber;
fputchar(printNumber + '0');
lowNumber -= printNumber;
PrintNumber(spaceSize, va_arg(variables, int), 0);
PrintNumber(spaceSize, (int)variableDouble / 1 , variableDouble - (int)variableDouble);
- RandomWalk/현민 . . . . 16 matches
int i,j,num;
cin >> num;
int ** data = new int *[num];
for (i=0; i<num; i++)
data[i] = new int [num];
line = rand() % num ;
col = rand() % num ;
for (i=0; i<num; i++)
for (j=0; j<num; j++)
if (next_y >= 0 && next_y < num && next_x >= 0 && next_x < num)
for (i=0; i<num; i++)
for (j=0; j<num; j++)
for (i=0; i<num; i++)
for (j=0; j<num; j++)
for(i=0;i<num;i++)
- WeightsAndMeasures/문보창 . . . . 16 matches
void input(Turtle* t, int* numT)
*numT = 1;
while (cin >> t[*numT].weight >> t[*numT].strength)
(*numT)++;
(*numT)--;
void process(Turtle* t, int numT)
sort(&t[1], &t[numT+1], turtleGreater);
for (i = 1; i <= numT; i++)
for (i = 2; i <= numT; i++)
for (j = 0; j <= numT; j++)
for (i = numT; i >= 1; i--)
if (dynamic[numT%2][i] < MAX_WEIGHT)
int numTurtle;
input(turtle, &numTurtle);
process(turtle, numTurtle);
- 코드레이스/2007.03.24상협지훈 . . . . 16 matches
def check(num):
rest = num%150
num = input(">>")
check(num)
def check(num):
rest = num%150
numList = raw_input(">>")
year, month, day, time, minute, sec = map(int,numList.split(" "))
def check(num):
rest = num%150
manNum = input()
for i in range(0,manNum):
numList = raw_input(">>")
year, month, day, time, minute, sec = map(int,numList.split(" "))
def check(num):
rest = num%155
manNum = input()
for i in range(0,manNum):
numList = raw_input(">>")
year, month, day, time, minute, sec = map(int,numList.split(" "))
- AdventuresInMoving:PartIV/김상섭 . . . . 15 matches
#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)
- NumberBaseballGame/영록 . . . . 15 matches
unsigned int number1,number2,number3;
number1 = input[0]-48;
number2 = input[1]-48;
number3 = input[2]-48;
if(a == number1)
else if(a == number2 || a == number3 )
if(b == number1 || b == number3)
else if(b == number2)
if(c == number1 || c == number2)
else if( c == number3)
- UglyNumbers/곽세환 . . . . 15 matches
* 답은 ''The 1500'th ugly number is <숫자>.'' 형식이어야 한다.
list<unsigned int> numbers;
numbers.push_back(1);
temp = numbers.front();
numbers.pop_front();
numbers.push_back(temp * 2);
numbers.push_back(temp * 3);
numbers.push_back(temp * 5);
numbers.sort();
numbers.unique();
cout << "The 1500'th ugly number is " << temp << "." << endl;
int num = 1, temp;
num++;
temp = num;
cout << num << endl;
[UglyNumbers]
- 경시대회준비반/BigInteger . . . . 15 matches
enum BigMathERROR { BigMathMEM = 1 , BigMathOVERFLOW , BigMathUNDERFLOW, BigMathINVALIDINTEGER, BigMathDIVIDEBYZERO,BigMathDomain};
void Dump(const char *,enum BigMathERROR);
string& DumpString (char const*,enum BigMathERROR);
// Number of digits in `BASE'
// The integer array to hold the number
DATATYPE *TheNumber;
// Start of the location of the number in the array
// End of the location of the number in the array
// True if the number is negative
// Trims zeros in front of a number
// Returns Number of digits in the BigInteger
// Determines if the number representation is OK or not
bool isValidNumber() const;
TheNumber = new DATATYPE[bytes];
TheNumber = new DATATYPE[1];
TheNumber[0] = 0;
TheNumber = new DATATYPE [i];
TheNumber[--i] = n % BASE;
TheNumber = new DATATYPE [Digits()];
TheNumber[i] = r;
- 수학의정석/집합의연산/조현태 . . . . 15 matches
int* input_and_return_number(int*);
int *numbers=input_and_return_number(&gaesu);
process(numbers,gaesu);
free(numbers);
int* input_and_return_number(int *number_gaesu)
scanf ("%d",number_gaesu);
int *numbers=(int*)malloc(sizeof(int)*(*number_gaesu));
for (register int i=0; i<*number_gaesu; ++i)
scanf("%d",numbers+i);
return numbers;
void process(int *numbers, int gaesu)
printf(" %d ",numbers[j]);
- 숫자야구/강희경 . . . . 15 matches
int num = rand() % 899 + 100;
int num_m[3];
num_m[0] = num % 10;
num_m[1] = (num/10) % 10;
num_m[2] = num/100;
if(num_m[0] != num_m[1] && num_m[0] != num_m[2]
&& num_m[1] != num_m[2])
if(ans_m[i] == num_m[j])
- 큰수찾아저장하기/조현태 . . . . 15 matches
int number[MAX_SAERO][MAX_GARO]={0,};
cin >> number[i][j];
if (number[i][j]>number[i][MAX_GARO-1])
number[i][MAX_GARO-1]=number[i][j];
if (number[i][j]>number[MAX_SAERO-1][j])
number[MAX_SAERO-1][j]=number[i][j];
if (number[i][j]>number[MAX_SAERO-1][MAX_GARO-1])
number[MAX_SAERO-1][MAX_GARO-1]=number[i][j];
cout << number[i][j] << "\t";
- 5인용C++스터디/클래스상속보충 . . . . 14 matches
void SendToSMSServer(string number, string message)
void SendMessage(string number, string message)
SendToSMSServer(number, message);
void SendToSMSServer(string number, string message)
cout << "Send to SK SMS Server... " << number << " " << message << endl;
void SendToSMSServer(string number, string message)
cout << "Send to KTF SMS Server... " << number << " " << message << endl;
virtual void SendToSMSServer(string number, string message)
void SendMessage(string number, string message)
SendToSMSServer(number, message);
void SendToSMSServer(string number, string message)
cout << "Send to SK SMS Server... " << number << " " << message << endl;
void SendToSMSServer(string number, string message)
cout << "Send to KTF SMS Server... " << number << " " << message << endl;
- 새싹교실/2011/무전취식/레벨10 . . . . 14 matches
int num[5];
int newnum[3];
for (i=0; i<5; i++) scanf("%d", &num[i]);
if (num[i]>max){
max=num[i];
if (num[i]<min){
min=num[i];
newnum[count]=num[i];
if (newnum[i]>max){
max=newnum[i];
if (newnum[i]<min){
min=newnum[i];
sum+= newnum[i];
- 피보나치/허아영 . . . . 14 matches
int num1, num2, num3;
num1 = 0;
num2 = 1;
num3 = 1;
num1 = num2;
num2 = num3;
num3 = num1 + num2;
printf("%d", num3);
- HowManyZerosAndDigits/임인택 . . . . 13 matches
public void testNumberSystemConversion() {
// assertEquals(2, object.convertNumber());
// assertEquals(3, object.convertNumber());
private LinkedList numbers;
numbers = new LinkedList();
convertNumber();
System.out.println(howManyZeros() + " " + numDigit());
public void convertNumber() {
numbers.add(new Long(remainder));
numbers.add(new Long(remainder));
public int howManyZeros(long num) {
String number = Long.toString(num);
for(int i=0; i<number.length(); ++i) {
if( number.charAt(i)== '0' )
Object arr[] = numbers.toArray();
public int numDigit() {
return numbers.size();
- Omok/재니 . . . . 13 matches
int cx, cy, num;
num = 0;
num++;
if (num < 4)
num = 0;
num++;
if (num < 4)
num = 0;
num++;
if (num < 4)
num = 0;
num++;
if (num == 4)
- ReverseAndAdd/김범준 . . . . 13 matches
number = str(input('입력: '))
if number != reverse:
reverse = number[::-1]
nnumber = int(number)
rnumber = int(reverse)
nnumber = nnumber + rnumber
number = str(nnumber)
reverse = number[::-1]
print number
- UglyNumbers/1002 . . . . 13 matches
연습장에 이것저것 써보다가 대략 두가지 접근법이 생각나다. 하나는 각 수들마다 'isUglyNumber' , 하나는 지수를 이용한 방법. 일단은 'isUglyNumber' 먼저 구현해보기로 해봄. (워낙 간단하므로)
def isDivideOnly235(number):
if number == 1: return True
if number % 2 != 0 and number % 3 !=0 and number % 5 != 0: return False
number = toDivide(number)
def toDivide(number):
if number % x == 0: number=number/x
return number
def uglyNumber(count):
하지만, 결과값을 보면서 지수 스타일의 접근법이 원하는 접근법이라는 생각을 하게 되다. (10억이 넘는다 할때, isUglyNumber 식이라면 10억번이 실행된다.) 하지만, 그냥 지수로만 생각하면 uglynumber 의 순서 상 맞지 않을 것인지라 (1 : 2^0*3^0*5^0, 2 : 2^1*3^0*5^0, 3 : 2^0*3^1*5^0, 4 : 2^2*3^0*5^0 ... 0,0,0 , 1,0,0, 0,1,0 , 2,0,0 .. 도무지 숫자들 간의 연관성이 잡히지 않았다.
[UglyNumbers/JuNe] 코드 분석. 2시간 동안 보다가 도무지 접근법을 이해 못하다. 한 3시간째쯤 보다가 http://www.acmsolver.org/?itemid=28#ggviewer-offsite-nav-9512048 보고 이해 & 좌절.
- 데블스캠프2006/월요일/연습문제/switch/이장길 . . . . 13 matches
int num[10]={0,};
num[0]++;
num[0]++;
num[1]++;
num[2]++;
num[3]++;
num[4]++;
num[4]++;
num[4]++;
num[4]++;
num[4]++;
num[4]++;
output(num);
- 수/구구단출력 . . . . 13 matches
int i,Number;
scanf("%d",&Number);
printf("%d단\n",Number);
printf("%dX%d=%d\n",Number,i,Number*i);
int Numbers;
int Number;
scanf("%d",&Numbers);
for(Number = 1; Number < 10; Number++)
printf("%dX%d=%d\n",Numbers,Number,Numbers*Number);
int i,number;
scanf ("%d",&number);
} while(number <=1 || number >=10);
printf ("<%d단>\n",number);
printf ("%dX%d=%2d\n",number,i,number*i);
int i, num;
scanf("%d", &num);
} while(num<1 || num>9);
printf("%d x %d = %d\n", num, i, num*i);
- 피보나치/S.S.S . . . . 13 matches
num=input('입력 하세요:')
num1=1
num2=0
num3=0
for n in range(num):
num3=num1+num2
print num3
num1=num2
num2=num3
- AnEasyProblem/강소현 . . . . 12 matches
int num = 0, count=0;
while(num<bin.length-1){
if(bin[num] == 1){
if(bin[num+1] == 0){
bin[num+1] = 1;
bin[num] = 0;
bin[num] = 0;
num++;
int num = 0;
temp[num++] = i%2;
* printJ 함수 내에서 while(num<bin.length-1)문의 1을 빼주지 않아 bin[num+1]가 index bound of exception이 났었습니다.
- ReverseAndAdd/남상협 . . . . 12 matches
def Reverse(self,numbers):
self.reverseNumber=0
if numbers<=0:
self.stack.append(numbers%10)
numbers=numbers/10
self.reverseNumber=self.reverseNumber+self.stack.pop()*self.mul
return self.reverseNumber
def run(self,numbers):
self.Reverse(numbers)
print numbers
print self.reverseNumber
if numbers==self.reverseNumber:
numbers=numbers+self.Reverse(numbers)
return i, self.reverseNumber
- [Lovely]boy^_^/[Lovely]boy^_^/USACO/Barn . . . . 12 matches
vector<int> getPivot(int numPivot, const vector<int>& distance)
ret.erase(ret.begin() + numPivot - 1, ret.end());
vector<int> getDatas(int& numPivot)
fin >> numPivot >> max >> iter;
if(numPivot > iter)
numPivot = iter;
int getTotal(int numPivot, const vector<int>& ar, const vector<int>& pivots)
ret += numPivot;
int numPivot;
vector<int> data = getDatas(numPivot);
vector<int> pivots = getPivot(numPivot, distance);
fout << getTotal(numPivot, data, pivots) << endl;
- 가위바위보/은지 . . . . 12 matches
int num1, num2;
fin >> num1;
fin >> num2;
if (num1 == num2)
else if ((num1 == 0 && num2 == 1) || (num1 == 1 && num2 ==2) || (num1 == 2 && num2 == 0))
- 김재현 . . . . 12 matches
#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);
- 데블스캠프2006/월요일/함수/문제풀이/김준석 . . . . 12 matches
bool team684(int daewon, int weapon_num, int boat_num){
if(daewon >= 40 && (daewon/boat_num)<8 && (weapon_num/daewon >=1)) return true;
int daewon, weapon_num, boat_num;
cin >> daewon >> boat_num >> weapon_num;
if(team684(daewon, weapon_num, boat_num)){
cout << "대원 한명당" <<(rand()%(daewon/10) +1) * (int)(weapon_num/daewon) << "명죽이고 " << endl;
cout << (rand()%(weapon_num/10) +1) / daewon << "명죽이고 " << endl;
- 성적처리프로그램 . . . . 12 matches
int num[5]={0} ;
num[0]++;
num[1]++;
num[2]++;
num[3]++;
num[0]++;
num[4]++;
cout << "A : " << num[0] << endl;
cout << "B : " << num[1] << endl;
cout << "C : " << num[2] << endl;
cout << "D : " << num[3] << endl;
cout << "F : " << num[4] << endl;
- BeeMaja/김상섭 . . . . 11 matches
void process(int num)
num -= 1;
while(num > 0)
num -= temp;
for(i = 0; num != 0; i++)
if(-1*num < count)
temp = -1*num;
num += temp;
int num;
while(cin >> num)
process(num);
- Counting/하기웅 . . . . 11 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;
- EightQueenProblem/이선우2 . . . . 11 matches
private int numberOfAnswers;
numberOfAnswers = -1;
if( out != null || numberOfAnswers == -1 ) {
return numberOfAnswers;
numberOfAnswers = -1;
numberOfAnswers = 0;
numberOfAnswers ++;
if( checkOne && numberOfAnswers > 0 ) break;
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 ));
- HanoiProblem/임인택 . . . . 11 matches
public void solve(int numOfDiscs) {
for(int i=numOfDiscs; i>0; i--)
moveDiscs(numOfDiscs, 0);
public void moveDiscs(int numOfDiscs, int from) {
if( numOfDiscs > 3 ) {
moveDiscs(numOfDiscs-1, to);
import java.util.Enumeration;
public boolean movable(Integer discNum){
if( iObj.intValue() > discNum.intValue() )
public void putOnDisc(int discNum) {
Integer i = new Integer(discNum);
Enumeration enum = discsAtPillar.elements();
while(enum.hasMoreElements()) {
Integer i = (Integer)(enum.nextElement());
Integer discNum = from.getTopDisc();
if( movable(discNum) ) {
discsAtPillar.add(discNum);
- HardcoreCppStudy/첫숙제/Overloading/임민수 . . . . 11 matches
int num, garo=0, sero=0, cnt=1;
cin >> num;
sero = num/2;
while ( cnt < num*num )
garo = num-1;
if (sero > num-1)
if (garo > num-1)
sero = num-1;
for (int i = 0 ; i <num; i++)
for ( int j = 0 ; j < num ; j++)
- JTDStudy/첫번째과제/상욱 . . . . 11 matches
public class NumberBaseBallGame {
private String resultNumber;
private String userNumber;
NumberBaseBallGame game = new NumberBaseBallGame();
// make a result number
createResultNumber();
// input number from user
inputNumber();
public String inputNumber() {
return userNumber = JOptionPane.showInputDialog(null, "Enter number what you think");
public void createResultNumber() {
String fstNum, secNum, trdNum;
fstNum = "" + (Math.random()*10);
secNum = "" + (Math.random()*10);
trdNum = "" + (Math.random()*10);
}while(fstNum.equals(secNum) || secNum.equals(trdNum) || fstNum.equals(trdNum));
resultNumber = fstNum + secNum + trdNum;
int numOfStrike = 0;
int numOfBall = 0;
if (resultNumber.charAt(i) == userNumber.charAt(j)) {
- JollyJumpers/강희경 . . . . 11 matches
int numberOfInputFactor;
if(cin >> numberOfInputFactor){
inputedList = new int[numberOfInputFactor+1];
inputedList[0] = numberOfInputFactor;
if(numberOfInputFactor < 2){
numberOfInputFactor = 0;
numberOfInputFactor = 0;
if(!(cin >> inputedList[inputedList[0] - numberOfInputFactor])){
numberOfInputFactor = 0;
numberOfInputFactor--;
}while(numberOfInputFactor >= 0);
- OurMajorLangIsCAndCPlusPlus/print/하기웅 . . . . 11 matches
char number = *n;
if((number-48)>strlen(st))
for(int i=0; i<(number-48-strlen(st)); i++)
putchar(number);
int *number = va_arg(l,int*);
itoa(number[i], st, 10);
double *number = va_arg(l, double*);
char *st=_fcvt(number[i], limit, &decimal, &sign);
print("number: %7d\n", n1);
print("number: %7d\n", n2);
print("number: %7d\n", n3);
- ReverseAndAdd/Celfin . . . . 11 matches
int testcase, number, i, counting;
int tempNum;
for(i=9; i>=number; i--)
if(input[i]+input[number-i+9]+carry[i]>9)
temp[i] = (input[i]+input[number-i+9]+carry[i])%10;
temp[i] = input[i]+input[number-i+9]+carry[i];
number--;
for(i=number; i<10; i++)
cin >> tempNum;
number=9;
input[number] = tempNum%10;
if((int)(tempNum/pow(10, i))!=0)
number--;
input[number]=(int)(tempNum/pow(10, i))%10;
- STL/vector/CookBook . . . . 11 matches
int num;
cin >> num;
int ar[num];
for(int i = 0 ; i < num ; ++i)
int num;
cin >> num;
int* ar = new int[num];
for(int i = 0 ; i < num ; ++i)
int num;
cin >> num;
vector<int> ar(num);
- 데블스캠프2005/금요일/OneCard . . . . 11 matches
def __init__(self, shape=None, number=None):
self.number = number
s = '%s %s' % (self.shape, self.number)
cardsNums = range(2,11) + ['J', 'Q', 'K', 'Q', 'A']
for number in cardsNums:
cards.append(Card(shape, number))
numCardsRemoved = 0
numCardsRemoved = myResult + pcResult
if numCardsRemoved == 0:
if cardOnTable.shape==myCard.shape or cardOnTable.number==myCard.number:
- 데블스캠프2009/목요일/연습문제/다빈치코드/서민관 . . . . 11 matches
int number;
int i = 0, j = 0, m, cardnum;
scanf("%d", &cardnum);
for ( m = 0 ; m < cardnum ; m++ )
scanf("%c %d", &hand[m].color, &hand[m].number);
if ( hand[j].number > hand[j+1].number || ( hand[j].number == hand[j+1].number && hand[j].color == 'w'))
for ( j = 0 ; j < cardnum ; j++ )
printf("%c %d\n", hand[j].color, hand[j].number);
- 마방진/임민수 . . . . 11 matches
int num, garo=0, sero=0, cnt=1;
cin >> num;
sero = num/2;
while ( cnt < num*num )
garo = num-1;
if (sero > num-1)
if (garo > num-1)
sero = num-1;
for (int i = 0 ; i <num; i++)
for ( int j = 0 ; j < num ; j++)
- 몸짱프로젝트/BinarySearchTree . . . . 11 matches
## if self.getNumofChildren( node ) == 0:
## elif self.getNumofChildren( node ) == 1:
if node.numofChildren() == 0:
elif node.numofChildren() == 1:
def getNumofChildren( self, aNode ):
def numofChildren(self):
## def testGetNumofChildren(self):
## self.assertEquals(bst.getNumofChildren( bst.root ), 2 )
if node.numofChildren() == 0:
elif node.numofChildren() == 1:
def numofChildren(self):
Node * setNode(Node * p, int aNum);
void Insert(Node * aRoot, int aNum);
void Delete(Node * aRoot, int aNum);
Node * Search(Node * aRoot, int aNum);
int number;
cin >> number;
Insert(root, number);
Delete(root, number);
Search(root, number);
- 새싹교실/2012/새싹교실강사교육/3주차 . . . . 11 matches
int cal_num = 6;
else if(mode == 1) cal_num = calregist(cal, cal_num);
else if(mode == 2) printf("총칼로리 : %6.2fkcal\n\n", calcalc(cal, cal_num));
int calregist(CALORIE *pcal, int num){
scanf("%s", (pcal+num)->name);
scanf("%f", &(pcal+num)->value);
return num+1;
float calcalc(CALORIE *pcal, int num){
for(i = 0; i<num;i++)
for(i=0;i<num;i++){
- 연습용 RDBMS 개발 . . . . 11 matches
int num, sqrt_num, n, result=0;;
scanf("%d", &num);
for( ; num; result=0)
if(num>0)
sqrt_num = (int)sqrt((double)num);
for(n=2; n<=sqrt_num; n++)
if(!(num%n))
printf("숫자 %d : %s\n\n", num, result ? "소수가 아닙니다." : "소수입니다.");
scanf("%d", &num);
- 피보나치/SSS . . . . 11 matches
int num_prev=1;
int num_next=1;
int num_temp=0;
num_temp =num_prev + num_next;
num_prev = num_next;
num_next = num_temp;
printf("%d\n",num_prev);
- 피보나치/김상섭 . . . . 11 matches
int fibonachi(int num);
int num;
cin >> num;
while(num >= 0)
cout << num << "번째 피보나치 수열은" << fibonachi(num) <<" 입니다.\n";
cin >> num;
int fibonachi(int num)
if(num > 1 )
return fibonachi(num-1) + fibonachi(num-2);
- 호너의법칙/조현태 . . . . 11 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];
- BirthdayCake/허준수 . . . . 10 matches
void process(int num)
int b = (Gradient[num/2].x + Gradient[num/2 + 1].x)*(-1);
int a = Gradient[num/2].y + Gradient[num/2 + 1].y;
int numCherry, i;
cin >> numCherry;
if(numCherry == 0)
for(i = 0; i<2*numCherry; i++) {
process(numCherry);
- ChocolateChipCookies/허준수 . . . . 10 matches
int numCookies;
cooki.numCookies = 0;
cookies[i].numCookies++;
cookies[j].numCookies++;
int max_num = 0;
if(cookies[i].numCookies > max_num)
max_num = cookies[i].numCookies;
cout << max_num <<endl;
- HowManyZerosAndDigits/김회영 . . . . 10 matches
struct info_number
void test(int,int,info_number*);
int number,result_number,radix;
info_number temp;
cin>>number>>radix;
result_number=factorial(number);
test(result_number,radix,&temp);
void test(int n,int radix,info_number* temp)
- StacksOfFlapjacks/조현태 . . . . 10 matches
int number_cake=0;
scanf("%d",cakes_size+number_cake);
if (0==cakes_size[number_cake])
++number_cake;
if (0==number_cake)
print_flap(cakes_size, number_cake);
void print_flap(char* cakes_size, int number_cake)
for (register int i=number_cake-1; i>=0; --i)
printf("%d ",number_cake-maximum);
printf("%d ",number_cake-i);
- WorldCupNoise/권순의 . . . . 10 matches
int trumpet(int num);
int getLineNum = 0;
int getPatternNum = 0;
cin >> getLineNum;
scenario = (int*)malloc(sizeof(int) * getLineNum);
for(int i = 0; i < getLineNum; i++)
cin >> getPatternNum;
scenario[i] = getPatternNum;
for(int i = 0; i < getLineNum; i++)
int trumpet(int num)
if(num == 1)
else if(num == 2)
for(int i = 2; i < num; i++) {
int trumpet(int num);
int getLineNum = 0;
int getPatternNum = 0;
cin >> getLineNum;
scenario = (int*)malloc(sizeof(int) * getLineNum);
for(int i = 0; i < getLineNum; i++)
cin >> getPatternNum;
- [Lovely]boy^_^/USACO/BrokenNecklace . . . . 10 matches
int lnum = 0;
int rnum = 0;
lnum++;
rnum++;
if(max < lnum + rnum)
max = lnum + rnum;
lnum = rnum = 0;
- 기본데이터베이스/조현태 . . . . 10 matches
int selected_number=select_menu();
functions[selected_number]();
if (QUIT==selected_number)
int select_number;
printf("select number : ");
scanf("%d",&select_number);
if (0==strcmp(temp_data,datas[i][select_number]))
void print_list(int number)
if (ALL==number)
printf("%s\t",datas[number][j]);
- 김영록/연구중/지뢰찾기 . . . . 10 matches
int num_x,num_y;
num_x = 0;
num_y = 0;
cin >> num_x;
cin >> num_y;
if (1<=num_x<=20)
if (1<=num_y<=20)
mine_confirm(num_x-1,num_y-1);
- 데블스캠프2006/화요일/pointer/문제3/이장길 . . . . 10 matches
int *num1 = new int[5] ;
int *num2 = new int[5] ;
cin >> num1[i];
cin >> num2[i];
result[i] = num1[i] + num2[i];
cout << num1[i];
cout << num2[i];
delete [] num1;
delete [] num2;
- 문자반대출력/최경현 . . . . 10 matches
int numberOfString;
numberOfString = strlen(string);
for (int i = 0; i < numberOfString; i++)
if(numberOfString%2==0)
for(i=1;i<numberOfString/2+1;i++)
broker = string[numberOfString-i];
string[numberOfString-i] = string[i-1];
for(i=1;i<numberOfString/2+2;i++)
broker = string[numberOfString-i];
string[numberOfString-i] = string[i-1];
- 숫자를한글로바꾸기/김태훈zyint . . . . 10 matches
글구 num2str 요함수.. 걍 수민이한것처럼 배열로 하면 되는데; 괜히 switch로 했다 ㅠㅠ 엉엉
char* num2str(int num); //숫자를 문자로 변경시켜줍니다.
int is_numarray(char getdata[]); //char 배열의 요소가 숫자인지 확인 - 맞으면 TRUE 리턴
if(!is_numarray(getdata)) continue;
char* num2str(int num)
switch(num)
int is_numarray(char getdata[])
printf("%s",num2str(getdata[i]-48));
- 숫자를한글로바꾸기/조현태 . . . . 10 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];
- 압축알고리즘/희경&능규 . . . . 10 matches
int number = 0;
fout << number << temp;
number = 1;
number ++;
fout << number << temp;
int number;
number = pass[i] - 48;
fout << number;
int num;
num = (pass[i] - 48) * decimal;
- 인수/Smalltalk . . . . 10 matches
numsOfWalked := Array2D width:size height:size.
numsOfWalked atAllPut:0.
numsOfWalked do: [ :val | val = 0 ifTrue: [^false] ].
| numOfWalked |
numOfWalked _ numsOfWalked at: aRow at: aCol.
numsOfWalked at: aRow at:aCol put: numOfWalked + 1.
RWBoard>>setValidLocation: num
newValue := num + 3 atRandom - 2.
- 조동영 . . . . 10 matches
int num,i,j,k;
scanf("%d",&num);
for(i=0;i<num;i++){
for (j=num-i;j>1;j--){
int num,i,j,k;
scanf("%d",&num);
for(i=0;i<num;i++){
for (j=num-i;j>1;j--){
for(i=0;i<num-1;i++){
for (j=2*(num-i)-3;j>0;j--){
- 2002년도ACM문제샘플풀이/문제D . . . . 9 matches
int numberOfData;
cin >> numberOfData;
for(int i = 0 ; i < numberOfData ; i++)
for(int i = 0 ; i < numberOfData ; i++)
for(int i = 0 ; i < numberOfData ; i++)
#include <numeric>
int weight, diff, num;
cin >> num;
for(int i = 0 ; i < num ; ++i)
- C++스터디_2005여름/학점계산프로그램/정수민 . . . . 9 matches
int num=MAX_STUDENT/10;
int good_student_number=0;
good_student_number++;
if (good_student_number>num)
int school_number;
school_number = 0;
fin >> school_number;
cout << "학번 : " << school_number << " 평점 : " << average << endl;
- ClassifyByAnagram/김재우 . . . . 9 matches
System.Collections.IEnumerator myEnumerator = list.GetEnumerator();
while ( myEnumerator.MoveNext() )
writer.Write( myEnumerator.Current );
IDictionaryEnumerator de = m_dictionary.GetEnumerator();
IEnumerator le = list.GetEnumerator();
- CuttingSticks/김상섭 . . . . 9 matches
int length, tokennum, token, l, i, j, m;
cin >> tokennum;
for(int i = 0 ; i < tokennum; i++)
tokennum = temp.size() - 1;
for(j = 0; j < tokennum ; j++)
for(j = 0; j < tokennum - 1; j++)
for(m = 3; m < tokennum + 1; m++)
for(i = 0; i + m < tokennum + 1; i++ )
cout << "The minimum cutting is " <<store[0][tokennum] << ".\n";
- HanoiTowerTroublesAgain!/황재선 . . . . 9 matches
public int readNumber() {
public boolean canBallPut(int[] prev, int peg, int ballNumber) {
double squareNumber = sqrt(prev[peg] + ballNumber);
return ceil(squareNumber) == floor(squareNumber);
public int maxBall(int numOfPeg) {
int[] prevNumber = new int[numOfPeg + 1];
int ballNumber = 1;
int oldBallNumber = 0;
while(oldBallNumber != ballNumber) {
oldBallNumber = ballNumber;
for(int peg = 1; peg <= numOfPeg; peg++) {
if (canBallPut(prevNumber, peg, ballNumber)) {
prevNumber[peg] = ballNumber++;
if (ballNumber == Integer.MAX_VALUE) {
return ballNumber - 1;
public void printNumberOfBall(int numOfBall) {
System.out.println(numOfBall);
int testCase = hanoi.readNumber();
int numOfPeg = hanoi.readNumber();
int numOfBall = hanoi.maxBall(numOfPeg);
- LinkedList/세연 . . . . 9 matches
node * INSERT(node * head_pointer, int num);
int num, choice;
cout << "push num : ";
cin >> num;
head_pointer = INSERT(head_pointer, num);
node * INSERT(node * head_pointer, int num)
head_pointer->data = num;
head_pointer->data = num;
cout << "delete num : " << head_pointer->data << "\n";
- MagicSquare/영록 . . . . 9 matches
int number = 1;
array[a][b] = number; // 처음수 초기화.
while (number < size*size)
number++;
array[a][b] = number;
array[a][b] = number;
array[a][b] = number;
array[a][b] = number;
array[a][b] = number;
- 데블스캠프2006/월요일/함수/문제풀이/이차형 . . . . 9 matches
int dice(int num, int dice);
int num, dic;
dice(num, dic);
int dice(int num, int dic)
num = rand();
dic = num%6+1;
int number=0;
number = rand();
brother = number%7+1;
- 빵페이지/소수출력 . . . . 9 matches
int num;
cin>>num;
for(int k=2;k<num;k++)
for(int i=1;i<=num;i++)
for(int j=2;j<=num;j++)
int num;
cin >> num;
if (num >= 2)
for (int i = 2; i <= num; i++)
- 새싹교실/2011/AmazingC/5일차(4월 14일) . . . . 9 matches
int number;
scanf("%d", &number);
while(number>0){
sum+=number%10;
number/=10;
int number=1;
number++;
printf("%d", number);
}while(number<1);
- 새싹교실/2012/주먹밥 . . . . 9 matches
int num;
scanf("%d", &num);
if(num % 400 == 0)
else if((num % 4 == 0) || (num & 100 != 0))
///num은 음식이 들어가있는 갯수를 뜻합니다.
float calcalc(CALORIE *pcal, int num){
for(i = 0; i<num;i++) //갯수만큼 출력합니다
for(i=0;i<num;i++){
System.out.println(i + "is prime Number!");
- 정렬/aekae . . . . 9 matches
int number[10000];
fin >> number[i];
if (number[j] < number[k])
temp = number[j];
number[j] = number[k];
number[k] = temp;
fout << number[i] << endl;
- 큐/Leonardong . . . . 9 matches
void push_num();
void pop_num();
void show_num();
case 1 : push_num();
case 2 : pop_num();
case 3 : show_num();
void push_num()
void pop_num()
void show_num()
- 2002년도ACM문제샘플풀이/문제E . . . . 8 matches
int numberOfData;
cin >> numberOfData;
for(int i=0;i<numberOfData;i++)
for(int i=0;i<numberOfData;i++)
for(int i=0;i<numberOfData;i++)
int num, weight;
cin >> num;
for(int i = 0 ; i < num ; ++i)
- 3N+1Problem/Leonardong . . . . 8 matches
numFrom = input("")
numTo = input("")
print self.getMaximumCycleLength(numFrom, numTo)
numFrom = input("")
numTo = input("")
print self.getMaximumCycleLen(numFrom, numTo)
- AntOnAChessboard/김상섭 . . . . 8 matches
void process(int num)
level = ceil(sqrt(num));
temp = num - (level-1)*(level-1);
int num;
cin >> num;
while(num)
process(num);
cin >> num;
- Calendar환희코드 . . . . 8 matches
int numberofDay, year, month;
scanf("%d", &numberofDay);
while(numberofDay < 0 || numberofDay > 6){
scanf("%d", numberofDay);
달력출력(numberofDay, year, month);
numberofDay = 몇요일로시작할까(numberofDay, year, month);
- CuttingSticks/문보창 . . . . 8 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;
- ErdosNumbers/차영권 . . . . 8 matches
// erdosNumbers.cpp
int erdosNumber;
void checkErdosNumberTo0(Author *p, int n);
void checkErdosNumberTo1(Author *p, char *c, int n);
void checkErdosNumberTo2(Author *p, int n);
int count = 0, n = 0, m = 0, number = 0;
author[m][number].name[n++] = *c;
author[m][number].name[n] = '\0';
number++; n=0; c++; c++;
saveBound[count] = number;
m++; count++; number=0;
checkErdosNumberTo1(author[n], author[i][k].name, saveBound[n]);
author[i][j].erdosNumber = -1;
for (i=save[number] ; i!=0 ; i=save[++number])
checkErdosNumberTo2(author[i], saveBound[i]);
checkErdosNumberTo0(author[i], saveBound[i]);
saveResult[k] = author[i][j].erdosNumber;
void checkErdosNumberTo0(Author *author, int n)
author[i].erdosNumber = 0;
void checkErdosNumberTo1(Author *author, char *name, int n)
- Interpreter/Celfin . . . . 8 matches
int testcase, number;
for(number=0; cin.getline(temp, 4) && *temp; number++)
sscanf(temp, "%d", &ram[number]);
for(number; number<1000; number++)
ram[number]=0;
- JavaNetworkProgramming . . . . 8 matches
int numberRead;
while((numberRead =System.in.read(buffer))>=0) //가능한 많은 양을 읽는다. EOF가 -1을 반환하면 출력한다.
System.out.write(buffer,0,numberRead);
int numberRead;
while((numberRead = in.read(buffer)) >=0) //파일을 버퍼에 가능한 많은 양을 읽고 읽은 양만큼 파일에 쓴다. 파일이 EOF일 때까지.
out.write(buffer,0,numberRead); //여기서 0은 초기시작위치이고 파일에 쓸때마다 점점 옆으로 이동한다 --;
*LineNumberInputStream : LineNumberReader 클래스에 의해 쓸모가 없어진 이 스트림은 초보적인 수준으로 줄에 번호 매기는 기능을 제공한다.
*스트림 필터의 사용 예제 : System.in으로 입력받는것을 BufferedInputStream필터를 거쳐서 LineNumberInputStream을 거처 DataInputStream을 거처서 DataOutputStream에 쓰여지고 BufferedOutputStream으로 버퍼링돼 한번에 출력된다. --;
LineNumberInputStream lineNumberIn = new LineNumberInputStream(bufferedIn); //버퍼입력을 다시 라인을 붙여주는 필터가 받음
DataInputStream dataIn = new DataInputStream(lineNumberIn); //라인이 붙은 입력을 DataInputStream으로 받아서 한바이트이상을 전달함
String response = lineNumberIn.getLineNumber() + " : " + line.toUpperCase() + "\n"; //줄번호를 얻어서 붙임 대문자로 바꿈
*DataOutputStream,DataInputStream,BufferedOutputStream,BufferedInputStream,PrintStream,SequenceInputStream,LineNumberInputStream,PushbackInputStream 클래스에 관해서 좀 자세히 설명을 해놓고 있다.
*LineNumberReader :연결된 스트림의 텍스트를 구성하는 각줄의 번호를 카운팅하는 기능을 초보적으로 나마 제공한다. 이클래스는 BufferedReader의 서브클래스이므로, 연결된 스트림으로서의 버퍼링을 자동으로 제공한다.
throw new StreamCorruptedException("Incompatible myOSMagick number");
throw new StreamCorruptedException("Incompatible myOSVersion number");
- Lotto/송지원 . . . . 8 matches
int dscanf( int *pnum ) {
scanf("%d", pnum);
return *pnum;
int *nums;
nums = (int *)malloc(sizeof(int) * n);
scanf("%d", &nums[i]);
printf("%d", nums[dmy[j]]);
free(nums);
- PrimaryArithmetic/문보창 . . . . 8 matches
int num1[10], num2[10];
num1[count++] = str[i] - 48;
num2[j] = 0;
num2[count++] = str[i] - 48;
num1[j] = 0;
temp = num1[i] + num2[i] + carry;
- VonNeumannAirport/Leonardong . . . . 8 matches
거리를 계산하는 더 좋은 알고리즘이 있을까? 지금은 O(num of city^2).
def __init__(self, numofGates):
for i in range( numofGates ):
self.matrix.append([0]*numofGates)
def __init__(self, numofGates):
Matrix.__init__(self, numofGates)
def __init__(self, numofGates):
Matrix.__init__(self, numofGates)
- 데블스캠프2005/금요일/OneCard/이동현 . . . . 8 matches
int num;
int search(int num, int face){
if(card.num == num)
System.out.print(i+".("+card.face+" "+card.num+") ");
card.num = j+1;
int choice = comCards.search(discard.retTop().num,discard.retTop().face);
choice = playerCards.search(discard.retTop().num,discard.retTop().face);
- 반복문자열/이강희 . . . . 8 matches
int print_n(int num)
for (num=1;num<=5;num++)
printf("%d. CAUCSE LOVE.\n", num);
return num;
int num = 1;
print_n(num);
- 피보나치/임인택 . . . . 8 matches
def pibo(num):
if num == 1 or num == 2 :
return pibo(num-1)+pibo(num-2)
def piboIter(num):
if num <= 2 :
for i in range(0, num-2):
- 하욱주/Crap . . . . 8 matches
int num;
<< "| Number | 배팅 | 지불 |" <<endl
<<"배팅 하실 곳은? (1 ~ 3) : "; cin >> num;
while(num!=1 && num!=2 && num!=3)
cin >> num;
cout << num <<"번을 택하셨습니다. 그럼 게임을 진행합니다." <<endl
switch(num)
- 호너의법칙/남도연 . . . . 8 matches
int num_add=0,num_multiply=0;
num_add++;
num_multiply++;
cout<<"# Horner ADD Count ---->"<<num_add<<endl;
outputFILE << "# Horner ADD Count ---->"<<num_add<<endl;
cout<<"# Horner Multiply Count ---->"<<num_multiply<<endl;
outputFILE << "# Horner Multiply Count ---->"<<num_multiply<<endl;
- AustralianVoting/Leonardong . . . . 7 matches
IntVector candidateNum;
return sheet.candidateNum.front();
return *sheet.candidateNum.erase( sheet.candidateNum.begin() );
int minVotedNum( const CandidatorVector & candidators )
if ( candidators[i].votedCount != minVotedNum(candidators) )
int remainNum = countRemainCandidators(candidators);
if ( isWin( candidators[i], remainNum ) )
// cin >> numOfCase;
int numOfCandidators;
cin >> numOfCandidators;
int n = numOfCandidators;
sheet.candidateNum.push_back( vote );
int num;
num = pop_front(sheets[i]);
candidators[ num ].votedCount++;
markFall( candidators, minVotedNum( candidators ) );
- Hartals/상협재동 . . . . 7 matches
int numberOfHartal;
void process(int num);
void arrayInit(int* array, int arrayNum);
void arrayInit(int* array, int arrayNum)
for(int i = 0; i < arrayNum; i++)
cin >> numberOfHartal;
for(int i = 0; i < numberOfHartal; i++)
void process(int num)
for(int i = 0; i < numberOfHartal; i++)
totalStrike[num]++;
- JTDStudy/첫번째과제/영준 . . . . 7 matches
int[] num = new int[3];
num[0] = (int)(Math.random()*10);
num[1] = (int)(Math.random()*10);
num[2] = (int)(Math.random()*10);
if (num[i] == temp[j] && i == j)
else if(num[i] == temp[j] && j != i && num[j] != temp[j])
- LCD-Display/김상섭 . . . . 7 matches
char num[10];
cin >> size >> num;
while(num != 0 && num[0] != '0')
for(i = 0; num[i] != '\0'; i++)
test.push_back(num[i]-48);
cin >> size >> num;
- LoveCalculator/zyint . . . . 7 matches
size_t numlen(size_t num);
size_t numlen(size_t num)
return (size_t)(log10(num)+1);
for(i=1;i<numlen(a);++i) jari *= 10;
for(i=numlen(a);i>=1;--i)
- NumberBaseballGame/성재 . . . . 7 matches
int num;
cin >> num;
match[0]=num/100;
match[1]=(num%100)/10;
match[2]=num%10;
if(num>100 && num<999)
["NumberBaseballGame"]
- One/구구단 . . . . 7 matches
int number; /*입력받을 숫자*/
scanf("%d", &number);
if(number<=1 || number>=10)
printf("당신이 알고 싶은 %d 단은 다음과 같습니다.\n", number);
printf("%d*%d=%d\n", number, count, number*count);
- SummationOfFourPrimes/1002 . . . . 7 matches
for eachGenNumberFour in GenNumbersFour
isAllPrimeNumber:
print eachGenNumberFour
GenNumbersFour = 합이 x 인 수 조합리스트
class PrimeNumberList:
def __init__(self,aNum):
self.size = aNum
if self.isPrimeNumber(i):
def isPrimeNumber(self,aNum):
if aNum % eachValue == 0:
class PrimeNumberTest(unittest.TestCase):
def testPrimeNumber(self):
self.assertEquals([2,], PrimeNumberList(2).getList())
self.assertEquals([2,3], PrimeNumberList(3).getList())
self.assertEquals([2,3,5], PrimeNumberList(5).getList())
self.assertEquals([2,3,5,7,11], PrimeNumberList(12).getList())
self.assertEquals([2,3,5,7,11,13,17,19], PrimeNumberList(20).getList())
class PrimeNumberList:
def __init__(self,aNum):
self.size = aNum
- SuperMarket/재니 . . . . 7 matches
int money, cash, wantProduct, wantNum;
int num;
product[i].num = 0;
cin >> wantNum;
if (money >= product[wantProduct].price * wantNum){
money -= product[wantProduct].price * wantNum;
product[wantProduct].num += wantNum;
cout << product[wantProduct].name << "을 " << wantNum << "개 사셨습니다.\n";
if (product[i].num > 0)
cout << i << ". " << product[i].name << " " << product[i].num << "개\n";
cin >> wantNum;
if (product[wantProduct].num >= wantNum){
money += product[wantProduct].price * wantNum;
product[wantProduct].num -= wantNum;
cout << product[wantProduct].name << "을 " << wantNum << "개 취소하셨습니다.\n";
- The Trip/Celfin . . . . 7 matches
int student_num, i, j, sum, average;
for(j=1; j<student_num+1; j++)
average = sum/student_num;
for(j=1; j<student_num+1; j++)
while(cin>>student_num)
if(student_num==0)
for(i=1; i<student_num+1; i++)
- TheGrandDinner/하기웅 . . . . 7 matches
int number;
int memberNum;
int number;
int chairNum;
return a.memberNum>b.memberNum;
return a.number<b.number;
return a.chairNum>b.chairNum;
for(j=1; j<team[i].memberNum+1; j++)
for(j=1; j<team[i].memberNum+1; j++)
if(team[i].memberNum>input2)
if(nTable[j].chairNum>0)
nTable[j].chairNum--;
team[i].person[j] = nTable[j].number;
sort(&team[i].person[1], &team[i].person[team[i].memberNum+1]);
cin >> team[i].memberNum;
team[i].number=i;
cin >> nTable[i].chairNum;
nTable[i].number=i;
- VendingMachine_참관자 . . . . 7 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);
- 개인키,공개키/강희경,조동영 . . . . 7 matches
char num;
while(fin.get(num))
num += 47 ;
fout << num;
while (fin1.get(num))
num += open_key;
fout1 << num;
- 골콘다 . . . . 7 matches
* http://www.pressian.com/section/section_article.asp?article_num=30020712101537&s_menu=경제
* http://www.pressian.com/section/section_article.asp?article_num=30020708191625&s_menu=경제
* http://www.pressian.com/section/section_article.asp?article_num=30020708114245&s_menu=경제
* http://www.pressian.com/section/section_article.asp?article_num=30020628153802&s_menu=경제
* http://www.pressian.com/section/section_article.asp?article_num=30020627120439&s_menu=경제
* http://www.pressian.com/section/menu/search_thema.asp?article_num=20
* http://www.pressian.com/section/section_article.asp?article_num=30020617162652&s_menu=경제
- 데블스캠프2009/월요일/연습문제/svn코드레이스/박근수 . . . . 7 matches
int number = rand()%50+1;
printf("이거슨 업다운 게임~\n답은 %d\n",number);
while(a!=number)
else if(a<number)
else if(a>number)
if(number==min+1&&number==max-1)
- 새싹교실/2011/데미안반 . . . . 7 matches
int num, i;
num=rand()%5;
printf("%d ",num);
int num,i,min=0,max=99;
num=rand()%100;
if(num>i){
}else if(num<i){
- 새싹교실/2013/록구록구/3회차 . . . . 7 matches
int num = 0;
while(num < 4)
printf("☆★☆★☆\n", num);
num++;
int num=0;
while(num<4)
num++;
- 2010php/방명록만들기 . . . . 6 matches
$record_number = mysql_num_rows($result);
if( $record_number % $scale == 0)
$total_page = floor($record_number / $scale );
$total_page = floor($record_number / $scale) + 1;
for( $i = $start; $i < $start + $scale && $i < $record_number; $i++){
- 3 N+1 Problem/조동영 . . . . 6 matches
int num1, num2;
cin >> num1 >> num2;
cout << "MAX cycle-length값은 " << CheckCount(num1,num2) << "입니다." << endl;
- 3n 1/Celfin . . . . 6 matches
int countNum, cycle, i, start, end;
int cycleNumber(int number)
countNum=1;
while(number!=1)
if(number%2==0)
number /=2;
countNum++;
number = (3*number +1)/2;
countNum+=2;
return countNum;
if(cycleNumber(i)>cycle)
cycle = cycleNumber(i);
- AseParserByJhs . . . . 6 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여름/학점계산프로그램/문보창 . . . . 6 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;
- LinkedList/숙제 . . . . 6 matches
int num;
int num;
printf("%d\n",p->num);
pList->num=1; // 이 구조체 번호가 1번인 것을 표시한다.
pNew->num=2; // 두번째 struct인 것을 표시한다.
pIns->num=3; // 3번째 struct란 것을 표시.
- MagicSquare/동기 . . . . 6 matches
int number[9][9]={{0,},};
number[y][x]=count;
if (number[y][x]==0)
number[y][x]=count;
number[newy][newx]=count;
cout << number[p][l]<<"\t";
- Monocycle/김상섭 . . . . 6 matches
int turn_num;
next.pre_turn = next.turn_num = NULL;
if(next.turn_num < Max_turn)
next.turn_num++;
next.turn_num++;
next.turn_num++;
- SOLDIERS/송지원 . . . . 6 matches
int num;
scanf("%d", &num);
for(i=1; i<=num; i++)
sort(x+1, x+num+1);
sort(y+1, y+num+1);
for(j = 1; j <= num; j++){
- SeminarHowToProgramIt/Pipe/VendingMachineParser.py . . . . 6 matches
def next_number(self,func=int):
return self.err('Expected a number, not '+tok)
num=self.next_number()
if num not in (10,50,100,500,1000):
return num
- Temp/Parser . . . . 6 matches
def next_number(self,func=int):
return self.err('Expected a number, not '+tok)
num=self.next_number()
if num not in (10,50,100,500,1000):
return num
- WeightsAndMeasures/신재동 . . . . 6 matches
numsStr = raw_input().split(' ')
if(numsStr == ['']):
weight = int(numsStr[0])
strength = int(numsStr[1])
numOfTurtle = pileUpTurtles(turtles)
print numOfTurtle
- XOR삼각형/이태양 . . . . 6 matches
int computeXor(int num1, int num2)
return xor[num1+1][num2] ^ xor[num1+1][num2+1];
- 데블스캠프2006/월요일/연습문제/for/성우용 . . . . 6 matches
int num, fac = 1;
cin >> num;
if (num > 10)
for (; num > 0; num--)
fac *= num;
- 데블스캠프2006/월요일/연습문제/if-else/임다찬 . . . . 6 matches
int number;
cin >> number;
if(number >= 50 && number <= 100){
for(int i = 1; i < number; i++){
for(i=1;i<number;i++){
- 데블스캠프2013/셋째날/머신러닝 . . . . 6 matches
const int Label_Num=20;
const int Word_Num=8165;
const int News_Num=11293;
int Labels[Label_Num]={0,};
int Labels_Number[Label_Num]={0,};
int Words[Word_Num]={0,};
float Words_Sum[Label_Num][Word_Num]={0,};
//int News[News_Num];
for(int k=0;k<News_Num;k++){
for(int i=0;i<Word_Num-1;i++){
int Label_turn_num;
Label_turn_num=i;
Labels_Number[i]++;
for(int i=0;i<Word_Num-1;i++){
Words_Sum[Label_turn_num][i]+=Words[i];
Words_Sum[Label_turn_num][19]+=Words[19];
for(int k=0; k<Label_Num; k++){
for(int i=0; i<Word_Num; i++){
Words_Sum[k][i]/=Labels_Number[k];
int Test_Word_Num[Word_Num]={0,};
- 변준원 . . . . 6 matches
int number=0;
number++;
int count=0, number=0;//엔딩수, 이동수 지정
number++;
number++;
cout << "바퀴벌레의 이동횟수는 " << number << "입니다." << endl;
- 새싹교실/2011/學高/8회차 . . . . 6 matches
void hanoi(char from,char to,char mid,int num){
if(num>0){
int numOfRings;
scanf("%d",&numOfRings);
hanoi('A','C','B',numOfRings);
* 컴파일은 안 해봤지만 함수 원형 선언 시 매개변수의 타입은 왜 써주지 않았는지 궁금하네요. 받을 때는 num으로 받고 쓸 때는 n으로 쓴 것도; 그리고 전역 변수를 안 써도 리턴 값을 통해 카운트 충분히 할 수 있을 것 같은데... - [김수경]
- 새싹교실/2012/AClass/4회차 . . . . 6 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를 이용한 변수의 값을 서로 연산을 해보면 정확하게 값이 나온다.
- 새싹교실/2013/라이히스아우토반/3회차 . . . . 6 matches
int num1 = rand()%10000; //rand()는 임의의 수를 돌려주는 함수.
int num2 = rand()%10000;
int sub = num1-num2;
printf("%d-%i는 뭘까요? : ",num1,num2);
- 새싹교실/2013/양반/3회차 . . . . 6 matches
if(num1 < num2)
if(num1 < num3)
min = num1;
min = num3;
- 수/마름모출력 . . . . 6 matches
int i, j, num, pat;
scanf(" %d", &num);
for(i=1; i<=num; i++){ // 상 삼각형
for(j=0; j<num-i; j++)
for(i=num-1; i>=1; i--){ // 하 삼각형
for(j=0; j<num-i; j++)
- 스네이크바이트/C++ . . . . 6 matches
const int numberOfStudent = 10;//학생 수
student stu[numberOfStudent] =
for(i = 0; i < numberOfStudent; i++)
for(i = 0; i < numberOfStudent; i++)
for(i = 0; i < numberOfStudent; i++)
for(i = 0; i < numberOfStudent; i++)
- 영호의해킹공부페이지 . . . . 6 matches
2) Now dial '080' and wait for the fast engaged signal [Wyzewun: Number
4) Now the phone has 080 on the screen and then you can dial the number you
want. Also note that if you want to dial a local number you must enter the
(toll free) number.
XXXXXXXXXX (master code) is a 10 digit code, based on the IMEI number of your
Carrier number
Cell Identification (CELL ID, number of the cell being used)
- 코드레이스/2007.03.24상섭수생형진 . . . . 6 matches
int num, year, month, day, hour, min, sec, cnt = 0;
cin >> num;
for(int i=0; i<num; i++)
int num, year, month, day, hour, min, sec, cnt = 0;
cin >> num;
for(int i=0; i<num; i++)
- 토이/숫자뒤집기/임영동 . . . . 6 matches
int inputNumber=Integer.parseInt(JOptionPane.showInputDialog(null, "Input a number that you want to reverse."));
int reversedNumber=reverse(inputNumber);//뒤집을 숫자를 입력받고 reverse()호출
JOptionPane.showMessageDialog(null, "Reversed Number: "+reversedNumber);
public static int reverse(int number)
while(number>0)
reversed=reversed+(number%10);
number=number/10;
int returnNumber=Integer.parseInt(reversed);
return returnNumber;//문자열을 정수형으로 바꿔 리턴
- 피보나치/김영록 . . . . 6 matches
static int number_output;
else number_output = b;
int number_input;
scanf("%d",&number_input);
pi(number_input);
printf("%d",number_output);
- 희경/엘레베이터 . . . . 6 matches
int number;
fin >> number;
cout << number << "층짜리 건물입니다." << endl;
int number;
fin >> number;
cout << number << "층짜리 건물입니다." << endl;
- 1thPCinCAUCSE/ExtremePair전략 . . . . 5 matches
int numOfData;
cin >> numOfData;
for(int i=0;i<numOfData;i++)
for(int i=0;i<numOfData;i++)
for(int i=0;i<numOfData;i++)
- 2002년도ACM문제샘플풀이/문제B . . . . 5 matches
int numOfData;
cin >> numOfData;
for(int i=0;i<numOfData;i++)
for(int i=0;i<numOfData;i++)
int addNumber = 40320;
addNumber /= (8-j);
outputData[i] += addNumber * index;
for(int i=0;i<numOfData;i++)
- AcceleratedC++/Chapter3 . . . . 5 matches
// the number and sum of grades read so far
int num = 0;
// num을 0으로 초기화해준다.
int num;
// num에는 무슨 값이 들어갈까? 책에는 undefined라고 써있다. 메모리에 있던 쓰레기값이 들어가게 된다.
- ClassifyByAnagram/sun . . . . 5 matches
for( Enumeration e=table.keys(); e.hasMoreElements(); ) {
for( Enumeration e=result.elements(); e.hasMoreElements(); ) {
for( Enumeration e=result.elements(); e.hasMoreElements(); ) {
for( Enumeration e=result.elements(); e.hasMoreElements(); ) {
for( Enumeration e=result.elements(); e.hasMoreElements(); ) {
- GoodNumber . . . . 5 matches
Good number 는 원래 수의 각 자리수의 합과 곱이 원래 수와 같은 소인수들의 각 자리수의 합이 같은 수들을 말합니다. 소수는 자신의 소인수가 자기 자신이기 때문에 포함이 됩니다.
예를 들어 수자 22의 각 자리수의 합은 (2+2=4)입니다. 곱이 원래 수인 소인수는 (2*11=22)입니다. 이들 소인수의 각자리수의 합은 (2+1+1=4)입니다. 그래서 정의에 의해서 수 22는 good number입니다.
1부터 32767사이의 임의의 수 한개에 대해서 good number인지를 결정하시오.
* 6036 is a good number.
* 5436 is not a good number.
- LinkedList/C숙제예제 . . . . 5 matches
int num;
printf("%d\n",p->num);
pList->num=1;
pNew->num=2;
pIns->num=3;
- OurMajorLangIsCAndCPlusPlus/print/이상규 . . . . 5 matches
print("number: %d, string: %s, real number: %f\n", a, b, c);
print("number: %5d\n", a);
print("number: %5d\n", b);
print("number: %5d\n", c);
- ReverseAndAdd/황재선 . . . . 5 matches
def printRepeatNum(self, num):
for i in range(0,num*2,2):
num = input()
for testcase in range(num):
r.printRepeatNum(num)
- Steps/하기웅 . . . . 5 matches
int testcase, x, y, sqrtNum, powNum;
int showResult(int number)
sqrtNum = floor(sqrt(number-1));
powNum = sqrtNum * sqrtNum;
if(number==0)
else if(number>powNum && number<=(powNum+sqrtNum))
return 2*sqrtNum;
return 2*sqrtNum+1;
- TheJavaMan/스네이크바이트 . . . . 5 matches
int num;
for(int i=0; i<num ; i++){
for(int i=0; i<=num ; i++){
for(int j=2; j<num ; j++)
bo.num = v.size();
- VendingMachine/재니 . . . . 5 matches
int selection, num;
while (selection < 1 || selection > num){
if (selection < 1 || selection > num)
num = 4;
num = 3;
- radiohead4us/SQLPractice . . . . 5 matches
2. Find all loan numbers for loans made at the Perryridge branch with loan amounts greater that $1200. (4.2.2 The where Clause)
3. For all customers who have a loan from the bank, find their names, loan numbers and loan amount. (4.2.3 The from Clause)
4. Find the customer names, loan numbers, and loan amounts for all loans at the Perryridge branch. (4.2.3 The from Clause)
5. For all customers who have a loan from the bank, find their names, loan numbers, and loan amount. (4.2.5 Tuple Variables)
9. Find the number of depositors for each branch. (4.4 Aggregate Functions)
- 데블스캠프2006/월요일/연습문제/기타문제/윤성준 . . . . 5 matches
int num;
cin >> num;
if (num >= 1 && num <= 10) {
for (int i = 1; i <= num; i++) {
- 데블스캠프2009/목요일/연습문제/MFC/송지원 . . . . 5 matches
enum { IDD = IDD_TEST_DIALOG };
afx_msg void fourOp(int num);
enum { IDD = IDD_ABOUTBOX };
void CTestDlg::fourOp(int num){
opFlag = num;
- 몸짱프로젝트/CrossReference . . . . 5 matches
string toString(int aNum);
int num_of_node = 0;
num_of_node++;
string toString(int aNum) // 줄수를 string 객체로 바꾸는 함수
if ( aNum / 1000 != 0 ){
temp[0] = aNum / 1000 + 48;
temp[1] = aNum % 1000 / 100 + 48;
temp[2] = aNum % 100 / 10 + 48;
temp[3] = aNum % 10 + 48;
else if ( aNum / 100 != 0 ){
temp[0] = aNum / 100 + 48;
temp[1] = aNum % 100 / 10 + 48;
temp[2] = aNum % 10 + 48;
else if ( aNum / 10 != 0 ){
temp[0] = aNum / 10 + 48;
temp[1] = aNum % 10 + 48;
else if ( aNum > 0 ){
temp[0] = aNum + 48;
string number(temp);
return number;
- 새싹교실/2012/아우토반/뒷반/4.13 . . . . 5 matches
int number;
printf("number? : ");
scanf("%d",&number);
v=number;
for(a=1 ; a<=number ; a++)
- 압축알고리즘/홍선,수민 . . . . 5 matches
int start_Number, end_Number;
bool ing_Number=false;
if(ing_Number)
end_Number= index;
if(!ing_Number)
ing_Number=true;
start_Number = index;
end_Number= index;
else if(ing_Number)
ing_Number=false;
int i=0,j, number;
number=0;
for(j=start_Number ;j<= end_Number;j++)
number = number*10 +(int)(buffer[j])-48;
for(int k=0;k<number;k++)
cout << buffer[end_Number+1];
- 이차함수그리기/조현태 . . . . 5 matches
int banollim(float number)
float temp_sosu=number-(int)number;
++number;
return number;
- 최소정수의합/최경현 . . . . 5 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);
- 피보나치/방선희 . . . . 5 matches
int num;
cin >> num;
pibo(num);
cout << "피보나치 수열의 " << num << "번째 원소는 " << pibo(num) << "입니다.\n";
- 헝가리안표기법 . . . . 5 matches
|| n || int || number, quantity || int nNum ||
|| e || enum || variable which takes enumerated values || ... ||
|| E || enum || Enumerated type || ... ||
- 1thPCinCAUCSE/ProblemA/Solution/zennith . . . . 4 matches
int num, input[4], i, j, output[10] = {0, };
scanf("%d", &num);
i = 0, j = num;
while (num--)
- AndOnAChessBoard/허준수 . . . . 4 matches
double num = ceil((double)sqrt(input)) ;
return (int)num;
int num = line*line;
if(input == num - i + 1) break;
- BasicJAVA2005/실습1/송수생 . . . . 4 matches
Random number = new Random();
arry[i]=number.nextInt(9);
Scanner scannumber = new Scanner(System.in);
temp[i]=scannumber.nextInt();
- BlueZ . . . . 4 matches
int max_rsp, num_rsp;
num_rsp = hci_inquiry(dev_id, len, max_rsp, NULL, &ii, flags);
if( num_rsp < 0 ) perror("hci_inquiry");
for (i = 0; i < num_rsp; i++) {
- C++스터디_2005여름/학점계산프로그램/허아영 . . . . 4 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++)
- CarmichaelNumbers . . . . 4 matches
=== About [CarmichaelNumbers] ===
The number 1729 is a Carmichael number.
The number 561 is a Carmichael number.
|| [문보창] || C++ || 3h 30m || [CarmichaelNumbers/문보창] ||
|| [조현태] || C || . || [CarmichaelNumbers/조현태] ||
- EcologicalBinPacking/임인택 . . . . 4 matches
num=[int(str[0])-1, int(str[1])+2, int(str[2])+5]
if not (i== num[0] or \
i== num[1] or \
i== num[2] ):
- EightQueenProblem/이선우 . . . . 4 matches
private int numberOfBoard;
numberOfBoard = 0;
numberOfBoard ++;
public void printNumberOfBoard()
System.out.println( "Number of different board: " + numberOfBoard );
nq.printNumberOfBoard();
- HanoiTowerTroublesAgain!/문보창 . . . . 4 matches
int number = 1;
if (stick[i] == 0 || isSqure(stick[i] + number))
stick[i] = number++;
cout << number - 1 << endl;
- HelpOnLists . . . . 4 matches
A numbered list, mixed with bullets:
Variations of numbered lists:
A numbered list, mixed with bullets:
Variations of numbered lists:
- HowManyFibs?/황재선 . . . . 4 matches
public void printNumOfFibs(int numOfFibs) {
System.out.println(numOfFibs);
int numOfFibs = fib.howManyFib(start, end);
fib.printNumOfFibs(numOfFibs);
- JavaStudy2003/두번째과제/노수민 . . . . 4 matches
public int process(int number) {
if(number!=1)
return number*process(number-1);
- LUA_2 . . . . 4 matches
number
이제 각각의 자료형은 좀 더 자세히 살펴 보겠습니다. 우선 number 부터 살펴 보겠습니다.
number는 정수형, 실수형,지수형이 있을 수 있습니다.
> sum = 10 + 10 --- 기본적인 number 대입
- Marbles/문보창 . . . . 4 matches
Marble find_number_box(int n1, int n2, int n);
marble = find_number_box(n1, n2, n);
marble = find_number_box(n2, n1, n);
Marble find_number_box(int n1, int n2, int n)
- NamedPipe . . . . 4 matches
&cbBytesRead, // number of bytes read
cbReplyBytes, // number of bytes to write
&cbWritten, // number of bytes written
&cbRead, // number of bytes read
- SmithNumbers/신재동 . . . . 4 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;
- StringOfCPlusPlus/상협 . . . . 4 matches
enum {LEN=70};
int number=0;
number++;
return number;
- SuperMarket/세연 . . . . 4 matches
int max_num;
max_num = 3;
for(int i = 0 ; i < max_num ; i++)
for(int i = 0 ; i < max_num ; i++)
- zennith/source . . . . 4 matches
int num;
printf("Enter Number : ");
scanf("%d", &num);
do fac *= num; while (--num);
- 데블스캠프2009/수요일/JUnit/서민관 . . . . 4 matches
public double calculate(char op, int num1, int num2)
operand1 = num1;
operand2 = num2;
- 데블스캠프2009/월요일/연습문제/svn코드레이스/서민관 . . . . 4 matches
int num = 0, ent, min = 1, max = 50;
num = rand()%50+1;
else if(ent<num && ent>0)
else if(ent>num && ent<=50)
- 알고리즘3주숙제 . . . . 4 matches
Consider the following problem: one has a directory containing a set of names and a telephone number associated with each name.
names (1..n) ; numbers (1..n)
Given a name and the value n the problem is to find the number associated with the name.
Note: The algorithm below works for any number base, e.g. binary, decimal, hexadecimal, etc. We use decimal simply for convenience.
- 알고리즘8주숙제/test . . . . 4 matches
int numCase;
cin >> numCase;
fout << numCase << endl;
for (int i = 1; i <= numCase; i++)
- 양아석 . . . . 4 matches
repeat(function,num)
fun 을 num만큼 반복
=for number in range(num)
- 오목/재니형준원 . . . . 4 matches
int number;
number=0;
omokBoard[row][col] = ++number;
if(number % 2 == 0)
- 자리수알아내기/나휘동 . . . . 4 matches
numDigit 0 base = 0
numDigit n base = 1 + numDigit (div n base) base
numDigit n base = ceiling (logBase base n) + 1
- 주민등록번호확인하기/문보창 . . . . 4 matches
==== {{{~cpp SocialNumber.java}}} ====
public class SocialNumber
private String num;
num = input.next();
int validateNum[] = {2,3,4,5,6,7,8,9,2,3,4,5};
int key = (int)num.charAt(12) - 48;
sum += ((int)num.charAt(i) - 48) * validateNum[i];
public class TestSocialNumber
SocialNumber socialNum = new SocialNumber();
socialNum.input();
boolean isRight = socialNum.validate();
- 최소정수의합/조현태 . . . . 4 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).
- 튜터링/2011/어셈블리언어 . . . . 4 matches
number byte ?
mov number, al
cmp number, 1
movzx edx, number
- 파스칼삼각형/김영록 . . . . 4 matches
int num_ret(int X, int Y) //재귀호출 1인경우(X=1,X=Y)엔 1을 리턴하는방식
return num_ret(X-1,Y-1)+ num_ret(X,Y-1);
cout << num_ret(X,Y) <<"입니다! ㅋㅋ" << endl;
- 프로그래밍/장보기 . . . . 4 matches
public static int processOneCase(int num) {
double [][] rates = new double[num][2];
for(int i = 0; i < num; i++) {
for(int i = 1; i < num; i++) {
- 8queen/민강근 . . . . 3 matches
int num=0;
num++;
}while(num<8);
- ErdosNumbers/황재선 . . . . 3 matches
public class ErdosNumbers {
ErdosNumbers() {
private void setErdosNumber(String[] people) {
private void printErdosNumber(int scenario, int name) {
ErdosNumbers erdos = new ErdosNumbers();
String [] nums = erdos.readLine().split(" ");
int paper = Integer.parseInt(nums[0]);
int name = Integer.parseInt(nums[1]);
erdos.setErdosNumber(people);
erdos.printErdosNumber(testCase, name);
public class TestErdosNumbers extends TestCase {
ErdosNumbers en = new ErdosNumbers();
ErdosNumbers
- FactorialFactors/조현태 . . . . 3 matches
cin >> input_number;
cout << factorial_factors(input_number) << "\n";
cin >> input_number;
- FromDuskTillDawn/조현태 . . . . 3 matches
int numberOfTestCase = 0;
sscanf(readData, "%d", &numberOfTestCase);
for (register int i = 0; i < numberOfTestCase; ++i)
- GofStructureDiagramConsideredHarmful . . . . 3 matches
Diagrams are seductive, especially to engineers. Diagrams communicate a great deal in a small amount of space. But in the case of the GoF Structure Diagrams, the picture doesn't say enough. It is far more important to convey to readers that a Pattern has numerous Structures, and can be implemented in numerous ways.
I routinely ask folks to add the word "SAMPLE" to each GoF Structure diagram in the Design Patterns book. In the future, I'd much prefer to see sketches of numerous structures for each Pattern, so readers can quickly understand that there isn't just one way to implement a Pattern. But if an author will take that step, I'd suggest going even further: loose the GoF style altogether and communicate via a pattern language, rich with diagrams, strong language, code and stories.
- HowManyFibs?/하기웅 . . . . 3 matches
BigInteger decimalNum=10;
BigInteger fibNum[501];
fibNum[1] = 1;
fibNum[2] = 2;
fibNum[i] = fibNum[i-1]+ fibNum[i-2];
int output(BigInteger startNum, BigInteger endNum)
if(fibNum[i]>=startNum && fibNum[i]<=endNum)
BigInteger convertBig(char *number)
int charLen = strlen(number);
temp = temp + (*(number++)-48)*decimalNum.Power(charLen-i-1);
- JollyJumpers/신재동 . . . . 3 matches
private void inputNumbers(Vector list) {
String [] numbersStr = line.split(" ");
for(int i = 0; i < numbersStr.length; i++) {
list.add(new Integer(Integer.parseInt(numbersStr[i])));
jollyJumper.inputNumbers(list);
- MineSweeper/이승한 . . . . 3 matches
set_all_num = 0;
//size*size 사이즈의 2중 배열의 모든 원소를 set_all_num값으로 초기화
map[i][j] = set_all_num;
- MoniWikiPo . . . . 3 matches
msgid "Number of Pages"
msgid "Toggle line numbers"
"<b>Lists:</b> space and one of * bullets; 1., a., A., i., I. numbered "
"1.#n start numbering at n; space alone indents.<br />\n"
- MoreEffectiveC++/Basic . . . . 3 matches
double result = static_cast(double, firstNumber)/ secondNumber;
void printBSTArray( ostream& s, const BST array[], int numElements)
for ( int i = 0; i < numElements; ++i ){
for( int i = the number of elements in the array -1; i>0; --i)
EquipmentPiece(int IDNumber);
bestPiece[1] = new EquipmentPiece( ID Number );
new (bestPieces+1) EquipmentPiece ( ID Number ); // 이건 placement new 라고 하여 Item 8 에서 언급한다.
- MoreEffectiveC++/Operator . . . . 3 matches
Rational( int numerator = 0, int denominator = 1);
ArraySize(int numElements):theSize(numElements){}
- NSIS/예제3 . . . . 3 matches
[http://zeropage.org/~reset/zb/download.php?id=KDP_board_image&page=1&page_num=20&category=&sn=&ss=on&sc=on&keyword=&prev_no=&select_arrange=headnum&desc=&no=50&filenum=1 만들어진Installer] - 실행가능.
- OurMajorLangIsCAndCPlusPlus/2006.2.06/김상섭 . . . . 3 matches
explicit newstring::newstring(int num)
ch = new char[num];
for(int i =0; i < num; i++)
- OurMajorLangIsCAndCPlusPlus/ctype.h . . . . 3 matches
|| intsalnum(int c) || 알파벳 숫자임을 체크한다. ||
|| int isalnum(int c) || 주어진 문자가 알파벳 또는 숫자인지 검사한다. A-Z a-z 0-9 ||
|| int iswalnum(wint_t) || 주어진 문자가 알파벳 또는 숫자인지 검사한다.||
- OurMajorLangIsCAndCPlusPlus/stdlib.h . . . . 3 matches
|| div_t div(int numer, int denom); || 전달인자의 numer를 denom으로 나눈 값과 나머지를 구조체형식으로 리턴 ||
|| ldiv_t ldiv(long int numer, long int denom); || div()와 동일하고 변수 타입만 long int ||
- PythonForStatement . . . . 3 matches
These represent finite ordered sets indexed by non-negative numbers. The built-in function len() returns the number of items of a sequence. When the length of a sequence is n, the index set contains the numbers 0, 1, ..., n-1. Item i of sequence a is selected by a[i].
- Robbery/조현태 . . . . 3 matches
for (int testCaseNumber = 1; ; ++testCaseNumber)
int numberOfMessage;
scanf("%d", &numberOfMessage);
for (register int i = 0; i < numberOfMessage; ++i)
cout << "Robbery #" << testCaseNumber << ":" << endl;
- Slurpys/곽세환 . . . . 3 matches
int numberOfCase;
cin >> numberOfCase;
for (testCase = 0; testCase < numberOfCase; testCase++)
- Slurpys/황재선 . . . . 3 matches
for num in range(size):
for num in range(size):
print slurpy.result[num]
- ThePriestMathematician/김상섭 . . . . 3 matches
int num;
while(cin >> num)
test.push_back(num);
- ViImproved/설명서 . . . . 3 matches
! send next to commend, replace output(eg !) R 삽입모드가 남을때까지 교체 (즉 ESC를 누를 때까지) :set number 라인번호 붙이기
number(nu) nonumber 터미날로 입력되는 메시지를 가능하게 함
- whiteblue/MyTermProject . . . . 3 matches
int number;
cout << l[i].name << "\t" << l[i].number << " " << *(n+(i*14)) << endl;
cout << m[i].name << "\t" << m[i].number << " "<< m[i].kor
- whiteblue/MyTermProjectForClass . . . . 3 matches
int number;
int showNumber(int select);
int showNum();
int tempNumber;
int arrayNumber[20];
int subNumber();
number = nu;
int Data::showNumber(int select)
int Data::showNum()
return number;
arrayNumber[i] = i;
stData[k] = d[k].showNumber(select); //
tempNumber = arrayNumber[i];
arrayNumber[i] = arrayNumber[j];
arrayNumber[j] = tempNumber;
cout << d[arrayNumber[i]].showName()
<< "\t" << d[arrayNumber[i]].showNum()
<< "\t" << d[arrayNumber[i]].showNumber(1)
<< "\t" << d[arrayNumber[i]].showNumber(2)
<< "\t" << d[arrayNumber[i]].showNumber(3)
- 데블스캠프2006/CPPFileInput . . . . 3 matches
float num;
num = atof(temp.c_str());
cout << num;
- 데블스캠프2006/월요일/연습문제/for/임다찬 . . . . 3 matches
int number;
cin >> number;
cout << factorial(number) << endl;
- 데블스캠프2009/수요일/OOP/박준호 . . . . 3 matches
int num (int x)
int num (int x, int y)
int num (int x, int y, int z)
- 새싹교실/2012/AClass . . . . 3 matches
int num;
scanf("%d", &num);
switch(num/10){
- 새싹교실/2012/아우토반/앞반/4.5 . . . . 3 matches
int num;
scanf("%d",&num);
printf("%c",'A'+num-1);
- 스택/조재화 . . . . 3 matches
void show_num();
case 3: show_num();
void show_num()
- 알고리즘2주숙제 . . . . 3 matches
6. Let a<sub>r</sub> be the number of ways to select r balls from 3 red balls, 2 green balls, and 5 white balls.
7. Let a<sub>r</sub> be the number of ways r cents worth of postage can be placed on a letter using only 5c, 12c, and 25c stamps. The positions of the stamps on the letter do not matter.
8. Let a<sub>r</sub> be the number of ways to pay for an item costing r cents with pennies, nickels, and dimes.
- 압축알고리즘/태훈,휘동 . . . . 3 matches
int num;
fin >> num; // 포인트...
for ( int i = 0 ; i < num ; i++ )
- 정렬/변준원 . . . . 3 matches
fin >> number[i];
if(number[j] < number[k])
- 테트리스만들기2006/예제1 . . . . 3 matches
int number = 0;
printf("%d", number);
++number;
- 파일 입출력_1 . . . . 3 matches
float num;
num = atof(temp.c_str());
cout << num;
- 프로그래밍/DigitGenerator . . . . 3 matches
int number = Integer.parseInt(line);
for(int i = 1; i < number; i++) {
if (i + bitSum == number) {
- CarmichaelNumbers/문보창 . . . . 2 matches
Carmichael Numbers를 찾는 Theorem이 있는 듯하다. 그러나 때려맞추기(?)로 문제를 풀어도 풀린다. 그러나 속도는 떨어진다.
// no10006 - Carmichael Numbers
cout << "The number " << n << " is a Carmichael number.\n";
[CarmichaelNumbers] [AOI]
- Classes . . . . 2 matches
[http://www.yes24.com/Goods/FTGoodsView.aspx?goodsNo=1949638&CategoryNumber=002001026004 Advanced Engineering Mathematics 9/E]
[http://cslab.cse.cau.ac.kr/lecture_view.asp?num=1 Home]
set number
- Class로 계산기 짜기 . . . . 2 matches
int firstNumber;
int secondNumber;
int resultNumber;
void setFirstNumber(int firstNumber){ this->firstNumber = firstNumber;}
void setSecondNumber(int secondNumber){ this->secondNumber = secondNumber;}
void setResultNumber(int resultNumber){ this->resultNumber = resultNumber;}
int getFirstNumber(){ return firstNumber;}
int getSecondNumber(){ return secondNumber;}
int getResultNumber(){ return resultNumber;}
class NumberInputer
inputFirstNumber(memory);
inputSecondNumber(memory);
void inputFirstNumber(Memory * memory)
int firstNumber;
cin >> firstNumber;
memory->setFirstNumber(firstNumber);
void inputSecondNumber(Memory * memory)
int secondNumber;
cin >> secondNumber;
memory->setSecondNumber(secondNumber);
- Garbage collector for C and C++ . . . . 2 matches
# -DSAVE_CALL_COUNT=<n> Set the number of call frames saved with objects
# -DSAVE_CALL_NARGS=<n> Set the number of functions arguments to be
- Hartals/조현태 . . . . 2 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)
- Java/ReflectionForInnerClass . . . . 2 matches
[http://groups.google.co.kr/groups?hl=ko&lr=&ie=UTF-8&oe=UTF-8&newwindow=1&threadm=3A1C1C6E.37E63FFD%40cwcom.net&rnum=4&prev=/groups%3Fq%3Djava%2Breflection%2Binnerclass%26hl%3Dko%26lr%3D%26ie%3DUTF-8%26oe%3DUTF-8%26newwindow%3D1%26selm%3D3A1C1C6E.37E63FFD%2540cwcom.net%26rnum%3D4 구글에서 찾은 답변]
- MoinMoinTodo . . . . 2 matches
* Link icon to IsbnInfo page, and the ISBN number itself to the main URL
* System Info: number edits, views, whatever.
- MoreEffectiveC++/Miscellany . . . . 2 matches
* '''새로운 개념의 추가''' : RTTI, namespace, bool, mutable과 explicit keyword, enum을 위한 오벌드(overload) 연산자 능력, 클래스 정의 내부에서 이용한 완전한 정적 클래스 멤버 초기화 증력
string 형의 디자인에 반영된 이러한 접근은-템플릿의 일반화- 표준 C++ 라이브러리를 통해서 반복되어 진다. IOStream? 그들은 템플릿이다.; 인자(type parameter)는 스트림에서 만들어지는 문자형으로 정의되어 있다. 복잡한 숫자(Complex number)? 역시 템플릿이다.;인자(type parameter)는 숫자를 어떻게 저장할지 정의되어 있다. Valarray? 템플릿이다.;인자(type parameter)는 각 배열에 최적화된다. 그리고 STL은 거의 모든 템플릿의 복합체이다. 만약 당신이 템플릿에 익숙하지 않다면, 지금 한발작 내디뎌 보아라.
- OpenGL스터디 . . . . 2 matches
|| GLuint, GLenum, GLbitfield || 부호없는 32비트 정수 || unsigned long || ui ||
* enum은 열거형 boolean은 트루 폴스.
- R'sSource . . . . 2 matches
global savedNum
savedNum = 0
global savedNum
replayNum = 0
#replayNum가져오기
pattern = re.compile('(^<TABLE.*<a.*number=)(.*)&view=2.*\[1\].*')
lineNum = 0 #라인넘버초기화
lineNum = lineNum + 1
replayNum = matching.group(2)
print replayNum
#print '라인넘버 : %d' % lineNum
itemNum = 15
for i in range(int(replayNum), 0, itemNum * -1):
beReadingUrl = 'http://www.replays.co.kr/technote/main.cgi?board=bestreplay_pds&number=%d&view=2&howmanytext=' % i
print '%s 하위디렉토리에 총 %d 개의 리플레이를 저장하였습니다.' % (saveDirName , savedNum)
global savedNum
savedNum += 1
print ' %d 번째 rep화일저장중 : %s ' % (savedNum , fileName)
- Refactoring/ComposingMethods . . . . 2 matches
return _numberOfLateDeliveries > 5;
return (_numberOfLateDeliveries>5)?2:1;
- SuperMarket . . . . 2 matches
buy <product> <number> -- <product>를 <number>개 만큼 구매한다
- VMWare/OSImplementationTest . . . . 2 matches
[http://neri.cafe24.com/menu/bbs/view.php?id=kb&page=1&sn1=&divpage=1&sn=off&ss=on&sc=on&keyword=x86&select_arrange=headnum&desc=asc&no=264 출처보기]
mov al, 3h ; Number of sectors to read = 1
number of parameters.\n\n");
- WikiSlide . . . . 2 matches
=== enumerated list ===
1. second item (automatically enumerated)
- whiteblue/파일읽어오기 . . . . 2 matches
unsigned int nSchoolNumber; // User's school number
nSchoolNumber = nSN;
unsigned int getSchoolNumber() { return nSchoolNumber; }
int nBookNumber;
nBookNumber = nBN;
int getBookNumber() { return nBookNumber; }
int nNextBookNumber;
// Read the number of Book...
f.open("BookNumber.dat");
string szNextNum;
getline(f, szNextNum);
for (int k = 0 ; k < szNextNum.size() ; k++) // convert 'char' into 'int'
nTNN += ( szNextNum[k] - 48 ) * pow(10.0, nTNN2);
nNextBookNumber = nTNN;
unsigned int nTempNum = 0;
double nTempNum2 = 0.0;
string szTempNum(szTemp.begin(), szTemp.begin() + nT[0]);
nTempNum2 = szTempNum.size() - 1;
for (int j = 0 ; j < szTempNum.size() ; j++) // convert 'char' into 'int'
nTempNum += ( szTempNum[j] - 48 ) * pow(10.0, nTempNum2);
- 문제풀이/1회 . . . . 2 matches
def inputNum(v=[]):
inputNum_gen=inputNum()
maxMin=(inputNum_gen.next())
inputNum_gen=inputNum()
maxMin=(inputNum_gen.next())
input numbers with space:
inNums = [ int(i) for i in raw_input('input numbers with space:\n').split() ]
print 'max=%d min=%d' % (max(inNums),min(inNums))
- 새싹교실/2011/AmazingC . . . . 2 matches
* 따라서 scanf("%d",&number);에서 &는 number가 메모리에서 차지하고 있는 공간의 주소를 반환한다.(후에 포인터 배울때 중요한 개념)
- 새싹교실/2012/세싹 . . . . 2 matches
U16 SequenceNumber;
U16 NextAttributeNumber;
typedef enum {
U16 AttributeNumber;
U16 NumberOfHeads;
U64 VolumeSerialNumber;
printf("Number of this MFT Entry : 0x%02x%02x%02x%02x\n"
printf("Number of this MFT Entry : 0x%02x%02x%02x%02x\n"
unsigned __int64 num;
printf("Number of this MFT Entry : 0x%02x%02x%02x%02x\n"
- 스택/이태양 . . . . 2 matches
void push(int num)
stack[index++] =num;
- 쓰레드에관한잡담 . . . . 2 matches
int num = *(int *)arg;
printf("%d: sum+=%d\n", num, i);
- 이영호/끄적끄적 . . . . 2 matches
int num;
buf.num = array[i];
- 이영호/지뢰찾기 . . . . 2 matches
int num = (int)rand();
return num%limit;
- 임시 . . . . 2 matches
http://en.wikipedia.org/wiki/List_of_IPv4_protocol_numbers protocol number
an Amazon Standard Item Number (ASIN)
- 정규표현식/스터디/메타문자사용하기/예제 . . . . 2 matches
1. {{{[:alnum:][:alnum:]........}}}
- 정모 . . . . 2 matches
||||2023.01.11||[김은솔]||||||||Enum 왜 씀? Enum 쓸 바엔 뜨끈한 상수 든든하게 쓰고말지||
- 최소정수의합/문보창 . . . . 2 matches
int find_min_sum(int bound_num)
while ((n * n + n) / 2 < bound_num) n++;
- .vimrc . . . . 1 match
set number
- ACM_ICPC . . . . 1 match
* [http://acm.kaist.ac.kr/2008/fullnums.html 2008년 스탠딩] - ZeroPage Rank 30
- AirSpeedTemplateLibrary . . . . 1 match
A number of excellent templating mechanisms already exist for Python, including Cheetah, which has a syntax similar to Airspeed.
- Ant . . . . 1 match
make.gnumake,nmake,jam 과 같은 다른 Build 툴은 놔두고 왜 Ant 를 써야하는가에 대한 질문이다. Java 기반으로 프로그램을 짜고 컴파일 및 배포용 쉘 프로그램을 짜봤는가? 해봤다면 그것의 어려움을 잘 알것이다. 각 [OS] 마다 쉘 스크립트가 다르고 일반적으로 사용하고 있는 Unix 에는 또 각종 쉘들이 존재한다. 윈도우 쉘 또한 복잡하긴 매한가지이고 프로그램을 모두 작성하고 컴파일 및 배포 쉘 스크립트를 작성하기 위해서 이것들을 모두 작성하는것 자체가 프로그래머에게 또 하나의 고난이 아닐까 생각한다.(즉, 쉘 프로그램을 배워야 한다는 의미이다.)
- AsemblC++ . . . . 1 match
[http://www.google.co.kr/search?num=20&hl=ko&newwindow=1&client=firefox-a&rls=org.mozilla:ko-KR:official&q=disassembler&spell=1 역어셈블러 구글검색]
- BasicJAVA2005/실습2/허아영 . . . . 1 match
super("Random numbers ver.1");
- C/Assembly . . . . 1 match
-O# (# == number) Optimization Level
- CPPStudy_2005_1/STL성적처리_1 . . . . 1 match
#include <numeric>
- CPPStudy_2005_1/STL성적처리_2 . . . . 1 match
#include <numeric>
- Class/2006Fall . . . . 1 match
* [http://cslab.cse.cau.ac.kr/lecture_view.asp?num=6 Home]
- ComputerNetworkClass/Exam2006_2 . . . . 1 match
SSRC, CSRC, Contribution Count, timestamp, sequence number, Version etc 에대한 내용을 적고 해설
- CppStudy_2002_1 . . . . 1 match
* 버스 시물레이션 [http://www.sbc.pe.kr/cgi-bin/board/read.cgi?board=life&y_number=17&nnew=2]
- DataStructure/Stack . . . . 1 match
enum {Size=100};
- DebuggingSeminar_2005 . . . . 1 match
|| [http://www.compuware.com/products/numega.htm NuMega] || [SoftIce] , DevPartner 개발사 ||
- EdsgerDijkstra . . . . 1 match
* http://www.cs.utexas.edu/users/EWD/indexEWDnums.html - Dijkstra 의 컬럼들을 읽을 수 있는 곳.
- EightQueenProblemDiscussion . . . . 1 match
When the program is run, one has to give a number n (smaller than 32), and the program will return in how many ways n Queens can be put on a n by n board in such a way that they cannot beat each other.
- Gof/Visitor . . . . 1 match
- can enumerate its elements. [[BR]]
- Google/GoogleTalk . . . . 1 match
my $unencoded_url = 'http://www.google.com/search?hl=ko&num=10&q='.$q;
- HowManyZerosAndDigits/문보창 . . . . 1 match
double N; // number
- HowToStudyXp . . . . 1 match
* [http://groups.google.co.kr/groups?dq=&num=25&hl=ko&lr=&ie=UTF-8&newwindow=1&group=comp.object&start=0 news:comp.object]
- JavaScript/2011년스터디/JSON-js분석 . . . . 1 match
Number.prototype.toJSON =
Number.prototype.toJSON =
* str function에서 'string', 'number', 'boolean', 'null' 은 모두 string로 변환한다. 그런데 'object'의 NULL은 뭐지??
- Lines In The Plane . . . . 1 match
What is the maximum number L<sub>n</sub> of regions defined by lines("unfolding" or "unwinding") in the plane?
- MoreEffectiveC++/Exception . . . . 1 match
class PhoneNumber{ ... };
void addPhoneNumber(const PhoneNumber& number);
list<phoneNumber> thePhones;
- NumericPython . . . . 1 match
제가 해본 결과 반드시 numarray는 0.9버젼을 설치 하셔야 합니다.
- OperatingSystemClass/Exam2002_2 . . . . 1 match
7. Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 143, and the previous requrest was at cylinder 125. The queue of pending requests, in FIFO order, is
- OurMajorLangIsCAndCPlusPlus/string.h . . . . 1 match
|| char * strerror(int errnum) || Get a system error message (strerror, _wcserror) or prints a user-supplied error message (_strerror, __wcserror). ||
- ParserMarket . . . . 1 match
This is a marketplace for your parsers. Please state your name, your email, and the release your parser is developed for (if you used a CVS snapshot, also state the revision number).
- PerformanceTest . . . . 1 match
int getRandNum (int nBoundary);
int i, nRandNum, nLocation;
nRandNum = getRandNum (nBoundary);
nLocation = BinarySearch (nBoundary, S, nRandNum);
printf ("random number : %d \n", nRandNum);
int getRandNum (int nBoundary) {
단, 정확한 수행시간 측정을 위해서라면 전문 Profiling Tool을 이용해 보는 것은 어떨까요? NuMega DPS 같은 제품들은 수행시간 측정을 아주 편하게 할 수 있고 측정 결과도 소스 코드 레벨까지 지원해 줍니다. 마소 부록 CD에서 평가판을 찾을 수 있습니다. 단, 사용하실 때 Development Studio 가 조금 맛이 갈겁니다. 이거 나중에 NuMega DPS 지우시면 정상으로 돌아갑니다. 그럼 이만. -- '96 박성수
p.s. NuMega 제품들이 어떻게 수행시간 측정하는지 아시는 분 글 좀 올려주시죠?
NuMaga DPS 면 Dev-Partner Studio 말씀인가 보죠? (전에 Bound Checker 소문만 들어봐서..~) --[1002]
- ProgrammingLanguageClass/Report2002_1 . . . . 1 match
<constant> → any decimal numbers
- ProgrammingLanguageClass/Report2002_2 . . . . 1 match
1. To determine the largest and smallest positive floating point number in Intel Pentium processor.
- PyOpenGL . . . . 1 match
2.3x 버전의 경우는 설치할때 NumericPython 과 numpy 등의 모듈들을 같이 설치해주어야 한다.
- RSSAndAtomCompared . . . . 1 match
#pragma section-numbers off
- Refactoring/SimplifyingConditionalExpressions . . . . 1 match
return getBaseSpeed() - getLoadFactor() * _numberofCoconuts;
- ReverseAndAdd/김정현 . . . . 1 match
a=int(raw_input("number? "))
- Ruby/2011년스터디/서지혜 . . . . 1 match
printf("number of process = %d", countProcess);
- STL/map . . . . 1 match
warning 의 이유는 STL에서 나오는 디버그의 정보가 VC++ 디버그 정보를 위해 할당하는 공간(255byte)보다 많기 때문입니다. 보통 디버그 모드로 디버깅을 하지 않으면, Project setting에서 C/C++ 텝에서 Debug info 를 최소한 line number only 로 해놓으면 warning 는 없어 집니다. 그래도 warning 가 난다면 C/C++ 텝에서 Generate browse info 를 비활성(기본값)화 시키세요.
- SmallTalk/문법정리 . . . . 1 match
* 선택자는 특정한 기호(하나나 둘이상의 문자, 숫자가 아님)이고, 인수가 딱 하나만 있다.(the selector is one or two non-alphanumeric characters, followed by exactly one argument object)
- SystemEngineeringTeam/TrainingCourse . . . . 1 match
* 왜 위의 5가지냐고? 그냥, 어디서 들어봐서. 왜 저 5가지인지는 그렇게 중요하지 않다. [http://www.5055.co.kr/pds/spboard/board.cgi?id=establishment&page=16&action=view&number=34.cgi&img=no 일단 선택지를 좁히는 것이 중요.] 진짜 선택은 이 다음부터다.
- The Tower of Hanoi . . . . 1 match
T<sub>n</sub> is the minimum number of moves that will transfer n disks from one peg to another under Lucas's rules.
- UglyNumbers/JuNe . . . . 1 match
print "The 1500'th ugly number is",ugly(1500)[-1]
- UglyNumbers/이동현 . . . . 1 match
=== [UglyNumbers] 소감 ===
public class UglyNumbers {
System.out.println("The 1500'th ugly number is "+new BigDecimal(((Double)arr.get(0)).doubleValue()));// + " " + arr.size());
UglyNumbers ug = new UglyNumbers();
- User Stories . . . . 1 match
Developers estimate how long the stories might take to implement. Each story will get a 1, 2 or 3 week estimate in "ideal development time". This ideal development time is how long it would take to implement the story in code if there were no distractions, no other assignments, and you knew exactly what to do. Longer than 3 weeks means you need to break the story down further. Less than 1 week and you are at too detailed a level, combine some stories. About 80 user stories plus or minus 20 is a perfect number to create a release plan during release planning.
- [Lovely]boy^_^/Arcanoid . . . . 1 match
* Game can exhibit score, number of broken blocks, and time.
- [Lovely]boy^_^/Diary/2-2-16 . . . . 1 match
* Let's enumarate. English, Smalltalk, Design Pattern, Accelerated C++, DirectX, etc...
- [Lovely]boy^_^/EnglishGrammer/Passive . . . . 1 match
We can use these structures with a number of other verbs
- django/RetrievingObject . . . . 1 match
'num_of_report': 'SELECT COUNT(*) FROM risk_report WHERE risk_report.reporter = employee.id'
- eXtensibleMarkupLanguage . . . . 1 match
* [http://xml.80port.net/bbs/view.php?id=xml&page=2&sn1=&divpage=1&sn=off&ss=on&sc=on&select_arrange=headnum&desc=asc&no=26 VC++에서 msxml 사용]
- 구조체 파일 입출력 . . . . 1 match
cout << endl << "Input phone number : " ;
- 권영기/web crawler . . . . 1 match
* os.mkdir(path[, mode]) - Create a directory named path with numeric mode mode. If the directory already exists, OSError is raised.
- 금고/조현태 . . . . 1 match
#include <numeric>
int GetMaxTryNumber(int buildingHeight, int tryNumber)
int countNumber = 0;
nodes.resize(tryNumber + 1);
nodes[tryNumber] = 1;
++countNumber;
return countNumber;
int testNumber;
cin >> testNumber;
for (register int i = 0; i < testNumber; ++i)
int tryNumber;
cin >> tryNumber;
cout << GetMaxTryNumber(buildingHeight, tryNumber) << endl;
- 김희성/MTFREADER . . . . 1 match
fprintf(fp,"Number of this MFT Entry : 0x%02x%02x%02x%02x\n"
fprintf(fp,"A number of Files : %d\n",filecounter);
- 데블스캠프2011/다섯째날/HowToWriteCodeWell/강소현,구자경 . . . . 1 match
//for(int i=0; i<el.numOfPeople();i++)//사람 수만큼 엘레베이터 이동
- 데블스캠프2011/셋째날/RUR-PLE/송지원 . . . . 1 match
for number of range (4) :
- 레밍딜레마 . . . . 1 match
시리즈 물인데, 같은 시리즈의 하나인 혜영이가 남긴 감상 [http://zeropage.org/jsp/board/thin/?table=multimedia&service=view&command=list&page=0&id=145&search=&keyword=&order=num 네안데르탈인의 그림자] 와 같은 짧고 뜻 깊은 이야기이다. 왜 이 책을 통해서 질문법을 통한 실용적이며, 진짜 실행하는, 이루어지는 비전 창출의 중요성을 다시 한번 생각하게 되었다. ["소크라테스 카페"] 에서 저자가 계속 주장하는 질문법의 힘을 새삼 느낄수 있었다.
- 렌덤워크/조재화 . . . . 1 match
output(); //print result about count_array and Total_count_Number
srand(time(0)); //for make random number
cout<<"Total moving Number : "<<counter<<endl;
- 새싹교실/2011 . . . . 1 match
enum
- 손동일 . . . . 1 match
enum {a='a', b='b', c='c', d='d', e='e',
- 위키설명회2005/PPT준비 . . . . 1 match
리스트: 공백과 * 한개; 1., a., A., i., I. 숫자로 된 items; 1.#n start numbering at n; space alone indents.
- 이승한/mysql . . . . 1 match
$totalRecord = mysql_num_rows($result);
- 전문가의명암 . . . . 1 match
NoSmok:AlfredNorthWhitehead''''''는 ''Civilization advances by extending the number of important operations which we can perform without thinking of them.''라는 명언을 남겼다.
- 최소정수의합/김소현 . . . . 1 match
num++;
- 최소정수의합/송지훈 . . . . 1 match
cout << "The smallest 'n' for making the number what we want" << endl;
- 토비의스프링3/밑줄긋기 . . . . 1 match
* 그래서 숫자 타입을 직접 사용하는 것보다는 자바 5 이상에서 제공하는 이늄(enum)을 이용하는 게 안전하고 편하다.
Found 371 matching pages out of 7557 total pages (2880 pages are searched)
You can also click here to search title.
