Submission #9624

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
9624	2014-09-28 07:43:26	hodduc	Quaternion inverse (kriii2_Q)	C++98	1 / 4	248 ms	2648 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>
long long rev[200001];
int M, T;
int mult(int x, int e)
{
  if(e == 1) return x;
  long long tmp = mult(x, e>>1);
  tmp = (tmp * tmp) % M;
  if (e & 1) tmp = (tmp * x) % M;
  return (int)tmp;
}
void solve(int a,int b,int c, int d)
{
    long long f[4][4] = {
      {a,(M-b)%M,(M-c)%M,(M-d)%M},
      {b,a,(M-d)%M,c},
      {c,d,a,(M-b)%M},
      {d,(M-c)%M,b,a}
    };
    long long v[4] = {1,0,0,0};
    int vis[4];
    int ord[4];
    for(int t = 0; t < 4; t++) vis[t] = 0;
    for(int col = 0; col < 4; col++)
    {
      int row;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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