lxx_nico的专栏

 Summary Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 328    Accepted Submission(s): 201 Problem Description Small W is playing a

1、scanf charstr[15]; scanf("%s",str); abc 123 1)不读入空格和回车,从空格处结束 2)输入字符串长度超过字符数组元素个数不报错 3)当输入项为字符指针时，指针必须已指向确定的有足够空间的连续存储单元 4)当为数组元素地址时，从此元素地址开始存放 printf("%s",地址值) 输出时遇到第一个'\0'为止 2、gets和p

Beautiful Palindrome Number Time Limit: 3000/1500 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 404    Accepted Submission(s): 257 Problem Description A po

Problem Description Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line and the cow is at a p

Primes Problem Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 659    Accepted Submission(s): 302 Problem Description Given a number n,

Math Problem Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1078    Accepted Submission(s): 282 Problem Description Here has an functi

Super Jumping! Jumping! Jumping! Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 22816    Accepted Submission(s): 10039 Problem Descript

Trees on the level Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 330    Accepted Submission(s): 114 Problem Description Trees are fun

数论部分第一节：素数与素性测试     一个数是素数（也叫质数），当且仅当它的约数只有两个——1和它本身。规定这两个约数不能相同，因此1不是素数。对素数的研究属于数论范畴，你可以看到许多数学家没事就想出一些符合某种性质的素数并称它为某某某素数。整个数论几乎就围绕着整除和素数之类的词转过去转过来。对于写代码的人来说，素数比想像中的更重要，Google一下BigPrime或者big_prime你总会

#include int gcd(int da,int xiao) {     int t=1;     while(t!=0)     {         t=da%xiao;         if(t)         {             da=xiao;             xiao=t;         }     }     return xiao;

这个像一个统计 #include #include using namespace std; int num[101]; int fun(int num) { return (10000-pow((100-num),2)); } int main() { int t,n; cin>>t; for(int j=1;j<=t;j++) { cin>>n; memset(num,0,s

Wooden Sticks Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 12148    Accepted Submission(s): 5033 Problem Description There is a pile

Doing Homework again Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6840    Accepted Submission(s): 4072 Problem Description Ignatius

BNU 比赛！http://www.bnuoj.com/v3/problem_show.php?pid=44586 #include #include #define mnum 100020 using namespace std; char str[mnum],ans[mnum]; int main() { //freopen("input.txt","r",stdin); //freope