Book of tasks on programming. Old version

 

 by Aliaksandr N. Prykhodzka

 

on-line, ряд, education, system, set, xsl, publishing house, string, label, college, var, FAT32, author, форматирование, destructor, bit, select, обзоры, подсказка
 

for valuable work you must have JavaScript (allow active content)

Java. J.17. Nest of tasks. Functions

 

 

Calculator

/ - division

\ - rest

S - sum of numbers from and to

P - multiply numbers from and to

J.17.1     Answer      Pascal-analogue      Visual Basic-analogue

Determine a value produced by function AA


int Pr1(int n)
{
    return n*(n-1);
}

int Pr2(int k, int n)
{
    return k*k-n*n;
}

int AA()
{
    int s=0;
    for (int i=1; i<3; i++) s+=Pr1(Pr2(i+1,i));
    return s;
}


 

 

Calculator

/ - division

\ - rest

S - sum of numbers from and to

P - multiply numbers from and to

J.17.2     Answer      Pascal-analogue      Visual Basic-analogue

Determine a value produced by function AA


int Pr1(int n)
{
    return n+1;
}

int AA()
{
    int s=1;
    for (int i=1; i<5; i++) s=Pr1(s);
    return s;
}


 

 

Calculator

/ - division

\ - rest

S - sum of numbers from and to

P - multiply numbers from and to

J.17.3     Answer      Pascal-analogue      Visual Basic-analogue

Determine a value produced by function AA


int Pr(int n)
{
    int s=0;
    for (int i=1; i<n+1; i++) s+=i;
    return s;
}

int AA()
{
    int m=1;
    for (int j=1; j<4; j++) m=m*Pr(j);
    return m;
}


 

 

Calculator

/ - division

\ - rest

S - sum of numbers from and to

P - multiply numbers from and to

J.17.4     Answer      Pascal-analogue      Visual Basic-analogue

Determine a value produced by function AA


boolean Pr1(int n, int k)
{
    return ! (n*k>k / 2);
}

int AA()
{
    int s=0;
    if (Pr1(3,4)) s=15;
    else
        for (int j=1; j<4; j++) s=s+j;
    return s;
}


 

 

Calculator

/ - division

\ - rest

S - sum of numbers from and to

P - multiply numbers from and to

J.17.5     Answer      Pascal-analogue      Visual Basic-analogue

Determine a value produced by function AA


int Pr1(int n)
{
    return n / 2;
}

int Pr2(int n)
{
    return n*n;
}

int Pr3(int n)
{
    return n % 2;
}

int AA()
{
    int s=0;
    for (int i=Pr1(3); i<Pr2(3)+1; i++) s+=Pr3(i);
    return s;
}


 

 

Calculator

/ - division

\ - rest

S - sum of numbers from and to

P - multiply numbers from and to

J.17.6     Answer      Pascal-analogue      Visual Basic-analogue

Determine a value produced by function AA


int Pr1(int n)
{
    return n / 2;
}

int Pr2(int n)
{
    return n*n;
}

int Pr3(int n)
{
    return n % 2;
}

int AA()
{
    int s=0;
    for (int i=1; i<3; i++)
        for (int j=Pr1(i); j<Pr2(i)+1; j++) s+=Pr3(j);
    return s;
}


 

 

Calculator

/ - division

\ - rest

S - sum of numbers from and to

P - multiply numbers from and to

J.17.7     Answer      Pascal-analogue      Visual Basic-analogue

Determine a value produced by function AA


int A1(int N)
{
      return N*N;
}

int A2(int N)
{
      return A1(N)+2;
}

int A3(int N)
{
      return A1(N)*3;
}

int AA()
{
      int XX=0;
      for (int k=1; k<3; k++)
            for (int m=A2(k); m<A3(k)+1; m++) XX=XX+1;
      return XX;
}


 

 

Calculator

/ - division

\ - rest

S - sum of numbers from and to

P - multiply numbers from and to

J.17.8     Answer      Pascal-analogue      Visual Basic-analogue

Determine a value produced by function AA


int Pr1 (int n)
{
      return n*(n-1);
}

int Pr2 (int k, n)
{
      return k*k-n*n;
}

int AA()
{
      int s=0;
      for (int i=1; i<3; i++)
            s+=Pr1(Pr2(i+1,i-1));
      return s;
}


 

 

Calculator

/ - division

\ - rest

S - sum of numbers from and to

P - multiply numbers from and to

J.17.9     Answer      Pascal-analogue      Visual Basic-analogue

Determine a value produced by function AA


int Pr1 (int n)
{
      return n*3+1;
}

int AA()
{
      int s=1;
      for (int i=1; i<5; i++)
            s=Pr1(s);
      return s;
}


 

 

Calculator

/ - division

\ - rest

S - sum of numbers from and to

P - multiply numbers from and to

J.17.10     Answer      Pascal-analogue      Visual Basic-analogue

Determine a value produced by function AA


boolean Pr1 (int n, int k)
{
      return ( (n+k+2) > ((k*5) / 3) );
}

int AA()
{
      int s=0;
      if (Pr1(3,4)) s=s+2;
      if (Pr1(3,2)) s=s+3;
      if (Pr1(4,6)) s=s+7;
      if (Pr1(5,1)) s=s+11;
      if (Pr1(0,2)) s=s+20;
      return s;
}


 

 

Calculator

/ - division

\ - rest

S - sum of numbers from and to

P - multiply numbers from and to

J.17.11     Answer      Pascal-analogue      Visual Basic-analogue

Determine a value produced by function AA


int Pr1 (int n)
{
      return n / 2;
}

int Pr2 (int n)
{
      return n*n;
}

int Pr3 (int n)
{
      return n % 2;
}

int AA()
{
      int s=0;
      for (int i=Pr1(3); i<4; i++)
            s+=Pr1(Pr2(Pr3(i)));
      return s;
}


 

 

Calculator

/ - division

\ - rest

S - sum of numbers from and to

P - multiply numbers from and to

J.17.12     Answer      Pascal-analogue      Visual Basic-analogue

Determine a value produced by function AA


int Pr1 (int n)
{
      return n+2;
}

int Pr2 (int n)
{
      return n*n+5;
}

int Pr3 (int n)
{
      return n*2;
}

int AA()
{
      int s=0;
      for (int i=1; i<3; i++)
            for (int j=Pr1(i); j<Pr2(i)+1; j++) s+=Pr3(j);
      return s;
}



 

©   Aliaksandr Prykhodzka    1993 - 2007