QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #383456 | #6749. Target | mxxy | WA | 0ms | 3564kb | C++14 | 629b | 2024-04-09 14:27:00 | 2024-04-09 14:27:00 |
Judging History
answer
#define _CRT_SECURE_NO_WARNINGS
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <iostream>
#include <algorithm>
#include <string.h>
#include <string>
#include <math.h>
#include <queue>
#include <vector>
#include <deque>
#include <string>
#include <stdlib.h>
#include <set>
#include <map>
#include <stack>
#include <queue>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, string> pil;
const int mod = 998244353;
const int N = 2e6 + 100;
const int M = N * 10;
double ans[N];
ll dp[2010][2010];
ll arr[N];
signed main()
{
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3564kb
input:
0.5 0.25
output:
result:
wrong answer wa