算法竞赛入门经典(第二版)----数学概念与方法
文章平均质量分 50
wang2147483647
这个作者很懒,什么都没留下…
展开
-
UVA 1210(p343)----Sum of Consecutive Prime Numbers
#include#include#includeusing namespace std;const int maxn=10000;int num,u[maxn+50],prime[maxn+50];int a[6000000],sum[maxn];void get(){ num=1; memset(u,true,sizeof(u)); memset(sum,原创 2016-02-25 23:36:42 · 349 阅读 · 0 评论 -
UVA 11440(p338)----Help Mr.Tomisu
#include#include#includeusing namespace std;const int maxn=1e7;const int mod=1e8+7;int v[maxn+50];int f[maxn+50];int n,m;void prepare(){ memset(v,0,sizeof(v)); for(int i=2; i<=maxn;原创 2016-02-27 13:37:44 · 283 阅读 · 0 评论 -
UVA 11346(p334)----Probability
//注意精度!!!#include#include#includeusing namespace std;int main(){ double a,b,s; int n; scanf("%d",&n); for(int i=0;i<n;i++) { scanf("%lf%lf%lf",&a,&b,&s); if(-0.000001<=s&&s<=0.原创 2016-02-27 13:35:13 · 299 阅读 · 0 评论 -
UVA 11246(p350)----K-Multipe Free Set
#include#includeint solve(int n,int k){ int sign=1,ans=0; while(n) { ans+=sign*n; n/=k; sign=-sign; } return ans;}int main(){ int t; scanf("%d原创 2016-02-27 13:33:59 · 274 阅读 · 0 评论 -
UVA 11186(p349)----Circum Triangle
#include#include#include#includeusing namespace std;const double pi=acos(-1.0);struct point{ double x,y; point(double a=0.0,double b=0.0):x(a),y(b){}};vector m;inline double change(d原创 2016-02-27 13:32:29 · 531 阅读 · 0 评论 -
UVA 11105(p345)----Semi-prime H-numbers
#include#include#include#include#includeusing namespace std;const int maxn=250000;typedef long long LL;vector hp;vector ans;int v[maxn*4+50];int h,vis[maxn*4+50];void prepare(){ memse原创 2016-02-27 13:31:37 · 431 阅读 · 0 评论 -
UVA 11040(p342)----Add Bricks in the Wall
#include#includeusing namespace std;int a[10][10],t;int main(){ scanf("%d",&t); while(t--) { for(int i=1;i<=9;i+=2) for(int j=1;j<=i;j+=2) scanf("%d原创 2016-02-27 13:27:08 · 220 阅读 · 0 评论 -
UVA 10868(p345)----Bungee Jumping
#include#include#include#define g 9.81using namespace std;int main(){ double k,l,s,w; while(scanf("%lf%lf%lf%lf",&k,&l,&s,&w)==4&&(k+l+s+w)) { if(s<=l) {原创 2016-02-27 13:24:45 · 457 阅读 · 0 评论 -
UVA 10837(p345)----A Research Problem
#include#include#includeusing namespace std;const int maxp=10000+10;bool vis[maxp],done[222];int pri[maxp],pnum,cur_p[555],cnt_p[555];int tot,ans,v[maxp];void get_prime(int n){ vis[1]=1;原创 2016-02-27 13:23:52 · 452 阅读 · 0 评论 -
UVA 11526(p344)----H(n)
#include#include#includeusing namespace std;typedef long long LL;LL ans;int main(){ LL t,x; scanf("%lld",&t); while(t--) { scanf("%lld",&x); if(x<=0) cout<<0<<en原创 2016-02-27 13:40:30 · 269 阅读 · 0 评论 -
UVA 11582(p316)----Colossal Fibonacci Numbers!
#include#includeusing namespace std;const int maxn=1000+50;typedef unsigned long long ULL;ULL a,b,n;ULL flag[maxn],f[maxn][maxn*10];ULL Mi(ULL a,ULL b,ULL n){ ULL t=1,y=a; while(b)原创 2016-02-27 13:47:07 · 216 阅读 · 0 评论 -
UVA 580(p331)----Critical Mass
#include#include#includeusing namespace std;const int maxn=30+5;int f[maxn],g[maxn];void prepare(){ f[0]=0;f[1]=0; f[2]=0;f[3]=1; g[0]=1;g[1]=2; g[2]=4;g[3]=7; for(int i=3;i原创 2016-02-25 23:11:37 · 580 阅读 · 0 评论 -
UVA 557(p344)----Burger
#include#includeusing namespace std;const int maxn=1e5;double p[maxn+50];int n;void prepare(){ p[1]=1.0; for(int i=1;i<=maxn;i++) p[i+1]=(double)(2*i-1)/(double)(2*i)*p[i];}in原创 2016-02-25 23:09:59 · 386 阅读 · 0 评论 -
UVA 294(p344)----Divisors
#include#include#includeusing namespace std;const int maxn=100007;int u[maxn],prime[maxn];int ans,num,n,l,r,p;void get(){ num=1; memset(u,true,sizeof(u)); for(int i=2; i<=maxn; i++原创 2016-02-25 22:47:06 · 320 阅读 · 0 评论 -
UVA 12716(p318)----GCD XOR
#include#includeusing namespace std;const int maxn=30000000;int ans[maxn+50],n,a[10000];void solve(){ int b; for(int c=1;c<=maxn/2;c++) for(int a=c+c;a<=maxn;a+=c)原创 2016-02-28 19:25:55 · 413 阅读 · 0 评论 -
UVA 12230(p333)----Crossing Rivers
#include#includeusing namespace std;int n,d;double l[100],p[100],v[100];int main(){ int k=0; while(scanf("%d%d",&n,&d)==2&&(n||d)) { double temp1=0,temp2=0; k++;原创 2016-02-27 14:02:46 · 486 阅读 · 0 评论 -
UVA 12169(p316)----Disgruntled Judge
#include#includetypedef long long LL;using namespace std;const int mod=10001;LL d,x[10000],t,k,b,temp;int solve(LL p,LL q,LL &x,LL &y){ int t; if(q==0) { x=1; y=0;原创 2016-02-27 14:00:23 · 238 阅读 · 0 评论 -
UVA 12034(p332)----Race
//注意取模!!#include#includeusing namespace std;const int mod=10056;int f[1500],x,n,c[2000][2000];void prepare(){ for(int i=0;i<=1500;i++) {c[i][i]=1;c[i][0]=1;} for(int i=1;i<=1500;i++)原创 2016-02-27 13:55:04 · 401 阅读 · 0 评论 -
UVA 11971(p335)----Polygon
#include#includeusing namespace std;typedef unsigned long long ULL;int t,n,k,cas=0;ULL gcd(ULL a,ULL b){ return b==0?a:gcd(b,a%b);}int main(){ scanf("%d",&t); while(t--) {原创 2016-02-27 13:52:54 · 222 阅读 · 0 评论 -
UVA 10820(p322)----Send a Table
#include#include#includeusing namespace std;const int N=50000;int phi[N+50],x;long long ans;void init(){ memset(phi,0,sizeof(phi)); phi[1]=1; for(int i=2; i<=N; i++) if(!phi[i])原创 2016-02-27 13:22:51 · 239 阅读 · 0 评论 -
UVA 10791(p317)----Minimum Sum LCM
#include#include#include#includeusing namespace std;const int maxn=1000000;int n,num=0,cas=0;int prime[maxn+50];int v[maxn+50];int p[maxn+50];void prepare(){ memset(v,0,sizeof(v));原创 2016-02-27 13:21:11 · 244 阅读 · 0 评论 -
UVA 1642(p340)----Magical GCD
#include#include#include#includeusing namespace std;typedef long long LL;const int maxn=1e5;struct point{ LL g,p; point(int a,int b):g(a),p(b) {}};int n,t;LL a[maxn+50];vectorm;LL原创 2016-02-26 13:54:43 · 305 阅读 · 0 评论 -
UVA 1641(p337)----ASCII Area
#include#include#include#define helloworlusing namespace std;char st[150][150];int n,m;int main(){#ifdef helloworld freopen("in.in","r",stdin);#endif // helloworld while(scanf("%d%d"原创 2016-02-26 13:53:43 · 442 阅读 · 0 评论 -
UVA 1639(p333)----Candy
#include#include#includeusing namespace std;const int maxn=200000;long double l[2*maxn+50];int n,cas=0;double p;void prepare(){ for(int i=1; i<=2*maxn; i++) l[i]=l[i-1]+log(i);}原创 2016-02-26 13:52:20 · 363 阅读 · 0 评论 -
UVA 1636(p326)----Headshot
#include#includeusing namespace std;string st;int main(){ ios::sync_with_stdio(false); while(cin>>st) { int l=st.length(); int zero=0; int zo=0; int zz原创 2016-02-26 13:51:02 · 302 阅读 · 0 评论 -
UVA 1635(p320)----Irrelevant Elements
#include#include#include#include#includeusing namespace std;const int maxn=1e5+50;vector prime;vector ans;int n,m,tmp[maxn];void prepare(int m){ int n=floor(sqrt(m)+0.5); for(int i=原创 2016-02-26 13:49:29 · 257 阅读 · 0 评论 -
UVA 1363(p338)----Joseph's Problem
#include#includeusing namespace std;int n,k;int main(){ while(scanf("%d%d",&n,&k)==2&&n) { long long ans=0; int i=1; while(i<=n) { long long原创 2016-02-26 00:23:12 · 210 阅读 · 0 评论 -
UVA 1262(p323p)----Password
#include#include#include#includeusing namespace std;int t,k;char tmp[10];char st1[10][10],st2[10][10];vector ans;vector st[10];void prepare(){ for(int j=0; j<5; j++) { for(i原创 2016-02-25 23:55:36 · 278 阅读 · 0 评论 -
UVA 1213(p343)----Sum of Different Primes
#include#include#includeusing namespace std;const int maxn=1120;int u[maxn+50],prime[maxn+50];long long d[20][maxn+50],num,n,k;void get(){ num=1; memset(u,true,sizeof(u)); for(int原创 2016-02-25 23:38:07 · 344 阅读 · 0 评论 -
UVA 1643(p343)----Angles and Squares
#include#include#include#includeusing namespace std;double xa,ya,xb,yb,k1,k2;int main(){ int n; while(scanf("%d",&n)==1&&n) { double l=0.0,tmp=0.0,area; scanf("%lf%l原创 2016-02-26 13:55:57 · 341 阅读 · 0 评论 -
UVA 1644(p343)----Prime Gap
#include#include#include#includeusing namespace std;int num,n,prime[1000000];bool v[20000000];void prepare(){ num=0; for(int i=2;i<1500000;i++) { if(!v[i]) prime[num++]=i;原创 2016-02-26 13:56:54 · 342 阅读 · 0 评论 -
UVA 10622(p343)----Perfect Pth Powers
#include#include#include#includeusing namespace std;typedef long long LL;int num;inline LL mul(int i,int j){ LL temp=1; for(int k=1;k<=j;k++) temp*=i; return temp;}int ma原创 2016-02-26 14:24:33 · 387 阅读 · 0 评论 -
UVA 10539(p343)----Almost Prime Numbers
#include#include#include#includeusing namespace std;const int maxn=1000000;typedef long long LL;int prime[maxn+50],u[maxn+50],num,n;LL l,r;void get(){ num=1; memset(u,true,sizeof(u))原创 2016-02-26 14:22:06 · 318 阅读 · 0 评论 -
UVA 10491(p326)----Cows and Cars
#include#includeusing namespace std;int main(){ double a,b,c; while(scanf("%lf%lf%lf",&a,&b,&c)==3) { double ans1=(a/(a+b))*(b/(a+b-1-c)); //cout<<ans1<<endl; d原创 2016-02-26 14:20:57 · 212 阅读 · 0 评论 -
UVA 10214(p339)----Trees in a Wood
#include#includeusing namespace std;typedef unsigned long long ULL;const int maxn=2010;int phi[maxn+50];int mindiv[maxn+50];void prepare(){ for(int i=1; i<maxn; i++) mindiv[i]=i;原创 2016-02-26 14:15:32 · 346 阅读 · 0 评论 -
UVA 10213(p336)----How Many Pieces of Land
import java.io.*;import java.util.*;import java.math.*;public class Main{ static PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out))); public static v原创 2016-02-26 14:13:58 · 414 阅读 · 0 评论 -
UVA 1648(p346)----Business Center
#include#include#includeusing namespace std;const int INF=1e10;int main(){ int n,m; while(scanf("%d%d",&n,&m)==2&&n) { int ans=INF; for(int i=0; i<m; i++) {原创 2016-02-26 13:59:18 · 405 阅读 · 0 评论 -
UVA 1647(p345)----Computer Transformations
#include#include#includeusing namespace std;int O[1010][100];int Z[1010][100];void prepare(){ memset(O,0,sizeof(O)); memset(Z,0,sizeof(Z)); O[0][0]=O[1][0]=1; for(int i=2; i<100原创 2016-02-26 13:58:07 · 435 阅读 · 0 评论 -
UVA 808(p342)----Bee Breeding
#include#include#includeusing namespace std;const int maxn=1e4;struct point{ long long x,y; point(int a=0,int b=0):x(a),y(b) {}} ;point p[2*maxn+50];const int dx[6]= {-1,-1,0,1,1,0};原创 2016-02-25 23:22:11 · 731 阅读 · 0 评论