abns的博客

Given n, a positive integer, how many positive integers less than n are relatively prime to n? Two integers a and b are relatively prime if there are no integers x > 1, y > 0, z > 0 such that...

#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>using namespace std;struct Point{ int x,y; Point(){} Point(int x,int y):x(x),y(y){}};typ...

#include <iostream>#include <string.h>#include <stdio.h>#include <math.h> #define N 150#define eps 1e-8#define T 100#define delta 0.98#define INF 1e99 using namespa...

#include<bits/stdc++.h>using namespace std;typedef long long ll;const int MD=1000000007;int p[5]= {0,1,5,11,36};struct Matrix { ll a[4][4]; Matrix() { memset(a,0,sizeof(a)); } Matrix...

1186 质数检测 V2 基准时间限制：1 秒 空间限制：131072 KB 分值: 40 难度：4级算法题 收藏 关注给出1个正整数N，检测N是否为质数。如果是，输出"Yes"，否则输出"No"。Input输入一个数N(2 &lt;= N &lt;= 10^30)Output如果N为质数，输出"Yes"，否则输出"No"。Input示例17Out...

Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie needs her beauty sleep, so she wants to get b...

Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie needs her beauty sleep, so she wants to get b...

https://vjudge.net/contest/244788#problem/DIn the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 2 for n ≥ 2. For example, the first ten terms of the Fibonacci sequence are:0, ...

void read(int &amp;x){ int f=1;x=0;char s=getchar(); while(s&lt;'0'||s&gt;'9'){if(s=='-')f=-1;s=getchar();} while(s&gt;='0'&amp;&amp;s&lt;='9'){x=x*10+s-'0';s=getchar();} x*=f;}关闭...

area=I+E/2-1(I为内部格数，E为边上的点数） 边上格点数 = gcd(abs(x),abs(y))-1;#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<cmath>#define N 1003usin...