输入一个数q 输出可能的连续相加和为q的情况
#includeusing namespace std; int temp = 1; int count1 =0; void cout1(int k, int j) { for (int i = 0; i < k; i++) { cout << i+j; if (i < k-1 ) { cout << "+"; } } } int fun1(int k) { int sum = 0; for (int i = 0; i < k; i++) { sum += i; } return sum; } int fun(int k,int i) { int sum = 0; sum = k* i + fun1(k); return sum; } int num; int main() { cin >> num; cout << num << "=" << num << endl; for (int k = 1; k < 10; k++) { for (int i = 1; i < num; i++) { if (fun(k, i) == num ) { temp++; cout << k << "*" << i << endl; cout << num << "="; cout1(k, i); count1 = k; cout<< endl; } } } cout << "Result:"< endl; }
#include
void cout1(int k, int j) { for (int i = 0; i < k; i++) {
cout << i+j; if (i < k-1 ) { cout << "+"; } }}
int fun1(int k) { int sum = 0; for (int i = 0; i < k; i++) { sum += i; } return sum;}int fun(int k,int i) { int sum = 0; sum = k* i + fun1(k); return sum;}int num;int main() { cin >> num; cout << num << "=" << num << endl; for (int k = 1; k < 10; k++) { for (int i = 1; i < num; i++) {
if (fun(k, i) == num ) { temp++; cout << k << "*" << i << endl; cout << num << "="; cout1(k, i); count1 = k; cout<< endl; } } } cout << "Result:"<