conducta

#include <fstream>
#include <cstring>
#define NMax 300
using namespace std;
typedef int Huge[NMax+3];
ifstream f("conducta.in");
ofstream g("conducta.out");

void Citire(Huge H)
{
    char s[151];
    f.getline(s,151);
    int L=(int)strlen(s);
    H[0]=0;
    while(L)
        H[++H[0]]=s[--L]-'0';
}

void Afisare(Huge A)
{
    for(unsigned int i=A[0];i>=1;--i)
        g<<A[i];
    g<<'\n';
}

void AtribValue(Huge H,unsigned long X)
{
    H[0]=0;
    while (X)
        ++H[0],H[H[0]]=X%10,X/=10;
}

void CopyValue(Huge A,Huge B) /// A <- B
{
    for(int i=0;i<=B[0];++i)
        A[i]=B[i];
}

void Add(Huge A, Huge B)
/* A <- A+B */
{ int i,T=0;

  if (B[0]>A[0])
    { for (i=A[0]+1;i<=B[0];) A[i++]=0;
      A[0]=B[0];
    }
    else for (i=B[0]+1;i<=A[0];) B[i++]=0;
  for (i=1;i<=A[0];i++)
    { A[i]+=B[i]+T;
      T=A[i]/10;
      A[i]%=10;
    }
  if (T) A[++A[0]]=T;
}

void Subtract(Huge A, Huge B)
/* A <- A-B */
{ int i, T=0;

  for (i=B[0]+1;i<=A[0];) B[i++]=0;
  for (i=1;i<=A[0];i++)
    A[i]+= (T=(A[i]-=B[i]+T)<0) ? 10 : 0;
    /* Adica A[i]=A[i]-(B[i]+T);
       if (A[i]<0) T=1; else T=0;
       if (T) A[i]+=10; */
  while (!A[A[0]]) A[0]--;
}

void MultHuge(Huge A, Huge B, Huge C)
/* C <- A x B */
{ int i,j,T=0;

  C[0]=A[0]+B[0]-1;
  for (i=1;i<=A[0]+B[0];) C[i++]=0;
  for (i=1;i<=A[0];i++)
    for (j=1;j<=B[0];j++)
      C[i+j-1]+=A[i]*B[j];
  for (i=1;i<=C[0];i++)
    { T=(C[i]+=T)/10;
      C[i]%=10;
    }
  if (T) C[++C[0]]=T;
}

unsigned long Divide(Huge A, unsigned long X)
/* A <- A/X si intoarce A%X */
{ int i;
  unsigned long R=0;

  for (i=A[0];i;i--)
    { A[i]=(R=10*R+A[i])/X;
      R%=X;
    }
  while (!A[A[0]] && A[0]>1) A[0]--;
  return R;
}

int Sgn(Huge H1, Huge H2) {
  // Elimina zero-urile semnificative, daca exista.
  while (H1[0] && !H1[H1[0]]) H1[0]--;
  while (H2[0] && !H2[H2[0]]) H2[0]--;

  if (H1[0] < H2[0]) {
    return -1;
  } else if (H1[0] > H2[0]) {
    return +1;
  }

  for (int i = H1[0]; i > 0; --i) {
    if (H1[i] < H2[i]) {
      return -1;
    } else if (H1[i] > H2[i]) {
      return +1;
    }
  }
  return 0;
}

Huge UNU,RAD,X;
void Radical(Huge ST,Huge DR)
{
    Huge JUM;
    CopyValue(JUM,ST);
    Add(JUM,DR);
    Divide(JUM,2);
    Huge RADP;
    MultHuge(JUM,JUM,RADP);
    int semn=Sgn(RADP,X);
    if(semn==0)
    {
        CopyValue(RAD,JUM);
        return;
    }
    if(semn==-1)
        Add(JUM,UNU),Radical(JUM,DR);
    else
        Subtract(JUM,UNU),Radical(ST,JUM);
}

int main(void)
{
    Huge A,B,C;
    Citire(A),Citire(B),Citire(C);
    Add(A,B); /// A <- A+B
    MultHuge(A,A,B); /// B <- A*A
    MultHuge(C,C,X); /// X <- C*C
    Add(X,B); /// X <- X+B
    AtribValue(UNU,1);
    Radical(UNU,X);
    Afisare(RAD);
    return 0;
}