# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
146663 | pichulia | 분수 (KPI13_fractions) | C++11 | 1066 ms | 376 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<stdio.h>
unsigned long long int find_r(unsigned long long int x, unsigned long long int b)
{
unsigned long long int l,r,mid;
l=2; r=b;
while(l<r)
{
mid = (l+r)/2;
if((x*mid/b) < mid-1) r = mid;
else l=mid+1;
}
return l-1;
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
unsigned long long int a,b,c,d;
unsigned long long int k,s;
scanf("%llu %llu %llu %llu",&a,&b,&c,&d);
unsigned long long int x,y;
unsigned long long int p,q,r;
k = a/b;
y=1;
while(1)
{
p=d+(a*y/b)*d;
q=c*y;
if(p<q)break;
r = a*y%b;
s = find_r(r,b);
y += s+(p-q)/(c-k*d);
}
x = a*y/b+1;
printf("%llu %llu\n",x,y);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |