zoukankan      html  css  js  c++  java
  • Coloring Game(思维题)

    David has a white board with 2×N2 imes N2×N grids.He decides to paint some grids black with his brush.He always starts at the top left corner and ends at the bottom right corner, where grids should be black ultimately.

    Each time he can move his brush up(), down(), left(), right(), left up(), left down(), right up(), right down () to the next grid.

    For a grid visited before,the color is still black. Otherwise it changes from white to black.

    David wants you to compute the number of different color schemes for a given board. Two color schemes are considered different if and only if the color of at least one corresponding position is different.

    Input

    One line including an integer n(0<n≤109)n(0<n le 10^9)n(0<n109)

    Output

    One line including an integer, which represent the answer  mod 1000000007mod 1000000007mod1000000007

    样例输入1 

    2

    样例输出1 

    4

    样例解释1

    样例输入2 

    3

    样例输出2 

    12

    样例解释2

     

  • 相关阅读:
    转:【More Effective C#】Lambda表达式优化
    转:Highcharts图表控件的使用
    C# subString的理解
    转:TimeSpan的用法
    Android学习笔记一:Android基本组件和Activity生命周期
    IIS 反向代理设置
    WebApi 身份认证解决方案:Basic基础认证
    Calling async method synchronously
    C# 公共类
    aspnet-api-versioning
  • 原文地址:https://www.cnblogs.com/RootVount/p/10752643.html
Copyright © 2011-2022 走看看