제출 #9552

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
9552	2014-09-28 07:11:03	hodduc	Quaternion inverse (kriii2_Q)	C++98	0 / 4	0 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>
int rev[100000];
int M, T;
int vis[4];
int ord[4];
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;
}
int main()
{
  scanf("%d %d", &M, &T);
  rev[1] = 1;
  for(int i = 2; i < M; i++)
    rev[i] = mult(i, M-2);
  int a, b, c, d;
  while(T--){
    scanf("%d %d %d %d", &a, &b, &c, &d);
    long long f[4][4] = {
      {a,M-b,M-c,M-d},
      {b,a,M-d,c},
      {c,d,a,M-b},
      {d,M-c,b,a}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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