杭电acm2021 杭电acm 2021 发工资的题目明明在编译器里通过了为什么...
\u676d\u7535acm2021\u8d2a\u5fc3\u7b97\u6cd5\u76f4\u63a5\u641e\u5b9a\uff1a
#include
int main()
{
int n,i,j,num,money,s,temp;
int y[6]={100,50,10,5,2,1};
while(scanf("%d",&n)!=EOF && n!=0)
{
num=0;
for(i=0;i<n;i++)
{
scanf("%d",&money);
for(j=0;j<6;j++)
{
s=money/y[j];temp=money%y[j]; num+=s;
if(temp==0) break;
money=temp;
}
}
printf("%d\n",num);
}
}
#include
int main()
{
int a[6]={100,50,10,5,2,1};
int b[6],c[100];
int n,i,j,sum;
while(~scanf("%d",&n))
{
sum = 0; //\u6bcf\u4e2a\u6d4b\u8bd5\u7528\u4f8b\u90fd\u8981\u7ed9sum\u91cd\u65b0\u8d4b\u503c\u4e3a0\u3002\u5426\u5219\u6bcf\u6d4b\u4e00\u6b21\uff0csum\u5c31\u7d2f\u52a0\u3002
if(n==0)break;
for(i=0;i<n;i++)
scanf("%d",&c[i]);
for(i=0;i<n;i++)
for(j=0;j<6;j++)
{
b[j]=c[i]/a[j];
c[i]=c[i]%a[j];
sum=sum+b[j];
}
printf("%d\n",sum);
}
return 0;
}
#include<stdio.h>
main()
{
int a[100],n,i,k,j,sum;
while (scanf("%d",&n)!=EOF)
{
if (n==0) break;
for (i=0,sum=0;i<n;i++)
{
scanf("%d",&a[i]);
do
{
if (a[i]>=100) {sum+=1;a[i]-=100;}
else if (a[i]>=50) {sum+=1;a[i]-=50;}
else if (a[i]>=10) {sum+=1;a[i]-=10;}
else if (a[i]>=5) {sum+=1;a[i]-=5;}
else if (a[i]>=2) {sum+=1;a[i]-=2;}
else if (a[i]=1) {sum+=1;a[i]-=1;}
}while (a[i]!=0);
}
printf("%d
",sum);
}
}
#include <stdio.h>
int main()
{
int n, x, i, sum;
while (scanf("%d", &n)) {
if (n == 0) break;
for (i = 0, sum = 0; i < n; i++) {
scanf("%d", &x);
while (x) {
if (x >= 100) sum += 1, x -= 100;
else if (x >= 50) sum += 1, x -= 50;
else if (x >= 10) sum += 1, x -= 10;
else if (x >= 5 ) sum += 1, x -= 5 ;
else if (x >= 2 ) sum += 1, x -= 2 ;
else sum += 1, x -= 1;
}
}
printf("%d
", sum);
}
return 0;
}
/*贪心算法
最少要准备几张？每个人面额尽量最大，张数就最少*/
绛旓細鏉數ACM瀹為獙瀹や綅浜庢澀宸炵數瀛愮鎶澶у鐨勬暀瀛︽ゼ鍐咃紝鍏蜂綋鐨勪綅缃彲鑳戒細鍥犲鏍＄殑甯冨眬璋冩暣鑰屾湁鎵鍙樺寲锛屽缓璁洿鎺ヨ仈绯绘澀宸炵數瀛愮鎶澶у鐨勭浉鍏抽儴闂ㄦ垨鏌ヨ瀛︽牎鐨勫畼鏂圭綉绔欎互鑾峰彇鏈鍑嗙‘鐨勪俊鎭傛澀鐢礎CM瀹為獙瀹ゆ槸鏉窞鐢靛瓙绉戞妧澶у涓轰簡鍩瑰吇瀛︾敓鐨勮绠楁満缂栫▼鑳藉姏鍜岀畻娉曡璁¤兘鍔涜岃绔嬬殑涓涓笓涓氬疄楠屽銆傝瀹為獙瀹ら氬父閰嶅浜嗛珮鎬ц兘鐨...
绛旓細鍦ㄧ珵鎶鍦哄锛屼竴鍦虹鎶鐩涘姝ｅ湪鎮勭劧閰濋吙锛鏉窞鐢靛瓙绉戞妧澶у鐨2023骞ACM鏍¤禌鏃犵枒鎴愪负浜嗕紬浜虹灘鐩殑鐒︾偣銆傝鎴戜滑涓璧锋帰绱㈣繖鍦虹珵璧涗腑鐨勪笁澶у叧閿湅鐐癸紝鐪嬭皝鑳藉湪杩欏満鏅哄姏婵鎴樹腑鑴遍鑰屽嚭銆1. 浼犲瀵瑰喅锛氭墰鎶婂瓙瀵规垬瓒呯骇寮洪槦 鍘熺播閾佸緥锛鏉數鐨勫叚澶у姴鏃咃紝鑳藉惁鎶垫尅寰椾綇鐢眑zr銆乭hz鍜寉sf缁勬垚鐨勮崏琛屼箙鍥㈤槦鐨勫啿鍑伙紵杩...
绛旓細//浠ヤ笅浠ｇ爜宸睞C include<stdio.h> int main(){ int n, m;int sum, i;while(scanf("%d", &n) != EOF){ if(n == 0)break;sum = 0;for(i = 1; i <= n; i++){ scanf("%d", &m);switch(m % 10){ case 1:case 2:case 5:sum += 1;break;case 3:case 4:case 6...
绛旓細璐績绠楁硶鐩存帴鎼炲畾锛歩nclude<stdio.h> int main(){ int n,i,j,num,money,s,temp;int y[6]={100,50,10,5,2,1};while(scanf("%d",&n)!=EOF && n!=0){ num=0;for(i=0;i<n;i++){ scanf("%d",&money);for(j=0;j<6;j++){ s=money/y[j];temp=money%y[j]; num+=s...
绛旓細鏉數acm瀹為獙瀹や簬2016骞3鏈堝缓閫犺屾垚锛屾敞鍐屽湴鍧鍦ㄦ澀宸炲煄瑗跨鍒涘ぇ璧板粖鐨勯潚灞辨箹鐣旓紝涓昏鍦ˋCM鍥介檯澶у鐢熺▼搴忚璁＄珵璧涖佸叏鍥藉ぇ瀛︾敓鏅鸿兘姹借溅绔炶禌涓繘琛屼娇鐢ㄣ傛澀宸炵數瀛愮鎶澶у锛岀畝绉扳滄澀鐢碘濓紝浣嶄簬鏉窞甯傦紝鏄禉姹熺渷浜烘皯鏀垮簻涓庡浗闃茬鎶宸ヤ笟灞鍏卞缓鐨勬暀瀛︾爺绌跺瀷澶у锛屾槸娴欐睙鐪侀鎵归噸鐐瑰缓璁剧殑5鎵楂樻牎涔嬩竴銆
绛旓細=EOF) { if (n==0) break; for (i=0,sum=0;i<n;i++) { scanf("%d",&a[i]); do { if (a[i]>=100) {sum+=1;a[i]-=100;} else if (a[i]>=50) {sum+=1;a[i]-=50;} else if (a[i]>=10) {sum+=1;a[i]-=10;} ...
绛旓細l 涓暣鏁.杈撳嚭 瀵规瘡涓妗堜緥锛屽簲灏嗘槑鏂囪緭鍑哄湪涓涓崟琛屼腑銆備綘鍙亣瀹氭纭殑鏄庢枃閮芥槸鍙鐨凙SCII瀛楃锛堜及璁℃剰鎬濆叾瀹炴槸鍙槄璇荤殑锛夛紝浣犻渶瑕佸皢杩欎簺鏄庢枃杈撳嚭涓哄彲瑙佺殑瀛楁瘝锛屽叾闂翠笉瑕佸寘鍚┖鐧姐傝緭鍏ユ牱渚 101 103 7 11 7716 7746 7497 126 8486 4708 7746 623 7298 7357 3239 杈撳嚭鏍蜂緥 I-LOVE-ACM.
绛旓細鍦ㄩ鐩晫闈㈢殑涓嬫柟鐐瑰嚮submit杩涘叆鎻愪氦鐣岄潰锛岀劧鍚庨夋嫨璇█锛岃緭鍏ョ▼搴忥紝鍐嶆鐐瑰嚮姝ょ晫闈笅鏂圭殑submit灏卞彲浠ユ彁浜や笂鍘讳簡锛岀劧鍚庣瓑涓浼氬効锛屽綋浣犵殑绋嬪簭鏄痑ccepted鏄氨鏄氳繃浜嗭紝鍏朵粬鏄剧ず閮芥槸涓嶆纭殑鎰忔濓紝鍙笉杩囦笉鍚岀殑鏄剧ず鏄笉鍚岀殑閿欒锛侊紒锛
绛旓細runtime error 锛堣繍琛屾椂閿欒锛夊氨鏄▼搴忚繍琛屽埌涓鍗婏紝绋嬪簭灏卞穿婧冧簡銆傛瘮濡傝锛氶櫎浠ラ浂 鏁扮粍瓒婄晫锛歩nt a[3]; a[10000000]=10 鎸囬拡瓒婄晫锛歩nt * p; p=(int *)malloc(5 * sizeof(int)); *(p+1000000)=10 浣跨敤宸茬粡閲婃斁鐨勭┖闂达細int * p; p=(int *)malloc(5 * sizeof(int));free(p); ...
绛旓細澶ф鐪嬩簡涓嬶紝鎴戣寰椾綘寰楃畻娉曞彲浠ユ敼杩涗笅 涓嶇敤鍙岄噸寰幆锛屼竴閲嶅氨澶熶簡 寰幆銆傘傘傚鏋 鏄笅鏍囦负0 鍒欏垽鏂槸鍚︿负鑻辨枃瀛楁瘝鎴栦笅鍒掔嚎 濡傛灉 涓嶆槸涓嬫爣涓0 ,鍒欏垽鏂槸鍚︿负鑻辨枃瀛楁瘝鎴栦笅鍒掔嚎鎴栨暟瀛 锛堝叾涓綋涓嶇鍚堣鑼冩潯浠舵椂break閫鍑猴級鏈鍚庨氳繃鍒ゆ柇鏄惁涓旈鍑猴紝閫夋嫨杈撳嚭yes杩樻槸no(鍒ゆ柇璇彞鏄痠f( i>=sizeof(s)))
