[关闭]
@baobaobear 2020-03-24T12:13:53.000000Z 字数 6959 阅读 278

练习7

practise

A lnkkerst

  1. #include <iostream>
  2. using namespace std;
  4. int a, b;
  5. char op;
  7. int main() {
  8.     cin >> a >> op >> b;
  9.     if(op == '+') cout << a + b;
  10.     else cout << a - b;
  11.     return 0;
  12. }

B lnkkerst

  1. #include <iostream>
  2. #include <algorithm>
  3. using namespace std;
  5. int a[10], n;
  7. int main() {
  8.     for(int i = 1; i <= 5; ++i)
  9.         cin >> a[i];
  10.     sort(a + 1, a + 6, greater<int >());
  11.     for(int i = 1; i <= 4; ++i)
  12.         cout << a[i] << ' ';
  13.     cout << a[5] << endl;
  14.     return 0;
  15. }

C Kevin7Zz

  1. #include <cstdio>
  2. #include <iostream>
  3. #include <algorithm>
  4. #include <cstring>
  5. #include <queue> //priority_queue 优先队列
  6. #include <map>
  7. #include <set> //multiset  set<int,greater<int>>大到小
  8. #include <vector>// ::iterator it;
  9. #include <stack>
  10. #include <cmath> // auto &Name : STLname  Name.
  11. #include <utility>
  12. #include <sstream>
  13. #include <string>
  14. #define mod 1000000007
  15. #define mod9 998244353
  16. typedef unsigned long long ull;
  17. typedef long long ll;
  18. typedef double db;
  19. const db eps=1e-6;
  20. const int INF = 0x3f3f3f3f;
  21. const ll inf=0x3f3f3f3f3f3f3f3f;
  22. const int N=1e6+8;
  23. inline ll read(){ll s=0,w=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();return s*w;}
  24. using namespace std;
  26. int t,n,m,k,cnt=0,sum=0;
  28. int main(){
  29.     while(scanf("%d",&n)){
  30.         if(n==0) return 0;
  31.         string a[205],ans;
  32.         for(int i=0;i<n;i++){
  33.             cin>>a[i];
  34.         }
  35.         char c;
  36.         int flag=0;
  37.         for(int i=1;i<=a[0].size();i++){
  38.             c=a[0][a[0].size()-i];
  39.             for(int j=1;j<n;j++){
  40.                 if(a[j][a[j].size()-i]!=c){
  41.                     flag=1;
  42.                     break;
  43.                 }
  44.             }
  45.             if(flag==0) ans.insert(ans.begin(),c);
  46.             else break;
  47.         }
  48.         cout<<ans<<endl;
  49.     }
  50.     return 0;
  51. }

D OUHE_csc

  1. #include<iostream>
  2. #include<sstream>
  3. #include<algorithm>
  4. #include<cstring>
  5. #include<cstdio>
  7. using namespace std;
  9. const int N = 1010;
  11. string str;
  12. string a[3] = {"the", "this", "that"};
  13. bool st[3];
  15. bool check(int k)
  16. {
  17.     string s = str;
  18.     for(int i = 0; i < s.size(); i ++)
  19.         if(s[i] >= 'a' and s[i] <= 'z')  s[i] = (s[i] - 'a' + k) % 26 + 'a';
  21.     memset(st, 0, sizeof st);
  22.     stringstream ss(s);
  23.     while(ss >> s)
  24.     {
  25.         //  删掉字母之外的东西
  26.         for(int i = s.size() - 1; i >= 0; i --)
  27.             if(!(s[i] >= 'a' and s[i] <= 'z'))
  28.                 s = s.substr(0, i) + s.substr(i + 1);
  30.         for(int i = 0; i < 3; i ++)
  31.             if(s == a[i])  return true;
  32.     }
  33.     return false;
  34. }
  36. int main()
  37. {
  38.     while(getline(cin, str))
  39.     {
  40.         int k = 0;
  41.         for(k = 0; k < 26; k ++)
  42.             if(check(k))  break;
  44.         for(int i = 0; i < str.size(); i ++)
  45.             if(str[i] >= 'a' and str[i] <= 'z')  
  46.                 str[i] = (str[i] - 'a' + k) % 26 + 'a';
  47.         cout << str << endl;
  48.     }
  49.     return 0;
  50. }

