牛客多校(2020第七場) D-Fake News
阿新 • • 發佈:2020-08-02
題目描述
McDonald Thumb, the greatest president ever in the history of the Great Tokitsukaze Kingdom has held his 100th press conference about the global pandemic after making his 1000000th tweets with his smartphone. With a big smile on his face, Mr. Thumb said that nobody knows math more than he does.‘I learn math since I was born and I am very good at it’, said Mr. Thumb. ‘People keep asking me why I know math so much and I sometimes find myself having those amazing ideas about math.’
‘For example?’, asked by a reporter.
‘Oh you, I know you! Fake news! You and your agency always produce fake news!’, replied angrily by Mr. Thumb. ‘Let me teach you something, do you know if you add up the squares of numbers from 1 to n, the sum will never be a square number?’
輸入描述:
There are multiple test cases. The first line of the input contains an integer T (1≤T≤106)(1 \leq T \leq 10^6)(1≤T≤106) indicating the number of test cases.
For each test case, the first line contains one integers n (1≤n≤1015)(1 \leq n \leq 10^{15})(1≤n≤1015).
輸出描述:
If the sum is a square number, please output ‘Fake news!’ in one line. Otherwise, please output ‘Nobody knows it better than me!’ instead.示例1
輸入
5 1 2 3 4 5
輸出
Fake news! Nobody knows it better than me! Nobody knows it better than me! Nobody knows it better than me! Nobody knows it better than me!
題解:
就是給定一個整數n,求1-n的平方和是否是平方數(另一個數字的平方),可進行打表尋找規律,發現當且僅當n==1 || n==24時,其結果是平方數
1 #include<iostream> 2 #include<cstring> 3 #include<algorithm> 4 using namespace std; 5 6 long long n; 7 8 int main() { 9 ios::sync_with_stdio(false); //注意:不加這幾條會TL 10 cin.tie(0); 11 cout.tie(0); 12 int t; 13 cin >> t; 14 while (t--) { 15 cin >> n; 16 if (n == 1 || n == 24) cout << "Fake news!\n"; 17 else cout << "Nobody knows it better than me!\n"; 18 } 19 }