要做ADC

欧拉函数 输入一个数 求[1~n)区间与n互素的正整数的个数 #include #include #include using namespace std; int main() {   int n;     while(scanf("%d",&n),n)     {         int m=(int)sqrt(n+0.5);          int ans=n;  

改革春风吹满地 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 31466    Accepted Submission(s): 16154 Problem Description “ 改革春风吹满地, 不会AC没关系;

Convex Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 189    Accepted Submission(s): 159 Problem Description We have a special convex

自己以前的写的一个两个大数数相乘 #include #include using namespace std; #define N 2000 char z[N],a[1000],b[1000],c[N]; int l1,l2; void jf() { int i; for(i=N-1; i>=0; i--) { if(c[i]+z[i]-96>9)

Problem 2278 YYS Accept: 31    Submit: 94 Time Limit: 1000 mSec    Memory Limit : 262144 KB Problem Description Yinyangshi is a famous RPG game on mobile phones. Kim enjoys collecting c