“科大讯飞杯”第18届上海大学程序设计联赛春季赛A-F

“科大讯飞杯”第18届上海大学程序设计联赛春季赛A-F

/ 0评 / 2409次 / 1赞

前六签到

后六自闭

比赛传送门

A. 组队比赛

排序取差

  1. /*
  2. * @Author: Gehrychiang
  3. * @LastEditTime: 2020-04-18 12:03:45
  4. * @Website: www.yilantingfeng.site
  5. * @E-mail: gehrychiang@aliyun.com
  6. */
  7. #pragma GCC optimize(2)
  8. #include <bits/stdc++.h>
  9. using namespace std;
  10. int main()
  11. {
  12. //freopen("","r",stdin);
  13. //freopen("","w",stdout);
  14. int a[4];
  15. for (int i = 0; i < 4; i++)
  16. {
  17. cin >> a[i];
  18. }
  19. sort(a, a + 4);
  20. cout << abs(a[0] + a[3] - a[1] - a[2]) << endl;
  21. //fclose(stdin);
  22. //fclose(stdout);
  23. return 0;
  24. }
/*
 * @Author: Gehrychiang
 * @LastEditTime: 2020-04-18 12:03:45
 * @Website: www.yilantingfeng.site
 * @E-mail: gehrychiang@aliyun.com
 */
#pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
int main()
{
    //freopen("","r",stdin);
    //freopen("","w",stdout);
    int a[4];
    for (int i = 0; i < 4; i++)
    {
        cin >> a[i];
    }
    sort(a, a + 4);
    cout << abs(a[0] + a[3] - a[1] - a[2]) << endl;
    //fclose(stdin);
    //fclose(stdout);
    return 0;
}

B. 每日一报

排序

  1. /*
  2. * @Author: Gehrychiang
  3. * @LastEditTime: 2020-04-18 17:40:50
  4. * @Website: www.yilantingfeng.site
  5. * @E-mail: gehrychiang@aliyun.com
  6. */
  7. //#pragma GCC optimize(2)
  8. #include <bits/stdc++.h>
  9. using namespace std;
  10. struct node
  11. {
  12. string date;
  13. string ser;
  14. double temp;
  15. };
  16. node in[105];
  17. bool comp(node a, node b)
  18. {
  19. if (a.date != b.date)
  20. return a.date > b.date;
  21. else
  22. {
  23. if (a.temp != b.temp)
  24. return a.temp > b.temp;
  25. else
  26. {
  27. return a.ser < b.ser;
  28. }
  29. }
  30. }
  31. int main()
  32. {
  33. //freopen("","r",stdin);
  34. //freopen("","w",stdout);
  35. int n;
  36. cin >> n;
  37. int cnt = 0;
  38. for (int i = 0; i < n; i++)
  39. {
  40. string tmpa, tmpb;
  41. double tmpc;
  42. cin >> tmpa >> tmpb >> tmpc;
  43. if (tmpc >= 38.0)
  44. {
  45. in[cnt].date = tmpa;
  46. in[cnt].ser = tmpb;
  47. in[cnt].temp = tmpc;
  48. cnt++;
  49. }
  50. }
  51. sort(in, in + cnt, comp);
  52. cout << cnt << endl;
  53. for (int i = 0; i < cnt; i++)
  54. {
  55. cout << in[i].date << " " << in[i].ser << " ";
  56. printf("%.1lf\n", in[i].temp);
  57. }
  58. //fclose(stdin);
  59. //fclose(stdout);
  60. return 0;
  61. }
/*
 * @Author: Gehrychiang
 * @LastEditTime: 2020-04-18 17:40:50
 * @Website: www.yilantingfeng.site
 * @E-mail: gehrychiang@aliyun.com
 */
