青岛 2016ICPC 区域现场赛题目

• A. Relic Discovery
• B. Pocket Cube
• C. Pocky
• D. Lucky Coins
• E. Fibonacci
• F. Lambda Calculus
• G. Coding Contest
• H. Pattern
• I. Travel Brochure
• J. Cliques
• K. Finding Hotels
• L. Tower Attack
• M. Generator and Monitor

B. Pocket Cube

• 1000ms
• 262144K

The Pocket Cube, also known as the Mini Cube or the Ice Cube, is the 2×2×22 \times 2 \times 22×2×2 equivalence of a Rubik’s Cube. The cube consists of 888 pieces, all corners.

Each piece is labeled by a three dimensional coordinate (h,k,l)(h, k, l)(h,k,l) where hhh, kkk, l∈0,1l \in {0, 1}l∈0,1. Each of the six faces owns four small faces filled with a positive integer.

For each step, you can choose a certain face and turn the face ninety degrees clockwise or counterclockwise.

You should judge that if one can restore the pocket cube in one step. We say a pocket cube has been restored if each face owns four same integers.

Input

The first line of input contains one integer N(N≤30)N(N \le 30)N(N≤30) which is the number of test cases.

For each test case, the first line describes the top face of the pocket cube, which is the common 2×22 \times 22×2 face of pieceslabelled by (0,0,1)(0, 0, 1)(0,0,1), (0,1,1)(0, 1, 1)(0,1,1), (1,0,1)(1, 0, 1)(1,0,1), (1,1,1)(1, 1, 1)(1,1,1). Four integers are given corresponding to the above pieces.

The second line describes the front face, the common face of (1,0,1)(1,0,1)(1,0,1), (1,1,1)(1,1,1)(1,1,1), (1,0,0)(1,0,0)(1,0,0), (1,1,0)(1,1,0)(1,1,0). Four integers aregiven corresponding to the above pieces.

The third line describes the bottom face, the common face of (1,0,0)(1, 0, 0)(1,0,0), (1,1,0)(1, 1, 0)(1,1,0), (0,0,0)(0, 0, 0)(0,0,0), (0,1,0)(0, 1, 0)(0,1,0). Four integers are given corresponding to the above pieces.

The fourth line describes the back face, the common face of (0,0,0)(0,0,0)(0,0,0), (0,1,0)(0,1,0)(0,1,0), (0,0,1)(0,0,1)(0,0,1), (0,1,1)(0,1,1)(0,1,1). Four integers are given corresponding to the above pieces.

The fifth line describes the left face, the common face of (0,0,0)(0, 0, 0)(0,0,0), (0,0,1)(0, 0, 1)(0,0,1), (1,0,0)(1, 0, 0)(1,0,0), (1,0,1)(1, 0, 1)(1,0,1). Four integers are given corresponding to the above pieces.

The six line describes the right face, the common face of (0,1,1)(0, 1, 1)(0,1,1), (0,1,0)(0, 1, 0)(0,1,0), (1,1,1)(1, 1, 1)(1,1,1), (1,1,0)(1, 1, 0)(1,1,0). Four integers are given corresponding to the above pieces.

In other words, each test case contains 242424 integers aaa, bbb, ccc to xxx. You can flat the surface to get the surface development as follows.

Output

For each test case, output YES if can be restored in one step, otherwise output NO.

样例输入

4
1 1 1 1
2 2 2 2
3 3 3 3
4 4 4 4
5 5 5 5
6 6 6 6
6 6 6 6
1 1 1 1
2 2 2 2
3 3 3 3
5 5 5 5
4 4 4 4
1 4 1 4
2 1 2 1
3 2 3 2
4 3 4 3
5 5 5 5
6 6 6 6
1 3 1 3
2 4 2 4
3 1 3 1
4 2 4 2
5 5 5 5
6 6 6 6

样例输出

YES
YES
YES
NO