E chromer

Java

  1. import java.util.Scanner;
  2. public class Main
  3. {
  4.         static String tp;
  5.         static String l[]=new String [3];
  6.         static String r[]=new String [3];
  7.         static String a[]=new String [3];
  8.         public static boolean heavy(char jia) {
  9.             String aaa=new String(""+jia);
  10.             for (int i=0; i<3; ++i) {
  11.                 if (l[i].contains(aaa)) {
  12.                     if (a[i].charAt(0) != 'u') 
  13.                         return false;
  14.                 }
  15.                 else if (r[i].contains(aaa)) {
  16.                     if (a[i].charAt(0) != 'd') 
  17.                         return false;
  18.                 }
  19.             }
  20.             return true;
  21.         }
  22.         public static boolean light(char jia) {
  23.             String aaa=new String(""+jia);
  24.             for (int i=0; i<3; ++i) {
  25.                 if (l[i].contains(aaa)) {
  26.                     if (a[i].charAt(0) != 'd') 
  27.                         return false;
  28.                 }
  29.                 else if (r[i].contains(aaa)) {
  30.                     if (a[i].charAt(0) != 'u') 
  31.                         return false;
  32.                 }
  33.             }
  34.             return true;
  35.         }
  36.         public static void main(String args[]) throws Exception
  37.         {
  38.                 Scanner cin=new Scanner(System.in);
  39.                 int n;
  40.                 n=cin.nextInt();
  41.                 for(int q=0; q<n ;++q) {
  42.                     l[0]=cin.next();r[0]=cin.next();a[0]=cin.next();
  43.                     l[1]=cin.next();r[1]=cin.next();a[1]=cin.next();
  44.                     l[2]=cin.next();r[2]=cin.next();a[2]=cin.next();
  45.                     for (char i='A';i<='L'; ++i) {
  46.                         if (heavy(i)) {
  47.                             System.out.println(i+" is the counterfeit coin and it is heavy.");
  48.                             break;
  49.                         }
  50.                         if (light(i)) {
  51.                             System.out.println(i+" is the counterfeit coin and it is light.");
  52.                             break;
  53.                         }
  54.                     }
  55.                 }
  56.                 cin.close();
  57.         }
  58. }

F OUHE_csc

  1. #include<iostream>
  2. #include<sstream>
  3. #include<algorithm>
  4. #include<cstring>
  5. #include<cstdio>
  7. using namespace std;
  9. const int N = 1e6 + 10;
  11. int a[N], q[N];
  13. int main()
  14. {
  15.     int n, m;
  16.     scanf("%d%d", &n, &m);
  18.     int hh = 0, tt = -1;
  19.     for(int i = 1; i <= n; i ++)
  20.     {
  21.         scanf("%d", &a[i]);
  23.         if(hh <= tt and q[hh] < i - m + 1)  hh ++;
  24.         while(hh <= tt and a[q[tt]] >= a[i])  tt --;
  25.         q[++ tt] = i;
  27.         if(i >= m)
  28.         {
  29.             printf("%d", a[q[hh]]);
  30.             if(i < n)  printf(" ");
  31.             else  puts("");
  32.         }
  34.         //for(int j = hh; j <= tt; j ++)  printf("%d ", q[j]);  puts("");
  35.     }
  36.     return 0;
  37. }

