Alright, so I’m taking part in this SEED Infotech C programming contest, and here’s one of yesterday’s challenges:<\/p>\n
\r\nmain()\r\n{\r\n if(printf(\"C for yourself how it works \\n\");\r\n main();\r\n }\r\n<\/pre>\nOne of the options were
\n a) C for yourself how it works infinate times<\/p>\n
Now isn’t that catchy? Look at it clearly, there’s one pair of brackets missing!<\/p>\n
@SEEDInfotech, how did you choose that as the right answer?<\/p>\n
Hit http:\/\/seed-iknowvention.com\/PlayIKnowVation.aspx, and then click on previous level’s correct answer.<\/p>\n","protected":false},"excerpt":{"rendered":"
Alright, so I’m taking part in this SEED Infotech C programming contest, and here’s one of yesterday’s challenges: main() { if(printf(“C for yourself how it works \\n”); main(); } One of the options were a) C for yourself how it works infinate times Now isn’t that catchy? Look at it clearly, there’s one pair of […]<\/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_feature_clip_id":0,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2},"jetpack_post_was_ever_published":false},"categories":[52],"tags":[78,271,329,325,327,330,326,328],"class_list":["post-1231","post","type-post","status-publish","format-standard","hentry","category-code","tag-c","tag-contest","tag-day-2","tag-iknowvention","tag-infotech","tag-programming","tag-seed","tag-seed-infotech"],"aioseo_notices":[],"aioseo_head":"\n\t\t\n\t\n\t\n\t\n\t\n\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t