Submission #9334

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
9334	2014-09-28 05:38:01	myungwoo	Quaternion inverse (kriii2_Q)	C++14	4 / 4	392 ms	1476 KiB

Q

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <stdio.h>
#include <algorithm>
using namespace std;
#define MAXM 100005
typedef long long lld;
int M, T;
int A, B, C, D;
int inv[MAXM];
int get_inv(int n)
{
  int m = M-2, ret = 1, v = n;
  for (;m;m>>=1, v=(lld)v*v%M) if (m&1) ret = (lld)ret*v%M;
  return ret;
}
int main()
{
  int i, j, k;
  scanf("%d%d", &M, &T);
  for (i=1;i<M;i++) inv[i] = get_inv(i);
  while (T--){
    scanf("%d%d%d%d", &A, &B, &C, &D);
    int p[4][5] ={
        {A, -B, -C, -D, 1},
        {B, A, -D, C, 0},
        {C, D, A, -B, 0},
        {D, -C, B, A, 0}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 1 / 1
• Subtask 2: 3 / 3