yzl_rex

#include "iostream"#include "cmath"using namespace std;const double ip = 3.1415926;const int square = 50;int main(){ int TestCase, casecount = 0; cin >> TestCase; while (TestCase

#include "iostream"using namespace std;const int month = 12;int main(){ double money[12], sum = 0.0, average = 0.0; for (int i = 0; i < 12; i++) { cin >> money[i]; sum += money[i];

//虽然是一道水题，但是需要考虑的方面也挺多的，最开始没有考虑到需要进行三级排序：名字>年份>价格//考虑到三级排序之后又没有考虑到格式，哎，编程真的很需要细腻的心思！所以WA了几次！下次需要注意了！#include "iostream"#include "vector"#include "string"#include "algorithm"using namespace

#include "iostream"#include "string"using namespace std;int main(){ int TestCase, casecount = 0; cin >> TestCase; while (TestCase--) { string str; cin >> str; casecount++;

#include "iostream"#include "map"#include "string"using namespace std;int main(){ string line; while (getline(cin, line) && line[0] != '#') { map m; char ch = 'A'; for (int

#include "iostream"#include "string"using namespace std;int main(){ int TestCase; cin >> TestCase; while (TestCase--) { string str, first; int length, count = 0; cin >> str;

#include "iostream"using namespace std;int main(){ int TestCase; while (cin >> TestCase) { while (TestCase--) { int Num, i = 0, temp, flag = 0; cin >> Num; while (1) {

#include "iostream"#include "vector"using namespace std;int main(){ double num; int length; double ans; vector v; while ( 1) { cin >> num; if (num == 999) break; v.push_ba

#include "iostream"#include "string"#include "sstream"#include "stdio.h"#include "algorithm"using namespace std;int main(){ int TestCase; cin >> TestCase; while (TestCase--) {

//这一题和2478差不多，只不过是字符串变长了，如果用cout频繁输出的情况下就会超时！所以用printf！#include "iostream"#include "string"#include "stdio.h"using namespace std;int main(){ int TestCase; cin >> TestCase; while (T

#include "iostream"#include "string"#include "algorithm"using namespace std;int main(){ int TestCase; while (cin >> TestCase) { while (TestCase--) { int num; cin >> num

#include "iostream"using namespace std;int main(){ int TestCase; cin >> TestCase; while (TestCase--) { int num, sum = 0, temp, ans; cin >> num; for (int i = 0; i < num; i++)

#include "iostream"using namespace std;int main(){ int num; while (cin >> num && num != 0) { int count = 0, ans = 1; while (num % 2 != 1) { count++; num /= 2; } fo

//这一题先将绳的最大承受力从大到小排序，然后再逐个逐个判断找出最大的重量就可以！//分析一下题目就很容易理解题目所要求的意思了，就开始我以为要用动态规划来完成的！仔细分析之后才知道原来很简单的一题！#include "iostream"#include "vector"#include "algorithm"using namespace std;bool mycom

#include "iostream"#include "math.h"#includeusing namespace std;int main(){ int TestCase; cin >> TestCase; while (TestCase--) { int s1, s2, ans1, ans2; cin >> s1 >> s2; i

//这一题主要用到map映射器！要注意进位的处理就可以了！到相加到最后，还需要注意是否有进位！#include "iostream"#include "map"#include "string"#include "algorithm"using namespace std;int main(){ map m; map mm; char ch1 = '0'

#include "iostream"using namespace std;int main(){ int TestCase; cin >> TestCase; while (TestCase--) { int num1, num2; cin >> num1 >> num2; if (num1 >= num2) cout << "MMM

#include "iostream"#include "vector"using namespace std;int main(){ int N, M, casecount = 0; while (cin >> N >> M && N != 0 && M != 0) { vectorr; vectorg; vectorb; int red,

#include "iostream"#include "vector"#include "algorithm"using namespace std;struct Info//存储输入食物的信息{ double JavaBean; double CatFood; double rate;};bool mycomp (Info a, Info b)/

#include "iostream"using namespace std;int main(){ int num; while (cin >> num) { int a, b, c, temp; temp = num; c = num % 10; num = num / 10; b = num % 10; a = num / 10

