QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #274836 | #2870. Boris and Berta | thealekbarli | AC ✓ | 5ms | 3596kb | C++17 | 674b | 2023-12-04 01:39:27 | 2023-12-04 01:39:28 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,m,c, mini=1000000000;
cin>>n>>m>>c;
int res1=0, res2=0;
for(int i=0; i<=n/m+1; i++)
{
///cout<<abs(n-i*m-(n-i*m)/c*c)<<" ";
if(mini>abs(n-i*m-(n-i*m)/c*c) && (n-i*m)/c>=0)
{
mini = abs(n-i*m-(n-i*m)/c*c);
res1 = i;
res2 = (n-i*m)/c;
}
if(mini > abs(n-i*m-((n-i*m)/c+1)*c) && (n-i*m)/c+1>=0)
{
mini = abs(n-i*m-((n-i*m)/c+1)*c);
res1 = i;
res2 = (n-i*m)/c+1;
}
///cout<<res1<<" "<<res2<<"\n";
}
cout<<res1<<" "<<res2;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3372kb
input:
1234 500 169
output:
0 7
result:
ok
Test #2:
score: 0
Accepted
time: 0ms
memory: 3480kb
input:
1700 500 200
output:
1 6
result:
ok
Test #3:
score: 0
Accepted
time: 0ms
memory: 3424kb
input:
12345 11299 220
output:
0 56
result:
ok
Test #4:
score: 0
Accepted
time: 0ms
memory: 3432kb
input:
10000 1000 200
output:
0 50
result:
ok
Test #5:
score: 0
Accepted
time: 0ms
memory: 3300kb
input:
10000 1000 213
output:
10 0
result:
ok
Test #6:
score: 0
Accepted
time: 0ms
memory: 3380kb
input:
1 500 169
output:
0 0
result:
ok
Test #7:
score: 0
Accepted
time: 0ms
memory: 3304kb
input:
1099 900 200
output:
1 1
result:
ok
Test #8:
score: 0
Accepted
time: 0ms
memory: 3372kb
input:
1100 900 200
output:
1 1
result:
ok
Test #9:
score: 0
Accepted
time: 0ms
memory: 3436kb
input:
1101 900 200
output:
1 1
result:
ok
Test #10:
score: 0
Accepted
time: 0ms
memory: 3424kb
input:
1795 900 220
output:
2 0
result:
ok
Test #11:
score: 0
Accepted
time: 0ms
memory: 3368kb
input:
8584 11299 169
output:
0 51
result:
ok
Test #12:
score: 0
Accepted
time: 0ms
memory: 3552kb
input:
85 4845 169
output:
0 1
result:
ok
Test #13:
score: 0
Accepted
time: 0ms
memory: 3484kb
input:
87 7653 170
output:
0 1
result:
ok
Test #14:
score: 0
Accepted
time: 1ms
memory: 3428kb
input:
170 6477 169
output:
0 1
result:
ok
Test #15:
score: 0
Accepted
time: 0ms
memory: 3428kb
input:
172 8962 169
output:
0 1
result:
ok
Test #16:
score: 0
Accepted
time: 0ms
memory: 3380kb
input:
431 500 169
output:
1 0
result:
ok
Test #17:
score: 0
Accepted
time: 0ms
memory: 3384kb
input:
1344361 11299 220
output:
80 2002
result:
ok
Test #18:
score: 0
Accepted
time: 0ms
memory: 3560kb
input:
2474261 11299 220
output:
38 9295
result:
ok
Test #19:
score: 0
Accepted
time: 1ms
memory: 3596kb
input:
3514830 11220 220
output:
0 15976
result:
ok
Test #20:
score: 0
Accepted
time: 0ms
memory: 3376kb
input:
115004670 11220 220
output:
0 522748
result:
ok
Test #21:
score: 0
Accepted
time: 0ms
memory: 3388kb
input:
10 7013 212
output:
0 0
result:
ok
Test #22:
score: 0
Accepted
time: 0ms
memory: 3548kb
input:
766 3734 209
output:
0 4
result:
ok
Test #23:
score: 0
Accepted
time: 0ms
memory: 3436kb
input:
22162 6263 196
output:
0 113
result:
ok
Test #24:
score: 0
Accepted
time: 0ms
memory: 3596kb
input:
8174031 7921 172
output:
123 41859
result:
ok
Test #25:
score: 0
Accepted
time: 0ms
memory: 3312kb
input:
31647263 4029 184
output:
155 168602
result:
ok
Test #26:
score: 0
Accepted
time: 1ms
memory: 3484kb
input:
361366292 10173 185
output:
64 1949812
result:
ok
Test #27:
score: 0
Accepted
time: 1ms
memory: 3596kb
input:
977906491 8351 216
output:
101 4523440
result:
ok
Test #28:
score: 0
Accepted
time: 5ms
memory: 3436kb
input:
999999983 502 172
output:
32 5813860
result:
ok
Test #29:
score: 0
Accepted
time: 1ms
memory: 3428kb
input:
999999993 11296 218
output:
44 4584876
result:
ok
Test #30:
score: 0
Accepted
time: 5ms
memory: 3376kb
input:
1000000000 500 169
output:
54 5917000
result:
ok
Test #31:
score: 0
Accepted
time: 0ms
memory: 3432kb
input:
1000000000 11299 220
output:
60 4542373
result:
ok