zufe17届程序设计竞赛总结

1~8题全是水题，话不多说，直接上代码；

#include<iostream>

#include<iomanip>

#include<cstdio>

#include<string>

#include<string.h>

#include<algorithm>

#include<queue>

#include<stack>

#include<functional>

#include<cmath>

using namespace std;

int main()

{

    int T;

    cin>>T;

    while(T--)

    {

        int n;cin>>n;

        if(n<0)

            cout<<"-1";

        else if(n==0) cout<<0;

        else cout<<1;

        cout<<endl;

    }

    return 0;

}

#include<iostream>

#include<iomanip>

#include<cstdio>

#include<string>

#include<string.h>

#include<algorithm>

#include<queue>

#include<stack>

#include<functional>

#include<cmath>

using namespace std;

int main()

{

    int T;

    cin>>T;

    while(T--)

    {

        int n;cin>>n;

        cout<<2*n<<endl;

    }

    return 0;

}

#include<iostream>

#include<iomanip>

#include<cstdio>

#include<string>

#include<string.h>

#include<algorithm>

#include<queue>

#include<stack>

#include<functional>

#include<cmath>

using namespace std;

int main()

{

    int T;

    cin>>T;

    while(T--)

    {

        int n;cin>>n;

        cout<<'2';

        for(int i=1;i<=n;i++)

            cout<<'3';

        cout<<endl;

    }

    return 0;

}

#include<iostream>

#include<iomanip>

#include<cstdio>

#include<string>

#include<string.h>

#include<algorithm>

#include<queue>

#include<stack>

#include<functional>

#include<cmath>

using namespace std;

int main()

{

    int T;

    cin>>T;

    while(T--)

    {

        int n,m;cin>>n>>m;

        cout<<m*n<<endl;

        for(int i=1;i<=n;i++)

        {

            for(int j=1;j<=m;j++)

            {

                if(i%2==1)

                {

                    if(j%2==1)

                        cout<<'*';

                    else cout<<'-';

                }

                else

                {

                    if(j%2==1)

                        cout<<'-';

                    else

                        cout<<'*';

                }

            }

            cout<<endl;

        }

 

    }

    return 0;

}

#include<iostream>

#include<iomanip>

#include<cstdio>

#include<string>

#include<string.h>

#include<algorithm>

#include<queue>

#include<stack>

#include<functional>

#include<cmath>

using namespace std;

int main()

{

    int T;

    cin>>T;

    while(T--)

    {

        int sum=0;

        int n,k;cin>>n>>k;

        for(int i=1;i<=n;i++)

        {

            int t;cin>>t;int s=0;

            while(t>0)

            {

                t=t/k;

                s++;

            }

            sum=sum+s;

        }

        cout<<sum<<endl;

    }

    return 0;

}

 

这题压根不用转，直接算；

#include<iostream>

#include<iomanip>

#include<cstdio>

#include<string>

#include<string.h>

#include<algorithm>

#include<queue>

#include<stack>

#include<functional>

#include<cmath>

using namespace std;

int main()

{

    int T;

    cin>>T;

    while(T--)

    {

        int n;cin>>n;

        int a[55];int c=0;

        for(int i=1;i<=n;i++)

        {

            int t;cin>>t;

            bool b=0;

            if(t<2) b=1;

            for(int j=2;j<t;j++)

            {

                if(t%j==0)

                {

                    b=1;break;

                }

            }

            if(b==0)

            {

                a[c]=t;c++;

            }

        }

        sort(a,a+c); int s=0;

        for(int i=0;i<c;i++)

        {

            for(int j=i+1;j<c;j++)

            {

                for(int k=j+1;k<c;k++)

                {

                    if(i==j||i==k||j==k) continue;

                    if(a[i]+a[j]>a[k]) s++;

                }

            }

        }

        cout<<s<<endl;

    }

    return 0;

}

#include<iostream>

#include<iomanip>

#include<cstdio>

#include<string>

#include<string.h>

#include<algorithm>

#include<queue>

#include<stack>

#include<functional>

#include<cmath>

using namespace std;

int main()

{

    int T;

    cin>>T;

    while(T--)

    {

        int n,m;cin>>n>>m;

        char a[101];

        for(int i=1;i<=n;i++)

            cin>>a[i];

        bool q=0;

        for(int i=1;i<=n-m+1;i++)

        {

            if(a[i]==a[i+m-1])

            {

                bool b=0;

                for(int j=i,k=i+m-1;j<k;j++,k--)

                {

                    if(a[j]!=a[k])

                    {

                        b=1;break;

                    }

                }

                if(b==0)

                {

                    cout<<"YES";q=1;break;

                }

            }

        }

        if(q==0) cout<<"NO";

        cout<<endl;

    }

    return 0;

}

 

 

 

#include<iostream>

#include<iomanip>

#include<cstdio>

#include<string>

#include<string.h>

#include<algorithm>

#include<queue>

#include<stack>

#include<functional>

#include<cmath>

using namespace std;

int main()

