「AOJ再挑戦56~60」の編集履歴(バックアップ)一覧に戻る
#include<stdio.h> #include<string.h> const int MAX=60000; bool isPrime[MAX+1]; void calc(){ memset(isPrime,true,sizeof(isPrime)); isPrime[0]=isPrime[1]=false; for(int i=2;i*i<=MAX;i+=(1+(i&1))){ if(isPrime[i]==false)continue; int add=i%2==0?i:i*2; for(int j=(i%2==0?i*2:i*3);j<=MAX;j+=add){ isPrime[j]=false; } } } int main(){ calc(); int n; while(scanf("%d",&n)!=EOF){ int p1,p2; for(p1=n-1;isPrime[p1]==false;p1--); for(p2=n+1;isPrime[p2]==false;p2++); printf("%d %d\n",p1,p2); } }
#include<stdio.h> int main(){ int n; while(scanf("%d",&n)!=EOF){ printf("%d\n",1+(n*(n+1))/2); } }
#include<stdio.h> #include <math.h> int main(){ double xa,xb,xc,xd; double ya,yb,yc,yd; while(scanf("%lf %lf %lf %lf %lf %lf %lf %lf", &xa,&ya,&xb,&yb,&xc,&yc,&xd,&yd)!=EOF){ double dx1,dx2,dy1,dy2,naiseki; dx1=xb-xa; dy1=yb-ya; dx2=xd-xc; dy2=yd-yc; naiseki=fabs(dx1*dx2+dy1*dy2); printf("%s\n",naiseki<0.0000000001?"YES":"NO"); } }
#include<stdio.h> int main(){ double xa1,xa2,xb1,xb2; double ya1,ya2,yb1,yb2; while(scanf("%lf %lf %lf %lf %lf %lf %lf %lf", &xa1,&ya1,&xa2,&ya2,&xb1,&yb1,&xb2,&yb2)!=EOF){ bool hit=true; if( xb2<xa1 || xa2<xb1 || yb2<ya1 || ya2<yb1)hit=false; printf("%s\n",hit?"YES":"NO"); } }