思路：直接模拟六种情况。

 #include<bits/stdc++.h>
 using namespace std;
 int a[][];
 int main()
 {
     int n;
     scanf("%d",&n);
     while(n--)
     {
         for(int i=; i<=; i++)
         {
             for(int j=; j<=; j++)
             {
                 scanf("%d",&a[i][j]);
             }
         }
         int summ=;
         int sum=;
         for(int i=; i<=; i++)
         {
             if(a[i][]==a[i][] && a[i][]==a[i][] && a[i][]==a[i][])
             {
                 summ++;
             }
         }
         if((a[][]==a[][] && a[][]==a[][] && a[][]==a[][]) && (a[][]==a[][] && a[][]==a[][] && a[][]==a[][]))
         {
             sum=;
         }
         if((a[][]==a[][] && a[][]==a[][] && a[][]==a[][]) && (a[][]==a[][] && a[][]==a[][] && a[][]==a[][]))
         {
             sum=;
         }
         if((a[][]==a[][] && a[][]==a[][] && a[][]==a[][]) && (a[][]==a[][] && a[][]==a[][] && a[][]==a[][]))
         {
             sum=;
         }
         if(summ==)
         {
             printf("YES\n");
         }
         else if(sum==)
         {
             printf("NO\n");
         }
         else if(sum==)
         {
             if(a[][]==a[][] &&a[][]==a[][] &&a[][]==a[][]&&
                     a[][]==a[][] &&a[][]==a[][] &&a[][]==a[][]&&
                     a[][]==a[][] &&a[][]==a[][] &&a[][]==a[][]&&
                     a[][]==a[][] &&a[][]==a[][] &&a[][]==a[][])
                 printf("YES\n");
             else if(a[][]==a[][] &&a[][]==a[][] &&a[][]==a[][]&&
                     a[][]==a[][] &&a[][]==a[][] &&a[][]==a[][]&&
                     a[][]==a[][] &&a[][]==a[][] &&a[][]==a[][]&&
                     a[][]==a[][] &&a[][]==a[][] &&a[][]==a[][])
                 printf("YES\n");
             else
                 printf("NO\n");
         }
         else if(sum==)
         {
             if(a[][]==a[][] &&a[][]==a[][] &&a[][]==a[][]&&
                     a[][]==a[][] &&a[][]==a[][] &&a[][]==a[][]&&
                     a[][]==a[][] &&a[][]==a[][] &&a[][]==a[][]&&
                     a[][]==a[][] &&a[][]==a[][] &&a[][]==a[][])
                 printf("YES\n");
             else if(a[][]==a[][] &&a[][]==a[][] &&a[][]==a[][]&&
                     a[][]==a[][] &&a[][]==a[][] &&a[][]==a[][]&&
                     a[][]==a[][] &&a[][]==a[][] &&a[][]==a[][]&&
                     a[][]==a[][] &&a[][]==a[][] &&a[][]==a[][])
                 printf("YES\n");
             else
                 printf("NO\n");

         }
         else if(sum==)
         {
             if(a[][]==a[][] &&a[][]==a[][] &&a[][]==a[][]&&
                     a[][]==a[][] &&a[][]==a[][] &&a[][]==a[][]&&
                     a[][]==a[][] &&a[][]==a[][] &&a[][]==a[][]&&
                     a[][]==a[][] &&a[][]==a[][] &&a[][]==a[][])
                 printf("YES\n");
             else if(a[][]==a[][] &&a[][]==a[][] &&a[][]==a[][]&&
                     a[][]==a[][] &&a[][]==a[][] &&a[][]==a[][]&&
                     a[][]==a[][] &&a[][]==a[][] &&a[][]==a[][]&&
                     a[][]==a[][] &&a[][]==a[][] &&a[][]==a[][])
                 printf("YES\n");
             else
                 printf("NO\n");
         }
         else
         {
              printf("NO\n");
         }
     }
     return ;
 }

C. Pocky

• 1000ms
• 262144K

 

Let’s talking about something of eating a pocky. Here is a Decorer Pocky, with colorful decorative stripes in the coating, of length LLL.

While the length of remaining pocky is longer than ddd, we perform the following procedure. We break the pocky at any point on it in an equal possibility and this will divide the remaining pocky into two parts. Take the left part and eat it. When it is not longer than ddd, we do not repeat this procedure.

Now we want to know the expected number of times we should repeat the procedure above. Round it to 666 decimal places behind the decimal point.

Input

The first line of input contains an integer NNN which is the number of test cases. Each of the NNN lines contains two float-numbers LLL and ddd respectively with at most 555 decimal places behind the decimal point where 1≤d,L≤1501 \le d, L \le 1501≤d,L≤150.

Output

For each test case, output the expected number of times rounded to 666 decimal places behind the decimal point in a line.

样例输入

6
1.0 1.0
2.0 1.0
4.0 1.0
8.0 1.0
16.0 1.0
7.00 3.00

样例输出

0.000000
1.693147
2.386294
3.079442
3.772589
1.847298

思路：微分。
代码：

 #include<bits/stdc++.h>
 using namespace std;
 int n;
 double l,d;
 int main()
 {
     scanf("%d",&n);
     while(n--)
     {
         scanf("%lf%lf",&l,&d);
         if(l<=d)
         {
             printf("0.000000\n");
         }
         else
         {
             printf("%.6f\n",+log(l/d));
         }
     }
     return ;
 }