OJ Board

[c]
Firstly sum up all the digit of the number then sum up the factorizing
number.if sum of each digit is equal to the sum of factorizing number
then the number is called smith number.

sample input:
-------------

20
4937774
4997775
5445454
4648787
4897987
5789798
9554564
8545644
7564545
8798798 ...

thank everybody to give infomation.at last i ac the problem

my code is below.every thing is ok.but judge reply wa.i m frustated.help me about this problem



/* @JUDGE_ID: xxxxxx 10106 C++ */

#include<string.h>
#include<stdio.h>
#include<stdlib.h>
#define MAX 10000
static char x[MAX],s[MAX],z[MAX];

void mul ()
{
int p,q,r,l,m,tag,u,tag1,i,t,j,k,tag2=0;
for ...

help me how to get input two digit at a time in the below of code.
because input is 10^101.i think this is not possible to handle in array.


while((c=getchar())!=' '&&c!='\n'&&c!='\t') n=c-48;

I think this program is correct but judge reply wrong ans.plz help me?


/* @JUDGE_ID: xxxxxx 10025 C++ */

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<conio.h>
main()
{
long double i,k,m;
while(scanf("%Lf",&i)==1)
{
if(i<0)
i=-i;
m=ceil(sqrt(i*2));
k=fmod((m*(m+1)/2-i),2);
if(k ...

/* @JUDGE_ID: xxxxxx 10424 C++ */
I think this program is correct but judge reply wrong ans.anyone help me?

#include<stdio.h>
#include<string.h>
#include<math.h>
main()
{
char get1[26],c;
char get2[26];
while(scanf("%s%s",get1,get2)!=EOF)
{
int x[26],l=0,l1=0;
for(int i=0;i<26;i++)
x =0;

for(i=0 ...

#include<stdio.h>

void main()
{
long int m,n; char c;
int l,p,a2[4]={6,2,4,8},a3[4]={1,3,9,7},a4[2]={6,4},a7[4]={1,7,9,3},a8[4]={6,8,4,2},a9[2]={1,9};
int mod2,mod4;
while(2)
{
while((c=getchar())!=' '&&c!='\n'&&c!='\t') m=c-48;

while((c=getchar())!=' '&&c!='\n'&&c!='\t') n=c-48;

if(m==0 ...