G rubbish_is_me

  1. #include<bits/stdc++.h>
  2. #include<iostream>
  3. #include<string.h>
  4. #include<algorithm>
  5. #include<stdio.h>
  6. #include<math.h>
  7. #include<vector>
  8. #include<map>
  9. #include<set>
  10. #include<time.h> 
  11. #include<climits>
  12. #define debug(a) cout << "*" << a << "*" << endl
  13. #define ls  (k << 1)
  14. #define rs  ((k << 1) | 1)
  15. #define mid ((l + r) >> 1)
  16. using namespace std;
  17. typedef long long ll;
  18. ll bas, n, ans;
  19. char s[15];
  20. int prime[11] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31};
  21. ll fg[11], mys[11], fgn[11], num;
  22. void gt()
  23. {
  24.     num = 0;
  25.     memset(fgn, 0, sizeof(fgn));
  26.     memset(mys, 0, sizeof(mys));
  27.     for (int i = 0; i <= 10; i++)
  28.     {
  29.         if (bas % prime[i] == 0)
  30.         {
  31.             fg[num++] = prime[i];
  32.             while (bas % prime[i] == 0)
  33.             {
  34.                 bas /= prime[i];
  35.                 mys[num - 1]++;
  36.             }
  37.         }
  38.     }
  39.     for (int i = 0; i < num; i++)
  40.     {
  42.         ll tp = n;
  43.         while (tp)
  44.         {
  45.             fgn[i] += tp /= fg[i];
  46.         }
  47.         ans = min(ans, (ll)fgn[i] / mys[i]);
  48.     }
  49. }
  50. int main()
  51. {
  52.     while (~scanf("%lld%s", &bas, s) && bas)
  53.     {
  54.         ans = 2000000000000000000;
  55.         n = 0;
  56.         for (int i = 0; s[i]; i++) 
  57.         {
  58.             n = n * bas;
  59.             if (s[i] <= '9')
  60.             {
  61.                 n += s[i] - '0';    
  62.             }   
  63.             else
  64.                 n += s[i] - 'A' + 10;
  65.         }
  66.         gt();
  67.         printf("%lld\n", ans);
  68.     }
  69. }

H OUHE_csc

  1. #include<iostream>
  2. #include<algorithm>
  3. #include<cstring>
  4. #include<cstdio>
  6. using namespace std;
  8. const int N = 1010, INF = 1e9;
  10. int n, m;
  11. int f[N][N];
  13. void init(int n, int m)
  14. {
  15.     for(int i = 1; i <= n; i ++)
  16.     {
  17.         f[i][1] = i;
  18.         for(int j = 2; j <= m; j ++)
  19.         {
  20.             f[i][j] = INF;
  21.             for(int k = 1; k <= i; k ++)
  22.                 f[i][j] = min(f[i][j], max(f[k - 1][j - 1], f[i - k][j]) + 1);
  23.         }
  24.     }
  25. }
  27. int main()
  28. {
  29.     init(1000, 50);
  31.     int t;
  32.     scanf("%d", &t);
  33.     for(int i = 1; i <= t; i ++)
  34.     {
  35.         int n, m;
  36.         scanf("%*d%d%d", &m, &n);
  37.         printf("%d %d\n", i, f[n][m]);
  38.     }
  39.     return 0;
  40. }

I 184215092008

  1. #include <iostream>
  2. #include <stdio.h>
  3. #include <string>
  4. #include <string.h>
  5. #include <math.h>
  6. #include <vector>
  7. #include<map>
  8. #include<queue>
  9. #include <algorithm>
  10. using namespace std;
  11. #define int long long
  13. const int maxn = 1e5+5;
  14. int n,m;
  15. vector<int>e[10];
  16. int vis[10];
  17. int ans = 0;
  18. bool check()
  19. {
  20.     for(int i=1;i<=n;i++)
  21.         if(!vis[i]) return false;
  22.     return true;
  23. }
  24. void dfs(int s)
  25. {
  26.     if(check())
  27.     {
  28.         ans++;
  29.         return ;
  30.     }
  31.     for(int i=0;i<e[s].size();i++)
  32.     {
  33.         if(!vis[e[s][i]])
  34.         {
  35.             vis[e[s][i]]=1;
  36.             dfs(e[s][i]);
  37.             vis[e[s][i]]=0;
  38.         }
  39.     }
  40. }
  41. signed main()
  42. {
  43.     std::ios::sync_with_stdio(false);
  44.     cin>>n>>m;
  45.     for(int i=0,u,v;i<m;i++)
  46.     {
  47.         cin>>u>>v;
  48.         e[u].push_back(v);
  49.         e[v].push_back(u);
  50.     }
  51.     memset(vis,0,sizeof(vis));
  52.     vis[1]=1;
  53.     dfs(1);
  54.     cout<<ans<<endl;
  55.     return 0;
  56. }

