SOLUTION OF URI 1080 URI SOLUTIONS No comments // 1080 (Mahmud_Jamil) BRUR // Highest and Position #include<stdio.h>int main(){ int i,in,m=0,p; for(i=1;i<=100;i++){ scanf("%d",&in); if(m<in){ m=in; p=i; } } printf("%d\n%d\n",m,p); return 0;} Share This: Facebook Twitter Google+ Stumble Digg Email ThisBlogThis!Share to XShare to Facebook Related Posts:SOLUTION 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 1150 // 1150 (Mahmud_Jamil) BRUR // Exceeding Z #include <stdio.h>int main(){ int a,b,c=0,x,z;&… Read MoreSOLUTION OF URI 1156 // 1156 (Mahmud_Jamil) BRUR // S Sequence II #include <stdio.h>int main(){ double a,b=1,c,… 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 MoreSOLUTION OF URI 1154 // 1154 (Mahmud_Jamil) BRUR // Ages #include <stdio.h>int main(){ int a,b=0; d… Read More
0 comments:
Post a Comment