제출 #1352841

#제출 시각아이디문제언어결과실행 시간메모리
1352841ErJSplits (CEOI25_splits)C++20
6 / 100
0 ms344 KiB
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define pp pair<ll, ll>
#define vp vector<pp>
#define inf 1000000000
#define mod 998244353

ll modpow(ll a, ll b){
    if(b == 0) return 1;
    if(b == 1) return a;
    ll ans = modpow(a, b / 2);
    if(b & 1) return (((ans * ans) % mod)) * a % mod;
    else return (ans * ans) % mod;
}

int solve(int n, int m, std::vector<std::vector<int>>& splits){
    return (modpow(2, n) - n + mod) % mod;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...