Advertisement
Guest User

Untitled

a guest
Sep 19th, 2019
98
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.00 KB | None | 0 0
  1. //wish me luck
  2. #include <bits/stdc++.h>
  3.  
  4. using namespace std;
  5.  
  6. ifstream f("2sah.in");
  7. ofstream g("2sah.out");
  8.  
  9. const long long mod = 100003;
  10. long long n,k;
  11.  
  12. long long power(long long n, long long k){
  13. long long ans = 1;
  14. while(k){
  15. if(k & 1){
  16. ans = (ans * n) % mod;
  17. k--;
  18. }
  19. n = (n * n) % mod;
  20. k /= 2;
  21. }
  22. return ans;
  23. }
  24.  
  25. int mat[101][101];
  26. long long suma(long long j){
  27. long long sum = 0;
  28. long long i = 1;
  29. j = n - j;
  30. while(i <= n && j <= 2 * n){
  31. sum += mat[i][j];
  32. i++;
  33. j += 2;
  34. }
  35. return sum;
  36. }
  37.  
  38. int main(){
  39. int type,i,j;
  40. f >> type;
  41. f >> n >> k;
  42. if(type == 1){
  43. g << power(3,k - 1);
  44. return 0;
  45. }
  46.  
  47. n = 5;
  48. mat[1][n + 1] = 1;
  49. for(i = 2 ; i <= n + 1 ; i <= n)
  50. for(j = 1 ; j <= 2 * n + 1 ; j++)
  51. mat[i][j] = mat[i - 1][j - 1] + mat[i - 1][j] + mat[i - 1][j + 1];
  52.  
  53. //g << suma(0);
  54.  
  55. return 0;
  56. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement