poj3318

最新推荐文章于 2018-12-20 22:18:16 发布

zhengnanlee

最新推荐文章于 2018-12-20 22:18:16 发布

阅读量1.6k

点赞数

分类专栏：代数论文章标签： ACM题解报告

本文链接：https://blog.csdn.net/zhengnanlee/article/details/12447825

版权

代数论专栏收录该内容

6 篇文章 0 订阅

订阅专栏

随机化算法？扯淡题。。本来想分析一下蒙特卡洛方法的概率，分析来分析去，这个题的测试数据太扯淡了，不能说水，简直是扯淡！

#include <iostream>
#include <time.h>

using namespace std;

#define LL int
#define MAXN 505

LL a[3][MAXN][MAXN];
int n;

void debug(LL a[3][MAXN][MAXN], int layer)
{
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            cout << a[layer][i][j] << '\t';
        }
        cout << endl;
    }
    cout << endl;
    return;
}

int main()
{
    while (cin >> n)
    {
        for (int k = 0; k < 3; k++)
        {
            for (int i = 0; i < n; i++)
            {
                for (int j = 0; j < n; j++)
                {
                    scanf("%d", &a[k][i][j]);//cin挂成狗
                }
            }
        }
        bool flag = true;
        int testtime = 90000;
        srand((unsigned) time(NULL));//不能放在for循环里面
        while (testtime--)
        {
            int i = (rand()) % n;
            int j = (rand()) % n;
            LL mul = 0;
            for (int k = 0; k < n; k++)
            {
                mul += a[0][i][k] * a[1][k][j];
            }
            if (mul != a[2][i][j])
            {
                flag = false;
                break;
            }
        }
        if (!flag)
            cout << "NO" << endl;
        else
            cout << "YES" << endl;
    }
}

测试蒙特卡洛方法概率的程序如下，大概测试n*n次就可以了，但是实际上，在n*n的矩阵里面，有一个错误的元素，概率大概为0.6，有两个错误的元素，概率大概为0.85，三个错误元素，概率大概为0.95（以上测试数据在n*n次测试下）。

#include <iostream>
#include <time.h>

using namespace std;

#define LL long long
#define MAXN 505

LL a[3][MAXN][MAXN];
int n;

void debug(LL a[3][MAXN][MAXN], int layer)
{
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < n; j++)
        {
            cout << a[layer][i][j] << '\t';
        }
        cout << endl;
    }
    cout << endl;
    return;
}

int main()
{

    while (cin >> n)
    {

        for (int k = 0; k < 3; k++)
        {
            for (int i = 0; i < n; i++)
            {
                for (int j = 0; j < n; j++)
                {
                    scanf("%d",&a[k][i][j]);
                }
            }
        }
        int correct, wrong;
        correct = wrong = 0;
        srand((unsigned) time(NULL));
        for (int ts = 0; ts < 100; ts++)
        {
            bool flag = true;
            int testtime = 90000;
            while (testtime--)
            {
                int i = (rand()) % n;
                int j = (rand()) % n;
                LL mul = 0;
                for (int k = 0; k < n; k++)
                {
                    mul += a[0][i][k] * a[1][k][j];
                }
                if (mul != a[2][i][j])
                {
                    flag = false;
                    break;
                }
            }
            if (!flag)
                wrong++;
            //cout << "NO" << endl;
            else
                correct++;
            //cout << "YES" << endl;
        }
        cout << wrong *1.0 / ((wrong + correct)*1.0) << endl;
    }
}

结论：没意思的题。