Problem Solving - Level 2 - Base64 Decoder https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=2&contestProbId=AV5PR4DKAG0DFAUq&categoryId=AV5PR4DKAG0DFAUq&categoryType=CODE&problemTitle=&orderBy=FIRST_REG_DATETIME&selectCodeLang=ALL&select-1=2&pageSize=10&pageIndex=3 #include using namespace std; char decoding(char temp) { if('A'
Problem Solving - Level 2 - 새로운 불면증 치료법 https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=2&contestProbId=AV18_yw6I9MCFAZN&categoryId=AV18_yw6I9MCFAZN&categoryType=CODE&problemTitle=&orderBy=FIRST_REG_DATETIME&selectCodeLang=ALL&select-1=2&pageSize=10&pageIndex=3 #include using namespace std; bool arrayCheck(bool *Arr) { for(int i=0;i>T; for(int i=1;i>N; temp=N; while(t..
Problem Solving - Level 2 - 아름이의 돌 던지기 https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=2&contestProbId=AV18-stqI8oCFAZN&categoryId=AV18-stqI8oCFAZN&categoryType=CODE&problemTitle=&orderBy=FIRST_REG_DATETIME&selectCodeLang=ALL&select-1=2&pageSize=10&pageIndex=3 #include #include #include using namespace std; int main() { int T; cin>>T; for(int i=1;i>num; for(int j=0;j>..
Problem Solving - Level 2 - 수도 요금 경쟁 https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=2&contestProbId=AV189xUaI8UCFAZN&categoryId=AV189xUaI8UCFAZN&categoryType=CODE&problemTitle=&orderBy=FIRST_REG_DATETIME&selectCodeLang=ALL&select-1=2&pageSize=10&pageIndex=3 #include #include using namespace std; int main() { int T,P,Q,R,S,W,result; cin>>T; for(int i=1;i>P>>Q>>R>>S>>W..
Problem Solving - Level 2 - 최빈수 구하기 https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=2&contestProbId=AV13zo1KAAACFAYh&categoryId=AV13zo1KAAACFAYh&categoryType=CODE&problemTitle=&orderBy=FIRST_REG_DATETIME&selectCodeLang=ALL&select-1=2&pageSize=10&pageIndex=3 #include using namespace std; int main() { int T,score,num; cin>>T; while(T--) { cin>>num; int result[101]={0,};..
Problem Solving - Level 1 - 홀수만 더하기 https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=1&contestProbId=AV5QSEhaA5sDFAUq&categoryId=AV5QSEhaA5sDFAUq&categoryType=CODE #include #include using namespace std; int main() { int N; cin>>N; for(int i=1;iarr[j]; if(arr[j]%2==1) { sum+=arr[j]; } } cout