April Fools Day Contest 2016

挺有意思的比赛 ，然而我现在只做出了B题；

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

题目的意思大概就是当存在D mod M[i] = R[i] 的 时候他洗碗，不然他室友洗碗，求他洗碗的概率；

幸好我英语5.9级；

不然这鬼题目谁看的懂啊2333333；

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;
int r[100];
int m[100];

int gcd (int m,int n)
{
    int x=m*n;
int flag;
while(n>0)
{
flag=m%n;
m=n;
n=flag;

}

return x/m;
}
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
       int i;
       int maxn=1;
       for(i=1;i<=n;i++)
       {
        scanf("%d",&m[i]);
        maxn=gcd(maxn,m[i]);
       }
       for(i=1;i<=n;i++)
        scanf("%d",&r[i]);

       int j;

       int ans=0;
       for(i=0;i<maxn;i++)
       {
           for(j=1;j<=n;j++)
           {
               if(i%m[j]==r[j])
                {
                    ans++;
                    break;
                }
           }
       }
       printf("%.6lf\n",(double)ans/maxn);

    }
    return 0;
}

ps：有没有路过的大神教教我怎么做其他的题目啊；

泪目……