The basis of the programming cycle-odd sum.

Describe

Computes all odd-numbered and between non-negative integers m to n (including M and N), where m is not greater than N, and N is not greater than 300. For example, M=3, n=12, and the following are: 3+5+7+9+11=35.

Enter two numbers m and N, two numbers separated by a single space, where 0 <= m <= n <= 300. An output line that contains an integer representing all the odd and sample inputs between M and N (including M and N)

7 15

Sample output

55

1#include <iostream>2#include <cstdio>3 using namespacestd;4 intMain ()5 {6     inta,x=0, b,m;7Cin>>a>>m;8     if(a%2==0) a=a+1;//A is not a plural9     if(m%2==0) b=b-1;//b is not a pluralTen      for(inti=a;i<m+1; i+=2) One     { Ax+=i; -     }     -printf"%d", x);  the     return 0; -}

Wrong two times, all because of not careful examining.

The basis of the programming cycle-odd sum.