[케이] 8주차 과제 제출

8주차/10258/10258_cpp_K.cpp

@@ -0,0 +1,33 @@
+#include <bits/stdc++.h>
+#define sz(v) (int)v.size()
+#define int long long
+#define all(v) (v).begin(), (v).end()
+#define press(v) (v).erase(unique(all(v)), (v).end())
+using namespace std;
+typedef pair<int, int> pi;
+typedef pair<int,pi> pii;
+const int MAX = 30+7;
+const int INF = 0x3f3f3f3f3f3f3f3f;
+const int MOD = 1e9 + 7;
+int N,t;
+int32_t main() {
+    cin.tie(0)->sync_with_stdio(0);
+    cin>>t;
+    while(t--){
+        string s;
+        cin>>s;
+        int ans=0,vis[MAX],d[MAX];
+        for (int i = 0; i < sz(s); i++) {
+            vis[i]=0;d[i]=0;
+            if(s[i]=='1')d[i]=1;
+        }
+        for (int i = 0; i < sz(s); i++) {
+            if(d[i]!=vis[i]){
+                ans+=pow(2,sz(s)-i-1);
+                vis[i]=(vis[i]+1)%2;
+                vis[i+1]=(vis[i+1]+1)%2;
+            }
+        }
+        cout<<ans<<"\n";
+    }
+}

8주차/14906/14906_cpp_K.cpp

@@ -0,0 +1,50 @@
+#include <bits/stdc++.h>
+#define sz(v) (int)v.size()
+#define int long long
+#define all(v) (v).begin(), (v).end()
+#define press(v) (v).erase(unique(all(v)), (v).end())
+using namespace std;
+typedef pair<int, int> pi;
+typedef pair<int,pi> pii;
+const int MAX = 1e3+7;
+const int INF = 0x3f3f3f3f3f3f3f3f;
+const int MOD = 1e9 + 7;
+int N;
+bool isSlump(string s){
+    if(sz(s)<2)return false;
+    if(s[0]!='D'&&s[0]!='E')return false;
+    int idx=1;
+    while(s[idx++]=='F');
+    --idx;
+    if(idx==sz(s)-1&&s[idx]=='G')return true;
+    return isSlump(s.substr(idx));
+}
+bool isSlimp(string s){
+    if(sz(s)<2)return false;
+    if(s[0]!='A')return false;
+    if(sz(s)==2)return s=="AH";
+    bool flag= isSlimp(s.substr(2, sz(s)-3));
+    if(flag&&s[1]=='B'&&s[sz(s)-1]=='C')return true;
+    flag= isSlump(s.substr(1,sz(s)-2));
+    return flag&&s[sz(s)-1]=='C';
+}
+int32_t main() {
+    cin.tie(0)->sync_with_stdio(0);
+    cout<<"SLURPYS OUTPUT\n";
+    cin>>N;
+    while(N--){
+        string s;
+        cin>>s;
+        bool flag=false;
+        for (int i = 2; i < sz(s); i++) {
+            string s1=s.substr(0,i);
+            string s2=s.substr(i);
+            if(isSlimp(s1)&& isSlump(s2)){
+                flag=true;
+                break;
+            }
+        }
+        cout<<(flag?"YES":"NO")<<"\n";
+    }
+    cout<<"END OF OUTPUT\n";
+}

8주차/16498/16498_cpp_K.cpp

@@ -0,0 +1,49 @@
+#include <bits/stdc++.h>
+#define sz(v) (int)v.size()
+#define int long long
+#define all(v) (v).begin(), (v).end()
+#define press(v) (v).erase(unique(all(v)), (v).end())
+using namespace std;
+typedef pair<int, int> pi;
+typedef pair<int,pi> pii;
+const int MAX = 1e3+7;
+const int INF = 0x3f3f3f3f3f3f3f3f;
+const int MOD = 1e9 + 7;
+int A,B,C;
+vector<int> v[3];
+int32_t main() {
+    cin.tie(0)->sync_with_stdio(0);
+    cin>>A>>B>>C;
+    int k,ans=INF;
+    for (int i = 0; i < A; i++) {
+        cin>>k;
+        v[0].push_back(k);
+    }
+    for (int i = 0; i < B; i++) {
+        cin>>k;
+        v[1].push_back(k);
+    }
+    for (int i = 0; i < C; i++) {
+        cin>>k;
+        v[2].push_back(k);
+    }
+    for (int i = 0; i < 3; i++) {
+        sort(all(v[i]));
+    }
+    for (int i = 0; i < A; i++) {
+        auto b=lower_bound(all(v[1]),v[0][i]);
+        auto c=lower_bound(all(v[2]),v[0][i]);
+        if(b!=v[1].end() && c!=v[2].end())ans=min(ans,max(*b,*c)-v[0][i]);
+    }
+    for (int i = 0; i < B; i++) {
+        auto a=lower_bound(all(v[0]),v[1][i]);
+        auto c=lower_bound(all(v[2]),v[1][i]);
+        if(a!=v[0].end() && c!=v[2].end())ans=min(ans,max(*a,*c)-v[1][i]);
+    }
+    for (int i = 0; i < C; i++) {
+        auto b=lower_bound(all(v[1]),v[2][i]);
+        auto a=lower_bound(all(v[0]),v[2][i]);
+        if(b!=v[1].end() && a!=v[0].end())ans=min(ans,max(*b,*a)-v[2][i]);
+    }
+    cout<<ans;
+}

