백준

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

171226_2998_8진수

//https://www.acmicpc.net/problem/2998 #include #include using namespace std; int main() { string bin; cin >> bin; int l=bin.size(); int x; int r=l%3; if(r==1) cout

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

171225_12790_Mini Fantasy War

//https://www.acmicpc.net/problem/12790 #include using namespace std; int main(){ int T; cin >> T; int hp, mp, atk,def; int a,b,c,d,ans; for(int i=0; i> hp >> mp >> atk >> def >> a >> b >> c >> d; hp+=a; mp+=b; atk+=c; def+=d; if(hp

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

171224_1789_수들의 합

//https://www.acmicpc.net/problem/1789 #include using namespace std; int main(){ long long S; cin >> S; int i=0; while(1) { i++; S-=i; if(S

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

171224_10886_0 = not cute / 1 = cute

//https://www.acmicpc.net/problem/10886 #include using namespace std; int main(){ bool x; int N; cin >> N; int cnt=0; for(int i=0; i> x; if(x) cnt++; else //x==0 cnt--; } if(cnt>0) cout

bong sue
'백준' 태그의 글 목록 (22 Page)