BNUOJ34976数细菌

数细菌

Time Limit: 1000ms

Memory Limit: 65536KB

Special Judge

64-bit integer IO format:  %lld      Java class name:  Main

Prev  Submit  Status  Statistics  Discuss  Next

Font Size:  +   -

Type: 

  None

 Graph Theory

      2-SAT

     Articulation/Bridge/Biconnected Component

     Cycles/Topological Sorting/Strongly Connected Component

     Shortest Path

          Bellman Ford

         Dijkstra/Floyd Warshall

     Euler Trail/Circuit

     Heavy-Light Decomposition

     Minimum Spanning Tree

     Stable Marriage Problem

     Trees

      Directed Minimum Spanning Tree

      Flow/Matching

         Graph Matching

             Bipartite Matching

             Hopcroft–Karp Bipartite Matching

             Weighted Bipartite Matching/Hungarian Algorithm

         Flow

              Max Flow/Min Cut

              Min Cost Max Flow

  DFS-like

     Backtracking with Pruning/Branch and Bound

     Basic Recursion

      IDA* Search

     Parsing/Grammar

     Breadth First Search/Depth First Search

     Advanced Search Techniques

         Binary Search/Bisection

         Ternary Search

 Geometry

      Basic Geometry

     Computational Geometry

     Convex Hull

      Pick's Theorem

 Game Theory

     Green Hackenbush/Colon Principle/Fusion Principle

     Nim

      Sprague-Grundy Number

  Matrix

     Gaussian Elimination

     Matrix Exponentiation

 Data Structures

      Basic Data Structures

      Binary Indexed Tree

      Binary Search Tree

      Hashing

     Orthogonal Range Search

     Range Minimum Query/Lowest Common Ancestor

     Segment Tree/Interval Tree

     Trie Tree

      Sorting

     Disjoint Set

 String

      Aho Corasick

     Knuth-Morris-Pratt

     Suffix Array/Suffix Tree

 Math

      Basic Math

     Big Integer Arithmetic

     Number Theory

          Chinese Remainder Theorem

          Extended Euclid

          Inclusion/Exclusion

          Modular Arithmetic

      Combinatorics

         Group Theory/Burnside's lemma

         Counting

      Probability/Expected Value

  Others

     Tricky

      Hardest

     Unusual

     Brute Force

      Implementation

     Constructive Algorithms

     Two Pointer

      Bitmask

     Beginner

     Discrete Logarithm/Shank's Baby-step Giant-step Algorithm

     Greedy

      Divide and Conquer

  Dynamic Programming

                      Tag it!

小明发现了一种细菌，这种细菌会在分裂后的第2天重新分裂为3个细菌，即如果第一天有1个新分裂出来的细菌，则第2天还是有1个细菌，第3天会有3个新分裂出来的细菌，在第4天还是3个细菌，第5天会有9个细菌…已知培养皿里有若干这种细菌，第1天有a个细菌，第2天有b个细菌。小明想知道第n天时培养皿里会有多少个细菌。结果(ans)可能很大，只用输出log₁₀(ans)即可。

Input

输入的第一行为一个整数T(T≤1000)表示数据组数。

每组数据一行三个数依次为a, b, n(1≤a,b,n≤10¹⁸)。

Output

对于每组数据，输出一个浮点数表示结果，误差在1e-6以内即可。

Sample Input

1
1 3 3

Sample Output

0.4771212547

Source

第十二届北京师范大学程序设计竞赛决赛

Author

temperlsyer

#include<stdio.h>
#include<math.h>
int main()
{
    int t;
    long long k1,k2,n,a,b;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%lld%lld%lld",&a,&b,&n);
        long long ta=a,tb=b,mm;
        a=(tb-ta)/2;//第一天里的己经分裂后的第1天细胞数
        b=ta-a;//第一天里的新生细胞数
        k1=n/2;
        k2=(n-1)/2;
        if(k1==k2)mm=1;else mm=3;
        if(n>=3)
        printf("%.10lf\n",k2*log10(3.0)+log10((double)(a*mm+b)));//log里面的相乘等于相加
        else if(n==1)
        printf("%.10lf\n",log10((double)(ta*1.0)));
        else if(n==2)
        printf("%.10lf\n",log10((double)(tb*1.0)));
    }
}