UVA 10194 (13.08.05)
| :W Problem A: Football (aka Soccer) |
The Problem
Football the most popular sport in the world (americans insist to call it "Soccer",but we will call it "Football"). As everyone knows, Brasil is the country that have mostWorld Cup titles (four of them: 1958, 1962, 1970 and 1994). As our national tournament have many teams(and even regional tournaments have many teams also) it's a very hard task to keep track ofstandings with so many teams and games played!
So, your task is quite simple: write a program that receives the tournament name, team namesand games played and outputs the tournament standings so far.
A team wins a game if it scores more goals than its oponent. Obviously, a team loses a gameif it scores less goals. When both teams score the same number of goals, we call it a tie.A team earns 3 points for each win, 1 point for each tie and 0 point for each loss.
Teams are ranked according to these rules (in this order):
- Most points earned.
- Most wins.
- Most goal difference (i.e. goals scored - goals against)
- Most goals scored.
- Less games played.
- Lexicographic order.
The Input
The first line of input will be an integer N in a line alone (0 < N < 1000). Then, will follow N tournament descriptions. Each one begins with the tournament name, on a single line. Tournament names can have any letter, digits, spaces etc. Tournament names willhave length of at most 100. Then, in the next line, there will be a number T (1 < T <= 30), which stands for the number of teams participating on this tournament. Then will follow T lines, each one containing one team name. Team names may have any character that have ASCII code greaterthan or equal to 32 (space), except for '#' and '@' characters, which will never appear in teamnames. No team name will have more than 30 characters.
Following to team names, there will be a non-negative integer G on a single line which stands forthe number of games already played on this tournament. G will be no greater than 1000. Then, Glines will follow with the results of games played. They will follow this format:
team_name_1#goals1@goals2#team_name_2
For instance, the following line:
Team A#3@1#Team B
Means that in a game between Team A and Team B, Team A scored 3 goals and Team B scored 1.All goals will be non-negative integers less than 20. You may assume that there will not be inexistent team names (i.e. all team names that appear on game results will have apperead on the team names section) and that no team will play against itself.
The Output
For each tournament, you must output the tournament name in a single line. In the next Tlines you must output the standings, according to the rules above. Notice that should thetie-breaker be the lexographic order, it must be done case insenstive. The output format for each line is shown bellow:
[a]) Team_name [b]p, [c]g ([d]-[e]-[f]), [g]gd ([h]-[i])
Where:
- [a] = team rank
- [b] = total points earned
- [c] = games played
- [d] = wins
- [e] = ties
- [f] = losses
- [g] = goal difference
- [h] = goals scored
- [i] = goals against
There must be a single blank space between fields and a single blank line between output sets. See the sample output for examples.
Sample Input
2
World Cup 1998 - Group A
4
Brazil
Norway
Morocco
Scotland
6
Brazil#2@1#Scotland
Norway#2@2#Morocco
Scotland#1@1#Norway
Brazil#3@0#Morocco
Morocco#3@0#Scotland
Brazil#1@2#Norway
Some strange tournament
5
Team A
Team B
Team C
Team D
Team E
5
Team A#1@1#Team B
Team A#2@2#Team C
Team A#0@0#Team D
Team E#2@1#Team C
Team E#1@2#Team D
Sample Output
World Cup 1998 - Group A
1) Brazil 6p, 3g (2-0-1), 3gd (6-3)
2) Norway 5p, 3g (1-2-0), 1gd (5-4)
3) Morocco 4p, 3g (1-1-1), 0gd (5-5)
4) Scotland 1p, 3g (0-1-2), -4gd (2-6) Some strange tournament
1) Team D 4p, 2g (1-1-0), 1gd (2-1)
2) Team E 3p, 2g (1-0-1), 0gd (3-3)
3) Team A 3p, 3g (0-3-0), 0gd (3-3)
4) Team B 1p, 1g (0-1-0), 0gd (1-1)
5) Team C 1p, 2g (0-1-1), -1gd (3-4)
题意: (大家不用怕, 这题我可以说是很水, 但是就是麻烦)
根据给出的数据, 制作足球比赛的榜单, 有一些排序规则
先看得分(赢一场3分, 平一场1分, 输一场没加没减), 得分高者排前面
若得分相同, 看胜场, 胜场多者排前面,
若胜场相同, 看净胜球, 净胜球多者排前面,
若净胜球相同, 看进球数, 进球数多者排前面,
若进球数相同, 看参赛场次, 参赛场次少者排前面,
若他妈的参赛场次还相同, 只能字典序咯~
做法:
强烈建议用结构体, 表示队伍的有关信息~
只需保存的数据只有:
进球数, 被进球数 (这两个可以求净胜球了)
胜 平 负 的场次(这三个可以求总参赛场次了, 还有积分)
最后面还另附测试数据!
AC代码:
#include<stdio.h>
#include<string.h>
#include<stdlib.h> int T;
int team_num;
int game_num; struct Team {
char name[50];
int score;
int win;
int same;
int lost;
int in;
int ined;
}team[50]; void toLower(char str[]) {
int len = strlen(str);
for(int i = 0; i < len; i++)
if(str[i] >= 'a' && str[i] <= 'z')
str[i] -= ('a' - 'A');
} int cmp(const void *_a, const void *_b) {
struct Team *a = (struct Team*)_a;
struct Team *b = (struct Team*)_b; if(a->score != b->score)
return a->score < b->score;
if(a->win != b->win)
return a->win < b->win;
if((a->in - a->ined) != (b->in - b->ined))
return (a->in - a->ined) < (b->in - b->ined);
if(a->in != b->in)
return a->in < b->in;
if((a->win + a->same + a->lost) != (b->win + b->same + b->lost))
return (a->win + a->same + a->lost) > (b->win + b->same + b->lost); char ta[50], tb[50];
strcpy(ta, a->name);
strcpy(tb, b->name);
toLower(ta);
toLower(tb);
return strcmp(ta, tb);
} int find(char *str) {
for(int i = 0; i < team_num; i++)
if(!strcmp(team[i].name, str))
return i;
return 0;
} int main() {
char game[125];
scanf("%d", &T);
getchar();
while(T--) {
gets(game); memset(team, 0, sizeof(team)); scanf("%d", &team_num);
getchar();
for(int i = 0; i < team_num; i++)
gets(team[i].name); scanf("%d", &game_num);
getchar();
while(game_num--) {
char ch;
int a, b;
int p = 0;
char t1[50], t2[50];
while(ch = getchar(), ch != '#')
t1[p++] = ch;
t1[p] = '\0';
scanf("%d", &a);
getchar();
scanf("%d", &b);
getchar();
gets(t2);
//根据两队的名字，在team中找到编号；
int pos1, pos2;
pos1 = find(t1);
pos2 = find(t2);
//更新进球数 与 被进球数；
team[pos1].in = team[pos1].in + a;
team[pos1].ined = team[pos1].ined + b;
team[pos2].in = team[pos2].in + b;
team[pos2].ined = team[pos2].ined + a;
//更新胜负数 以及 得分；
if(a > b) {
team[pos1].win++;
team[pos2].lost++;
team[pos1].score += 3;
}
else if(b > a) {
team[pos2].win++;
team[pos1].lost++;
team[pos2].score += 3;
}
else {
team[pos1].same++;
team[pos2].same++;
team[pos1].score++;
team[pos2].score++;
}
}
qsort(team, team_num, sizeof(team[0]), cmp);
puts(game);
int flag = 0;
for(int i = 0; i < team_num; i++) {
printf("%d) ", ++flag);
printf("%s ", team[i].name);
printf("%dp, ", team[i].score);
printf("%dg ", (team[i].win + team[i].same + team[i].lost));
printf("(%d-%d-%d), ", team[i].win, team[i].same, team[i].lost);
printf("%dgd ", (team[i].in - team[i].ined));
printf("(%d-%d)\n", team[i].in, team[i].ined);
}
if(T != 0)
printf("\n");
}
return 0;
}
数据来自于:http://online-judge.uva.es/board/viewtopic.php?f=10&t=9336&p=126129&hilit=10194#p126129
Some test data for my accepted code:
Input:
18
World Cup 1998 - Group A
4
Brazil
Norway
Morocco
Scotland
6
Brazil#2@1#Scotland
Norway#2@2#Morocco
Scotland#1@1#Norway
Brazil#3@0#Morocco
Morocco#3@0#Scotland
Brazil#1@2#Norway
Some strange tournament
5
Team A
Team B
Team C
Team D
Team E
5
Team A#1@1#Team B
Team A#2@2#Team C
Team A#0@0#Team D
Team E#2@1#Team C
Team E#1@2#Team D
Penultimate Tournament
5
A
B
C
D
E
5
A#2@0#B
A#1@0#C
B#3@0#D
C#3@0#D
C#0@1#E
Last Tournament
3
Gato
Lobo
Mono
3
Gato#2@2#Lobo
Lobo#1@1#Mono
Mono#3@3#Gato
2010 FIFA World Cup qualification (CAF) 2nd round Group 5
4
Gabon
Ghana
Lesotho
Libya
12
Ghana#3@0#Libya
Libya#1@0#Gabon
Lesotho#2@3#Ghana
Gabon#2@0#Ghana
Lesotho#0@1#Libya
Libya#4@0#Lesotho
Ghana#2@0#Gabon
Gabon#2@0#Lesotho
Libya#1@0#Ghana
Lesotho#0@3#Gabon
Gabon#1@0#Libya
Ghana#3@0#Lesotho
2010 FIFA World Cup qualification (CAF)
6
Madagascar
Comoros
Somalia
Sierra Leone
Guinea-Bissau
Djibouti
5
Madagascar#6@2#Comoros
Madagascar#4@0#Comoros
Djibouti#1@0#Somalia
Sierra Leone#1@0#Guinea-Bissau
Sierra Leone#0@0#Guinea-Bissau
2010 FIFA World Cup qualification (CAF) 2nd round Group 1
4
Cameroon
CapeVerde
Mauritius
Tanzania
12
Tanzania#1@1#Mauritius
Cameroon#2@0#CapeVerde
CapeVerde#1@0#Tanzania
Mauritius#0@3#Cameroon
Tanzania#0@0#Cameroon
Mauritius#0@1#CapeVerde
Cameroon#2@1#Tanzania
CapeVerde#3@1#Mauritius
Mauritius#1@4#Tanzania
CapeVerde#1@2#Cameroon
Tanzania#3@1#CapeVerde
Cameroon#5@0#Mauritius
2010 FIFA World Cup qualification (CAF) 2nd round Group 2
4
Guinea
Kenya
Namibia
Zimbabwe
12
Namibia#2@1#Kenya
Guinea#0@0#Zimbabwe
Kenya#2@0#Guinea
Zimbabwe#2@0#Namibia
Kenya#2@0#Zimbabwe
Namibia#1@2#Guinea
Zimbabwe#0@0#Kenya
Guinea#4@0#Namibia
Kenya#1@0#Namibia
Zimbabwe#0@0#Guinea
Namibia#4@2#Zimbabwe
Guinea#3@2#Kenya
2010 FIFA World Cup qualification (CAF) 2nd round Group 3
4
Angola
Benin
Niger
Uganda
12
Uganda#1@0#Niger
Angola#3@0#Benin
Benin#4@1#Uganda
Niger#1@2#Angola
Uganda#3@1#Angola
Niger#0@2#Benin
Benin#2@0#Niger
Angola#0@0#Uganda
Benin#3@2#Angola
Niger#3@1#Uganda
Uganda#2@1#Benin
Angola#3@1#Niger
2010 FIFA World Cup qualification (CAF) 2nd round Group 4
4
EquatorialGuinea
Nigeria
SierraLeone
SouthAfrica
12
EquatorialGuinea#2@0#SierraLeone
Nigeria#2@0#SouthAfrica
SouthAfrica#4@1#EquatorialGuinea
SierraLeone#0@1#Nigeria
SierraLeone#1@0#SouthAfrica
EquatorialGuinea#0@1#Nigeria
SouthAfrica#0@0#SierraLeone
Nigeria#2@0#EquatorialGuinea
SouthAfrica#0@1#Nigeria
SierraLeone#2@1#EquatorialGuinea
EquatorialGuinea#0@1#SouthAfrica
Nigeria#4@1#SierraLeone
2010 FIFA World Cup qualification (CAF) 2nd round Group 6
4
Algeria
Gambia
Liberia
Senegal
12
Senegal#1@0#Algeria
Liberia#1@1#Gambia
Algeria#3@0#Liberia
Gambia#0@0#Senegal
Gambia#1@0#Algeria
Liberia#2@2#Senegal
Algeria#1@0#Gambia
Senegal#3@1#Liberia
Algeria#3@2#Senegal
Gambia#3@0#Liberia
Liberia#0@0#Algeria
Senegal#1@1#Gambia
2010 FIFA World Cup qualification (CAF) 2nd round Group 7
4
Botswana
Côted'Ivoire
Madagascar
Mozambique
12
Botswana#0@0#Madagascar
Côted'Ivoire#1@0#Mozambique
Madagascar#0@0#Côted'Ivoire
Mozambique#1@2#Botswana
Botswana#1@1#Côted'Ivoire
Madagascar#1@1#Mozambique
Mozambique#3@0#Madagascar
Côted'Ivoire#4@0#Botswana
Madagascar#1@0#Botswana
Mozambique#1@1#Côted'Ivoire
Botswana#0@1#Mozambique
Côted'Ivoire#3@0#Madagascar
2010 FIFA World Cup qualification (CAF) 2nd round Group 8
3
Mauritania
Morocco
Rwanda
6
Rwanda#3@0#Mauritania
Mauritania#1@4#Morocco
Rwanda#3@1#Morocco
Morocco#2@0#Rwanda
Mauritania#0@1#Rwanda
Morocco#4@1#Mauritania
2010 FIFA World Cup qualification (CAF) 2nd round Group 9
4
BurkinaFaso
Burundi
Seychelles
Tunisia
12
Burundi#1@0#Seychelles
Tunisia#1@2#BurkinaFaso
Seychelles#0@2#Tunisia
BurkinaFaso#2@0#Burundi
Seychelles#2@3#BurkinaFaso
Burundi#0@1#Tunisia
BurkinaFaso#4@1#Seychelles
Tunisia#2@1#Burundi
Seychelles#1@2#Burundi
BurkinaFaso#0@0#Tunisia
Tunisia#5@0#Seychelles
Burundi#1@3#BurkinaFaso
2010 FIFA World Cup qualification (CAF) 2nd round Group 10
4
Chad
Congo
Mali
Sudan
12
Mali#4@2#Congo
Chad#1@2#Mali
Congo#1@0#Sudan
Chad#2@1#Congo
Sudan#3@2#Mali
Congo#2@0#Chad
Mali#3@0#Sudan
Sudan#1@2#Chad
Congo#1@0#Mali
Chad#1@3#Sudan
Mali#2@1#Chad
Sudan#2@0#Congo
2010 FIFA World Cup qualification (CAF) 2nd round Group 11
3
Swaziland
Togo
Zambia
6
Togo#1@0#Zambia
Swaziland#2@1#Togo
Swaziland#0@0#Zambia
Zambia#1@0#Swaziland
Zambia#1@0#Togo
Togo#6@0#Swaziland
2010 FIFA World Cup qualification (CAF) 2nd round Group 12
4
CongoDR
Djibouti
Egypt
Malawi
12
Malawi#8@1#Djibouti
Egypt#2@1#CongoDR
Djibouti#0@4#Egypt
CongoDR#1@0#Malawi
Malawi#1@0#Egypt
CongoDR#5@1#Djibouti
Egypt#2@0#Malawi
Djibouti#0@3#Malawi
CongoDR#0@1#Egypt
Malawi#2@1#CongoDR
Egypt#4@0#Djibouti
Djibouti#0@6#CongoDR
Fck tournament
30
Team 0
Team 1
Team 2
Team 3
Team 4
Team 5
Team 6
Team 7
Team 8
Team 9
Team 10
Team 11
Team 12
Team 13
Team 14
Team 15
Team 16
Team 17
Team 18
Team 19
Team 20
Team 21
Team 22
Team 23
Team 24
Team 25
Team 26
Team 27
Team 28
Team 29
30
Team 0#1@0#Team 1
Team 1#1@0#Team 2
Team 2#1@0#Team 3
Team 3#1@0#Team 4
Team 4#1@0#Team 5
Team 5#1@0#Team 6
Team 6#1@0#Team 7
Team 7#1@0#Team 8
Team 8#1@0#Team 9
Team 9#1@0#Team 10
Team 10#1@0#Team 11
Team 11#1@0#Team 12
Team 12#1@0#Team 13
Team 13#1@0#Team 14
Team 14#1@0#Team 15
Team 15#1@0#Team 16
Team 16#1@0#Team 17
Team 17#1@0#Team 18
Team 18#1@0#Team 19
Team 19#1@0#Team 20
Team 20#1@0#Team 21
Team 21#1@0#Team 22
Team 22#1@0#Team 23
Team 23#1@0#Team 24
Team 24#1@0#Team 25
Team 25#1@0#Team 26
Team 26#1@0#Team 27
Team 27#1@0#Team 28
Team 28#1@0#Team 29
Team 29#1@0#Team 0
output
World Cup 1998 - Group A
1) Brazil 6p, 3g (2-0-1), 3gd (6-3)
2) Norway 5p, 3g (1-2-0), 1gd (5-4)
3) Morocco 4p, 3g (1-1-1), 0gd (5-5)
4) Scotland 1p, 3g (0-1-2), -4gd (2-6)
Some strange tournament
1) Team D 4p, 2g (1-1-0), 1gd (2-1)
2) Team E 3p, 2g (1-0-1), 0gd (3-3)
3) Team A 3p, 3g (0-3-0), 0gd (3-3)
4) Team B 1p, 1g (0-1-0), 0gd (1-1)
5) Team C 1p, 2g (0-1-1), -1gd (3-4)
Penultimate Tournament
1) A 6p, 2g (2-0-0), 3gd (3-0)
2) B 3p, 2g (1-0-1), 1gd (3-2)
3) C 3p, 3g (1-0-2), 1gd (3-2)
4) E 3p, 1g (1-0-0), 1gd (1-0)
5) D 0p, 2g (0-0-2), -6gd (0-6)
Last Tournament
1) Gato 2p, 2g (0-2-0), 0gd (5-5)
2) Mono 2p, 2g (0-2-0), 0gd (4-4)
3) Lobo 2p, 2g (0-2-0), 0gd (3-3)
2010 FIFA World Cup qualification (CAF) 2nd round Group 5
1) Ghana 12p, 6g (4-0-2), 6gd (11-5)
2) Gabon 12p, 6g (4-0-2), 5gd (8-3)
3) Libya 12p, 6g (4-0-2), 3gd (7-4)
4) Lesotho 0p, 6g (0-0-6), -14gd (2-16)
2010 FIFA World Cup qualification (CAF)
1) Madagascar 6p, 2g (2-0-0), 8gd (10-2)
2) Sierra Leone 4p, 2g (1-1-0), 1gd (1-0)
3) Djibouti 3p, 1g (1-0-0), 1gd (1-0)
4) Guinea-Bissau 1p, 2g (0-1-1), -1gd (0-1)
5) Somalia 0p, 1g (0-0-1), -1gd (0-1)
6) Comoros 0p, 2g (0-0-2), -8gd (2-10)
2010 FIFA World Cup qualification (CAF) 2nd round Group 1
1) Cameroon 16p, 6g (5-1-0), 12gd (14-2)
2) CapeVerde 9p, 6g (3-0-3), -1gd (7-8)
3) Tanzania 8p, 6g (2-2-2), 3gd (9-6)
4) Mauritius 1p, 6g (0-1-5), -14gd (3-17)
2010 FIFA World Cup qualification (CAF) 2nd round Group 2
1) Guinea 11p, 6g (3-2-1), 4gd (9-5)
2) Kenya 10p, 6g (3-1-2), 3gd (8-5)
3) Namibia 6p, 6g (2-0-4), -5gd (7-12)
4) Zimbabwe 6p, 6g (1-3-2), -2gd (4-6)
2010 FIFA World Cup qualification (CAF) 2nd round Group 3
1) Benin 12p, 6g (4-0-2), 4gd (12-8)
2) Angola 10p, 6g (3-1-2), 3gd (11-8)
3) Uganda 10p, 6g (3-1-2), -1gd (8-9)
4) Niger 3p, 6g (1-0-5), -6gd (5-11)
2010 FIFA World Cup qualification (CAF) 2nd round Group 4
1) Nigeria 18p, 6g (6-0-0), 10gd (11-1)
2) SouthAfrica 7p, 6g (2-1-3), 0gd (5-5)
3) SierraLeone 7p, 6g (2-1-3), -4gd (4-8)
4) EquatorialGuinea 3p, 6g (1-0-5), -6gd (4-10)
2010 FIFA World Cup qualification (CAF) 2nd round Group 6
1) Algeria 10p, 6g (3-1-2), 3gd (7-4)
2) Gambia 9p, 6g (2-3-1), 3gd (6-3)
3) Senegal 9p, 6g (2-3-1), 2gd (9-7)
4) Liberia 3p, 6g (0-3-3), -8gd (4-12)
2010 FIFA World Cup qualification (CAF) 2nd round Group 7
1) Côted'Ivoire 12p, 6g (3-3-0), 8gd (10-2)
2) Mozambique 8p, 6g (2-2-2), 2gd (7-5)
3) Madagascar 6p, 6g (1-3-2), -5gd (2-7)
4) Botswana 5p, 6g (1-2-3), -5gd (3-8)
2010 FIFA World Cup qualification (CAF) 2nd round Group 8
1) Morocco 9p, 4g (3-0-1), 6gd (11-5)
2) Rwanda 9p, 4g (3-0-1), 4gd (7-3)
3) Mauritania 0p, 4g (0-0-4), -10gd (2-12)
2010 FIFA World Cup qualification (CAF) 2nd round Group 9
1) BurkinaFaso 16p, 6g (5-1-0), 9gd (14-5)
2) Tunisia 13p, 6g (4-1-1), 8gd (11-3)
3) Burundi 6p, 6g (2-0-4), -4gd (5-9)
4) Seychelles 0p, 6g (0-0-6), -13gd (4-17)
2010 FIFA World Cup qualification (CAF) 2nd round Group 10
1) Mali 12p, 6g (4-0-2), 5gd (13-8)
2) Sudan 9p, 6g (3-0-3), 0gd (9-9)
3) Congo 9p, 6g (3-0-3), -1gd (7-8)
4) Chad 6p, 6g (2-0-4), -4gd (7-11)
2010 FIFA World Cup qualification (CAF) 2nd round Group 11
1) Zambia 7p, 4g (2-1-1), 1gd (2-1)
2) Togo 6p, 4g (2-0-2), 5gd (8-3)
3) Swaziland 4p, 4g (1-1-2), -6gd (2-8)
2010 FIFA World Cup qualification (CAF) 2nd round Group 12
1) Egypt 15p, 6g (5-0-1), 11gd (13-2)
2) Malawi 12p, 6g (4-0-2), 9gd (14-5)
3) CongoDR 9p, 6g (3-0-3), 8gd (14-6)
4) Djibouti 0p, 6g (0-0-6), -28gd (2-30)
Fck tournament
1) Team 0 3p, 2g (1-0-1), 0gd (1-1)
2) Team 1 3p, 2g (1-0-1), 0gd (1-1)
3) Team 10 3p, 2g (1-0-1), 0gd (1-1)
4) Team 11 3p, 2g (1-0-1), 0gd (1-1)
5) Team 12 3p, 2g (1-0-1), 0gd (1-1)
6) Team 13 3p, 2g (1-0-1), 0gd (1-1)
7) Team 14 3p, 2g (1-0-1), 0gd (1-1)
Team 15 3p, 2g (1-0-1), 0gd (1-1)
9) Team 16 3p, 2g (1-0-1), 0gd (1-1)
10) Team 17 3p, 2g (1-0-1), 0gd (1-1)
11) Team 18 3p, 2g (1-0-1), 0gd (1-1)
12) Team 19 3p, 2g (1-0-1), 0gd (1-1)
13) Team 2 3p, 2g (1-0-1), 0gd (1-1)
14) Team 20 3p, 2g (1-0-1), 0gd (1-1)
15) Team 21 3p, 2g (1-0-1), 0gd (1-1)
16) Team 22 3p, 2g (1-0-1), 0gd (1-1)
17) Team 23 3p, 2g (1-0-1), 0gd (1-1)
18) Team 24 3p, 2g (1-0-1), 0gd (1-1)
19) Team 25 3p, 2g (1-0-1), 0gd (1-1)
20) Team 26 3p, 2g (1-0-1), 0gd (1-1)
21) Team 27 3p, 2g (1-0-1), 0gd (1-1)
22) Team 28 3p, 2g (1-0-1), 0gd (1-1)
23) Team 29 3p, 2g (1-0-1), 0gd (1-1)
24) Team 3 3p, 2g (1-0-1), 0gd (1-1)
25) Team 4 3p, 2g (1-0-1), 0gd (1-1)
26) Team 5 3p, 2g (1-0-1), 0gd (1-1)
27) Team 6 3p, 2g (1-0-1), 0gd (1-1)
28) Team 7 3p, 2g (1-0-1), 0gd (1-1)
29) Team 8 3p, 2g (1-0-1), 0gd (1-1)
30) Team 9 3p, 2g (1-0-1), 0gd (1-1)
UVA 10194 (13.08.05)的更多相关文章
- UVA 400 (13.08.05)
Unix ls The computer company you work for is introducing a brand new computer line and is developi ...
- UVA 253 (13.08.06)
Cube painting We have a machine for painting cubes. It is supplied withthree different colors: blu ...
- UVA 573 (13.08.06)
The Snail A snail is at the bottom of a 6-foot well and wants to climb to the top.The snail can cl ...
- UVA 10499 (13.08.06)
Problem H The Land of Justice Input: standard input Output: standard output Time Limit: 4 seconds In ...
- UVA 10025 (13.08.06)
The ? 1 ? 2 ? ... ? n = k problem Theproblem Given the following formula, one can set operators '+ ...
- UVA 465 (13.08.02)
Overflow Write a program that reads an expression consisting of twonon-negative integer and an ope ...
- UVA 10494 (13.08.02)
点此连接到UVA10494 思路: 采取一种, 边取余边取整的方法, 让这题变的简单许多~ AC代码: #include<stdio.h> #include<string.h> ...
- UVA 424 (13.08.02)
Integer Inquiry One of the first users of BIT's new supercomputer was Chip Diller. Heextended his ...
- UVA 10106 (13.08.02)
Product The Problem The problem is to multiply two integers X, Y. (0<=X,Y<10250) The Input T ...
随机推荐
- eclipse中运行 main 方法报错，找不到类
eclipse (maven 项目)中运行 main 方法报错,找不到类 ** 发现:在 eclipse中的 "Marker" 控制面板中 ,发现问题所在 只要删除 maven 仓 ...
- linux 下rocketmq安装
一.解压mq(/data下)tar -zxvf Rocketmq-3.5.8.tar.gz 二.修改配置文件vi /etc/profileexport rocketmq=/data/alibaba-r ...
- Java 集合之 Map
Map 就是另一个顶级接口了,总感觉 Map 是 Collection 的子接口呢.Map 主要用于表示那些含有映射关系的数据,存储的是一组一组的键值对.Map 是允许你将某些对象与其它一些对象关联起 ...
- Visual Studio 2017强制更新方法
Visual Studio 2017强制更新方法 Visual Studio 2017更新时候,用户都是根据消息提示,进行更新.这样做的好处,就是微软可以分批下发升级包,避免集中更新.不过为了早点 ...
- luoguP4360 [CEOI2004]锯木厂选址
题目链接 luoguP4360 [CEOI2004]锯木厂选址 题解 dis:后缀和 sum:前缀和 补集转化,减去少走的,得到转移方程 dp[i] = min(tot - sumj * disj - ...
- Windows 安装 Jenkins 2.6
最近都是Windows下干活啊... 一.下载和安装 官网地址:https://jenkins.io/index.html,选择了2.X系列的Windows版本,自动在浏览器下载到了jenkins-2 ...
- Vue-router浅识
一.router-link及router-view :用来做导航,通过传入to属性来指定链接 :用来做路由出口,路由匹配到的组件都会渲染在这里 const router = new VueRouter ...
- C++ tuple类型
前言 最近在看C++ Primer的时候,对于对象移动一直不太懂,所以在查找各种资料,仔细研究代码后,打算写篇博客记录下来,果然还是不要得过且过,看见不懂的就查,弄懂为止最好了. 对象移动 很多时候都 ...
- WinPE作为启动硬盘
之前我一直是用UltraISO将U盘制作为启动盘,这种方式本身简单易用,但也有一些令人不爽的地方 每次都要重新格式化U盘, 本身WinPE并不大,只需要几百兆空间,一旦U盘在使用时,明明都有足够的空间 ...
- cloudstack openstack zstack
http://www.cnblogs.com/skyme/archive/2013/06/06/3118852.html http://www.niubua.com/ http://zstack.or ...