problemnumber28.cpp

#include<iostream>
#include<algorithm>
#include<vector>
#include<utility>
#include <string>
using namespace std;
//function work to returns the sum of a sequence of integers. 
int sequenceSum(int start, int end, int step)
{
	int	result = 0;
	for (int i = start; i <= end; i = i + step)
	{
		result += i;

	}

	return result;
}

int main() {
	cout << sequenceSum(0, 15, 3);
	return 1;
}
/*Your task is to write a function which returns the sum of a sequence of integers.

The sequence is defined by 3 non-negative values: begin, end, step.

If begin value is greater than the end, your function should return 0. If end is not the result of an integer number of steps, then don't add it to the sum. See the 4th example below.

Examples

2,2,2 --> 2
2,6,2 --> 12 (2 + 4 + 6)
1,5,1 --> 15 (1 + 2 + 3 + 4 + 5)
1,5,3  --> 5 (1 + 4)

This is the first kata in the series:

	Sum of a sequence (this kata)
	Sum of a Sequence [Hard-Core Version]

*/