摘要:
C - たくさんの数式 / Many Formulas Time limit : 2sec / Memory limit : 256MB Score : 300 points Problem Statement You are given a string S consisting of digit 阅读全文
摘要:
C - 高橋君とカード / Tak and Cards Time limit : 2sec / Memory limit : 256MB Score : 300 points Problem Statement Tak has N cards. On the i-th (1≤i≤N) card is 阅读全文
摘要:
D - Decrease (Contestant ver.) Time limit : 2sec / Memory limit : 256MB Score : 600 points Problem Statement We have a sequence of length N consisting 阅读全文
摘要:
D - アンバランス / Unbalanced Time limit : 2sec / Memory limit : 256MB Score : 400 points Problem Statement Given a string t, we will call it unbalanced if 阅读全文
摘要:
B. Gena's Code time limit per test 0.5 seconds memory limit per test 256 megabytes input standard input output standard output It's the year 4527 and 阅读全文
摘要:
#include using namespace std; const int N=1e2+7; int a[N],b[N],c[N],t[N]; void init(int t[]) //输入 { string s; cin>>s; memset(t,0,sizeof(t)); t[0]=s.size(); for(int i=1;... 阅读全文
摘要:
http://codeforces.com/contest/810/problem/B B. Summer sell-off time limit per test 1 second memory limit per test 256 megabytes input standard input o 阅读全文
摘要:
链接:http://codeforces.com/contest/810/problem/A A. Straight «A» time limit per test 1 second memory limit per test 256 megabytes input standard input o 阅读全文
摘要:
A - Sharing Cookies Time limit : 2sec / Memory limit : 256MB Score : 100 points Problem Statement Snuke is giving cookies to his three goats. He has t 阅读全文
摘要:
Problem Description 小s想要创造n种魔法宝石。小s可以用ai的魔力值创造一棵第i种魔法宝石,或是使用两个宝石合成另一种宝石(不消耗魔力值)。请你帮小s算出合成某种宝石的所需的最小花费。 Input 第一行为数据组数T(1≤T≤3)。对于每组数据,首先一行为n,m(1≤n,m≤10 阅读全文