Submission #17829187

Source Code Expand

/*
 result     28.21[min]
 penalty    6           原因:modの引き算の処理抜け
*/

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define rep(i,n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i,j,n) for (ll i = j; i < (ll)(n); ++i)
const ll INF = 1LL << 60;
const ll DIV = 1000000007;

int main() {
    ll N;
    cin >> N;
    // 全組み合わせ
    ll ans0 = 1;
    rep(i, N) ans0 = ans0 * 10 % DIV;
    // 0を含まない数
    // 9を含まない数
    ll ans1 = 2;
    rep(i, N) ans1 = ans1 * 9 % DIV;
    // 0も9も含まない数
    ll ans2 = 1;
    rep(i, N) ans2 = ans2 * 8 % DIV;

    // 引き算がある際は「-」になるのを防ぐために「+DIV」処理しておく
    ll ans = (ans0 + ans2 - ans1 + DIV) % DIV;
    cout << ans << endl;
}

Submission Info

Submission Time
Task C - Ubiquity
User papino
Language C++ (GCC 9.2.1)
Score 300
Code Size 855 Byte
Status AC
Exec Time 23 ms
Memory 3624 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 20
Set Name Test Cases
Sample sample00, sample01, sample02
All case03, case04, case05, case06, case07, case08, case09, case10, case11, case12, case13, case14, case15, case16, case17, case18, case19, sample00, sample01, sample02
Case Name Status Exec Time Memory
case03 AC 23 ms 3392 KiB
case04 AC 2 ms 3408 KiB
case05 AC 2 ms 3568 KiB
case06 AC 2 ms 3552 KiB
case07 AC 3 ms 3432 KiB
case08 AC 2 ms 3624 KiB
case09 AC 2 ms 3524 KiB
case10 AC 3 ms 3520 KiB
case11 AC 7 ms 3580 KiB
case12 AC 16 ms 3564 KiB
case13 AC 8 ms 3552 KiB
case14 AC 16 ms 3404 KiB
case15 AC 17 ms 3568 KiB
case16 AC 12 ms 3600 KiB
case17 AC 17 ms 3568 KiB
case18 AC 5 ms 3564 KiB
case19 AC 18 ms 3392 KiB
sample00 AC 2 ms 3520 KiB
sample01 AC 3 ms 3552 KiB
sample02 AC 17 ms 3520 KiB