anonymous?

#include #include using namespace std; int main(){ string str; while(1){ getline(cin, str); if(str == "") break; cout

PROGRAMMING/Algorithm 2021. 2. 10. 17:47

#include int main(){ int T; scanf("%d", &T); for(int i=0; i

PROGRAMMING/Algorithm 2021. 2. 10. 17:46

#include int main(){ int T; scanf("%d", &T); for(int i=0; i

PROGRAMMING/Algorithm 2021. 2. 10. 17:44

#include int main(){ int T; scanf("%d", &T); for(int i=0; i

PROGRAMMING/Algorithm 2021. 2. 10. 17:42

#include int main(){ while(1){ int A, B; scanf("%d %d", &A, &B); if(A == 0 && B == 0) break; printf("%d\n", A+B); } }

PROGRAMMING/Algorithm 2021. 2. 10. 17:35

#include int main(){ int A, B; while(scanf("%d %d", &A, &B) != EOF){ printf("%d\n", A+B); } }

PROGRAMMING/Algorithm 2021. 2. 10. 17:33

#include int main(){ int T; scanf("%d", &T); for(int i=0; i

PROGRAMMING/Algorithm 2021. 2. 10. 17:32

#include int main(){ int A, B; scanf("%d %d", &A, &B); printf("%d", A+B); }

PROGRAMMING/Algorithm 2021. 2. 10. 17:30

#include int main(){ printf("Hello World!"); }

PROGRAMMING/Algorithm 2021. 2. 10. 17:28

💻 C++ 제출코드 #include #include #include #include using namespace std; int BFS(int target1, int target2, deque *graph, bool *visited, deque *child){ queue q; visited[target1] = true; // check visited q.push(target1); (*child)[target1] = 0; while(!q.empty()){ int current = q.front(); // get front element from queue q.pop(); // pop front element for(int num: graph[current]){ if(visited[num] == false)..

PROGRAMMING/Algorithm 2021. 2. 8. 18:06

💻 C++ 제출코드 #include #include using namespace std; int count=0; void solution(int sum, int index, int target, deque *arr){ sum += (*arr)[index]; if(index == (*arr).size()) return; if(sum == target) count++; solution(sum - (*arr)[index], index+1, target, arr); solution(sum, index+1, target, arr); } int main(){ int N, S; // N: 정수의 개수, S: 합 scanf("%d %d", &N, &S); deque arr; for(int i=0; i

PROGRAMMING/Algorithm 2021. 2. 5. 02:15

💻 C++ 제출코드 #include #include using namespace std; int answer = 0; void DFS(int sum, int index, int target, vector *numbers){ if(index == (*numbers).size()){ if(sum == target) answer++; return; } DFS(sum + (*numbers)[index], index + 1, target, numbers); DFS(sum - (*numbers)[index], index + 1, target, numbers); } int solution(vector numbers, int target) { DFS(0, 0, target, &numbers); return answer..

PROGRAMMING/Algorithm 2021. 2. 2. 23:57