| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1353792 | mariza | Splits (CEOI25_splits) | C++20 | 0 ms | 344 KiB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD=998244353;
int solve(int n, int m, vector<vector<int>>& s){
int ans=1;
for(ll i=0; i<n; i++){
ans*=2;
ans%=MOD;
}
ans+=MOD-n;
ans%=MOD;
return ans;
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
