제출 #15415

#제출 시각아이디문제언어결과실행 시간메모리
15415wlgns88피보나미얼 (kriii3_V)C++98
0 / 74
0 ms1720 KiB
#include <stdio.h> #include <iostream> unsigned long long chk=0; bool getBit(unsigned long long num,int i){ return ((num&(1<<i))!=0); } void setBit(unsigned long long& num,int i){ num = num|(1<<i); } int RecursiveFibonacci(int num,unsigned long long& fibonamial){ if(num==0 || num==1){ return num; }else if(num>=2){ unsigned long long result = RecursiveFibonacci(num-1,fibonamial) + RecursiveFibonacci(num-2,fibonamial); if ( getBit(chk,num) == false ) { fibonamial = fibonamial*result; setBit(chk,num); } return result; } } unsigned long long getDivMax(unsigned long long target,int n){ int i=0; while(target%n==0){ target=target/n; i++; } return i; } int main() { int n,p; scanf("%d %d",&n,&p); unsigned long long fibonamial=1; RecursiveFibonacci(n,fibonamial); for(int i=1;i<=p-1;i++){ printf("%u\n",getDivMax(fibonamial,i+1)); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...