- 博客(11)
- 收藏
- 关注
原创 51nod 1101 DP
N元钱换为零钱,有多少不同的换法?币值包括1 2 5分,1 2 5角,1 2 5 10 20 50 100元。 例如:5分钱换为零钱,有以下4种换法: 1、5个1分 2、1个2分3个1分 3、2个2分1个1分 4、1个5分 (由于结果可能会很大,输出Mod 10^9 + 7的结果) Input 输入1个数N,N = 100表示1元钱。(1 Outpu
2017-11-03 17:42:08
128
原创 Dijkstra HDU 3790
#include #include #include #include #include using namespace std; #define inf 1 int used[1005]; struct node { int x; int d; int p; node(){} node(int a, int b, int c) { x = a; d = b; p =
2017-10-18 20:09:37
134
原创 Dijkstra HDU 1874
#include #include using namespace std; /* Dijkstra的算法思想: 在所有没有访问过的结点中选出dis(s,x)值最小的x 对从x出发的所有边(x,y),更新 dis(s,y)=min(dis(s,y),dis(s,x)+dis(x,y)) */ #include #include #include using names
2017-10-16 19:15:39
138
原创 HDU 1016
#include #include int isprime[40] = { 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0 }; int path[40]; int vis[40]; int n;
2017-09-29 14:57:50
131
原创 HDU 1003
#include #include #include using namespace std; int dp[100005]; int a[100005]; int num = 1; int main() { int t; scanf("%d", &t); while (t--) { memset(dp, 0, sizeof
2017-09-28 20:37:15
166
原创 POJ 3660
#include #include int n, m; int mp[105][105]; void floyd() { for (int k = 1; k for (int j = 1; j for (int i = 1; i mp[i][j] = mp[i][j] || (mp[i][k] && mp[k][j]); } int main() { while (
2017-09-26 22:33:20
204
原创 POJ 2586
Y2K Accounting Bug Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 15946 Accepted: 7997 Description Accounting for Computer Machinists (ACM) has sufferred
2017-09-18 19:54:36
307
原创 HDU 2054
A == B ? Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 109296 Accepted Submission(s): 17488 Problem Description Give you two numbe
2017-09-16 12:57:38
208
原创 POJ 1753
Flip Game Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 46827 Accepted: 20042 Description Flip game is played on a rectangular 4x4 field with two-sided p
2017-09-14 18:14:24
129
空空如也
sample_uavtrack.gpx
2023-09-04
TA创建的收藏夹 TA关注的收藏夹
TA关注的人