8주차/2694/2694_cpp_K.cpp

@@ -0,0 +1,48 @@
+#include <bits/stdc++.h>
+#define sz(v) (int)v.size()
+#define int long long
+#define all(v) (v).begin(), (v).end()
+#define press(v) (v).erase(unique(all(v)), (v).end())
+using namespace std;
+typedef pair<int, int> pi;
+typedef pair<int,pi> pii;
+const int MAX = 1e4+7;
+const int INF = 0x3f3f3f3f3f3f3f3f;
+const int MOD = 1e9 + 7;
+int N,t,a[MAX],p[MAX];
+int32_t main() {
+    cin.tie(0)->sync_with_stdio(0);
+    cin>>t;
+    while(t--){
+        cin>>N;
+        int ans=0;
+        set<int> S;
+        for (int i = 1; i <= N; i++) {
+            cin>>a[i];
+            p[i]=p[i-1]+a[i];
+            S.insert(p[i]);
+        }
+        vector<int> v;
+        for(int i=1;i<=sqrt(p[N]);i++){
+            if((p[N]%i)==0){
+                v.push_back(i);
+                v.push_back(p[N]/i);
+            }
+        }
+        sort(all(v));
+        for (int i:v) {
+            if(p[N]%i)continue;
+            bool flag=true;
+            for (int j = i; j <= p[N]; j+=i) {
+                if(S.count(j)==0){
+                    flag=false;
+                    break;
+                }
+            }
+            if(flag){
+                cout<<i<<"\n";
+                break;
+            }
+        }
+    }
+}

8주차/3865/3865_cpp_K.cpp

@@ -0,0 +1,61 @@
+#include <bits/stdc++.h>
+#define sz(v) (int)v.size()
+#define int long long
+#define all(v) (v).begin(), (v).end()
+#define press(v) (v).erase(unique(all(v)), (v).end())
+using namespace std;
+typedef pair<int, int> pi;
+typedef pair<int,pi> pii;
+const int MAX = 2e3+7;
+const int INF = 0x3f3f3f3f3f3f3f3f;
+const int MOD = 1e9 + 7;
+int N,ans=0;
+vector<int> v[MAX];
+bool vis[MAX];
+void dfs(int cur){
+    vis[cur]=true;
+    if(sz(v[cur])==0){
+        ans++;
+        return;
+    }
+    for(auto i:v[cur]){
+        if(!vis[i]){
+            dfs(i);
+        }
+    }
+}
+int32_t main() {
+    cin.tie(0)->sync_with_stdio(0);
+    while(cin>>N){
+        if(!N)break;
+        map<string,int> m;
+        ans=0;
+        for (int i = 0; i < N*15; i++) {
+            v[i].clear();
+            vis[i]=false;
+        }
+        string s;
+        for (int i = 0; i < N; i++) {
+            cin>>s;
+            string k,group;
+            int g;
+            for (int j = 0; j < sz(s); j++) {
+                if(s[j]==':'){
+                    m.insert({k,sz(m)});
+                    g=m[k];
+                    k="";
+                    continue;
+                }
+                if(s[j]==','||s[j]=='.'){
+                    m.insert({k,sz(m)});
+                    v[g].push_back(m[k]);
+                    k="";
+                    continue;
+                }
+                k+=s[j];
+            }
+        }
+        dfs(0);
+        cout<<ans<<"\n";
+    }
+}