fyiru15-CSDN博客

原创 UVa 401 Palindromes

UVa 401每例输出之间有一行空行。。#include#include#includeusing namespace std;int cmirpal(char c){ if(c=='A'||c=='H'||c=='I'||c=='M'||c=='O'||c=='T'|| c=='U'||c=='V'||c=='W'||c=='X'||c=='Y'||c=='1'

2013-12-02 00:17:32 412

原创 UVa 102 Ecological Bin Packing

UVa 102 Ecological Bin Packingc++只学了一点就开始做题的后果就是代码特别幼稚。。#include#include#include#includeusing namespace std; //暴力枚举各种情况找到最小值int main() { int bin[3][3], min, sum;

2013-09-11 19:12:21 443

原创 UVa 101 The Blocks Problem

UVa 101 The Blocks Problem

2013-09-10 20:43:13 399

原创 UVa 100 The 3n + 1 problem

UVa 100 The 3n + 1 problem#include#include#includeusing namespace std;int solve(int i, int cnt) { if (i == 1) return cnt; else if (i % 2) return solve(3 * i + 1, cnt + 1); else return

2013-09-09 21:28:18 410

原创 POJ 2260 Error Correction

POJ 2260 Error Correction#include#includeusing namespace std;const int maxn = 110;int mat[maxn][maxn];int main() { int n, row, col, cnt, sum, flag; //row,col记录要改变的位置坐标 while ((scanf("

2013-09-08 22:29:22 362

原创 POJ 1068 Parencodings

POJ 1068 Parencodings#include#includeusing namespace std;const int maxn = 41;int lr[maxn],rl[maxn],r[maxn],ans[maxn];//记录每个括号左侧的右括号数；右侧的左括号数；右括号的位置；答案int main(){ int cas,n,num,cnt; scanf("%

2013-09-08 20:48:28 385

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人