Achiberx

#include #include #include using namespace std;int isprime(int a){   int i;   for(i = 2; i       if(a%i == 0){         return 0;      }   }   return 1;}void primefactor(int n

Problem GTriangle CountingInput: StandardInputOutput: StandardOutput You are given n rods of length 1, 2…, n. You have topick any 3 of them & build a triangle. How many distinct triangles

Problem AChess Queen Input: Standard InputOutput: StandardOutput You probably know how the game ofchess is played and how chess queen operates. Two chess queens are in attackingposition when t

find a way to escape                                         Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Find All M^N Please  Time Limit(Common/Java):1000MS/10000MS     Memory Limit:65536KByteTotal Submit: 37            Accepted: 15DescriptionRecently, Joey has special interest in the pos

组合数

基础题目

组合数

HDU1019

POJ2138 素数判定

题目描述：    A lot of people have played fortune Test(or called RP Test) before. Let ’ s create a new Test below.Suppose the worth of a=1, b=4,c=9 … and z=26^2. Then abc can describe as 149,and abd

#include #include #include using namespace std;//Accepted 164K 0MSint work(int n) { int rea = n; for(int i = 2; i*i<=n; i++) { if(n%i == 0) { rea = rea - rea/i;

#include #include #include using namespace std;//Accepted 164K 0MS C++ 472Bint work(int n) { int rea = n; for(int i = 2; i*i<=n; i++) { if(n%i == 0) { rea = rea - rea/

#include using namespace std;#define N 1000int f[N];int main(){    for(int i = 2; i*i         if( 0 == f[i]){            for(int j = i + i; j                 if(1 != f[j]){

#include #include #define M 1000using namespace std;int k = 0;char a[20] = {'0','1','2','3','4','5','6','7','8','9','A', 'B','C','D','E','F'};int change(int num, char *p){ int m

#include #include #include using namespace std;int myPow(int m, int n){ int temp; if(0 == n){ return 1; } if(1 == n){ return m; } if(n%2 == 0){ temp =

#include #include #define maxn 1000#define INF 0xfffffffusing namespace std;int m = 0, n = 0;int gcd = 0;int x[maxn], y[maxn], q[maxn];void extend_gcd(){ x[1] = 1; y[1] = -q[0]; x

#include#includeint main(){ int n; while(scanf("%d",&n)!=EOF){ if(n%4==2) printf("yes\n"); else printf("no\n"); } return 0;}/***********************************

#include #include using namespace std;int a[1000010];int main(){ a[0] = 7%3; a[1] = 11%3; int t; for(int i = 2; i < 1000000; i++){ t = a[i-1]%3 + a[i-2]%3; a[i] = t%3

#include #include #include using namespace std;int main(){ int n; while(scanf("%d", &n) != EOF) { if(n == 0) { printf("NO!\n"); continue; } ///n = 0 let me WA! int tmp

#include #include #include #include using namespace std;//Accepted 168K 454MS C++bool gen_perm(int *a, int n) { if(n == 1) { return false;} int i, j, k, t; for(j = n-2; j >= 0; j--)

#include #include #include using namespace std;int pow_mod(int a, int n, int m) { //时间复杂度：O(logn) if(n == 1) { return a%m; } int x = pow_mod(a, n/2, m); long long ans = (long long)x *

HDU5211Mutiple