![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
构造法
Grit_ICPC
Dielts
展开
-
Poj3295 Tautology
TautologyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10425 Accepted: 3956DescriptionWFF 'N PROOF is a logic game played with dice. Each die has six原创 2015-06-26 11:06:44 · 650 阅读 · 0 评论 -
矩阵的旋转 2559 SDUT
#include#include#include#include#include#include#include#include#define L1 long long#define L2 __int64#define inf 0x3f3f3f3fusing namespace std;const int m1=1001000;const int m2=1010;int原创 2016-01-02 18:25:40 · 548 阅读 · 0 评论 -
SDUT 2254 字母螺旋方阵(递归)
与之前做过的螺旋矩阵不同之处在于,n*m的矩阵,并且是在A-Z之间不停循环的问题。注意控制好边界如递归条件一直在l#include #include #include#includeusing namespace std;int cnt;int a[1100][1100];int n,m;void so(int up,int down,int l,int r,int s,i原创 2016-01-03 09:51:23 · 1063 阅读 · 0 评论 -
PAT 沙漏
#include #include#include#includeusing namespace std;int arr[50],num[50];char str[10];int main(){ int n,m,i,j,k,ans; k = 1; ans = 0 ; for(i = 1;i <= 50;++ i){ arr[i] = k;原创 2016-05-12 17:49:09 · 423 阅读 · 0 评论