QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#713619 | #2895. 自白书 | HHAZ# | AC ✓ | 0ms | 3696kb | C++20 | 854b | 2024-11-05 20:03:47 | 2024-11-05 20:03:47 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int> PII;
typedef pair<ll,ll> PLL;
#define endl '\n'
#define debug(x) cout<<#x<<": "<<x<<endl
#define lowbit(x) (x&-x)
#define gcd __gcd
#define i128 __int128
#define rep(i, a, b) for(ll i = (a); i <= (b); i++)
#define per(i, a, b) for(ll i = (a); i >= (b); i--)
const int N=3e6+10,M=1e3+10;
const ll mod=1e9+7;
const ld eps=1e-12;
const ld pi=3.14159265358979;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define poly vector<int>
#define fi first
#define se second
void solve()
{
cout << "kecheng";
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
int T=1;
// cin>>T;
while(T--)
{
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3696kb
input:
Remember me, and help us
output:
kecheng
result:
ok single line: 'kecheng'