BOJ

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

171224_5543_상근날드

//https://www.acmicpc.net/problem/5543 #include using namespace std; int main(){ int hbg=2100; int bvrg=2100; for(int i=0;i> x; if(hbg>x) hbg=x; } for(int i=0; i> y; if(bvrg>y) bvrg=y; } cout

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

171224_10797_10부제

//https://www.acmicpc.net/problem/10797 #include using namespace std; int main(){ int day,x; cin >> day; int cnt=0; for(int i=0; i>x; if(day==x) cnt++; } cout

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

171224_1357_뒤집힌 덧셈

//https://www.acmicpc.net/problem/1357 #include using namespace std;int rev(int n){ int revn=0; while(n>0) { revn*=10; revn+=n%10; n/=10; } return revn;}int main(){ int x,y; cin >> x >> y; cout

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

171223_1547_공

//https://www.acmicpc.net/problem/1547 #include using namespace std; int main(){ int m; bool cup[4]={0,1,0,0}; cin >> m; for(int i=0 ;i> x >> y; int tmp=cup[x]; cup[x]=cup[y]; cup[y]=tmp; } for(int i=1; i

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