SOLUTION OF URI 1172 URI SOLUTIONS No comments // 1172 (Mahmud_Jamil) BRUR // Array Replacement I #include <stdio.h>int main(){ int N[10], temp,i,j; for(i=0; i<10; i++) scanf("%d",&N[i]); for(i=0; i<10; i++) { if(N[i]<=0) N[i]=1; } for(i=0; i<10; i++) printf("X[%d] = %d\n",i,N[i]); return 0;} Share This: Facebook Twitter Google+ Stumble Digg Email ThisBlogThis!Share to XShare to Facebook Related Posts:SOLUTION OF URI 1131 // 1131 (Mahmud_Jamil) BRUR // Grenais #include <stdio.h>int main(){ int a,b,c=0,d=0,e=0,f,g,h… Read MoreSOLUTION OF URI 1929 // Solution of 1929 Triangle // (Mahmud_Jamil) BRUR #includ… Read MoreSOLUTION OF URI 1958 // Solution of 1958 Scientific Notation // (Mahmud_Jamil) BRUR … Read MoreSOLUTION OF URI 1101 // 1101 (Mahmud_Jamil) BRUR // Sequence of Numbers and Sum #include <stdio.h>int main(){ in… Read MoreSOLUTION OF URI 1789 // Solution of 1789 The Race of Slugs // (Mahmud_Jamil) BRUR #in… Read More
0 comments:
Post a Comment