QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#22619#2868. Preparing a contestSuzt_ilymtics#AC ✓2ms3576kbC++14383b2022-03-10 14:08:462022-04-30 01:27:53

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2022-04-30 01:27:53]
  • 评测
  • 测评结果:AC
  • 用时:2ms
  • 内存:3576kb
  • [2022-03-10 14:08:46]
  • 提交

answer

#include<bits/stdc++.h>
#define LL long long
const int MAXN = 1e5 + 10;
const int mod = 998244353;

int read() {
    int s = 0, f = 0;
    char ch = getchar();
    while(!isdigit(ch)) f |= (ch == '-'), ch = getchar();
    while(isdigit(ch)) s = (s << 1) + (s << 3) + (ch ^ 48), ch = getchar();
    return f ? -s : s;
}

int main() {
    puts("FOI");
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 2ms
memory: 3576kb

input:



output:

FOI

result:

ok