Coding

Skill · 03-27-2014

General code sharing thread.

So for my Calculus class I had to do some summations that were way too long to do manually, so instead of spending 30 minutes doing redundant things I just made a simple program to figure them out(I get the concept already).

For example, this is how I solved a ridiculously long summation.

PHP Code:


			
function myFunction()

{

var solution=0;

for(var k=8;k<=40; k++)

{

solution+= -(3*k);

}

document.write(solution);

it outputted -2376, which was correct.

Saved me so much time lol. Even figured out one of the assigned problems my teacher couldn't figure out how to simplify without doing the whole thing manually, using code:

PHP Code:


			
function myFunction()

{

var solution=0;

for(var k=4;k<=24; k++)

{

solution+= (k*k*k);

}

document.write(solution);

output :89964

Ignatius · 03-27-2014

http://img.pandawhale.com/45822-Keanu-Bill-and-Ted-whoa-gif-Yr7D.gif (Unsupported image host)

5hift · 03-27-2014

Yeah when in doubt,

Consult your local graalians.

hosler · 03-27-2014

Posted by 5hift

Yeah when in doubt,

Consult your local graalians.

Things that should never happen

Tricxta · 03-27-2014

Posted by Skill

General code sharing thread.

So for my Calculus class I had to do some summations that were way too long to do manually, so instead of spending 30 minutes doing redundant things I just made a simple program to figure them out(I get the concept already).

For example, this is how I solved a ridiculously long summation.

PHP Code:


			
function myFunction()
{
var solution=0;
for(var k=8;k<=40; k++)
{
solution+= -(3*k);
}
document.write(solution);

it outputted -2376, which was correct.

Saved me so much time lol. Even figured out one of the assigned problems my teacher couldn't figure out how to simplify without doing the whole thing manually, using code:

PHP Code:


			
function myFunction()
{
var solution=0;
for(var k=4;k<=24; k++)
{
solution+= (k*k*k);
}
document.write(solution);

output :89964

So... I wanted to solve the factorial of the number n, but I didn't want to do it manually each time so I wrote a recursive function to do it for me!

PHP Code:


			
function fact(n)
{
  if (n <= 1)return n;
  else return n * fact(n-1);
}

How bout dat.

Dusty · 03-27-2014

I understand code perfectly well, and have no problem reading these functions. But reading this stuff in math form confuses the hell out of me.

The Doctor · 03-27-2014

Funny you should post this thread, because I'm about to go into a programming competition on Saturday

.

So basically, we have a lot of practice problems for the competition. One of the problems in the packet is to find the smallest perimeter and area of points contained on a plane. It was rather easy.

Java:

PHP Code:


			
import java.util.Scanner;


public class C {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int caseNum = s.nextInt();
        
        for(int i = 0; i < caseNum; i++) {
            //Ant farm 1
            int ants = s.nextInt();
            
            double xO = s.nextDouble();
            double yO = s.nextDouble();
            double lowx = xO;
            double lowy = yO;
            double highx = xO;
            double highy = yO;
            
            for(int ii = 0; ii < ants - 1; ii++) {
                double x = s.nextDouble();
                double y = s.nextDouble();
                
                if(x < lowx) 
                    lowx = x;
                else if(x > highx)
                    highx = x;
                if(y < lowy) 
                    lowy = y;
                else if(y > highy)
                    highy = y;
            }
            
            double length = highx - lowx;
            double width = highy - lowy;
            double perim = (2 * length) + (2 * width);
            double area = length * width;
            int c = i + 1;
            System.out.println("Case " + c + ": Area " + area + ", Perimeter " + perim);
        }
    }
}

hosler · 03-29-2014

Posted by The Doctor

Funny you should post this thread, because I'm about to go into a programming competition on Saturday

.

So basically, we have a lot of practice problems for the competition. One of the problems in the packet is to find the smallest perimeter and area of points contained on a plane. It was rather easy.

Java:

PHP Code:


			
import java.util.Scanner;


public class C {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int caseNum = s.nextInt();

for(int i = 0; i < caseNum; i++) {
//Ant farm 1
int ants = s.nextInt();

double xO = s.nextDouble();
double yO = s.nextDouble();
double lowx = xO;
double lowy = yO;
double highx = xO;
double highy = yO;

for(int ii = 0; ii < ants - 1; ii++) {
double x = s.nextDouble();
double y = s.nextDouble();

if(x < lowx) 
lowx = x;
else if(x > highx)
highx = x;
if(y < lowy) 
lowy = y;
else if(y > highy)
highy = y;
}

double length = highx - lowx;
double width = highy - lowy;
double perim = (2 * length) + (2 * width);
double area = length * width;
int c = i + 1;
System.out.println("Case " + c + ": Area " + area + ", Perimeter " + perim);
}
}
}

You doing the IEEE or ACM competition?

The Doctor · 03-29-2014

Posted by hosler

You doing the IEEE or ACM competition?

ACM

twilit · 03-29-2014

Ive taken Calculus 1-3.
Ive taken Java.
But Ive never had to code calculus equations in Java o.o

Posted by Skill

PHP Code:


			
{

solution+= (k*k*k);

}

couldnt have used a different letter of the alphabet?

hosler · 03-29-2014

Posted by The Doctor

ACM

I did a few of those in college. They are fun.

Johnaudi · 03-29-2014

I've had some C# projects that are currently on sale. (https://www.dropbox.com/s/x3qp141dzb...ania_Setup.msi)

Here's a pre-done Gs2 Graph:

PHP Code:


			
// Made by Johnaudi

//#CLIENTSIDE



function onPlayerEnters() {

  maxlooplimit = 10000000;

  

  onPlayerChats();

}



function onPlayerChats() {

  temp.rvars1 = {};

  

  for (temp.i = 0; temp.i <= 4 * pi; temp.i += 0.1) {

    temp.rvars1.add(cos(temp.i));

    

  }

  

  //onDrawGraph(this.attr[3].tokenize("#"), false, false, false, 0, "");

  onDrawGraph(temp.rvars1, true, false, false, 0.1, {});

  //onDrawGraph({2, -4, 8, 4}, true, true, true, 0, {{1, 3, 7, -2}});

  //onDrawGraph({1, 2, 1, 5, 2, 3, 7, 2, 1, 6, 2, 3.5}, true, true, true, 0.2, {{3, 1, 1, 6, 3, 2, 4, 4, 1, 2, 1, 4}, {4.4, 2, 8, 3, 4, 5, 1, 4, 3, 3, 5, 1.5}});

}



function onDrawGraph(_arr, _fill, s_lines, s_nums, _loop, m_arrs) {

  cancelevents("onDrawGraph");

  

  hideimgs(240, 17000);

  temp.polyxy = {this.x, this.y};

  temp.polywh = {18, 13};

  

  temp.vars = _arr;

  

  if (_loop > 0) {

  

    temp.i = 0;

  

    temp.vars = "";

  

    for (temp.s : _arr) {

  

      if (temp.i == _arr.size() - 1) {

        temp.vars.add(temp.s);

        temp.vars.add(_arr[0]);

        break;

      }

    

      if (temp.i != 0) temp.vars.add(temp.s);

    

      temp.i++;

    }

  

    _arr = temp.vars;

    

    temp.m_vrs = "";

    

    for (temp._sr : m_arrs) {

      

      temp.m_vr = "";

      

      temp.ri = 0;

      

      for (temp.sr_s : temp._sr) {

      

        if (temp.ri == temp._sr.size() - 1) {

          temp.m_vr.add(temp.sr_s);

          temp.m_vr.add(temp._sr[0]);

          break;

        }

    

        if (temp.ri != 0) temp.m_vr.add(temp.sr_s);

    

        temp.ri++;

        

      }

      

      temp.m_vrs.add(temp.m_vr);

      

    }

    

    m_arrs = temp.m_vrs;

    

    scheduleevent(_loop, "onDrawGraph", _arr, _fill, s_lines, s_nums, _loop, m_arrs);

    

  }

  

  temp.h_var = 0;

  temp.l_var = 0;

  

  temp.all_vrs = _arr;

  

  for (temp._sr : m_arrs) {

  

    for (temp.sr_s : temp._sr) {



      temp.all_vrs.add(temp.sr_s);

    }

  }

  

  for (temp.h_vi : temp.all_vrs) {

    temp.h_var = max(temp.h_var, abs(temp.h_vi));

    temp.l_var = min(temp.l_var, temp.h_vi);

  }

  

  with(findimg(250)) { // x

    polygon = {temp.polyxy[0], temp.polyxy[1],

               temp.polyxy[0], temp.polyxy[1] + 0.2,

               temp.polyxy[0] + temp.polywh[0], temp.polyxy[1] + 0.2,

               temp.polyxy[0] + temp.polywh[0], temp.polyxy[1]};

  }

  

  temp.polyxy = {this.x, this.y - temp.polywh[1]};

  

  with(findimg(251)) { // y

    polygon = {temp.polyxy[0], temp.polyxy[1],

               temp.polyxy[0] + 0.2, temp.polyxy[1],

               temp.polyxy[0] + 0.2, temp.polyxy[1] + temp.polywh[1] * (temp.l_var < 0 ? 2 : 1),

               temp.polyxy[0], temp.polyxy[1] + temp.polywh[1] * (temp.l_var < 0 ? 2 : 1)};

  }

  

  temp.mxy = {temp.polyxy[0] - 0.4, temp.polyxy[1] + temp.polywh[1] - 0.4};

  

  temp.nx = temp.polywh[0] / (temp.vars.size() - 1);

  temp.ny = temp.polywh[1] / temp.h_var;

  

  temp._usedlines = {};

  

  for (temp.i = 1; temp.i <= temp.vars.size(); temp.i++) {

  

    if (temp.i != temp.vars.size())

    with(findimg(300 + temp.i)) {

      polygon = {(_fill ? 0.4 : 0) + temp.mxy[0] + (temp.i - 1) * temp.nx, (_fill ? 0.4 : 0) + temp.mxy[1] - temp.vars[temp.i - 1] * temp.ny,

                  (_fill ? 0.4 : 0) + temp.mxy[0] + (temp.i) * temp.nx, (_fill ? 0.4 : 0) + temp.mxy[1] - temp.vars[temp.i] * temp.ny};

      if (_fill) {

        polygon.add((_fill ? 0.4 : 0) + temp.mxy[0] + (temp.i) * temp.nx);

        polygon.add((_fill ? 0.4 : 0) + temp.mxy[1]);

        

        polygon.add((_fill ? 0.4 : 0) + temp.mxy[0] + (temp.i - 1) * temp.nx);

        polygon.add((_fill ? 0.4 : 0) + temp.mxy[1]);

      }

      

      alpha = _fill ? 0.4 : 1;

    }

    

    if (!(temp.vars[temp.i - 1] in temp._usedlines) && (temp.vars.size() > 1000 ? (temp.i % 2 == 0 ? true : false) : true)) {

      

      if (s_nums)

      with(findimg(1000 + temp.i)) {

        text = toDouble(temp.vars[temp.i - 1]);

        x = temp.polyxy[0] - 2;

        //x = temp.mxy[0] + (temp.i - 1) * temp.nx - 0.5;

        y = temp.mxy[1] - temp.vars[temp.i - 1] * temp.ny - 0.5;

    

        zoom = (temp.vars.size() > 30 ? 0.6 : 0.7);

        alpha = 0.6;

      }

    

      if (s_lines)

      with(findimg(2000 + temp.i)) {

        polygon = {temp.polyxy[0] - 0.5, temp.mxy[1] - temp.vars[temp.i - 1] * temp.ny - 0.025, temp.polyxy[0] + temp.polywh[0] - 0.4, temp.mxy[1] - temp.vars[temp.i - 1] * temp.ny - 0.025};

        alpha = 0.2;

      }

      

      temp._usedlines.add(temp.vars[temp.i - 1]);

    }

    

  }

  

  temp.vars = "";

  

  for (temp.vars : m_arrs)

  for (temp.i = 1; temp.i <= temp.vars.size(); temp.i++) {

    temp.nx = temp.polywh[0] / (temp.vars.size() - 1);

    temp.ny = temp.polywh[1] / temp.h_var;

    

    temp.r_i = m_arrs.index(temp.vars);

    

    if (temp.i != temp.vars.size())

    with(findimg(4000 + temp.i + 1000 * temp.r_i)) {

      polygon = {(_fill ? 0.4 : 0) + temp.mxy[0] + (temp.i - 1) * temp.nx, (_fill ? 0.4 : 0) + temp.mxy[1] - temp.vars[temp.i - 1] * temp.ny,

                  (_fill ? 0.4 : 0) + temp.mxy[0] + (temp.i) * temp.nx, (_fill ? 0.4 : 0) + temp.mxy[1] - temp.vars[temp.i] * temp.ny};

      if (_fill) {

        polygon.add((_fill ? 0.4 : 0) + temp.mxy[0] + (temp.i) * temp.nx);

        polygon.add((_fill ? 0.4 : 0) + temp.mxy[1]);

        

        polygon.add((_fill ? 0.4 : 0) + temp.mxy[0] + (temp.i - 1) * temp.nx);

        polygon.add((_fill ? 0.4 : 0) + temp.mxy[1]);

      }

      

      alpha = _fill ? 0.4 : 1;

    }

    

    if (!(temp.vars[temp.i - 1] in temp._usedlines) && (temp.vars.size() > 1000 ? (temp.i % 2 == 0 ? true : false) : true)) {

      

      if (s_nums)

      with(findimg(5000 + + temp.i + 1000 * temp.r_i)) {

        text = toDouble(temp.vars[temp.i - 1]);

        x = temp.polyxy[0] - 2;

        y = temp.mxy[1] - temp.vars[temp.i - 1] * temp.ny - 0.5;

    

        zoom = (temp.vars.size() > 30 ? 0.6 : 0.7);

        alpha = 0.6;

      }

    

      if (s_lines)

      with(findimg(5500 + temp.i + 1000 * temp.r_i)) {

        polygon = {temp.polyxy[0] - 0.5, temp.mxy[1] - temp.vars[temp.i - 1] * temp.ny - 0.025, temp.polyxy[0] + temp.polywh[0] - 0.4, temp.mxy[1] - temp.vars[temp.i - 1] * temp.ny - 0.025};

        alpha = 0.2;

      }

      

      temp._usedlines.add(temp.vars[temp.i - 1]);

    }

    

  }

}



function toDouble(nt) {

  return int(nt * 100) / 100;

}

There is a better way to do this, but I didn't bother re-coding it by having a single polygon forming the array.

Here's the function:
onDrawGraph(_arr, _fill, s_lines, s_nums, _loop, m_arrs)

_arr is int[]/double[]/float[] of the main array you want. In this example I provided with cosine of 2pi

_fill is just a visual effect (boolean), filling out to the x origin

s_lines is visual (boolean), showing the lines to the borders

s_nums is visual as-well (boolean), shows how much the value is

_loop is a numbers, set to 0 for no looping, set to some number of seconds to re-trace the first value

m_arrs is int[][]/double[][]/float[][], add as many arrays as you want under this.

(to be used in a class or local NPC)

The Doctor · 03-29-2014

Posted by hosler

I did a few of those in college. They are fun.

Yea, it was quite fun. We didn't win, but it was worth it. We finished 7/10 in the time duration. Pretty good out of the fifty teams

hosler · 03-29-2014

Solving 7 problems is a lot. Good job. They must have changed the rules recently. When my team competed they only gave us 6.

The Doctor · 03-29-2014

Posted by hosler

Solving 7 problems is a lot. Good job. They must have changed the rules recently. When my team competed they only gave us 6.

The last one was pretty hard. They basically wanted you to create a programming language and I almost finished, except for coding arrays into it. The time ran out however.

03-29-2014	12
Johnaudi 299,792,458 m/s Join Date: Mar 2012 Location: Lebanon Posts: 3,581	I've had some C# projects that are currently on sale. (https://www.dropbox.com/s/x3qp141dzb...ania_Setup.msi) Here's a pre-done Gs2 Graph: PHP Code: // Made by Johnaudi //#CLIENTSIDE function onPlayerEnters() { maxlooplimit = 10000000; onPlayerChats(); } function onPlayerChats() { temp.rvars1 = {}; for (temp.i = 0; temp.i <= 4 * pi; temp.i += 0.1) { temp.rvars1.add(cos(temp.i)); } //onDrawGraph(this.attr[3].tokenize("#"), false, false, false, 0, ""); onDrawGraph(temp.rvars1, true, false, false, 0.1, {}); //onDrawGraph({2, -4, 8, 4}, true, true, true, 0, {{1, 3, 7, -2}}); //onDrawGraph({1, 2, 1, 5, 2, 3, 7, 2, 1, 6, 2, 3.5}, true, true, true, 0.2, {{3, 1, 1, 6, 3, 2, 4, 4, 1, 2, 1, 4}, {4.4, 2, 8, 3, 4, 5, 1, 4, 3, 3, 5, 1.5}}); } function onDrawGraph(_arr, _fill, s_lines, s_nums, _loop, m_arrs) { cancelevents("onDrawGraph"); hideimgs(240, 17000); temp.polyxy = {this.x, this.y}; temp.polywh = {18, 13}; temp.vars = _arr; if (_loop > 0) { temp.i = 0; temp.vars = ""; for (temp.s : _arr) { if (temp.i == _arr.size() - 1) { temp.vars.add(temp.s); temp.vars.add(_arr[0]); break; } if (temp.i != 0) temp.vars.add(temp.s); temp.i++; } _arr = temp.vars; temp.m_vrs = ""; for (temp._sr : m_arrs) { temp.m_vr = ""; temp.ri = 0; for (temp.sr_s : temp._sr) { if (temp.ri == temp._sr.size() - 1) { temp.m_vr.add(temp.sr_s); temp.m_vr.add(temp._sr[0]); break; } if (temp.ri != 0) temp.m_vr.add(temp.sr_s); temp.ri++; } temp.m_vrs.add(temp.m_vr); } m_arrs = temp.m_vrs; scheduleevent(_loop, "onDrawGraph", _arr, _fill, s_lines, s_nums, _loop, m_arrs); } temp.h_var = 0; temp.l_var = 0; temp.all_vrs = _arr; for (temp._sr : m_arrs) { for (temp.sr_s : temp._sr) { temp.all_vrs.add(temp.sr_s); } } for (temp.h_vi : temp.all_vrs) { temp.h_var = max(temp.h_var, abs(temp.h_vi)); temp.l_var = min(temp.l_var, temp.h_vi); } with(findimg(250)) { // x polygon = {temp.polyxy[0], temp.polyxy[1], temp.polyxy[0], temp.polyxy[1] + 0.2, temp.polyxy[0] + temp.polywh[0], temp.polyxy[1] + 0.2, temp.polyxy[0] + temp.polywh[0], temp.polyxy[1]}; } temp.polyxy = {this.x, this.y - temp.polywh[1]}; with(findimg(251)) { // y polygon = {temp.polyxy[0], temp.polyxy[1], temp.polyxy[0] + 0.2, temp.polyxy[1], temp.polyxy[0] + 0.2, temp.polyxy[1] + temp.polywh[1] * (temp.l_var < 0 ? 2 : 1), temp.polyxy[0], temp.polyxy[1] + temp.polywh[1] * (temp.l_var < 0 ? 2 : 1)}; } temp.mxy = {temp.polyxy[0] - 0.4, temp.polyxy[1] + temp.polywh[1] - 0.4}; temp.nx = temp.polywh[0] / (temp.vars.size() - 1); temp.ny = temp.polywh[1] / temp.h_var; temp._usedlines = {}; for (temp.i = 1; temp.i <= temp.vars.size(); temp.i++) { if (temp.i != temp.vars.size()) with(findimg(300 + temp.i)) { polygon = {(_fill ? 0.4 : 0) + temp.mxy[0] + (temp.i - 1) * temp.nx, (_fill ? 0.4 : 0) + temp.mxy[1] - temp.vars[temp.i - 1] * temp.ny, (_fill ? 0.4 : 0) + temp.mxy[0] + (temp.i) * temp.nx, (_fill ? 0.4 : 0) + temp.mxy[1] - temp.vars[temp.i] * temp.ny}; if (_fill) { polygon.add((_fill ? 0.4 : 0) + temp.mxy[0] + (temp.i) * temp.nx); polygon.add((_fill ? 0.4 : 0) + temp.mxy[1]); polygon.add((_fill ? 0.4 : 0) + temp.mxy[0] + (temp.i - 1) * temp.nx); polygon.add((_fill ? 0.4 : 0) + temp.mxy[1]); } alpha = _fill ? 0.4 : 1; } if (!(temp.vars[temp.i - 1] in temp._usedlines) && (temp.vars.size() > 1000 ? (temp.i % 2 == 0 ? true : false) : true)) { if (s_nums) with(findimg(1000 + temp.i)) { text = toDouble(temp.vars[temp.i - 1]); x = temp.polyxy[0] - 2; //x = temp.mxy[0] + (temp.i - 1) * temp.nx - 0.5; y = temp.mxy[1] - temp.vars[temp.i - 1] * temp.ny - 0.5; zoom = (temp.vars.size() > 30 ? 0.6 : 0.7); alpha = 0.6; } if (s_lines) with(findimg(2000 + temp.i)) { polygon = {temp.polyxy[0] - 0.5, temp.mxy[1] - temp.vars[temp.i - 1] * temp.ny - 0.025, temp.polyxy[0] + temp.polywh[0] - 0.4, temp.mxy[1] - temp.vars[temp.i - 1] * temp.ny - 0.025}; alpha = 0.2; } temp._usedlines.add(temp.vars[temp.i - 1]); } } temp.vars = ""; for (temp.vars : m_arrs) for (temp.i = 1; temp.i <= temp.vars.size(); temp.i++) { temp.nx = temp.polywh[0] / (temp.vars.size() - 1); temp.ny = temp.polywh[1] / temp.h_var; temp.r_i = m_arrs.index(temp.vars); if (temp.i != temp.vars.size()) with(findimg(4000 + temp.i + 1000 * temp.r_i)) { polygon = {(_fill ? 0.4 : 0) + temp.mxy[0] + (temp.i - 1) * temp.nx, (_fill ? 0.4 : 0) + temp.mxy[1] - temp.vars[temp.i - 1] * temp.ny, (_fill ? 0.4 : 0) + temp.mxy[0] + (temp.i) * temp.nx, (_fill ? 0.4 : 0) + temp.mxy[1] - temp.vars[temp.i] * temp.ny}; if (_fill) { polygon.add((_fill ? 0.4 : 0) + temp.mxy[0] + (temp.i) * temp.nx); polygon.add((_fill ? 0.4 : 0) + temp.mxy[1]); polygon.add((_fill ? 0.4 : 0) + temp.mxy[0] + (temp.i - 1) * temp.nx); polygon.add((_fill ? 0.4 : 0) + temp.mxy[1]); } alpha = _fill ? 0.4 : 1; } if (!(temp.vars[temp.i - 1] in temp._usedlines) && (temp.vars.size() > 1000 ? (temp.i % 2 == 0 ? true : false) : true)) { if (s_nums) with(findimg(5000 + + temp.i + 1000 * temp.r_i)) { text = toDouble(temp.vars[temp.i - 1]); x = temp.polyxy[0] - 2; y = temp.mxy[1] - temp.vars[temp.i - 1] * temp.ny - 0.5; zoom = (temp.vars.size() > 30 ? 0.6 : 0.7); alpha = 0.6; } if (s_lines) with(findimg(5500 + temp.i + 1000 * temp.r_i)) { polygon = {temp.polyxy[0] - 0.5, temp.mxy[1] - temp.vars[temp.i - 1] * temp.ny - 0.025, temp.polyxy[0] + temp.polywh[0] - 0.4, temp.mxy[1] - temp.vars[temp.i - 1] * temp.ny - 0.025}; alpha = 0.2; } temp._usedlines.add(temp.vars[temp.i - 1]); } } } function toDouble(nt) { return int(nt * 100) / 100; } There is a better way to do this, but I didn't bother re-coding it by having a single polygon forming the array. Here's the function: onDrawGraph(_arr, _fill, s_lines, s_nums, _loop, m_arrs) _arr is int[]/double[]/float[] of the main array you want. In this example I provided with cosine of 2pi _fill is just a visual effect (boolean), filling out to the x origin s_lines is visual (boolean), showing the lines to the borders s_nums is visual as-well (boolean), shows how much the value is _loop is a numbers, set to 0 for no looping, set to some number of seconds to re-trace the first value m_arrs is int[][]/double[][]/float[][], add as many arrays as you want under this. (to be used in a class or local NPC) Attached Thumbnails

03-27-2014	1
Skill The Unwanted Critic Join Date: Sep 2011 Posts: 3,639	Coding General code sharing thread. So for my Calculus class I had to do some summations that were way too long to do manually, so instead of spending 30 minutes doing redundant things I just made a simple program to figure them out(I get the concept already). For example, this is how I solved a ridiculously long summation. PHP Code: `function myFunction() { var solution=0; for(var k=8;k<=40; k++) { solution+= -(3k); } document.write(solution);` it outputted -2376, which was correct. Saved me so much time lol. Even figured out one of the assigned problems my teacher couldn't figure out how to simplify without doing the whole thing manually, using code: PHP Code: `function myFunction() { var solution=0; for(var k=4;k<=24; k++) { solution+= (kk*k); } document.write(solution);` output :89964

03-27-2014	2
Ignatius The Psychonaut Join Date: Jul 2012 Location: Middle o' space Posts: 1,527	http://img.pandawhale.com/45822-Keanu-Bill-and-Ted-whoa-gif-Yr7D.gif (Unsupported image host)

03-27-2014	3
5hift ✔️TURBO✔️VERIFIED✔️ Join Date: Feb 2013 Location: Larunda Relay Posts: 6,481	Yeah when in doubt, Consult your local graalians.

03-27-2014	6
Dusty Should be fixed. Join Date: Aug 2011 Posts: 6,359	I understand code perfectly well, and have no problem reading these functions. But reading this stuff in math form confuses the hell out of me.

03-27-2014	7
The Doctor Registered User Join Date: Dec 2011 Location: Blacksburg, Virginia Posts: 5,459	Funny you should post this thread, because I'm about to go into a programming competition on Saturday . So basically, we have a lot of practice problems for the competition. One of the problems in the packet is to find the smallest perimeter and area of points contained on a plane. It was rather easy. Java: PHP Code: import java.util.Scanner; public class C { public static void main(String[] args) { Scanner s = new Scanner(System.in); int caseNum = s.nextInt(); for(int i = 0; i < caseNum; i++) { //Ant farm 1 int ants = s.nextInt(); double xO = s.nextDouble(); double yO = s.nextDouble(); double lowx = xO; double lowy = yO; double highx = xO; double highy = yO; for(int ii = 0; ii < ants - 1; ii++) { double x = s.nextDouble(); double y = s.nextDouble(); if(x < lowx) lowx = x; else if(x > highx) highx = x; if(y < lowy) lowy = y; else if(y > highy) highy = y; } double length = highx - lowx; double width = highy - lowy; double perim = (2 * length) + (2 * width); double area = length * width; int c = i + 1; System.out.println("Case " + c + ": Area " + area + ", Perimeter " + perim); } } }

03-29-2014	14
hosler Banned Join Date: Sep 2012 Posts: 1,059	Solving 7 problems is a lot. Good job. They must have changed the rules recently. When my team competed they only gave us 6.