QQ2472322319

#include #include #include using namespace std;class BinaryCode{public: vector decode(string message) { bool f[2]={1,1}; vector r(2); r[0].push_back('0');

import java.util.Scanner;public class Main{ public static int c(int n){ int i=0; while(n!=1){ if(n%2==0) n=n/2; else n=3*n+1; i++; } return i+1; } public static void main(Strin

#include #include using namespace std;int main(){ int t,m,n; cin>>t; while(t--) { cin>>m>>n; while(n>m?(n=n%m):(m=m%n)); if(n+m==1)printf("NO\n"); e

#include#include#includeusing namespace std;string s[14]={"3","4","5","6","7","8","9","10","J","Q","K","A"," ","2"};bool f[14];int main(){ string a[5]; int m[5]; while(cin>>a[0])

#includeint main(){ int n,m,t,max,cmax; scanf("%d",&n); while(n--) { max=-100000,cmax=-100000; scanf("%d",&m); while(m--) { scanf("%d",&t

import java.math.BigInteger;import java.util.Scanner;public class Main{ public static void main(String[] argc) { Scanner cin=new Scanner(System.in); while(cin.hasNext()){ BigInteger a=cin.n

#includeint main(){ int n,i; while(scanf("%d",&n)!=EOF) { for(i=1;i<=n;i++) printf("%3d",i); if(n!=1) printf("\n"); for(i=i;i<2*n-1;i++) {

#includeusing namespace std;int main(){ int n; while(cin>>n) { if(n%2==0) cout<<"YES"<<endl; else cout<<"NO"<<endl; } return 0;}

筛选法求素数#include#include#define size 1261000int main(){ bool t[size]; int s[10001],c=0; int i=2,v=2,n; memset(t,0,size*sizeof(bool)); t[0]=t[1]=1; while(i < size) {

#includeusing namespace std;int R,C,s[101][101];int Max=0;int dir[4][2]={{0,1},{1,0},{0,-1},{-1,0}};void findpath(int i,int j,int dep){ if(Max<dep) Max=dep; int x,y; for(int k=0;k<

import java.util.Scanner;public class Main{ public static void main(String[] argv){ Scanner cin=new Scanner(System.in); int n,max,sum; int[] s=new int[1001]; while(cin.hasNext()){ n=cin.

#include#includeint main(){ char s[130]; char *C; char *P; int N; while(scanf("%s",s)!=EOF) { C=strtok (s,"/"); P=strtok (NULL, "/"); if(C[0]>='2' &

#includeusing namespace std;int main(){ int n,k,m,t; int s[11][11]; while(cin>>n>>k>>m) { for(int i=0;i<11;i++) { for(int j=0;j<11;j++) {

#include using namespace std;int main(){ int a,b; int v[100]; while(cin>>a>>b&&(a||b)){ int cont=0; memset(v,0,sizeof(v)); for(int i=0;i<=99;i++){ if((i+a*100)%b==0){ v[cont]=i;

#includeint main(){ __int64 a,b; while(~scanf("%I64d%I64d",&a,&b)) printf("%I64d^2-%I64d^2=8*%I64d\n",a,b,(a-b)*(a+b)/8); return 0;}在做ACM题时，经常都会遇到一些比较大的整数。而常用的内置整数类型常常显得太小了：其中

#include#includeusing namespace std;int main(){ int n; long long int t; while(cin>>n && n) { t=pow(5.0,n)-4; cout<<t<<' '; while((t-1)%5==0) {

#include#include#includeusing namespace std;int main(){ double x1,y1,x2,y2; while(cin>>x1>>y1>>x2>>y2) cout<<fixed<<setprecision(2)<<sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1))<<endl;

#includeusing namespace std;#define N 200002int a[N];struct node{ int x; int y; int max;}list[N*3];int Max(int x,int y){ return x>y?x:y;}int build(int k,int x,int y){

#include#includeusing namespace std;int a[1001],b[1001];int main(){ int n,c; while(scanf("%d",&n) && n) { c=0; for(int i=0;i<n;i++) scanf("%d",&a[i]);

The center of gravity (also known as "center of mass" or "centroid" can be calculated with the following formula:X = SUM[(Xi + Xi+1) * (Xi * Yi+1 - Xi+1 * Yi)] / 6 / AY = SUM[(Yi + Yi+1) * (Xi * Yi

#include#include#define PI 3.1415926int main(){ double a,b,c,t; int u; while(scanf("%lf %lf %lf",&a,&b,&c)!=EOF){ b/=2; t=b/tan(c/180*PI); if(a>t) {u=(a-t)/(2*t); printf("%d\n"

#include#includeint main(){ int n,c; char s[1000]; char b[1000]; while(scanf("%d",&n)!=EOF) { getchar(); for(int i=0;i<n;i++) { gets(s);

#include#include#includeusing namespace std;struct info{ int start; int end;};bool cmp(info a,info b){ if(a.start<b.start) return 1; else return 0;}int main(){ int n,

方法1：atan用法#include#include#includeusing namespace std;double ax,ay,bx,by,cx,cy,dx,dy;int main(){ int n; cin>>n; while(n--) { cin>>ax>>ay>>bx>>by>>cx>>cy>>dx>>dy;

方法一：#include#includeusing namespace std;const int MAX_NUM=1000;void merge(long num[],int n);int main(){ string str; while(cin>>str) { int len=str.size(); long num

#include#include#includeusing namespace std;int main(){ vector r; long int a,t; while(cin>>a) { for(int i=0;i<a;i++) { cin>>t; r.push_back

#include#include#includeusing namespace std;int MAX(int a,int b,int c){ if(a>b) return a>c?a:c; else return b>c?b:c;}int closer(int a,int b,int c){ return fabs(c-a)<fabs(c-b)?a:b

#includeusing namespace std;int main(){ int a,b,m[15][15],n[15][15],t,count; while(cin>>a&&a) { cin>>b; count=0; for(int i=0; i<a; i++) { fo

#include#include#includeusing namespace std;int main(){ string a,b; const char *p,*q; int m,n; while(cin>>a>>b) { for(int i=0;i<a.length();i++) {

#includeusing namespace std;int main(){ int a,b; while(cin>>a>>b) cout<<a+b<<endl; return 0;}

i=int(raw_input())while(i!=42): print i i=int(raw_input())

#includeusing namespace std;long int s[1001][1001];int main(){ int a,b; for(int i=0;i<1000;i++) { s[0][i]=1; s[i][0]=1; } for(int i=1;i<1000;i++) {

#include #include typedef struct Application{ int GI; int GE; int GF; int PS[6]; int ID;} Application;typedef struct School{ int Quota; int count; int AppID[400

#include#includeusing namespace std;int main(){ char s[1001]; int count,n; while(cin>>s) { int a[3]; n=count=0; for(int i=0;i<strlen(s);i++) {

#include#include#includeusing namespace std;struct info{ double j; double f;};bool cmp(info a,info b){ if(a.j/a.f > b.j/b.f) return 1; else return 0;}int main(){ int

深搜#include#includeusing namespace std;char maz[20][20];int dir[][2]={{0,1},{1,0},{0,-1},{-1,0}};int m,n,flag;void dfs(int x,int y){ if(flag==1) return; for(int i=0;i<4;i++) {

#includeusing namespace std;class TreeNode{public: char value; TreeNode *left; TreeNode *right; TreeNode(char c): value(c){ left = NULL; right = NULL; } ~T

#includeusing namespace std;bool search(int (*a)[1000],int m,int n,int o){ int i=0;int j=n-1; while(i=0) { if(a[i][j]==o) return 1; else { if(a[i][j

#includeusing namespace std;int main(){ int n,t,max,min; while(cin>>n) { for(int i=0;i<n;i++) { cin>>t; if(i==0) max=min=t; else

#include#includeusing namespace std;int main(){ cout<<300<<' '<<(int)(pow(2,30)-1); return 0;}