#include<bits/stdc++.h>

using namespace std;

typedef long long fw;

fw lj(fw a, fw b){
	fw sm = lj(a , b / 2);
	if(b & 1){
		return sm * sm * a % 10000;
	
	
	}
	else{
		return sm * sm % 10000;
	}
	
}

int main(){
	fw n, a[205];
	cin >> n;
	for(int i = 0; i < n; i++){
		cin >> a[i];
	}
	for(int i = 0; i < n; i++){
		cout << lj(2011, a[i]);
	}
	return 0;
}

0 comments

No comments so far...

Information

ID
719
Time
1000ms
Memory
256MiB
Difficulty
7
Tags
# Submissions
112
Accepted
24
Uploaded By