//#pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
struct node
{
    string date;
    string ser;
    double temp;
};
node in[105];
bool comp(node a, node b)
{
    if (a.date != b.date)
        return a.date > b.date;
    else
    {
        if (a.temp != b.temp)
            return a.temp > b.temp;
        else
        {
            return a.ser < b.ser;
        }
    }
}
int main()
{
    //freopen("","r",stdin);
    //freopen("","w",stdout);
    int n;
    cin >> n;
    int cnt = 0;
    for (int i = 0; i < n; i++)
    {
        string tmpa, tmpb;
        double tmpc;
        cin >> tmpa >> tmpb >> tmpc;
        if (tmpc >= 38.0)
        {
            in[cnt].date = tmpa;
            in[cnt].ser = tmpb;
            in[cnt].temp = tmpc;
            cnt++;
        }
    }
    sort(in, in + cnt, comp);
    cout << cnt << endl;
    for (int i = 0; i < cnt; i++)
    {
        cout << in[i].date << " " << in[i].ser << " ";
        printf("%.1lf\n", in[i].temp);
    }
    //fclose(stdin);
    //fclose(stdout);
    return 0;
}

C. 最长非公共子序列

字符串比较即可，如果不相等即最长的非公共子序列即为较长串否则则无非公共子序列

  1. /*
  2. * @Author: Gehrychiang
  3. * @LastEditTime: 2020-04-18 12:30:15
  4. * @Website: www.yilantingfeng.site
  5. * @E-mail: gehrychiang@aliyun.com
  6. */
  7. //#pragma GCC optimize(2)
  8. #include <bits/stdc++.h>
  9. using namespace std;
  10. int main()
  11. {
  12. //freopen("","r",stdin);
  13. //freopen("","w",stdout);
  14. string a, b;
  15. cin >> a;
  16. cin >> b;
  17. if (a != b)
  18. {
  19. cout << max(a.length(), b.length());
  20. }
  21. else
  22. {
  23. cout << -1 << endl;
  24. }
  25. //fclose(stdin);
  26. //fclose(stdout);
  27. return 0;
  28. }
/*
 * @Author: Gehrychiang
 * @LastEditTime: 2020-04-18 12:30:15
 * @Website: www.yilantingfeng.site
 * @E-mail: gehrychiang@aliyun.com
 */
//#pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
int main()
{
    //freopen("","r",stdin);
    //freopen("","w",stdout);
    string a, b;
    cin >> a;
    cin >> b;
    if (a != b)
    {
        cout << max(a.length(), b.length());
    }
    else
    {
        cout << -1 << endl;
    }
    //fclose(stdin);
    //fclose(stdout);
    return 0;
}

D. 最大字符集

找个小规律

对\(n>=3\)时

  1. 1 1
  2. 1 0 1
  3. 1 0 0 1
  4. 1 0 0 0 1
  5. 1 0 0 0 0 1
  6. ……
1 1
1 0 1
1 0 0 1
1 0 0 0 1
1 0 0 0 0 1
……

必然不存在子串在集合当中

而当\(n<=2\)时，特判即可

  1. /*
  2. * @Author: Gehrychiang
  3. * @LastEditTime: 2020-04-18 14:30:30
  4. * @Website: www.yilantingfeng.site
  5. * @E-mail: gehrychiang@aliyun.com
  6. */
  7. //#pragma GCC optimize(2)
  8. #include <bits/stdc++.h>
  9. using namespace std;
  10. int main()
  11. {
  12. //freopen("","r",stdin);
  13. //freopen("","w",stdout);
  14. int n;
  15. cin >> n;
  16. if (n == 1)
  17. {
  18. cout << 1 << endl;
  19. cout << 1 << endl;
  20. }
  21. else if (n == 2)
  22. {
  23. cout << 2 << endl;
  24. cout << 0 << endl;
  25. cout << 11 << endl;
  26. }
  27. else
  28. {
  29. cout << n - 1 << endl;
  30. for (int i = 2; i <= n; i++)
  31. {
  32. for (int p = 0; p < i; p++)
  33. {
  34. if (p == 0 || p == i - 1)
  35. {
  36. cout << 1;
  37. }
  38. else
  39. {
  40. cout << 0;
  41. }
  42. }
  43. cout << endl;
  44. }
  45. }
  47. //fclose(stdin);
  48. //fclose(stdout);
  49. return 0;
  50. }
