알고리즘 문제 풀이/1DP_과제(~180615)
2018.06.04
//https://www.acmicpc.net/problem/10769 #include using namespace std; int main(){ char str[256]; cin.getline(str, 255); int cnt[2]={0,0}; for(int i=0; str[i]!=0; i++){ if(str[i]==':' && (str[i+1]!=0 && str[i+2]!=0)){ if(str[i+1]=='-'){ if(str[i+2]==')') cnt[0]++; else if(str[i+2]=='(') cnt[1]++; } } } if(cnt[1]==0 && cnt[0]==0) cout cnt[1]) cout
알고리즘 문제 풀이/1DP_과제(~180615)
2018.04.28
//https://www.acmicpc.net/problem/2799 #include #include using namespace std; int cnt[5];int main(){ int m, n; cin >> m >>n; char win[501][501]; for(int i=0; i> win[i]; } for(int i=1; i
알고리즘 문제 풀이/1DP_과제(~180615)
2018.04.03
//https://www.acmicpc.net/problem/2810#include using namespace std; int main(){ int N; char chair[50]; cin >> N; int ans=1; bool chk=0; for(int i=0; i> chair[i]; if(chair[i]=='S') ans++; if(chair[i]=='L'){ if(!chk) chk=1; else { ans++; chk=0; } } } if(ans
