QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#724399#9546. Recover Statisticsucup-team1001#AC ✓1ms3628kbC++231.2kb2024-11-08 12:59:102024-11-08 12:59:11

Judging History

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

  • [2024-11-08 12:59:11]
  • 评测
  • 测评结果:AC
  • 用时:1ms
  • 内存:3628kb
  • [2024-11-08 12:59:10]
  • 提交

answer

/*

Author: Haze

*/

#include <bits/stdc++.h>

#define irep(i, l, r) for(int i = (l); i <= (r); ++ i)
#define drep(i, r, l) for(int i = (r); i >= (l); -- i)
#define IOS ios::sync_with_stdio(false), cin.tie(nullptr);
using namespace std;
typedef long long ll;

inline ll readL() {
    ll s = 0;
    bool fl = false;
    char ch = (char) getchar();
    while (!isdigit(ch)) {
        if (ch == '-')fl = true;
        ch = (char) getchar();
    }
    while (isdigit(ch)) {
        s = s * 10 + (ch ^ 48);
        ch = (char) getchar();
    }
    return fl ? -s : s;
}

inline int read() {
    return (int) (readL());
}

const int mod = 1000000000 + 7;
const int itinf = 1000000999;
const ll llinf = 2e18;
const int N = 500099;

void solve() {
    int a, b, c;
    cin >> a >> b >> c;
    cout << 100 << endl;
    for(int i = 1; i <= 50; i++) {
        cout << a << ' ';
    }
    for(int i = 51; i <= 95; i++) {
        cout << b << ' ';
    }
    for(int i = 96; i <= 99; i++) {
        cout << c << ' ';
    }
    cout << c + 1;
}

int main() {
    // IOS
    int T = 1;
    while (T--) {
        solve();
    }
    return 0;
}

这程序好像有点Bug,我给组数据试试?

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3612kb

input:

50
95
99

output:

100
50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 50 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 95 99 99 99 99...

result:

ok ok

Test #2:

score: 0
Accepted
time: 0ms
memory: 3564kb

input:

1
2
3

output:

100
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 4

result:

ok ok

Test #3:

score: 0
Accepted
time: 0ms
memory: 3628kb

input:

1
999999998
999999999

output:

100
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999998 999999...

result:

ok ok

Test #4:

score: 0
Accepted
time: 0ms
memory: 3532kb

input:

999999997
999999998
999999999

output:

100
999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999997 999999...

result:

ok ok

Test #5:

score: 0
Accepted
time: 0ms
memory: 3564kb

input:

893
114514
1919810

output:

100
893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 893 114514 114514 114514 114514 114514 114514 114514 114514 114514 114514 114514 114514 114514 11451...

result:

ok ok

Extra Test:

score: 0
Extra Test Passed