B. QR code
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
![](http://codeforces.ru/renderer/5f5ab2ca0b0cced12e430ae209c136d90f47653f.png)
Input
The input contains two integers a1, a2 (0 ≤ ai ≤ 32), separated by a single space.
Output
Output a single integer.
Sample test(s)
input
1 1
output
0
input
3 7
output
0
input
13 10
output
1
解题报告:
把二维码里的表响应位置输出来
参考代码:
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <cmath>
#include<string>
using namespace std;
string s2[33]=
{
"111111101010101111100101001111111",
"100000100000000001010110001000001",
"101110100110110000011010001011101",
"101110101011001001111101001011101",
"101110101100011000111100101011101",
"100000101010101011010000101000001",
"111111101010101010101010101111111",
"000000001111101111100111100000000",
"100010111100100001011110111111001",
"110111001111111100100001000101100",
"011100111010000101000111010001010",
"011110000110001111110101100000011",
"111111111111111000111001001011000",
"111000010111010011010011010100100",
"101010100010110010110101010000010",
"101100000101010001111101000000000",
"000010100011001101000111101011010",
"101001001111101111000101010001110",
"101101111111000100100001110001000",
"000010011000100110000011010000010",
"001101101001101110010010011011000",
"011101011010001000111101010100110",
"111010100110011101001101000001110",
"110001010010101111000101111111000",
"001000111011100001010110111110000",
"000000001110010110100010100010110",
"111111101000101111000110101011010",
"100000100111010101111100100011011",
"101110101001010000101000111111000",
"101110100011010010010111111011010",
"101110100100011011110110101110000",
"100000100110011001111100111100000",
"111111101101000101001101110010001"
};
int main()
{
int m,n,i;
while(cin>>m>>n)
{
cout<<s2[m][n]<<endl;
}
return 0;
}