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

     

  • 相关阅读:
    什么是索引?怎么创建索引?索引的使用原则?
    Cookie和Session的区别
    HashMap、Hashtable、ConcurrentHashMap的原理与区别
    vxlogcfg vxlogcfg – 修改统一日志记录配置设置
    磁盘阵列RAID介绍及计算公式
    二叉树的最近公共祖先 递归
    LRU 缓存机制
    从前序与中序遍历序列构造二叉树 递归
    MySQL 数据结构常用命令
    Node.Js 搭建简单的 EggJs 示例项目
  • 原文地址:https://www.cnblogs.com/RootVount/p/10752643.html
Copyright © 2011-2022 走看看