/*
 * @Author: Gehrychiang
 * @LastEditTime: 2020-04-18 14:30:30
 * @Website: www.yilantingfeng.site
 * @E-mail: gehrychiang@aliyun.com
 */
//#pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
int main()
{
    //freopen("","r",stdin);
    //freopen("","w",stdout);
    int n;
    cin >> n;
    if (n == 1)
    {
        cout << 1 << endl;
        cout << 1 << endl;
    }
    else if (n == 2)
    {
        cout << 2 << endl;
        cout << 0 << endl;
        cout << 11 << endl;
    }
    else
    {
        cout << n - 1 << endl;
        for (int i = 2; i <= n; i++)
        {
            for (int p = 0; p < i; p++)
            {
                if (p == 0 || p == i - 1)
                {
                    cout << 1;
                }
                else
                {
                    cout << 0;
                }
            }
            cout << endl;
        }
    }

    //fclose(stdin);
    //fclose(stdout);
    return 0;
}

E. 美味的序列

水公式

最终结果为\(sum-(n*(n-1)/2)\)

容易理解，每选一个的时候其余的均会减少\(1\)个单位，全局来看求和即可

  1. /*
  2. * @Author: Gehrychiang
  3. * @LastEditTime: 2020-04-18 12:28:54
  4. * @Website: www.yilantingfeng.site
  5. * @E-mail: gehrychiang@aliyun.com
  6. */
  7. //#pragma GCC optimize(2)
  8. #include <bits/stdc++.h>
  9. using namespace std;
  10. int main()
  11. {
  12. //freopen("","r",stdin);
  13. //freopen("","w",stdout);
  14. long long n;
  15. cin >> n;
  16. long long sum = 0;
  17. for (int i = 0; i < n; i++)
  18. {
  19. long long tmp;
  20. cin >> tmp;
  21. sum += tmp;
  22. }
  23. sum -= (n * (n - 1)) / 2;
  24. cout << sum << endl;
  25. //fclose(stdin);
  26. //fclose(stdout);
  27. return 0;
  28. }
/*
 * @Author: Gehrychiang
 * @LastEditTime: 2020-04-18 12:28:54
 * @Website: www.yilantingfeng.site
 * @E-mail: gehrychiang@aliyun.com
 */
//#pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
int main()
{
    //freopen("","r",stdin);
    //freopen("","w",stdout);
    long long n;
    cin >> n;
    long long sum = 0;
    for (int i = 0; i < n; i++)
    {
        long long tmp;
        cin >> tmp;
        sum += tmp;
    }
    sum -= (n * (n - 1)) / 2;
    cout << sum << endl;
    //fclose(stdin);
    //fclose(stdout);
    return 0;
}

F. 日期小助手

推规律

