摘要：
#include<stdio.h>#include<string.h>#include<stdlib.h>#define MAX 1000000struct T{ __int64 prime; __int64 num;};T res[MAX];__int64 p[MAX];bool isprime[MAX];__int64 pow(__int64 a,__int64 b){ __int64 i; __int64 res=1; for(i=1;i<=b;i++) { res*=a; } return res;}void cal(__int64 n){ _ 阅读全文
摘要：
#include<stdio.h>#include<string.h>#include<stdlib.h>#include<math.h>__int64 x,y;__int64 extended_gcd(__int64 a,__int64 b){ __int64 t,gcd; if(b==0) { x=1; y=0; return a; } gcd=extended_gcd(b,a%b); t=x; x=y; y=t-a/b*y; return gcd;}int main(){ __int64 p,q,m,n,l; scanf("%I6 阅读全文
摘要：
#include<stdio.h>#include<string.h>#include<stdlib.h>#include<math.h>int x,y;int extended_gcd(int a,int b){ int t,gcd; if(b==0) { x=1; y=0; return a; } gcd=extended_gcd(b,a%b); t=x; x=y; y=t-a/b*y; return gcd;}int main(){ int a[3],d; int i; int m[3]={23,28,33}; int M; int w; 阅读全文
摘要：
#include<stdio.h>#include<string.h>#include<stdlib.h>#include<math.h>int main(){ double a[12]; int i,j; double sum=0; for(i=0;i<12;i++){ scanf("%lf",&a[i]); sum+=a[i]; } sum=sum/12; printf("$%.2f\n",sum); //system("PAUSE"); return 0;}纯水T_T 阅读全文