| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1121635 | vjudge1 | Calvinball championship (CEOI15_teams) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9 + 7;
int binpow(int a,int b){
if(!b)return 1;
int res = binpow(a,b/2);
res = (res * res) % mod;
if(b&1)return (res * a) % mod;
return res;
}
int main(){
int n;
cin >> n;
vector<int> sira(n);
for(auto &i : sira)cin >> i;
cout << binpow(2,n);
}