Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Goldchae
approved these changes
Oct 1, 2023
| vector<int> answer=mine(g, B); | ||
|
|
||
| //출력 | ||
| cout<<answer[0]<<" "<<answer[1]; |
Comment on lines
+56
to
+59
| ans[0]=s; | ||
| ans[1]=g[0]; | ||
|
|
||
| return ans; |
Comment on lines
+22
to
+50
| if(insert_count<=delete_count){ | ||
| if(insert_count<=B){ | ||
| for(int i=0; i<g.size(); i++){ | ||
| if(g[i]==min){ | ||
| g[i]++; | ||
| s++; | ||
| B--; | ||
| } | ||
| } | ||
| } | ||
| else{ | ||
| for(int i=0; i<g.size(); i++){ | ||
| if(g[i]==max){ | ||
| g[i]--; | ||
| s+=2; | ||
| B++; | ||
| } | ||
| } | ||
| } | ||
| } | ||
| else{ | ||
| for(int i=0; i<g.size(); i++){ | ||
| if(g[i]==max){ | ||
| g[i]--; | ||
| s+=2; | ||
| B++; | ||
| } | ||
| } | ||
| } |
chae-jpg
approved these changes
Oct 1, 2023
Comment on lines
+35
to
+39
| if(in[i]>0){ | ||
| for(int j=0; j<in[i]/2; j++){ | ||
| p[left]=p[right]=i+'A'; | ||
| left++; right--; | ||
| } |
There was a problem hiding this comment.
반복 한 번에 앞과 뒤에 동시에 문자를 붙이면서 팰린드롬을 만들어주셨네요! 깔끔합니다👍
| } | ||
| } | ||
| } | ||
| if(odd==1) p[str.size()/2]=odd_index+'A'; |
There was a problem hiding this comment.
P3
알튜비튜에서는 협업 시 수정을 편리하게 하기 위해서 한 줄이어도 중괄호를 붙이는 것을 권장하고 있습니다!
중괄호까지 붙여주시면 정말 좋을 것 같아요👍
| } | ||
|
|
||
| //연산 | ||
| ans=in[n-1];//이거 초기화 안해줬더니 79%에서 틀림 |
There was a problem hiding this comment.
맞아요! 초기화를 하지 않으면 정답이 나오지 않을 거에요.
왜 그런 결과가 나왔는지 생각해보시는 것도 좋을 것 같아요!
| //연산 | ||
| ans=in[n-1];//이거 초기화 안해줬더니 79%에서 틀림 | ||
| for(int i=n-1; i>=0; i--){ | ||
| if(ans<in[i]) ans=in[i]; |
Comment on lines
+25
to
+32
| for(int i=n-1; i>=0; i--){ | ||
| if(ans<in[i]) ans=in[i]; | ||
| else if(ans>in[i]){ //in[i]와 가장 가까운 배수로 초기화 | ||
| if(ans%in[i]){ | ||
| ans=((ans/in[i])+1)*in[i];//이렇게 안하고 for문으로 하니까 시간초과 | ||
| } | ||
| } | ||
| } |
Comment on lines
+27
to
+29
| if(odd>1) { | ||
| cout<<"I'm Sorry Hansoo"; | ||
| } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
인적사항
학번 : 2271092
이름 : 이한선
과제제출
기존 제출 : 18111, 1213, 17451
추가제출 :