BOJ

알고리즘 문제 풀이/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

알고리즘 문제 풀이/1DP_과제(~180615)

180126_2616_소형기관차

//https://www.acmicpc.net/problem/2616#include #include using namespace std;int dp[4][50001];int train[50001]; int main(){ int n,m; cin >> n; for(int i=1; i> x; train[i]=train[i-1]+x; } cin >> m; for(int i=1*m; i

알고리즘 문제 풀이/1DP_과제(~180615)

180126_1328_고층 빌딩

//https://www.acmicpc.net/problem/1328#include #define MOD 1000000007using namespace std;long long dp[101][101][101]; int main(){ int n, l, r; long long temp; cin >> n >> l >> r; dp[1][1][1]=1; dp[2][1][2]=dp[2][2][1]=1; for(int i=3; i

bong sue
'BOJ' 태그의 글 목록 (15 Page)