{"id":349,"date":"2013-08-02T23:38:59","date_gmt":"2013-08-03T03:38:59","guid":{"rendered":"http:\/\/www.ferociouscoder.com\/blog\/?p=349"},"modified":"2013-08-02T23:38:59","modified_gmt":"2013-08-03T03:38:59","slug":"uva-10196-check-the-check","status":"publish","type":"post","link":"https:\/\/www.ferociouscoder.com\/blog\/archives\/uva-10196-check-the-check-349.html","title":{"rendered":"UVA 10196 &#8211; Check The Check"},"content":{"rendered":"<p>This was a fun problem. This is a really good example of a problem where functions make your code extremely easy to read and write. I did a bit of trickery so that I could use the same functions for both white and black kings.<\/p>\n<pre class=\"brush: plain; title: ; notranslate\" title=\"\">\r\nimport java.awt.Point;\r\nimport java.io.PrintWriter;\r\nimport java.util.Scanner;\r\n\r\n\/**\r\n * \r\n * @author Sanchit M. Bhatnagar\r\n * @see http:\/\/uhunt.felix-halim.net\/id\/74004\r\n * \r\n *\/\r\npublic class P10196 {\r\n\r\n  public static void main(String&#x5B;] args) {\r\n    Scanner sc = new Scanner(System.in);\r\n    PrintWriter out = new PrintWriter(System.out);\r\n\r\n    int count = 1;\r\n    while (sc.hasNext()) {\r\n      char&#x5B;]&#x5B;] grid = new char&#x5B;8]&#x5B;8];\r\n      Point blackKing = null;\r\n      Point whiteKing = null;\r\n      for (int i = 0; i &lt; 8; i++) {\r\n        char&#x5B;] tmp = sc.next().trim().toCharArray();\r\n        for (int j = 0; j &lt; 8; j++) {\r\n          grid&#x5B;i]&#x5B;j] = tmp&#x5B;j];\r\n          if (tmp&#x5B;j] == 'k') {\r\n            blackKing = new Point(i, j);\r\n          } else if (tmp&#x5B;j] == 'K') {\r\n            whiteKing = new Point(i, j);\r\n          }\r\n        }\r\n      }\r\n      if (blackKing == null || whiteKing == null)\r\n        break;\r\n      if (inCheck(blackKing, grid)) {\r\n        out.println(&quot;Game #&quot; + count + &quot;: black king is in check.&quot;);\r\n      } else if (inCheck(whiteKing, grid)) {\r\n        out.println(&quot;Game #&quot; + count + &quot;: white king is in check.&quot;);\r\n      } else {\r\n        out.println(&quot;Game #&quot; + count + &quot;: no king is in check.&quot;);\r\n      }\r\n      count++;\r\n    }\r\n\r\n    out.close();\r\n    sc.close();\r\n  }\r\n\r\n  private static boolean inCheck(Point king, char&#x5B;]&#x5B;] grid) {\r\n    \/\/ Death by queen has been incorporated into deathByRook and deathByBishop\r\n    if (deathByPawn(king, grid) || deathByKnight(king, grid) || deathByRook(king, grid) || deathByBishop(king, grid))\r\n      return true;\r\n    return false;\r\n  }\r\n\r\n  private static boolean deathByBishop(Point king, char&#x5B;]&#x5B;] grid) {\r\n    int i = king.x;\r\n    int j = king.y;\r\n    char thing = '\\u000F';\r\n    char thing2 = '\\u000F';\r\n    if (Character.isLowerCase(grid&#x5B;i]&#x5B;j])) {\r\n      \/\/ Black King\r\n      thing = 'B';\r\n      thing2 = 'Q';\r\n    } else {\r\n      \/\/ White King\r\n      thing = 'b';\r\n      thing2 = 'q';\r\n    }\r\n\r\n    \/\/ NW\r\n    int idx = i - 1;\r\n    int idx2 = j - 1;\r\n    while (idx &gt;= 0 &amp;&amp; idx &lt; 8 &amp;&amp; idx2 &gt;= 0 &amp;&amp; idx2 &lt; 8 &amp;&amp; grid&#x5B;idx]&#x5B;idx2] == '.') {\r\n      idx--;\r\n      idx2--;\r\n    }\r\n    if (idx &gt;= 0 &amp;&amp; idx &lt; 8 &amp;&amp; idx2 &gt;= 0 &amp;&amp; idx2 &lt; 8 &amp;&amp; (grid&#x5B;idx]&#x5B;idx2] == thing || grid&#x5B;idx]&#x5B;idx2] == thing2))\r\n      return true;\r\n\r\n    \/\/ NE\r\n    idx = i - 1;\r\n    idx2 = j + 1;\r\n    while (idx &gt;= 0 &amp;&amp; idx &lt; 8 &amp;&amp; idx2 &gt;= 0 &amp;&amp; idx2 &lt; 8 &amp;&amp; grid&#x5B;idx]&#x5B;idx2] == '.') {\r\n      idx--;\r\n      idx2++;\r\n    }\r\n    if (idx &gt;= 0 &amp;&amp; idx &lt; 8 &amp;&amp; idx2 &gt;= 0 &amp;&amp; idx2 &lt; 8 &amp;&amp; (grid&#x5B;idx]&#x5B;idx2] == thing || grid&#x5B;idx]&#x5B;idx2] == thing2))\r\n      return true;\r\n\r\n    \/\/ SW\r\n    idx = i + 1;\r\n    idx2 = j - 1;\r\n    while (idx &gt;= 0 &amp;&amp; idx &lt; 8 &amp;&amp; idx2 &gt;= 0 &amp;&amp; idx2 &lt; 8 &amp;&amp; grid&#x5B;idx]&#x5B;idx2] == '.') {\r\n      idx++;\r\n      idx2--;\r\n    }\r\n    if (idx &gt;= 0 &amp;&amp; idx &lt; 8 &amp;&amp; idx2 &gt;= 0 &amp;&amp; idx2 &lt; 8 &amp;&amp; (grid&#x5B;idx]&#x5B;idx2] == thing || grid&#x5B;idx]&#x5B;idx2] == thing2))\r\n      return true;\r\n\r\n    \/\/ RIGHT\r\n    idx = i + 1;\r\n    idx2 = j + 1;\r\n    while (idx &gt;= 0 &amp;&amp; idx &lt; 8 &amp;&amp; idx2 &gt;= 0 &amp;&amp; idx2 &lt; 8 &amp;&amp; grid&#x5B;idx]&#x5B;idx2] == '.') {\r\n      idx++;\r\n      idx2++;\r\n    }\r\n    if (idx &gt;= 0 &amp;&amp; idx &lt; 8 &amp;&amp; idx2 &gt;= 0 &amp;&amp; idx2 &lt; 8 &amp;&amp; (grid&#x5B;idx]&#x5B;idx2] == thing || grid&#x5B;idx]&#x5B;idx2] == thing2))\r\n      return true;\r\n\r\n    return false;\r\n  }\r\n\r\n  private static boolean deathByRook(Point king, char&#x5B;]&#x5B;] grid) {\r\n    int i = king.x;\r\n    int j = king.y;\r\n    char thing = '\\u000F';\r\n    char thing2 = '\\u000F';\r\n    if (Character.isLowerCase(grid&#x5B;i]&#x5B;j])) {\r\n      \/\/ Black King\r\n      thing = 'R';\r\n      thing2 = 'Q';\r\n    } else {\r\n      \/\/ White King\r\n      thing = 'r';\r\n      thing2 = 'q';\r\n    }\r\n\r\n    \/\/ UP\r\n    int idx = i - 1;\r\n    while (idx &gt;= 0 &amp;&amp; grid&#x5B;idx]&#x5B;j] == '.') {\r\n      idx--;\r\n    }\r\n    if (idx &gt;= 0 &amp;&amp; idx &lt; 8 &amp;&amp; (grid&#x5B;idx]&#x5B;j] == thing || grid&#x5B;idx]&#x5B;j] == thing2))\r\n      return true;\r\n\r\n    \/\/ DOWN\r\n    idx = i + 1;\r\n    while (idx &lt; 8 &amp;&amp; grid&#x5B;idx]&#x5B;j] == '.') {\r\n      idx++;\r\n    }\r\n    if (idx &gt;= 0 &amp;&amp; idx &lt; 8 &amp;&amp; (grid&#x5B;idx]&#x5B;j] == thing || grid&#x5B;idx]&#x5B;j] == thing2))\r\n      return true;\r\n\r\n    \/\/ LEFT\r\n    idx = j - 1;\r\n    while (idx &gt;= 0 &amp;&amp; grid&#x5B;i]&#x5B;idx] == '.') {\r\n      idx--;\r\n    }\r\n    if (idx &gt;= 0 &amp;&amp; idx &lt; 8 &amp;&amp; (grid&#x5B;i]&#x5B;idx] == thing || grid&#x5B;i]&#x5B;idx] == thing2))\r\n      return true;\r\n\r\n    \/\/ RIGHT\r\n    idx = j + 1;\r\n    while (idx &lt; 8 &amp;&amp; grid&#x5B;i]&#x5B;idx] == '.') {\r\n      idx++;\r\n    }\r\n    if (idx &gt;= 0 &amp;&amp; idx &lt; 8 &amp;&amp; (grid&#x5B;i]&#x5B;idx] == thing || grid&#x5B;i]&#x5B;idx] == thing2))\r\n      return true;\r\n\r\n    return false;\r\n  }\r\n\r\n  private static boolean deathByKnight(Point king, char&#x5B;]&#x5B;] grid) {\r\n    int i = king.x;\r\n    int j = king.y;\r\n    char thing = '\\u000F';\r\n    if (Character.isLowerCase(grid&#x5B;i]&#x5B;j])) {\r\n      \/\/ Black King\r\n      thing = 'N';\r\n    } else {\r\n      \/\/ White King\r\n      thing = 'n';\r\n    }\r\n    if (i + 2 &lt; 8) {\r\n      if (j - 1 &gt;= 0 &amp;&amp; grid&#x5B;i + 2]&#x5B;j - 1] == thing)\r\n        return true;\r\n      if (j + 1 &lt; 8 &amp;&amp; grid&#x5B;i + 2]&#x5B;j + 1] == thing)\r\n        return true;\r\n    }\r\n    if (i - 2 &gt;= 0) {\r\n      if (j - 1 &gt;= 0 &amp;&amp; grid&#x5B;i - 2]&#x5B;j - 1] == thing)\r\n        return true;\r\n      if (j + 1 &lt; 8 &amp;&amp; grid&#x5B;i - 2]&#x5B;j + 1] == thing)\r\n        return true;\r\n    }\r\n    if (j + 2 &lt; 8) {\r\n      if (i - 1 &gt;= 0 &amp;&amp; grid&#x5B;i - 1]&#x5B;j + 2] == thing)\r\n        return true;\r\n      if (i + 1 &lt; 8 &amp;&amp; grid&#x5B;i + 1]&#x5B;j + 2] == thing)\r\n        return true;\r\n    }\r\n    if (j - 2 &gt;= 0) {\r\n      if (i - 1 &gt;= 0 &amp;&amp; grid&#x5B;i - 1]&#x5B;j - 2] == thing)\r\n        return true;\r\n      if (i + 1 &lt; 8 &amp;&amp; grid&#x5B;i + 1]&#x5B;j - 2] == thing)\r\n        return true;\r\n    }\r\n\r\n    return false;\r\n  }\r\n\r\n  private static boolean deathByPawn(Point king, char&#x5B;]&#x5B;] grid) {\r\n    int i = king.x;\r\n    int j = king.y;\r\n    char thing = '\\u000F';\r\n    if (Character.isLowerCase(grid&#x5B;i]&#x5B;j])) {\r\n      \/\/ Black King\r\n      i++;\r\n      thing = 'P';\r\n    } else {\r\n      \/\/ White King\r\n      i--;\r\n      thing = 'p';\r\n    }\r\n    if (i &gt;= 0 &amp;&amp; i &lt; 8) {\r\n      if (j - 1 &gt;= 0 &amp;&amp; grid&#x5B;i]&#x5B;j - 1] == thing)\r\n        return true;\r\n      if (j + 1 &lt; 8 &amp;&amp; grid&#x5B;i]&#x5B;j + 1] == thing)\r\n        return true;\r\n    }\r\n    return false;\r\n  }\r\n}\r\n<\/pre>\n","protected":false},"excerpt":{"rendered":"<p>This was a fun problem. This is a really good example of a problem where functions make your code extremely easy to read and write. I did a bit of trickery so that I could use the same functions for both white and black kings. import java.awt.Point; import java.io.PrintWriter; import java.util.Scanner; \/** * * @author &hellip; <a href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/uva-10196-check-the-check-349.html\" class=\"more-link\">Continue reading <span class=\"screen-reader-text\">UVA 10196 &#8211; Check The Check<\/span> <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":true,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2},"jetpack_post_was_ever_published":false},"categories":[18,19,17],"tags":[21,20,22],"class_list":["post-349","post","type-post","status-publish","format-standard","hentry","category-competitive-programming-3","category-java","category-uva-online-judge","tag-competitive-programming-3-2","tag-java-2","tag-uva-online-judge-2"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v27.6 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>UVA 10196 - Check The Check - Ferocious Coder<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/uva-10196-check-the-check-349.html\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"UVA 10196 - Check The Check - Ferocious Coder\" \/>\n<meta property=\"og:description\" content=\"This was a fun problem. This is a really good example of a problem where functions make your code extremely easy to read and write. I did a bit of trickery so that I could use the same functions for both white and black kings. import java.awt.Point; import java.io.PrintWriter; import java.util.Scanner; \/** * * @author &hellip; Continue reading UVA 10196 &#8211; Check The Check &rarr;\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.ferociouscoder.com\/blog\/archives\/uva-10196-check-the-check-349.html\" \/>\n<meta property=\"og:site_name\" content=\"Ferocious Coder\" \/>\n<meta property=\"article:published_time\" content=\"2013-08-03T03:38:59+00:00\" \/>\n<meta name=\"author\" content=\"Rawrosaur\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Rawrosaur\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"5 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\\\/\\\/www.ferociouscoder.com\\\/blog\\\/archives\\\/uva-10196-check-the-check-349.html#article\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/www.ferociouscoder.com\\\/blog\\\/archives\\\/uva-10196-check-the-check-349.html\"},\"author\":{\"name\":\"Rawrosaur\",\"@id\":\"https:\\\/\\\/www.ferociouscoder.com\\\/blog\\\/#\\\/schema\\\/person\\\/1fb5cbee546cffd619a7b301e3dc447a\"},\"headline\":\"UVA 10196 &#8211; Check The Check\",\"datePublished\":\"2013-08-03T03:38:59+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\\\/\\\/www.ferociouscoder.com\\\/blog\\\/archives\\\/uva-10196-check-the-check-349.html\"},\"wordCount\":909,\"commentCount\":1,\"publisher\":{\"@id\":\"https:\\\/\\\/www.ferociouscoder.com\\\/blog\\\/#\\\/schema\\\/person\\\/1fb5cbee546cffd619a7b301e3dc447a\"},\"keywords\":[\"competitive programming 3\",\"java\",\"uva online judge\"],\"articleSection\":[\"Competitive Programming 3\",\"Java\",\"UVA Online Judge\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\\\/\\\/www.ferociouscoder.com\\\/blog\\\/archives\\\/uva-10196-check-the-check-349.html#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/www.ferociouscoder.com\\\/blog\\\/archives\\\/uva-10196-check-the-check-349.html\",\"url\":\"https:\\\/\\\/www.ferociouscoder.com\\\/blog\\\/archives\\\/uva-10196-check-the-check-349.html\",\"name\":\"UVA 10196 - Check The Check - Ferocious Coder\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/www.ferociouscoder.com\\\/blog\\\/#website\"},\"datePublished\":\"2013-08-03T03:38:59+00:00\",\"breadcrumb\":{\"@id\":\"https:\\\/\\\/www.ferociouscoder.com\\\/blog\\\/archives\\\/uva-10196-check-the-check-349.html#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/www.ferociouscoder.com\\\/blog\\\/archives\\\/uva-10196-check-the-check-349.html\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/www.ferociouscoder.com\\\/blog\\\/archives\\\/uva-10196-check-the-check-349.html#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\\\/\\\/www.ferociouscoder.com\\\/blog\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"UVA 10196 &#8211; Check The Check\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\\\/\\\/www.ferociouscoder.com\\\/blog\\\/#website\",\"url\":\"https:\\\/\\\/www.ferociouscoder.com\\\/blog\\\/\",\"name\":\"Ferocious Coder\",\"description\":\"RAWR!\",\"publisher\":{\"@id\":\"https:\\\/\\\/www.ferociouscoder.com\\\/blog\\\/#\\\/schema\\\/person\\\/1fb5cbee546cffd619a7b301e3dc447a\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\\\/\\\/www.ferociouscoder.com\\\/blog\\\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":[\"Person\",\"Organization\"],\"@id\":\"https:\\\/\\\/www.ferociouscoder.com\\\/blog\\\/#\\\/schema\\\/person\\\/1fb5cbee546cffd619a7b301e3dc447a\",\"name\":\"Rawrosaur\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/1372156bd3b16de375c8727c2c617467bf6ff38f1679a7912f48286349c17e96?s=96&d=retro&r=pg\",\"url\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/1372156bd3b16de375c8727c2c617467bf6ff38f1679a7912f48286349c17e96?s=96&d=retro&r=pg\",\"contentUrl\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/1372156bd3b16de375c8727c2c617467bf6ff38f1679a7912f48286349c17e96?s=96&d=retro&r=pg\",\"caption\":\"Rawrosaur\"},\"logo\":{\"@id\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/1372156bd3b16de375c8727c2c617467bf6ff38f1679a7912f48286349c17e96?s=96&d=retro&r=pg\"},\"sameAs\":[\"http:\\\/\\\/www.ferociouscoder.com\\\/\"],\"url\":\"https:\\\/\\\/www.ferociouscoder.com\\\/blog\\\/archives\\\/author\\\/admin\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"UVA 10196 - Check The Check - Ferocious Coder","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/www.ferociouscoder.com\/blog\/archives\/uva-10196-check-the-check-349.html","og_locale":"en_US","og_type":"article","og_title":"UVA 10196 - Check The Check - Ferocious Coder","og_description":"This was a fun problem. This is a really good example of a problem where functions make your code extremely easy to read and write. I did a bit of trickery so that I could use the same functions for both white and black kings. import java.awt.Point; import java.io.PrintWriter; import java.util.Scanner; \/** * * @author &hellip; Continue reading UVA 10196 &#8211; Check The Check &rarr;","og_url":"https:\/\/www.ferociouscoder.com\/blog\/archives\/uva-10196-check-the-check-349.html","og_site_name":"Ferocious Coder","article_published_time":"2013-08-03T03:38:59+00:00","author":"Rawrosaur","twitter_misc":{"Written by":"Rawrosaur","Est. reading time":"5 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/www.ferociouscoder.com\/blog\/archives\/uva-10196-check-the-check-349.html#article","isPartOf":{"@id":"https:\/\/www.ferociouscoder.com\/blog\/archives\/uva-10196-check-the-check-349.html"},"author":{"name":"Rawrosaur","@id":"https:\/\/www.ferociouscoder.com\/blog\/#\/schema\/person\/1fb5cbee546cffd619a7b301e3dc447a"},"headline":"UVA 10196 &#8211; Check The Check","datePublished":"2013-08-03T03:38:59+00:00","mainEntityOfPage":{"@id":"https:\/\/www.ferociouscoder.com\/blog\/archives\/uva-10196-check-the-check-349.html"},"wordCount":909,"commentCount":1,"publisher":{"@id":"https:\/\/www.ferociouscoder.com\/blog\/#\/schema\/person\/1fb5cbee546cffd619a7b301e3dc447a"},"keywords":["competitive programming 3","java","uva online judge"],"articleSection":["Competitive Programming 3","Java","UVA Online Judge"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/www.ferociouscoder.com\/blog\/archives\/uva-10196-check-the-check-349.html#respond"]}]},{"@type":"WebPage","@id":"https:\/\/www.ferociouscoder.com\/blog\/archives\/uva-10196-check-the-check-349.html","url":"https:\/\/www.ferociouscoder.com\/blog\/archives\/uva-10196-check-the-check-349.html","name":"UVA 10196 - Check The Check - Ferocious Coder","isPartOf":{"@id":"https:\/\/www.ferociouscoder.com\/blog\/#website"},"datePublished":"2013-08-03T03:38:59+00:00","breadcrumb":{"@id":"https:\/\/www.ferociouscoder.com\/blog\/archives\/uva-10196-check-the-check-349.html#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.ferociouscoder.com\/blog\/archives\/uva-10196-check-the-check-349.html"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/www.ferociouscoder.com\/blog\/archives\/uva-10196-check-the-check-349.html#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/www.ferociouscoder.com\/blog"},{"@type":"ListItem","position":2,"name":"UVA 10196 &#8211; Check The Check"}]},{"@type":"WebSite","@id":"https:\/\/www.ferociouscoder.com\/blog\/#website","url":"https:\/\/www.ferociouscoder.com\/blog\/","name":"Ferocious Coder","description":"RAWR!","publisher":{"@id":"https:\/\/www.ferociouscoder.com\/blog\/#\/schema\/person\/1fb5cbee546cffd619a7b301e3dc447a"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/www.ferociouscoder.com\/blog\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":["Person","Organization"],"@id":"https:\/\/www.ferociouscoder.com\/blog\/#\/schema\/person\/1fb5cbee546cffd619a7b301e3dc447a","name":"Rawrosaur","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/secure.gravatar.com\/avatar\/1372156bd3b16de375c8727c2c617467bf6ff38f1679a7912f48286349c17e96?s=96&d=retro&r=pg","url":"https:\/\/secure.gravatar.com\/avatar\/1372156bd3b16de375c8727c2c617467bf6ff38f1679a7912f48286349c17e96?s=96&d=retro&r=pg","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/1372156bd3b16de375c8727c2c617467bf6ff38f1679a7912f48286349c17e96?s=96&d=retro&r=pg","caption":"Rawrosaur"},"logo":{"@id":"https:\/\/secure.gravatar.com\/avatar\/1372156bd3b16de375c8727c2c617467bf6ff38f1679a7912f48286349c17e96?s=96&d=retro&r=pg"},"sameAs":["http:\/\/www.ferociouscoder.com\/"],"url":"https:\/\/www.ferociouscoder.com\/blog\/archives\/author\/admin"}]}},"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack_shortlink":"https:\/\/wp.me\/p1mYMV-5D","jetpack_likes_enabled":true,"_links":{"self":[{"href":"https:\/\/www.ferociouscoder.com\/blog\/wp-json\/wp\/v2\/posts\/349","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.ferociouscoder.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.ferociouscoder.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.ferociouscoder.com\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.ferociouscoder.com\/blog\/wp-json\/wp\/v2\/comments?post=349"}],"version-history":[{"count":1,"href":"https:\/\/www.ferociouscoder.com\/blog\/wp-json\/wp\/v2\/posts\/349\/revisions"}],"predecessor-version":[{"id":350,"href":"https:\/\/www.ferociouscoder.com\/blog\/wp-json\/wp\/v2\/posts\/349\/revisions\/350"}],"wp:attachment":[{"href":"https:\/\/www.ferociouscoder.com\/blog\/wp-json\/wp\/v2\/media?parent=349"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.ferociouscoder.com\/blog\/wp-json\/wp\/v2\/categories?post=349"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.ferociouscoder.com\/blog\/wp-json\/wp\/v2\/tags?post=349"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}