数论
Ambrumf
这个作者很懒,什么都没留下…
展开
-
CF 1593 D2. Half of Same 数论
思路:暴力枚举所有数之差的所有因数,再检验所有数模该因数是否出现某一出现至少出现n/2次的余数. #include <bits/stdc++.h>using namespace std;typedef long long ll;int n;int a[200005];void fun(int x,vector<int> &v){ for(int i=1;i*i<=x;i++) { if(x%i==0) {原创 2022-01-07 02:42:42 · 156 阅读 · 0 评论 -
CF1604 C. Di-visible Confusion(lcm)
#include <bits/stdc++.h>using namespace std;typedef long long ll;ll gcd(ll a,ll b){ ll sum=b==0?a:gcd(b,a%b); return sum;}ll lcm(ll a,ll b){ ll g=gcd(a,b); ll sum=a*b/g; return sum;}void solve(){ int n; scanf("%d"原创 2021-11-03 21:13:03 · 159 阅读 · 0 评论 -
CF 1512 G. Short Task
#include <bits/stdc++.h>using namespace std;typedef long long ll;const int N=1e7+5;int p[N],d[N],ans[N];void solve(){ int n; scanf("%d",&n); printf("%d\n",ans[n]);}int main(){ fill(p,p+N,-1); p[1]=1; for(int i=2;i*原创 2021-10-26 16:52:27 · 71 阅读 · 0 评论 -
CF 1513 C. Add One
#include <bits/stdc++.h>using namespace std;typedef long long ll;ll dp[10][200060],mod=1e9+7;void solve(){ int n,m; scanf("%d %d",&n,&m); ll sum=0; while(n) { sum+=dp[n%10][m]; sum%=mod; n/=10;原创 2021-10-26 16:51:36 · 91 阅读 · 0 评论 -
CF 1561D1 Up the Strip (simplified version)
#include <bits/stdc++.h>using namespace std;typedef long long ll;int main(){ ll n,p,t; cin>>n>>p; ll dp[200050],pre[200050]; dp[1]=1,pre[1]=1; for(ll x=2;x<=n;x++) { ll flag=0; t=sqrt(x);原创 2021-10-22 10:21:00 · 99 阅读 · 0 评论