QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#163724#7102. Live Lovenice333AC ✓0ms3380kbC++202.2kb2023-09-04 14:34:592023-09-04 14:34:59

Judging History

你现在查看的是最新测评结果

  • [2023-09-04 14:34:59]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3380kb
  • [2023-09-04 14:34:59]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;


inline string readstring(){
    char ch = getchar();
    string st1 = "";
    while (!((ch >= 'a') && (ch <= 'z')))
        ch = getchar();
    while ((ch >= 'a') && (ch <= 'z'))
        st1 += ch, ch = getchar();
    return st1;
}

inline void writestring(string s) {
    for (int i = 0; i < s.size(); i++) putchar(s[i]);
}

inline int readint(){
    int ans=0,sign=1;
    char ch = getchar();
    while(ch<'0'||ch>'9'){
        if(ch=='-'){
            sign=-1;
        }
        ch = getchar();
    }
    while(ch>='0'&&ch<='9'){
        ans = ans*10 + ch-'0';
        ch = getchar();
    }
    return ans*sign;
}

void writeint(int x){
    if(x<0)
        putchar('-'),x=-x;
    if(x>9)
        writeint(x/10);
    putchar(x%10+'0');
    return;
}

inline ll readll(){
    ll ans=0,sign=1;
    char ch = getchar();
    while(ch<'0'||ch>'9'){
        if(ch=='-'){
            sign=-1;
        }
        ch = getchar();
    }
    while(ch>='0'&&ch<='9'){
        ans = ans*(ll)10 + (ll)(ch-'0');
        ch = getchar();
    }
    return ans*sign;
}
void writell(ll x){
    if(x<0)
        putchar('-'),x=-x;
    if(x>9)
        writell((x/10ll));
    putchar((int)x%10+'0');
    return;
}

inline __int128 readint128(){
    __int128 x = 0, f = 1;
    char ch = getchar();
    while(ch < '0' || ch > '9'){
        if(ch == '-')
            f = -1;
        ch = getchar();
    }
    while(ch >= '0' && ch <= '9'){
        x = x * (__int128)10 + (__int128)(ch - '0');
        ch = getchar();
    }
    return x * f;
}

inline void writeint128(__int128 x){
    if(x < 0){
        putchar('-');
        x = -x;
    }
    if(x > 9)
        writeint128((x / (__int128)10));
    putchar(x % 10 + '0');
}

const int N=1000005;
ll mod=(ll)998244353;

ll qmi(ll a,ll b){
    ll res=(ll)1,p=a%mod;
    while (b){
        if(b&(ll)1)res=res*p%mod;
        p=p*p%mod;
        b>>=1;
    }
    return res;
}

int gcd(int a,int b){
    return b==0?a:gcd(b,a%b);
}

int T;
int n,a,b,c;
void solve(){
n=readint();a=readint();b=(n-a+1);
c=a/b+((a%b==0)?0:1);
    writeint(a);
    putchar(' ');
    writeint(c);
    puts("");

}

int main() {


    T=readint();
    //T=1;
    while (T--){
        solve();
    }

    return 0;
}



这程序好像有点Bug,我给组数据试试?

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3292kb

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: 3380kb

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