QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #721787 | #9546. Recover Statistics | xh_team# | WA | 0ms | 3768kb | C++14 | 1.1kb | 2024-11-07 16:51:55 | 2024-11-07 16:52:04 |
Judging History
answer
#define TLE ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
// #ifndef ONLINE_JUDGE
// #include "template/debug.h"
// #endif
using ll =long long;
#define int ll
#define inf 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define rep(i,a,n) for (int i=a;i<=n;i++)
#define per(i,n,a) for (int i=n;i>=a;i--)
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
#define pb push_back
typedef pair<int,int> PII;
// const int mod=1e9+7;
const int mod=998244353;
typedef double db;
mt19937 rnd(time(0));
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
const int N = 1e5+5;
signed main(){
TLE;
int a,b,c;
cin>>a>>b>>c;
for(int i=1;i<=50;i++){
cout<<a<<' ';
}
for(int i=1;i<=45;i++){
cout<<b<<' ';
}
for(int i=1;i<=4;i++){
cout<<c<<' ';
}
cout<<c+1<<'\n';
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3768kb
input:
50 95 99
output:
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 100
result:
wrong answer Integer parameter [name=n] equals to 50, violates the range [100, 100000]