SOLUTION OF URI 1067 URI SOLUTIONS No comments // 1067 (Mahmud_Jamil) BRUR // question of 1067 Odd Numbers #include<stdio.h> int main() { int n,i; scanf("%d",&n); for(i=1;i<=n;i=i+2) { printf("%d\n",i); } return 0; } Share This: Facebook Twitter Google+ Stumble Digg Email ThisBlogThis!Share to XShare to Facebook Related Posts:SOLUTION OF URI 1181 // 1181 (Mahmud_Jamil) BRUR // Solution of 1181 Line in Array #inc… Read MoreSOLUTION OF URI 1095 // 1095 (Mahmud_Jamil) BRUR // Sequence IJ 1 #include<stdio.h>int main(){ int i=1,j=60; … Read MoreSOLUTION OF URI 1144 // 1144 (Mahmud_Jamil) BRUR // Logical Sequence #include <stdio.h>int main(){ int a,b,c,d,e,f;&nb… Read MoreSOLUTION OF URI 1115 // 1115 (Mahmud_Jamil) BRUR // Quadrant #include<stdio.h>int main(){ int x,y,i; &nb… Read MoreSOLUTION OF URI 1097 // 1097 (Mahmud_Jamil) BRUR // Sequence IJ 3 #include <stdio.h>int main(){ int i=1,j=7; while(i<=9){&nb… Read More
0 comments:
Post a Comment