This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /** | |
| * Author : Md.Mehadi Hasan Menon. | |
| * Problem : 12015-Google is Feeling Lucky. | |
| * Stauts : Accepted. | |
| * Date : 15.10.2014. | |
| **/ | |
| #include <stdio.h> | |
| char url[11][105]; | |
| int main() | |
| { | |
| int rel[11]; | |
| int i, j, maxRel, tCase; | |
| scanf("%d\n", &tCase); | |
| for(i = 1; i <= tCase; i++) | |
| { | |
| for(j = 0; j < 10; j++) | |
| { | |
| scanf("%s %d", &url[j], &rel[j]); | |
| } | |
| maxRel = 0; | |
| for(j = 0; j < 10; j++) | |
| { | |
| if(rel[j] > maxRel) | |
| { | |
| maxRel = rel[j]; | |
| } | |
| } | |
| printf("Case #%d:\n", i); | |
| for(j = 0; j < 10; j++) | |
| { | |
| if(maxRel == rel[j]) | |
| { | |
| printf("%s\n", url[j]); | |
| } | |
| } | |
| } | |
| return 0; | |
| } |
Comments
Post a Comment