次年的节日会在今年的基础上\(-1\)如果遇到闰年则额外\(-1\)，考虑到第二周一定\(>=7\)，第三周一定\(>=14\)，如小于则补偿一周即可

  1. /*
  2. * @Author: Gehrychiang
  3. * @LastEditTime: 2020-04-18 17:47:01
  4. * @Website: www.yilantingfeng.site
  5. * @E-mail: gehrychiang@aliyun.com
  6. */
  7. //#pragma GCC optimize(2)
  8. #include <bits/stdc++.h>
  9. using namespace std;
  10. int init[500][2];
  11. bool chk(int a)
  12. {
  13. if (a % 100 == 0 && a % 400 == 0)
  14. {
  15. return true;
  16. }
  17. else if (a % 100 != 0 && a % 4 == 0)
  18. {
  19. return true;
  20. }
  21. else
  22. {
  23. return false;
  24. }
  25. }
  26. int main()
  27. {
  28. //freopen("","r",stdin);
  29. //freopen("","w",stdout);
  30. init[2000 - 2000][0] = 14;
  31. init[2000 - 2000][1] = 18;
  32. for (int i = 2001; i <= 2105; i++)
  33. {
  34. init[i - 2000][0] = init[i - 2000 - 1][0] - 1;
  35. init[i - 2000][1] = init[i - 2000 - 1][1] - 1;
  36. if (chk(i))
  37. {
  38. init[i - 2000][0]--;
  39. init[i - 2000][1]--;
  40. }
  41. if (init[i - 2000][0] <= 7)
  42. {
  43. init[i - 2000][0] += 7;
  44. }
  45. if (init[i - 2000][1] <= 14)
  46. {
  47. init[i - 2000][1] += 7;
  48. }
  49. }
  50. int t;
  51. cin >> t;
  52. while (t--)
  53. {
  54. int yy, mm, dd;
  55. cin >> yy >> mm >> dd;
  56. if ((mm == 5 && init[yy - 2000][0] <= dd) || (mm == 6 && init[yy - 2000][1] > dd))
  57. {
  58. //父亲节
  59. if (init[yy - 2000][1] == 21)
  60. {
  61. printf("Father's Day: June 21st, %d\n", yy);
  62. }
  64. else if (init[yy - 2000][1] == 22)
  65. {
  66. printf("Father's Day: June 22nd, %d\n", yy);
  67. }
  68. else if (init[yy - 2000][1] == 23)
  69. {
  70. printf("Father's Day: June 23rd, %d\n", yy);
  71. }
  72. else
  73. {
  74. printf("Father's Day: June %dth, %d\n", init[yy - 2000][1], yy);
  75. }
  76. }
  77. else
  78. {
  79. //母亲节
  80. if (mm >= 6)
  81. {
  82. yy++; //次年
  83. }
  84. printf("Mother's Day: May %dth, %d\n", init[yy - 2000][0], yy);
  85. }
  86. }
  87. //fclose(stdin);
  88. //fclose(stdout);
  89. return 0;
  90. }
/*
 * @Author: Gehrychiang
 * @LastEditTime: 2020-04-18 17:47:01
 * @Website: www.yilantingfeng.site
 * @E-mail: gehrychiang@aliyun.com
 */
//#pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
int init[500][2];
bool chk(int a)
{
    if (a % 100 == 0 && a % 400 == 0)
    {
        return true;
    }
    else if (a % 100 != 0 && a % 4 == 0)
    {
        return true;
    }
    else
    {
        return false;
    }
}
int main()
{
    //freopen("","r",stdin);
    //freopen("","w",stdout);
    init[2000 - 2000][0] = 14;
    init[2000 - 2000][1] = 18;
    for (int i = 2001; i <= 2105; i++)
    {
        init[i - 2000][0] = init[i - 2000 - 1][0] - 1;
        init[i - 2000][1] = init[i - 2000 - 1][1] - 1;
        if (chk(i))
        {
            init[i - 2000][0]--;
            init[i - 2000][1]--;
        }
        if (init[i - 2000][0] <= 7)
        {
            init[i - 2000][0] += 7;
        }
        if (init[i - 2000][1] <= 14)
        {
            init[i - 2000][1] += 7;
        }
    }
    int t;
    cin >> t;
    while (t--)
    {
        int yy, mm, dd;
        cin >> yy >> mm >> dd;
        if ((mm == 5 && init[yy - 2000][0] <= dd) || (mm == 6 && init[yy - 2000][1] > dd))
        {
            //父亲节
            if (init[yy - 2000][1] == 21)
            {
                printf("Father's Day: June 21st, %d\n", yy);
            }

            else if (init[yy - 2000][1] == 22)
            {
                printf("Father's Day: June 22nd, %d\n", yy);
            }
            else if (init[yy - 2000][1] == 23)
            {
                printf("Father's Day: June 23rd, %d\n", yy);
            }
            else
            {
                printf("Father's Day: June %dth, %d\n", init[yy - 2000][1], yy);
            }
        }
        else
        {
            //母亲节
            if (mm >= 6)
            {
                yy++; //次年
            }
            printf("Mother's Day: May %dth, %d\n", init[yy - 2000][0], yy);
        }
    }
    //fclose(stdin);
    //fclose(stdout);
    return 0;
}

发表回复

您的邮箱地址不会被公开。 必填项已用 * 标注

你好 No.99205