{

    int T;cin>>T;

    while(T--)

    {

        int n,k;cin>>n>>k;

        int h[1002],w[1002];

        for(int i=0;i<n;i++)

            cin>>h[i];

        for(int i=0;i<n;i++)

            cin>>w[i];

        int a[1002];

        for(int i=0;i<n;i++)

            a[i]=h[i]-w[i];

        sort(a,a+n); int x1=0,x2=0;

        for(int i=0;i<k;i++)

        {

            x1=x1+a[i];

        }

        for(int i=n-1;i>=n-k;i--)

            x2=x2+a[i];

        x1=abs(x1);x2=abs(x2);

        cout<<max(x1,x2)<<endl;

    }

    return 0;

}




 

#include<iostream>

#include<iomanip>

#include<cstdio>

#include<string>

#include<string.h>

#include<algorithm>

#include<queue>

#include<stack>

#include<functional>

#include<cmath>

using namespace std;

int main()

{

    int T;

    cin>>T;

    while(T--)

    {

        long long a[1002],b[1002];

        int n;cin>>n;

        for(int i=1;i<=n;i++)

            cin>>a[i];

        bool t=0;

        long long c[1002];

        for(int i=1;i<=n;i++)

        {

            cin>>b[i];if(b[i]<a[i]) t=1;

            c[i]=b[i]-a[i];

        }

        if(t==1)

        {

            cout<<"NO"<<endl;continue;

        }

        long long sum=0;c[0]=0;

        for(int i=1;i<=n;i++)

        {

            if(c[i]>c[i-1]) sum=sum+c[i]-c[i-1];

        }

        cout<<sum<<endl;

    }

    return 0;

}

 

#include<iostream>

#include<string>

#include<cmath>

#include<string.h>

#include<algorithm>

int a[1002][1002], b[1002][1002];

using namespace std;

int main()

{

    int T; cin >> T;

    while (T--)

    {

        int n, m; cin >> n >> m;

        int x, y, k;

        cin >> x >> y >> k;

        memset(b, 0, sizeof(b));

        memset(a, 0, sizeof(a));

        for (int i = 1; i <= n; i++)

        {

            for (int j = 1; j <= m; j++)

            {

                b[i][j] = (abs(i - x) + abs(j - y))*k;

            }

        }

        int t = -1; bool p = 0;

        for (int i = 1; i <= n; i++)

        {

            if (i % 2 == 1)

            {

                for (int j = 1; j <= m; j++)

                {

                    t++, a[i][j] = t;

                    if (a[i][j] >= b[i][j])

                    {

                        cout << a[i][j]; p = 1; break;

                    }

                }

            }

            else

            {

                for (int j = m; j >= 1; j--)

                {

                    t++; a[i][j] = t;

                    if (a[i][j] >= b[i][j])

                    {

                        cout << a[i][j]; p = 1; break;

                    }

                }

            }

            if (p == 1) break;

        }

        if (p == 0) cout << "Oh_Silly_Jelly";

        cout << endl;

    }

    return 0;

}

看似是dfs 实则不是；

#include<iostream>

#include<string.h>

#include<algorithm>

int a[51][51][1001], b[51][51];

using namespace std;

int main()

{

    int T; cin >> T;

    while (T--)

    {

        memset(a, 0, sizeof(a));

        int n, m, k;

        cin >> n >> m >> k;

        for (int i = 1; i <= n; i++)

            for (int j = 1; j <= m; j++)

                cin >> b[i][j];

        a[1][1][b[1][1]] = 1; int sum = 0;

        for (int i = 1; i <= n; i++)

        {

            for (int j = 1; j <= m; j++)

            {

                if (i > 1&&b[i][j]!=-1)

                {

                    for (int s = 0; s <= k; s++)

                    {

                        if (a[i - 1][j][s])

                        {

                            a[i][j][s + b[i][j]] =(a[i][j][s+b[i][j]]+ a[i - 1][j][s])%19260817;

                        }

                    }

                }

                if (j > 1 && b[i][j] != -1)

                {

                    for (int s = 0; s <= k; s++)

                    {

                        if (a[i][j - 1][s])

                        {

                            a[i][j][s + b[i][j]] =(a[i][j][s+b[i][j]]+ a[i][j - 1][s])%19260817;

                        }

                    }

                }

                sum = (sum + a[i][j][k]) % 19260817;

            }

        }

        cout << sum << endl;

    }

    return 0;

}

bfs内存超，dfs时间超，无奈；

#include<iostream>

#include<string>

#include<cmath>

#include<string.h>

#include<algorithm>

int b[1002][1002];

using namespace std;

int main()

{

    int T; cin >> T;

    while (T--)

    {

        double r1, r2, s;

        cin >> r1 >> r2 >> s;

        double r=abs(r1-r2), l = r1 + r2;

        while (l-r>0.000001)

        {

            double p = (r + l) / 2;

            double co1 = (r1*r1 + p*p - r2*r2) / (2 * p*r1), co2 = (r2*r2 + p*p - r1*r1) / (2 * p*r2);

            double th1 = 2*acos(co1), th2 = 2*acos(co2);

            double s1 = (th1*r1*r1 + th2*r2*r2)/2;

            double L1 = (r1 + r2 + p)/2;

            double s2 = sqrt(L1*(L1 - r1)*(L1 - r2)*(L1 - p))*2;

            double S = s1 - s2;

            if (S > s+0.000001) r = p;

            else l= p;

        }

        cout << (int)r << endl;

    }

    return 0;

}

又被忽悠了一回，一直在找公式。虽然也想到了二分，但没敢做。

最后一题我就先放这，以我这菜鸡水平就不瞎几把乱搞啦。