| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
1350 runtime error,thanks#include <stdio.h>
int max_min(int a)
{
int i,j,n=0;
int arr[4],temp;
while(a)
{
arr[n++]=a%10;
a/=10;
}
for(i=0;i<n-1;i++)
{
for(j=i+1;j<n;j++)
{
if(arr[i]<arr[j])
{
temp=arr[i];
arr[i]=arr[j];
arr[j]=temp;
}
}
}
temp=0;
j=1;
for(i=n-1;i>=0;i--)
{
temp+=arr[i]*j;
j*=10;
}
j=10;
for(i=1;i<n;i++)
{
arr[0]+=arr[i]*j;
j*=10;
}
arr[1]=temp-arr[0];
printf("%d-%d=%d\n",temp,arr[0],arr[1]);
return arr[1];
}
int main()
{
int a[100];
int i=0,n;
while(scanf("%d",&a[i])==1 && a[i]!=-1)
{
i++;
}
for(i=0;a[i]!=-1;i++)
{
printf("N=%d:\n",a[i]);
if(a[i]-(a[i]%10)*1000-((a[i]/10)%10)*100-((a[i]/100)%10)*10-a[i]/1000==0)
{
printf("No!!\n");
}
else
{
n=0;
do{
n++;
a[i]=max_min(a[i]);
}while(a[i]!=6174 && a[i]);
printf("OK!! %d times\n",n);
}
}
return 0;
}
Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator