알고리즘 문제 풀이/1DP_과제(~180615)
//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)
//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)
//https://www.acmicpc.net/problem/2010 #include using namespace std; int main(){ int n; cin >> n; int sum=0; for(int i=0; i> x; sum+=x; } cout
알고리즘 문제 풀이/1DP_과제(~180615)
//https://www.acmicpc.net/problem/3046 #include using namespace std; int main(){ int R1, S; cin >> R1 >> S; int R2=2*S-R1; cout