喵宅苑 MewoGarden × 技术宅社区II | Z站 Z Station 棒棒哒纯文字二次元技术社区
正文
作者:Mr_Alex
回复
作者:右眼
作者:michaelan
#include <stdio.h> int main() { int ans[500]; int ans_count = 0; for (int i = 1; i <= 1000; i++) { bool check = true; int sum = 0; for (int j = 1; j < i; j++) if (i % j == 0) sum += j; if (sum == i) { ans[ans_count++] = i; printf("%d\n", i); } } return 0;
#include <stdio.h> int main() { double height = 100.0; double journey = 100.0; for (int i = 1; i < 10; i++) { journey += height; height /= 2.0; } height /= 2.0; printf("journey = %lf\nheight = %lf\n", journey, height); return 0; }
#include <stdio.h> int print(int a, char b) { char c; if (a == 1) c = 'x'; else if (a == 2) c = 'y'; else c = 'z'; printf("%c-%c\n", b, c); } int main() { int a, b, c; // 1:x 2:y 3:z for (a = 1; a <= 3; a++) for (b = 1; b <=3; b++) if (a != b) { c = 6 - a - b; if (a == 1 || c == 1 || c == 3) continue; print(a, 'a'); print(b, 'b'); print(c, 'c'); } return 0; }
#include <stdio.h> int main() { int age[6]; age[1] = 10; age[2] = age[1] + 2; age[3] = age[2] + 2; age[4] = age[3] + 2; age[5] = age[4] + 2; printf("age=%d\n", age[5]); return 0; }
#include <stdio.h> /* 就当是正整数排序吧 ，输入若干个数，以-1结尾 * 输出的话从小到大排序好了 * 选择的是插入排序咯，因为链表插入快嘛，要利用起来哟 */ struct My_Link { int val; My_Link* next; }; int main() { My_Link* head = new My_Link; head->val = -1; head->next = NULL; // input data and sort int a; scanf("%d", &a); while (a >= 0) { My_Link* new_node = new My_Link; new_node->val = a; new_node->next = NULL; My_Link* now = head->next; My_Link* last = head; while (now != NULL && now->val < a) { last = now; now = now->next; } new_node->next = last->next; last->next = new_node; scanf("%d", &a); } // print data My_Link* now_node = head->next; while (now_node != NULL) { printf("%d\n", now_node->val); now_node = now_node -> next; } // recover memory while (head != NULL) { now_node = head; head = head->next; delete now_node; } return 0; }
#include <stdio.h> #include <string.h> void s_reverse_n(char* s, int n) { for (int i = 0; i < n / 2; i++) { char p = s[i]; s[i] = s[n - i - 1]; s[n - i - 1] = p; } } int main() { char a[50]; strcpy(a, "Hello world."); s_reverse_n(a, strlen(a)); printf("%s\n", a); return 0; }
#include <stdio.h> int main() { double profit; printf("profit = $ "); scanf("%lf", &profit); double bonus = 0.0; if (profit <= 100000) bonus = profit * 0.1; else if (profit <= 200000) bonus = 10000 + (profit - 100000) * 0.075; else if (profit <= 400000) bonus = 17500 + (profit - 200000) * 0.05; else if (profit <= 600000) bonus = 27500 + (profit - 400000) * 0.03; else if (profit <= 1000000) bonus = 33500 + (profit - 600000) * 0.015; else bonus = 39500 + (profit - 1000000) * 0.01; printf("bonus = $ %lf", bonus); return 0; }
#include <stdio.h> int main() { int ans = 1; // 9 times for (int i = 0; i < 9; i++) { ans += 1; ans *= 2; } printf("%d\n", ans); return 0; }
#include <stdio.h> int main() { int a[50]; int n; int max_i, min_i; printf("Input N = "); scanf("%d", &n); printf("Input %d numbers : ", n); for (int i = 0; i < n; i++) scanf("%d", &a[i]); max_i = 0; for (int i = 1; i < n; i++) if (a[i] > a[max_i]) max_i = i; int tmp = a[0]; a[0] = a[max_i]; a[max_i] = tmp; min_i = 0; for (int i = 1; i < n; i++) if (a[i] < a[min_i]) min_i = i; tmp = a[0]; tmp = a[n - 1]; a[n - 1] = a[min_i]; a[min_i] = tmp; for (int i = 0; i < n; i++) printf("%d ", a[i]); printf("\n"); return 0; }
#include <stdio.h> #include <stdlib.h> #include <string.h> #include <time.h> /* 以下实现的是RSA算法的阉割版 * 当然看着代码是可以破解的，因为把解密用的密匙也写在这了，实际中，P和Q是可以抛弃的，使用N、e进行加密，使用N、d进行解密 */ const unsigned long long P = 12301; const unsigned long long Q = 3217; unsigned long long gcd(unsigned long long a, unsigned long long b) { if (b == 0) return a; else return gcd(b, a % b); } unsigned long long x, y; void extend_Eulid(unsigned long long a, unsigned long long b) { if(b == 0) { x = 1; y = 0; } else { extend_Eulid(b, a%b); unsigned long long temp = x; x = y; y = temp - a / b * y; } } void get_key(unsigned long long P, unsigned long long Q, unsigned long long &N, unsigned long long &e, unsigned long long &d) { N = P * Q; unsigned long long R1 = P - 1; unsigned long long R2 = Q - 1; unsigned long long R = R1 * R2; unsigned long long one = 1; e = (P + Q) * ((long long) rand()) / 65535; while (gcd(e, R) != 1) e = e + one; extend_Eulid(e, R); d = x % R; } // return a^b (mod c) unsigned long long power(unsigned long long a, unsigned long long b, unsigned long long c) { unsigned long long two = 2; unsigned long long res = 1; while (b > 0) { if (b % two == 1) res = (res * a) % c; a = (a * a) % c; b = b / two; } return res; } void encode(unsigned long long code[], int& code_len, char s[], int len, unsigned long long N, unsigned long long e) { unsigned long long M = 0; unsigned long long ONE_CHAR = 128; code_len = 0; int c = 0; for (int i = 0; i < len; i++) { M = M * ONE_CHAR + ((unsigned long long) s[i]); c++; if (c % 3 == 0) { code[code_len++] = M; M = 0; c = 0; } } if (c != 0) code[code_len++] = M; for (int i = 0; i < code_len; i++) { code[i] = power(code[i], e, N); } } void decode(unsigned long long code[], int code_len, char s[], int &len, unsigned long long N, unsigned long long d) { unsigned long long ONE_CHAR = 128; len = 0; int last_len = 0; for (int i = 0; i < code_len; i++) { unsigned long long M = power(code[i], d, N); while (M > 0) { s[len++] = (unsigned char) (M % ONE_CHAR); M = M / ONE_CHAR; } char q = s[last_len]; s[last_len] = s[len - 1]; s[len - 1] = q; last_len = len; } } int main() { srand(time(0)); unsigned long long N, e, d; get_key(P, Q, N, e, d); printf("N=%I64d\ne=%I64d\nd=%I64d\n", N, e, d); printf("-----------------------------\n"); printf("Please input a string (length <= 20):\n"); char s[20]; gets(s); unsigned long long c[20]; int c_len = 0; encode(c, c_len, s, strlen(s), N, e); printf("After coding m = "); for (int i = 0; i < c_len; i++) printf("%I64d ", c[i]); printf("\n"); printf("After decoding s = "); int len; char t[20]; decode(c, c_len, t, len, N, d); for (int i = 0; i < len; i++) printf("%c", t[i]); printf("\n"); return 0; }
作者:jains521
作者:sora酱_
大概是这样滴...OTZ.. search的时候从head开始, 如果右边的比要找的item大就向下, 小就向右. 于是可以优化速度~╮(￣▽￣")╭~ 每个node都有2个reference, right和down. 然后层数是随机的...在insert 的method里面随机+8知道多少层... 图里面里面大框的数字是储存的item, 小框数字是skip number, 就是离同一排的下一个node相隔了多少个node. skip number其实是用于用index来找item的...不过题目米要求咱就8贴上来了... 贴上来的部分请无视self.skip这个attribute... [mw_shl_code=python,true]class SkipList: def __init__(self, container=[], prob=0.5): self.prob = prob self._tail = _TailNode() self._head = self._bottom = _HeadNode(self._tail, self._tail) for item in container: self.insert(item) def __contains__(self, item): return item in self._head def __iter__(self): return _SkipIter(self._bottom) def insert(self, item): while inserted is not None: inserted = _SkipNode(item, inserted, inserted.right, inserted.skip) self._head = _HeadNode(self._head, inserted, self._head.skip) if random.random() >= self.prob: inserted = None if self._head.right != self._tail: self._head = _HeadNode(self._head, self._tail, self._head.skip + self._head.right.skip) def remove(self, item): self._head.remove(item) while self._head.down.right == self._tail: self._head = self._head.down class _SkipNode(object): def __init__(self, item, down, right, skip): self.item = item self.down = down self.right = right self.skip = skip def __contains__(self, item): pred = self while pred.right.item < item: pred = pred.right return pred.right.item == item or item in pred.down def insert(self, item, prob): this_skip = 0 pred = self while pred.right.item < item: this_skip += pred.skip pred = pred.right inserted, below_skip = pred.down.insert(item, prob) pred.skip += 1 if inserted is not None: pred.right = _SkipNode(item, inserted, pred.right, pred.skip - below_skip) pred.skip = below_skip if random.random() < prob: return (pred.right, this_skip + pred.skip) return (None, 0) def remove(self, item): pred = self while pred.right.item < item: pred = pred.right removed = pred.down.remove(item) if pred.right.item == item: removed = pred.right pred.right = removed.right pred.skip += removed.skip if removed is not None: pred.skip -= 1 return removed class _TailNode(_SkipNode): class _TailItem(object): def __lt__(self, other): return False def __le__(self, other): return False def __init__(self): super().__init__(_TailNode._TailItem(), None, None, 0) def __contains__(self, item): return False def insert(self, item, prob): return (self, 1) def remove(self, item): return None class _HeadNode(_SkipNode): FIELD_WIDTH = 4 def __init__(self, down, right, skip=1): super().__init__(None, down, right, skip) def __str__(self): below = str(self.down) level = " -" + " " * (_HeadNode.FIELD_WIDTH + 4) * (self.skip - 1) while not isinstance(self.right, _TailNode): self = self.right level += ("> {{:>{}}} -".format(_HeadNode.FIELD_WIDTH) .format(repr(self.item)) + " " * (_HeadNode.FIELD_WIDTH + 4) * (self.skip - 1)) return level + "> \n" + below class _SkipIter(object): def __init__(self, start): self.current = start.right def __iter__(self): return self def __next__(self): if isinstance(self.current, _TailNode): raise StopIteration() item = self.current.item self.current = self.current.right return item[/mw_shl_code] 题目6: [mw_shl_code=python,true]def reverse(string): strlist = list(string) first = 0 last = len(strlist) - 1 while first < last: strlist[first], strlist[last] = strlist[last], strlist[first] first += 1 last -= 1 result = '' for char in strlist: result += char return result[/mw_shl_code] 题目7: [mw_shl_code=python,true]def question7(): profit = int(input('Please enter the profit: ')) cases = [1000000, 600000, 400000, 200000, 100000, 0] interest = [0.01, 0.015, 0.03, 0.05, 0.075, 0.1] reward = 0 for i in range(6): if profit > cases: reward += (profit - cases) * interest profit = cases print(reward)[/mw_shl_code] 题目8： [mw_shl_code=python,true]def question8(): return helperForQ8(1) def helperForQ8(day): if day == 10: return 1 else: return helperForQ8(day + 1) * 2[/mw_shl_code] 题目9： [mw_shl_code=python,true]def question9(): numlist = [] cont = 'y' while cont == 'y': num = input('Please enter a number: ') numlist.append(float(num)) cont = input('Continue to enter numbers? (please enter "y" or "n"): ') maxindex = numlist.index(max(numlist)) numlist[maxindex], numlist[0] = numlist[0], numlist[maxindex] minindex = numlist.index(min(numlist)) numlist[minindex], numlist[-1] = numlist[-1], numlist[minindex] return numlist[/mw_shl_code] 题目10: 能8能被逆向解析什么滴咱完全8知道啊！~总之先来试试而已...OTZ... 反正就是输入密码然后加密文件...吧....?~咱理解题目能力有限..._(:з」∠)_... 只有这题是用java来写滴...因为咱8知道python肿么输出文件了啦！~@@8!! java语法其实咱都快忘光了..._(:з」∠)_...下学期要肿么破啊喂.... [mw_shl_code=java,true]import java.awt.*; import hsa.Console; import hsa.*; public class Crytpo { static Console c; // Main Program public static void main (String[] args) { c = new Console (); c.println ("Please enter a key: "); String key = c.readLine (); c.println ("Please enter the file name: "); String fileName = c.readLine (); Vigenere x = new Vigenere (key); String y = x.encrypt (fileName); } } class Vigenere { protected String key; public Vigenere (String k) { key = k; } public String encrypt (String fileName) { int pnt = fileName.indexOf ("."); String ciphafile; String line; String cipha; if (pnt != -1) ciphafile = fileName.substring (0, pnt) + ".cyp"; else ciphafile = fileName + ".cyp"; TextInputFile input = new TextInputFile (fileName); TextOutputFile output = new TextOutputFile (ciphafile); while (!input.eof ()) { line = input.readLine (); cipha = encryptLine (line); output.println (cipha); } return ciphafile; } public String encryptLine (String line) { String enLine = ""; char x; char y; int i = 0; while (i < line.length ()) { x = line.charAt (i); if (x >= ' ' && x <= '~') { y = (char) (key.charAt (i % key.length ()) - ' '); x = (char) (x + y); if (x > '~') x = (char) (x - '~' + ' ' - 1); } enLine = enLine + x; i++; } return enLine; } } [/mw_shl_code] 完毕！~艾玛咱居然10题都做了！~ 这不科学啊啊啊啊啊！！！~#33t 正确率目测一般就是了~(￣▽￣")~ 看咱从预订滴3题变成了10题都做滴份上求！给！糖！滴说~~~!23!作者:虹why
作者:夏尘安
作者:你说的a不对
作者:linyu0077
喵宅苑
喵空间社区程序
喵宅苑 静态版
宅喵RPG地图编辑器
络合兔
Lanzainc
技术宅
小五四博客
莉可POI
Mithril.js
枫の主题社
Project1
午后少年
机智库
七濑胡桃
xiuno
幻想の日常
魂研社
Nothentai
0xffff
欲望之花
泽泽社长
淀粉月刊
HAYOU