J 15291200127

  1. #include <set>
  2. #include <map>
  3. #include <deque>
  4. #include <queue>
  5. #include <stack>
  6. #include <cmath>
  7. #include <ctime>
  8. #include <bitset>
  9. #include <cstdio>
  10. #include <string>
  11. #include <vector>
  12. #include <cstdlib>
  13. #include <cstring>
  14. #include <cassert>
  15. #include <iostream>
  16. #include <algorithm>
  17. #define mem(a,b) memset(a,b,sizeof (a))
  18. #define gcd(a,b) __gcd(a,b)
  19. #define all(a) a.begin(),a.end()
  20. #define sz(s) s.size()
  21. #define endl '\n'
  22. #define pb push_back
  23. typedef long long ll;
  24. const int maxn=100010;
  25. const int inf=1e9;
  26. const ll mod=998244353;
  27. const double pi=3.14159265358979;
  28. const double ep=0.0;
  29. using namespace std;
  30. struct A
  31. {
  32.     int id,val;
  33. }a[maxn],b[maxn];
  34. int r[maxn],r1[maxn],c[maxn],d[maxn];
  35. vector<int>ans[maxn],vec;
  36. set<int>se;
  37. int fd(int x)
  38. {
  39.     return d[x]==x?x:d[x]=fd(d[x]);
  40. }
  41. bool cmp(A a,A b)
  42. {
  43.     if (a.val==b.val)
  44.         return a.id<b.id;
  45.     return a.val<b.val;
  46. }
  47. int main()
  48. {
  49.     int t;
  50.     cin>>t;
  51.     while (t--)
  52.     {
  53.         se.clear();
  54.         int n;
  55.         cin>>n;
  56.         for (int i=1;i<=n;i++)
  57.         {
  58.             cin>>a[i].val;
  59.             a[i].id=i;
  60.             b[i].id=a[i].id;
  61.             b[i].val=a[i].val;
  62.         }
  63.         sort(b+1,b+1+n,cmp);
  64.         for (int i=1;i<=n;i++)
  65.         {
  66.             r[i]=b[i].id;
  67.             r1[b[i].id]=i;
  68.             c[i]=0;
  69.             d[i]=i;
  70.         }
  71.         for (int i=1;i<=n;i++)
  72.         {
  73.             if (sz(se)==0)
  74.             {
  75.                 se.insert(r1[i]);
  76.                 continue;
  77.             }
  78.             auto x=se.lower_bound(r1[i]);
  79.             if (x==se.begin()&&*se.begin()>r1[i])
  80.             {
  81.                 se.insert(r1[i]);
  82.                 continue;
  83.             }
  84.             else
  85.             {
  86.                 x--;
  87.                 int t=*x;
  88.                 d[i]=r[t];
  89.                 c[t]++;
  90.                 if (c[t]>=2)
  91.                     se.erase(t);
  92.                 se.insert(r1[i]);
  93.             }
  94.         }
  95.         for (int i=1;i<=n;i++)
  96.             ans[i].clear();
  97.         vec.clear();
  98.         for (int i=1;i<=n;i++)
  99.         {
  100.             if (d[i]==i)
  101.                 vec.pb(i);
  102.             ans[fd(i)].pb(i);
  103.         }
  104.         cout<<sz(vec)<<endl;
  105.         for (auto i:vec)
  106.         {
  107.             sort(all(ans[i]));
  108.             cout<<sz(ans[i])<<' ';
  109.             for (int j=0;j<sz(ans[i]);j++)
  110.             {
  111.                 if (j==sz(ans[i])-1)
  112.                     cout<<ans[i][j]<<endl;
  113.                 else
  114.                     cout<<ans[i][j]<<' ';
  115.             }
  116.         }
  117.     }
  118.     return 0;
  119. }
添加新批注
在作者公开此批注前，只有你和作者可见。
回复批注