알고리즘 문제 풀이/1DP_과제(~180615)
180602_4690_완전 세제곱
//https://www.acmicpc.net/problem/4690#include using namespace std; int main(){ int a,b,c,d; for(a=2; a
//https://www.acmicpc.net/problem/4690#include using namespace std; int main(){ int a,b,c,d; for(a=2; a
//https://www.acmicpc.net/problem/1934 #include using namespace std; int gcd(int a, int b){ return b? gcd(b, a%b) : a;}int main(){ int t; cin>>t; while(t-->0){ int a, b; cin >> a >> b; if(a
#include using namespace std; char map[100][100];int main(){ int n; cin >> n; for(int i=0; i> map[i]; int k; cin >> k; if(k==1){ //그대로 for(int i=0; i=0; i--){ for(int j=0; j
//https://www.acmicpc.net/problem/2231 #include using namespace std; int main(){ int n; cin >> n; int ans=0; for(int i=1; i0){ sum+=tmp%10; tmp/=10; } if(sum==n) { ans=i; break; } } cout