
ZOJ
文章平均质量分 59
stdwal
天演在化,功成在学。知海无涯,见花问道。
展开
-
ZOJ1042-W`s Cipher
#include #include struct CGroup{ char c; int p;};int main(){ int i, j; int k1, k2, k3; char message[128]; CGroup group1[82], group2[82], group3[82]; while (sca原创 2016-01-29 14:08:58 · 403 阅读 · 0 评论 -
ZOJ1037-Gridland
#include int main(){ int t; double m ,n; scanf("%d", &t); for (int i = 1; i <= t; i++) { scanf("%lf%lf", &m, &n); printf("Scenario #%d:\n", i); if ((int原创 2016-01-22 14:00:50 · 553 阅读 · 0 评论 -
ZOJ1045-HangOver
#include int main(){ double c; int n; double sum; while (scanf("%lf", &c) == 1 && c) { sum = 0; n = 2; while (sum < c) { sum += 1.0 / n;原创 2016-01-22 14:07:57 · 673 阅读 · 0 评论 -
ZOJ1049-I Think I Need a Houseboat
#include #include const double PI = 3.1415926;int main(){ int n; double x, y; int z; double r; double s; scanf("%d", &n); for (int i = 1; i <= n; i++) { s原创 2016-01-22 14:32:10 · 406 阅读 · 0 评论 -
ZOJ1058-Currency Exchange
#include #include int main(){ double rate[6][6]; int trip[11]; int cases; int n; int flag = 0; double dollor = 0.0; scanf("%d", &cases); for (int i = 0; i < ca原创 2016-01-22 15:40:39 · 497 阅读 · 0 评论 -
ZOJ1067-Color Me Less
#include #include struct stdcolor{ int R; int G; int B;};stdcolor col[16];double distance(stdcolor c, stdcolor co){ double dis; dis = pow(c.R - co.R, 2) + pow(c.G - co.G,原创 2016-01-23 11:07:18 · 409 阅读 · 0 评论 -
ZOJ1078-Palindrom Numbers
#include #include int digit[120000];int con[15];int len;void trans(int num, int base){ int i = 0; for ( ; ; ) { digit[i] = num % base; if (!(num /= base)) b原创 2016-01-23 12:11:33 · 760 阅读 · 0 评论 -
ZOJ1005-Jugs
#include int main(){ int a, b, t, n;; while (scanf("%d%d%d", &a, &b, &n) == 3) { t = 0; while (t != n) { printf("fill A\n"); printf("pour A B\n");原创 2016-01-27 12:54:09 · 397 阅读 · 0 评论 -
ZOJ1006-Do the Untwist
#include #include char plaintext[72];char ciphertext[72];int plaincode[72];int ciphercode[72];int k;unsigned long n;void decrypt(){ for (int i = 0; i < n; i++) { if (plaincode[i原创 2016-01-27 12:56:41 · 359 阅读 · 0 评论 -
ZOJ1016-Parencodings
#include int main(){ int t; int p[25]; int pair[25]; p[0] = 0; char s[45]; scanf("%d", &t); while (t--) { int n; scanf("%d", &n); int i;原创 2016-01-27 16:42:39 · 356 阅读 · 0 评论 -
ZOJ1024-Calendar Game
#include int main(){ int n, year, month, day; scanf("%d", &n); while (n--) { scanf("%d%d%d", &year, &month, &day); if (month == 9 && day == 30) { printf("YES原创 2016-01-28 10:20:37 · 584 阅读 · 0 评论 -
ZOJ1003-Crashing Balloon
#include#includeusing namespace std;bool f1, f2;void dfs(int numa, int numb, int k){ if(numb == 1) { f2 = true; if(numa == 1) f1 = true; /*在numb分解完成的情况下,查看numa是否原创 2016-01-28 12:13:57 · 318 阅读 · 0 评论 -
The 13th Zhejiang Provincial Collegiate Programming Contest 部分题解
A-Apples and Ideas签到题。相互交换苹果和想法,苹果互换,想法相加。#include <cstdio>int main(){ int t; scanf("%d", &t); while (t--) { int a, b, c, d; scanf("%d%d%d%d", &a, &b, &c, &d); print原创 2016-09-16 18:36:58 · 511 阅读 · 0 评论