摘要： #include <stdio.h>#include <map>#include <iostream>using namespace std;int main( ){ map<int, string>stu; int a, b, i, j; char str[20]; while (scanf("%d",&a) != EOF ) { for (i = 0; i < a; i++) { scanf("%d%s",&b,str); //stu[b] = str; stu.insert(ma 阅读全文

摘要： 一个组合数为第K大是指有K-1个不同的组合数小于它。#include <stdio.h>#include <string.h>#include <algorithm>#include <math.h>int A[5100];int B[10100];int main( ){ int T, N, k, max , t, num, i, j; scanf("%d",&T); while(T--) { num = 0; max = 0; memset(B, 0, sizeof(B)); scanf("%d%d&qu 阅读全文

摘要： #include <stdio.h>#include <string.h>#include <stdlib.h>#include <algorithm>using namespace std;int main( ){ char str[10], ch[10]; int len, flag, a[10], i, flag1, k = 0; while (1) { flag1 = 0; for ( i = 0; i < 4; i++) scanf("%d",&a[i]), str[i] = a[i] + '0 阅读全文

摘要： A CTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1741Accepted Submission(s): 1089Problem DescriptionAre you excited when you see the title "AC" ? If the answer is YES , AC it ;You must learn these two combination formulas in the school 阅读全文

摘要： 刚开始时用了算约数个数公式，果断超时。。#include <stdio.h>#include <string.h>#include <math.h>#include <stdlib.h>char prime[5000010]={0};int dp[700000];const int inf = 3500;int k, a, b, l;struct node {int v;int n;}val[1000];void fun( ){ int i, j; for ( i = 3; i <= inf; i += 2) if ( prime[i / 阅读全文