Algorithm Gossip: 得分排行
canca
2008-06-03 15:00
1
0
說明
解法
for(i = 0; i < count; i++) {
juni[i] = 1;
for(j = 0; j < count; j++) {
if(score[j] > score[i])
juni[i]++;
}
}
printf("得分\t排行\n");
for(i = 0; i < count; i++)
printf("%d\t%d\n", score[i], juni[i]);
實作
#include <stdio.h>
#include <stdlib.h>
#define MAX 100
#define MIN 0
int main(void) {
int score[MAX+1] = {0};
int juni[MAX+2] = {0};
int count = 0, i;
do {
printf("輸入分數,-1結束:");
scanf("%d", &score[count++]);
} while(score[count-1] != -1);
count--;
for(i = 0; i < count; i++)
juni[score[i]]++;
juni[MAX+1] = 1;
for(i = MAX; i >= MIN; i--)
juni[i] = juni[i] + juni[i+1];
printf("得分\t排行\n");
for(i = 0; i < count; i++)
printf("%d\t%d\n", score[i], juni[score[i]+1]);
return 0;
}
import java.io.*;
public class ScoreRank {
public static void main(String[] args)
throws NumberFormatException, IOException {
final int MAX = 100;
final int MIN = 0;
int[] score = new int[MAX+1];
int[] juni = new int[MAX+2];
BufferedReader reader =
new BufferedReader(
new InputStreamReader(System.in));
int count = 0;
do {
System.out.print("輸入分數,-1結束:");
score[count++] =
Integer.parseInt(reader.readLine());
} while((score[count-1] != -1));
count--;
for(int i = 0; i < count; i++)
juni[score[i]]++;
juni[MAX+1] = 1;
for(int i = MAX; i >= MIN; i--)
juni[i] = juni[i] + juni[i+1];
System.out.println("得分\t排行");
for(int i = 0; i < count; i++) {
System.out.println(score[i] + "\t" +
juni[score[i]+1]);
}
}
}
发表评论