数学
黑码
这个作者很懒,什么都没留下…
展开
-
ural 2067 Friends and Berries 数学推理
熟悉的数学定理 两边之和大于第三边 必然被不成三角形,而且是对于每一个点,都要有这样的结论,所以先排序然后所有的点都在同一边上即可#include <bits/stdc++.h>using namespace std;struct node{ int x,y; int id;}s[301010];int cmp(node a,node b){ if(a.x==b.原创 2017-03-23 16:08:26 · 446 阅读 · 0 评论 -
codeforces The Meaningless Game 数学思维
Slastyona and her loyal dog Pushok are playing a meaningless game that is indeed very interesting.The game consists of multiple rounds. Its rules are very simple: in each round, a natural number k is c原创 2017-07-31 14:08:17 · 692 阅读 · 0 评论 -
美团编程大赛 数学题 拓展欧几里得和解是否存在
给定四个正整数a,b,c,k,回答是否存在一个正整数n,使得a*n在k进制表示下的各位的数值之和模b为c。 输入描述: 第一行一个整数T(T <= 5,000)。 接下来T行,每行四个正整数a,b,c,k(1 ≤ a ≤ 10^18; 2 ≤ k ≤ 10^18; 0 ≤ c < b ≤ 10^18)表示一个询问,所有输入都是十进制的。输出描述: 对于每组数据输出一行,Yes表示存在,No表原创 2017-07-05 01:26:59 · 845 阅读 · 0 评论 -
玲珑杯 A 枚举 思维 数学
转:http://blog.csdn.net/yiya_eryi/article/details/73810840#include <bits/stdc++.h>using namespace std;int main(){ int n; cin>>n; double ans=-3; double a; double maxn=-2; for(原创 2017-07-04 10:50:59 · 290 阅读 · 0 评论 -
傻逼服务器 调和序数 xjb暴力 数学
调和序列(“盛大游戏杯”第15届上海大学程序设计联赛夏季赛暨上海高校金马五校赛(重现赛))发布时间: 2017年7月9日 20:20 时间限制: 1000ms 内存限制: 128M 描述 给定一个长度为n 的非负整数序列,下标为0 ,1 ,…,n−1 . 定义:sequence(K) : 由下标为K 的倍数组成的子序列,即下标为0 ,K ,2K ,…,[n−1/k]∗k query(K,S)原创 2017-07-10 15:16:28 · 466 阅读 · 0 评论 -
codeforces 616E Sum of Remainders 数学公式转化
Calculate the value of the sum: n mod 1 + n mod 2 + n mod 3 + … + n mod m. As the result can be very large, you should print the value modulo 109 + 7 (the remainder when divided by 109 + 7).The modulo原创 2017-05-18 10:05:05 · 413 阅读 · 0 评论 -
codeforces 807C Success Rate 数论
C. Success Rate time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output You are an experienced Codeforces user. Today you found out that during yo转载 2017-05-09 00:07:20 · 675 阅读 · 0 评论 -
51nod 1189 阶乘分数 (分解质因子加上逆元,乘法逆元基本意思)
1/N! = 1/X + 1/Y(0 < x<=y),给出N,求满足条件的整数解的数量。例如:N = 2,1/2 = 1/3 + 1/6,1/2 = 1/4 + 1/4。由于数量可能很大,输出Mod 10^9 + 7。大神的代码这里仅仅是为了保存下来。。#include <map>#include <set>#include <cmath>#include <ctime>#include <原创 2017-03-25 19:25:30 · 1077 阅读 · 1 评论 -
codeforces Volatile Kite (向量的操作模板)
B. Volatile Kite time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output You are given a convex polygon P with n distinct vertices p1, p2, …, pn.原创 2017-04-17 13:35:38 · 535 阅读 · 0 评论 -
codeforces 154B 素筛 机器激活
By 2312 there were n Large Hadron Colliders in the inhabited part of the universe. Each of them corresponded to a single natural number from 1 to n. However, scientists did not know what activating sev原创 2017-04-14 00:00:57 · 477 阅读 · 0 评论 -
ural 2070 Interesting Numbers(数论基础)
Nikolay and Asya investigate integers together in their spare time. Nikolay thinks an integer is interesting if it is a prime number. However, Asya thinks an integer is interesting if the amount of its原创 2017-03-24 20:51:06 · 470 阅读 · 0 评论 -
3D Convex Hull (三维凸包模板)
转载自:http://blog.csdn.net/ms961516792/article/details/48227385题意:给出一些三维的点,求出一个凸包,输出凸包有多少个表面。思路:模板。。。队友找了一个巨全面的模板,贴过来。#include<stdio.h> #include<algorithm> #include<string.h> #include<math.h> #in转载 2017-03-31 00:31:20 · 2597 阅读 · 0 评论 -
codeforces 837E 数论
Vasya is studying number theory. He has denoted a function f(a, b) such that:f(a, 0) = 0;f(a, b) = 1 + f(a, b - gcd(a, b)), where gcd(a, b) is the greatest common divisor of aand b.Vasya has two原创 2017-11-10 15:06:25 · 945 阅读 · 0 评论