2568: Think I will Buy Me a Football Team
| Result | TIME Limit | MEMORY Limit | Run Times | AC Times | JUDGE |
|---|---|---|---|---|---|
| 10s | 65536K | 120 | 53 | Standard |
Problem 2562 to 2571 are of a same set. The set of problem is a PDF file. You can download it here.
Problem Pdf File, Click here to download.
The PDF file contains the whole 10 problems. You can download it in any problem. You do NOT need to download every pdf(they are all the same).
Problem Source: 2008 ACM-ICPC 11th ANARC
#include<stdio.h>
#include<memory.h>
int main()
{
int x[1001],n,i,j,temp,sum1,sum2,t=0;
while(scanf("%d",&n),n)
{
t++;
memset(x,0,sizeof(x));
sum1=0;
for(i=0;i<n;i++)
for(j=0;j<n;j++)
{
scanf("%d",&temp);
x[i]-=temp;
x[j]+=temp;
sum1+=temp;
}
sum2=0;
for(i=0;i<n;i++)
if(x[i]>0)
sum2+=x[i];
else
sum2-=x[i];
sum2=sum2/2;
printf("%d. %d %d/n",t,sum1,sum2);
}
return 0;
}
本文解析了一道ACM-ICPC竞赛中的编程题目,通过使用C语言实现了一个算法来解决足球队伍购买的问题。该算法涉及到了二维数组的输入、处理及计算,最终输出了所需的计算结果。
3990

被折叠的 条评论
为什么被折叠?



