Since N is as big as 10000 the solution for N = 10000 exceeds unsigned long so you should use big numbers (put the numbers in arrays and then do the operations on the arrays)
https://www.infoarena.ro/lucrul-cu-nr-mari

var
n:integer;
s:real;
begin
read(n);
s:=n*((n+1 )/2)*(n+2);
write(s);
end.

Edited by author 26.11.2019 11:33

var
n:integer;
s:real;
begin
read(n);
s:=(n+2)*((n+1)*n)/2;
write(s);
end.

(n+2)*((n+1)*n)/2

1000 => 501501000
500  => 62875500
333  => 18629685
1    => 3
3    => 30
4    => 60
and use long long =)

I know i am stupid but help me to understand this formula!
n*(n+1)/2*(n+2)

Edited by author 02.11.2013 03:06

Edited by author 02.11.2013 03:12

He guys if you can't come up with any formula...pre-computation will do the job.I could not come up with any formula so I used precomputation and AC in 0.015 sec.Good luck :)

i cant find 12 distinct combinations if N = 2...
i can only think of:
0-0
0-1
0-2
1-1
1-2
2-2
That are only 6 combinations... what did i miss?

import java.util.Scanner;

public class AcmTimusRu {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int n = s.nextInt();
        System.out.println(n * (n + 1) * (n + 2) / 2);
    }
}

Hey, guys, i've did it! No need to be so smarty, just use long long :) Formula is obvious and it already somewhere in this forum, so you can find it

USE LONG LONG!

1000 => 501501000
500  => 62875500
333  => 18629685
1    => 3
3    => 30
4    => 60
But Wa#5

Edited by author 28.10.2006 17:09

I didn't get accepted until I switched printf() with cout.
I used %lld for the format of printf and still it got WA. Same formula, same code, just that i used cout/cin and I got AC.

In paskal when n=10000 you can not write this expression n*(n+1)*(n+2)/2 in some variables it is very long and big number so in C++ it is very easy just write(here is my AC program):
#include <cstdlib>
#include <iostream>

using namespace std;

int main(int argc, char *argv[])
{
    long long n;
    cin>>n;
    cout<<n*(n+1)*(n+2)/2<<endl;
    system("PAUSE");
    return EXIT_SUCCESS;
}

Edited by author 27.04.2008 17:47

Answer for n is n*(n+1)/2*(n+2)

For example if n=2 then answer is 2*3/2*4=12

My program only read integer and write integer (ready formula). Why it works 0.015 sec?

Edited by author 11.06.2009 00:15

Edited by author 21.02.2009 18:37

100 => 515100
1000 => 501501000
9999 => 499999995000
7779 => 235455472110
1234 => 941825820

Good luck!

All codes listed below works good on my computer (and they give correct answers), but when submitting I get:

Code #1:
---------------------------------------------------------
#include<stdio.h>
#include<iostream.h>

int main()
{
  long long n;
  cin>>n;

  long long wynik;
  wynik=(n*(n+1)*(n+2))/2;

  cout<<wynik<<endl;
  return 0;
}
----------------------------------------------------------
Compilation error

Code #2: removed iostream.h and replaced cin and cout with
scanf("%lld",%n); and printf("%lld\n",wynik);

WA on test 5

Code #3: same as #2, but with
printf("%0.lf\n, (double)wynik); instead

WA on test 1
-----------------------------------------------------------

All those programs work and give correct results on my computer. What's wrong here? Please help.

Here my solution:

---
end.

I can not understand that incorrectly. Help somebody)))))))

Edited by author 08.11.2009 03:46