UVA10420-List of Conquests

來源:互聯網
上載者:User

思路:只需比較前面國家的名稱就行了,記得要排序完再進行下一步操作,這樣比較方便!!!!!

#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;char cname[2005][80];char pname[2005][80];int compare(const void *a, const void *b){return strcmp((char *)a, (char *)b);}int main(){int n;scanf("%d", &n);for(int i = 0; i < n; i++){scanf("%s", cname[i]);gets(pname[i]);}qsort(cname, n, sizeof(char)*80, compare);int tmp = 1;for(int i = 1; i <= n; i++){if (strcmp(cname[i], cname[i - 1]) == 0 && i < n)tmp++;else{printf("%s %d\n", cname[i - 1], tmp);tmp = 1;}}return 0;}

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.