- PokerHands/Celfin . . . . 231 matches
int number;
return a.number>b.number;
black[i].number = 10;
black[i].number = 11;
black[i].number = 12;
black[i].number = 13;
black[i].number = 14;
black[i].number = temp[3*i]-48;
white[i-5].number = 10;
white[i-5].number = 11;
white[i-5].number = 12;
white[i-5].number = 13;
white[i-5].number = 14;
white[i-5].number = temp[3*i]-48;
black[5].number = 0; white[5].number = 0;
if((card[0].number==card[2].number) && (card[3].number==card[4].number))
blackPair[0].number = card[2].number;
blackPair[1].number = card[3].number;
whitePair[0].number = card[2].number;
whitePair[1].number = card[3].number;
- 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;
- 숫자를한글로바꾸기/허아영 . . . . 84 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];
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;
number_len = num_len(number);
- 최대공약수/조현태 . . . . 79 matches
int number_a, number_b;
cin >> number_a;
cin >> number_b;
cout << "\tx = " << number_a << "\ty = " << number_b << "\n";
int *big_number, *small_number;
if (number_a>number_b)
big_number=&number_a;
small_number=&number_b;
big_number=&number_b;
small_number=&number_a;
while (temp=*big_number%*small_number)
*big_number=*small_number;
*small_number=temp;
cout << "\tGCD is " << *small_number << "\n";
void get_GCM(int big_number, int small_number)
while (temp=big_number%small_number)
big_number=small_number;
small_number=temp;
cout << small_number << "\n";
int number_a, number_b;
- 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];
- PragmaticVersionControlWithCVS/Getting Started . . . . 53 matches
'''number.text'''
U sesame/number.txt
U aladdin/number.txt
'''sesame/number.txt'''
root@eunviho:~/tmpdir# vi sesame/number.txt
/home/CVSHOME/sesame/number.txt,v <-- number.txt
root@eunviho:~/tmpdir/aladdin# cvs status number.txt
File: number.txt Status: Needs Patch
Repository revision: 1.2 /home/CVSHOME/sesame/number.txt,v
상기와 같이 확인을 해보면 aladdin/number.txt 는 체크아웃을 통해서 저장소의 소스와 동기화를 해주어야한다는 상태를 나타내고 있다.
root@eunviho:~/tmpdir/aladdin# cvs diff -rHEAD number.txt
Index: number.txt
RCS file: /home/CVSHOME/sesame/number.txt,v
root@eunviho:~/tmpdir/aladdin# cvs diff number.txt
저장소상의 aladdin 과 동일한 버전의 number.txt는 전혀 변화가 없었기 때문에 출력되는 내용이 없다.
U number.txt
'''sesame/number.txt'''
root@eunviho:~/tmpdir# vi sesame/number.txt
'''sesame/number.txt'''
root@eunviho:~/tmpdir# vi aladdin/number.txt
- SmithNumbers/조현태 . . . . 43 matches
unsigned int Creat_base_and_process(unsigned int number);
const int MAX_NUMBER=10000000;
int number_simulation;
scanf("%d",&number_simulation);
for (;number_simulation>0;--number_simulation)
unsigned int minimum_number;
scanf("%d",&minimum_number);
printf("결과 : %d\n",Creat_base_and_process(minimum_number+1));
unsigned int Get_right(unsigned int number, unsigned int* log_number)
while (number>1)
if (1==log_number[number])
sum+=number;
sum+=Sum_jari(log_number[number]);
number/=log_number[number];
unsigned int Sum_jari(unsigned int number)
while (number>0)
sum+=number%10;
number/=10;
unsigned int Creat_base_and_process(unsigned int number)
unsigned int *log_number=(unsigned int*)malloc((MAX_NUMBER+2)*sizeof(unsigned int));
- 데블스캠프2009/목요일/연습문제/MFC/정종록 . . . . 43 matches
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;
m_number = temp/m_number;
- JTDStudy/첫번째과제/정현 . . . . 38 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();
- CarmichaelNumbers/조현태 . . . . 37 matches
그리고 [CarmichaelNumbers]가 뭔지 몰라서..인터넷에서 뒤져본 결과 최소 3개 이상의 소수의 곱이었던 관계로 그 부분도 추가해 주었다.
int number=-1;
while ((0!=number)&&(number<MINIMUM || MAXIMUM<number))
scanf("%d",&number);
if (0==number)
answer=Carmichael(number);
printf("%d is normal.\n",number);
printf("The number %d is a Carmichael number.\n",number);
int Carmichael(int number)
if (0!=Sosu(number))
for (register int i=2; i<number; ++i)
for (register int j=0; j<number; ++j)
a%=number;
int Sosu(int number)
if (2==number || 3==number)
int *log_number=(int*)malloc((number+2)*sizeof(int));
log_number[2]=1;
log_number[3]=0;
for (register int i=4; i<=number;i+=2)
log_number[i]=1;
- TugOfWar/남상협 . . . . 35 matches
def solutionOfTwoRemain(self,numbers):
self.sum[0]=numbers[0]
self.sum[1]=numbers[1]
self.sum[0]+=numbers[1]
self.sum[1]+=numbers[0]
def solutionOfOddNumber(self,numbers):
if (len(numbers)%2)==1:
numbers.append(0)
numbers.sort()
def calculateEachSum(self,numbers):
self.solutionOfOddNumber(numbers)
self.sum[0]+=numbers[0]+numbers[len(numbers)-1]
self.tmpSum[0]+=numbers[0]+numbers[len(numbers)-2]
self.sum[1]+=numbers[1]+numbers[len(numbers)-2]
self.tmpSum[1]+=numbers[1]+numbers[len(numbers)-1]
def removeUsedNumber(self,numbers):
if len(numbers)>0:
numbers.pop()
numbers.pop(0)
def coupling(self,numbers):
- 데블스캠프2009/목요일/연습문제/MFC/박준호 . . . . 35 matches
int m_number01;
m_number = 0;
DDX_Text(pDX, IDC_EDIT2, m_number);
m_number = 2;
m_number01 += 2;
m_number01 -= 2;
m_number = 2;
m_number = 2;
m_number01 = 2;
m_number = 1;
m_number01 += 1;
m_number = 1;
m_number01 -= 1;
m_number = 1;
m_number01 = 1;
m_number = m_number * 10 + 1;
m_number = m_number * 10 + 2;
m_number = m_number * 10 + 5;
m_number = m_number * 10 + 6;
m_number = m_number * 10 + 7;
- 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;
- sort/권영기 . . . . 31 matches
vector < vector <int> > number;
number.resize(2);
number[0].resize(n + 5), number[1].resize(n + 5);
cin>>number[0][i];
number[1][i] = number[0][i];
sort(number[1].begin(), number[1].begin() + n, cmp);
if(number[0][i] != number[1][i] && number[0][j] != number[1][j] && number[0][i] == number[1][j] && number[1][i] == number[0][j]){
number[0][i] = number[1][i];
number[0][j] = number[1][j];
if(number[0][i] != number[1][i] && number[0][j] != number[1][j] && number[1][i] == number[0][j]){
number[0][j] = number[0][i];
number[0][i] = number[1][i];
- 로마숫자바꾸기/허아영 . . . . 30 matches
void input(int *number);
void operation(int number, char roma_data[3][4]);
void output(int number, char resultdata[20][4]);
int number = 0;
input(&number);
if(number == 99)
if(number > 99 || number <= 0)
operation(number, roma_data);
void input(int *number)
scanf("%d", number);
void operation(int number, char roma_data[3][4])
int numberdata[5] = {0,};
numberdata[0] = number / 10;
numberdata[1] = number % 10;
while(numberdata[0] > 0)
--numberdata[0];
if(numberdata[1] == 4 || numberdata[1] == 9)
if(numberdata[1] == 4)
numberdata[1] = 0;
}else if(numberdata[1] >= 5)
- 주민등록번호확인하기/조현태 . . . . 30 matches
const int CHAR_TO_NUMBER=48;
int input_number[13];
char number;
number=getche();
if (47<number && number<58)
number-=CHAR_TO_NUMBER;
sum+=input_number[i];
if ((11-sum%11)%10==number)
else input_number[cursur]=number*(cursur%8+2);
}else if (BACK_SPACE==number)
const int CHAR_TO_NUMBER=48;
char number;
number=getche();
if (47<number && number<58)
number-=CHAR_TO_NUMBER;
if ((11-sum%11)%10==number && put_num[2]*10+put_num[3]<13 && put_num[4]*10+put_num[5]<32 && put_num[6]<3)
else put_num[cursur]=number;
}else if (BACK_SPACE==number)
const int CHAR_TO_NUMBER=48;
int input_number[13];
- 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)
- 데블스캠프2009/목요일/연습문제/MFC/서민관 . . . . 29 matches
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;
- C++스터디_2005여름/도서관리프로그램/조현태 . . . . 25 matches
number_data=0;
for (register int i=0; i<number_data; ++i)
temp_datas[i]=new char*[number_data+1];
for(register int j=0; j<number_data; ++j)
temp_datas[0][number_data]=new char[get_size(input_name)];
str_copy(temp_datas[0][number_data],input_name);
temp_datas[1][number_data]=new char[get_size(input_writer)];
str_copy(temp_datas[1][number_data],input_writer);
temp_datas[2][number_data]=new char[get_size(input_isbn)];
str_copy(temp_datas[2][number_data],input_isbn);
temp_datas[3][number_data]=new char;
temp_datas[3][number_data][0]=0;
++number_data;
for (register int i=0; i<number_data; ++i)
void book_database::return_line(int number, char* temp_name, char* temp_writer, char* temp_isbn)
str_copy(temp_name,datas[0][number]);
str_copy(temp_writer,datas[1][number]);
str_copy(temp_isbn,datas[2][number]);
int book_database::data_process(int data_number, int state_number)
if (state_number==*datas[3][data_number])
- ContestScoreBoard/문보창 . . . . 23 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;
- 숫자야구/aekae . . . . 23 matches
int number=rand() % 1000;
cout << number << endl;
int arr_number[3]={number % 10, (number / 10) % 10, number / 100};
while (arr_number[0] == arr_number[1] || arr_number[1] == arr_number[2] || arr_number[2] == arr_number[0])
number=rand() % 1000;
arr_number[0]=number % 10;
arr_number[1]=(number / 10) % 10;
arr_number[2]=number / 100;
cout << number << endl;
if (arr_input[i] == arr_number[i])
if (arr_input[i] == arr_number[j])
if (input == number)
- AustralianVoting/곽세환 . . . . 22 matches
int numberOfCase;
cin >> numberOfCase;
for (tc = 0; tc < numberOfCase; tc++)
int numberOfCandidates;
cin >> numberOfCandidates;
for (i = 0; i < numberOfCandidates; i++)
int numberOfVoters = 0;
votes[numberOfVoters][0] = atoi(strtok(temp, " "));
for (i = 1; i < numberOfCandidates; i++)
votes[numberOfVoters][i] = atoi(strtok(NULL, " "));
numberOfVoters++;
for (i = 0; i < numberOfCandidates; i++)
for (i = 0; i < numberOfVoters; i++)
/*for (i = 0; i < numberOfCandidates; i++)
/*for (i = 0; i < numberOfVoters; i++)
for (i = 0; i < numberOfCandidates; i++)
if (votesPerCandidates[i] > 0.5 * numberOfVoters)
for (i = 0; i < numberOfCandidates; i++)
for (i = 0; i < numberOfCandidates; i++)
for (i = 0; i < numberOfVoters; i++)
- 새싹교실/2011/AmazingC/과제방 . . . . 21 matches
int rows,stars,blank,numberOfBlanks=0;
numberOfBlanks=2*rows-1;
for(stars=0;stars<(13-numberOfBlanks)/2;stars++) printf("*");
for(blank=0;blank<numberOfBlanks;blank++) printf(" ");
for(stars=0;stars<(13-numberOfBlanks)/2;stars++) printf("*");
numberOfBlanks=2*(6-(rows-6))-1;
for(stars=0;stars<(13-numberOfBlanks)/2;stars++) printf("*");
for(blank=0;blank<numberOfBlanks;blank++) printf(" ");
for(stars=0;stars<(13-numberOfBlanks)/2;stars++) printf("*");
int dan,number;
for(number=1;number<=9;number++){
printf("%d * %d = %d\n",dan,number,dan*number);
int number,tmp;
for(number=1;number<=40;number++){
tmp=number;
printf("%d ",number);
- 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);
- MedusaCppStudy/석우 . . . . 20 matches
int maxnumber();
maxnumber();
int maxnumber()
int number;
vector<int> numbers;
while (cin >> number)
numbers.push_back(number);
sort(numbers.begin(),numbers.end());
if (numbers.size() >= 4)
cout << numbers[numbers.size() - i] << " ";
for (int j = numbers.size() ; j > 0 ; j--)
cout << numbers[numbers.size() - j] << " ";
void Printnumber(vector< vector<int> >& board);
Printnumber(board);
void Printnumber(vector< vector<int> >& board)
cout << "come out " << vec[i].name << "\t" << "rest number: "
- 데블스캠프2009/목요일/연습문제/MFC/김태욱 . . . . 20 matches
m_number = 0.0;
DDX_Text(pDX, IDC_EDIT2, m_number);
m_number = operand;
m_number = operand + underdot;
m_number = m_number * 10 + 1;
result = m_number;
result = m_number;
result = m_number + result;
m_number = result;
result = result - m_number;
m_number = result;
result = result * m_number;
m_number = result;
result = result / m_number;
m_number = result;
result = m_number;
result = m_number;
m_number = 0;
m_number = operand;
- 피보나치/조현태 . . . . 20 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 fibonacci2( unsigned int prv_answer,unsigned int sub_answer, unsigned int number, int call)
while (number!=0)
--number;
if (0==call && number>0)
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);
def fibo( number ):
number=number-1
while number!=0:
number=number-1
- 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
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)
- 중위수구하기/조현태 . . . . 19 matches
그래도 뭐 나름대로 MAX_NUMBER에 3이외의 값을 넣으면(단 홀수! 아닐경우 정확한 가운데 값이 아니닷! ) 여러가지로 늘릴 수 있다.^^
const int MAX_NUMBER=3;
const int BREAK_NUMBER=-999;
void change(int *number1, int *number2)
int temp=*number1;
*number1=*number2;
*number2=temp;
int input(int *input_number)
for (int i=0; i<MAX_NUMBER; ++i)
cin >> input_number[i];
if (0==i && input_number[0]==BREAK_NUMBER)
int input_number[MAX_NUMBER]={0,};
while (input(input_number))
for (int i=0; i<MAX_NUMBER-1; ++i)
for (int j=0; j<MAX_NUMBER-i-1; ++j)
if (input_number[j]>input_number[j+1])
change(&input_number[j],&input_number[j+1]);
cout << "가운데 값은 " << input_number[MAX_NUMBER/2] << "입니다.\n";
while (input(input_number)) 요거 이해하는데 버벅거렸다; 입력값을 -999를 입력받을때까지 계속 입력받는걸로 했구낭ㅇㅅㅇ
if(input(input_number)==0) break; // 또는 if(!input(input_number)) break;
- 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;
- LoveCalculator/조현태 . . . . 18 matches
int calculator(int number)
if (number<10)
return number;
int temp_number=0;
while (number>0)
temp_number+=number%10;
number/=10;
return calculator(temp_number);
int input_to_calculator(int number)
if (number<10)
return number;
int temp_number=0;
while (number>0)
temp_number+=number%10;
number/=10;
return input_to_calculator(temp_number);
- NumberBaseballGame/jeppy . . . . 18 matches
void make_number(char *p); /* 임의 세자리 숫자를 생성하는 함수 */
char number_log[10][4] = {'\0',};
// make hidden_number;
make_number(hidden_num);
printf("%d input number : ", i+1);
else strncpy(number_log[i], num, 3);
//printf("%d : %s\n", i, number_log[i]);
check_num(number_log[i], hidden_num);
void make_number(char *p) {
int number[3];
printf("Make number..\n");
if (i<1) number[i] = num;
if (number[j]==num) i--;
else number[i] = num;
p[i] = (char) number[i] + 48;
//printf("%d %d %d \n", number[0], number[1], number[2]);
- 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])
- TheGrandDinner/조현태 . . . . 18 matches
struct SNumberAndPosition
SNumberAndPosition(int inputNumber, int inputPosition)
number = inputNumber;
int number;
char* InputBaseData(char* readData, vector<SNumberAndPosition>& tableSize, vector<SNumberAndPosition>& teamSize)
int numberOfTable = 0;
int numberOfTeam = 0;
sscanf(readData, "%d %d", &numberOfTeam, &numberOfTable);
if (0 == numberOfTeam && 0 == numberOfTable)
for (register int i = 0; i < numberOfTeam; ++i)
teamSize.push_back(SNumberAndPosition(buffer, i));
for (register int i = 0; i < numberOfTable; ++i)
tableSize.push_back(SNumberAndPosition(buffer, i));
bool DeSort(SNumberAndPosition one, SNumberAndPosition another)
return one.number > another.number;
void CalculateAndPrintResult(vector<SNumberAndPosition>& tableSize, vector<SNumberAndPosition>& teamSize)
sumTable += tableSize[i].number;
sumTeamSIze += teamSize[i].number;
if (teamSize[0].number < (int)tableSize.size())
vector< vector<int> > teamTableNumber;
- SummationOfFourPrimes/김회영 . . . . 17 matches
int* set_prime_array(int* prime_array,int number);
bool check_prime_number(int n);
void find_four_number(int* prime_array,int count,int number);
int number = 0;
cin>>number;
prime_array = set_prime_array(prime_array,number);
find_four_number(prime_array,count,number);
int* set_prime_array(int* prime_array,int number)
int* prime_array = new int[number];
for(int i=1 ; i<number ; i++)
if(check_prime_number(i)==true)
bool check_prime_number(int n)//전달된 값이 소수인지를 판별합니다.
void find_four_number(int* prime_array,int count,int number)
if(prime_array[a]+prime_array[b]+prime_array[c]+prime_array[d]==number)
- UglyNumbers/김회영 . . . . 17 matches
bool check(long number);
long number=1;//1부터 시작하므로..
number++;
if(check(number)==true)
cout<<count<<":"<<number<<endl;
cout<<"The "<<situation<<"번째 심술쟁이수는 "<<number;
bool check(long number)//심술쟁이 수인지를 판별합니다.
if(number==1)
else if(number%2==0)
number=number/2;
else if(number%3==0)
number=number/3;
else if(number%5==0)
number=number/5;
UglyNumbers
- ContestScoreBoard/조현태 . . . . 16 matches
int team_number;
int test_number;
scanf ("%d",&test_number);
while (test_number!=0)
--test_number;
int input_team_number, input_temp, input_time; char input_e;
scanf("%d %d %d %c",&input_team_number, &input_temp, &input_time, &input_e);
if (input_team_number==0)
temp_point=such_and_malloc_point(input_team_number);
temp_point=such_and_malloc_point(input_team_number);
datas* such_and_malloc_point(int target_team_number)
if (target_team_number==temp_point->team_number)
temp_point->team_number=target_team_number;
printf("%d\t%d\t%d\n",temp_point->team_number,temp_point->score,temp_point->used_time);
- 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);
- PrimaryArithmetic/sun . . . . 16 matches
테스트 작성 (NumberGeneratorTest.java)
public class NumberGeneratorTest extends TestCase {
public void testNoNumber() {
NumberGenerator ng = new NumberGenerator();
NumberGenerator ng = new NumberGenerator(123);
지금 생각해보면 {{{~cpp testNoNumber}}}는 필요없는것 같다. 나중에 글을 쓰다보니, 같이 쓰게 됬는데 원래는 위의 테스트를 먼저 작성하고 테스트 통과후 아래쪽 테스트를 추가했다. 이번 작업과 별도로 '''코딩후에 뭔가하자'''는 결국 놓치는게 많다는걸 다시한번 증명하게 된다. :) ''see [http://jania.pe.kr/wiki/jwiki/moin.cgi/NowOrNever NowOrNever]''
위 테스트를 만족하는 코드 작성 (NumberGenerator.java)
public class NumberGenerator {
private int number;
private byte[] numbers;
public NumberGenerator() {
number = -1;
public NumberGenerator( int number ) {
if( number < 0 ) throw new ArithmeticException( "0 또는 그 이상의 정수만 가능합니다: " + number );
this.number = number;
numbers = String.valueOf(number).getBytes();
numPointer = numbers.length - 1;
if( number == -1 ) return false;
return numbers[numPointer--] - '0';
NumberGenerator ng1 = new NumberGenerator( Math.max(num1, num2) );
- RandomWalk2/조현태 . . . . 16 matches
#define NUMBER_PLAYER 2
string moveRotate[NUMBER_PLAYER];
int myPointX[NUMBER_PLAYER];
int myPointY[NUMBER_PLAYER];
for (int i = 0; i < NUMBER_PLAYER; ++i)
int moveNum[NUMBER_PLAYER] = {0,};
for (register int i = 0; i < NUMBER_PLAYER; ++i)
for (register int j = 0; j < NUMBER_PLAYER; ++j)
for (register int i = 0; i < NUMBER_PLAYER; ++i)
#define NUMBER_PLAYER 999
#define END_NUMBER 999
int numberPlayer = 0;
string moveRotate[NUMBER_PLAYER];
int myPointX[NUMBER_PLAYER];
int myPointY[NUMBER_PLAYER];
for (int i = 0; i < NUMBER_PLAYER; ++i)
if (END_NUMBER == myPointX[i])
++numberPlayer;
int moveNum[NUMBER_PLAYER] = {0,};
for (register int i = 0; i < numberPlayer; ++i)
- 데블스캠프2009/목요일/연습문제/다빈치코드/박준호 . . . . 16 matches
int number;
printf("%c%d ",handsort[index].color1, handsort[index].number);
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;
if(handsort[i].number >= handsort[(i+1)].number)
if(handsort[i].number == handsort[i+1].number)
a = handsort[i].number;
handsort[i].number =handsort[(i+1)].number;
handsort[i+1].number = a;
- 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)
- PrimaryArithmetic/1002 . . . . 15 matches
def toList(number):
def toList(numberStr):
return [int(each) for each in numberStr]
def withNullList(numberStr):
result = [0 for each in range(10-len(numberStr))]
numbers = [int(each) for each in numberStr]
return result + numbers
LIMIT_NUMBER = 10
for idx in range(LIMIT_NUMBER-1,-1,-1):
return [0 for each in range(LIMIT_NUMBER-nullCount)]
def numberList(numberStr):
return [int(each) for each in numberStr]
def withNullList(numberStr):
return nullList(len(numberStr)) + numberList(numberStr)
- WikiTextFormattingTestPage . . . . 15 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.
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
- 수학의정석/집합의연산/조현태 . . . . 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 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;
- MedusaCppStudy/신애 . . . . 14 matches
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] << ",";
- 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 보고 이해 & 좌절.
- 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
- 로마숫자바꾸기/조현태 . . . . 12 matches
void print_number(int);
int number=-1;
while (number<1 || number>99)
scanf("%d",&number);
print_number(number);
void print_number(int number)
const int NUMBER_DATA[DATA_SIZE]={1,5,10};
if (i+1<DATA_SIZE && number==NUMBER_DATA[i+1]-1)
while (number>=NUMBER_DATA[i])
number-=NUMBER_DATA[i];
- 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 ));
- 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);
- MedusaCppStudy/세람 . . . . 11 matches
vector<int> number;
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] << ", "
<< number[size - 2] << ", " << number[size - 1];
- 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;
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++)
number=9;
input[number] = tempNum%10;
number--;
input[number]=(int)(tempNum/pow(10, i))%10;
- ReverseAndAdd/이승한 . . . . 11 matches
int reverse(int number); //뒤바꾼 수가 원래 수와 같다면 -1 이 리턴
int reverse(int number){
int originalNum = number;
int numbers[10] = {0};
int chipers = 0; //a number of five chipers 다섯 자리수, 자릿수
for(chipers = 0; number > zeros; zeros *= TEN){
numbers[i] = number / zeros;
number -= zeros * numbers[i];
returnNum += numbers[i] * zeros;
- ReverseAndAdd/허아영 . . . . 11 matches
unsigned int * store_numbers;
store_numbers = new unsigned int[numLength(num)];
store_numbers[i] = num / pow(10, (numLength(num)-i-1));
store_numbers[i] = store_numbers[i] % 10;
store_numbers[i] = num / pow(10, (length-i-1));
store_numbers[i] = store_numbers[i] % 10;
if(isPalindrome(store_numbers, length))
addNum = ReverseAndAdd(store_numbers, length);
// delete []store_numbers;
- SmithNumbers/문보창 . . . . 11 matches
// no10042 - Smith Numbers
void find_smith_number(int n);
int sum_digit_number(int n);
int number;
cin >> number;
find_smith_number(number);
void find_smith_number(int n)
if (sum_digit_number(i) == sum_digit_prime_factor(i))
int sum_digit_number(int n)
int sumDigitNumber = 0;
sumDigitNumber += temp % 10;
return sumDigitNumber;
sumDigitPrimeFactor += sum_digit_number(i);
sumDigitPrimeFactor += sum_digit_number(temp);
[SmithNumbers] [AOI]
- UglyNumbers/곽세환 . . . . 11 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;
[UglyNumbers]
- 새싹교실/2012/해보자 . . . . 11 matches
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){
sum += number;
scanf_s("%d",&number);
- 호너의법칙/조현태 . . . . 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];
- CToAssembly . . . . 10 matches
long number;
for (number = 1; number <= max; ; ++number) {
for (i=(number>>1), position=0; i!=0; ++position)
long number;
for (number = 1; number <= max; ; ++number) {
asm("bsrl %1, %0" : "=r" (position) : "r" (number));
- 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)
- JollyJumpers/황재선 . . . . 10 matches
public int [] inputNumbers() {
j.inputNumbers();
int [] numbers;
numbers = new int[len];
numbers[i] = Integer.parseInt(ch[i+1]);
return numbers;
return size == numbers.length ? true : false;
for(int i = 0; i < numbers.length - 1; i++) {
set.add(new Integer(Math.abs(numbers[i] - numbers[i+1])));
j.numbers = new int[]{1,4,2,-1,6};
assertEquals(5, j.numbers.length);
- OurMajorLangIsCAndCPlusPlus/print . . . . 10 matches
print("number: %d, string: %s, real number: %f\n", a, b, c);
number: 10, string: example, real number: 10.5
print("number: %5d\n", a);
print("number: %5d\n", b);
print("number: %5d\n", c);
number: __123
number: 12345
number: 12345678
- 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);
- 경시대회준비반/BigInteger . . . . 10 matches
// 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;
TheNumber = new DATATYPE [Temp.Digits()];
if(TheNumber!=0)
delete [] TheNumber;
- 기본데이터베이스/조현태 . . . . 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 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];
- 숫자를한글로바꾸기/조현태 . . . . 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];
- Counting/하기웅 . . . . 9 matches
BigInteger number[MAX_NUM+1];
number[0]=1;
number[1]=2;
number[2]=5;
number[i]=2*number[i-1]+number[i-2]+number[i-3];
cout<< number[input] <<endl;
- HowManyZerosAndDigits/임인택 . . . . 9 matches
public void testNumberSystemConversion() {
// assertEquals(2, object.convertNumber());
// assertEquals(3, object.convertNumber());
private LinkedList numbers;
numbers = new LinkedList();
convertNumber();
public void convertNumber() {
numbers.add(new Long(remainder));
numbers.add(new Long(remainder));
String number = Long.toString(num);
for(int i=0; i<number.length(); ++i) {
if( number.charAt(i)== '0' )
Object arr[] = numbers.toArray();
return numbers.size();
- JollyJumpers/임인택2 . . . . 9 matches
jollyJumpers numbers =
if (jollySub ((head numbers)-1) (tail numbers) []) == (List.sortBy (flip compare) [1..((head numbers)-1)])
jollySub 0 numbers result = result
jollySub num numbers result =
jollySub (num-1) (tail numbers) (result ++ [(abs ((head numbers)-(head (tail numbers))) )])
- 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;
- SummationOfFourPrimes/문보창 . . . . 9 matches
int number;
while (cin >> number)
if (number < 8)
else if (number % 2 != 0)
findPrim(number - 5, false, primes);
else if (number % 4 == 0)
findPrim(number/2, true, primes);
findPrim(number/2 - 1, false, primes);
findPrim(number/2 + 1, false, primes);
- 새싹교실/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);
- 정렬/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;
- 정수민 . . . . 9 matches
void winning_number();
void make_number(int k);
winning_number();
void make_number(int k){
make_number(k);
make_number(k);
winning_number();
void winning_number(){
printf("n== LOTTO RANDOM NUMBER GENERATOR ==nnEnter the game count : ");
printf("Enter a number for score[%d] : ", i);
- 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);
- 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;
- JTD 야구게임 짜던 코드. . . . . 8 matches
public static int makeFirstNumber(void)
public static int makeSecondNumber(void)
public static int makeThirdNumber(void)
public static char checkNumbers(int number, int a)
public static int userNumber(void)
int number;
user = JOptionPane.showInputDialog(null,"write in a three digit number");
number = makeNumber();
user = checkNumber(number , user2);
int number;
a = makeFirstNumber();
b = makeSecondNumber();
c = makeThirdNumber();
number = makeNumber();
checkNumbers(number, user);
- JTDStudy/첫번째과제/장길 . . . . 8 matches
public void setBall(int number) {
ball[count++]= ((int)number/(100/i));
number%= (100/i);
int number= Integer.parseInt(input);
player.setBall(number);
public void setBall(int number) {
ball[count++]= ((int)number/(100/i));
number%= (100/i);
- 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");
- JollyJumpers/허아영 . . . . 8 matches
int numbers[3000], compare[3000];
cin >> numbers[i];
if(numbers[i] >= numbers[i-1])
value = numbers[i] - numbers[i-1];
value = numbers[i-1] - numbers[i];
- ReverseAndAdd/임인택 . . . . 8 matches
reverseAndAdd number = reverseAndAddSub 0 number
reverseAndAddSub count number =
if (show number) == (reverse (show number))
then [count, number]
else reverseAndAddSub (count+1) (number + (read (reverse (show number))) )
- Self-describingSequence/조현태 . . . . 8 matches
int GetSolomonGolombNumber(int pointNumber)
map<int, int> numbers;
int nowNumber = 1;
register int suchNumber;
for (register int i = 1; nowNumber < pointNumber; ++i)
numbers[nowNumber] = i;
for(suchNumber = i; numbers.end() == numbers.find(suchNumber); --suchNumber);
nowNumber += numbers[suchNumber];
for(suchNumber = pointNumber; numbers.end() == numbers.find(suchNumber); --suchNumber);
return numbers[suchNumber];
int calculateNumber = 0;
cin >> calculateNumber;
if (0 == calculateNumber)
cout << GetSolomonGolombNumber(calculateNumber) << endl;
- UpgradeC++/과제1 . . . . 8 matches
int number;
int numberu;
cin >> number;
for (i=0; i<number; i++)
for (j=number-i-1; j>0; j--)
cin >> numberu;
for (i=0; i<=numberu; i++)
for (j=numberu+4; j>i*2; j--)
- 데블스캠프2005/금요일/OneCard . . . . 8 matches
def __init__(self, shape=None, number=None):
self.number = number
s = '%s %s' % (self.shape, self.number)
for number in cardsNums:
cards.append(Card(shape, number))
if cardOnTable.shape==myCard.shape or cardOnTable.number==myCard.number:
- 데블스캠프2012/첫째날/배웠는데도모르는C . . . . 8 matches
struct Date number;
void Printdate(struct Date *s_no.number,struct Memo *s_no1.content)
printf("%d년도 %d월 %d일\n",s_no.number.year,s_no.number.);
scanf("%d%d%d",&s_no1.number[num].year,&s_no1.number[num].month,&s_no1.number[num].day);
Printdate(&s_no1.number[n],&s_no1.content[n]);
- 압축알고리즘/희경&능규 . . . . 8 matches
int number = 0;
fout << number << temp;
number = 1;
number ++;
fout << number << temp;
int number;
number = pass[i] - 48;
fout << number;
- 허아영/Cpp연습 . . . . 8 matches
int number, result;
cin>>number;
result = square(number);
cout<<number<<"의 제곱 = "<<result<<"n";
}while(number != 999);
int square(int number)
int square_num = number * number;
- 2002년도ACM문제샘플풀이/문제C . . . . 7 matches
int numberOfData;
cin >> numberOfData;
inputData = new InputData[numberOfData];
outputData = new bool[numberOfData];
for(int i = 0;i < numberOfData;i++)
for(int i =0;i < numberOfData;i++) {
for(int i = 0;i < numberOfData;i++)
- C++스터디_2005여름/학점계산프로그램/정수민 . . . . 7 matches
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;
- MatrixAndQuaternionsFaq . . . . 7 matches
The size of a matrix is defined in terms of the number of rows
The identity matrix is matrix in which has an identical number of rows
row number is equal to the column number ie.
However, this can only be performed if a matrix has an equal number
by itself a specific number of times.
In theory, there are an infinite number of rotation axii and angles
- 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);
- PrimeNumberPractice . . . . 7 matches
void CalculatePrimeNumber(int scope[], int length);
void PrintPrimeNumber(int scope[], int lengh);
// this program print prime number in scope 1 to 2000
int targetNumberScope[scope + 1];
SetScope(targetNumberScope, scope);
CalculatePrimeNumber(targetNumberScope, scope);
PrintPrimeNumber(targetNumberScope, scope);
void CalculatePrimeNumber(int scope[], int length) {
void PrintPrimeNumber(int scope[], int length) {
public class PrimeNumberTest {
private static boolean numberPool[];
private static void InitializeNumberPool() {
numberPool = new boolean[SCOPE + 1];
numberPool[i] = true;
private static void CalculatePrimeNumber() {
if (numberPool[i])
numberPool[j * k] = false;
if (numberPool[i])
InitializeNumberPool();
CalculatePrimeNumber();
- ReverseAndAdd/김회영 . . . . 7 matches
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;
- SmithNumbers/남상협 . . . . 7 matches
= SmithNumbers/남상협 =
int number;
int smithNumber = 0;
for(int i = number; i<1000000000; i++)
smithNumber = i;
cout<<smithNumber<<"\n";
cin>>number;
number = 4937775;
int result=getPrimeFactorSum(number);
number = 4937775;
int result = getEachSum(number);
- SummationOfFourPrimes/1002 . . . . 7 matches
for eachGenNumberFour in GenNumbersFour
isAllPrimeNumber:
print eachGenNumberFour
GenNumbersFour = 합이 x 인 수 조합리스트
class PrimeNumberList:
if self.isPrimeNumber(i):
def isPrimeNumber(self,aNum):
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:
if self.isPrimeNumber(i):
def isPrimeNumber(self,aNum):
n = int(raw_input('input number : '))
primeNumberList = PrimeNumberList(n)
for eachPrimeNumberSeq in selectionFour(primeNumberList.getList()):
- TheGrandDinner/하기웅 . . . . 7 matches
int number;
int number;
return a.number<b.number;
team[i].person[j] = nTable[j].number;
team[i].number=i;
nTable[i].number=i;
- 데블스캠프2009/목요일/연습문제/다빈치코드/서민관 . . . . 7 matches
int number;
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'))
printf("%c %d\n", hand[j].color, hand[j].number);
- 데블스캠프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)
- 수/구구단출력 . . . . 7 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);
- 3n 1/Celfin . . . . 6 matches
int cycleNumber(int number)
while(number!=1)
if(number%2==0)
number /=2;
number = (3*number +1)/2;
if(cycleNumber(i)>cycle)
cycle = cycleNumber(i);
- AcceleratedC++/Chapter7 . . . . 6 matches
int line_number = 0;
++line_number;
ret[*it].push_back(line_number); // ret[*it] == (it->second) = vector<int> 같은 표현이다.
// followed by one or more line numbers
cout << *line_it; // write the first line number
// write the rest of the line numbers, if any
- ISBN_Barcode_Image_Recognition . . . . 6 matches
def generate_isbn_check_digit(numbers): # Suppose that 'numbers' is 12-digit numeric string
for i, number in enumerate(numbers):
sum += int(number) * 1
sum += int(number) * 3
==== First Number ====
- ImmediateDecodability/김회영 . . . . 6 matches
int code_number=0;
code[code_number][code_byte]=temp;
code[code_number][code_byte]='\n';
code_number++;
for(int i=0 ; i<=code_number-1 ; i++)
for(int j=i+1 ; j<=code_number ; j++)
- 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";
- OurMajorLangIsCAndCPlusPlus/print/이도현 . . . . 6 matches
print("number: %d, string: %s, real number: %f\n", a, b, c);
print("number: %5d\n", aaa);
print("number: %5d\n", bbb);
print("number: %5d\n", ccc);
print("number: %9f\n", cccc);
- ricoder . . . . 6 matches
* 숫자 야구 게임. ["NumberBaseballGame/영록"]
int number,i = 0;
cin >> number;
switch(number)
int number,i,k=0;
cin >> number;
switch(number)
- 강희경/메모장 . . . . 6 matches
#define NUMBER_OF_SCORES 5
struct ScoreData scoreArray[NUMBER_OF_SCORES];
/*Enter a number for score[0] : 80
Enter a number for score[1] : 50
Enter a number for score[2] : 99
Enter a number for score[3] : 74
Enter a number for score[4] : 88
while(count < NUMBER_OF_SCORES){
printf("\nEnter a number for score[%d] : ", count);
aArrayData->avg = (float)aArrayData->sum/NUMBER_OF_SCORES;
for(count = 0; count < NUMBER_OF_SCORES; count++){
for(count = 0; count < NUMBER_OF_SCORES; count++){
for(cmpCount = 0; cmpCount < NUMBER_OF_SCORES; cmpCount++){
for(count = 0; count < NUMBER_OF_SCORES; count++){
int beverageNumber;
scanf("%d", &beverageNumber);
}while(beverageNumber < 0 || beverageNumber >=3);
printf("%C 음료수가 선택되었습니다\n", beverage[beverageNumber]);
if(money >= beveragePrice[beverageNumber]){
money -= beveragePrice[beverageNumber];
- 데블스캠프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++){
- 데블스캠프2010/다섯째날/ObjectCraft/미션2/서민관 . . . . 6 matches
z1->number = num;
cout << z1->number << "이 " << z2->number << "에게 데미지 " << z1->atk << "를 입혀 HP가 " << z2->HP << "가 되었다." << endl;
cout << z1->number << "이 죽었습니다." << endl;
cout << z2->number << "가 죽었습니다." << endl;
int number;
- 변준원 . . . . 6 matches
int number=0;
number++;
int count=0, number=0;//엔딩수, 이동수 지정
number++;
number++;
cout << "바퀴벌레의 이동횟수는 " << number << "입니다." << endl;
- 스네이크바이트/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)
- 토이/숫자뒤집기/임영동 . . . . 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;//문자열을 정수형으로 바꿔 리턴
- 프로그래밍/Pinary . . . . 6 matches
String number;
number = Integer.toBinaryString(i);
if (number.charAt(0) == '0') {
int size = number.length();
if (number.substring(j, j+2).matches("11")) {
return number;
- 피보나치/김영록 . . . . 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;
- 2002년도ACM문제샘플풀이/문제D . . . . 5 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++)
- 2002년도ACM문제샘플풀이/문제E . . . . 5 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++)
- 2010php/방명록만들기 . . . . 5 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++){
- AcceleratedC++/Chapter10 . . . . 5 matches
static const double numbers[] = {
// compute the number of grades given the size of the array
static const size_t ngrades = sizeof(numbers)/sizeof(*numbers);
if (grade >= numbers[i])
- C++스터디_2005여름/도서관리프로그램/남도연 . . . . 5 matches
int number = 0;
while(number != 5)
cin >> number;
if(number == 5)
switch(number)
- 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.
- OurMajorLangIsCAndCPlusPlus/print/김상섭 . . . . 5 matches
print("number: %d, string: %s, real number: %f\n", a, b, c);
print("number: %5d\n", aaa);
print("number: %5d\n", bbb);
print("number: %5d\n", ccc);
- 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);
- 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);
- PragmaticVersionControlWithCVS/CommonCVSCommands . . . . 5 matches
U sesame/number.txt
U sesame2/number.txt
U sesame2/sesame2/number.txt
U sesame/number.txt
U number.txt
- ProjectSemiPhotoshop/SpikeSolution . . . . 5 matches
/* If this is a Windows-style DIB, the number of colors in the
* color table can be less than the number of bits per pixel
/* Calculate the number of colors in the color table based on
* the number of bits per pixel for the DIB.
/* return number of colors based on bits per pixel */
- Steps/하기웅 . . . . 5 matches
int showResult(int number)
sqrtNum = floor(sqrt(number-1));
if(number==0)
else if(number>powNum && number<=(powNum+sqrtNum))
- 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)
- 데블스캠프2009/월요일/연습문제/svn코드레이스/박준호 . . . . 5 matches
int number;
number = rand() % 50;
printf("%d\n", number);
if( number > guess)
else if(number < guess)
- 몸짱프로젝트/BinarySearchTree . . . . 5 matches
int number;
cin >> number;
Insert(root, number);
Delete(root, number);
Search(root, 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);
- 허아영/C코딩연습 . . . . 5 matches
< LOTTO RANDOM NUMBER GENERATOR >
Enter a number for score[0] : 80
Enter a number for score[1] : 50
Enter a number for score[2] : 99
Enter a number for score[3] : 74
Enter a number for score[4] : 88
- 5인용C++스터디/소켓프로그래밍 . . . . 4 matches
http://www.rein.pe.kr/technote/read.cgi?board=programing&y_number=260&nnew=2
http://www.rein.pe.kr/technote/read.cgi?board=programing&y_number=261&nnew=2
http://www.rein.pe.kr/technote/read.cgi?board=programing&y_number=262&nnew=2
http://www.rein.pe.kr/technote/read.cgi?board=programing&y_number=263&nnew=2
- BasicJAVA2005/실습1/송수생 . . . . 4 matches
Random number = new Random();
arry[i]=number.nextInt(9);
Scanner scannumber = new Scanner(System.in);
temp[i]=scannumber.nextInt();
- C++스터디_2005여름/학점계산프로그램/문보창 . . . . 4 matches
int number; // 학번
number = 0;
fin >> number;
cout << "학번 : " << number << " 평점 : " << average << endl;
- 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/조현태] ||
- Counting/황재선 . . . . 4 matches
public void printCount(BigInteger number) {
System.out.println(number);
BigInteger number = c.count(n);
c.printCount(number);
- EffectiveC++ . . . . 4 matches
static unsigned int numberOfTargets()
static unsined int numberOfTanks()
Month(int number) : monthNumber(number) { }
const int monthNumber;
- EightQueenProblem/이선우 . . . . 4 matches
private int numberOfBoard;
numberOfBoard = 0;
numberOfBoard ++;
public void printNumberOfBoard()
System.out.println( "Number of different board: " + numberOfBoard );
nq.printNumberOfBoard();
- EightQueenProblem/이선우3 . . . . 4 matches
private int numberOfSolutions;
numberOfSolutions = 0;
public int getNumberOfSolutions()
return numberOfSolutions;
numberOfSolutions ++;
System.out.println( "I found " + player.getNumberOfSolutions() + " solutions." );
- HanoiTowerTroublesAgain!/문보창 . . . . 4 matches
int number = 1;
if (stick[i] == 0 || isSqure(stick[i] + number))
stick[i] = number++;
cout << number - 1 << endl;
- Hartals/상협재동 . . . . 4 matches
int numberOfHartal;
cin >> numberOfHartal;
for(int i = 0; i < numberOfHartal; i++)
for(int i = 0; i < numberOfHartal; i++)
- HelpOnLists . . . . 4 matches
A numbered list, mixed with bullets:
Variations of numbered lists:
A numbered list, mixed with bullets:
Variations of numbered lists:
- 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 대입
- LinkedList/학생관리프로그램 . . . . 4 matches
int number;
Student* Searching(int aNumber, Student* aHead, int aType);//찾기
int searchNumber;
scanf("%d", &searchNumber);
searched = Searching(searchNumber, aHead, ORIGINALSEARCH);
searched->dept, searched->name, searched->number);
int deleteNumber;
scanf("%d", &deleteNumber);
searchedFormer = Searching(deleteNumber, aListPointer[HEAD], DELETIONSEARCH);
scanf("%d", &(aStudent->number));
Student* Searching(int aNumber, Student* aHead, int aType){
if(searched->number == aNumber)
- MagicSquare/재동 . . . . 4 matches
input = int(raw_input('Input(odd number): '))
print 'Input must be odd number'
input = int(raw_input('Input(odd number): '))
print 'Input must be odd number'
- MajorMap . . . . 4 matches
Registers are a limited number of special locations built directly in hardware. On major differnce between the variables of a programming language and registers is the limited number of registers, typically 32(64?) on current computers.
Two's complement is the most popular method of representing signed integers in computer science. It is also an operation of negation (converting positive to negative numbers or vice versa) in computers which represent negative numbers using two's complement. Its use is ubiquitous today because it doesn't require the addition and subtraction circuitry to examine the signs of the operands to determine whether to add or subtract, making it both simpler to implement and capable of easily handling higher precision arithmetic. Also, 0 has only a single representation, obviating the subtleties associated with negative zero (which is a problem in one's complement). --from [http://en.wikipedia.org/wiki/Two's_complement]
- 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
- OOP/2012년스터디 . . . . 4 matches
int numberOfDays(int year, int month);
for(int i = 1; i <= numberOfDays(year, month); i++){
sum += numberOfDays(year, i);
int numberOfDays(int year, int month){
- RandomWalk/변준원 . . . . 4 matches
int count=0, number=0;//엔딩수, 이동수 지정
number++;
number++;
cout << "바퀴벌레의 이동횟수는 " << number << "입니다." << endl;
- Self-describingSequence/문보창 . . . . 4 matches
int number = 2;
number++;
count = table[number];
table[i] = number;
- 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)
sum += testNumber / devideNum;
- UglyNumbers/남훈 . . . . 4 matches
1500 "번째" ugly number 를 알기 위해서는 1499 번째 ugly number 보다 큰 수 중에 해당되는 수가 있는지 조사하면 된다. 그런 간단한 아이디어로 구현
print "The " + `goal` + "(st/nd/th) ugly number is " + `ugly2(goal)`
print "The " + `goal` + "(st/nd/th) ugly number is " + `ugly3(goal)`
[UglyNumbers]
- UglyNumbers/송지원 . . . . 4 matches
기존 ugly number에다가 2,3,5를 곱해도 ugly number가 될 것이니
cout << "The " << num << "th ugly number is " << uglyNum(num) << endl;
int n2, n3, n5; // ugly number에 2,3,5를 곱한 값
- UglyNumbers/황재선 . . . . 4 matches
== UglyNumbers ==
class UglyNumbers:
def uglyNumber(self, index):
numberList = [pow(2,i)*pow(3,j)*pow(5,k) for k in xrange(30) \
numberList.sort()
return numberList[index-1]
print "The 1500'th ugly number is <" + str(num) + ">."
class UglyNumbersTestCase(unittest.TestCase):
self.u = UglyNumbers()
def testFindUglyNumber(self):
self.assertEquals(859963392, self.u.uglyNumber(1500))
self.assertEquals(2, self.u.uglyNumber(2))
self.assertEquals(1, self.u.uglyNumber(1))
self.assertEquals(12, self.u.uglyNumber(10))
self.assertEquals(15, self.u.uglyNumber(11))
u = UglyNumbers()
n = u.uglyNumber(1500)
UglyNumbers
- 빵페이지/도형그리기 . . . . 4 matches
num = input("plz input number of asterisk: ")
printf("plz input asterisk number(below %d):",MAX);
cout << "plz number of asterisk:";
cout << "plz number of asterisk:";
- 알고리즘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주숙제/문보창 . . . . 4 matches
int number;
fin >> number;
indata.reserve(number);
for (int i = 0; i < number; i++)
- 오목/재니형준원 . . . . 4 matches
int number;
number=0;
omokBoard[row][col] = ++number;
if(number % 2 == 0)
- 최소정수의합/조현태 . . . . 4 matches
int sum(int end_number)
if (1==end_number)
return end_number*(end_number+1)/2;
- 튜터링/2011/어셈블리언어 . . . . 4 matches
number byte ?
mov number, al
cmp number, 1
movzx edx, number
- 2002년도ACM문제샘플풀이/문제A . . . . 3 matches
int numberOfTestCase =0;
cin >> numberOfTestCase;
for ( int testCaseNum=0;testCaseNum<numberOfTestCase;testCaseNum++){
- 3N+1/임인택 . . . . 3 matches
threeNPlusOne numbers =
mergeList numbers (map maxCycleLength numbers) []
- EcologicalBinPacking/김회영 . . . . 3 matches
int ch_number; //최소 이동 횟수를 저장한다.
ch_number = total - max(container);
cout<<save<<" "<<ch_number;
- 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)
- HowManyFibs?/하기웅 . . . . 3 matches
BigInteger convertBig(char *number)
int charLen = strlen(number);
temp = temp + (*(number++)-48)*decimalNum.Power(charLen-i-1);
- JTDStudy/첫번째과제/상욱 . . . . 3 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() {
resultNumber = fstNum + secNum + trdNum;
if (resultNumber.charAt(i) == userNumber.charAt(j)) {
public void setResultNumber(String resultNumber) {
this.resultNumber = resultNumber;
public String getUserNumber() {
return userNumber;
public String getResultNumber() {
return resultNumber;
public class NumberBaseBallGameTest extends TestCase {
- JTDStudy/첫번째과제/원명 . . . . 3 matches
private int correctNumber;
oneGame.setCorrectNumber();
public void setCorrectNumber()
int setNumber = 0;
setNumber = (int) (Math.random() * 10);
}while (setNumber == 0);
correctNumber = setNumber;
setNumber = (int) (Math.random() * 10);
}while (correctNumber == setNumber);
correctNumber = correctNumber * 10 + setNumber;
setNumber = (int) (Math.random() * 10);
}while (((int)(correctNumber / 10)) == setNumber
|| ((int)(correctNumber % 10)) == setNumber);
correctNumber = correctNumber * 10 + setNumber;
String input = JOptionPane.showInputDialog("Enter three different number\n");
int compareResult = 0, cCorrect = correctNumber;
cCorrect = correctNumber;
JOptionPane.showMessageDialog(null, "You are right!\n Answer is " + correctNumber);
void setCorrectNumber(int in) {
correctNumber = in;
- 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
int findNumberOfMine(char input[][100], int n, int m, int y, int x)
int number = 0;
number++;
return number;
output[i][j] = findNumberOfMine(input, n, m, i, j) + '0';
- 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"
- 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].
- Refactoring/OrganizingData . . . . 3 matches
== Replace Magic Number with Symbolic Constant p204 ==
* You have a literal number with a paricular meaning. [[BR]] ''Crate a constant, name it after the meaning, and replace the number with it.''
* A class has a numeric type code that does not affect its behavior. [[BR]] ''Replace the number with a new class.''
- 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;
- SeminarHowToProgramIt/Pipe/VendingMachineParser.py . . . . 3 matches
def next_number(self,func=int):
return self.err('Expected a number, not '+tok)
num=self.next_number()
- Slurpys/곽세환 . . . . 3 matches
int numberOfCase;
cin >> numberOfCase;
for (testCase = 0; testCase < numberOfCase; testCase++)
- SmithNumbers/이도현 . . . . 3 matches
// no10042 - Smith Numbers
int input_number, input_case, i, j, k;
scanf("%d", &input_number);
for (i = 0; i < input_number; i++)
[SmithNumbers] [AOI]
- Stack/임다찬 . . . . 3 matches
int pop_number;
pop_number=array[index];
return pop_number;
- StringOfCPlusPlus/상협 . . . . 3 matches
int number=0;
number++;
return number;
- Temp/Parser . . . . 3 matches
def next_number(self,func=int):
return self.err('Expected a number, not '+tok)
num=self.next_number()
- ThePriestMathematician/하기웅 . . . . 3 matches
int i, k, number, counting, exponent;
while(cin>>number)
cout<<fourPin[number]<<endl;
- TowerOfCubes/조현태 . . . . 3 matches
const int BOX_FACE_NUMBER = 6;
const char FACE_NAME[BOX_FACE_NUMBER][7] = {"front", "back", "left", "right", "top", "bottom"};
int color[BOX_FACE_NUMBER];
SBoxBlock(int inputNumber, int inputTopFace)
number = inputNumber;
int number;
inline int GetOppositeFace(int faceNumber)
if (1 == faceNumber % 2)
return faceNumber - 1;
return faceNumber + 1;
void SuchNextBox(vector<SMyBox*>& myBoxs, int boxNumber, int lastColor, vector<SBoxBlock>& myBoxStack, vector<SBoxBlock>& bestHeight)
if (0 > boxNumber)
suchFaceList.reserve(BOX_FACE_NUMBER);
for (register int i = 0; i < BOX_FACE_NUMBER; ++i)
for (register int i = 0; i < BOX_FACE_NUMBER; ++i)
if (lastColor == myBoxs[boxNumber]->color[i])
myBoxStack.push_back(SBoxBlock(boxNumber, suchFaceList[i]));
for (register int j = boxNumber - 1; j >= -1 ; --j)
SuchNextBox(myBoxs, j, myBoxs[boxNumber]->color[suchFaceList[i]], myBoxStack, bestHeight);
cout << showStack[i].number + 1 << " ";
- UML . . . . 3 matches
This diagram describes the structure of a simple Restaurant System. UML shows [[Inheritance_(computer_science)|Inheritance]] relationships with a [[triangle]]; and containers with [[rhombus|diamond shape]]. Additionally, the role of the relationship may be specified as well as the cardinality. The Restaurant System has any number of Food dishes(*), with one Kitchen(1), a Dining Area(contains), and any number of staff(*). All of these objects are associated to one Restaurant.
However, collaboration diagrams use the free-form arrangement of objects and links as used in Object diagrams. In order to maintain the ordering of messages in such a free-form diagram, messages are labeled with a chronological number and placed near the link the message is sent over. Reading a Collaboration diagram involves starting at message 1.0, and following the messages from object to object.
- UglyNumbers . . . . 3 matches
=== About UglyNumbers ===
처음 수는 1로 시작하도록 한다. 입력은 받지 않고, <number> 에 1500번째 심술쟁이 수가 출력되게 한다.
The 1500'th ugly number is <number>.
|| [송지훈] || C++ || 20분 ||[UglyNumbers/송지훈]|| . ||
|| 김회영 || c++ || ? ||[UglyNumbers/김회영]|| . ||
|| 곽세환 || c++ || ? ||[UglyNumbers/곽세환]|| O ||
|| 문보창 || c++ || ? ||[UglyNumbers/문보창]|| O ||
|| 구자겸 || c++ || ? ||[UglyNumbers/구자겸]|| . ||
|| 황재선 || Python || 20분 ||[UglyNumbers/황재선]|| O ||
|| [1002] || Python || 2시간 ||[UglyNumbers/1002] || O ||
|| JuNe || Python || 10분 ||[UglyNumbers/JuNe] || O ||
|| Seminar:지원 || Python || 30분 || Seminar:UglyNumbers/지원 || O ||
|| [이동현] || java || 6시간 ||[UglyNumbers/이동현]|| O ||
|| 남훈 || Python || 50분 || [UglyNumbers/남훈] || . ||
|| [이승한] || Python || 40분 || [UglyNumbers/승한] || . ||
|| DamienRice || Python || 2시간 || [UglyNumbers/DamienRice] || O ||
- UpgradeC++/과제2 . . . . 3 matches
int number;
cin >> number;
array[i]=number;
- ViImproved/설명서 . . . . 3 matches
! send next to commend, replace output(eg !) R 삽입모드가 남을때까지 교체 (즉 ESC를 누를 때까지) :set number 라인번호 붙이기
number(nu) nonumber 터미날로 입력되는 메시지를 가능하게 함
- html5/form . . . . 3 matches
* number
== number ==
* {{{<input type="number" min=1 max=10 step=1 value=5>}}}
- 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 tempNumber;
int arrayNumber[20];
int subNumber();
number = nu;
int Data::showNumber(int select)
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)
<< "\t" << d[arrayNumber[i]].showTotal()
<< "\t" << d[arrayNumber[i]].showAve()
- 데블스캠프2006/월요일/연습문제/for/임다찬 . . . . 3 matches
int number;
cin >> number;
cout << factorial(number) << endl;
- 데블스캠프2006/월요일/함수/문제풀이/이차형 . . . . 3 matches
int number=0;
number = rand();
brother = number%7+1;
- 바퀴벌레에게생명을 . . . . 3 matches
스페이스바를 누르면 tile배열의 모든 frequency가 0이되고 처음 밟은 타일의 갯수(numberOfVirginTile)가 총 타일의 숫자와 같아진다. 바퀴벌레가 타일을 밟을 때마다 그 타일의 frequency는 늘어나고, frequency가 0인 타일을 밟았을 경우 numberOfVirginTile은 줄어든다.
타이머의 주기마다 바퀴벌레는 움직이고 그 움직임과 각 타일의 빈도수를 뷰에 그려준다. 종료조건은 스페이스바의 키이벤트와 모든 타일을 적어도 한번씩 밟았을 경우(numberOfVirginTile == 0)이다.
다큐에 TotalNumberOfMovement변수를 생성하여 바퀴벌레가 움직일 때마다 늘려준다. 그리고 프로그램이 정상종료 되었을 때(스페이스바에 의한 종료는 정상종료가 아니다.) 메세지 박스로 그 값을 출력한다.
- 새싹교실/2012/AClass/2회차 . . . . 3 matches
printf("factorial,input number:");
- 난수(random number)를 생성할때 stdlib.h헤더파일을 코드에 포함시키고 srand()를 사용한다.rand()함수는 매번 그 값이 같은 반면에 매실행때마다 난수를 다르게 생성하기 위해서 srand()를 사용한다.
printf("rand()함수를 사용,1개의 random number 나타내기 \n");
- 새싹교실/2012/아우토반/앞반/4.19 . . . . 3 matches
int pick_number;
scanf("%d",&pick_number);
switch(pick_number)
- 알고리즘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.
- 알고리즘5주숙제/하기웅 . . . . 3 matches
int number=0;
number++;
double pi = 4.0*number/testcase;
- 정렬/변준원 . . . . 3 matches
fin >> number[i];
if(number[j] < number[k])
- 중위수구하기/문보창 . . . . 3 matches
==== Number.java ====
public class Number
public Number()
public void inputNumber()
public int findMidiumNumber()
==== {{{~cpp TestNumber.java}}} ====
public class testNumber
Number number = new Number();
number.inputNumber();
int midNum = number.findMidiumNumber();
- 코드레이스/2007.03.24정현영동원희 . . . . 3 matches
int number= 0;
number++;
return number;
- 테트리스만들기2006/예제1 . . . . 3 matches
int number = 0;
printf("%d", number);
++number;
- 토이/숫자뒤집기/김정현 . . . . 3 matches
String number= String.valueOf(num);
for(int i= number.length()-1;i>=0;i--) {
sw.write(number.charAt(i));
- 프로그래밍/DigitGenerator . . . . 3 matches
int number = Integer.parseInt(line);
for(int i = 1; i < number; i++) {
if (i + bitSum == number) {
- 하노이탑/조현태 . . . . 3 matches
int number;
cin >> number;
hanoi (1,3,2,number);
- AcceleratedC++/Chapter2 . . . . 2 matches
// the number of blacks surrounding the greeting
// the number of rows and columns to write
- BabyStepsSafely . . . . 2 matches
This article outlines the refactoring of an algorithm that generate the prime numbers up to a user specified maximum. This algorithm is called the Sieve of Eratosthenes. This article demonstrates that the granularity of the changes made to the source code are very small and rely completely on the ability to recompile and test the code after every change no matter how small. The step where the code is tested insures that each step is done safely. It is important to note that the execution of tests do not actually guarantee that the code is correct. The execution of the tests just guarantees that it isn't any worse that it used to db, prior to the change. This is good enough for the purposes of refactoring since we are tring to not damage anything thay may have worked before Therefore for each change in the code we will be recompilling the code and running the tests.
The code that is to be refactored has existed in the system for awhile. It has undergone a couple of transformations. Initially it returned an array of int variables that are the prime numbers. When the new collection library was introduced in Java2 the interface was changed to return a List of Integer objects. Going forward the method that returns a List is the preferred method, so the method that returns an array has been marked as being deprecated for the last couple of releases. During this release the array member function will be removed. Listing1, "Class GeneratePrimes," contains the source code for both methods.
- CarmichaelNumbers/문보창 . . . . 2 matches
Carmichael Numbers를 찾는 Theorem이 있는 듯하다. 그러나 때려맞추기(?)로 문제를 풀어도 풀린다. 그러나 속도는 떨어진다.
// no10006 - Carmichael Numbers
cout << "The number " << n << " is a Carmichael number.\n";
[CarmichaelNumbers] [AOI]
- 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);
- CppStudy_2002_2/슈퍼마켓 . . . . 2 matches
buy <product> <number> -- <product>를 <number>개 만큼 구매한다
- 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)
- JavaStudy2002/영동-3주차 . . . . 2 matches
// Magic Number 제거
// Magic Number 제거
* 방향을 표현하는 Magic number 제거, 여정인 Board.jouney 가 ArrayList 이므로, String을 넣습니다. 일종의 comment mixing이 되겠지요.
// 방향에 있는 Magic number 제거
// Magic Number 제거
- LightMoreLight/허아영 . . . . 2 matches
If the Number of n's measure is an odd number, an answer is "No"
else if the Number of n's measure is an even number, an answer is "Yes".
I learned how to solve the Number of n's measure.. at a middle school.
- LinkedList/영동 . . . . 2 matches
#define MAX_OF_LIST 8 //Maximum number of linked list and free space list
Node * allocateNewNode(Node * argNode, int argData, int * argNumberOfElements);//Function which allocates new node in memory
void eraseLastNode(Node * argNode, Node ** argFreeNode, int * argNumberOfList, int * argNumberOfFreeSpace);//Function which deletes the last node of the list
void getNode(Node * argNode, Node ** argFreeNode, int * argNumberOfList, int * argNumberOfFreeSpace);//Function which takes the node from free space list
void returnNode(Node * argNode, Node ** argFreeNode, int * argNumberOfList, int * argNumberOfFreeSpace);//Function which return a node of linked list to free space list
elementsOfLinkedList++;//Set 1 to number of node.
Node * allocateNewNode(Node * argNode, int argData, int * argNumberOfElements)
if((*argNumberOfElements)>=MAX_OF_LIST)
(*argNumberOfElements)++;
void eraseLastNode(Node * argNode, Node ** argFreeNode, int * argNumberOfList, int * argNumberOfFreeSpace)
if((*argNumberOfList)>0 && (*argNumberOfFreeSpace)<MAX_OF_LIST)
(*argNumberOfList)--;
(*argNumberOfFreeSpace)++;
void getNode(Node * argNode, Node ** argFreeNode, int * argNumberOfList, int * argNumberOfFreeSpace)
if((*argNumberOfList)<MAX_OF_LIST && (*argNumberOfFreeSpace)>0)
void returnNode(Node * argNode, Node ** argFreeNode, int * argNumberOfList, int * argNumberOfFreeSpace)
if((*argNumberOfList)>0 && (*argNumberOfFreeSpace)<MAX_OF_LIST)
(*argNumberOfList)--;
(*argNumberOfFreeSpace)++;
- MoinMoinTodo . . . . 2 matches
* Link icon to IsbnInfo page, and the ISBN number itself to the main URL
* System Info: number edits, views, whatever.
- MoreEffectiveC++/Techniques1of3 . . . . 2 matches
== Item 26: Limiting the number of objects of a class ==
class UPNumber {
UPNumber();
UPNumber(int initValue);
UPNumber(double initValue);
UPNumber(const UPNumber& rhs);
~UPNumber(); // 파괴자가 사역(private)으로 선언되었다.
UPNumber n; // 에러! 파괴자 사역(private)이라 작동 할수 없다.
UPNumber *p = new UPNumber; // 통과
자 다음과 같이, UPNumber 클래스는 Heap상에서만 사용할수 있는 객체만을 생성 할수 있다. 이것의 대안으로는 Item 26 마지막에 나온 예제와 같이 모든 생성자 만을 사역(private)화 시키는 것이지만, 이 아이디어의 문제는 많은 생성자가 모두 사역(private)으로 있어야 하고, 그것들을 반드시 기억해야 한다는 점이다. 기본 생성자는 물론, 복사 생성자를 전부 선언해 주어야 한다. 그렇지 않으면 컴파일러는 기본적으로 모두 공역(public)으로 취급하고 지역 변수를 만들수 있다. 결과적으로, 파괴자만을 사역(private)화 시키는 것이 간단하다.
class UPNumber { ... }; // 생성자와 파괴자 모두 사역(private)로
class NonNegativeUPNumber:
public UPNumber { ... }; // 에러! 생성자와 파괴자를 컴파일 못한다.
UPNumber value; // 에러! 생성자와 파괴자를 컴파일 못한다.
class UPNumber { ... }; // 파괴자를 보호(protected)로 설정한다.
class NonNegativeUPNumber:
public UPNumber { ... }; // 이제는 유도되는 데는 지장 없다.
UPNumber *value; // 위에서의 객체 선언을 포인터로 바꾸었다.
: value(new UPNumber(initValue)) // 다음과 같이 초기화 리스트로 객체를 만들고
자, 지금까지 다소 맹목적(?)으로 Heap영역에 객체 올리기에만 열중했다. 그럼 여기에서는 "on the heap"의 의미를 확실한 테스트로서 알아 보도록 하겠다. 앞서 써먹은 NonNegativeUPNumber를 non-heap 객체로 만드는건 뭐 틀리지 않은 것이다.
- NumericalExpressionOnComputer . . . . 2 matches
=== signed number ===
=== unsigned number ===
- R'sSource . . . . 2 matches
pattern = re.compile('(^<TABLE.*<a.*number=)(.*)&view=2.*\[1\].*')
beReadingUrl = 'http://www.replays.co.kr/technote/main.cgi?board=bestreplay_pds&number=%d&view=2&howmanytext=' % i
- RecentChangesMacro . . . . 2 matches
* bytesize is replaced by item=''number'' and bytesize is ignored
* item=''number''
- Refactoring/ComposingMethods . . . . 2 matches
return _numberOfLateDeliveries > 5;
return (_numberOfLateDeliveries>5)?2:1;
- SuperMarket . . . . 2 matches
buy <product> <number> -- <product>를 <number>개 만큼 구매한다
- whiteblue/LinkedListAddressMemo . . . . 2 matches
char addressNumber[8];
char menuNumber;
cin >> menuNumber;
switch ( menuNumber )
<< "Selete number> ";
cout << "Enter address number :";
strcpy(firstData->addressNumber, addNum);
strcpy(firstData->addressNumber, addNum);
strcpy(temp_co->addressNumber, firstData->addressNumber);
strcpy(temp_co->addressNumber, firstData->addressNumber);
cout << "○" << temp->name << "\t" << temp->address << "\t" << temp->addressNumber << endl;
- 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");
nNextBookNumber = nTNN;
if ( userinfo[i]->getSchoolNumber() == nUserNum )
if ( bookinfo[i]->getBookNumber() == nBookNum )
int getNextBookNumber() { nNextBookNumber++; return nNextBookNumber; }
- 기억 . . . . 2 matches
* Miller(1956)는 단기 기억 저장 공간을 7+-2 즉, 5~9로 라고 하여, 이를 magic number 7이라고 한다. 이 원리는 전화 번호나 우리가 알파벳을 외울때 사용된다.
* chunking(청킹) 은 자주쓰는 관용어구 같이 유의미 한 단위의 한 묶음을 이야기 하며 magic number를 이용해 기억력을 비약적으로 증가 시킨다. tree구조의 책 구성이나, 마인드 맵에서 발견할수 있다.
- 데블스캠프2005/Python . . . . 2 matches
>>> number = [1,2,3,4,5]
>>> for n in number:
- 몸짱프로젝트/CrossReference . . . . 2 matches
string number(temp);
return number;
- 문제풀이/1회 . . . . 2 matches
input numbers with space:
inNums = [ int(i) for i in raw_input('input numbers with space:\n').split() ]
- 새싹교실/2011/AmazingC . . . . 2 matches
* 따라서 scanf("%d",&number);에서 &는 number가 메모리에서 차지하고 있는 공간의 주소를 반환한다.(후에 포인터 배울때 중요한 개념)
- 새싹교실/2011/씨언어발전/5회차 . . . . 2 matches
int isPrime(int number)
그리고 array를 이용하여 학생들 시험점수의 총합과, 평균, 모든학생의 총합과, 총평균을 구하는 코딩을 해보았다. 또한, 소수(prime number)를 구하는 함수를 배웠다.
- 새싹교실/2012/startLine . . . . 2 matches
해 봐야 할 것 : reverse(number) 정의 - 수 배열을 뒤집는 함수
int reverse(int number);
int currentAccountNumber;
assert(stack->elementNumber == 0);
assert(stack->elementNumber == 1);
assert(stack->elementNumber == 2);
assert(stack->elementNumber == 1);
- 새싹교실/2012/개차반 . . . . 2 matches
* float: 4 byte, floating type number. Specification in IEEE 754-2008
printf ("enter a number : ");
- 스터디/Nand 2 Tetris . . . . 2 matches
* A-Instruction : @value // Where value is either a non-negative decimal number or a symbol referring to such number.
- 영호의바이러스공부페이지 . . . . 2 matches
CX = number of bytes to write
mov cx,virus_size ; Total number of bytes to write
- 임시 . . . . 2 matches
http://en.wikipedia.org/wiki/List_of_IPv4_protocol_numbers protocol number
an Amazon Standard Item Number (ASIN)
- .vimrc . . . . 1 match
set number
- AVG-GCC . . . . 1 match
-V <version> Run gcc version number <version>, if installed[[BR]]
- AcceleratedC++/Chapter3 . . . . 1 match
// the number and sum of grades read so far
- Adapter . . . . 1 match
자 그럼 여기에 예제를 보자. 우리는 employee관리 application을 가지고 있다고 가정한다.어플리케이션 모델은 하나의 인자인, employee의 사회 보장(비밀) 번호(social security number)의 포함하고 application의 사용자 인터페이스는 employee의 사회 보장 번호를 화면상에 뿌려주는 '입력 박스 뷰'를 포함한다.모델의 엑세스하고 초기화 시키기 위한 메소드는 'socialSecurity'와 'socialSecurity:'로 이름 지어져 있다. 입력 박스는 단지 현재의 사회 보장 번호를 뿌리기만 한지만 모델의 값을 요청하는 방법만을 알고있다.( DeleteMe 수정 필요 ) 그래서 우리는 value mesage를 socialSecurity로 변환 해야 한다.우리는 Pluggable Adapter 객체를 이런 목적을 위해서 사용할수 있다.자 우리의 예제를 위한 interaction 다이어 그램을 보자
- AirSpeedTemplateLibrary . . . . 1 match
A number of excellent templating mechanisms already exist for Python, including Cheetah, which has a syntax similar to Airspeed.
- BasicJAVA2005/실습2/허아영 . . . . 1 match
super("Random numbers ver.1");
- Bicoloring/문보창 . . . . 1 match
int count = 0; // count = vertex number
- Bioinformatics . . . . 1 match
GenBank flatfile은 DNA-centered의 보고서이다. DNA중심이라는 것은 어떤 단백질의 유전자 정보를 저장하고 있는 DNA영역이 DNA위의 coding region이라고 불린다. 반대로 대부분의 Protein seq. DB들은 Protein-centered의 관점이며, 이는 단백질과 유전자 사이는 accesion number(유전자를 접근하기위한 DB의 key값) ... 진행중
- C/Assembly . . . . 1 match
-O# (# == number) Optimization Level
- CivaProject . . . . 1 match
/** The count is the number of characters in the String. */
- Classes . . . . 1 match
[http://www.yes24.com/Goods/FTGoodsView.aspx?goodsNo=1949638&CategoryNumber=002001026004 Advanced Engineering Mathematics 9/E]
set number
- ComputerNetworkClass/Exam2006_2 . . . . 1 match
SSRC, CSRC, Contribution Count, timestamp, sequence number, Version etc 에대한 내용을 적고 해설
- ContestScoreBoard/허아영 . . . . 1 match
cout << "team number : " << i << endl;
- CppStudy_2002_1 . . . . 1 match
* 버스 시물레이션 [http://www.sbc.pe.kr/cgi-bin/board/read.cgi?board=life&y_number=17&nnew=2]
- D3D . . . . 1 match
int nElem; // number of elements in the polygon
- DPSCChapter4 . . . . 1 match
'''Flyweight(189)''' Use sharing to support large numbers of fine-grained objects efficiently.
- 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.
- Factorial/영동 . . . . 1 match
cout<<" input number: ";
- HowManyZerosAndDigits/문보창 . . . . 1 match
double N; // number
- HowToBuildConceptMap . . . . 1 match
* Connect the concepts by lines. Label the lines with one or a few linking words. The linking words should define the relationship between the two concepts so that it reads as a valid statement or proposition. The connection creates meaning. When you hierarchically link together a large number of related ideas, you can see the structure of meaning for a given subject domain.
- InternalLinkage . . . . 1 match
[MoreEffectiveC++]의 Item 26 'Limiting the number of objects of a class. 를 보면 다음과 같은 부분이 있다.
- JavaScript/2011년스터디/JSON-js분석 . . . . 1 match
Number.prototype.toJSON =
Number.prototype.toJSON =
* str function에서 'string', 'number', 'boolean', 'null' 은 모두 string로 변환한다. 그런데 'object'의 NULL은 뭐지??
- LUA_6 . . . . 1 match
stdin:1: attempt to index local 'self' (a number value)
- 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?
- MFC/Serialize . . . . 1 match
구현 파일에 넣어야할 IMPLEMENT_SERIAL()는 3가지의 인수를 취한다. 첫번재는 이름, 두번재는 바로 윗 단계의 기본 클래스, 프로그램에 대한 스키마 번호(scheme number), 혹은 버전을 나타내는 부호 없는 32비트 정수를 인자로 받는다.
- MineSweeper/허아영 . . . . 1 match
int fieldNum = 1; // field number
- MoinMoinFaq . . . . 1 match
including the number of pages, and the macros and actions that are installed.
- MoreEffectiveC++ . . . . 1 match
* Item 26: Limiting the number of objects of a class - 객체 숫자 제한하기.
- MoreEffectiveC++/Basic . . . . 1 match
double result = static_cast(double, firstNumber)/ secondNumber;
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++/Exception . . . . 1 match
class PhoneNumber{ ... };
void addPhoneNumber(const PhoneNumber& number);
list<phoneNumber> thePhones;
- MoreEffectiveC++/Miscellany . . . . 1 match
string 형의 디자인에 반영된 이러한 접근은-템플릿의 일반화- 표준 C++ 라이브러리를 통해서 반복되어 진다. IOStream? 그들은 템플릿이다.; 인자(type parameter)는 스트림에서 만들어지는 문자형으로 정의되어 있다. 복잡한 숫자(Complex number)? 역시 템플릿이다.;인자(type parameter)는 숫자를 어떻게 저장할지 정의되어 있다. Valarray? 템플릿이다.;인자(type parameter)는 각 배열에 최적화된다. 그리고 STL은 거의 모든 템플릿의 복합체이다. 만약 당신이 템플릿에 익숙하지 않다면, 지금 한발작 내디뎌 보아라.
- MythicalManMonth . . . . 1 match
number of software projects that delivered production code.
- NSIS/Reference . . . . 1 match
|| UninstallSubCaption || page_number subcaption || 0: Confirmation, 1:Uninstalling Files, 2:Completed||
- 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
- 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
printf ("random number : %d \n", nRandNum);
- 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.
- RSSAndAtomCompared . . . . 1 match
#pragma section-numbers off
- RandomWalk/황재선 . . . . 1 match
cout << "\n(1)The total number of legal moves: " << count << endl;
- Refactoring/SimplifyingConditionalExpressions . . . . 1 match
return getBaseSpeed() - getLoadFactor() * _numberofCoconuts;
- ReleasePlanning . . . . 1 match
of stories to be implemented as the first (or next) release. A useable, testable system that makes good business sense delivered early is desired.You may plan by time or by scope. The project velocity is used to determine either how many stories can be implemented before a given date (time) or how long a set of stories will take to finish (scope). When planning by time multiply the number of iterations by the project velocity to determine how many user stories can be completed. When planning by scope divide the total weeks of estimated user stories by the project velocity to determine how many iterations till the release is ready.
- 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 를 비활성(기본값)화 시키세요.
- StructuredText . . . . 1 match
* A paragraph that has blocks of text enclosed in '||' is treated as a table. The text blocks correspond to table cells and table rows are denoted by newlines. By default the cells are center aligned. A cell can span more than one column by preceding a block of text with an equivalent number of cell separators '||'. Newlines and '|' cannot be a part of the cell text. For example:
- 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
==== Ugly Number ====
// no136 - Ugly Numbers(a)
cout << "The 1500'th ugly number is " << num[1499] << ".\n";
[UglyNumbers] [문보창]
- 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.
- VMWare/OSImplementationTest . . . . 1 match
mov al, 3h ; Number of sectors to read = 1
number of parameters.\n\n");
- VendingMachine/세연/1002 . . . . 1 match
2. 소위 magic number (ex : 배열의 범위를 설정하는 숫자들) 라 불리는 것들에 대해 - const 변수 선언[[BR]]
- WOWAddOn/2011년프로젝트/초성퀴즈 . . . . 1 match
http://www.wowwiki.com/Getting_the_current_interface_number
- [Lovely]boy^_^/Arcanoid . . . . 1 match
* Game can exhibit score, number of broken blocks, and time.
- [Lovely]boy^_^/EnglishGrammer/Passive . . . . 1 match
We can use these structures with a number of other verbs
- whiteblue/간단한계산기 . . . . 1 match
JButton numberButton[];
- 구조체 파일 입출력 . . . . 1 match
cout << endl << "Input phone number : " ;
- 김희성/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);
- 데블스캠프2002 . . . . 1 match
1. ["NumberBaseballGame"] - 작년 데블스 캠프에서 한 숫자 야구 게임입니다 --재동
1. ["GoodNumber"] - 소수나 완전수는 너무 일반적이어서, 그나마 새로운 good number. --zennith
- 데블스캠프2011/셋째날/RUR-PLE/권순의 . . . . 1 match
for number in range (2):
- 데블스캠프2011/셋째날/RUR-PLE/송지원 . . . . 1 match
for number of range (4) :
- 레밍즈프로젝트/프로토타입/STLLIST . . . . 1 match
|| GetCount || Returns the number of elements in this list. ||
- 렌덤워크/조재화 . . . . 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;
- 서지혜/단어장 . . . . 1 match
식별하다 : The computer program was unable to discriminate between letters and numbers.
- 소수구하기/zennith . . . . 1 match
printf("#%d prime numbers.\n", count);
- 양아석 . . . . 1 match
=for number in range(num)
- 오목/휘동, 희경 . . . . 1 match
int x[room*room], y[room*room], number;
- 위키설명회2005/PPT준비 . . . . 1 match
리스트: 공백과 * 한개; 1., a., A., i., I. 숫자로 된 items; 1.#n start numbering at n; space alone indents.
- 임지혜 . . . . 1 match
[http://www.cyworld.com/number22]
- 전문가의명암 . . . . 1 match
NoSmok:AlfredNorthWhitehead''''''는 ''Civilization advances by extending the number of important operations which we can perform without thinking of them.''라는 명언을 남겼다.
- 최소정수의합/송지훈 . . . . 1 match
cout << "The smallest 'n' for making the number what we want" << endl;
- 피보나치/김정현 . . . . 1 match
a=int(raw_input("input number"))
- 헝가리안표기법 . . . . 1 match
|| n || int || number, quantity || int nNum ||
Found 325 matching pages out of 7540 total pages (5000 pages are searched)
You can also click here to search title.
