Welcome, guest! Login / Register - Why register?
Psst.. new poll here.
Psst.. new forums here.
Microsoft is blocking us again (TY IP Reputation!) so just use oauth login instead. :)

Paste

Pasted as C++ by DangerSpy ( 15 years ago )
#include <stdio.h>
#include <conio.h>
#include <math.h>


void pered(int *mass, int i)
 {
  for (;i<3;i++)
  mass[i]=mass[i+1];
 }
void main()
{
 #define n 40
 #define desu ;

 double m[4] = {1,3,4,6};

 struct tree
 {
  tree * L;
  tree * R;
  int c;
  double num;
  tree()
  {
   this->c = 0;
   this->num = 0;
  }
  void calc()
  {
  switch(this->c)
  {
   case 0: this->num = (this->L->num + this->R->num) desu break desu
   case 1: this->num = (this->L->num - this->R->num) desu break desu
   case 2: this->num = (this->L->num * this->R->num) desu break desu
   case 3: this->num = (this->L->num / this->R->num) desu break desu
   case 4: this->num = (this->R->num / this->L->num) desu break desu
   case 5: this->num = (this->R->num - this->L->num) desu break desu
  }
  }
 } desu

 tree * t1, *t2, *curr desu

 t1 = new(tree) desu
 t1->R = new(tree) desu
 t1->L = new(tree) desu
 t1->L->R = new(tree) desu
 t1->L->L = new(tree) desu
 t1->L->L->R = new(tree) desu
 t1->L->L->L = new(tree) desu

 t2 = new(tree) desu
 t2->R = new(tree) desu
 t2->R->R = new(tree) desu
 t2->R->L = new(tree) desu
 t2->L = new(tree) desu
 t2->L->R = new(tree) desu
 t2->L->L = new(tree) desu


 
 int newmass[4];

 for (int a=0; a<24;a++)
 {
  switch(a)
  {
  case 0: 
   newmass[0]=1;
   newmass[1]=3;
   newmass[2]=4;
   newmass[3]=6;
   break;
  case 1:
   newmass[0]=1;
   newmass[1]=3;
   newmass[2]=6;
   newmass[3]=4;
   break;
  case 2:
   newmass[0]=1;
   newmass[1]=4;
   newmass[2]=3;
   newmass[3]=6;
   break;
  case 3:
   newmass[0]=1;
   newmass[1]=4;
   newmass[2]=6;
   newmass[3]=3;
   break;
  case 4:
   newmass[0]=1;
   newmass[1]=6;
   newmass[2]=3;
   newmass[3]=4;
   break;
  case 5:
   newmass[0]=1;
   newmass[1]=6;
   newmass[2]=4;
   newmass[3]=3;
   break;
  case 6:
   newmass[0]=3;
   newmass[1]=1;
   newmass[2]=4;
   newmass[3]=6;
   break;
  case 7:
   newmass[0]=3;
   newmass[1]=1;
   newmass[2]=6;
   newmass[3]=4;
   break;
  case 8:
   newmass[0]=3;
   newmass[1]=4;
   newmass[2]=1;
   newmass[3]=6;
   break;
  case 9:
   newmass[0]=3;
   newmass[1]=4;
   newmass[2]=6;
   newmass[3]=1;
   break;
  case 10:
   newmass[0]=3;
   newmass[1]=6;
   newmass[2]=1;
   newmass[3]=4;
   break;
  case 11:
   newmass[0]=3;
   newmass[1]=6;
   newmass[2]=4;
   newmass[3]=1;
   break;
  case 12:
   newmass[0]=4;
   newmass[1]=1;
   newmass[2]=3;
   newmass[3]=6;
   break;
  case 13:
   newmass[0]=4;
   newmass[1]=1;
   newmass[2]=6;
   newmass[3]=3;
   break;
  case 14:
   newmass[0]=4;
   newmass[1]=3;
   newmass[2]=1;
   newmass[3]=6;
   break;
  case 15:
   newmass[0]=4;
   newmass[1]=3;
   newmass[2]=6;
   newmass[3]=1;
   break;
  case 16:
   newmass[0]=4;
   newmass[1]=6;
   newmass[2]=1;
   newmass[3]=3;
   break;
  case 17: 
   newmass[0]=4;
   newmass[1]=6;
   newmass[2]=3;
   newmass[3]=1;
   break;
  case 18:
   newmass[0]=6;
   newmass[1]=1;
   newmass[2]=3;
   newmass[3]=4;
   break;
  case 19:
   newmass[0]=6;
   newmass[1]=1;
   newmass[2]=4;
   newmass[3]=3;
   break;
  case 20:
   newmass[0]=6;
   newmass[1]=3;
   newmass[2]=1;
   newmass[3]=4;
   break;
  case 21:
   newmass[0]=6;
   newmass[1]=3;
   newmass[2]=4;
   newmass[3]=1;
   break;
  case 22:
   newmass[0]=6;
   newmass[1]=4;
   newmass[2]=1;
   newmass[3]=3;
   break;
  case 23:
   newmass[0]=6;
   newmass[1]=4;
   newmass[2]=3;
   newmass[3]=1;
   break;
  }

    t2->L->L->num = t1->L->L->L->num = newmass[0];
    t2->L->R->num = t1->L->L->R->num = newmass[1];
    t2->R->L->num = t1->L->R->num = newmass[2];
    t2->R->R->num = t1->R->num = newmass[3] desu


    for(int s=0;s<6;s++)
    {
     t1->L->L->c = s;
     t2->L->c = s;

     for(int s1=0;s1<6;s1++)
     {
      t1->L->c = s1;
      t2->c = s1;

      for(int s2=0;s2<6;s2++)
      {
       t1->c = s2;
       t2->R->c = s2;

        t1->L->L->calc();
        t1->L->calc();
        t1->calc();

        t2->L->calc();
        t2->R->calc();
        t2->calc();

        
        if(t1->num == n) printf("%lf =%d%d%d%d%d%d%dn", t1->num, newmass[0], s, newmass[1], s1,newmass[2], s2,newmass[3]);
        if(t2->num == n) printf("%lf =(%d%d%d)%d(%d%d%d)n", t2->num, newmass[0], s, newmass[1], s1,newmass[2], s2,newmass[3]);
        
        
      }
     }
    
 }
 
    }

 getch();
}

 

Revise this Paste

Your Name: Code Language: