{"id":64,"date":"2006-04-13T13:58:48","date_gmt":"2006-04-13T21:58:48","guid":{"rendered":"http:\/\/rk86.com\/wordpress\/?p=64"},"modified":"2006-04-13T14:11:40","modified_gmt":"2006-04-13T22:11:40","slug":"%d0%b2%d0%be%d0%bf%d1%80%d0%be%d1%81-%d0%b8%d0%b7-complangc","status":"publish","type":"post","link":"https:\/\/blog.rk86.com\/?p=64","title":{"rendered":"\u0412\u043e\u043f\u0440\u043e\u0441 \u0438\u0437 comp.lang.c++"},"content":{"rendered":"<p>&#8220;Hi I&#8217;m new here so I was wondering if someone could help me out with<br \/>\n<em> writing a proggy in C++ to    display 6 lottery numbers (1-49). Now<br \/>\nthese numbers would have to be generated randomly then compared to each<br \/>\nother to see that they&#8217;re all different, because you dont get repeated<br \/>\nnumbers in the actual lottery!!<\/em><\/p>\n<p><em>After that is done I&#8217;d like to store these in an array and create<br \/>\nanother array for another set of  6 lottery numbers. Comparing one set<br \/>\nto another set so they are uniquely different!<\/em><\/p>\n<p><em>The aim here is to see how many combinations of 6 numbers you can get<br \/>\nusing numbers from 1-49 !!!<\/em><\/p>\n<p><em>I know its going to be massive but my curiosity is killing me!!<\/em><\/p>\n<p><em>ANYONE HELP???<\/em><\/p>\n<p><em>the styf&#8221;<br \/>\n<\/em><\/p>\n<p><a href=\"http:\/\/groups.google.ca\/group\/comp.lang.c++\/browse_thread\/thread\/a6b66e464b496ac2\/4362228f9b20ea1c?hl=en#4362228f9b20ea1c\">link<\/a><\/p>\n<p>\u041c\u0438\u0440 \u043f\u043e\u043b\u043e\u043d \u0418\u0414\u0418\u041e\u0422\u041e\u0412 (\u0438 trolls)! \ud83d\ude42<\/p>\n","protected":false},"excerpt":{"rendered":"<p>&#8220;Hi I&#8217;m new here so I was wondering if someone could help me out with writing a proggy in C++ to display 6 lottery numbers (1-49). Now these numbers would have to be generated randomly then compared to each other to see that they&#8217;re all different, because you dont get repeated numbers in the actual &hellip; <a href=\"https:\/\/blog.rk86.com\/?p=64\" class=\"more-link\">Continue reading<span class=\"screen-reader-text\"> &#8220;\u0412\u043e\u043f\u0440\u043e\u0441 \u0438\u0437 comp.lang.c++&#8221;<\/span><\/a><\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[2],"tags":[],"class_list":["post-64","post","type-post","status-publish","format-standard","hentry","category-computers"],"_links":{"self":[{"href":"https:\/\/blog.rk86.com\/index.php?rest_route=\/wp\/v2\/posts\/64","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blog.rk86.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blog.rk86.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blog.rk86.com\/index.php?rest_route=\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/blog.rk86.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=64"}],"version-history":[{"count":0,"href":"https:\/\/blog.rk86.com\/index.php?rest_route=\/wp\/v2\/posts\/64\/revisions"}],"wp:attachment":[{"href":"https:\/\/blog.rk86.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=64"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.rk86.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=64"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.rk86.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=64"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}