#include "squares.h" #include <bits/stdc++.h> using namespace std; const int k = 10; string s = "0000000000100000000110000000101000000011100000010010000001011000000110100000011110000010001000001001100000101010000010111000001100100000110110000011101000001111100001000010001100001001010000100111000010100100001010110000101101000010111100001100010000110011000011010100001101110000111001000011101100001111010000111111000100010100010001110001001001000100101100010011010001001111000101001100010101010001010111000101100100010110110001011101000101111100011000110010100011001110001101001000110101100011011010001101111000111001100011101010001110111000111100100011110110001111101000111111100100100110010010101001001011100100110110010011101001001111100101001010011100101010110010101101001010111100101100110010110101001011011100101110110010111101001011111100110011010011001111001101010100110101110011011011001101110100110111110011100111010110011101101001110111100111101010011110111001111101100111111010011111111010101010111010101101101010111110101101011011110101110111010111101101011111110110110111011011111101"; vector<int> paint(int n){ vector<int> paimon; for (int i = 0; i < n; i++) paimon.push_back(s[i]-'0'); paimon.push_back(k); return paimon; } bool czy(vector<int> &a, vector<int> &b, int x) { for (int i = x; i < x+k; i++) if (a[i] != b[i-x]) return false; return true; } int find_location(int n, vector<int> c){ vector<int> oppai = paint(n); for (int i = 1; i < k; i++) oppai.push_back(-1); for (int i = 0; i < n; i++) if (czy(oppai,c,i)) return i; return 67; }