摘要:
hdu 2524N -暴力求解、打表Time Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uDescription给你一个高为n ,宽为m列的网格,计算出这个网格中有多少个矩形,下图为高为2,宽为4的网格.In... 阅读全文
摘要:
uva 725 Division(除法)A -暴力求解Time Limit:3000MSMemory Limit:0KB64bit IO Format:%lld & %lluDescriptionWrite a program that finds and displays a... 阅读全文
摘要:
UVA - 524 Prime Ring ProblemTime Limit:3000MSMemory Limit:0KB64bit IO Format:%lld & %lluDescriptionA ring is composed of n (even number) circ... 阅读全文
摘要:
回溯法,只需要判断当前串的后缀,而不是所有的子串#include#includeusing namespace std;int s[1000];int n,l,cnt;int bfs(int cur){ if(cnt++==n) { for(int i=0; i>n>>l&... 阅读全文