//这一题比较简单，主要是想得明白其中的走法就容易解决了！分两种情况！#include "iostream"#include "cmath"using namespace std;const double a = sqrt(double (2));int main(){ int TestCase, casecount = 0; cin >> TestCase

ZOJ题目分类初学者题：1001 1037 1048 1049 1051 1067 1115 1151 1201 1205 1216 1240 1241 1242 1251 1292 1331 1334 1337 1338 1350 1365 1382 1383 1394 1402 1405 1414 1494 1514 1622 1715 1730 1755 1760 1763 17

#include "iostream"using namespace std;int main(){ int TestCase, casecount = 0; cin >> TestCase; while (TestCase--) { int money, Q, D, N, P; casecount++; cin >> money; Q

#include "iostream"#include "map"using namespace std;int main(){ map m; int count = 0, N, num = 1; while (1)//先将这些数建立在map容器中，然后再查找！ { if (num % 3 == 0 || num % 5 == 0) { co

#include "iostream"#include "map"#include "string"#include "ctype.h"using namespace std;int main(){ string input; map m; char ch = 'A'; for (int i = 0; i < 21; i++) m.insert(p

#include "iostream"#include "string"#include "map"using namespace std;int main(){ map m; string str1, str2; while (getline(cin, str1) && str1 != "")//从行输入中分隔两个字符串出来！ { int leng

#include "iostream"#include "cmath"using namespace std;int main(){ double B, N; while (cin >> B >> N && B && N) { int A = 0; A = pow(double (B), double (1/N)); if (B - pow(dou

#include "iostream"using namespace std;int main(){ int TestCase; while (cin >> TestCase && TestCase != -1) { int s, t, temp = 0, ans = 0; for (int i = 0; i < TestCase; i++) {

#include "iostream"#include "set"using namespace std;int main(){ set s; set::iterator it; int temp; while (cin >> temp && temp != -1) { if (temp != 0) s.insert(temp);//放进容器中

#include "iostream"using namespace std;int main(){ double num; while (cin >> num && num) { double sum = 0; double count = 0, n = 2; while (1) { if (sum > num) break;

#include "iostream"#include "string"#include "vector"using namespace std;int main(){ int num, i; vector v; while (cin >> num && num) { v.clear(); for (i = 2; i < 17; i++)//从2

#include "iostream"using namespace std;int main(){ int players; while (cin >> players && players) { int count = 0, a, b; while (players) { if (players == 1) { cout

#include "iostream"using namespace std;int main(){ int num; while (cin >> num && num) { int count = 0, temp = 0; while (num != 1) { temp = num % 2; num /= 2; num +=

//一题物理题，公式是：VR = VS * R * C * W / sqrt(double (R * R * C * C * W * W + 1))#include "iostream"#include "cmath"using namespace std;int main(){ double VS, R, C, W; int TestCase; while (

#include "iostream"#include "vector"#include "string"using namespace std;struct Info//注意这里的类型要为short，如果是int的情况下会超内存！{ short int year; short int day; short int month;};bool IsLe

#include "iostream"#include "string"#include "algorithm"using namespace std;int main(int argc, char* argv[]){ string str; while (cin >> str) { string ss = str; int length = s

//这题需要先将给出的数字当字符串输入，然后再进行字符串的排序，最后在字符串中进行字串的查找！#include "iostream"#include "string"#include "vector"#include "algorithm"using namespace std;int main(){ int TestCase; cin >> TestCas

//这题我以为是大数相乘的问题，以为会好复杂，原来一百度，是数论的内容，//看来我想得还不是很深入！隔了一段时间没有做题，完全没有状态！#include "iostream"using namespace std;int main(){ int num1; cin >> num1; while (num1--) { int N, num2 = 0; cin >> N;

#include "iostream"using namespace std;int main(){ int TestNum, i, x, y, dot = 0; cin >> TestNum; for (i = 1; i <= TestNum; i++) { cin >> x >> y; if (x != y && y != x - 2) cout << "No N

//发觉自己很久没有做过题了，这题思考了很久都没有思考出来，最后只有百度一下！哎！#include "iostream"#include "string.h"using namespace std;int main(){ int i, j, num; int a[55]; char ch; while (cin >> num && num) { cin >> ch;