- 博客(32)
- 收藏
- 关注
原创 HDOJ2054(大数处理)
#include #include #include #include #include #include #include using namespace std;#define N 110string s1, s2;int sw(string s) //有符号开头的 {if (s[0] == '+'||s[0]=='-
2017-09-29 20:54:26 396
原创 HDOJ2035(次方末位)
#include #include #include #include #include #include #include using namespace std;#define N 110int a[N];int b[N];int main(){int n, m;while (cin >> n >> m, n,
2017-09-29 07:45:28 289
原创 HDOJ2032(杨辉三角)
#include #include #include #include #include #include #include using namespace std;#define N 110int a[N][N];void yh(){for (int i = 1; i for (int j = 1; j {if
2017-09-28 16:39:13 319
原创 HDOJ2031(十进制变X进制)
#include #include #include #include #include #include #include using namespace std;#define N 110int a[N];int main(){int n, m;while (cin >> n >> m){int f = 1;
2017-09-27 20:57:22 1176
原创 HDOJ2029(回文数)
#include #include #include #include #include #include #include using namespace std;#define N 110string s;int main(){int t;cin >> t;getchar();for (int i = 1;
2017-09-27 20:39:48 277
原创 HDOJ2028(最小公倍数)
#include #include #include #include #include #include #include using namespace std;#define N 110int a[N];int main(){int n;while (cin >> n){int i;for (i = 0
2017-09-27 20:33:56 340
原创 HDOJ2023
#include #include #include #include #include #include #include using namespace std;#define N 110double a[N]; //学生总分int b[N][N];double c[N]; //各科总分int main(){i
2017-09-27 19:24:44 283
原创 HDOJ2019
#include #include #include #include #include #include #include using namespace std;#define N 110int a[N];int main(){int n, m;while (cin >> n >> m, n, m){int
2017-09-27 15:57:10 170
原创 HDOJ2015
#include #include #include #include #include #include #include using namespace std;int a[101] = { 0 };int main(){for (int i = 1; i int n, m;while (cin >> n >> m)
2017-09-26 20:16:22 146
原创 HDOJ2013
#include #include #include #include #include #include #include using namespace std;int main(){int d;while (cin >> d){int s = 1;for (int i = d - 1; i > 0; i--){
2017-09-26 19:26:26 147
原创 HDOJ1098
#include #include #include #include using namespace std;int main(){int k;while (cin >> k){int flag = 0;int i;for (i = 0; i {if ((18 + k*i) % 65 == 0) //详见除法原理{
2017-09-23 20:53:36 224
原创 HDOJ1045
#include #include #include #include using namespace std;int n, sum;char map[10][10];bool judge(int x, int y){for (int i = x - 1; i >= 0; i--)//行判断{if (map[i][y] == '0') r
2017-09-14 19:35:48 220
原创 HDOJ2037
/*节目越早结束,就能看越多节目*/#include #include #include #include using namespace std;#define M 1005int num[M] = { 0 };struct aa{int s, e;}a[M];bool cmp(aa a, aa b){return
2017-09-13 18:13:17 217
原创 HDOJ1050
/*重叠回合数最多,占用时间最长*/#include #include #include #include using namespace std;#define M 1005struct aa{double j;double f;double s;}a[M];bool cmp(aa a,aa b) //bool型{
2017-09-13 18:12:35 234
原创 HDOJ1002
#include #include #include #include using namespace std;#define M 1005char a[M], b[M];void add(char a[], char b[]){int i, j;int a1[M] = { 0 }, b1[M] = { 0 };int l1 =
2017-09-13 18:09:38 264
原创 HDOJ1051
/*求最少序列数*/#include #include #include #include using namespace std;#define M 5010struct aa{int x, y;bool z ;}a[M];bool cmp(aa a, aa b){if (a.x == b.x) return a.y
2017-09-13 18:05:39 231
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人