QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#175874 | #7102. Live Love | rocww | AC ✓ | 0ms | 3712kb | C++14 | 961b | 2023-09-11 03:48:51 | 2023-09-11 03:48:52 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define sz(x) (int)x.size()
#define pb push_back
#define mp make_pair
#define ll long long
#define lli long long
#define mod 1000000007
#define mod2 998244353
#define si size()
#define dou double
void fast(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
void init_code(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
long long binpow(long long a, long long b, long long m) {
a %= m;
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
int main(){
fast();
init_code();
int t;
cin>>t;
while(t--){
ll n,m;
cin>>n>>m;
cout<<m<<" "<<n/max(1LL,n-m+1LL)<<"\n";
}
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3712kb
input:
5 5 4 100 50 252 52 3 0 10 10
output:
4 2 50 1 52 1 0 0 10 10
result:
ok 5 lines
Test #2:
score: 0
Accepted
time: 0ms
memory: 3600kb
input:
100 13 3 384 171 94 36 581 70 782 715 651 287 810 789 353 314 2 2 65 47 684 194 242 213 135 42 695 484 512 195 14 0 721 253 665 257 381 78 456 220 1000 500 1000 501 31 31 703 484 137 1 271 55 666 366 966 316 457 248 166 38 716 679 972 258 627 91 380 1 451 436 605 173 987 780 457 180 2 0 718 574 119 ...
output:
3 1 171 1 36 1 70 1 715 11 287 1 789 36 314 8 2 2 47 3 194 1 213 8 42 1 484 3 195 1 0 0 253 1 257 1 78 1 220 1 500 1 501 2 31 31 484 3 1 1 55 1 366 2 316 1 248 2 38 1 679 18 258 1 91 1 1 1 436 28 173 1 780 4 180 1 0 0 574 4 8 1 118 1 126 1 12 2 34 1 381 21 658 4 288 4 161 1 76 1 195 1 646 6 27 1 9 2...
result:
ok 100 lines
Extra Test:
score: 0
Extra Test Passed