text stringlengths 49 983k |
|---|
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n;
char c;
while (1){
int sum = 0, ace = 0;
bool fin = false;
do {
scanf("%d", &n);
if (n == 0){
fin = true;
break;
}
if (n == 1){
ace++;
}
else {
sum += min(n, 10);
}
} while (scanf("%c", &c), c != '\n');
if (fin){
break;
}
int rs = 0;
for (int i = 0; i <= ace; i++){
int tmp = sum + i + (ace - i) * 11;
if (tmp > 21){
tmp = 0;
}
rs = max(tmp, rs);
}
printf("%d\n", rs);
}
return (0);
} |
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int check(int n){
if(n > 21) return 0;
return n;
}
int main(void){
int n,sum=0,f=0;
while(cin >> n && n){
if(n>10) n = 10;
if(n==1) f = 10;
sum += n;
if(getchar() == '\n'){
cout << max(check(sum),check(sum+f)) << endl;
sum = 0;
f = 0;
}
}
} |
#include<cstdio>
#include<sstream>
#define MAX(x,y) ((x>y)?x:y)
using namespace std;
int main(){
int i,j,x,sum,f,ans;
char s[512];
while(fgets(s,512,stdin)!=NULL){
istringstream ss(s);
f=sum=0;
while(ss>>x){
if(x==0)goto fin;
if(x==1)f++;
else if(x>9)sum+=10;
else sum+=x;
}
ans=0;
for(i=0;i<=f;i++){
x=sum+i+11*(f-i);
if(x>21)x=0;
ans=MAX(ans,x);
}
printf("%d\n",ans);
}
fin:
return 0;
} |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int ans;
vector<int> split(string s){
int n=0;
vector<int> vc;
s += " ";
for(int i=0 ; i < s.size() ; i++ ){
if( s[i] == ' ' ){
vc.push_back( n );
n = 0;
}else if( s[i] >= '0' && s[i] <= '9' ){
n = n*10 + (s[i] - '0');
}
}
return vc;
}
void solve(const vector<int>& a,int i,int p){
if( p > 21 ){
return;
}
if( i == a.size() ){
ans = max( ans , p );
return;
}
if( a[i] == 1 ){
solve( a , i+1 , p+1 );
solve( a , i+1 , p+11 );
}else if( a[i] >= 10 ){
solve( a , i+1 , p+10 );
}else{
solve( a , i+1 , p+a[i] );
}
}
int main(){
string s;
while( getline(cin,s) , s != "0" ){
vector<int> a = split(s);
ans = 0;
solve( a , 0 , 0 );
cout << ans << endl;
}
} |
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
char c[256];
int d[100],i,s,p,f;
while(true) {
for (i=0;i<255;i++) c[i]=1;
i=p=0;
gets(c);
if (c[0]=='0') break;
while(true) {
if (c[p+2]==' ' || c[p+2]=='\0') { d[i]=(c[p]-'0')*10+(c[p+1]-'0'); p+=3;}
else if (c[p+1]==' ' || c[p+1]=='\0') { d[i]=(c[p]-'0'); p+=2;}
if (c[p-1]=='\0') break;
i++;
}
for (s=0,f=0;i>=0;i--) if (d[i]>0 && d[i]<10) { s+=d[i]; if (d[i]==1) f=1;} else s+=10;
if (f==1 && s+10<22) s+=10;
if (s>21) s=0;
cout << s << endl;
}
return 0;
} |
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
#define FOR(i, m, n) for(int i=(m); i<(n); ++i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define mp make_pair
#define pb push_back
#define Cout(x) cout << (x) << endl
#define Cout2(x, y) cout << (x) << " " << (y) << endl
#define dump(x) cout << #x << " = " << (x) << endl;
#define forauto(i, a) for(auto i : a)cout << i << " "; puts("");
typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<vector<int>> VVI;
typedef pair<int, int> PII;
const int inf = 1e9;
const double pi = acos(-1.0);
//文字列分割
vector<int> split(string str, char del) {
vector<int> re;
string sub;
for (char c : str) {
if (c == del) {
re.push_back(stoi(sub));
sub.clear();
}
else {
sub += c;
}
}
re.push_back(stoi(sub));
return re;
}
int main() {
string s;
while (true) {
getline(cin, s);
if (s == "0")break;
VI a = split(s, ' ');
int sum = 0, cnt1 = 0;
for (auto n : a) {
if (2 <= n && n <= 9)sum += n;
else if (10 <= n && n <= 13)sum += 10;
else if (n == 1 || n == 11)cnt1++;
}
int ans = -1;
rep(i, cnt1 + 1) {
int x = sum + 1 * i + 11 * (cnt1 - i);
x = x > 21 ? 0 : x;
ans = max(ans, x);
}
Cout(ans);
}
}
|
#include <iostream>
#include <sstream>
using namespace std;
int main()
{
string s;
while( getline( cin, s ), s != "0" )
{
stringstream ss(s);
ss << s;
int sum = 0, one = 0, a;
while( ss >> a )
{
if( a == 1 ) one++;
else sum += min( 10, a );
}
if( one > 21 || sum > 21 || one + sum > 21 )
{
cout << 0 << endl;
}
else
{
int p = ( 11 * one + sum - 21 + 10 - 1) / 10;
cout << p + ( one - p ) * 11 + sum << endl;
}
}
return 0;
}
|
//53
#include<iostream>
#include<string>
#include<sstream>
using namespace std;
int main(){
for(string s;getline(cin,s),s!="0";){
stringstream ss(s);
int p=0,o=0;
for(int c;ss>>c;){
if(c==1){
o++;
}else if(c>=10){
p+=10;
}else{
p+=c;
}
}
while(o&&p+11+o-1<=21){
p+=11;
o--;
}
p+=o;
cout<<((p>21)?0:p)<<endl;
}
return 0;
} |
#include<iostream>
#include<stdio.h>
#include<vector>
using namespace std;
int main(){
int n;
char c;
int sum = 0;
vector<int> V;
while(1){
scanf("%d%c",&n,&c);
if(n == 0) break;
V.push_back(n);
if(c == '\n'){
int first = 0;
for(int i = 0; i < V.size(); i++){
if(V[i] > 10 && V[i] <= 13 ) V[i] = 10;
if(V[i] != 1) sum += V[i];
else first++;
}
if(first > 0){
int leaves = 21;
leaves -= sum;
leaves -= first;
for(int i = 0; i < first;i++){
if(leaves >= 10) leaves -= 10;
}
sum = 21-leaves;
}
if(sum > 21) sum = 0;
}else{
continue;
}
cout << sum << endl;
sum = 0;
V.clear();
}
return 0;
} |
#define _USE_MATH_DEFINES
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
#include <iterator>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())
typedef unsigned long long ull;
const int INF = (int)1e8;
int main(){
string s;
while(getline(cin,s),s != "0"){
istringstream iss(s);
vector<int> v; int x;
while(iss>>x) v.push_back(x);
int one = 0,ans = 0;
FOR(i,sz(v)) {
if(v[i] == 1) one++;
else ans += min(10,v[i]);
}
ans += one;
for(int i = 0; i < one; i++){
if(ans + 10 > 21) break;
ans += 10;
}
cout << (ans>21?0:ans) << endl;
}
return 0;
} |
#include <iostream>
#include <algorithm>
#include <cassert>
#include <cctype>
#include <complex>
#include <cstdio>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int n;
string st;
int main(){
while(getline(cin,st)){
if(st=="0")return 0;
int cur=0,p=0,one=0,s=0;
while(cur<st.size()){
if(isdigit(st[cur]))p=p*10+st[cur]-'0';
if(st[cur]==' '){
if(p==1)one++;
if(p>10)s+=10;
else s+=p;
p=0;
}
cur++;
}
if(p==1)one++;
if(p>10)s+=10;
else s+=p;
if(s>21)cout<<0<<endl;
else{
if(s<12&&one)cout<<s+10<<endl;
else cout<<s<<endl;
}
}
} |
#include<iostream>
#include<string>
#include<queue>
#include<algorithm>
using namespace std;
int main(){
string s;
int sum,ans,now,cou,pre;
priority_queue<int> que;
while(getline(cin,s),s[0]!='0'){
sum=0;
for(int i=0;i<s.size();i++){
if(isdigit(s[i])){
sum=sum*10+(s[i]-'0');
}
else{
que.push(sum);
sum=0;
}
}
cou=0;
que.push(sum);
ans=0;
while(!que.empty()){
now=que.top();
que.pop();
if(now>=2&&now<=9)
ans+=now;
else if(now>9)
ans+=10;
else if(now==1)
cou++;
}
int m=ans;
if(cou+ans>21)
cout<<'0'<<endl;
else{
for(int i=0;i<=cou;i++){
pre=m+cou-i+i*11;
if(pre<=21){
ans=max(pre,ans);
}
}
if(ans>21)
cout<<'0'<<endl;
else cout<<ans<<endl;
}
}
return 0;
} |
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
char num[1000];
while (gets(num) != NULL){
if (num[0] == '0'){
break;
}
int score = 0;
int f = 0;
int i = 0;
int len = strlen(num);
while (i < len){
if (num[i] == '1' && (num[i + 1] >= '0' && num[i + 1] <= '3')){
score += 10;
i += 3;
}
else if (num[i] == '1'){
score++;
f = 1;
i += 2;
}
else if ('2' <= num[i] && num[i] <= '9'){
score += (num[i] - '0');
i += 2;
}
}
if (score > 21){
score = 0;
}
else if (f == 1 && score + 10 <= 21){
score += 10;
}
cout << score << endl;
}
return (0);
} |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
void Atoi(vector<int>&, string);
int Blackjack(vector<int>);
bool Searhone(int);
int main(){
int i, n, result;
string line;
vector<int> Number;
while(1){
getline(cin, line);
if(line == "0") break;
Atoi(Number, line);
result = Blackjack(Number);
cout << result << endl;
Number.clear();
}
return 0;
}
void Atoi(vector<int>& n, string s){
int i=0, x;
while(i < s.size()){
if(s[i+1] == ' ' || i == s.size()-1){
x = s[i] - 48;
i += 2;
}else{
x = 10 * (s[i] - 48) + (s[i+1] - 48);
i += 3;
}
n.push_back(x);
}
}
int Blackjack(vector<int> n){
int k, sum=0, onecount=0;
vector<int>::iterator i, j;
for(k=0; k<n.size(); ++k){
if(n[k] > 10) n[k] = 10;
}
i = partition(n.begin(), n.end(), Searhone);
j = n.begin();
while(j != i){
if(sum <= 21 - *j)
sum += *j;
else
return 0;
++j;
}
if(i != n.end()){
while(i != n.end()){
++onecount;
++i;
}
if(onecount == 1){
if(sum <= 10)
sum += 11;
else if(sum <= 20)
sum++;
else
sum = 0;
}else{
if(sum <= 10 - (onecount-1))
sum = sum + 11 + (onecount-1);
else if(sum <= 20 - onecount)
sum += onecount;
else
sum = 0;
}
}
return sum;
}
bool Searhone(int n){
if(n == 1)
return false;
else
return true;
} |
#include<iostream>
#include<sstream>
#include<vector>
#include<algorithm>
using namespace std;
vector<int> check(vector<int>data,int i)
{
vector<int> ans;
ans.push_back(0);
if(data.size()<=i)
return ans;
ans.clear();
vector<int> tmp=check(data,i+1);
if(data[i]!=1)
{
for(int j=0;j<tmp.size();j++)
if(data[i]+tmp[j]<=21)
ans.push_back(data[i]+tmp[j]);
}
else
{
for(int j=0;j<tmp.size();j++)
{
if(1+tmp[j]<=21)
ans.push_back(1+tmp[j]);
if(11+tmp[j]<=21)
ans.push_back(11+tmp[j]);
}
}
return ans;
}
int main()
{
string s;
for(;getline(cin,s),s!="0";)
{
istringstream ss(s);
vector<int> data;
int tmp;
for(;ss>>tmp;)
{
if(tmp>10)
tmp=10;
data.push_back(tmp);
}
vector<int> ans=check(data,0);
int out=0;
for(int i=0;i<ans.size();i++)
{
out=max(out,ans[i]);
}
cout<<out<<endl;
}
} |
#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
string s;
vector<int> parse(string str) {
vector<int> ret; str += " "; int t = 0;
for(int i = 0; i < str.size(); i++) {
if(str[i] == ' ') ret.push_back(t), t = 0;
else t = t * 10 + str[i] - 48;
}
return ret;
}
int main() {
while(s = "", getline(cin, s)) {
if(s == "0") break;
vector<int> v = parse(s);
int a = 0, b = 0;
for(int i = 0; i < v.size(); i++) {
if(v[i] > 10) a += 10;
else a += v[i];
if(v[i] == 1) b++;
}
cout << ((a < 22) ? a + min(b, (21 - a) / 10) * 10 : 0) << endl;
}
} |
#include <iostream>
#include <vector>
#include <list>
#include <algorithm>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <sstream>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#define rep(i, n) for(int i = 0; i < n; i ++)
#define COUNT(i, n) for(int i = 1; i <= n; i ++)
#define ITER(c) __typeof((c).begin())
#define each(c, it) for(ITER(c) it =(c).begin(); it!=(c).end(); it++)
#define ALL(c) c.begin(), c.end()
#define mp make_pair
#define pb push_back
#define MEMSET(v, h) memset((v), h, sizeof(v))
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;
const int INF = 1 << 24;
int main(void){
int res;
for(string in; getline(cin, in), in.at(0) != '0'; cout << res << endl){
stringstream ss;
ss << in;
bool one = false;
res = 0;
while(ss >> in){
int cur = in.size() > 1 ? 10:in.at(0) - '0';
if(cur == 1) one = true;
res += cur;
}
if(one && res <= 11) res += 10;
if(21 < res) res = 0;
}
return 0;
} |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <sstream>
#include <numeric>
#include <iterator>
using namespace std;
vector<int> parse(string s) {
istringstream iss(s);
vector<int> res;
for(int n; iss >> n; ) {
if(n > 10) n = 10;
res.push_back(n);
}
return res;
}
int main() {
for(string line; getline(cin, line), line != "0"; ) {
vector<int> cards = parse(line);
int one = 0;
for(int c : cards) if(c == 1) one++;
int s = accumulate(begin(cards), end(cards), 0);
for(int i = 0; i < one; i++) {
if(s + 10 <= 21) s += 10;
}
if(s > 21) s = 0;
cout << s << endl;
}
} |
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n;
char c;
while (1){
int sum = 0, ace = 0;
bool fin = false;
do {
scanf("%d", &n);
if (n == 0){
fin = true;
break;
}
if (n == 1){
ace++;
}
else {
sum += min(n, 10);
}
} while (scanf("%c", &c), c != '\n');
if (fin){
break;
}
int rs = 0;
for (int i = 0; i < ace + 1; i++){
int tmp = sum + i + (ace - i) * 11;
if (tmp > 21){
tmp = 0;
}
rs = max(tmp, rs);
}
printf("%d\n", rs);
}
return (0);
} |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<climits>
#include<string>
#include<vector>
#include<list>
#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<cstring>
#include<stack>
#include<functional>
using namespace std;
int main(){
string S;
while(getline(cin,S)){
priority_queue<int,vector<int>,greater<int> > pq[2]; pq[0].push(0);
int cnt = 0;
for(int i=0;i<S.size();i++){
if(i==0 || S[i]==' '){
int n = stoi(&S[i]);
if(n==0) return 0;
while(!pq[cnt&1].empty()){
int pq_c = pq[cnt&1].top(); pq[cnt&1].pop();
if(pq_c>21) continue;
if(n==1) pq[(cnt+1)&1].push(pq_c+1), pq[(cnt+1)&1].push(pq_c+11);
else if(n<10) pq[(cnt+1)&1].push(pq_c+n);
else pq[(cnt+1)&1].push(pq_c+10);
}
cnt++;
}
}
int ans = 0;
while(!pq[cnt&1].empty()){
if(pq[cnt&1].top()<=21) ans = max(ans,pq[cnt&1].top());
pq[cnt&1].pop();
}
printf("%d\n",ans);
}
return 0;
} |
#include<iostream>
#include<vector>
#include<string>
using namespace std;
int Parse(string a) {
int s = 0;
for (int b = 0; b < a.length(); b++) {
s *= 10;
s += a[b] - 48;
}
return s;
}
int main() {
string a;
while (1) {
getline(cin, a);
if (a[0]=='0')break;
vector<int>s;
string c="";
for (int b = 0; b < a.length(); b++) {
if (a[b] == ' ') { s.push_back(Parse(c)); c = ""; }
else c += a[b];
}
s.push_back(Parse(c));
int m = 0;
int n = 0;
for (int d = 0; d < s.size(); d++) {
if (s[d] > 9&&s[d]<14)m += 10;
else if (s[d] > 1)m += s[d];
else n++;
if (m > 21) { cout << 0 << endl; goto l; }
}
if (m + 10 + n < 22&&n!=0)m += 10 + n;
else m += n;
if (m > 21)m = 0;
cout << m << endl;
l:;
}
} |
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <functional>
#include <utility>
#include <algorithm>
#include <numeric>
#include <typeinfo>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <ctime>
using namespace std;
#define dump(n) cout<<"# "<<#n<<"="<<(n)<<endl
#define debug(n) cout<<__FILE__<<","<<__LINE__<<": #"<<#n<<"="<<(n)<<endl
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,n) repi(i,0,n)
#define iter(c) __typeof((c).begin())
#define foreach(i,c) for(iter(c) i=(c).begin();i!=(c).end();i++)
#define allof(c) (c).begin(),(c).end()
#define mp make_pair
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int,int> pii;
int main()
{
for(string s;getline(cin,s),s[0]!='0';){
istringstream iss(s);
vi a;
for(int n;iss>>n;)
a.push_back(n);
int res=0;
rep(i,a.size())
res+=min(a[i],10);
int onesize=count(allof(a),1);
rep(i,onesize)
if(res+10<=21)
res+=10;
if(res>21)
res=0;
cout<<res<<endl;
}
return 0;
} |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;
#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#define BW(a,x,b) ((a)<=(x)&&(x)<=(b))
#define F first
#define S second
#define INF 1 << 30
typedef pair<int, int> pi;
typedef pair<int, pi> pii;
typedef vector<int> vi;
typedef queue<int> qi;
typedef long long ll;
int a[14], p;
int main(){
char str[514];
while(fgets(str, sizeof(str), stdin) && str[0] != '0'){
memset(a, 0, sizeof(a));
char *tp;
tp = strtok(str, " ");
while(tp != NULL){
a[atoi(tp)]++;
tp = strtok(NULL, " ");
}
// rep(i, p) printf("%d ", a[i]); puts("");
int res = 0;
a[10] += a[11]; a[10] += a[12]; a[10] += a[13];
REP(i, 2, 11) res += a[i]*i;
// printf("%d\n", res);
// printf("%d\n", a[1]);
int one = 11*a[1];
while(res+one > 21 && one != a[1]){
one -= 10;
}
// printf("%d\n", res+one);
res += one;
if(res > 21) res = 0;
printf("%d\n", res);
}
return 0;
} |
#include "bits/stdc++.h"
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb push_back
int main(){
string s;
while(1){
getline(cin,s);
if(s=="0")break;
s+=" ";
vector<string> st;
string buf="";
rep(i,s.size()){
if(s[i]!=' ')buf+=s[i];
else{
st.pb(buf);
buf="";
}
}
int score=0;
int c=0;
rep(i,st.size()){
if(st[i]!="1"){
int num=stoi(st[i]);
if(10<=num)score+=10;
else score+=num;
}
else{
score+=1;
c++;
}
}
rep(i,c){
if(21-score>=10)score+=10;
}
if(score>21)cout<<"0"<<endl;
else cout<<score<<endl;
}
} |
#include <stdio.h>
#include<math.h>
#include <algorithm>
using namespace std;
int main(){
char buf[400];
int checkTable[14],tmp,sum;
while(true){
fgets(buf,400,stdin);
if(buf[0] == '0')break;
for(int i= 1; i <= 13; i++){
checkTable[i] = 0;
}
sum = tmp = 0;
for(int i=0; buf[i] != '\n' && buf[i] != '\0'; i++){
if(buf[i] >= '0' && buf[i] <= '9'){
tmp = 10*tmp + (buf[i] - '0');
if(buf[i+1] == '\n' || buf[i] == '\0'){
checkTable[tmp]++;
}
}else{
checkTable[tmp]++;
tmp = 0;
}
}
for(int i=10; i <= 13; i++)sum += 10*checkTable[i];
for(int i= 9; i >= 2; i--)sum += i*checkTable[i];
if(sum > 21)printf("0\n");
else{
if(checkTable[1] == 0)printf("%d\n",sum);
else{
if(sum + checkTable[1] > 21){
printf("0\n");
}else if(sum >= 11){
printf("%d\n",sum+checkTable[1]);
}else{
int zero,one;
zero = sum + checkTable[1];
one = sum + 11 + checkTable[1]-1;
if(one > 21)one = 0;
sum = max(zero,one);
printf("%d\n",sum);
}
}
}
}
return 0;
} |
#include <cstdio>
#include <utility>
#include <cctype>
#include <algorithm>
using namespace std;
#ifdef __linux
#define _U(s) s##_unlocked
#else
#define _U(s) _##s##_nolock
#define _CRT_DISABLE_PERFCRIT_LOCKS
#endif
#define gcu _U(getchar)
#define pcu _U(putchar)
#define _DEF(r, n, ...) inline r n(__VA_ARGS__) noexcept
#define _T template <typename T>
#define _HT template <typename H,typename... T>
#define _OP(t) inline operator t()
struct _in {
#ifdef _GLIBCXX_STRING
_OP(string){string s;char c;while(isspace(c = gcu()));do{s+=c;}while(c=gcu(),c!=' '&&c!='\n'&&c!=EOF);return s;}
#define _S
#endif
_OP(char){char c=gcu();gcu();return c;}
_OP(double){double d; scanf("%lf",&d); gcu();return d;}
_T _OP(T){T n{},m{1},c;while(isspace(c = gcu()));if(c=='-')m=-1,c=gcu();do{n=10*n+(c-'0'),c=gcu();}while(c>='0'&&c<='9');return m*n;}
} in;
#define _SCAN(...) _DEF(bool,scan,__VA_ARGS__)
#ifdef _S
_SCAN(string &o) {int c{gcu()};if(c==EOF)return false;else{ungetc(c,stdin);string t=move(in);o=t;return true;}}
#endif
_T _SCAN(T &o) {int c{gcu()};return c==EOF?false:(ungetc(c,stdin),o=in,true);}
_HT _SCAN(H &h,T&&... t){return scan(h)&&scan(t...);}
#define _OUT(...) _DEF(void,out,__VA_ARGS__)
#define _OUTL(...) _DEF(void,outl,__VA_ARGS__)
_OUT(bool b){pcu('0'+b);}
_OUT(const char *s){while(*s)pcu(*s++);}
_OUT(char c){pcu(c);}
#ifdef _S
_OUT(string &s){for(char c:s)pcu(c);}
#endif
_T _OUT(T n){static char b[20];char *p=b;T m=n<0?pcu('-'),-1:1;
if(!n)*p++='0';else while(n)*p++=(char)(n%10*m+'0'),n/=10;while(p!=b)pcu(*--p);}
_OUTL(){out('\n');}
#ifdef _GLIBCXX_VECTOR
_T _OUT(vector<T> &v){for(T &x:v)out(&x == &v[0]?"":" "),out(x);}
#endif
_HT _OUT(H &&h, T... t){out(h);out(t...);}
template <typename... T> _OUTL(T... t){out(t...);outl();}
struct range{
int e,b=0,s=1;range(int _b,int _e,int _s):e(_e),b(_b),s(_s){} range(int _b,int _e): e(_e), b(_b){} range(int _e):e(_e){}
struct it{int v,s; it(int _v,int _s):v(_v),s(_s){} operator int()const{return v;} operator int&(){return v;}int operator*()const{return v;}
it& operator++(){v+=s;return *this;} }; it begin(){return {b,s};} it end(){return {e,s};}};
#define times(i,n) for(int i=n;i;i--)
int main() {
for (;;) {
int r {}, o {};
do {
int n;
scanf("%d", &n);
if (n > 1)
r += min(10, n);
else if (n == 1)
o++;
else
return 0;
} while (gcu() != '\n');
if (o > 0)
r += (r += o - 1) + 11 <= 21 ? 11 : 1;
outl(r > 21 ? 0 : r);
}
}
|
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <cstdlib>
#include <algorithm>
using namespace std;
int main() {
while( 1 ) {
string line;
getline( cin, line );
vector<int> cards;
istringstream iss(line);
string item;
while( iss >> item ) {
cards.push_back( atoi( item.c_str() ) );
}
if( !cards[ 0 ] ) { return EXIT_SUCCESS; }
sort( cards.begin(), cards.end() );
int one_num = 0;
for( ; cards[ one_num ] == 1; one_num++ ); // counts '1' cards
int len = cards.size();
int sum = 0;
for( int i = 0; i < len; i++ ) {
sum += min( cards[ i ], 10 );
}
sum = ( sum > 21 ? 0 : sum );
while( sum != 0 && one_num > 0 ) {
if( sum + 10 > 21 ) break;
sum += 10;
one_num--;
}
cout << sum << endl;
}
} |
#include<bits/stdc++.h>
using namespace std;
int power(int n)
{
int num=1;
for(int i=0;i<n;i++)num*=10;
return num;
}
int serch(int sum,int n)
{
if(sum>21)return 0;
else if(n==0)return sum;
else return max(serch(sum+11,n-1),serch(sum+1,n-1));
}
int main()
{
string str;
while(getline(cin,str)){
if(str[0]=='0')break;
int card[1000]={},co=0,point=0;
for(int i=0;;i++){
if(str[i]==' '||str[i]=='\0'){
for(int j=point;j<i;j++)card[co]+=(str[j]-'0')*power(i-1-j);
co++;point=i+1;
}
if(str[i]=='\0')break;
}
int cou=0,sum=0;
for(int i=0;i<co;i++){
if(card[i]==1)cou++;
else if(card[i]<10)sum+=card[i];
else sum+=10;
}
cout<<serch(sum,cou)<<endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
const int dx[]={0,1,0,-1,1,-1,-1,1};
const int dy[]={-1,0,1,0,1,1,-1,-1};
const int INF = 1<<30;
const double EPS = 1e-15;
#define PB push_back
#define mk make_pair
#define fi first
#define se second
#define ll long long
#define reps(i,j,k) for(int i = (j); i < (k); i++)
#define rep(i,j) reps(i,0,j)
#define MOD 1000000007
typedef pair<int,int> Pii;
typedef pair<int,Pii> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
int main(){
string str;
while(true){
getline(cin,str);
vi num;
stringstream ss(str);
int tmp;
while(ss >> tmp){
num.PB(tmp);
}
if(num[0] == 0)break;
int one = 0;
int ans = 0;
rep(i,num.size()){
if(num[i]==1){
ans++;
one++;
}
else{
if(num[i] > 9){
ans+=10;
}
else{
ans+=num[i];
}
}
}
while(one--){
if(ans+10 < 22){
ans += 10;
}
}
if(ans >= 22)ans = 0;
printf("%d\n",ans);
}
return 0;
} |
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b) - 1;i>=(a);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)
#define PB push_back
#define INF INT_MAX/3
#define ALL(a) (a).begin(),(a).end()
#define CLR(a) memset(a,0,sizeof(a))
typedef long long int ll;
using namespace std;
vector<int> split(string s){
if(s.size()==1) return vector<int>(1,stoi(s));
vector<int> ret;
int x = -1;
REP(i,s.size()){
if(s[i] == ' '){
ret.PB(stoi(s.substr(x+1,i-x-1)));
x = i;
}
}
ret.PB(stoi(s.substr(x+1,s.size()-x)));
return ret;
}
int main(){
while(true){
string s;
getline(cin,s);
if(s == "0") break;
vector<int> c = split(s);
int ans = 0;
bool flg = false;
REP(i,c.size()){
if(c[i] >= 10) ans += 10;
else ans += c[i];
if(c[i]==1) flg = true;
}
if(ans <= 11 && flg) ans += 10;
if(ans > 21) ans = 0;
cout << ans << endl;
}
return 0;
} |
#include<cstdio>
#include<iostream>
#include<string>
#include<cmath>
#include<vector>
#include<stack>
#include<queue>
#include<algorithm>
#include<complex>
#include<stack>
using namespace std ;
typedef vector<int> vi ;
typedef vector<vi> vvi ;
typedef vector<string> vs ;
typedef pair<int, int> pii;
typedef long long ll ;
#define loop(i,a,b) for(int i = a ; i < b ; i ++)
#define rep(i,a) loop(i,0,a)
#define all(a) (a).begin(),(a).end()
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
int main(void){
string str;
while(getline(cin,str),str!="0"){
int a,b,c; a = b = c = 0;
bool one = false;
int sum = 0;
for(int i = 0 ; i < str.size() ; i ++){
if(str[i]==' ')continue;
//--
if(str[i] == '1') {
if(str[i+1] == ' '){
one = true;
sum ++;
}else if(str[i+1]=='\0'){
one = true;
sum ++;
}else {
sum += 10;
i++;
}
}
//--
else{
sum += str[i] - '0';
}
}
if(one && sum + 10 <= 21) sum += 10;
//cout<<sum<<endl;
cout<<(sum<=21?sum:0)<<endl;
}
} |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;
#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#define BW(a,x,b) ((a)<=(x)&&(x)<=(b))
#define F first
#define S second
#define INF 1 << 30
typedef pair<int, int> pi;
typedef pair<int, pi> pii;
typedef vector<int> vi;
typedef queue<int> qi;
typedef long long ll;
int a[512], p;
int dfs(int n, int c){
if(n > 21) return 0;
if(c == p) return n;
if(a[c] == 1) return max(dfs(n+1, c+1), dfs(n+11, c+1));
if(a[c] > 10) return dfs(n+10, c+1);
return dfs(n+a[c], c+1);
}
int main(){
char str[512];
while(fgets(str, sizeof(str), stdin) && str[0] != '0'){
memset(a, 0, sizeof(a));
char *tp;
p = 0;
tp = strtok(str, " ");
while(tp != NULL){
a[p++] = atoi(tp);
tp = strtok(NULL, " ");
}
printf("%d\n", dfs(0, 0));
}
return 0;
} |
#include <iostream>
#include <string>
using namespace std;
int pos = 0;
int read(string s){
int tmp = 0;
while(s[pos] == ' ') pos++;
while(s[pos] != ' '){
tmp = tmp * 10 + s[pos++] - '0';
}
return tmp;
}
int main(){
string s;
while(getline(cin,s)){
pos = 0;
int one = 0,sum = 0;
if(s == "0") break;
s += " ";
for(int i = 0;pos < s.length() - 1;i++){
int num = read(s);
if(num == 1) one++;
if(num >= 10) num = 10;
sum += num;
}
while(sum <= 11 && one){
one--;
sum += 10;
}
if(sum > 21) cout << 0 << endl;
else cout << sum << endl;
}
} |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<map>
#include<cstring>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(n) rep(i,n)
#define all(n) n.begin(),n.end()
int MAX = 21;
int main()
{
string s;
int l, n, one = 0;
while(getline(cin, s))
{
one = 0; n = 0;
vector<int> ans;
ans.push_back(0);
if(s == "0") break;
s += " ";
int l = s.size();
REP(l)if(s[i] != ' '){ n = n*10 + s[i] - '0';}
else
{
if(n == 1) one++;
if(n >= 10) n =10;
ans[0] += n;
n = 0;
}
REP(one){ans.push_back( ans[i] + 10); }
int maxp = 0;
REP(ans.size())if(ans[i] > maxp && ans[i] <= MAX) maxp = ans[i];
cout << maxp << endl;
}
return 0;
} |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
vector<int>input(string s) {
vector<int>ret;
int k = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == ' ') {
ret.push_back(min(k, 10));
k = 0;
}
else {
k *= 10;
if (s[i] == '1')k += 1;
else if (s[i] == '2')k += 2;
else if (s[i] == '3')k += 3;
else if (s[i] == '4')k += 4;
else if (s[i] == '5')k += 5;
else if (s[i] == '6')k += 6;
else if (s[i] == '7')k += 7;
else if (s[i] == '8')k += 8;
else if (s[i] == '9')k += 9;
else if (s[i] == '0')k += 0;
}
}
ret.push_back(min(k, 10));
return ret;
}
int main() {
string s;
while (getline(cin, s)) {
if (s == "0")return 0;
vector<int>v = input(s);
int cnt1 = 0;
int cnt = 0;
for (int i = 0; i < v.size(); i++) {
if (v[i] == 1)cnt1++;
else cnt += v[i];
}
int ans = 0;
cnt += cnt1;
if (cnt <= 21)ans = cnt;
for (int i = 0; i < cnt1; i++) {
cnt += 10;
if (cnt <= 21)ans = max(ans, cnt);
}
cout << ans << endl;
}
} |
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
string str;
while(getline(cin,str) && str != "0"){
int ans = 0, one = 0;
for(int i = 0 ; i < str.size() ; i++){
if(str[i] == ' ') continue;
else{
if(str[i] == '1'){
if(str[i+1] >= '0'){
ans += 10;
i++;
}
else one++, ans++;
}
else ans += str[i] - '0';
}
}
for(int i = 0 ; i < one ; i++){
if(ans + 10 <= 21) ans += 10;
}
if(ans > 21) ans = 0;
cout << ans << endl;
}
return 0;
} |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
#include<utility>
#include<cmath>
#include<sstream>
using namespace std;
#define all(a) a.begin(),a.end()
int main()
{
string s;
while(getline(cin,s))
{
if(s=="0")break;
stringstream ss(s);
int sum=0,c=0;
int x;
while(ss>>x)
{
sum+=min(10,x);
if(x==1)c++;
}
while(sum+10<=21&&c)
{
c--;
sum+=10;
}
if(sum>21)sum=0;
cout<<sum<<endl;
}
} |
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
int n;
char c;
int ans,ace;
while(1){
ans = 0;
ace = 0;
while(1){
c = getchar();
if(c=='0')goto Loop;
if(c=='\n')break;
else if(c!=' '){
n = c-'0';
if(n==1){
c = getchar();
if(c=='\n'){
ans += 1;
ace = 1;
break;
}else if(c!=' '){
ans += 10;
}else{
ans += 1;
ace = 1;
}
}else{
ans += n;
}
}
}
if(ans<12 && ace)ans+=10;
if(ans>21)ans = 0;
cout << ans << endl;
}
Loop:return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define TEMP_T template<typename T>
TEMP_T void sort(T& v){ sort(v.begin(), v.end()); }
TEMP_T void revs(T& v){ reverse(v.begin(), v.end()); }
TEMP_T void uniq(T& v){ sort(v); v.erase(unique(v.begin(), v.end()), v.end()); }
TEMP_T T cums(T& v){ T r(v.size()); partial_sum(v.begin(), v.end(), r.begin()); return r; }
TEMP_T void show(T& v, char delim=' ', char end='\n'){ for(int i=0; i<v.size()-1; i++) cout << v[i] << delim; cout << v[v.size()-1] << end; }
TEMP_T T acum(vector<T>& v, T b=0){ return accumulate(v.begin(), v.end(), b); }
TEMP_T vector<T> inpt(int n){ vector<T> v(n); for (int i=0; i<n; i++) cin >> v[i]; return v; }
static inline int in(){ int x; scanf("%d", &x); return x; }
static const int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
static const int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
struct Field {
Field(int w, int h) : w(w), h(h) {}
bool invalid(int x, int y){ return x < 0 || w <= x || y < 0 || h <= y; }
const int w, h;
};
struct Solver {
Solver(){}
int input(){
string line;
getline(cin, line);
if (line == "0") return 1;
stringstream ss(line);
string token;
while (getline(ss, token, ' ')){
stringstream is(token);
int c;
is >> c;
card.push_back(c);
}
return 0;
}
int solve(){
sort(card);
int one_cnt = 0;
int score = 0;
for (int i = 0; i < card.size(); i++){
if (card[i] == 1){
one_cnt++;
score += 11;
}
else {
score += min(card[i], 10);
}
while (score > 21){
if (one_cnt){
score -= 10;
one_cnt--;
}
else return 0;
}
}
return score;
}
vector<int> card;
};
int main()
{
while (1){
Solver s;
if (s.input()) break;
cout << s.solve() << endl;
}
return (0);
} |
#include <iostream>
#include <string>
#include <sstream>
#include <algorithm>
#include <vector>
#include <utility>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define repc(i,s,e) for(int i=(s); i<(e); i++)
#define pb(n) push_back((n))
#define mp(n,m) make_pair((n),(m))
#define all(r) r.begin(),r.end()
#define fi first
#define se second
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
vector<string> split(const string &s, char c = ' ') {
vector<string> ret;
stringstream ss(s);
string t;
while (getline(ss, t, c)) {
ret.push_back(t);
}
return ret;
}
int main() {
string s;
vector<string> v;
int p, t, n;
while (getline(cin, s)) {
v = split(s);
if (v[0] == "0")break;
p = 0;
n = 0;
for (int i = 0; i < v.size(); i++) {
t = atoi(v[i].c_str());
//cout << " " << t;
if (t < 10)p += t;
else p += 10;
if (t == 1)n++;
}
//cout << endl;
while (n > 0) {
if (p + 10 <= 21)p += 10;
n--;
}
if (p > 21)p = 0;
cout << p << endl;
}
} |
#include<iostream>
using namespace std;
int main(){
string s;
while(true){
getline(cin, s);
if(s.size() == 1 && s[0] == '0') break;
int k = 0, p = 0, ans = 0;
for(int i=0;i<s.size();i++){
if(s[i] == ' ') continue;
p += s[i]-'0';
if(i+1 != s.size() && s[i+1] != ' '){
p *= 10;
continue;
}
if(p > 10) ans += 10;
else ans += p;
if(p == 1) k++;
p = 0;
}
while(k--){
if(ans+10 < 22) ans += 10;
}
if(ans > 21) ans = 0;
cout << ans << endl;
}
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
while(getline(cin,s),s!="0"){
stringstream ss(s);
int x=0,i,ans,k;
int si=0;
vector<int> v;
v.clear();
v.push_back(0);
while(ss>>x){
si=v.size();
vector<int> n;
for(i=0;i<si;i++){
if(x==1){
k=v[i];
n.push_back(k+11);
v[i]++;
}else if(x>10){
v[i]+=10;
}else {
v[i]+=x;
}
}
for(i=0;i<n.size();i++) v.push_back(n[i]);
n.clear();
sort(v.begin(),v.end());
v.erase(unique(v.begin(),v.end()),v.end());
v.erase(lower_bound(v.begin(),v.end(),22),v.end());
}
sort(v.begin(),v.end());
ans=0;
for(i=0;i<v.size();i++){
if(v[i]<=21) ans=v[i];
}
cout << ans << endl;
s="";
}
return 0;
} |
#include <iostream>
#include <string>
#include <sstream>
#include <algorithm>
using namespace std;
int calc(int card[], int num) {
int sum = 0;
int A = 0;
int Ap[12][2] = {{0,0},{1,11},{2,12},{3,13},{4,14},{5,15},{6,16},{7,17},{8,18},{9,19},{10,20},{11,21}};
for(int i = 0; i < num; i++) {
if(card[i] != 1) {
if(card[i] >= 10) {
sum += 10;
} else {
sum += card[i];
}
} else {
A++;
}
}
int best = -1;
if(A >= 12) {
sum += A;
A = 0;
}
for(int i = 0; i < 2; i++) {
int temp = sum + Ap[A][i];
if(temp > 21) temp = 0;
if(temp > best) best = temp;
}
return best;
}
int main() {
while(1) {
string str;
getline(cin, str);
if(str == "0") break;
stringstream sin;
sin << str;
int card[1000];
fill(&card[0], &card[999]+1, 0);
int num;
for(int i = 0; i < 1000; i++) {
if(!(sin >> card[i])) {
num = i;
break;
}
if(i+1 == 1000) {
num = 1000;
break;
}
}
cout << calc(card, num) << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
string cards;
while(getline(cin, cards), cards != "0"){
stringstream ss(cards);
int ans = 0, x;
bool one = false;
while(ss >> x){
ans += min(x, 10);
if(x == 1) one = true;
}
if(ans > 21) cout << 0 << endl;
else cout << (one ? ((ans + 10 <= 21) ? ans + 10 : ans) : ans) << endl;
}
return 0;
} |
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <cmath>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <list>
#include <iostream>
#include <sstream>
#include <climits>
#include <cfloat>
#include <complex>
using namespace std;
int main()
{
char buf[512];
while (cin.getline(buf, sizeof(buf)), *buf != '0')
{
stringstream ss(buf);
int total = 0;
int one = 0;
int c;
while (ss >> c)
{
if (c == 1)
{
total += 11;
++one;
}
else if (c >= 10)
total += 10;
else
total += c;
}
while (total > 21 && one--)
total -= 10;
if (total <= 21)
printf("%d\n", total);
else
puts("0");
}
return 0;
} |
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;
template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;
int main() {
string s;
while(getline(cin, s), s != "0"){
vector<int> v{0};
for (auto &&i : s) {
if(i == ' ') v.emplace_back();
else v.back() = v.back()*10 + i-'0';
}
int val = 0, one = 0;
for (auto &&i : v) {
val += min(i, 10);
one += (i == 1);
}
while(val <= 11 && one){
val += 10;
one--;
}
if(val > 21) val = 0;
cout << val << "\n";
}
return 0;
}
|
#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
// < "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\a.txt" > "d:\d_download\visual studio 2015\projects\programing_contest_c++\debug\b.txt"
vector<string> split(const string &str, char delim) {
vector<string> res;
size_t current = 0, found;
while ((found = str.find_first_of(delim, current)) != string::npos) {
res.push_back(string(str, current, found - current));
current = found + 1;
}
res.push_back(string(str, current, str.size() - current));
return res;
}
int main() {
string st;
while (getline(cin,st)) {
if (st == "0")break;
vector<string>sts(split(st,' '));
vector<int>nums(sts.size());
for (int i = 0; i < sts.size(); ++i) {
nums[i] = stoi(sts[i]);
}
bool ace = false;
for (int i = 0; i < sts.size(); ++i) {
if (nums[i] >= 10)nums[i] = 10;
}
int sum = 0;
for (int i = 0; i < sts.size(); ++i) {
if (nums[i] == 1) {
ace = true;
}
sum += nums[i];
}
if (sum <= 11 && ace)sum += 10;
if (sum >= 22)sum = 0;
cout << sum << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(10);
string s;
while (getline(cin, s), s != "0") {
stringstream ss;
ss << s;
int sum = 0, one = 0, a;
while (ss >> a) {
if (a == 1) one++;
else sum += min(10, a);
}
if (one > 21 || sum > 21 || one + sum > 21) {
cout << 0 << endl;
} else {
int p = (11 * one + sum - 21 + 10 - 1) / 10;
cout << p + (one - p) * 11 + sum << endl;
}
}
return 0;
}
|
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstring>
#include <sstream>
#include <cassert>
using namespace std;
static const double EPS = 1e-5;
typedef long long ll;
typedef pair<int,int> PI;
typedef vector<int> vi;
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define mp make_pair
#define pb push_back
#define f first
#define s second
int main(){
string str;
while(getline(cin,str)){
if(str[0]=='0')break;
int ans=0,n1=0;
stringstream ss(str);
int t;
while(ss>>t){
if(t==1)n1++;
if(t>10)t=10;
ans+=t;
}
while(n1 && ans<12){
n1--;
ans+=10;
}
if(ans>21)ans=0;
cout<<ans<<endl;
}
} |
#include<iostream>
#include<sstream>
#include<string>
using namespace std;
int main(){
long a,b,c;
stringstream ss;
string s;
for(;;){
getline(cin,s);
if(s=="0")break;
ss.str("");ss.clear();
ss<<s;
b=c=0;
while(ss>>a){
if(a==1){c++;b+=11;}
else if(a>9)b+=10;
else b+=a;
}
while(b>21&&c>0){
b-=10;c--;
}
if(b>21)b=0;
cout<<b<<endl;
}
return 0;
} |
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
using namespace std;
int main()
{
string s;
while (getline(cin, s)) {
if (s.find_first_of("\n") != string::npos)
s.erase(s.end()-1);
if (s.find_first_of("\r") != string::npos)
s.erase(s.end()-1);
if (s == "0")
break;
istringstream iss(s);
int one = 0, sum = 0;
while (!iss.eof()) {
int num;
iss >> num;
if (num == 1)
++one;
else if (num >= 10)
sum += 10;
else
sum += num;
}
int ans = 0;
for (int i = 0; i <= one; ++i) {
int p = i + (one-i)*11 + sum;
if (p > 21)
p = 0;
ans = max(ans, p);
}
cout << ans << endl;
}
return 0;
} |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cctype>
using namespace std;
#define rep(i,n) for(int i = 0 ; i < (n) ; ++i )
vector<int>card;
int ans;
void bfs(int now,int sum){
if(sum > 21) return;
if(now == card.size()){
ans = max(ans,sum);
return;
}
bfs(now+1,sum+min(card[now],10));
if(card[now] == 1) bfs(now+1,sum+11);
}
int main(){
string s;
while(getline(cin,s) , s != "0"){
card.clear();
ans = 0;
int a = 0;
rep(i,s.size()){
if(isdigit(s[i])) a = a * 10 + s[i] - '0';
else if(s[i] == ' '){
card.push_back(a);
a = 0;
}
}
card.push_back(a);
bfs(0,0);
cout << ans << endl;
}
} |
#include <iostream>
#include <vector>
#include <sstream>
using namespace std;
int main(){
string str;
while(getline(cin, str)){
stringstream ss;
vector<int> hand;
if(str == "0") break;
int begin = 0;
int point = 0;
int one = 0;
bool isbust = false;
for(int i=0; i<str.size(); i++){
if(str[i] == ' ' || i == str.size()-1){
int tmp;
ss << str.substr(begin, i-begin+1);
ss >> tmp;
if(tmp < 10){
hand.push_back(tmp);
}else{
hand.push_back(10);
}
begin = i + 1;
}
}
for(int i=0; i<hand.size(); i++){
if(hand[i] == 1){
one++;
}else{
point += hand[i];
}
}
point += one*11;
while(one--&&point>21){
point -= 10;
}
if(point > 21){
cout << "0" << endl;
}else{
cout << point << endl;
}
}
return 0;
} |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cstdlib>
using namespace std;
int main(){
string str;
while(getline(cin,str)&&str!="0"){
vector<int> v;
int s=0;
for(int i = 0; i < str.size(); i++){
if(str[i]==' '||str.size()-1==i){
int t;
if(str.size()-1!=i)
t= atoi(str.substr(s,i-s).c_str());
else
t= atoi(str.substr(s,i-s+1).c_str());
v.push_back(t);
s=i+1;
}
}
sort(v.begin(),v.end(),greater<int>());
int sum=0;
for(int i = 0; i < v.size(); i++){
if(v[i]>=10){
sum+=10;
}
else if(v[i]<=9&&v[i]>=2){
sum+=v[i];
}
else if(v[i]==1){
int num = v.size()-i;
for(int j = 0; j < num; j++){
if((num-j-1)+sum+11<=21){
sum+=11;
}
else
sum+=1;
}
break;
}
}
if(sum<=21)
cout<<sum<<endl;
else
cout<<0<<endl;
}
return 0;
} |
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define repi(i,a,b) for(int i = (a); i < (b); i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
const int INF=1<<29;
const double EPS=1e-9;
const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
int main(){
string str;
while(getline(cin,str)){
if(str[0]=='0')break;
stringstream ss;
ss <<str;
int x;
int sum = 0;
int cnt = 0;
while(ss>>x){
if(x==1){
cnt++;
}
if(x >=11){
x = 10;
}
sum +=x;
}
for(int i =0;i < cnt;i++){
if(sum+10<=21){
sum +=10;
}else{
break;
}
}
if(sum >21)sum = 0;
cout <<sum<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define rrep(i,n) for(int i=(int)(n)-1; i>=0; i--)
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin(); it!=(c).end(); it++)
#define pb(a) push_back(a)
#define pr(a) cout << (a) << endl
#define PR(a,b) cout << (a) << " " << (b) << endl
#define F first
#define S second
typedef long long ll;
typedef pair<int,int> P;
const int MAX=1000000001;
const ll MAXL=1000000000000000001LL;
const ll mod=1000000007;
int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};
int main() {
string s;
while(getline(cin,s)) {
if(s=="0") break;
int sum=0,k=0,x;
stringstream ss;
ss << s;
while(ss >> x) {
if(x>10) x=10;
sum+=x;
if(x==1) {
k++;
sum+=10;
}
}
while(sum>21 && k--) sum-=10;
if(sum>21) sum=0;
pr(sum);
}
return 0;
}
|
#include <iostream>
#include <cstdio>
using namespace std;
int main(void)
{
char c;
int num;
while(true){
int x = 0;
int one = 0;
int sum = 0;
while(scanf("%d", &num)){
if(num > 10)
num = 10;
if(num == 1)
one++;
else
sum += num;
scanf("%c", &c);
if(c == '\n')
break;
}
if(num == 0 && one == 0)
break;
if(sum > 21)
cout << 0 << endl;
else {
if(one > 0){
if(sum + 11 + (one-1) <= 21)
cout << sum + 11 + (one-1) << endl;
else if(sum + one <= 21)
cout << sum + one << endl;
else
cout << 0 << endl;
}
else
cout << sum + one << endl;
}
}
return 0;
}
|
#include <iostream>
#include <sstream>
#include <string>
using namespace std;
int main() {
while(1) {
string s;
getline(cin, s);
stringstream sstr(s);
int n;
int one_count = 0, pts = 0;
sstr >> n;
if(n == 0)
break;
do {
if(n == 1)
one_count++;
else if(n < 10)
pts += n;
else
pts += 10;
} while(sstr >> n);
int ret = pts + one_count;
ret = ret <= 21 ? ret : 0;
for(int i = 0; i <= one_count; i++) {
int tmp;
tmp = pts + i + 11 * (one_count - i);
tmp = tmp <= 21 ? tmp : 0;
ret = ret > tmp ? ret : tmp;
}
cout << ret << endl;
}
} |
#include<cstdio>
#include<iostream>
#include<string>
#include<vector>
#include<sstream>
using namespace std;
int card[50];
int main(void){
while(1){
string str;
getline(cin,str);
stringstream ss(str);
vector<string> v;
string buffer;
int sum=0,cnt=0;
while(getline(ss,buffer,' '))v.push_back(buffer);
if(v[0]=="0")break;
for(int i=0;i<v.size();i++){
stringstream iss(v[i]);
iss >> card[i];
if(card[i]==1)cnt++;
if(card[i]>=2 && card[i]<=9)sum+=card[i];
if(card[i]>=10)sum+=10;
}
if(sum>21)printf("0\n");
else{
int maxp=0;
for(int i=0;i<=cnt;i++){
int p=sum+1*i+11*(cnt-i);
if(p>21)continue;
maxp=max(maxp,p);
}
printf("%d\n",maxp);
}
}
return 0;
} |
#include<iostream>
#include<string>
#include<cstring>
#include<cstdlib>
using namespace std;
int main()
{
string s;
char *c;
int i, score, ace;
while (getline(cin,s)) {
if (s[0]=='0') break;
score = 0;
ace = 0;
c = strtok((char*)s.c_str(), " ");
while (c != NULL) {
if (atoi(c) > 9) score += 10;
else score += atoi(c);
if (atoi(c) == 1) ace++;
c = strtok(NULL, " ");
}
while (ace--) {
if (score + 10 > 21) break;
score += 10;
}
if (score > 21) score = 0;
cout<<score<<endl;
}
} |
#include<stdio.h>
#include<stdlib.h>
int main()
{
char str[256],*p,*np;
while(fgets(str,256,stdin),str[0]!='0')
{
int s=0,l,c1=0;
for(p=str;;)
{
l=strtol(p,&np,10);
if(p==np)break;
p=np;
s+=(l<10?l:10);
c1+=(l==1);
}
while(s<=11&&c1)s+=10,--c1;
printf("%d\n",(s>21?0:s));
}
return 0;
} |
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define rep2(x,from,to) for(int x=(from);x<(to);++(x))
#define rep(x,to) rep2(x,0,to)
int main(){
string s;
int tmp;
while(getline(cin, s)) {
if(s == "0") break;
stringstream ss(s);
vector<int> v;
while(!ss.eof()) {
ss >> tmp;
v.push_back(tmp);
}
int ret = 0, cnt = 0;
bool f = 0;
rep(i, v.size()) {
if(v[i] > 10) ret += 10;
else if(v[i] == 1) cnt++;
else ret += v[i];
}
ret += cnt;
while(cnt-- && ret < 12) {
ret += 10;
}
if(ret >= 22) f = 1;
if(f) cout << 0 << endl;
else cout << ret << endl;
}
return 0;
} |
#include<iostream>
#include<string>
using namespace std;
string S; int p[11];
char V[11] = "0123456789";
int main() {
while (true) {
S = "";
while (S == "") {
getline(cin, S);
}
if (S == "0") { break; }
S += ' '; string T = "";
for (int i = 0; i < 11; i++) { p[i] = 0; }
for (int i = 0; i < S.size(); i++) {
if (S[i] == ' ') {
if (T.size() >= 2) { p[10]++; }
else {
for (int j = 1; j < 10; j++) {
if (V[j] == T[0]) { p[j]++; }
}
}
T = "";
}
else {
T += S[i];
}
}
int sum = 0;
for (int i = 0; i < 11; i++) { sum += p[i] * i; }
if (sum <= 11 && p[1] >= 1) { sum += 10; }
if (sum >= 22) { sum = 0; }
cout << sum << endl;
}
return 0;
} |
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<array>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<numeric>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<unordered_map>
#include<queue>
#include<regex>
#include<vector>
using namespace std;
//#define int long long
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
#define dump(o) {cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) {cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
const int MOD = 1e9 + 7;
//split delimiter??§?????????
vector<string> split(const string& input, char delimiter) {
vector<string> ret;
istringstream stream(input);
string s;
while (getline(stream, s, delimiter)) ret.push_back(s);
return ret;
}
#define MAX 50
signed main() {
bool a[2][1000] = {};
for (string s; getline(cin, s) && s != "0";) {
fill(a[0], a[2], false);
a[0][0] = true;
vector<string> t = split(s, ' ');
rep(i, 0, t.size()) {
rep(j, 0, MAX)a[(i + 1) % 2][j] = false;
rep(j, 0, MAX - 20) {
if (stoi(t[i]) <= 10)
if (a[i % 2][j])a[(i + 1) % 2][stoi(t[i]) + j] = true;
if (stoi(t[i]) >= 11)
if (a[i % 2][j])a[(i + 1) % 2][10 + j] = true;
if (stoi(t[i]) == 1)
if (a[i % 2][j])a[(i + 1) % 2][11 + j] = true;
}
}
a[t.size() % 2][0] = true;
rrep(i, 0, 22) {
if (a[t.size() % 2][i]) {
cout << i << endl;
break;
}
}
}
return 0;
} |
#include <iostream>
#include <string>
#include <sstream>
#include <stdlib.h>
#include <vector>
#include <functional>
#include <algorithm>
using namespace std;
int max_point = 0;
bool ok_flag = false;
void recursive(int sum, int pos, vector<int>& card)
{
if(sum > 21)
{
return;
}
if(pos == card.size())
{
if(max_point < sum)
{
ok_flag = true;
max_point = sum;
return;
}
}
recursive(sum + 1, pos + 1, card);
recursive(sum + 11, pos + 1, card);
}
void solve()
{
string str;
while(getline(cin, str))
{
if(str == "0")
{
break;
}
max_point = 0;
stringstream ss(str);
string temp;
vector<int> card;
while(ss >> temp)
{
card.push_back(atoi(temp.c_str()));
}
sort(card.begin(), card.end(), greater<int>());
int sum = 0;
int one_pos = -1;
for(int i = 0; i < card.size(); ++i)
{
if(card[i] >= 10)
{
sum += 10;
}
else if(card[i] >= 2)
{
sum += card[i];
}
else
{
one_pos = i;
break;
}
}
if(sum > 21)
{
cout << 0 << endl;
continue;
}
if(max_point < sum && one_pos == -1)
{
max_point = sum;
cout << max_point << endl;
continue;
}
ok_flag = false;
recursive(sum, one_pos, card);
if(ok_flag)
{
cout << max_point << endl;
}
else
{
cout << 0 << endl;
}
}
}
int main()
{
solve();
return(0);
} |
#include <iostream>
using namespace std;
int main()
{
cin >> noskipws;
while(true)
{
int cards[21];
int card_num;
int ace_num = 0; // エースがあるかどうか
for (card_num = 0; ; card_num++)
{
if ( card_num == 22 )
{
int dummy;
char ws;
bool b = true;
while (b)
{
cin >> dummy >> ws;
if ( ws != ' ' )
{
b = false;
}
}
break;
}
cin >> cards[card_num];
if ( cards[card_num] == 0 ) return 0;
if ( cards[card_num] == 1 ) ace_num++;
char ws;
cin >> ws;
if ( ws != ' ' )
{
card_num++;
break;
}
}
int point = 0;
for (int i=0; i<card_num; i++)
{
if ( cards[i] < 10 )
{
point += cards[i];
}
else
{
point += 10;
}
}
while ( ace_num > 0 && point <= 11 )
{
point += 10;
ace_num--;
}
if ( point > 21 )
{
point = 0;
}
cout << point << endl;
}
} |
#include<iostream>
#include<string>
using namespace std;
int main(){
string a;
while (getline(cin, a) && a!="0") {
a += " ";
int c = 0, sum = 0;
string h = "";
for (int i = 0; i < a.length(); i++) {
if (a[i] == ' ') {
int d = atoi(h.c_str());
h = "";
if (d == 1) c++;
else {
if (d == 10 || d == 11 || d == 12 || d == 13)
sum += 10;
else sum += d;
}
}
else h += a[i];
}
if (sum > 21) {
cout << 0 << endl;
goto stop;
}
else {
sum += c;
if (sum > 21) {
cout << 0 << endl;
goto stop;
}
else {
while ((21 - sum) >= 10&&c!=0) {
sum += 10;
c--;
}
}
}
cout << sum << endl;
stop:;
}
} |
#include <iostream>
#include <vector>
#include <sstream>
#include <bitset>
using namespace std;
int main(){
string s;
while(getline(cin,s)){
if(s=="0") break;
stringstream ss;
ss << s;
vector<int> c;
int temp;
while(ss >> temp) c.push_back(temp);
bitset<22> bits;
bits.set(0);
for(int i=0;i<c.size();i++){
bitset<22> newbits;
int x = c[i];
for(int j=0;j<22;j++){
if(!bits[j]) continue;
if(x>=10) x = 10;
if(x != 1 && j+x <= 21) newbits.set(j+x);
if(x == 1){
if(j+11 <= 21) newbits.set(j+11);
if(j+1 <= 21) newbits.set(j+1);
}
}
bits = newbits;
}
int mm=0;
for(int i=0;i<22;i++){
if(bits[i]) mm = i;
}
cout << mm << endl;
}
} |
#include <bits/stdc++.h>
#define rep(i,a,n) for(int i=a;i<n;i++)
#define repb(i,a,b) for(int i=a;i>=b;i--)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
//#define int long long
#define fi first
#define se second
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
signed main() {
vi d;
while(1){
int a;
char c;
scanf("%d%c",&a,&c);
if(a == 0) break;
d.push_back(a);
if(c == '\n'){
int sum = 0;
int f = 0;
rep(i, 0, d.size()){
//cout <<d[i]<<" ";
if(d[i] == 1) f ++;
else sum += min(10, d[i]);
}
if(f){
if(21 - sum - f + 1 >= 11) sum += 11 + f - 1;
else sum += f;
}
cout<< (sum > 21 ? 0 : sum) << endl;
d.clear();
}
}
} |
#include <iostream>
#include <string>
#include <sstream>
#include <cstring>
#include <algorithm>
#include <functional>
using namespace std;
int calc_point(int* cards, int size) {
int point = 0;
sort(cards, cards+size, greater<int>());
for (int i = 0; i < size; i++) {
if (10 <= *(cards+i) && *(cards+i) <= 13) {
point += 10;
} else if (cards[i] != 1) {
point += cards[i];
} else {
int remain_ace = size - i;
while (remain_ace) {
if (remain_ace == 1) {
if (point <= 10) {
point += 11;
} else {
point += 1;
}
} else {
point += 1;
}
i++;
remain_ace--;
}
}
}
if (point > 21) point = 0;
return point;
}
#define MAX 1000
int main() {
string s;
int hand[MAX];
while (getline(cin, s)) {
if (s == "0") break;
int i = 0;
memset(hand, 0, sizeof(hand));
istringstream ss; ss.str(s);
while (ss >> hand[i++]);
cout << calc_point(&hand[0], i-1) << endl;
}
return 0;
}
|
#include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;
int main()
{
for(;;){
string s;
getline(cin, s);
if(s == "0")
return 0;
istringstream iss(s);
int ret = 0;
int num1 = 0;
for(;;){
int a;
if(!(iss >> a))
break;
if(a > 10)
a = 10;
if(a == 1){
++ num1;
a = 11;
}
ret += a;
while(ret > 21 && num1 > 0){
ret -= 10;
-- num1;
}
}
if(ret > 21)
ret = 0;
cout << ret << endl;
}
} |
#include<stdio.h>
#include<iostream>
using namespace std;
int main(){
char c;
int n,s=0;int A=0;
while(1){
while(1){
scanf("%d%c",&n,&c);
if(n>1&&n<11)s+=n;
else if(n>10)s+=10;
else if(n==1){s+=1;A++;}
if(c=='\n')break;
}
if(s==0)break;
if(s>=22)printf("0\n");
else {
if(A>0){
for(int i=0;i<A;i++)
if(s+10<=21)s+=10;
}
printf("%d\n",s);
}s=0;A=0;
}
return 0;
} |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#define lol(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
typedef long long ll;
using namespace std;
int main(){
string s;
while(getline(cin,s)&&s!="0"){
int ans=0,onecnt=0,cnt=0;
s.push_back(' ');
for(int i=0;i<s.size();i++){
if(s[i]==' '){
if(cnt==1)onecnt++;
if(cnt<10)ans+=cnt;
else ans+=10;
cnt=0;
}
else{
cnt*=10;
cnt+=s[i]-'0';
}
}
for(int i=0;i<onecnt;i++){
if(ans+10>21)break;
ans+=10;
}
if(ans>21)ans=0;
cout<<ans<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
while(1){
string s;
getline(cin, s);
if(s == "0") return 0;
int n = s.size();
int sum = 0;
int cnt1 = 0;
for(int i=0; i<n; i++){
string t = "";
while(i < n && '0' <= s[i] && s[i] <= '9'){
t += s[i];
i++;
}
int num = stoi(t);
if(10 <= num) sum += 10;
else if(1 < num) sum += num;
else{
cnt1++;
sum++;
}
}
vector<int> v;
v.emplace_back(sum);
for(int i=1; i<=cnt1; i++){
sum += 10;
v.emplace_back(sum);
}
sort(v.begin(), v.end(), greater<int>());
bool valid = false;
for(auto i : v){
if(21 >= i){
cout << i << endl;
valid = true;
break;
}
}
if(!valid){
cout << 0 << endl;
}
}
}
|
#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
#include <sstream>
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()
using namespace std;
int main()
{
string str = "";
while (getline (cin, str ) && str != "0" ){
stringstream ss (str );
vector <int> hand;
int n;
int ace = 0;
while (ss >> n ){
if (n == 1 )
ace++;
if (n > 10 )
n = 10;
hand.push_back (n );
} // end while
int sum = accumulate (ALL (hand ), 0 );
int res = 0;
if (ace == 0 && sum > 21 ){
res = 0;
}else if (ace == 0 && sum <= 21 ){
res = sum;
}else if (ace && sum > 21 ){
res = 0;
}else if (ace && sum == 21 ){
res = sum;
}else{
res = sum;
for (int i = 1; i <= ace; i++ ){
int curr = sum + 10*i;
if (curr <= 21 ){
res = max (res, curr );
} // end
} // end for
} // end if
cout << res << endl;
} // end loop
return 0;
} |
#include<iostream>
#include<math.h>
#include<vector>
#include<algorithm>
#include<cstdio>
#include <string>
#include <complex>
#include <functional>
using namespace std;
typedef pair<int,int> P;
int main(){
int n;
char c;
int ans,ace;
while(1){
ans = 0;
ace = 0;
while(1){
c = getchar();
if(c=='0')goto Loop;
if(c=='\n')break;
else if(c!=' '){
n = c-'0';
if(n==1){
c = getchar();
if(c=='\n'){
ans += 1;
ace = 1;
break;
}else if(c!=' '){
ans += 10;
}else{
ans += 1;
ace = 1;
}
}else{
ans += n;
}
}
}
if(ans<12 && ace)ans+=10;
if(ans>21)ans = 0;
cout << ans << endl;
}
Loop:return 0;
}
|
#include <iostream>
#include <sstream>
#include <vector>
#include <string>
using namespace std;
int main() {
string str;
vector<int> card;
while(getline(cin,str)) {
if(str == "0") break;
int score=0,ace=0;
stringstream ss;
int s;
ss << str;
while(ss >> s) {
card.push_back(s);
}
ss.str("");
ss.clear(stringstream::goodbit);
for(unsigned int i=0;i<card.size();i++) {
if(2 <= card[i] && card[i] <= 9) {
score += card[i];
}
else if(10 <= card[i] && card[i] <= 13) {
score += 10;
}
else { //card[i]==1
ace++;
}
}
if(score > 21) {
cout << 0 << endl;
card.clear();
continue;
}
while(ace>0) {
if(score + ace <= score + 11 + ace - 1 && score + 11 + ace - 1 <= 21) {
score += 11;
}
else {
score += 1;
}
ace--;
}
if(score > 21) {
cout << 0 << endl;
}
else cout << score << endl;
card.clear();
}
} |
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <cstring>
#include <deque>
#include <cstdio>
#include <cmath>
#include <complex>
#include <iostream>
#include <iterator>
using namespace std;
#define reep(i,f,t) for(int i=f ; i<int(t) ; ++i)
#define rep(i,n) reep(i, 0, n)
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
int main()
{
for(;;){
int sum = 0;
int ace = 0;
bool finish = false;
do{
int a;
scanf("%d", &a);
if(a == 0){
finish = true;
break;
}
if(a == 1)
++ace;
else
sum += min(a, 10);
}while(getchar() == ' ');
if(finish)
break;
int best = 0;
rep(i, ace+1){
int now = sum + i + (ace-i) * 11;
if(now > 21)
now = 0;
best = max(best, now);
}
printf("%d\n", best);
}
return 0;
} |
#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <cstdlib>
using namespace std;
int main(){
int i,j,n,ans,one;
string line;
while(1){
getline(cin,line);
if(line == "0") break;
stringstream sin(line);
string str;
ans = 0;
one = 0;
while(sin >> str){
n = atoi(str.c_str()) * 1;
if(n > 10) n = 10;
ans += n;
if(n == 1 && ans <= 11){
ans += 10;
one++;
}
if(ans > 21){
if(one > 0){
one--;
ans -= 10;
}
else{
ans = 0;
break;
}
}
}
cout << ans << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
int main() {
while (true) {
string str;
getline(cin, str);
int n = count(str.c_str(), str.c_str() + str.size(), ' ') + 1;
vector<int> card(n);
stringstream ss(str);
REP(i, n) ss >> card[i];
if (card[0] == 0) break;
sort(card.begin(), card.end());
int c = count(card.begin(), card.end(), 1);
int score = 0;
FOR(i, c, n) {
if (card[i] > 10) score += 10;
else score += card[i];
}
while (c--) {
if (score + 11 > 21)
score += 1;
else if (abs(21 - (score + 1)) > abs(21 - (score + 11))) {
if (score + 11 <= 21 - c)
score += 11;
else
score += 1;
}
else
score += 1;
}
if (score > 21) score = 0;
cout << score << endl;
}
return 0;
} |
#include<iostream>
#include<vector>
#include<string>
std::vector<int> split(std::string s, char delim){
if(s.length() == 0)return std::vector<int>{};
int prev = 0;
std::string t;
std::vector<int> res;
// std::cout << "len:" << s.length() << std::endl;
for (int i = 1; i < s.length(); i++) {
if(s[i] == delim) {
t = s.substr(prev, i - prev);
res.push_back(std::stoi(t));
prev = i;
}
}
if(prev != s.length() - 1){
t = s.substr(prev, s.length() - prev);
res.push_back(std::stoi(t));
}
return res;
}
int main(){
int n;
while(std::cin >> n, n){
if(n == 0)break;
std::string s;
std::getline(std::cin, s);
std::vector<int> cards = split(s, ' ');
cards.push_back(n);
int val = 0, num1 = 0;
// std::cout << "cards:" << std::endl;
// for (int i = 0; i < cards.size(); i++) {
// std::cout << cards[i] << std::endl;
// }
for (int i = 0; i < cards.size(); i++) {
val += std::min(cards[i], 10);
if(cards[i] == 1)num1++;
}
for (int i = 0; i < num1 and val <= 11; i++) val += 10;
if(val > 21)val = 0;
// std::cout << "val:" << val << std::endl;
std::cout << val << std::endl;
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string line;
while (getline(cin, line)){
if (line.size() == 1 && line[0] == '0') {
break;
}
int cards[11] = {};
while (line.empty() == false) {
size_t erase = 2;
if (line.size() == 1 || line[1] == ' ') {
cards[line[0] - '0']++;
} else {
cards[10]++;
erase = 3;
}
line.erase(0, erase);
}
int result = 0;
for (int i = 1; i < 11; i++) {
result += i * cards[i];
}
while (cards[1] > 0) {
if (result < 12) {
result += 10;
cards[1]--;
} else {
break;
}
}
if (result > 21) {
result = 0;
}
cout << result << endl;
}
} |
#include<stdio.h>
#include<iostream>
using namespace std;
int main(){
int n,c,m,sw;
char w;
while(1){
sw=0;
m=0;
c=0;
while(1){
scanf("%d%c",&n,&w);
if(n==0){
sw=1;
break;
}
if(n==1){
m+=1;
c+=11;
}
else if(n>10)c+=10;
else c+=n;
if(w=='\n')break;
}
if(sw==1)break;
while(m!=0){
if(c>21){
m--;
c-=10;
}
else break;
}
if(c<22)cout << c << endl;
else cout<< "0"<<endl;
}
return 0;
} |
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<deque>
#include<map>
#include<set>
#include<string>
#include<sstream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cctype>
#include<climits>
using namespace std;
#define REP(i, j) for(int i = 0; i < j; i++)
#define FOR(i, j, k) for(int i = j; i < k; i++)
#define P pair<int, int>
const int INF = INT_MAX / 2;
int one = 0;
vector<int> split(const string &str, char delim){
istringstream iss(str); string tmp; vector<int> res;
while(getline(iss, tmp, delim)){
int n = atoi(tmp.c_str());
if(n == 1) one++;
else{
if(n >= 10) n = 10;
res.push_back(n);
}
}
return res;
}
int main(){
string str;
while(getline(cin, str)){
one = 0;
int ans = 0;
if(str == "0") break;
vector<int> num = split(str, ' ');
REP(i, num.size()) ans += num[i];
int onenum = one * 11;
REP(i, one){
if(onenum + ans >= 22) onenum -= 10;
}
ans += onenum;
ans = (ans < 22)? ans : 0;
cout <<ans <<endl;
}
return 0;
} |
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define it ::iterator
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
const double ESP=1e-10;
using namespace std;
int main(){
string s;
while(getline(cin,s),s.size()!=1||s[0]!='0'){
vector<int>num;
rep(i,s.size()){
int tmp=0;
while(s[i]!=' '){
tmp*=10;
tmp+=s[i]-'0';
i++;
if(i==s.size())break;
}
if(tmp)num.pb(tmp);
}
//cout<<num[0]<<endl;
int sum=0;
int one=0;
rep(i,num.size()){
if(num[i]>10)num[i]=10;
if(num[i]==1)one++;
sum+=num[i];
}
rep(i,one){
if(sum+10<=21)sum+=10;
}
if(sum>21)sum=0;
cout<<sum<<endl;
}
} |
#define _USE_MATH_DEFINES
#define MAX_N 1000000
#include <iostream>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
static const double eps = 1e-8;
vector<int> split(string delim,string str){
vector<int> res;
str += delim;
for(int i=0;i<str.size();i++){
for(int j=1;i+j<=str.size();j++){
if(str.substr(i,j).find(delim) != string::npos){
int num = atoi(str.substr(i,j-1).c_str());
if(str.substr(i,j-1).size() >0 ) res.push_back(num);
i+=j-1;
break;
}
}
}
return res;
}
int main(){
string str;
while(getline(cin,str)){
vector<int> data = split(" ",str);
if(data.size()==1 && data[0]==0) break;
set<int>* dp = new set<int>[data.size()+1];
dp[0].insert(0);
for(int i=0;i<data.size();i++){
if(data[i] == 1){
for(set<int>::iterator it = dp[i].begin(); it != dp[i].end(); it++){
dp[i+1].insert(*it+1);
dp[i+1].insert(*it+11);
}
}
else if(2 <= data[i] && data[i] <= 9){
for(set<int>::iterator it = dp[i].begin(); it != dp[i].end(); it++){
dp[i+1].insert(*it+data[i]);
}
}
else{
for(set<int>::iterator it = dp[i].begin(); it != dp[i].end(); it++){
dp[i+1].insert(*it+10);
}
}
}
int res=MAX_N;
for(set<int>::iterator it = dp[data.size()].begin(); it != dp[data.size()].end(); it++){
if(*it <= 21 && abs(*it-21) < abs(res-21)){
res = * it;
}
}
printf("%d\n",res == MAX_N ? 0 : res);
}
} |
#include <iostream>
#include <string>
#include <cstdio>
#include <cstdlib>
using namespace std;
typedef long long ll;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl;
int main()
{
string s, t;
int sum, ones;
while(getline(cin, s) && s != "0") {
s += " ";
t = "";
sum = ones = 0;
for(int i = 0; i < s.size(); i++) {
if(s[i] == ' ') {
if(atoi(t.c_str()) == 1) {
ones++;
} else {
if(atoi(t.c_str()) < 10) {
sum += atoi(t.c_str());
} else {
sum += 10;
}
}
t.clear();
} else {
t += s[i];
}
}
sum += ones * 11;
for(; ones-- && sum > 21;)
sum -= 10;
printf("%d\n", (sum > 21 ? 0 : sum));
}
} |
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
using namespace std;
int main() {
string s;
while (getline(cin, s), s != "0") {
stringstream ss(s);
int n, sum = 0, one = 0;
while (ss >> n) {
sum += (10 <= n ? 10 : n);
if (n == 1) ++ one;
}
int res = 0;
for (int i=0; i<=one; ++i) {
if (21 < sum + 10 * i) break;
res = max(res, sum + 10 * i);
}
cout << res << endl;
}
return 0;
} |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int ans;
vector<int> split(string s){
int n=0;
vector<int> vc;
for(int i=0 ; i < s.size() ; i++ ){
char c = s[i];
if( c == ' ' ){
vc.push_back( n );
n = 0;
}else if( c >= '0' && c <= '9' ){
n *= 10;
n += c - '0';
if( i == s.size()-1 )
vc.push_back( n );
}
}
return vc;
}
void solve(const vector<int>& a,int i,int p){
if( p > 21 ){
return;
}
if( i == a.size() ){
ans = max( ans , p );
return;
}
if( a[i] == 1 ){
solve( a , i+1 , p+1 );
solve( a , i+1 , p+11 );
}else if( a[i] >= 10 ){
solve( a , i+1 , p+10 );
}else{
solve( a , i+1 , p+a[i] );
}
}
int main(){
string s;
while( getline(cin,s) ){
vector<int> a = split(s);
if( a.size() == 1 && a[0] == 0 ) break;
ans = 0;
solve( a , 0 , 0 );
cout << ans << endl;
}
} |
#include <iostream>
#include <sstream>
using namespace std;
int main()
{
string str;
while(getline(cin, str)){
if(str[0] == '0')
break;
stringstream sst;
sst << str;
int a;
int sum = 0;
int onecount = 0;
while(sst >> a){
if(a == 1){
sum += 1;
onecount++;
}
else if(a > 10){
sum += 10;
}else{
sum += a;
}
}
if(sum > 21)
sum = 0;
else{
while(true){
if(sum+10 <= 21 && onecount!=0){
sum += 10;
onecount--;
}
else
break;
}
}
cout << sum << endl;
}
return 0;
} |
#include <iostream>
#include <string>
#include <sstream>
using namespace std;
int main()
{
string hands;
while( getline( cin, hands ) ){
if( hands == "0" ) break;
stringstream ss( hands );
int ans = 0;
int ex = 0;
while( !ss.eof() ){
int p;
ss >> p;
if( p > 10 ){
p = 10;
}
if( p == 1 ){
++ex;
}
ans += p;
}
while( ex > 0 ){
if( 21 - ans >= 10 ){
ans += 10;
}
--ex;
}
cout << ( ans > 21 ? 0 : ans ) << endl;
}
} |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cmath>
#include <queue>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define INF 1<<30
int score(int s) {
if (s>21) return 0;
else return s;
}
int main() {
string s;
while(getline(cin, s)) {
//cout << s << endl;
stringstream ss(s);
int a;
int sum = 0;
int num1 = 0;
while(ss >> a) {
if (a > 10)
a = 10;
sum += a;
if (a == 1)
num1++;
}
if (a == 0) break;
int ans = 0;
REP(i,num1+1) {
ans = max(ans, score(sum + i*10));
}
cout << ans << endl;
}
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
while(1) {
int card = 0;
int save = 0;
for(;;) {
int add; scanf("%d", &add); if(!add) return 0;
if(add == 1) {
save ++;
}
else if(10 <= add && add <= 13) card += 10;
else card += add;
char ch; scanf("%c", &ch);
if(ch=='\n') break;
}
card += save;
if(card > 21) {
card = 0;
}
else {
for(int i=0; i<save; i++) {
if(card+10 <= 21) card += 10;
else break;
}
}
if(card > 21) card = 0;
cout << card << endl;
}
return 0;
} |
#include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
int main() {
string s;
while (getline(cin, s), s != "0") {
stringstream ss(s);
int cnt = 0;
int n;
bool is_1 = false;
while (ss >> n) {
if (n == 1)is_1 = true;
if (n < 10)cnt += n;
else cnt += 10;
}
if (is_1&&cnt + 10 <= 21)cnt += 10;
cout << (cnt > 21 ? 0 : cnt) << endl;
}
} |
#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
const ld eps = 1e-9;
struct sentence {
int type;
int a;
int b;
int c;
};
map<int, int>line_mp;
map<string, int>name_mp;
bool memo[51][(1 << 20)];
int getid(vector<int>&v) {
int sum = 0;
for (int i = 0; i < v.size(); ++i) {
sum *= 16;
sum+= v[i];
}
assert(sum < (1 << 20));
return sum;
}
int getnum(const string name_st) {
static int k = 0;
if (name_mp.find(name_st) == name_mp.end()) {
name_mp[name_st] = k++;
}
return name_mp[name_st];
}
int ansl;
vector<int>ansv;
void solve(const vector<sentence>&sents,int line, vector<int>&v) {
if (memo[line][getid(v)] == 1) {
ansl = -3;
throw(false);
}
else {
memo[line][getid(v)] = 1;
auto sent(sents[line]);
int type = sent.type;
int calc;
int nextline = -1;
if (type <= 5) {
switch (type) {
case 0:
calc = v[sent.b] + v[sent.c];
break;
case 1:
calc = v[sent.b] + sent.c;
break;
case 2:
calc = v[sent.b] - v[sent.c];
break;
case 3:
calc = v[sent.b] - sent.c;
break;
case 4:
calc = v[sent.b];
break;
case 5:
calc = sent.b;
break;
}
if (calc < 0 || calc >= 16) {
ansl = line;
ansv = v;
throw(false);
}
else {
v[sent.a] = calc;
}
nextline = line + 1;
}
else {
switch (type) {
case 6:
if (v[sent.a] == 0) {
nextline = line + 1;
}
else {
nextline = sent.b;
}
break;
case 7:
ansl = line;
ansv = v;
throw(false);
break;
}
}
if (nextline == -1||nextline>=sents.size()) {
ansl = line;
ansv = v;
throw(false);
}
solve(sents, nextline, v);
}
}
int main() {
for (int i = 0; i < 51; ++i) {
for (int j = 0; j < (1 << 20); ++j) {
memo[i][j] =false;
}
}
int N; cin >> N;
vector <sentence>aas;
{
for (int i = 0; i < N; ++i) {
int l; cin >> l;
line_mp[l] = i;
string st; cin >> st;
if (st == "ADD" || st == "SUB") {
string a, b, c; cin >> a >> b >> c;
if (isdigit(c[0])) {
int anum(getnum(a));
int bnum(getnum(b));
aas.push_back(sentence{ (st == "SUB") * 2 + 1,anum,bnum,stoi(c) });
}
else {
int anum(getnum(a));
int bnum(getnum(b));
int cnum(getnum(c));
aas.push_back(sentence{ (st == "SUB") * 2,anum,bnum,cnum });
}
}
else if (st == "SET") {
string a, b; cin >> a >> b;
if (isdigit(b[0])) {
int anum(getnum(a));
aas.push_back(sentence{ 5,anum,stoi(b),-1 });
}
else {
int anum(getnum(a));
int bnum(getnum(b));
aas.push_back(sentence{ 4,anum,bnum,-1 });
}
}
else if (st == "IF") {
string a; int bnum; cin >> a >> bnum;
int anum(getnum(a));
aas.push_back(sentence{ 6,anum,bnum,-1 });
}
else {
assert(st == "HALT");
aas.push_back(sentence{ 7,-1,-1,-1 });
}
}
for (auto& a : aas) {
if (a.type == 6) {
if (line_mp.find(a.b) == line_mp.end()) {
a.b = -1;
}
else {
a.b = line_mp[a.b];
}
}
}
}
try {
vector<int>v(5,0);
solve(aas, 0, v);
}
catch (...) {
if (ansl == -3)cout << "inf" << endl;
else {
vector<pair<string, int>>vars;
for (auto nm:name_mp) {
vars.push_back(make_pair(nm.first, ansv[nm.second]));
}
sort(vars.begin(),vars.end());
for(auto var:vars){
cout << var.first << "=" << var.second << endl;
}
}
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int num_id[500];
char num_rev[6];
int num_cnt = 0;
int num[6]={};
string info[52],var[52][3];
int line[52],dest[52],con[52];
int id_cnt[1002]={};
int id_rev[52]={};
int n;
priority_queue<pair<char,int> >pq;
// N,num1,num2,num3,num4,num5
int dp[52][16][16][16][16][16] = {};
int die = 0;
int main(){
for(int i=0;i<500;i++)num_id[i]=-1;
cin>>n;
for(int i=0;i<n;i++){
cin>>line[i];
id_cnt[line[i]]=1;id_rev[line[i]]=i;
cin>>info[i];
if(info[i] == "ADD" || info[i] == "SUB"){
cin>>var[i][0]>>var[i][1]>>var[i][2];
if(num_id[var[i][0][0]]==-1){
num_id[var[i][0][0]] = num_cnt;num_rev[num_cnt]=var[i][0][0];num_cnt++;
}
if(num_id[var[i][1][0]]==-1){
num_id[var[i][1][0]] = num_cnt;num_rev[num_cnt]=var[i][1][0];num_cnt++;
}
if('a' <= var[i][2][0] && var[i][2][0] <= 'z'){
if(num_id[var[i][2][0]]==-1){
num_id[var[i][2][0]] = num_cnt;num_rev[num_cnt]=var[i][2][0];num_cnt++;
}
}
}
if(info[i] == "SET"){
cin>>var[i][0]>>var[i][1];
if(num_id[var[i][0][0]]==-1){
num_id[var[i][0][0]] = num_cnt;num_rev[num_cnt]=var[i][0][0];num_cnt++;
}
if('a' <= var[i][1][0] && var[i][1][0] <= 'z'){
if(num_id[var[i][1][0]]==-1){
num_id[var[i][1][0]] = num_cnt;num_rev[num_cnt]=var[i][1][0];num_cnt++;
}
}
}
if(info[i] == "IF"){
cin>>var[i][0]>>dest[i];
if(num_id[var[i][0][0]]==-1){
num_id[var[i][0][0]] = num_cnt;num_rev[num_cnt]=var[i][0][0];num_cnt++;
}
}
}
int now_line=0;
int temp,tt,hoge;
while(now_line<n){
if(dp[now_line][num[0]][num[1]][num[2]][num[3]][num[4]] == 1){
die = 1;break;
}
dp[now_line][num[0]][num[1]][num[2]][num[3]][num[4]] = 1;
if(info[now_line] == "ADD"){
temp = num[num_id[var[now_line][1][0]]];
tt = 0;
if('a' <= var[now_line][2][0] && var[now_line][2][0] <= 'z'){
tt = num[num_id[var[now_line][2][0]]];
}
else{
hoge = 0;
while('0' <= var[now_line][2][hoge] && var[now_line][2][hoge] <= '9'){
tt*=10;tt+=var[now_line][2][hoge] - '0';
hoge++;
}
}
temp += tt;
if(temp<0 || 15<temp)break;
num[num_id[var[now_line][0][0]]] = temp;
now_line++;
}
else if(info[now_line] == "SUB"){
temp = num[num_id[var[now_line][1][0]]];
tt = 0;
if('a' <= var[now_line][2][0] && var[now_line][2][0] <= 'z'){
tt = num[num_id[var[now_line][2][0]]];
}
else{
hoge = 0;
while('0' <= var[now_line][2][hoge] && var[now_line][2][hoge] <= '9'){
tt*=10;tt+=var[now_line][2][hoge] - '0';
hoge++;
}
}
temp -= tt;
if(temp<0 || 15<temp)break;
num[num_id[var[now_line][0][0]]] = temp;
now_line++;
}
else if(info[now_line] == "SET"){
temp=0;
if('a' <= var[now_line][1][0] && var[now_line][1][0] <= 'z'){
temp = num[num_id[var[now_line][1][0]]];
}
else{
hoge = 0;
while('0' <= var[now_line][1][hoge] && var[now_line][1][hoge] <= '9'){
temp*=10;temp+=var[now_line][1][hoge] - '0';
hoge++;
}
}
if(temp<0 || 15<temp)break;
num[num_id[var[now_line][0][0]]] = temp;
now_line++;
}
else if(info[now_line] == "IF"){
temp = num[num_id[var[now_line][0][0]]];
if(temp!=0){
if(!id_cnt[dest[now_line]])break;
now_line = id_rev[dest[now_line]];
}
else{
now_line++;
}
}
else if(info[now_line] == "HALT")break;
}
if(die)cout<<"inf"<<endl;
else{
for(int i=0;i<num_cnt;i++){
pq.push(make_pair(num_rev[i],num[i]));
}
int ans[10];char ans_c[10];
for(int i=num_cnt-1;i>=0;i--){
pair<char,int>f = pq.top();pq.pop();
ans_c[i] = f.first;ans[i] = f.second;
}
for(int i=0;i<num_cnt;i++){
cout<<ans_c[i]<<"="<<ans[i]<<endl;
}
}
return(0);
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int64;
map< string, int > ff;
void stop()
{
int ret = 0;
for(auto &c : ff) {
if(isalpha(c.first[0])) {
++ret;
printf("%c=%d\n", c.first[0], c.second);
}
}
exit(0);
}
int main()
{
int N;
int convert[1001];
char buff[64], type[50][5], var1[50][5], var2[50][5], var3[50][5];
memset(convert, -1, sizeof(convert));
fgets(buff, sizeof(buff), stdin);
sscanf(buff, "%d", &N);
for(int i = 0; i < N; i++) {
int line;
fgets(buff, sizeof(buff), stdin);
sscanf(buff, "%d %s %s %s %s", &line, type[i], var1[i], var2[i], var3[i]);
convert[line] = i;
ff[var1[i]];
ff[var2[i]];
ff[var3[i]];
}
for(int i = 0; i < 16; i++) ff[to_string(i)] = i;
int i = 0;
for(int c = 0; c < 30000000; c++) {
if(type[i][0] == 'H') stop();
int val;
bool set = true;
if(type[i][0] == 'A') {
val = ff[var2[i]] + ff[var3[i]];
} else if(type[i][1] == 'U') {
val = ff[var2[i]] - ff[var3[i]];
} else if(type[i][1] == 'E') {
val = ff[var2[i]];
} else {
set = false;
}
if(set && (val < 0 || val >= 16)) stop();
if(set) ff[var1[i]] = val;
if(type[i][0] == 'I' && ff[var1[i]] != 0) {
i = convert[stoi(var2[i])];
} else {
i++;
}
if(i < 0 || i >= N) stop();
}
puts("inf");
} |
#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <cfloat>
#include <stack>
#include <queue>
#include <vector>
#include <string>
#include <iostream>
#include <set>
#include <map>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
enum ORDER{
ADD,
SUB,
SET,
IF,
HALT,
};
struct Info{
ORDER order;
char var1,var2,var3;
int con;
};
int current_var[26];
int line[50],rev_line[1001];
Info info[50];
bool check[50][16][16][16][16][16];
char table[50][51];
int main(){
for(int a = 0; a < 50; a++){
for(int b = 0; b < 16; b++){
for(int c = 0; c < 16; c++){
for(int d = 0; d < 16; d++){
for(int e = 0; e < 16; e++){
for(int f = 0; f < 16; f++){
check[a][b][c][d][e][f] = false;
}
}
}
}
}
}
for(int i = 0; i <= 1000; i++)rev_line[i] = -1;
for(int i = 0; i < 26; i++)current_var[i] = -1;
int N;
scanf("%d",&N);
getchar();
int tmp,index;
for(int i = 0; i < N; i++){
fgets(table[i],50,stdin);
tmp = 0;
for(index = 0; table[i][index] != ' '; index++){
tmp = 10*tmp+table[i][index]-'0';
}
line[i] = tmp;
rev_line[tmp] = i;
index++;
switch(table[i][index]){
case 'A': //ADD
info[i].order = ADD;
index += 4;
info[i].var1 = table[i][index];
current_var[info[i].var1-'a'] = 0;
index += 2;
info[i].var2 = table[i][index];
current_var[info[i].var2-'a'] = 0;
index += 2;
if(table[i][index] >= 'a' && table[i][index] <= 'z'){
info[i].var3 = table[i][index];
current_var[info[i].var3-'a'] = 0;
}else{
tmp = 0;
for(;table[i][index] >= '0' && table[i][index] <= '9';index++){
tmp = 10*tmp + table[i][index]-'0';
}
info[i].var3 = '@';
info[i].con = tmp;
}
break;
case 'S':
if(table[i][index+1] == 'U'){
info[i].order = SUB;
index += 4;
info[i].var1 = table[i][index];
current_var[info[i].var1-'a'] = 0;
index += 2;
info[i].var2 = table[i][index];
current_var[info[i].var2-'a'] = 0;
index += 2;
if(table[i][index] >= 'a' && table[i][index] <= 'z'){
info[i].var3 = table[i][index];
current_var[info[i].var3-'a'] = 0;
}else{
tmp = 0;
for(;table[i][index] >= '0' && table[i][index] <= '9';index++){
tmp = 10*tmp + table[i][index]-'0';
}
info[i].var3 = '@';
info[i].con = tmp;
}
}else{
info[i].order = SET;
index += 4;
info[i].var1 = table[i][index];
current_var[info[i].var1-'a'] = 0;
index += 2;
if(table[i][index] >= 'a' && table[i][index] <= 'z'){
info[i].var2 = table[i][index];
current_var[info[i].var2-'a'] = 0;
}else{
tmp = 0;
for(;table[i][index] >= '0' && table[i][index] <= '9';index++){
tmp = 10*tmp + table[i][index]-'0';
}
info[i].var2 = '@';
info[i].con = tmp;
}
}
break;
case 'I':
info[i].order = IF;
index += 3;
info[i].var1 = table[i][index];
current_var[info[i].var1-'a'] = 0;
index += 2;
tmp = 0;
for( ;table[i][index] >= '0' && table[i][index] <= '9'; index++){
tmp = 10*tmp+table[i][index]-'0';
}
info[i].con = tmp;
break;
case 'H':
info[i].order = HALT;
break;
}
}
int array[5];
int var_num = 0;
for(int i = 0; i < 26; i++){
if(current_var[i] == 0){
array[var_num] = i;
var_num++;
}
}
bool LOOP_FLG = false,HALT_FLG = false;
int line = 0;
int tmp_1,tmp_2;
int num[5];
while(true){
switch(info[line].order){
case ADD:
tmp_1 = current_var[info[line].var2-'a'];
if(info[line].var3 == '@'){
tmp_2 = info[line].con;
}else{
tmp_2 = current_var[info[line].var3-'a'];
}
if(tmp_1+tmp_2 >= 16){
HALT_FLG = true;
}else{
current_var[info[line].var1-'a'] = tmp_1+tmp_2;
}
line++;
break;
case SUB:
tmp_1 = current_var[info[line].var2-'a'];
if(info[line].var3 == '@'){
tmp_2 = info[line].con;
}else{
tmp_2 = current_var[info[line].var3-'a'];
}
if(tmp_1-tmp_2 < 0){
HALT_FLG = true;
}else{
current_var[info[line].var1-'a'] = tmp_1-tmp_2;
}
line++;
break;
case SET:
if(info[line].var2 == '@'){
tmp_1 = info[line].con;
}else{
tmp_1 = current_var[info[line].var2-'a'];
}
current_var[info[line].var1-'a'] = tmp_1;
line++;
break;
case IF:
if(current_var[info[line].var1-'a'] == 0){
line++;
}else{
if(rev_line[info[line].con] == -1){
HALT_FLG = true;
}else{
for(int i = 0; i < 5; i++)num[i] = 0;
for(int i = 0; i < var_num; i++){
num[i] = current_var[array[i]];
}
if(check[line][num[0]][num[1]][num[2]][num[3]][num[4]]){
LOOP_FLG = true;
break;
}else{
check[line][num[0]][num[1]][num[2]][num[3]][num[4]] = true;
}
line = rev_line[info[line].con];
}
}
break;
case HALT:
HALT_FLG = true;
break;
}
if(LOOP_FLG == true || line == N || HALT_FLG == true)break;
}
if(LOOP_FLG){
printf("inf\n");
}else{
for(int i = 0; i < 26; i++){
if(current_var[i] != -1){
printf("%c=%d\n",'a'+i,current_var[i]);
}
}
}
return 0;
} |
#include <iostream>
#include <chrono>
#include <string>
#include <map>
using namespace std;
using ll = long long;
struct Line {
string op;
string v1, v2, v3;
Line () {};
Line (string &op, string &v1, string &v2, string &v3):
op(op), v1(v1), v2(v2), v3(v3) {};
};
int n;
map<string, int> var;
Line program[1005];
int i2n[1005];
int main() {
for (int i = 0; i < 1005; i++) {
i2n[i] = -1;
}
cin >> n;
for (int i = 0; i < n; i++) {
int l;
string op;
string v1, v2, v3;
cin >> l >> op;
if (op == "ADD" || op == "SUB") {
cin >> v1 >> v2 >> v3;
if ('a' <= v1[0] && v1[0] <= 'z') {
var[v1] = 0;
}
if ('a' <= v2[0] && v2[0] <= 'z') {
var[v2] = 0;
}
if ('a' <= v3[0] && v3[0] <= 'z') {
var[v3] = 0;
}
}
if (op == "SET" || op == "IF") {
cin >> v1 >> v2;
if ('a' <= v1[0] && v1[0] <= 'z') {
var[v1] = 0;
}
if ('a' <= v2[0] && v2[0] <= 'z') {
var[v2] = 0;
}
}
Line v(op, v1, v2, v3);
program[i] = v;
i2n[l] = i;
}
int pc = 0;
auto start = chrono::system_clock::now();
auto end = chrono::system_clock::now();
double elapsed = chrono::duration_cast<std::chrono::milliseconds>(end-start).count();
while (elapsed <= 4500.0) {
if (pc < 0 || pc >= n ||
program[pc].op.empty()) {
for (auto &x:var) {
cout << x.first << '=' << x.second << endl;
}
return 0;
}
Line p = program[pc]; pc++;
bool over_flow = false;
if (p.op == "ADD") {
if ('a' <= p.v3[0] && p.v3[0] <= 'z') {
if (var[p.v2] + var[p.v3] >= 16) over_flow = true;
else var[p.v1] = var[p.v2] + var[p.v3];
}
else {
if (var[p.v2] + stoi(p.v3) >= 16) over_flow = true;
else var[p.v1] = var[p.v2] + stoi(p.v3);
}
}
if (p.op == "SUB") {
if ('a' <= p.v3[0] && p.v3[0] <= 'z') {
if (var[p.v2] - var[p.v3] < 0) over_flow = true;
else var[p.v1] = var[p.v2] - var[p.v3];
}
else {
if (var[p.v2] - stoi(p.v3) < 0) over_flow = true;
else var[p.v1] = var[p.v2] - stoi(p.v3);
}
}
if (p.op == "SET") {
if ('a' <= p.v2[0] && p.v2[0] <= 'z') {
var[p.v1] = var[p.v2];
}
else {
int v = stoi(p.v2);
if (v >= 0 && v < 16) {
var[p.v1] = v;
}
else {
over_flow = true;
}
}
}
if (p.op == "IF") {
if (var[p.v1]) {
pc = i2n[stoi(p.v2)];
}
}
if (p.op == "HALT" ||
over_flow) {
for (auto &x:var) {
cout << x.first << '=' << x.second << endl;
}
return 0;
}
end = chrono::system_clock::now();
elapsed = chrono::duration_cast<std::chrono::milliseconds>(end-start).count();
}
cout << "inf" << endl;
return 0;
}
|
#include <cstdio>
#include <cctype>
#include <map>
#include <vector>
#include <string>
#include <set>
struct directive {
char type;
std::string dst, src1, src2;
size_t dline;
directive() = default;
directive(std::string const&, std::string const& dst, std::string const& src):
type('='), dst(dst), src1(src) {}
directive(std::string const& dir, std::string const& dst, std::string const& src1, std::string const& src2):
type((dir[0] == 'A')? '+':'-'), dst(dst), src1(src1), src2(src2) {}
directive(std::string const&, std::string const& cond, size_t dline): type('?'), src1(cond), dline(dline) {}
directive(std::string const&): type('q') {}
size_t operator ()(std::map<size_t, size_t>& nl, std::map<char, int>& var, size_t i) {
++i;
if (type == '+') {
int tmp = var[src1[0]] + (isdigit(src2[0])? std::stoi(src2):var[src2[0]]);
if (!(0 <= tmp && tmp < 16)) throw 1;
var[dst[0]] = tmp;
} else if (type == '-') {
int tmp = var[src1[0]] - (isdigit(src2[0])? std::stoi(src2):var[src2[0]]);
if (!(0 <= tmp && tmp < 16)) throw 1;
var[dst[0]] = tmp;
} else if (type == '=') {
int tmp = (isdigit(src1[0])? std::stoi(src1):var[src1[0]]);
if (!(0 <= tmp && tmp < 16)) throw 1;
var[dst[0]] = tmp;
} else if (type == '?') {
if (var[src1[0]]) {
auto it = nl.find(dline);
if (it == nl.end()) throw 2;
i = it->second;
}
} else if (type == 'q') {
throw 0;
}
return i;
}
};
int encode(std::map<char, int> const& map) {
int res = 0;
for (auto const& p: map)
res = (res << 4) | p.second;
return res;
}
int main() {
size_t n;
scanf("%zu", &n);
std::vector<directive> prog;
std::map<size_t, size_t> nl;
std::map<char, int> var;
for (size_t i = 0; i < n; ++i) {
size_t line;
scanf("%zu", &line);
nl[line] = i;
char buf[16];
scanf("%s", buf);
std::string s = buf;
if (s == "SET") {
scanf("%s", buf);
std::string dst = buf;
scanf("%s", buf);
std::string src = buf;
var[dst[0]];
if (isalpha(src[0])) var[src[0]];
prog.emplace_back("SET", dst, src);
} else if (s == "ADD" || s == "SUB") {
scanf("%s", buf);
std::string dst = buf;
scanf("%s", buf);
std::string src1 = buf;
scanf("%s", buf);
std::string src2 = buf;
var[dst[0]];
var[src1[0]];
if (isalpha(src2[0])) var[src2[0]];
prog.emplace_back(s, dst, src1, src2);
} else if (s == "IF") {
scanf("%s", buf);
std::string cond = buf;
size_t dst;
scanf("%zu", &dst);
var[cond[0]];
prog.emplace_back("IF", cond, dst);
} else if (s == "HALT") {
prog.emplace_back("HALT");
}
}
size_t i = 0;
std::vector<bool> tsurai(50*16*16*16*16*16);
tsurai[encode(var)*50+i] = true;
while (i < n) {
try {
size_t j = prog[i](nl, var, i);
i = j;
} catch (int e) {
break;
}
int e = encode(var);
if (tsurai[e*50+i]) return puts("inf"), 0;
tsurai[e*50+i] = true;
}
for (auto const& p: var)
printf("%c=%d\n", p.first, p.second);
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.