SOLUTION OF URI 1178 URI SOLUTIONS // 1178 (Mahmud_Jamil) BRUR // Solution of 1178 Array Fill III #include <stdio.h> int main() { int a; double N[100],b,c,d; scanf("%lf", &b); N[a]=b; for(a=0; a<100;a++) { printf("N[%d] = %.4lf\n", a, N[a]); b/=2; N[a+1]=b; } return 0; } Share This: Facebook Twitter Google+ Stumble Digg Email ThisBlogThis!Share to XShare to Facebook Related Posts:SOLUTION OF URI 1094 // 1094 (Mahmud_Jamil) BRUR // Experiments #include<stdio.h>int main(){ int i,n,x; &nbs… Read MoreSOLUTION OF URI 1099 // 1099 (Mahmud_Jamil) BRUR // Sum of Consecutive Odd Numbers II #include <stdio.h>int main(){ &n… Read MoreSOLUTION 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 1183 // 1183 (Mahmud_Jamil) BRUR // Solution of 1183 Above the Main Diagonal #include <stdio.h> int main() … Read More