BOJ

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

180122_1977_완전제곱수

//https://www.acmicpc.net/problem/1977#include using namespace std; int main(){ int m,n, sum, min; cin >> m>> n; sum=0; min=0; for(int i=1; i=m) { if(min==0) min=i*i; for(int j=i; j*j

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

180122_9507_Generations of Tribbles

//https://www.acmicpc.net/problem/9507#include using namespace std;long long koong[68]; int main() { int t; cin >> t; for(int i=0; i>n; for(int j=0; j0) continue; if(j

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

180119_1159_농구경기

//https://www.acmicpc.net/problem/1159#include using namespace std;int cntalphb[26]; int main() { int n; cin >> n; bool chk=0; for(int i=0; i> name; cntalphb[name[0]-'a']++; } for(int i=0; i=5) { chk=1; cout

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

180105_10707_수도요금

//https://www.acmicpc.net/problem/10707 #include using namespace std; int main(){ int a,b,c,d,p; cin >>a >> b >> c>> d>> p; int costx=a*p; int costy=(p>c ?b+d*(p-c) :b ); if(costx>costy) cout

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