MADODDSUM - Easy Odd Sum
Hablu likes odd numbers a lot. So he wants the sum of all odd numbers in range [a, b]. That is, find the sum of all odd numbers i such that (a ≤ i ≤ b). Seems easy right? Because it is.
Input
The first and only line will contain 2 integers a, b where (0 ≤ a ≤ 108) and (0 ≤ b ≤ 108).
Output
In one line, output the value of the sum
Example
Input: 0 9 Output: 25
hide comments
|
code_nit:
2016-01-12 09:59:18
easy question !!
|
|
jack_jay:
2016-01-05 19:43:07
smtyms dnt think much....jst do |
|
Diksha Jaiswal:
2015-12-29 05:05:24
my 200th :D |
|
Devashish Mathur:
2015-12-25 10:15:22
Seriously? |
|
aakash_s:
2015-12-24 08:35:02
AC in one go with only 10 lines of code in C++ (0.00s) |
|
|
aakash_s:
2015-12-24 08:34:22
Easiest problem |
|
Filip Sollar:
2015-12-03 10:51:07
getting wrong answer someone give me any addtional test case ? |
|
ATUL KUMAR SINGH:
2015-11-22 07:42:54
simplest one |
|
Negin:
2015-11-17 10:45:42
It seems like an easy one but I can't get it right. I either get compilation error or wrong answer. Can someone help with where I can look for help? |
|
Ruhan Habib:
2015-11-10 18:21:22
@Prakhar mistake fixed.. Thanks! |
| Added by: | Ruhan Habib |
| Date: | 2015-11-05 |
| Time limit: | 0.5s-1s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: ASM64 GOSU JS-MONKEY |
| Resource: | Me? |
RSS