QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#561942 | #9256. Quantum Supremacy | Baneist# | WA | 0ms | 3684kb | C++14 | 690b | 2024-09-13 13:23:55 | 2024-09-13 13:23:56 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using piii = pair<pii,int>;
#define mp(a,b) make_pair(a,b)
#define fi first
#define se second
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
const ll N = 1e3+3;
void solve(){
ll n,a,b;cin>>n>>a>>b;
auto geti=[](ll n,ll b,ll a){
ll d=((n*a+b-1)/b);
ll r=(n+d-1)/d, i=0; while(r!=0) r>>=1,i++; return i;
};
ll x=geti(n,b,a);
cout<<x<<endl;
}
void init(){
}
int main(){
ios::sync_with_stdio(false), cin.tie(0);
init();
//int t;cin>>t;while(t--)
solve();
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3576kb
input:
1024 1 1
output:
1
result:
ok answer is '1'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
1024 1 2
output:
2
result:
ok answer is '2'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3684kb
input:
1 1 1
output:
1
result:
ok answer is '1'
Test #4:
score: -100
Wrong Answer
time: 0ms
memory: 3600kb
input:
1 1 2
output:
1
result:
wrong answer expected '-1', found '1'