喂!菜鸟,还没累死呢吧?
omowox
这个作者很懒,什么都没留下…
展开
-
HDU 2029
#include#includeusing namespace std;int main(){ int l, r, n; string line; bool ans; while(cin >> n) { while(n--) { cin >> line; l = 0,原创 2015-01-12 16:57:52 · 472 阅读 · 0 评论 -
POJ1046
#include #include #include using namespace std;double sample[20][5];int main(){ double d, temp1, temp2; int a, b, c, ans; memset(sample, '\0', sizeof(sample)); for(int i = 0; i < 16; i++)原创 2015-02-26 18:25:04 · 385 阅读 · 0 评论 -
HDU 2027
#include#include#include#includeusing namespace std;#define MAXN 300int main(){ int n, length; int ans[MAXN]; string line; while(cin >> n) { getline(cin, line);原创 2014-12-12 07:43:54 · 394 阅读 · 0 评论 -
HDU 2026
#include#include#includeusing namespace std;int main(){ string line; bool word; int length; while(getline(cin, line)) { length = line.size(); word = true;原创 2014-12-11 22:28:55 · 402 阅读 · 0 评论 -
HDU 2021
#includeusing namespace std;int main(){ int n, Count, tea; int rmb[6] = {100, 50, 10, 5, 2, 1}; while(cin >> n) { if(!n) break; Count = 0; while原创 2014-12-11 08:20:53 · 384 阅读 · 0 评论 -
HDU 2017
#include#includeusing namespace std;int main(){ string line; long long n, ans; while(cin >> n) { while(n--) { cin >> line; ans = 0;原创 2014-12-10 21:30:55 · 316 阅读 · 0 评论 -
HDU 2002
#include#include#includeusing namespace std;#define PI 3.1415927#define C 4.0/3.0int main(){ double r, ans; while(cin >> r) { ans = C * PI * pow(r, 3); cout << fix原创 2014-12-10 21:13:05 · 408 阅读 · 0 评论 -
HDU 2025
#include#includeusing namespace std;int main(){ string line; char Max; int length; while(cin >> line) { length = line.size(); Max = 'A'; for(int i = 0;原创 2014-12-11 08:24:38 · 343 阅读 · 0 评论 -
HDU 2012
#includeusing namespace std;#define N (n*n + n + 41)bool prn(int n){ for(int i = 2; i < N; i++) if((N % i) == 0) return false; return true;}int main(){ int x,原创 2014-12-10 21:22:34 · 449 阅读 · 0 评论 -
POJ 1004
#include #include using namespace std;int main(){ double ans = 0.0, data; for(int i = 0; i < 12; i++) { cin >> data; ans += data; } cout << fixed; cout << setprecision(2) << '$' << ans /原创 2015-02-14 12:58:05 · 396 阅读 · 0 评论 -
POJ 1003
#include #include using namespace std;int main(){ double ans = 0.0, data; for(int i = 0; i < 12; i++) { cin >> data; ans += data; } cout << fixed; cout << setprecision(2) << '$' << ans /原创 2015-02-14 12:56:22 · 405 阅读 · 0 评论 -
Codeforces_50A
#include using namespace std;int main(){ int row, column; while(cin >> row >> column) { cout << row * column / 2 << endl; } return 0;}又是一道,没想到会一遍过的题。原创 2015-12-01 09:11:04 · 361 阅读 · 0 评论 -
Codeforces_158B
#include using namespace std;#define MAXN 100010int sc[MAXN];int main(){ int groups, ans; int N1, N2, N3, N4; while(cin >> groups) { ans = N1 = N2 = N3 = N4 = 0; for(int i = 0; i < gro原创 2015-12-01 23:31:07 · 309 阅读 · 0 评论 -
Codeforces_4A
#include using namespace std;int main(){ int w; while(cin >> w) { if((w-2) % 2 == 0 && (w >= 4)) cout << "YES" << endl; else cout << "NO" << endl; } return 0;} 把W分开放在两个盒子里,每个盒子里的数原创 2015-11-23 15:52:25 · 240 阅读 · 0 评论 -
POJ1316
转载自:Slicer的技术交流栈#includeint main(){ int n=1,a[10050]={0},i,tmp; for(i=1;i<10000;i++) { n=tmp=i; while(tmp) { n+=tmp%10; tmp/=10;转载 2015-08-31 11:57:55 · 353 阅读 · 0 评论 -
Codeforces_158A
#include #include using namespace std;int p[55];int main(){ int n, k, ans; while(cin >> n >> k) { memset(p, 0, sizeof(p)); ans = 0; for(int i = 0; i < n; i++) cin >> p[i]; for(in原创 2015-11-29 12:18:13 · 442 阅读 · 0 评论 -
Codeforces_231A
#include using namespace std;int main(){ int view[5]; int sum, Count, ans; while(cin >> Count) { ans = 0; for(int i = 0; i < Count; i++) { sum = 0; cin >> view[0] >> view[1] >> vie原创 2015-12-01 23:29:50 · 352 阅读 · 0 评论 -
POJ1477
#include using namespace std;int main(){ int n, average, sum, ans, data[1010], Count = 0; while(cin >> n) { if(n == 0) break; sum = ans = 0; Count++; for(int i = 1; i <= n; i++) {原创 2015-08-20 20:16:26 · 328 阅读 · 0 评论 -
POJ1450
没想过一次就AC#include #include #include using namespace std;int main(){ int Count,length, broad; double ans; cin >> Count; for(int i = 1; i <= Count; i++) { cin >> length >> broad; ans = l原创 2015-08-31 11:50:59 · 372 阅读 · 0 评论 -
HDU 2023
#include#includeusing namespace std;#define ROWS 55#define COLUMNS 10int main(){ int n, m, ans; double grade[ROWS][COLUMNS]; double temp_r, temp_c; bool judge; while(cin >>原创 2014-12-11 08:22:48 · 546 阅读 · 0 评论 -
HDU 2019
#includeusing namespace std;int main(){ int n, m, data; bool first; while(cin >> n >> m) { if(!n && !m) break; first = true; for(int i = 0; i <原创 2014-12-11 08:18:14 · 423 阅读 · 0 评论 -
HDU 2022
#include#includeusing namespace std;#define MAXN 1000int MM[MAXN][MAXN];int main(){ int m, n, r, c, cmp; while(cin >> m >> n) { cmp = 0; for(int i = 1; i <= m; i++原创 2014-12-11 08:21:46 · 500 阅读 · 0 评论 -
HDU 2014
#include#include#include#includeusing namespace std;int main(){ int n, score, mi, ma; double ans; while(cin >> n) { mi = INT_MAX; ma = INT_MIN; ans = 0.0原创 2014-12-10 21:26:56 · 497 阅读 · 0 评论 -
HDU 2004
#includeusing namespace std;int main(){ int n; char ans; while(cin >> n) { if(n > 100 || n < 0) cout << "Score is error!" << endl; else {原创 2014-12-10 21:15:02 · 382 阅读 · 0 评论 -
HDU 2000
#include#includeusing namespace std;#define MAXN 10/*bool cmp (char a, char b){ return 'a' > 'b';}*/int main(){ char letter[MAXN]; while(cin >> letter[0] >> letter[1] >> letter[原创 2014-12-10 21:10:18 · 399 阅读 · 0 评论 -
HDU 2015
#includeusing namespace std;#define N1 (n / m)#define N2 (n % m)int main(){ int n, m, base; while(cin >> n >> m) { base = 2; for(int i = 0; i < N1; i++) {原创 2014-12-10 21:28:31 · 331 阅读 · 0 评论 -
HDU 2005
#includeusing namespace std;#define BIS (year % 4 == 0 && year % 100 != 0 || year % 400 == 0)int main(){ int months[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; int year, m原创 2014-12-10 21:15:48 · 360 阅读 · 0 评论 -
HDU 2003
#include#include#includeusing namespace std;int main(){ double n, ans; while(cin >> n) { ans = abs(n); cout << fixed; cout << setprecision(2) << ans << endl;原创 2014-12-10 21:14:14 · 600 阅读 · 0 评论 -
HDU 2007
#include#includeusing namespace std;int main(){ int ans_1, ans_2, l, r; while(cin >> l >> r) { ans_1 = ans_2 = 0; if(l > r) l = l + r, r = l - r, l = l - r原创 2014-12-10 21:17:40 · 475 阅读 · 0 评论 -
HDU 2008
#include#includeusing namespace std;int main(){ double data; long long n, z, p, num; while(cin >> num) { n = z = p = 0; if(!num) break; for(int原创 2014-12-10 21:18:39 · 383 阅读 · 0 评论 -
HDU 2009
#include#include#includeusing namespace std;int main(){ int n, m; long double ans, rat; while(cin >> n >> m) { ans = rat = n; for(int i = 0; i < m - 1; i++)原创 2014-12-10 21:19:32 · 527 阅读 · 0 评论 -
HDU 2016
#include#includeusing namespace std;#define MANX 110int main(){ int n, num, mi, index; int data[MANX]; while(cin >> n) { if(!n) break; mi = INT_MAX;原创 2014-12-10 21:29:46 · 366 阅读 · 0 评论 -
HDU 2011
#include#include#includeusing namespace std;int main(){ int m, n; double ans, mid; while(cin >> m) { while(m--) { ans = 0.0; cin >> n;原创 2014-12-10 21:21:39 · 297 阅读 · 0 评论 -
HDU 2001
#include#include#includeusing namespace std;int main(){ double x1, y1, x2, y2, ans; while(cin >> x1 >> y1 >> x2 >> y2) { ans = sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2));原创 2014-12-10 21:11:54 · 420 阅读 · 0 评论 -
HDU 2020
#include#include#includeusing namespace std;#define MAXN 110bool cmp(int a, int b){ return abs(a) > abs(b);}int main(){ int n; int data[MAXN]; while(cin >> n) {原创 2014-12-11 08:19:38 · 509 阅读 · 0 评论 -
HDU 2013
#includeusing namespace std;int main(){ int n, peach; long long ans; while(cin >> n) { ans = 1; for(int i = 0; i < n - 1; i++) ans = (ans + 1) * 2;原创 2014-12-10 21:24:10 · 347 阅读 · 0 评论 -
HDU 2010
#include#includeusing namespace std;#define S (pow(i/100, 3) + pow(i%100/10, 3) + pow(i%10, 3))int main(){ int m, n; bool no, first; while(cin >> m >> n) { no = first =原创 2014-12-10 21:20:42 · 348 阅读 · 0 评论 -
HDU 2006
#includeusing namespace std;int main(){ long long n, da, ans; while(cin >> n) { ans = 1; while(n--) { cin >> da; if((da % 2) != 0)原创 2014-12-10 21:16:46 · 433 阅读 · 0 评论 -
HDU 2024
#include#include#includeusing namespace std;int main(){ int n, length; string line; char t; bool con, res; while(cin >> n) { getline(cin, line); while(n--原创 2014-12-11 08:23:49 · 400 阅读 · 0 评论 -
Codeforces_71A
#include #include using namespace std;int main(){ string letters; int n, length; while(cin >> n) { for(int i = 0; i < n; i++) { cin >> letters; length = letters.size(); if(length原创 2015-11-29 12:15:29 · 345 阅读 · 0 评论