spongewxy-CSDN博客

原创 486A - Calculating Function

#include #include #include #include #include #include #include #include #include using namespace std;int main() { long long n, ans; cin >> n; ans = n / 2; if(n%2) ans -= n;

2015-05-22 15:05:16 466

原创 451A - Game With Sticks

#include #include #include #include #include #include #include #include #include using namespace std;int main() { int n, m, x; cin >> n >> m; x = min(n, m); if(x % 2 == 0)

2015-05-22 15:02:14 432

原创 144A - Arrival of the General

#include #include #include #include #include #include #include #include #include using namespace std;int a[110];int main() { int n; int ans = 0; int maxh = 0, minh = 1000000;

2015-05-22 11:57:45 614

原创 41A Translation

#include #include #include #include #include #include #include #include #include using namespace std;int main() { string s1, s2; cin >> s1 >> s2; int l1 = s1.length(); int

2015-05-22 11:40:10 638

原创 266B - Queue at the School

#include #include #include #include #include #include #include #include #include using namespace std;int main() { int n, t; string str; cin >> n >> t; cin >> str; while

2015-05-22 11:23:35 683

原创 228A - Is your horseshoe on the other hoof?

#include #include #include #include #include #include #include #include #include using namespace std;int main() { int s[4]; int ans = 0; cin >> s[0] >> s[1] >> s[2] >> s[3];

2015-05-22 11:09:47 423

原创 263A - Beautiful Matrix

#include #include #include #include #include #include #include #include #include using namespace std;int main() { int x, y, z; for(int i = 1; i <= 5; ++i) { for(int j = 1;

2015-05-22 10:57:44 421

原创 136A - Presents

#include #include #include #include #include #include #include #include #include using namespace std;int main() { int arr[110], ans[110]; int n; cin >> n; for(int i = 1; i

2015-05-22 10:52:14 366

原创 460A - Vasya and Socks

#include #include #include #include #include #include #include #include #include using namespace std;int main() { int n, m, ans = 0; cin >> n >> m; while(n >= m) { ans

2015-05-22 10:41:35 375

原创 472A - Design Tutorial: Learn from Math

#include #include #include #include #include #include #include #include #include using namespace std;bool check(int n) { for(int i = 2; i * i <= n; ++i) { if(n % i == 0) return

2015-05-22 10:29:22 689

原创 379A - New Year Candles

#include #include #include #include #include #include #include #include #include using namespace std;int main() { int a, b; int ans = 0; cin >> a >> b; ans = a; while(

2015-05-22 10:07:56 405

原创 122A - Lucky Division

#include #include #include #include #include #include #include #include #include using namespace std;int main() { int n; int i = 0; cin >> n; for(i = 1; i <= n; ++i) {

2015-05-22 09:39:00 669

原创 271A Beautiful Year

#include #include #include #include #include #include #include #include #include using namespace std;bool mark[10];int main() { int n; cin >> n; while(true) { ++n;

2015-05-22 09:33:33 545

原创 58A - Chat room

#include #include #include #include #include #include #include #include #include using namespace std;int main() { int i, j = 0; string s1 = "hello"; string s2; cin >> s2;

2015-05-22 09:25:50 703

原创 110A - Nearly Lucky Number

#include #include #include #include #include #include #include #include #include using namespace std;int main() { long long n; int ans = 0; cin >> n; while(n) { if(

2015-05-22 09:21:25 600

原创 467A - George and Accommodation

#include #include #include #include #include #include #include #include #include using namespace std;int main() { int n, p, q; int ans = 0; cin >> n; for(int i = 0; i < n;

2015-05-22 09:13:02 521

原创 119A - Epic Game

#include #include #include #include #include #include #include #include #include using namespace std;int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b);}int main() { int

2015-05-22 08:58:58 619

原创 236A - Boy or Girl

#include #include #include #include #include #include #include using namespace std;const int maxn = 30;int cnt[maxn];int main() { string str; memset(cnt, 0, sizeof(cnt)); cin >

2015-05-21 18:36:51 512

原创 148A - Insomnia cure

#include #include #include #include #include #include #include using namespace std;int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b);}int lcm(int a, int b) { return a / gcd

2015-05-21 18:29:00 472

原创 82A - Double Cola

#include #include #include #include #include #include #include using namespace std;string ans[5] = { "Sheldon", "Leonard", "Penny", "Rajesh", "Howard" };int main() { int n; int x =

2015-05-21 18:13:10 619

原创 160A - Twins

#include #include #include #include #include #include #include using namespace std;const int maxn = 110;int arr[maxn];int main() { int sum = 0, t = 0; int n; scanf("%d", &n);

2015-05-21 17:55:24 474

原创 281A - Word Capitalization

