QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#396109 | #2852. 为最美的那位献上花朵 | ucup-team1251 | AC ✓ | 0ms | 3732kb | C++17 | 316b | 2024-04-22 13:04:34 | 2024-04-22 13:04:34 |
Judging History
answer
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 3e5 + 10,mod = 1e9 + 7;
int n,m;
int a[N];
void solve()
{
cout << "kangnaixin";
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
int T = 1;
// cin >> T;
while(T--)
{
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3732kb
input:
output:
kangnaixin
result:
ok