1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363
| #include <iostream> #include <algorithm> #include <string.h> using namespace std; #include <vector>
struct Product { int id; char name[100]; float price; int num;
bool operator==(const Product &other) const { return id == other.id; } };
vector<Product> List, Car;
void addProduct() { Product New;
printf("\n请输入新商品的id(id不可更改): "); scanf("%d", &New.id);
while (count(List.begin(), List.end(), Product{New.id})) { printf("\n\a此id已经被使用!(1-重新输入/0-返回)请选择:"); int op; scanf("%d", &op); if (op == 1) { printf("\n请输入新商品的id(id不可更改): "); scanf("%d", &New.id); } else if (op == 0) { printf("\n"); return; } else printf("\n\a没有该选项!\n"); }
printf("\n输入新商品的名称: "); scanf("%s", New.name); printf("\n输入新商品的价格: "); scanf("%f", &New.price); printf("\n输入新商品的库存: "); scanf("%d", &New.num);
List.push_back(New);
printf("\n添加成功!\n\n"); }
void deleteProduct() { int id; printf("\n输入要删除的商品id: "); scanf("%d", &id);
auto it = find(List.begin(), List.end(), Product{id}); if (it != List.end()) List.erase(it); else { printf("\n\a找不到id为%d的商品!\n\n", id); return; }
printf("\n删除成功!\n\n"); }
void printAllProducts() { for (auto i : List) { printf("\n===========================================================================================\n"); printf(" ID: %12d, 名称: %20s, 价格: %16.2f, 库存: %13d", i.id, i.name, i.price, i.num); } printf("\n===========================================================================================\n\n"); }
void deleteCarProduct() { int carid, carnum; printf("\n请输入要删除的商品的id: "); scanf("%d", &carid); auto it = find(Car.begin(), Car.end(), Product{carid}); int i = distance(Car.begin(), it); if (it != Car.end()) { printf("\n请输入要删除的数量: "); scanf("%d", &carnum); if (carnum < Car[i].num) Car[i].num -= carnum; else Car.erase(it); printf("\n删除成功!\n"); } else printf("\n\a购物车里没有id为%d的商品!\n", carid); }
void payAll() { for (auto i : Car) { auto it = find(List.begin(), List.end(), Product{i.id}); if (it->num > i.num) List[distance(List.begin(), it)].num -= i.num; else List.erase(it); } Car.clear(); printf("\n购买成功!\n"); }
void printCarProducts() { int op = 1; while (op) { float cnt = 0; for (auto i : Car) { printf("\n===========================================================================================\n"); printf(" ID: %12d, 名称: %20s, 数量: %13d, 总价:%16.2f", i.id, i.name, i.num, i.price * i.num); cnt += i.price * i.num; } printf("\n===========================================================================================\n"); printf(" 总价: %20.2f (1-支付全部/2-清空/3-删除商品/0-返回)", cnt); printf("\n===========================================================================================\n"); printf("\n请输入操作:"); scanf("%d", &op); switch (op) { case 1: payAll(); break; case 2: Car.clear(); printf("\n已清除全部商品!\n"); break; case 3: deleteCarProduct(); break; case 0: printf("\n"); break; default: printf("\n\a没有该选项!\n"); } } }
bool cmp(Product A, Product B) { return A.id < B.id; }
void sortPrintAll(vector<Product> A) { sort(A.begin(), A.end(), cmp);
for (auto i : A) { printf("\n===========================================================================================\n"); printf(" ID: %12d, 名称: %20s, 价格: %16.2f, 库存: %13d", i.id, i.name, i.price, i.num); } printf("\n===========================================================================================\n\n"); }
void checkProduct(int key) { int id, n; printf("\n输入要查询的商品的id: "); scanf("%d", &id);
auto it = find(List.begin(), List.end(), Product{id}); int i = distance(List.begin(), it);
if (it != List.end()) { printf("\n===========================================================================================\n"); printf(" ID: %12d, 名称: %20s, 价格: %16.2f, 库存: %13d", List[i].id, List[i].name, List[i].price, List[i].num); printf("\n===========================================================================================\n\n");
if (key == 1010) { printf("(n-将n件该商品加入购物车/0-返回): "); scanf("%d", &n);
if (n) { Product buy{List[i].id, "", List[i].price, n}; strcpy(buy.name, List[i].name);
auto inCar = find(Car.begin(), Car.end(), Product{id}); int j = distance(Car.begin(), inCar); if (inCar != Car.end()) Car[j].num += n; else Car.push_back(buy); printf("\n添加成功!\n"); } printf("\n"); } } else printf("\n\a找不到ID为%d的商品!\n\n", id); }
void reProduct() { int id; printf("\n输入要修改商品的id: "); scanf("%d", &id);
auto it = find(List.begin(), List.end(), Product{id}); int i = distance(List.begin(), it);
if (it != List.end()) { int op; bool over = true;
while (over) { printf("\nID: %d, 名称: %s, 价格: %.2f, 库存: %d\n\n", List[i].id, List[i].name, List[i].price, List[i].num); printf("要修改什么(名称-1/价格-2/库存-3/完成-0): "); scanf("%d", &op);
switch (op) { case 1: printf("\n请输入修改后的商品名称: "); scanf("%s", List[i].name); printf("\n修改成功!\n"); break; case 2: printf("\n请输入修改后的商品价格: "); scanf("%f", &List[i].price); printf("\n修改成功!\n"); break; case 3: printf("\n请输入修改后的商品库存: "); scanf("%d", &List[i].num); printf("\n修改成功!\n"); break; case 0: over = false; printf("\n修改完成!\n\n"); break; default: printf("\n\a没有该选项!\n"); } } } else printf("\n\a找不到ID为%d的商品!\n\n", id); }
int main() { List.push_back(Product{10001, "样品1", 10, 100}); List.push_back(Product{10002, "样品2", 2.5, 2000}); List.push_back(Product{10003, "样品3", 1024, 5}); int key, op; bool login;
while (1) { printf("登录...\n请输入身份密钥(客户-1010/商家-2020/退出系统-0): "); scanf("%d", &key);
login = true; switch (key) { case 2020: printf("\n您好!商家:\n\n");
while (login) { printf("1-添加商品\n2-删除商品\n3-显示所有商品\n4-Id升序显示所有商品\n5-查询单个商品信息\n6-修改商品信息\n0-返回登录界面\n"); printf("请选择您要进行的操作: "); scanf("%d", &op);
switch (op) { case 1: addProduct(); break; case 2: deleteProduct(); break; case 3: printAllProducts(); break; case 4: sortPrintAll(List); break; case 5: checkProduct(key); break; case 6: reProduct(); break; case 0: login = false; printf("\n"); break; default: printf("\n\a没有该选项!\n\n"); } } break; case 1010: printf("\n您好!客户:\n\n");
while (login) { printf("1-显示所有商品\n2-Id升序显示所有商品\n3-查询单个商品信息\n4-查看购物车\n0-返回登录界面\n"); printf("请选择您要进行的操作: "); scanf("%d", &op);
switch (op) { case 1: printAllProducts(); break; case 2: sortPrintAll(List); break; case 3: checkProduct(key); break; case 4: printCarProducts(); break; case 0: login = false; printf("\n"); break; default: printf("\n\a没有该选项!\n\n"); } } break; case 0: exit(0); default: printf("\n\a请输入正确的密钥!\n\n"); } }
return 0; }
|