Skip to content

[브루트포스] 9월 10일 #5

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open

[브루트포스] 9월 10일 #5

wants to merge 1 commit into from

Conversation

sua005
Copy link
Collaborator

@sua005 sua005 commented Sep 10, 2024

인적사항

이름: 조수아
학번: 2371060

과제 제출

기존 제출: 1053, 1436, 11723

### 인적사항
이름: 조수아
학번: 2371060

### 과제 제출
기존 제출: 1053, 1436, 11723
Copy link

@avocado8 avocado8 left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

1436, 11723(p3)
수아님 안녕하세요 :3 1436, 11723번 코드리뷰 드렸습니다.
질문이 있으시다면 언제든 편히 리뷰어를 호출해주세요~

#include <string>
using namespace std;

//비트 연산을 수행하는 함수들

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

각 함수 분리 좋아요~👍

}

void toggle(int &BIT, int val) {
BIT ^= (1 << val); //val번째 비트를 반전

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

xor 연산을 사용한 토글 구현 아주 좋았습니다 🤗

int tmp = i;
//현재 숫자에서 '666'이 포함되어 있는지 검사
while (tmp >= 666) {
if (tmp % 1000 == 666) {

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

나머지를 사용해 종말의 수를 찾는 로직을 잘 구현해주셨네요!

Copy link

@mons-trev mons-trev left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

코드리뷰 완료했습니다!
4주차도 너무 고생많으셨습니다😊👍

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants