SOLUTION OF URI 1145 URI SOLUTIONS No comments // 1145 (Mahmud_Jamil) BRUR // Logical Sequence 2 #include <stdio.h>int main(){ int X,Y,z,a,b=0; scanf("%d%d", &X,&Y); for(a=1; a<=Y; a++) { b++; if(b==X) printf("%d",a); else printf("%d ", a); if(b==X) { b=0; printf("\n"); } } return 0;} Share This: Facebook Twitter Google+ Stumble Digg Email ThisBlogThis!Share to XShare to Facebook Related Posts:SOLUTION OF URI 1184 // 1184 (Mahmud_Jamil) BRUR // Below the Main Diagonal #include <stdio.h> int main() { &n… Read MoreSOLUTION OF URI 1143 // 1143 (Mahmud_Jamil) BRUR // Squared and Cubic #include<st… Read MoreSOLUTION OF URI 1142 // 1142 (Mahmud_Jamil) BRUR // PUM #include<stdio.h>int main(){ int N,i… Read MoreSOLUTION OF URI 1164 // 1164 (Mahmud_Jamil) BRUR // Perfect Number #include <stdio.h>int main(){ int N, X, a, b,… Read MoreSOLUTION OF URI 1178 // 1178 (Mahmud_Jamil) BRUR // Solution of 1178 Array Fill III … Read More
0 comments:
Post a Comment