斯文~

https://vjudge.net/problem/CodeForces-1594A#include<iostream>#include<algorithm>#include<cstring>#include<cmath>using namespace std;const int N=1010;int main(){ ios::sync_with_stdio(false); cin.tie(); cout.tie(); long

https://vjudge.net/problem/%E8%AE%A1%E8%92%9C%E5%AE%A2-A2235#include <iostream>#include <algorithm>using namespace std;long long l=1032,r=12302135942453,d=234;int main(){ cout<<r/d-l/d<<"\n"; return 0;}

https://www.luogu.com.cn/problem/P1029暴力枚举#include<iostream>#include<algorithm>#include<cmath>using namespace std;int main(){ int x,y,ans=0; cin>>x>>y; int k=sqrt(x*y); for(int i=x;i<=k;i+=x) { //如果两数之积除以i能整除，

https://www.luogu.com.cn/problem/P1009#include<iostream> //b数组是阶乘 a数组是阶乘的和using namespace std;const int N=1010;int n;int a[N],b[N];int main(){ cin>>n; a[0]=b[0]=1; for(int i=2;i<=n;i++) { for(int j=0;j<=100;j++) b[j]*=i;

【蓝桥杯】【买不到的数目】第四届蓝桥杯——买不到的数目

http://acm.zzuli.edu.cn/problem.php?id=2853数学问题：容斥定理#include<iostream>#include<algorithm>using namespace std;int main(){ long long n; long long a,b,c,d,e,f,g,sa,sb,sc,sd,se,sf,sg; cin>>n; a=n/3; sa=3*a*(1+a)/2; b=n/5; sb=

http://acm.zzuli.edu.cn/problem.php?id=2847#include<iostream>#include<cmath>using namespace std;bool check(long long i){ while(i) { long long x=i%10; if(x!=4 && x!=7) return false; i/=10; } return true;}int main(){

https://leetcode-cn.com/problems/vowels-of-all-substrings/思维题 若i是元音字母，则看一下组合数即可class Solution {public: long long countVowels(string w) { long long ans=0; long long n=w.size(); for(long long i=0;i<n;i++) {

https://vjudge.net/problem/HDU-5879多次测试，在120000之后的结果都是一样的#include<iostream>#include<algorithm>#include<cmath>using namespace std;int n;int main(){ double n; double sum; while(scanf("%lf",&n)!=EOF) { sum=0; for(int i=1;

https://vjudge.net/problem/HDU-6112#include<iostream>using namespace std;bool judge(int y){ if( y%400==0 || (y%4==0 && y%100!=0)) return true; return false;}int getweek(int y,int m,int d){ if(m==1 || m==2 ) m+=12,y-=1; int w=( d +

https://vjudge.net/problem/POJ-2262#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<cmath>using namespace std;const int N=1e6+10;bool bk[N];void prime(){ memset(bk,false,sizeof bk); fo