Inflearn Community Q&A

#include <stdio.h>
#include <algorithm>
#include <vector>

using namespace std;

int main(){
	int n, sum=0, cnt=0;
	int startPoint=1, endPoint=0;
	vector< vector<int> > results;
	
	scanf("%d",&n);
	
	//연산부 
	while(startPoint<(n/2)+1){
		for(int i=startPoint; i<n; i++){
			sum = sum + i;
			endPoint = i;
			if(sum>n){
				sum=0;
				startPoint++;
				break;
			}
			if(sum==n){
				vector<int>result;
				//시작지점부터 끝지점까지 자연수 추가 
				for(int q=startPoint; q<=endPoint; q++){
					if(q==endPoint) {
						result.push_back(endPoint);
						result.push_back(n); 
					}
					else {
						result.push_back(q);
					} 
				}
				results.push_back(result);
				sum=0;
				startPoint++;
				cnt++;
				break;
			}
		}
	}
	
	//출력부  
	for(int i=results.size()-1; i>=0; i--){
		for(int q=0; q<results[i].size(); q++){
			printf("%d",results[i][q]);
			if(q==results[i].size()-1){ 
				break;
			} else if(q==results[i].size()-2){
				printf(" = ");
			} else {
				printf(" + ");
			}
		}
		printf("\n");
	}	
	printf("%d",cnt);
	
	return 0;
}