OJ Board

ret = (unsigned long)atol(new);

The atol function returns long, so casting to unsigned long afterwards won"t help if the result did not fit into long. Changing to long long and using atoll would maybe help, but I'd rather use sscanf.

[color=red][/color][size=18][/size]Hi,
I have solved this problem(Reverse and Add) a month ago, and it got accepted.
Now, I looks in the judge status, and my list of problem(10018) become dissappear, then I send again that problem, and get Wrong Answer?

If anyone have time , please help me. This is my code (c++):

#include <stdio.h>
#include <string.h>
#define MAX 2000
#define FALSE 0
#define TRUE 1

void swap(char *dest, char *source) { //parameter : destination, source
int i,len;

len = strlen(source);

for (i=len-1; i>=0; i--)
dest[len-i-1] = source[i];
dest[len] = '\x0';
}

void sum(char *temp, char *str, char *result) {
int i, len, stor = 0, value;

len = strlen(temp);

for (i=0; i<len; i++) {
value = temp[i]-48 + str[i]-48 + stor;
if (value>9) {
stor = 1;
result[i] = (value % 10) + 48;
}
else {
stor = 0;
result[i] = value + 48;
}
}

if (stor) {
result[i] = '1';
result[i+1] = '\x0';
}
else result[i] = '\x0';

strcpy(temp,result);
swap(str, temp); //destination . source
}

void process(char *str, char *result) {
int cloop=0, //count loop
found = FALSE;
char temp[MAX];

swap (temp, str); //destination, source

do {
if (!strcmp(temp,str)) {
printf ("%d %s\n", cloop, str);
found = TRUE;
}
else {
cloop++;
sum(temp, str, result);
}
}while (found!=TRUE);
}

int main () {
int n,i;
char str[MAX],
result[MAX];

// scanf ("%d\n", &n);
fgets(str,MAX,stdin);
sscanf (str, "%d", &n);

for (i=1; i<=n; i++) {
fgets(str,MAX,stdin);
if (str[strlen(str)-1] == '\n')
str[strlen(str)-1] = '\x0';

process(str, result);
}
return 0;
}
[/code][cpp][/img][/cpp][/code][/url][/quote]

Try this testcase:
Input:
2
2
99
Output:
1 4
6 79497

But in first case 2 is a palindrome without any computing .... ?
So output shouldn't be "0 2" ??

Dominik

That was what I thought first, too. But read the description careful. It says after adding the reversed number you look the first time if the result is a palindrome.

The judge is error when rejudged problem 10018 and now the judged has fixed it and received my problem.

Thanks.

try this:
input:
2
output:
1 4

Regards
Dominik

PS. This is small misunderstanding of problem description ... I made same error before rejudgement ...
AND PLEASE READ OTHER POSTS BEFORE YOU CREATE NEW ONE!!!!
This should keep this place in order ...

this new code gives me answers for pals and yet i get WA.

I suggest you use long or long lon instead of int.

On OJ system it's the same: long and int ..... Both variable are 32bit ....
But I agree with you - int should be smaller than long int and there was earlier .... int had 16 bits, long int 32 .... So we should use long int instead of int ...

Regards
Dominik

At the time of regug its giving WA ....Whats wrong with my program..do u know?


#include<stdio.h>
#include<stdlib.h>
#include<string.h>
void main()
{
char in[12],in1[12];
long i,k,n,num1,num2,c;
while(scanf("%ld",&n)!=EOF)
{
for(k=0;k<n;k++)
{
scanf("%s",in);
strcpy(in1,in);
int len=strlen(in),j=0;
for (i=len-1;i>=0;i--)
{
in1[j]=in; j++;
}
c=0;
{
do{ c++;
num1=atol(in);
num2=atol(in1);
num1+=num2;

sprintf(in,"%ld",num1);
sprintf(in1,"%ld",num1);
strcpy(in1,in);
len=strlen(in);j=0;
for (i=len-1;i>=0;i--)
{
in1[j]=in; j++;
}

}while(strcmp(in,in1)!=0);

printf("%ld %ld\n",c,num1);
}
}
}
}


THanks...
http://www.softhome1.netfirms.com[/c]

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
void main()
{
char in[12],in1[12];
long i,k,n,num1,num2,c;
while(scanf("%ld",&n)!=EOF)
{
for(k=0;k<n;k++)
{
scanf("%s",in);
strcpy(in1,in);
int len=strlen(in),j=0;
for (i=len-1;i>=0;i--)
{
in1[j]=in; j++;
}
c=0;
{
do{ c++;
num1=atol(in);
num2=atol(in1);
num1+=num2;

sprintf(in,"%ld",num1);
sprintf(in1,"%ld",num1);
strcpy(in1,in);
len=strlen(in);j=0;
for (i=len-1;i>=0;i--)
{
in1[j]=in; j++;
}

}while(strcmp(in,in1)!=0);

printf("%ld %ld\n",c,num1);
}
}
}
}

Adrian Kuegel wrote:Try this testcase:
Input:
2
2
99
Output:
1 4
6 79497

.....Checking problems once accepted is a boring task.
...But what about me? My code yields the same output you presented.

Here is my one:
[c]
#include<stdio.h>
unsigned reverse(unsigned n);
unsigned reverse(unsigned n){
unsigned len,temp,j,k,rev;
len=0;temp=n;rev=0;
while(temp){len++;temp/=10;}
for(j=len;j>=1;j--){
k=1;
for(temp=1;temp<j;temp++)k*=10;
rev+=k*(n%10);
n/=10;
}
return(rev);

}

void main(){
unsigned N,i,j,rev;
scanf("%d",&N);
for(i=0;i<N;i++){
scanf("%d",&rev);
j=0;
do{
j++;
rev+=reverse(rev);

}while(rev!=reverse(rev));
printf("%d %d\n",j,rev);
}
}
[/c]

______________________________________________Md.Tanvir Al Amin

Once again, use long long...
should yield