SOLUTION OF URI 1157 URI SOLUTIONS No comments // 1157 (Mahmud_Jamil) BRUR // Divisors I #include <stdio.h>int main(){ int N,a; scanf("%d",&N); for(a=1;a<=N;a++) { if(N%a==0) 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 1962 // Solution of 1962 A Long, Long Time Ago // (Mahmud_Jamil) BRUR … Read MoreSOLUTION OF URI 1070 // 1070 (Mahmud_Jamil) BRUR // Six Odd Numbers #include<stdio.h>int main(){ int i,n; scanf("… Read MoreSOLUTION OF URI 1071 // 1071 (Mahmud_Jamil) BRUR // Sum of Consecutive Odd Numbers I #include<stdio.h>int main(){ int i,a,b,… Read MoreSOLUTION OF URI 1848 // Solution of 1848 Counting Crow // (Mahmud_Jamil) BRUR … Read MoreSOLUTION OF URI 1075 // 1075 (Mahmud_Jamil) BRUR // Remaining 2 #include<stdio.h>int main(){ int i,n; sca… Read More
0 comments:
Post a Comment