Codeforces 656 B. Scrambled（April Fools Day Contest 2016）

传送门

B. Scrambled

time limit per test

2 seconds

memory limit per test

64 megabytes

input

standard input

output

standard output

Btoh yuo adn yuor roomatme lhoate wianshg disehs, btu stlil sdmoeboy msut peorrfm tihs cohre dialy. Oen dya yuo decdie to idourtcne smoe syestm. Yuor rmmotaoe sstgegus teh fooniwllg dael. Yuo argee on tow arayrs of ientgres M adn R, nmebur upmicnog dyas (induiclng teh cunrret oen) wtih sicsescuve irnegets (teh ceurrnt dya is zreo), adn yuo wsah teh diehss on dya D if adn olny if terhe etsixs an iednx i scuh taht D mod M[i] = R[i], otwsehrie yuor rmootmae deos it. Yuo lkie teh cncepot, btu yuor rmotaome's cuinnng simle meaks yuo ssecupt sthnoemig, so yuo itennd to vefriy teh fnerisas of teh aemnrgeet.

Yuo aer geivn ayarrs M adn R. Cuaclatle teh pceanregte of dyas on wchih yuo edn up dnoig teh wisahng. Amsuse taht yuo hvae iiiftlneny mnay dyas aehad of yuo.

Input

The first line of input contains a single integer N (1 ≤ N ≤ 16).

The second and third lines of input contain N integers each, all between 0 and 16, inclusive, and represent arrays M and R, respectively. All M[i] are positive, for each i R[i] < M[i].

Output

Output a single real number. The answer is considered to be correct if its absolute or relative error does not exceed 10 - 4.

Examples

input

1
2
0

output

0.500000

input

2
2 3
1 0

output

0.666667

题目大意：

这个看的确实有点问题，当时看到这道题的时候，当时我就一脸懵比，这是啥呀，一点也看不懂（原谅我英语太渣）这些单词都是串的，真是愚人呀/笑cry，大体上意思就是，erhe etsixs an iednx i scuh taht D mod M[i] = R[i]，这句话有点用，其他的都没有用，所以我们就是求一个D MOD M[i] = R[i],最后除以一个数，

这个数是啥我也不知道，我就是除以了 1e6+5， 很幸运我成功了，后来我试了试，其实没有具体的数，除以720720

也行，1e6也行...

解题思路：

其实在上边已经说的差不多了，只要看懂了题意题目还是挺简单的...

My Code：

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
typedef long long LL;
const int MAXN = 1e6+10;
int r[20],m[20];
int main()
{
    int n;
    while(cin>>n)
    {
        for(int i=0; i<n; i++)
            cin>>m[i];
        for(int i=0; i<n; i++)
            cin>>r[i];
        int sum = 0;
        for(int i=0; i<MAXN; i++)
        {
            for(int j=0; j<n; j++)
            {
                if(i%m[j] == r[j])
                {
                    sum++;
                    break;
                }
            }
        }
        printf("%.8lf\n",1.0*sum/(1.0*MAXN));
    }
    return 0;
}