acm
BoogieLingo
Hiding behind the data
展开
-
ACM-Fjnu18级第一次友谊赛F题题解-一道理解题
ACM-Fjnu18级第一次友谊赛F题题解题面:Since Grisha behaved well last year, at New Year’s Eve he was visited by Ded Moroz who brought an enormous bag of gifts with him! The bag contains n sweet candies from the g...原创 2018-11-12 20:33:44 · 419 阅读 · 0 评论 -
ACM-FJNU18级第二次友谊赛C题-HDU1753(大明A+B)
ACM-FJNU18级第二次友谊赛C题-HDU1753(大明A+B)就,模拟大数加减嘛,不过是浮点型的,我的思路是分成int跟decimal两个部分模拟。代码太乱,懒得优化,学艺不精,告辞。#include <string.h>//A==B?+loverkey#include <bits/stdc++.h>#define N 100050#define dou.原创 2018-11-19 00:02:34 · 242 阅读 · 3 评论 -
ACM-FJNU18级第二次友谊赛E题-找规律+翻译题
ACM-FJNU18级第二次友谊赛E题Mishka got an integer array a of length n as a birthday present (what a surprise!).Mishka doesn’t like this present and wants to change it somehow. He has invented an algorithm...原创 2018-11-19 09:33:05 · 342 阅读 · 2 评论 -
ACM-FJNU18级第二次友谊赛F题-认真读题
ACM-FJNU18级第二次友谊赛F题-CodeForces-567B Berland National LibraryBerland National Library has recently been built in the capital of Berland. In addition, in the library you can take any of the collected ...原创 2018-11-19 09:48:29 · 358 阅读 · 1 评论 -
ACM_51nod 1984(分块、异或性质)
异或约数和题目传送门51nod1984题意:定义 f(i) 为 i 的所有约数的异或和,给定 n(1≤n≤1014) ,求 f(1) xor f(2) xor f(3) xor…xor f(n) (其中xor表示按位异或)样例解释:f(1) = 1f(2) = 1 xor 2 = 3f(3) = 1 xor 3 = 2f(4) = 1 xor 2 xor 4 = 71 xor 3...原创 2019-06-13 23:43:13 · 194 阅读 · 0 评论