Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //wish me luck
- #include <bits/stdc++.h>
- using namespace std;
- ifstream f("2sah.in");
- ofstream g("2sah.out");
- const long long mod = 100003;
- long long n,k;
- long long power(long long n, long long k){
- long long ans = 1;
- while(k){
- if(k & 1){
- ans = (ans * n) % mod;
- k--;
- }
- n = (n * n) % mod;
- k /= 2;
- }
- return ans;
- }
- int mat[101][101];
- long long suma(long long j){
- long long sum = 0;
- long long i = 1;
- j = n - j;
- while(i <= n && j <= 2 * n){
- sum += mat[i][j];
- i++;
- j += 2;
- }
- return sum;
- }
- int main(){
- int type,i,j;
- f >> type;
- f >> n >> k;
- if(type == 1){
- g << power(3,k - 1);
- return 0;
- }
- n = 5;
- mat[1][n + 1] = 1;
- for(i = 2 ; i <= n + 1 ; i <= n)
- for(j = 1 ; j <= 2 * n + 1 ; j++)
- mat[i][j] = mat[i - 1][j - 1] + mat[i - 1][j] + mat[i - 1][j + 1];
- //g << suma(0);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement