求教用awk怎样凑数字

jason680

@zsszss0000 @54nwq

Here you are with good performance

$ time awk -vv=275.32 'function x(v,s,c,t,p,y){if(s-c>1)while(++p<=NR-s+c)x(v,s,c+1,t+a[p],p,y a[p]"("p")+");else{if(t+max<v||v<t+min)return;while(++p<=NR){if(v==t+a[p]){cnt++;print v"="y a[p]"("p")"}}}}{a[NR]=$1;N=NR;if(NR==1)max=min=$1;if(max<$1)max=$1;if(min>$1)min=$1;printf $1"("NR"), "}END{print "\nmax="max", min="min;for(n=1;n<=NR;n++)x(v,n);print "got total:"cnt}' FILE
43.11(1), 56.27(2), 88(3), 7.22(4), 4.77(5), 38.59(6), 95.09(7), 64.04(8), 66.61(9), 54.99(10), 54.77(11), 34.83(12), 3.23(13), 4.75(14), 80.26(15), 12.9(16), 77.26(17), 28.17(18), 78.01(19), 68.87(20), 83.95(21), 12.29(22), 79.08(23),
max=95.09, min=3.23
275.32=43.11(1)+64.04(8)+12.9(16)+77.26(17)+78.01(19)
...
275.32=4.77(5)+38.59(6)+95.09(7)+34.83(12)+3.23(13)+4.75(14)+12.9(16)+68.87(20)+12.29(22)
got total:23

real    0m15.366s
user    0m12.925s
sys    0m0.252s

$ time awk -vv=275.32 'function x(v,s,c,t,p,y){if(t>v)return;if(s-c>1)while(++p<=NR-s+c)x(v,s,c+1,t+a[p],p,y a[p]"("p")+");else{if(t+max<v||v<t+min)return;while(++p<=NR){if(v==t+a[p]){cnt++;print v"="y a[p]"("p")"}}}}{a[NR]=$1;N=NR;if(NR==1)max=min=$1;if(max<$1)max=$1;if(min>$1)min=$1;printf $1"("NR"), "}END{print "\nmax="max", min="min;for(n=1;n<=NR;n++)x(v,n);print "got total:"cnt}' FILE
43.11(1), 56.27(2), 88(3), 7.22(4), 4.77(5), 38.59(6), 95.09(7), 64.04(8), 66.61(9), 54.99(10), 54.77(11), 34.83(12), 3.23(13), 4.75(14), 80.26(15), 12.9(16), 77.26(17), 28.17(18), 78.01(19), 68.87(20), 83.95(21), 12.29(22), 79.08(23),
max=95.09, min=3.23
275.32=43.11(1)+64.04(8)+12.9(16)+77.26(17)+78.01(19)
...
275.32=4.77(5)+38.59(6)+95.09(7)+34.83(12)+3.23(13)+4.75(14)+12.9(16)+68.87(20)+12.29(22)
got total:23


real    0m3.029s
user    0m1.720s
sys    0m0.068s

real    0m3.123s
user    0m1.820s
sys    0m0.124s

real    0m2.852s
user    0m1.748s
sys    0m0.096s

Note: run three times

54nwq

jason680 发表于 2015-03-03 12:35
@zsszss0000 @54nwq

Here you are with good performance

太厉害了，佩服，谢谢

54nwq

回复 6# cao627
谢谢帮助，你好厉害啊！


   

goofool

回复 11# jason680


    虽然我没看懂，但是这段代码应该有问题
我把LZ的数据sort了一下，用这段代码出来结果就不一样了

1. sort -n test | awk ... test
   
2. 
   
3. ....
   
4. 
   
5. got total:28

复制代码

goofool

回复 11# jason680


   我用穷举算出来是42

reyleon

回复 11# jason680


    结果确实有问题, 不止 23 种组合.

54nwq

回复 15# goofool

确实结果是42种

zsszss0000

的确 我验证了下，也出现了你这种情况回复 14# goofool


   

zsszss0000

你穷举的方法是怎么样的？回复 15# goofool


   

goofool

回复 19# zsszss0000


    把所有组合列出来，对每个组合求和，然后和275.32比较

不知道有没有好算法，这种太不讨好了，baidu半天也没找到