SOLUTION OF URI 1146 URI SOLUTIONS No comments // 1146 (Mahmud_Jamil) BRUR // Growing Sequences #include <stdio.h> int main() { int a,b; while(1) { scanf("%d", &a); if(a==0) break; else { for(b=1; b<a; b++) printf("%d ",b); } printf("%d\n",a); } return 0; } Share This: Facebook Twitter Google+ Stumble Digg Email ThisBlogThis!Share to XShare to Facebook Related Posts:SOLUTION OF URI 1174 // 1174 (Mahmud_Jamil) BRUR // Array Selection I #include <stdio.h>int main(){ double A[100];&nb… Read MoreSOLUTION OF URI 1133 // 1133 (Mahmud_Jamil) BRUR // Rest of a Division #include<stdio.h>int main(){ int X,Y… Read MoreSOLUTION OF URI 1150 // 1150 (Mahmud_Jamil) BRUR // Exceeding Z #include <stdio.h>int main(){ int a,b,c=0,x,z;&… Read MoreSOLUTION OF URI 1094 // 1094 (Mahmud_Jamil) BRUR // Experiments #include<stdio.h>int main(){ int i,n,x; &nbs… Read MoreSOLUTION OF URI 1177 // 1177 (Mahmud_Jamil) BRUR // Solution of 1177 … Read More
0 comments:
Post a Comment