#-*- coding: utf-8 -*-s = raw_input()l = []if ord(s[0]) >= ord('a') and ord(s[0]) <= ord('z'): l.append(chr(ord(s[0])-ord('a')+ord('A')))else: l.append(s[0])for i in range(1, len(s)):

2015-05-21 17:45:01 485

原创 339A - Helpful Maths

#-*- coding: utf-8 -*-str = raw_input()cnt = [ 0 for i in range(4) ]for i in range(len(str)): if str[i] == '1': cnt[1] += 1 elif str[i] == '2': cnt[2] += 1 elif str[i]

2015-05-21 17:37:01 520

原创 112A - Petya and Strings

#include #include #include #include #include #include #include using namespace std;int main() { string a, b; cin >> a >> b; int l1 = a.length(); int l2 = b.length(); int

2015-05-21 17:21:28 546

原创 133A - HQ9+

#include #include #include #include #include #include #include using namespace std;int main() { string str; cin >> str; int len = str.length(); bool flag = false; for(int

2015-05-21 17:06:27 709

原创 266A - Stones on the Table

#include #include #include #include #include #include #include using namespace std;int main() { string str; int n; cin >> n >> str; int id = 0, ans = 0, pre = -1; while(i

2015-05-21 16:58:53 412

原创 96A - Football

#include #include #include #include #include #include #include using namespace std;int main() { string str; bool flag = false; cin >> str; int len = str.length(); for(int

2015-05-21 16:42:02 317

原创 131A - cAPS lOCK

#include #include #include #include #include #include #include using namespace std;int main() { string str; int cnt = 0; cin >> str; int len = str.length(); for(int i = 0

2015-05-21 16:32:49 712

原创 116A - Tram

#include #include #include #include #include #include #include using namespace std;int main() { int ans = 0; int tot = 0; int n, a, b; cin >> n; for(int i = 0; i < n; ++i

2015-05-21 16:08:52 411

原创 282A - Bit++

注意：C语言字符数组必须预留出一个‘\0’的位置。#include #include #include #include #include #include #include using namespace std;int main() { char op[5]; int n; int ans = 0; cin >> n; w

2015-05-21 16:01:23 226

原创 231A Team

#include #include #include #include #include #include #include using namespace std;int main() { int ans = 0; int n, a, b, c; cin >> n; for(int i = 0; i < n; ++i) { ci

2015-05-21 15:48:57 570

原创 158B - Taxi

#include #include #include #include #include #include #include using namespace std;int cnt[5];int main() { memset(cnt, 0, sizeof(cnt)); int n, x; int ans = 0; scanf("%d", &n

2015-05-21 15:41:11 719

原创 118A String Task

#include #include #include #include #include #include #include using namespace std;int main() { string str; string ans = ""; cin >> str; int len = str.length(); for(int i

2015-05-21 15:29:46 491

原创 50A Domino piling

#include #include #include #include #include #include #include using namespace std;int main() { int m, n; cin >> m >> n; cout << m*n/2 << endl; return 0;}

2015-05-21 15:29:41 416

原创 71A Way Too Long Words

#include #include #include #include #include #include #include using namespace std;int main() { //freopen("aa.in", "r", stdin); int n; string str; cin >> n; while(n--) {

2015-05-21 15:29:15 807

原创 158A Next Round

#include #include #include #include #include #include using namespace std;const int maxn = 60;int arr[maxn];int main() { int ans = 0; int n, k; cin >> n >> k; for(int i = 1;

2015-05-21 15:28:44 441

原创 4A Watermelon

#include #include #include #include #include #include using namespace std;int main() { int n; cin >> n; if(n % 2 == 0 && n > 2) { cout << "YES" << endl; } else {

2015-05-21 15:28:04 398

原创 1A Theatre Square

#include #include #include #include #include #include using namespace std;int main() { //freopen("aa.in", "r", stdin); int n, m, a; cin >> n >> m >> a; cout << 1LL*(n/a+(n%a

2015-05-21 15:27:19 465

原创 UVA 1374 Power Calculus

IDA*求解。程序代码：#include #include #include #include #include #include #include using namespace std;const int maxn = 1010;int n, maxd;int arr[110];bool check(int x, int len) { for(i

2015-05-20 21:07:55 590

首先我刚看到题目的时候，便想到了八数码，同样是基于状态空间的搜索。但是我们保存每个状态的却遇到了困难，如果要保存这24个数的排列的情况，则状态空间便成为24!/(8!*8!*8!)，状态空间非常巨大。现给出一种减少状态空间的方法，我们可每次只考虑中间方格内的数为1,2,3的三种情况，则对于一种情况我们，其余另外两个数我们便于同等对待，这样我们的状态空间便成为了C(24,8)，大小是我们能够承受的。

2015-05-20 19:09:42 553

空空如也

空空如也