SOLUTION OF URI 1177 URI SOLUTIONS // 1177 (Mahmud_Jamil) BRUR // Solution of 1177 Array Fill II #include <stdio.h> int main() { int N[1000], x, y,z; scanf ("%d", &x); for(y=0,z=0; y<1000; y++) { printf("N[%d] = %d\n",y,z); z++; if(z==x) z=0; } return 0; } Share This: Facebook Twitter Google+ Stumble Digg Email ThisBlogThis!Share to XShare to Facebook Related Posts:SOLUTION OF URI 1156 // 1156 (Mahmud_Jamil) BRUR // S Sequence II #include <stdio.h>int main(){ double a,b=1,c,… Read MoreSOLUTION OF URI 1145 // 1145 (Mahmud_Jamil) BRUR // Logical Sequence 2 #include <stdio.h>int main(){ int X,Y,z,a,b=0… Read MoreSOLUTION OF URI 1154 // 1154 (Mahmud_Jamil) BRUR // Ages #include <stdio.h>int main(){ int a,b=0; d… Read MoreSOLUTION 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 1151 // 1151 (Mahmud_Jamil) BRUR // Easy Fibonacci #include <stdio.h>int main(){ int x,y, a=0,b=1,c=… Read More