브루트포스
알고리즘 문제 풀이/1DP_과제(~180615)
180528_2231_분해합
//https://www.acmicpc.net/problem/2231 #include using namespace std; int main(){ int n; cin >> n; int ans=0; for(int i=1; i0){ sum+=tmp%10; tmp/=10; } if(sum==n) { ans=i; break; } } cout
알고리즘 문제 풀이/1DP_과제(~180615)
180127_2309_일곱 난쟁이
//https://www.acmicpc.net/problem/2309 #include #include using namespace std;int h[10]; int main(){ int sum=0; bool chk=0; for(int i=1; i> h[i]; sum+=h[i]; } sort(h+1,h+10); bool index[10]={0,}; for(int i=1; i
알고리즘 문제 풀이/1DP_과제(~180615)
180126_1065_한수
//https://www.acmicpc.net/problem/1065 #include using namespace std; int main(){ int n,cnt; cin >> n; cnt=n; for(int i=1; i0) { if(now%10-(now%100)/10 != diff) {cnt--; break;} now/=10; } /********* while(now>0) { if(now%10-(now%100)/10 != diff) {cnt--; break;} now/=10; if(now
