ACM几道练习题及其答案

…………………………………………………………………………………………………….. 标题：HDU- 1001-Sum Problem

代码：#include

#include

#include

#include

using namespace std;

int main()

{

//freopen("text.txt","r",stdin);

int sum,i;

while(scanf("%d",&i)!=EOF)

{

if((i+1)%2==0)

sum=(i+1)/2*i;

else

sum=i/2*(i+1);

printf("%d\n\n",sum);

}

//fclose(stdin);

return 0;

}

…………………………………………………………………………………………………….. …………………………………………………………………………………………………….. 标题：HDU-2027-

代码：#include

#include

#include

#include

using namespace std;

int main()

{

//freopen("text.txt","r",stdin);

char c[101];

int n,j,k,a,e,i,o,u;

scanf("%d\n",&n);//注意这里

for(j=1;j<=n;j++)

{

a=e=i=o=u=0;

gets(c);

for(k=0;c[k]!='\0';k++)

{

if(c[k]=='a')a++;

if(c[k]=='e')e++;

if(c[k]=='i')i++;

if(c[k]=='o')o++;

if(c[k]=='u')u++;

}

printf("a:%d\ne:%d\ni:%d\no:%d\nu:%d\n",a,e,i,o,u);

if(j

printf("\n");

}

//fclose(stdin);

return 0;

}

…………………………………………………………………………………………………….. …………………………………………………………………………………………………….. 标题：HDU-2025- 查找最大元素

代码：#include

#include

#include

#include

using namespace std;

int main()

{

//freopen("text.txt","r",stdin);

char a[105],max='A';

int i,n;

while(scanf("%s",a)!=EOF)

{

n=strlen(a);

max='A';

for(i=0;i

{

if(a[i]>max) max=a[i];

}

for(i=0;i

{

printf("%c",a[i]);

if(a[i]==max)

printf("(max)");

}

printf("\n");

}

//fclose(stdin);

return 0;

}

…………………………………………………………………………………………………….. …………………………………………………………………………………………………….. 标题：HDU-1037-Keep on Truckin'

代码：#include

#include

#include

#include

using namespace std;

int main()

{

//freopen("text.txt","r",stdin);

int a,b,c,min;

while(cin >> a >> b >> c)

{

min = a>b?b:a;

min = min>c?c:min;

if(min<=168)

printf("CRASH %d\n",min);

else

printf("NO CRASH\n");

}

//fclose(stdin);

return 0;

}

…………………………………………………………………………………………………….. …………………………………………………………………………………………………….. 标题：HDU-2052-Picture

代码：#include

#include

#include

#include

using namespace std;

int main()

{

//freopen("text.txt","r",stdin);

int n,m,i;

while(scanf("%d%d",&n,&m)!=EOF)

{

printf("+");

for(i=0;i

{

printf("-");

}

printf("+\n");

for(i=0;i

{

printf("|");

for(int j=0;j

{

printf(" ");

}

printf("|\n");

}

printf("+");

for(i=0;i

{

printf("-");

}

printf("+\n\n");

}

//fclose(stdin);

return 0;

}

…………………………………………………………………………………………………….. …………………………………………………………………………………………………….. 标题：HDU-1034-Candy Sharing Game

代码：#include

#include

#include

#include

using namespace std;

const int MAXN=1000;

int a[MAXN];

int main()

{

//freopen("text.txt","r",stdin);

int n;

int i;

while(scanf("%d",&n),n)

{

for(i=0;i

int res=0;

while(1)

{

for(i=1;i

if(a[i-1]!=a[i]) break;

if(i>=n) break;

res++;

int temp=a[n-1]/2;

for(i=n-1;i>0;i--)

{

a[i]/=2;

a[i]+=a[i-1]/2;

}

a[0]/=2;

a[0]+=temp;

for(i=0;i

if(a[i]&1) a[i]++;

}

printf("%d %d\n",res,a[0]);

}

//fclose(stdin);

return 0;

}……………………………………………………………………………………………………..