eolymp
bolt
Try our new interface for solving problems
Problems

n-digit numbers

published at 1/2/24, 9:37:05 pm

include <iostream>

include <cmath>

using namespace std; int main() { long long n,s; cin>>n>>s; long long eded=pow(10,n-1); long long eded1=pow(10,n)-1; for(long long i=eded; i<=eded1; i++) { long long icopy=i; long long cem=0; while(icopy!=0) { long long r=icopy%10; cem+=r; icopy/=10; } if(cem==s) { cout<<i<<endl; }

}

return 0; }