#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <math.h>
#include <limits.h>
#define ll long long
#define x first
#define y second
#define pll pair<ll,ll>
#define pii pair<int,int>
using namespace std;
int sum(int x){
string s; s = to_string(x);
int summer = 0;
for(int i = 0; i < s.size(); i++){
summer += s[i] - '0';
}
return summer;
void solve() {
int M; cin >> M;
for(int i = 1000; i <= 9999; i++){
if(sum(i) == M){
cout << i << endl;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
//ll t; cin >> t; while(t--)
solve();
Copyright © 2025 SCHOLAR.TIPS - All rights reserved.
Answers & Comments
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <math.h>
#include <limits.h>
#define ll long long
#define x first
#define y second
#define pll pair<ll,ll>
#define pii pair<int,int>
using namespace std;
int sum(int x){
string s; s = to_string(x);
int summer = 0;
for(int i = 0; i < s.size(); i++){
summer += s[i] - '0';
}
return summer;
}
void solve() {
int M; cin >> M;
for(int i = 1000; i <= 9999; i++){
if(sum(i) == M){
cout << i << endl;
}
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
//ll t; cin >> t; while(t--)
solve();
}