QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #628618 | #6819. Largest Unique Wins | foyonaczy | WA | 1ms | 3696kb | C++20 | 235b | 2024-10-10 21:14:42 | 2024-10-10 21:14:59 |
Judging History
answer
#include<bits/stdc++.h>
int main() {
int n, m;
std::cin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j < m; j++)std::cout << "0.000000000000 ";
std::cout << "1.000000000000\n";
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3576kb
input:
2 2
output:
0.000000000000 1.000000000000 0.000000000000 1.000000000000
result:
ok ok 0.0000 0.0000
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3696kb
input:
3 3
output:
0.000000000000 0.000000000000 1.000000000000 0.000000000000 0.000000000000 1.000000000000 0.000000000000 0.000000000000 1.000000000000
result:
wrong answer 1's strategy is not optimal, current = 0.0000000000, better (1) = 1.0000000000