jackyname1@gmail.com
(☆♬○♩程式家小崴●♪✧♩)
學校
:
基隆市私立二信高級中學
編號 : 77382
來源 : [114.32.51.178]
最後登入時間 ：
2022-04-12 19:45:18
過不了~~~
第四組測資 算不出來
拜託幫我將錯誤糾正 <<< thanks !!!!!!
#include <stdio.h>#include <iostream>using namespace std;
int dig[] = {1, 1, 2, 6, 4, 2, 2, 4, 2, 8};
int lastNon0Digit(int n){ if (n < 10) return dig[n];
// Check whether tens (or second last) digit // is odd or even // If n = 375, So n/10 = 37 and (n/10)%10 = 7 // Applying formula for even and odd cases. if (((n/10)%10)%2 == 0) return (6*lastNon0Digit(n/5)*dig[n%10]) % 10; else return (4*lastNon0Digit(n/5)*dig[n%10]) % 10;}
int main(){ int n,m; while(cin>>n){ while(n--){ cin>>m; cout<<lastNon0Digit(m)<<endl; } }
return 0;}
過不了~~~
第四組測資 算不出來
拜託幫我將錯誤糾正 <<< thanks !!!!!!
#include #include using namespace std;
int dig[] = {1, 1, 2, 6, 4, 2, 2, 4, 2, 8};
int lastNon0Digit(int n){ if (n < 10) return dig[n];
// Check whether tens (or second last) digit // is odd or even // If n = 375, So n/10 = 37 and (n/10)%10 = 7 // Applying formula for even and odd cases. if (((n/10)%10)%2 == 0) return (6*lastNon0Digit(n/5)*dig[n%10]) % 10; else return (4*lastNon0Digit(n/5)*dig[n%10]) % 10;}
int main(){ int n,m; while(cin>>n){ while(n--){ cin>>m; cout<<lastNon0Digit(m)<<endl; } }
return 0;}
好像要long long