랭 ¶
대 마막 딩...
~cpp
#include <stdio.h>
#include <stdlib.h>
#define NUMBER_OF_SCORES 5
struct ArratData{
int sum;
float avg;
int max;
int min;
};
struct ScoreData{
int score;
int rank;
};
void InputScores(struct ArratData* aArrayData, struct ScoreData* aArray);
void PrintArray(struct ArratData* aArrayData, struct ScoreData* aArray);
void RankScores(struct ScoreData* aArray);
void PrintRanks(struct ScoreData* aArray);
int main(){
struct ScoreData scoreArray[NUMBER_OF_SCORES];
struct ArratData arrayData;
InputScores(&arrayData, scoreArray);
PrintArray(&arrayData, scoreArray);
RankScores(scoreArray);
PrintRanks(scoreArray);
system("pause");
return 0;
}
void InputScores(struct ArratData* aArrayData, struct ScoreData* aArray){
/*Enter a number for score[0] : 80
Enter a number for score[1] : 50
Enter a number for score[2] : 99
Enter a number for score[3] : 74
Enter a number for score[4] : 88
*/
int count = 0;
while(count < NUMBER_OF_SCORES){
printf("\nEnter a number for score[%d] : ", count);
scanf("%d", &(aArray[count].score));
aArray[count].rank = 1;
if(count == 0){
aArrayData->min = aArray[count].score;
aArrayData->max = aArray[count].score;
aArrayData->sum = aArray[count].score;
}
else{
if(aArray[count].score < aArrayData->min){
aArrayData->min = aArray[count].score;
}
if(aArray[count].score > aArrayData->max){
aArrayData->max = aArray[count].score;
}
aArrayData->sum += aArray[count].score;
}
count++;
}
aArrayData->avg = (float)aArrayData->sum/NUMBER_OF_SCORES;
}
void PrintArray(struct ArratData* aArrayData, struct ScoreData* aArray){
/*[[ The contents of score array ]]
80 50 99 74 88
sum = 391, avg = 78.2
max = 99, min = 50
*/
int count;
printf("\n[[ The contents of score array ]]\n\n");
for(count = 0; count < NUMBER_OF_SCORES; count++){
printf("%d\t", aArray[count].score);
}
printf("\n\nsum = %d, avg = %.1f", aArrayData->sum, aArrayData->avg);
printf("\n\nmax = %d, min = %d\n", aArrayData->max, aArrayData->min);
}
void RankScores(struct ScoreData* aArray){
int count;
int cmpCount;
for(count = 0; count < NUMBER_OF_SCORES; count++){
for(cmpCount = 0; cmpCount < NUMBER_OF_SCORES; cmpCount++){
if(aArray[count].score < aArray[cmpCount].score){
/*배 내 보 마 랭는 내.*/
aArray[count].rank++;
}
}
}
}
void PrintRanks(struct ScoreData* aArray){
/*score[0] : 80, rank = 3
score[1] : 50, rank = 5
score[2] : 99, rank = 1
score[3] : 74, rank = 4
score[4] : 88, rank = 2*/
int count;
for(count = 0; count < NUMBER_OF_SCORES; count++){
printf("\nscore[%d] : %d, rank = %d\n", count, aArray[count].score, aArray[count].rank);
}
}
¶
y = 4 * (1 - x)는 x 0.3 0.3000000001 , 를 100번 복 .
if 0.3 then 0.673899088
if 0.3000000001 then 0.076831721
if 0.3 then 0.673899088
if 0.3000000001 then 0.076831721
무 략(Tit for Tat) ¶
마 문 대 냈 를 따낸.
바보 듯.
바보 듯.
릭 ¶
ETC ¶
www.devpia.com
www.tiptech.net
www.microsoft.com/korea/msdn.default.asp
www.tiptech.net
www.microsoft.com/korea/msdn.default.asp
듣는 람 -
대 노 램 - 봉 등
디 + 복 - 만 등
대 노 램 - 봉 등
디 + 복 - 만 등
- 무
"무리 를 리만 를 " - 2001 1 료 료 듣()
"무리 를 리만 를 " - 2001 1 료 료 듣()
빨, 2, 밴딩머.
C미 ¶
밴딩머
~cpp
#include<stdio.h>
int main(void){
//변
char beverage[3] = {'A', 'B', 'C'};
const int beveragePrice[3] = {100, 200, 300};
int beverageNumber;
int money;
//
do{
printf("돈 . : ");
scanf("%d", &money);
}while(money <= 0);
for(int i = 0; i < 3; i++){
printf("%d. %c\n", i, beverage[i]);
}
do{
printf("료를 : ");
scanf("%d", &beverageNumber);
}while(beverageNumber < 0 || beverageNumber >=3);
printf("%C 료 \n", beverage[beverageNumber]);
if(money >= beveragePrice[beverageNumber]){
money -= beveragePrice[beverageNumber];
printf("%C 료 .\n", beverage[beverageNumber]);
}
else{
printf(" 부.\n");
}
printf("%d 됩.\n", money);
return 0;
}











