USACO 1.1.2 Greedy Gift Givers (gift1)

來源:互聯網
上載者:User

容易忽略除數不能為零這個條件!

 

/*<br />ID: gengjia1<br />LANG: C<br />TASK: gift1<br />*/<br />#include <stdio.h><br />#include <stdlib.h><br />#include <string.h><br />#include <assert.h><br />int fine_name(char *tname, char pname[10][15], int NP) {<br />int i;<br />for(i = 0; i < NP; i++) {<br />if (strcmp(pname[i], tname) == 0) {<br />return i;<br />}<br />}<br />return i; //assert(0);<br />}<br />int main(void) {<br />FILE *fin = fopen ("gift1.in", "r");<br />FILE *fout = fopen ("gift1.out", "w");<br />int NP, i, j, money[10];<br />char tname[15], pname[10][15];<br />int amount, n, avg;<br />fscanf (fin, "%d", &NP);<br />assert(NP <= 10);<br />for(i = 0; i < NP; i++) {<br />fscanf(fin, "%s", pname[i]);<br />money[i] = 0;<br />}<br />for(i = 0; i < NP; i++) {<br />fscanf(fin, "%s %d %d", tname, &amount, &n);<br />if(n != 0)<br />avg = amount/n;/*除數不能為0!!*/<br />else<br />avg = 0;<br />money[fine_name(tname, pname, NP)] += -(avg * n);<br />for(j = 0; j < n; j++) {<br />fscanf(fin, "%s", tname);<br />money[fine_name(tname, pname, NP)] += avg;<br />}<br />}<br />for(i = 0; i < NP; i++) {<br />fprintf (fout, "%s %d/n", pname[i], money[i]);<br />}<br />fclose(fin);<br />fclose(fout);<br />exit(0);<br />}

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在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.