i got wrong answer in this problem. But did not find the problem in the code. please help me...........
Here is my code:
#include<stdio.h>
#include<string.h>
#include<ctype.h>
#include<math.h>
#define MAX 13
void main()
{
char arr1[5],arr2[5],ch;
long num1[MAX],num2[MAX],n,a,b,c,d,i,j,k,l,p,q;
/*freopen("g:\in1.txt","rt",stdin);*/
scanf("%ld",&n);
for(k=0;k<n;k++)
{
scanf("%s %c %s",arr1,&ch,arr2);
a=strlen(arr1);
b=strlen(arr2);
for(i=0;i<a;i++)
arr1=toupper(arr1);
for(i=0;i<b;i++)
arr2=toupper(arr2);
p=0;
c=a-1;
for(j=0;j<a;j++)
{
if(arr1[j]<=57)
p+=(long(arr1[j])-48)*(long(pow(16,c)));
else
p+=(long(arr1[j])-55)*(long(pow(16,c)));
c--;
}
q=0;
c=b-1;
for(j=0;j<b;j++)
{
if(arr2[j]<=57)
q+=(long(arr2[j])-48)*(long(pow(16,c)));
else
q+=(long(arr2[j])-55)*(long(pow(16,c)));
c--;
}
for(i=0;i<=MAX;i++)
{
num1=0;
num2=0;
}
c=MAX;
d=p;
while(d!=0)
{
num1[c]=d%2;
d=long(d/2);
c--;
}
c=MAX;
d=q;
while(d!=0)
{
num2[c]=d%2;
d=long(d/2);
c--;
}
for(i=1;i<=MAX;i++)
printf("%ld",num1);
printf(" %c ",ch);
for(i=1;i<=MAX;i++)
printf("%ld",num2);
printf(" = ");
if(ch=='+')
printf("%ld",p+q);
else
printf("%ld",p-q);
printf("\n");
}
}
[/code][/c]
why WA............?plz help.
General topic about Valladolid Online Judge
Moderator: Board moderators
Jump to
- Real Time Contests and Last Minute Information
- ↳ General
- ↳ Real Time Clarification
- ↳ Fixing Mistakes
- ↳ HOWTOs
- ↳ Bugs and suggestions
- New system
- ↳ FAQ
- ↳ Bugs and suggestions
- Let's make some programs!
- ↳ Other words
- ↳ Algorithms
- ↳ New features
- Help on the Problemset
- ↳ Volume 1 (100-199)
- ↳ Volume 2 (200-299)
- ↳ Volume 3 (300-399)
- ↳ Volume 4 (400-499)
- ↳ Volume 5 (500-599)
- ↳ Volume 6 (600-699)
- ↳ Volume 7 (700-799)
- ↳ Volume 8 (800-899)
- ↳ Volume 9 (900-999)
- ↳ Volume 10 (1000-1099)
- ↳ Volume 11 (1100-1199)
- ↳ Volume 12 (1200-1299)
- ↳ Volume 13 (1300-1399)
- ↳ Volume 14 (1400-1499)
- ↳ Volume 15 (1500-1599)
- ↳ Volume 16 (1600-1699)
- ↳ Volume 17 (1700-1799)
- ↳ Volume 100 (10000-10099)
- ↳ Volume 101 (10100-10199)
- ↳ Volume 102 (10200-10299)
- ↳ Volume 103 (10300-10399)
- ↳ Volume 104 (10400-10499)
- ↳ Volume 105 (10500-10599)
- ↳ Volume 106 (10600-10699)
- ↳ Volume 107 (10700-10799)
- ↳ Volume 108 (10800-10899)
- ↳ Volume 109 (10900-10999)
- ↳ Volume 110 (11000-11099)
- ↳ Volume 111 (11100-11199)
- ↳ Volume 112 (11200-11299)
- ↳ Volume 113 (11300-11399)
- ↳ Volume 114 (11400-11499)
- ↳ Volume 115 (11500-11599)
- ↳ Volume 116 (11600-11699)
- ↳ Volume 117 (11700-11799)
- ↳ Volume 118 (11800-11899)
- ↳ Volume 119 (11900-11999)
- ↳ Volume 120 (12000-12099)
- ↳ Volume 121 (12100-12199)
- ↳ Volume 122 (12200-12299)
- ↳ Volume 123 (12300-12399)
- ↳ Volume 124 (12400-12499)
- ↳ Volume 125 (12500-12599)
- ↳ Volume 126 (12600-12699)
- ↳ Volume 127 (12700-12799)
- ↳ Volume 128 (12800-12899)
- ↳ Volume 129 (12900-12999)
- ↳ Volume 130 (13000-13099)
- ↳ Volume 131 (13100-13199)
- Help on languages
- ↳ C
- ↳ C++
- ↳ Pascal
- ↳ Java
- Off Topic
- ↳ Off topic (General chit-chat)
- Category
- ↳ ACM ICPC Archive Board