| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 315800 | wujunchen | 三排地砖 T3 | C++ | Wrong Answer | 6 MS | 768 KB | 322 | 2026-04-12 22:27:53 |
#include<bits/stdc++.h> using namespace std; #define ll long long #define pll pair<ll,ll> #define mll map<ll,ll> int main(){ ll n; cin>>n; n/=2; vector<ll>a(n+1); a[1]=1; a[2]=2; for(ll i=3;i<=n;i++){ a[i]=a[i-1]+a[i-2]; } ll ans=pow(2,n*2-1)+pow(a[n],2); cout<<ans%1000000007; return 0; }