- 博客(4)
- 收藏
- 关注
RSS订阅转载 pat 1009 Product of Polynomials
#include<stdio.h> #include<vector> #include<string.h> using namespace std; struct element{ int n; float an; }; float result[2000]; int main(){ int k1, k2...
2017-02-07 22:11:00
72
转载 ZOJ1016
#include<stdio.h> #define MAX 21 int t, n; int arr[MAX]; int main(){ scanf("%d", &t); while (t--){ scanf("%d", &n); for (int i = 0; i < 20; i++){ arr[i] = 0; ...
2017-02-01 15:25:00
103
转载 PAT 1001. A+B Format
#include<stdio.h> int a, b; int sum; int main(){ while (scanf("%d %d", &a, &b)!=EOF){ sum = a + b; if (sum < 1000&&sum>-1000)printf("%d\n", sum); else{...
2017-01-21 03:02:00
71
转载 PAT 1002. A+B for Polynomials
#include<stdio.h> #include<string.h> double coefficient[1010]; int k1, k2,k3=0; int nk; int max_exponent1, max_exponent2; int min_exponent1, min_exponent2; int main(){ mem...
2017-01-21 02:59:00
54
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人