QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#787747 | #9546. Recover Statistics | ntxyl# | WA | 0ms | 3696kb | C++23 | 770b | 2024-11-27 14:21:58 | 2024-11-27 14:22:05 |
Judging History
answer
#include <bits/stdc++.h>
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define endl '\n'
#define int long long
#define all(v) v.begin(), v.end()
//#define x first
//#define y second
using namespace std;
typedef pair<int, int> PII;
const int N = 1e5 + 10;
void solve() {
int a,b,c;
cin>>a>>b>>c;
// cout<<a<<' '<<b<<' '<<c<<endl;
// int l=100,r=1e5;
// while(l<r){
// int mid=l+r+1>>1;
// // cout<<mid<<endl;
// if((mid<=a*2)&&(mid*95<=100*b)&&(mid*99<=c*100)) r=mid;
// else r=mid-1;
// }
cout<<100<<endl;
for(int i=1;i<=100;i++) cout<<i<<' ';
}
signed main() {
fastio;
int T;
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:
50 95 99
output:
100 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100
result:
ok ok
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3564kb
input:
1 2 3
output:
100 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100
result:
wrong answer wrong p50: 1 / 100