Soln accepted but time is .156 how to reduce to atleast 0.078 and also how to reduce memory usuage?
import java.util.*;
import java.io.*;
public class prob1264{
public static void main(String args[])
{
    Scanner sc=new Scanner(System.in);
    PrintWriter out=new PrintWriter(System.out);
    int n=sc.nextInt();
    int m=sc.nextInt();
    int result=n*(m+1);
    out.print(result);
    out.close();
    }
}

The answer is "N*(M+1)"

Edited by author 21.01.2019 19:40

помогите понять условие, пожалуйста, буду благодарен

In Python 3.0:
N = int(input())
M = int(input())
result = N*(M+1)
print(result)
#It produces runtime error


In C:
#include <stdio.h>

int main(void) {
  short int n, k;

  scanf("%4hd%4hd", &n, &k);
  printf("%hd\n", n * (k+1));
  return 0;
}
# It produces wrong answer for test N7

I'm getting time limit exceeded using this algorithm, any optimization suggestions? This problem is taking almost a week 8-|

total = 0
for i from 1 to N
  for j from 0 to M
    total++
print total

Edited by author 07.06.2015 11:34

When I submit this problem I get waiting status and I am not the only one.

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace ConsoleApplication3
{
    class Program
    {
        static void Main(string[] args)
        {
            string[] nums = Console.ReadLine().Split(' ');
           long n = int.Parse(nums[0]);
           long m = int.Parse(nums[1]);
            if (0 <= n && n <= 40000)
            {
                if (0 <= m && m <= 40000)
                {
                    Console.WriteLine(n * (m + 1));
                    Console.ReadKey();
                }
            }
        }
    }
}

Right... I guess this problem was put in here for comic relief. :)

For crying out loud, the author didn't even bother to increase the limits so as to make this a 'bignum' problem... :P

this kind of problems are easy,, i guess they exist to build up your confidence. xD

O_O ?

I think that complexity 68 is too big for this task and should be significantly reduced.

is this dynamic programming ? :)
or maybe we could try a nice branch and bound ! ;)

n*(m+1) o_O

var
n,m:longint;
begin
readln(n,m);
writeln(n*(m+1));
end.