Submission #1364808

#	Time	Username	Problem	Language	Result	Execution time	Memory
1364808		mon_de2738	RUN Sequence (KAISTRUN26SPRING_B)	C++20	100 / 100	0 ms	344 KiB

Main

#include<iostream>
using namespace std;
using ll=long long;
ll R,U,N;
ll F[55];
 
int main(){
    F[1]=F[2]=1;
    for(int i=3; i<55; i++) F[i]=F[i-1]+F[i-2];
    int pos=lower_bound(F,F+55,1e9)-F;
    cin >> R >> U >> N;
    ll neg=0;
    if(N-1<pos) neg=max(0LL, U-F[N-2])*max(0LL, R-F[N-1]);
    cout << R*U-neg;
}

• Subtask 1: 20 / 20
• Subtask 2: 30 / 30
• Subtask 3: 50 / 50