| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1364275 | mythofys | RUN Sequence (KAISTRUN26SPRING_B) | C++20 | 0 ms | 344 KiB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define inf 4000000000000000000
#define mod 998244353
#define siz 524288
ll fibo[200005];
int main()
{
ll i,j,k,n,m,l,r,ans = 0;
scanf("%lld %lld %lld",&l,&r,&n);
fibo[1] = 1;
fibo[2] = 1;
for(i=3;i<=50;i++)
{
fibo[i] = fibo[i-1] + fibo[i-2];
}
if(n >= 50)printf("%lld",l*r);
else
{
printf("%lld",max(0LL,(l - fibo[n-1]) * min(r,fibo[n-2])) + min(l,fibo[n-1]) * r);
}
}Compilation message (stderr)
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
