OMOWOX

#include #include using namespace std; int main() { int l, r, n; string line; bool ans; while(cin >> n) { while(n--) { cin >> line; l = 0,

#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++)

#include #include #include #include using namespace std; #define MAXN 300 int main() { int n, length; int ans[MAXN]; string line; while(cin >> n) { getline(cin, line);

#include #include #include using namespace std; int main() { string line; bool word; int length; while(getline(cin, line)) { length = line.size(); word = true;

#include using 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

#include #include using namespace std; int main() { string line; long long n, ans; while(cin >> n) { while(n--) { cin >> line; ans = 0;

#include #include #include using namespace std; #define PI 3.1415927 #define C 4.0/3.0 int main() { double r, ans; while(cin >> r) { ans = C * PI * pow(r, 3); cout << fix

#include #include using namespace std; int main() { string line; char Max; int length; while(cin >> line) { length = line.size(); Max = 'A'; for(int i = 0;

#include using 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,

#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 /

#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 /

#include using namespace std; int main() { int row, column; while(cin >> row >> column) { cout << row * column / 2 << endl; } return 0; }又是一道，没想到会一遍过的题。

#include using namespace std; #define MAXN 100010 int 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

#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分开放在两个盒子里，每个盒子里的数

转载自:Slicer的技术交流栈 #include int 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;

#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

#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

#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++) {

没想过一次就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

#include #include using namespace std; #define ROWS 55 #define COLUMNS 10 int main() { int n, m, ans; double grade[ROWS][COLUMNS]; double temp_r, temp_c; bool judge; while(cin >>

#include using 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 <

#include #include using namespace std; #define MAXN 1000 int MM[MAXN][MAXN]; int main() { int m, n, r, c, cmp; while(cin >> m >> n) { cmp = 0; for(int i = 1; i <= m; i++

#include #include #include #include using namespace std; int main() { int n, score, mi, ma; double ans; while(cin >> n) { mi = INT_MAX; ma = INT_MIN; ans = 0.0

#include using namespace std; int main() { int n; char ans; while(cin >> n) { if(n > 100 || n < 0) cout << "Score is error!" << endl; else {

#include #include using 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[

#include using 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++) {

#include using 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

#include #include #include using namespace std; int main() { double n, ans; while(cin >> n) { ans = abs(n); cout << fixed; cout << setprecision(2) << ans << endl;

#include #include using 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

#include #include using namespace std; int main() { double data; long long n, z, p, num; while(cin >> num) { n = z = p = 0; if(!num) break; for(int

#include #include #include using 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++)

#include #include using namespace std; #define MANX 110 int main() { int n, num, mi, index; int data[MANX]; while(cin >> n) { if(!n) break; mi = INT_MAX;

#include #include #include using namespace std; int main() { int m, n; double ans, mid; while(cin >> m) { while(m--) { ans = 0.0; cin >> n;

#include #include #include using 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));

#include #include #include using namespace std; #define MAXN 110 bool cmp(int a, int b) { return abs(a) > abs(b); } int main() { int n; int data[MAXN]; while(cin >> n) {

#include using 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;

#include #include using 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 =

#include using namespace std; int main() { long long n, da, ans; while(cin >> n) { ans = 1; while(n--) { cin >> da; if((da % 2) != 0)

#include #include #include using namespace std; int main() { int n, length; string line; char t; bool con, res; while(cin >> n) { getline(cin, line); while(n--

#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