QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#602806 | #8717. 骰子 | frs# | TL | 0ms | 0kb | C++14 | 828b | 2024-10-01 12:56:19 | 2024-10-01 12:56:19 |
answer
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
#include<vector>
#include <valarray>
#include <cmath>
#include <numeric>
#include <random>
using namespace std;
#define ll long long
//#define int ll
const int maxN = 3e2+10, mod = 998244353;
int n, p[maxN], cnt[maxN][maxN];
ll dp[maxN];
ll power(ll x, ll y){
ll an = 1;
while(y){
if (y&1) an = an*x % mod;
y >>= 1;
x = x*x %mod;
}
return an;
}
ll inv(ll x){
return power(x, mod-2);
}
ll count(int x, int y, int x_, int y_){
return cnt[x_][y_]-cnt[x_][y-1]-cnt[x-1][y_]+cnt[x-1][y-1];
}
void solve(){
while (true);
}
int main(){
ios::sync_with_stdio(false);
cin.tie();
int t = 1;
while (t--) solve();
return 0;
}
详细
Test #1:
score: 0
Time Limit Exceeded
input:
3 3 3 4 3 2 1 0 1 0 1000000007 0 500000004 0 500000004 0 0 500000004 500000004 1 1 1 2 1 3