2986. 计算2的N次方

Fifnmar

这也太水了,我看到标签以为是高精度快速幂什么的,结果就 30,这不逗我吗

#include <iostream>
using namespace std;

int main() {
    int t; cin >> t;
    for (int i = 0; i < t; ++i) {
        unsigned long long n; cin >> n;
        cout << "case #" << i << ":\n" << (1ull << n) << '\n';
    }
}
aiden
#include <iostream>
using namespace std;

int main()
{   
    int t;
    cin >> t;
    for (auto z = 0; z < t; ++z)
    {
        int n;
        cin >> n;
        unsigned ans = 1 << n;
        cout << "case #" << z << ":" << endl;
        cout << ans << endl;
    }
    return 0;
}
Li Dao

题解

include

using namespace std;
int T,n;
int main()
{
cin>>T;
for(int step=0;step>n;
printf(“case #%d:\n%d\n”,step,(1<<n));
}
return 0;
}

直接算,无语

你当前正在回复 博客/题目
存在问题!