摘要： 开始打表、二分，结果TLE，发现小型数据二分还不如顺序查找。#include <stdio.h>int main(){ float card[280] = {0 ,0.5} ,c; for(int i = 2 ;i <= 276 ;i++) card[i] = card[i - 1] + 1.0 / (i + 1); while(scanf("%f" ,&c) && c != 0.00) { int i; for(i = 1 ;card[i] < c; i++){} printf("%d card(s)\n... 阅读全文

摘要： WA了五六次，感谢讨论版的数据！！！！是用map<int ,int>过的#include <stdio.h>#include <string.h>#include <map>using namespace std;int main(){ int n ,i ,j ,len ,num ,m[300] ,flag = 0; char str[50]; m['0'] = 0 ,m['1'] = 1; m['2'] = m['A'] = m['B'] = m['C 阅读全文