알고리즘 문제 풀이/1DP_과제(~180615)
171216_10988_펠린드롬인지 확인하기
//https://www.acmicpc.net/problem/10988 #include #include using namespace std; int main(){ string s; cin >> s; bool chk=0; int l=s.size(); for(int i=0; i
//https://www.acmicpc.net/problem/10988 #include #include using namespace std; int main(){ string s; cin >> s; bool chk=0; int l=s.size(); for(int i=0; i
//https://www.acmicpc.net/problem/1919 #include #include using namespace std; int main(){ string s1, s2; cin >> s1 >> s2; int l1=s1.size(); int l2=s2.size(); int cnt=0; for(int i=0; i
//https://www.acmicpc.net/problem/1110 #include using namespace std; int main(){ int origin, x, n; cin >> origin; x=origin; for(n=1; ;n++) { int a=x%10; x = x/10 + x%10; x = a*10+x%10; if(x==origin) break; } cout
//https://www.acmicpc.net/problem/9933 #include #include using namespace std; int main(){ int n; cin >> n; char word[101][14]; for(int i=0; i> word[i]; for(int i=0;i