-
Notifications
You must be signed in to change notification settings - Fork 2
220320~220326 #23
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
wi-seong-cheol
wants to merge
3
commits into
master
Choose a base branch
from
seongcheol
base: master
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
220320~220326 #23
Changes from all commits
Commits
Show all changes
3 commits
Select commit
Hold shift + click to select a range
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
Binary file not shown.
This file contains hidden or 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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,82 @@ | ||
| // | ||
| // 22943.cpp | ||
| // main | ||
| // | ||
| // Created by wi_seong on 2022/03/26. | ||
| // | ||
|
|
||
| #include <iostream> | ||
| #include <cmath> | ||
| #include <vector> | ||
|
|
||
| using namespace std; | ||
| #define ll long long | ||
| int k, m; | ||
| vector<ll> primeNum; | ||
| bool chk1[100001]; | ||
| bool chk2[100001]; | ||
| int vis[10]; | ||
|
|
||
| // 에라토스테네스의 체를 이용한 소수 만들기 | ||
| void primeNumberSeive(int n) { | ||
| vector<bool> isPrime(n + 1); | ||
| for(int i = 2; i <= sqrt(n); i++) { | ||
| if(isPrime[i]) continue; | ||
| for(int j = i * i; j <= n; j += i) | ||
| isPrime[j] = true; | ||
| } | ||
| for(int i = 2; i <= n; i++) | ||
| if(!isPrime[i]) primeNum.push_back(i); | ||
| } | ||
|
|
||
| bool check2(int val) { | ||
| while(val % m ==0) | ||
| val /= m; | ||
| if(chk2[val] == 1) | ||
| return true; | ||
| return false; | ||
| } | ||
|
|
||
| int comb(int cur, int idx, int max, int val) { | ||
| if(idx == max) { | ||
| if(chk1[val] == 1 && check2(val)) | ||
| return 1; | ||
| return 0; | ||
| } | ||
| int ret = 0; | ||
| for(int i = cur; i <= 9; i++) { | ||
| if(idx ==0 && i == 0) | ||
| continue; | ||
| if(vis[i] == 1) | ||
| continue; | ||
| vis[i] = 1; | ||
| ret += comb(cur, idx + 1, max, val * 10 + i); | ||
| vis[i] = 0; | ||
| } | ||
|
|
||
| return ret; | ||
| } | ||
|
|
||
| int main() { | ||
| ios::sync_with_stdio(0); | ||
| cin.tie(0); | ||
|
|
||
| cin >> k >> m; | ||
| primeNumberSeive(m); | ||
|
|
||
| int primeSize = int(primeNum.size()); | ||
| for(int i = 0; i < primeSize; i++) { | ||
| for(int j = i + 1; j < primeSize; j++) { | ||
| if(primeNum[i] + primeNum[j] < 100000) | ||
| chk1[primeNum[i] + primeNum[j]] = 1; | ||
| } | ||
| for(int j = i; j < primeSize; j++) { | ||
| if(primeNum[i] + primeNum[j] < 100000) | ||
| chk2[primeNum[i] * primeNum[j]] = 1; | ||
| } | ||
| } | ||
| int ans = comb(0, 0, 1, 0); | ||
| cout << ans; | ||
|
|
||
| return 0; | ||
| } |
This file contains hidden or 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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,35 @@ | ||
| // | ||
| // 5052.cpp | ||
| // main | ||
| // | ||
| // Created by wi_seong on 2022/03/23. | ||
| // | ||
|
|
||
| #include <iostream> | ||
| #include <string> | ||
| #include <vector> | ||
|
|
||
| using namespace std; | ||
| int n; | ||
| vector<pair<int, string>> v; | ||
|
|
||
| int main() { | ||
| ios::sync_with_stdio(0); | ||
| cin.tie(0); | ||
|
|
||
| int t; cin >> t; | ||
| while(t--) { | ||
| cin >> n; | ||
| bool chk = false; | ||
| for(int i = 0; i < n; i++) { | ||
| string s; cin >> s; | ||
| int len = int(s.length()); | ||
| v.push_back({len, s}); | ||
| } | ||
| for(int i = 0; i < n; i++) | ||
| if(!chk) cout << "YES" << '\n'; | ||
| else cout << "NO" << '\n'; | ||
| } | ||
|
|
||
| return 0; | ||
| } | ||
This file contains hidden or 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
Binary file modified
BIN
+5.08 KB
(110%)
...deproj/project.xcworkspace/xcuserdata/wi_seong.xcuserdatad/UserInterfaceState.xcuserstate
Binary file not shown.
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.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
다시 생각호고
Trie 공부하고 적용해보셈