关于此题MLE的疑问
查看原帖
关于此题MLE的疑问
373959
AFwhcing楼主2020/10/16 22:14

代码

#include<bits/stdc++.h>
using namespace std;
long long fibonacci(long long n){
    if(n<3) return 1;
    return fibonacci(n-1)+fibonacci(n-2);
}
int main(){
    long long n;
    n=fibonacci(n)%2147483647;
    printf("%d=",n);
    for(int i=2;i*i<=n;++i){
        while(n%i==0){
            printf("%d",i);
            if(n>i) printf("*");
        }
    }
    return 0;
}

WHY DOES IT MEMORY 超限? PLEASE GIVE ME AN ANSWER BEFORE 0 a.m., 10/18,2020. 最好今晚就回复。祝回复者们学业有成!工作顺利!养老金高! 幸福安康!

2020/10/16 22:14
加载中...