- 博客(8)
- 资源 (2)
- 收藏
- 关注
原创 UVa 10004 Bicoloring
/* File: 10004.cpp Author: ACboy Date: 2010-4-26 Result: 1A Descripition: UVa 10004 Bicoloring*/#include using namespace std;int edges[210][210]; /* adjacency information */int
2010-04-26 23:08:00 1026
原创 UVa 10139 Factovisors
/* File: 10139.cpp Author: ACboy Date: 2010-4-22 Result: AC Descripition: UVa 10139 Factovisors*/#include #include #include #include using namespace std;map m;set s;/
2010-04-23 12:34:00 1791 3
原创 UVa 10006 Carmichael Numbers
/* File: 10006.cpp Author: ACboy Date: 2010-4-22 Result: AC Descripition: UVa 10006 Carmichael Numbers*/#include using namespace std;int vis[70000];// 快速幂取模(a^b % n)unsigne
2010-04-22 15:19:00 1171
原创 UVa 701 The Archeologists' Dilemma
枚举需要的位数2ans > n * 10i && 2ans i , i 的初值为log10(n) + 2。而符合条件的一个整数ans就是答案。log2(2ans) = ans, log2(n * 10i) = log2(n) + i * log2(10),log2((n + 1)* 10i) = log2(n + 1) + i * log2(10)。/* File: 701.cpp
2010-04-21 20:28:00 1519
原创 UVa 10205 Stack 'em Up
/* File: 10205.cpp Author: ACboy Date: 2010-4-20 Result: 1A Descripition: UVa 10205 Stack em Up*/#include #include #include using namespace std;int data[110][60];int resul
2010-04-20 21:07:00 1240
原创 UVa 10315 - Poker Hands
/* File: 10315.cpp Author: ACboy Date: 2010-4-19 Result: 1A Descripition: UVa 10315 - Poker Hands*/#include #include #include using namespace std;struct Card { int value;
2010-04-20 09:40:00 1175
原创 UVa 706 - LCD Display
/* File: 706.cpp Author: ACboy Date: 2010-4-19 Result: AC Descripition: UVa 706 - LCD Display*/#include using namespace std;// 硬编码把0123456789的矩阵表示保存在digit中。char digit[5][31] =
2010-04-19 21:22:00 1250
原创 ZOJ 2136(最长递增子序列)
好久没AC了,最近真他妈烦,被人耍了。/* File: 2136.cpp Author: ACboy Date: 2010-4-10 Result: AC Descripition: zoj 2136*/#include using namespace std;int data[1100];int ans[1100];int main()
2010-04-16 10:32:00 1048
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人