QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #709672 | #9546. Recover Statistics | kinoko777 | AC ✓ | 0ms | 3772kb | C++23 | 1.8kb | 2024-11-04 16:08:33 | 2024-11-04 16:08:34 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> p11;
typedef pair<string, int> ps1;
typedef pair<ll, ll> p1111;
#define vv vector
#define pb emplace_back
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define fi first
#define se second
#define endl '\n'
#define Endl '\n'
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define per(a, b, c) for(int a = b; a <= c; a ++)
#define iper(a, b, c) for(int a = b; a < c; a ++)
#define rep(a, b, c) for(int a = b; a >= c; a --)
#define irep(a, b, c) for(int a = b; a > c; a --)
#define aper(A) for(auto i : A) cout << i << ' ';cout << '\n'
#define lowbit(x) ((x) & (-x))
#define debug(x) cout << (x) << endl
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define PAI acos(-1)
using ll = long long;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
template<class T> void umin(T &x,T y){if(x>y)x=y;}
template<class T> void umax(T &x,T y){if(x<y)x=y;}
const int mod = 998244353, inf = 1e18;
const double eps = 1e-9;
void add(int &x, int y){x = (x + y) % mod;}
void pre_work(){}
void solve()
{
int a, b, c;
cin >> a >> b >> c;
cout << 100 << endl;
per(i, 1, 50) cout << a << ' ';
per(i, 51, 95) cout << b << ' ';
per(i, 96, 99) cout << c << ' ';
cout << c + 1 << endl;
}
signed main()
{
#ifdef LOCAL
freopen("oo.in", "r", stdin);
freopen("oo.out", "w", stdout);
#endif
IOS;
int tt = 1;
// cin >> tt;
pre_work();
while(tt --)
{
solve();
}
return 0;
}
/*
50
95
99
*/
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3588kb
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: 3644kb
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: 3576kb
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: 3648kb
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: 3772kb
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