zoukankan      html  css  js  c++  java
  • cf584DDima and Lisa(素数性质,三素数,哥德巴赫猜想)

    题目链接

    Dima loves representing an odd number as the sum of multiple primes, and Lisa loves it when there are at most three primes. Help them to represent the given number as the sum of at most than three primes.

    More formally, you are given an odd numer n. Find a set of numbers pi (1 ≤ i ≤ k), such that

    1. 1 ≤ k ≤ 3
    2. pi is a prime

    The numbers pi do not necessarily have to be distinct. It is guaranteed that at least one possible solution exists.

    Input

    The single line contains an odd number n (3 ≤ n < 109).

    Output

    In the first line print k (1 ≤ k ≤ 3), showing how many numbers are in the representation you found.

    In the second line print numbers pi in any order. If there are multiple possible solutions, you can print any of them.

    #include<iostream>
    #include<cstdio>
    #include<algorithm>
    #include<cmath>
    #include<utility>
    #include<cstring>
    #include<string>
    #include<vector>
    #include<stack>
    #include<set>
    #include<map>
    #include<bitset>
    #define inf 0x3f3f3f3f
    using namespace std;
    typedef long long ll;
    typedef pair<int,int> pll;
    const int maxn=1e5+10;
    const int mod =1e9+7;
    char s1[maxn],s2[maxn],s3[maxn];
    int v[26];
    int main()
    {
        ios::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);
        int n,t;
        string s;
        cin >> n >> t;
        int ans=n-t;
        cin >> s1+1;
        cin >> s2+1;
        int num=0;
        for(int i=1;i<=n;i++)
        {
            if(num>=ans)
                break;
            if(s1[i]==s2[i])
            {
                s3[i]=s1[i];
                num++;
            }
     
        }
        ans=ans-num;
        int num1=ans,num2=ans;
        for(int i=1;i<=n;i++)
        {
            if(!num1)
                break;
            if(s1[i]!=s3[i])
            {
                num1--;
                s3[i]=s1[i];
            }
        }
        for(int i=1;i<=n;i++)
        {
            if(!num2)
                break;
            if(s3[i]<'a'||s3[i]>'z')
            {
               num2--;
               s3[i]=s2[i];
            }
        }
        if(num1>0||num2>0)
            cout << -1 << endl;
        else
        {
            for(int i=1;i<=n;i++)
            {
                if(s3[i]>='a'&&s3[i]<='z')
                    cout <<s3[i];
                else
                {
                    for(int j=0;j<26;j++)
                    {
                        char c=j+'a';
                        if(c!=s1[i]&&c!=s2[i])
                        {
                            cout << c;
                            break;
                        }
                    }
                }
            }
        }
        return 0;
    }
  • 相关阅读:
    Android activity生命周期
    Android ListView用法
    Android TextWatcher的使用方法(监听ExitText的方法)
    Android EditText禁止换行键(回车键enter)
    Android 数据存储-文件读写操作
    Android Spinner组件的使用方法
    IntelliJ IDEA下maven Spring MVC配置
    MyBatis配置文件中报错:URI is not registered(Settings | Languages & Frameworks | Schemas and DTDs)
    Eclipse下创建Spring MVC web程序--非maven版
    C# 时间与时间戳互转
  • 原文地址:https://www.cnblogs.com/wjc2021/p/12297330.html
Copyright © 2011-2022 走看看