SOLUTION OF URI 1095 URI SOLUTIONS No comments // 1095 (Mahmud_Jamil) BRUR // Sequence IJ 1 #include<stdio.h>int main(){ int i=1,j=60; for(i=1,j=60;j<=60;i+=3,j-=5){ printf("I=%d J=%d\n",i,j); if(j==0) break; } return 0;} Share This: Facebook Twitter Google+ Stumble Digg Email ThisBlogThis!Share to XShare to Facebook Related Posts:SOLUTION OF URI 1098 // 1098 (Mahmud_Jamil) BRUR // Sequence IJ 4 #include <stdio.h>int main(){ double a,b,c=1,d=3,e,f; … Read MoreSOLUTION OF URI 1179 // 1179 (Mahmud_Jamil) BRUR // Solution of 1179 Array Fill IV #inc… Read MoreSOLUTION OF URI 1186 // (Mahmud_Jamil) BRUR // Solution of 1186 Below the Secundary Dia… Read MoreSOLUTION OF URI 1113 // 1113 (Mahmud_Jamil) BRUR // Ascending and Descending #include <stdio.h> int main() { … Read MoreSOLUTION OF URI 1149 // 1149 (Mahmud_Jamil) BRUR // Summing Consecutive Integers #include <stdio.h>int main(){ int X, … Read More
0 comments:
Post a Comment