text
stringlengths 49
983k
|
|---|
#include<bits/stdc++.h>
using namespace std;
#define lp(i,n) for(int i=0;i<n;i++)
int main(){
while(1){
int n;
cin>>n;
if(n==0) break;
int a[50];
string memo;
lp(i,n){
cin>>memo;
a[i]=memo.size();
}
lp(i,n){
int ans=0;
int count=0,stats=0;
for(int j=i;j<n;j++){
if(stats==0||stats==2){
count+=a[j];
if(count==5){
stats++;
count=0;
}
if(count>5) break;
}
else if(stats==1||stats==3||stats==4){
count+=a[j];
if(count==7){
stats++;
count=0;
}
if(count>7) break;
}
if(stats==5) {
ans=1;
break;
}
}
if(ans==1) {
cout<<i+1<<endl;
break;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
string str[41];
int k;
int n;
bool check(int p, int c)
{
int cnt =0;
for(int i=p;i<n;i++){
cnt += str[i].length();
k++;
if(cnt == c) return true;
else if(cnt > c)return false;
}
return false;
}
int main(){
while(cin>>n, n){
rep(i,n) cin >> str[i];
rep(i,n){
k = i;
if(check(k,5) && check(k,7) && check(k,5) && check(k,7) && check(k,7)) {
cout << i+1 << endl;
break;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
auto c = vector<int>(n);
for (int i = 0; i < n; ++i) {
string w; cin >> w;
c[i] = w.length();
}
auto solve = [&]() {
for (int i = 0; i < n; ++i) {
auto sum = vector<int>{5, 7, 5, 7, 7};
int pos = 0;
for (int j = i; j < n; ++j) {
if (sum[pos] == 0) ++pos;
if (pos == 5) return i + 1;
if (sum[pos] > 0) sum[pos] -= c[j];
}
if (sum[pos] == 0 && pos + 1 == 5) return i + 1;
}
return 0;
};
cout << solve() << endl;
}
return 0;
}
|
#include<iostream>
#include<string>
using namespace std;
int main() {
int n;
const int sp[] = { 5,7,5,7,7 };
while (cin >> n, n){
int a[41];
for (int i = 0; i < n; i++) {
string s; cin >> s;
a[i] = s.size();
}
for (int i = 0; i < n; i++) {
int cnt = 0, k = 0;
for (int j = 0;; j++) {
cnt += a[i + j];
if (cnt == sp[k]) {
k++;
if (k == 5) {
cout << i + 1 << endl;
goto end;
}
cnt = 0;
}
else if (cnt > sp[k])break;
}
}
end:;
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define inf 1e9
#define ll long long
#define ull unsigned long long
#define M 1000000007
#define P pair<int,int>
#define PLL pair<ll,ll>
#define FOR(i,m,n) for(int i=m;i<n;i++)
#define RFOR(i,m,n) for(int i=m;i>=n;i--)
#define rep(i,n) FOR(i,0,n)
#define rrep(i,n) RFOR(i,n,0)
#define all(a) a.begin(),a.end()
const int vx[4] = {0,1,0,-1};
const int vy[4] = {1,0,-1,0};
#define PI 3.14159265
void f(int n){
string s[100];
int a[7]={5,7,5,7,7};
rep(i,n){
cin>>s[i];
}
rep(i,n){
int p=0;
int m=0;
FOR(j,i,n){
m += (int)s[j].length();
if(m==a[p]){
m=0;
p++;
}
}
if(p==5){
cout<<i+1<<endl;
break;
}
}
}
int main(){
int n;
while(1){
cin>>n;
if(n==0) break;
f(n);
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int f[]={5,7,5,7,7};
int n;
int t[50];
string str;
int solve(){
for(int i=0;i<n;i++){
int a=i,j;
for(j=0;j<5;j++){
int b=0;
while(b<f[j])b+=t[a++];
if(b>f[j])break;
}
if(j==5)return i;
}
return 0;
}
int main(){
while(1){
cin>>n;
if(n==0)break;
for(int i=0;i<n;i++){
cin>>str;
t[i]=str.size();
}
cout<<solve()+1<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> v;
int d[5] = {5 ,7, 5, 7, 7};
int main(){
while(1){//start
int n;
cin >> n;
if(n == 0) break;
for(int i = 0; i < n; i++){
string s;
cin >> s;
v.push_back((int)s.size());
}
//debug
//for(int i = 0; i < n; i++) cout << v[i] << endl;
int ans = 0;
for(int i = 0; i < n - 1; i++){
int len = 0;
int tmp = 0;
int next = 0;
for(int j = i; j < n; j++){
len += v[j];
tmp += v[j];
if(next == 4 and len == 31){
ans = i + 1;
goto end;
}
else if(d[next] == tmp){
//cout << tmp << endl;
tmp = 0;
next++;
}
}
//cout << endl;
}
end:
cout << ans << endl;
v.clear();
}//end
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb push_back
#define INF (1e9+1)
//#define INF (1LL<<59)
int main(){
int n;
while(cin>>n&&n){
vector<int> v(n);
rep(i,n){
string s;
cin>>s;
v[i] = s.size();
}
rep(i,n){
int now;
int pos = i;
int p[]={5,7,5,7,7};
rep(j,5){
now=0;
while(now<p[j]){
now+=v[pos++];
if(now==p[j])break;
if(now>p[j])goto next;
}
}
cout<<i+1<<endl;
break;
next:;
}
}
}
|
#include<iostream>
#include<string>
using namespace std;
int main(){
while(true){
int n;
cin >> n;
if(n==0) break;
int len[n];
for(int i=0; i<n; i++){
string w;
cin >> w;
len[i] = w.size();
}
for(int i=0; i<n; i++){
bool flag = false;
int sta = 0; //区切り
int sum = 0; //文字数の合計
for(int j=i; j<n; j++){
sum = sum + len[j];
if(sum==5 || sum==12 || sum==17 || sum==24 || sum==31){
sta++;
}
if(sta==5){
flag = true;
break;
}else if(sum>=31){
break;
}
}
if(flag){
cout << i+1 << endl;
break;
}
}
}
return 0;
}
|
#include<bits/stdc++.h>
int i,j,d[50],p,n,q,a[5]={5,7,5,7,7};
char s[15];
int main(){
for(;;){
scanf("%d",&n);
if(n==0)break;
for(i=0;i<n;i++){
scanf("%s",s);
d[i]=strlen(s);
}
for(i=0;i<n;i++){
p=i;
for(j=0;j<5;j++){
q=a[j];
while(q>0){
q-=d[p];p++;
}
if(q<0){
p=-1; break;
}
}
if(p>=0){
printf("%d\n",i+1);
break;
}
}
}
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,a,b) for(int i=a;i<=b;i++)
using namespace std;
int main(){
while(1){
int n;
cin>>n;
if(!n)break;
string w[n];
rep(i,n)cin>>w[i];
int a[]={5,7,5,7,7};
int c,s;
rep(i,n){
c=s=0;
REP(j,i,n){
s+=w[j].length();
if(s>a[c])break;
if(s==a[c]){
s=0;
c++;
}
if(c==5){
cout<<i+1<<endl;
goto END;
}
}
}
END:;
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main (){
int n;
while(cin>>n && n){
vector<int> v(n);
for(int i=0;i<n;i++){
string s;
cin>>s;
v[i]=s.size();
}
for(int i=0;i<n;i++){
int count=0;
int j=i;
vector<bool> ok(5,false);
while(j<=n-1){
count+=v[j];
j++;
if(count==5)ok[0]=true;
if(ok[0] && count==12)ok[1]=true;
if(ok[1] && count==17)ok[2]=true;
if(ok[2] && count==24)ok[3]=true;
if(ok[3] && count==31)ok[4]=true;
if(ok[4]){
cout<<i+1<<endl;
goto END;
}
}
}
END:;
}
}
|
#include <iostream>
#include <string>
#include <vector>
#include <cstdio>
using namespace std;
vector<int> T={5,7,5,7,7};
int solve(const vector<string>&v){
for(int i=0;i<v.size();i++){
for(int j=i,n=0,y=0;j<v.size();j++){
n+=v[j].size();
if(n==T[y]){
if(++y==T.size())return i+1;
n=0;
}
}
}
return -1;
}
int main(){
int N;
for(;cin>>N,N;){
vector<string>v(N);
for(int i=0;i<N;i++)cin>>v[i];
printf("%d\n",solve(v));
}
}
|
#include<bits/stdc++.h>
int i,j,p,n,q,a[9]={5,7,5,7,7,-1},d[50];char s[50];
int main(){for(;scanf("%d\n",&n),n;){for(i=0;i<n;)d[i++]=strlen(gets(s));
for(i=j=0;j<6;i++)for(p=i,j=q=0;q>=0;)for(q=a[j++];q>0;q-=d[p++]);
printf("%d\n",i);
}}
|
#include <bits/stdc++.h>
int n;
int L[64];
std::string str;
int main() {
for(;;) {
scanf("%d", &n);
if( n == 0 ) break;
for(int i = 0; i < n; ++i) {
std::cin >> str;
L[i] = str.size();
}
for(int i = 0; i < n; ++i) {
int state = 0;
int x = 0;
int dx[5] = {5, 7, 5, 7, 7};
for(int j = i; j < n; ++j) {
x += L[j];
if( x > dx[state] ) break;
if( x == dx[state] ) {
x = 0;
state += 1;
if( state == 5 ) {
break;
}
}
}
if( state == 5 ) {
printf("%d\n", i + 1);
break;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const vector<int> num = {5, 7, 5, 7, 7};
bool Check(int idx, const int n, const vector<int> &w) {
int j = 0, sum = 0;
for (int i = idx; i < n && j < 5; ++i) {
sum += w[i];
if (num[j] == sum) {
++j;
sum = 0;
}
else if (num[j] < sum)
return true;
}
return (j == 5) ? false : true;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
string s;
while (cin >> n, n) {
vector<int> w(n);
for (int i = 0; i < n; ++i) {
cin >> s;
w[i] = s.size();
}
int idx = 0;
while (Check(idx, n, w))
++idx;
cout << idx + 1 << endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main() {
int n;
while (cin >> n, n) {
vector<int> w(n);
for (int i = 0; i < n; ++i) {
string s; cin >> s;
w[i] = s.size();
}
int ok[] = { 5,7,5,7,7 };
for (int i = 0; i < n; ++i) {
int sum = 0, now = 0, j = 0;
while (now < 5 && sum < ok[now]) {
sum += w[i + j++];
if (sum == ok[now]) now++, sum = 0;
}
if (now == 5) {
cout << i + 1 << endl;
break;
}
}
}
return 0;
}
|
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int n;
string s[40];
bool find(int st) {
int cnt[5] = {5, 7, 5, 7, 7};
int cor = 0;
for (int i = st; i < n; i++) {
cnt[cor] -= (int)s[i].length();
if (cnt[cor] < 0) return false;
if (cnt[cor] == 0) cor++;
if (cor == 5) return true;
}
return false;
}
int main() {
while (cin >> n) {
if (!n) break;
int i, j;
for (i = 0; i < n; i++) cin >> s[i];
for (i = 0; ; i++) {
if (find(i)) {
break;
}
}
cout << i + 1 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define REP(i,b,e) for(int i=(b);i<(e);++i)
#define rep(i,e) for(int i=0;i<(e);++i)
int main() {
int n;
while(cin >> n){
if(n==0) return 0;
vector<string> v(n);
rep(i, n) cin >> v[i];
bool good=false;
rep(i, n){
int state=0, cur=0;
if(good) break;
REP(j, i, n){
cur += v[j].size();
if(cur==5 && (state==0 || state==2)){
cur = 0; state += 1;
}
else if(cur==7 && (state==1 || state==3 || state==4)){
cur = 0; state += 1;
}
else if(cur>7) break;
if(state==5){
cout << i+1 << endl;
good = true;
break;
}
}
}
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
int main(int argc, char *argv[])
{
for(;;) {
int n;
cin >> n;
if(n == 0) break;
vector<int> ls;
for(int i = 0; i < n; i++) {
string s;
cin >> s;
ls.push_back(s.length());
}
for(int i = 0; i < n; i++) {
int j = i, k = 0;
int tls[] = {5,7,5,7,7};
for(;;) {
if(ls[j] <= tls[k]) {
tls[k]-=ls[j];
j++;
} else {
break;
}
if(tls[k] == 0) k++;
if(k == 5) {
cout << (i+1) << endl;
i = n;
break;
}
}
}
}
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(){
while(1){
int N;
cin >> N ;
vector<int> a;
if(N==0){
break;
}
for(int i=0;i<N;i++){
string str;
cin >> str;
a.push_back(str.size());
}
for(int i=0;i<N;i++){
int tanka=0;
int sum=0;
for(int j=i;j<N;j++){
sum+=a[j];
if(sum==5&&(tanka==0||tanka==2)||sum==7&&(tanka==1||tanka==3||tanka==4)){
tanka++;
sum=0;
}
}
if(tanka==5){
cout << i+1 << endl;
break;
}
}
}
}
|
#include<bits/stdc++.h>
int main(){for(char s[50],i,j,p,q;p=atoi(gets(s));printf("%d\n",i)){for(i=0;i<p;s[i++]=strlen(gets(s+i)));for(i=j=0;j<7;)for(p=i++,j=q=1;q>0;)for(q=j++>5?0:j-2&&j-4?8:6;q>1;q-=s[p++]);}}
|
#include <iostream>
using namespace std;
int main(){
int n;
while(cin >> n, n){
string w[n];
for(int i = 0; i < n; ++i){
cin >> w[i];
}
int phrase[] = {5,7,5,7,7};
bool f = false;
for(int i = 0; i < n; ++i){
if(f) break;
int s = 0, t = 5;
for(int j = i; j < n; ++j){
t -= w[j].size();
if(!t){
++s;
if(s == 5){
cout << i+1 << endl;
f = true;
break;
}
t = phrase[s];
}else if(t < 0) break;
}
}
}
return 0;
}
|
#include<iostream>
#include <vector>
using namespace std;
int main(){
while (1){
int n;
cin >> n;
if(n==0) break;
vector<string> words(n+1);
for(int i=1; i<=n; i++){
cin >> words[i];
}
for(int i=1; i<n+1; i++){
bool flag = false;
int tanka[5]={5,7,5,7,7};
int now = 0;
for(int j=0; j+i<n+1; j++){
int len=words[i+j].length();
if(tanka[now]-len>=0){
tanka[now] -= len;
}else{
break;
}
if(tanka[now]==0){
now++;
}
if(now==5){
cout << i << endl;
flag = true;
break;
}
}
if(flag){
break;
}
}
}
return 0;
}
|
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
using ll = long long;
int main(void){
while(1){
int n,sum,flag;
string str;
cin >> n;
if(n==0) break;
vector<int> len(n);
for(int i=0;i<n;i++){
cin >> str;
len[i] = str.size();
}
for(int i=0;i<n;i++){
sum=0;
flag=0;
for(int j=i;(j<n&&sum<=7);j++){
sum+=len[j];
if(sum==5&&flag==0){
flag=1;
sum=0;
}
if(sum==7&&flag==1){
flag=2;
sum=0;
}
if(sum==5&&flag==2){
flag=3;
sum=0;
}
if(sum==7&&flag==3){
flag=4;
sum=0;
}
if(sum==7&&flag==4){
cout << i+1 << endl;
flag=5;
}
}
if(flag==5) break;
}
}
return 0;
}
|
#include<iostream>
#include<string>
using namespace std;
int main(){
int n;
while(cin >> n,n){
int i,j,k;
string buf;
int d[50]={};
for(i=0;i<n;i++){
cin >> buf;
d[i]=buf.size();
}
for(i=0;i<n;i++){
int c=0;
j=i;
while(c<5) c+=d[j++];
if(c!=5) continue;
c=0;
while(c<7) c+=d[j++];
if(c!=7) continue;
c=0;
while(c<5) c+=d[j++];
if(c!=5) continue;
c=0;while(c<7) c+=d[j++];
if(c!=7) continue;
c=0;
while(c<7) c+=d[j++];
if(c!=7) continue;
c=0;
cout << i+1 << endl;
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool acceptable(const vector<int> w, int i) {
const vector<int> tanku = {5, 7, 5, 7, 7};
for (int ku : tanku) {
int sum = 0;
while (sum < ku) {
sum += w[i++];
}
if (sum != ku) {
return false;
}
}
return true;
}
int main() {
int N;
while (cin >> N && N) {
vector<int> W(N);
for (int i = 0; i < N; ++i) {
string str;
cin >> str;
W[i] = str.length();
}
for (int i = 1; i <= N; ++i) {
if (acceptable(W, i - 1)) {
cout << i << endl;
break;
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int seps[] = {5, 7, 5, 7, 7};
int n;
char buf[114514];
int gs[114514];
int main() {
while (1) {
scanf("%d", &n);
if (n == 0) return 0;
for (int i=0; i<n; i++) {
scanf("%s", buf);
gs[i] = strlen(buf);
}
for (int i=0; i<n; i++) {
int k = 0;
int sum = 0;
bool fail = false;
for (int j=i; j<n; j++) {
sum += gs[j];
if (seps[k] < sum) {
fail = true;
break;
}
if (seps[k] == sum) {
++k;
sum = 0;
}
if (k == 5) break;
}
if (k != 5) fail = true;
if (!fail) {
printf("%d\n", i+1);
break;
}
}
}
}
|
#include<iostream>
#include<string>
using namespace std;
int main(){
while(1){
int n;
cin>>n;
if(n==0){
break;
}
int len[40];
for(int i=0;i<n;i++){
string w;
cin>>w;
len[i]=w.size();
}
for(int i=0;i<n;i++){
bool flg=false;
int sta=0;
int sum=0;
for(int j=i;j<n;j++){
sum+=len[j];
if(sum==5||sum==12||sum==17||sum==24||sum==31){
sta++;
}
if(sta==5){
flg=true;
break;
}else if(sum>=31){
break;
}
}
if(flg){
cout<<i+1<<endl;
break;
}
}
}
return 0;
}
|
#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main() {
int n;
int q = 0;
while (cin >> n) {
if (q != 0)cout << endl;
if (n == 0)return 0;
string w[50];
for (int i = 0;i < n;i++)cin >> w[i];
vector<int>v;
int now = 0;
for (int i = 0;i < n - 1;i++) {
for (int j = i;j < n;j++) {
now += w[j].size();
if (now == 5) {
v.push_back(i);
now = 0;
break;
}
if (now >= 6) {
now = 0;
break;
}
}
}
now=0;
int k = 0, flag = 0;
int haiku[5] = { 5,7,5,7,7 };
for (int i = 0;i < v.size();i++) {
for (int j = v[i];j < n;j++) {
now += w[j].size();
if (now == haiku[k]) {
k++;
now = 0;
}
if (k == 5) {
cout << v[i] + 1;
q++;
flag = 1;
break;
}
}
if (flag)break;
now = 0;
k = 0;
}
}
}
|
#include <iostream>
using namespace std;
int main(){
int a[]={5,7,5,7,7},n,i,j,c,k;
while(cin>>n,n){
string s[n];
for(i=0;i<n;i++)cin>>s[i];
for(i=0;i<n;i++){
c=k=0;
for(j=i;j<n;j++){
c+=s[j].size();
if(c==a[k]){
c=0;
if(++k==5)goto L;
}
}
}
L: if(k==5)cout<<i+1<<endl;
}
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int solve(vector<int> &a) {
int n = a.size();
for (int i = 0; i < n; i++) {
int cur = i;
bool ok = true;
for (int tgt: {5, 7, 5, 7, 7}) {
int cnt = 0;
while (cur < n && cnt + a[cur] <= tgt) cnt += a[cur++];
if (cnt != tgt) { ok = false; break; }
}
if (ok) return i;
}
return -1;
}
int main() {
int n;
while (cin >> n, n) {
vector<int> len(n);
for (int i = 0; i < n; i++) {
string s; cin >> s;
len[i] = s.size();
}
cout << solve(len) + 1 << endl;
}
return 0;
}
|
#include<bits/stdc++.h>
#include<string.h>
using namespace std;
typedef long long ll;
ll n,m,a,b;
ll i,j,k;
ll x[100005],y[100005];
char s[100];
bool solve(){
cin >> n ;
if(n == 0){
return false;
}
ll ans = 0;
for(i=0;i<100;i++){
x[i] = 0;
y[i] = 0;
}
for(i=0;i<n;i++){
cin >> s;
m = strlen(s);
x[i] = m;
}
for(i=0;i<n;i++){
ll sum = 0;
ll a = 0;
bool ok = false;
for(j=i;j<n;j++){
sum += x[j];
if(sum == 5)a++;
if(sum == 12)a++;
if(sum == 17)a++;
if(sum == 24)a++;
if(sum == 31){
a++;
if(a == 5){
ok = true;
break;
}else{
ok = false;
break;
}
}
if(sum >= 32 && a <= 4){
ok = false;
break;
}
}
if(ok){
cout << i+1 << endl;
return true;
}else{
//cout << "dame" << endl;
}
}
}
int main(){
while(solve());
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main(){
while(true){
int n;
cin>>n;
if(n==0){
break;
}
int len[40];
for(int i=0;i<n;i++){
string w;
cin>>w;
len[i]=w.size();
}
for(int i=0;i<n;i++){
bool flg=false;
int sta=0;
int sum=0;
for(int j=i;j<n;j++){
sum+=len[j];
if(sum==5||sum==12||sum==17||sum==24||sum==31){
sta++;
}
if(sta==5){
flg=true;
break;
}
else if(sum>=31){
break;
}
}
if(flg){
cout<<i+1<<endl;
break;
}
}
}
return 0;
}
|
#include<iostream>
#include<string>
using namespace std;
int k[5] = { 5,7,5,7,7 };
int main() {
int a;
while (cin >> a, a) {
int b[40];
for (int c = 0; c < a; c++) {
string d; cin >> d;
b[c] = d.length();
}
for (int i = 0; i < a; i++) {
int x = 0, y = 0;
for (int j = i; j < a; j++) {
if (y + b[j] > k[x])break;
else if (y + b[j] < k[x])y += b[j];
else {
x++; y = 0;
if (x == 5) { cout << i + 1 << endl; goto l; }
}
}
}
l:;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
while (cin >> n, n) {
vector<int> a(n);
for (int i = 0; i < n; ++i) {
string w;
cin >> w;
a[i] = w.size();
}
for (int i = 0; i < n; ++i) {
int s = 0;
set<int> se;
for (int j = i; j < n; ++j) {
se.insert(s += a[j]);
}
if (se.count(5) and se.count(12) and se.count(17) and se.count(24) and se.count(31)) {
cout << i + 1 << '\n';
break;
}
}
}
}
|
#include<iostream>
#include<vector>
#include<string>
using namespace std;
int main(void){
int n;
int tanku[]={5,7,5,7,7};
while(1){
cin>>n;
if(n==0)break;
string a;
vector<int> w(n);
for(int i=0;i<n;i++){
cin>>a;
w[i]=a.size();
}
int plase;
for(int i=0;i<n;i++){
plase=i;
int sum=0;
int k=0;
bool flag=false;
for(int j=i;j<n;j++){
sum+=w[j];
if(sum>tanku[k])break;
if(sum==tanku[k]){
k++;
sum=0;
}
if(k==5){
flag=true;
break;
}
}
if(flag){
cout<<i+1<<endl;
break;
}
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) (v).begin(),(v).end()
#define int long long
typedef pair<int,int> P;
//-----------------------------------------------------------------------
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n;
while(cin>>n,n){
vector<int> v(n);
REP(i,n){
string s; cin>>s;
v[i]=s.size();
}
REP(i,n){
int pos=i;
int j,A[]={5,7,5,7,7};
for(j=0;j<5;j++){
int cnt=0;
while(pos<n && cnt<A[j]) cnt+=v[pos++];
if(cnt!=A[j]) break;
}
if(j==5){
cout<<i+1<<endl; break;
}
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define BIG 1000000010
#define repi(i,x,n) for(int i=x;i<n;i++)
#define rep(i,n) repi(i,0,n)
#define repn(i,n) for(int i=n;i>=0;i--)
typedef long long int ll;
int main(){
int n;
string s[40];
int a[40];
int check[5]={5,7,5,7,7};
int cnt=0;
bool b=false;
while(1){
cin>>n;
if(n==0) break;
b=false;
rep(i,n){
cin>>s[i];
a[i]=s[i].size();
}
rep(i,n){
cnt=0;
int now=0;
rep(j,5){
cnt+=a[i+now];
if(cnt<check[j]) j--;
else if(cnt>check[j]) break;
else cnt=0;
if(j==4){cout<<i+1<<endl;b=true;break;}
now++;
}
if(b) break;
}
}
return 0;
}
|
#include<iostream>
#include<vector>
using namespace std;
int main(){
vector<int> num = {5, 7, 5, 7, 7};
int n;
while(std::cin >> n, n){
vector<string> vs(n);
for (int i = 0; i < n; i++) std::cin >> vs[i];
for (int i = 0; i < n; i++) {
int sum = 0, pos = 0;
for (int j = i; j < n; j++) {
sum += vs[j].size();
if(sum == num[pos])sum = 0, pos++;
if(pos == 5){
std::cout << i + 1 << std::endl;
i = j = 1e9;
}
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define all(a) (a).begin(),(a).end()
using namespace std;
int main(int argc, char const *argv[]) {
while (1) {
int chars=0;int tanku[5]={5,7,5,7,7};int block=0;//block???tanku??????????????´??°???v?????£??????leng???tanku??¨??????????????£?????´???
int leng=0,istart=1;
scanf("%d",&chars);
if(chars==0){
return 0;
}
std::vector<string> v(chars);
for (size_t i = 0; i < chars; i++) {
std::cin >> v[i];
}
//???????????§????????¨??\???
//??????????????????
for (size_t i = 0; block<=4; i++) {
leng+=v[i].size();
if (leng>tanku[block]) {
block=0;leng=0;
i=istart-1;istart++;
}else if(leng==tanku[block]){
block++;leng=0;
}
}
printf("%d\n",istart);
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
int solve(const std::vector<int>& ls) {
int cs[] = { 5, 12, 17, 24, 31 };
for (int i = 0; i < ls.size(); i++) {
int c = 0;
int l = 0;
for (int j = i; j < ls.size(); j++) {
l += ls.at(j);
if (cs[c] == l) {
c++;
if (c >= 5) {
return i+1;
}
}
else if (cs[c] < l) {
break;
}
}
}
return -1;
}
int main()
{
while (true)
{
int n;
std::cin >> n;
if (n == 0) {
break;
}
std::vector<int>ws;
ws.resize(n);
for (int i = 0; i < n; i++) {
std::string s;
std::cin >> s;
ws.at(i) = s.size();
}
std::cout << solve(ws) << std::endl;
}
}
|
#include<iostream>
#include<vector>
#include<string>
using namespace std;
vector<int> ans;
int main(){
while(true){
int n;
cin >> n;
if(n == 0) break;
string word[40];
for(int i = 0;i < n;i++){
cin >> word[i];
}
int tanku[] = {5,7,5,7,7};
int ini = 0;
for(int i = 0;i < n;i++){
if(ini != 0) break;
int kun = 0;
int kulen = 0;
for(int j = i;j < n;j++){
kulen += word[j].size();
if(kulen == tanku[kun]){
kun++;
kulen = 0;
if(kun >= 5){
ini = i+1;
break;
}
}else if(kulen > tanku[kun]){
break;
}
}
}
ans.push_back(ini);
}
for(int i = 0;i < ans.size();i++) cout << ans[i] << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
while(std::cin >> n, n){
int length[n];
string s;
for (int i = 0; i < n; i++) {
std::cin >> s;
length[i] = s.length();
}
vector<int> correct = {5, 7, 5, 7, 7};
for (int i = 0; i < n; i++) {
int tmp = 0, pos = 0;
for (int j = i; j < n; j++) {
tmp += length[j];
if(tmp == correct[pos])pos++, tmp = 0;
if(pos == correct.size()){
std::cout << i + 1 << std::endl;
i = j = 1e9;
}
}
}
}
return 0;
}
|
#include<bits/stdc++.h>
#define f(X) for(c=0;c<X;c+=v[p--]);if(c-X)goto L;
int main(){for(char n,v[99],s,p,c;p=s=n=atoi(gets(v));){for(;p;v[p--]=strlen(gets(v+70)));L:p=s--;f(5)f(7)f(5)f(7)f(7)printf("%d\n",n-s);}}
|
#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++)
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int n;
string w[50];
bool ok(int idx) {
int now = 0;
vector<int> vec{5, 7, 5, 7, 7};
rep(i, n) if (idx <= i) {
vec[now] -= w[i].size();
if (vec[now] == 0) {
now++;
if (now == vec.size()) return true;
}
if (vec[now] < 0) {
break;
}
}
return false;
}
void solve() {
rep(i, n) {
if (ok(i)) {
cout << i + 1 << endl;
break;
}
}
}
int main() {
while (cin >> n, n) {
rep(i, n) cin >> w[i];
solve();
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int b[5]={5,7,5,7,7};
while(1){
int n,a[41]={};
int count=0,ans=0,j=0,c=0;
string str;
cin>>n;
if(n==0)break;
for(int i=0;i<n;i++){
cin>>str;
a[i]=str.size();
}
for(int i=0;i<n;i++){
c+=a[i];
count++;
if(c==b[j]){
j++;
c=0;
}
else if(c>b[j]){
i-=count-1;
j=0;
c=0;
count=0;
}
if(j>4){
ans=i-(count-1);
break;
}
}
cout<<ans+1<<endl;
}
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <string.h>
int main (){
int n,ans = 0,count = 0,temp;
int cc[5],ku;
cc[0] = 5;
cc[1] = 7;
cc[2] = 5;
cc[3] = 7;
cc[4] = 7;
char moji[40][10];
while(1){
scanf("%d",&n);
if(n == 0) break;
for(int i = 0;i < n;i++){
scanf("%s",&moji[i]);
//printf("%s ",moji[i]);fflush(0);
}
ans = 0;
count = 0;
temp = 0;
ku = 0;
while(1){
temp += strlen(moji[ans+count]);
//printf("%d",temp);
if(cc[ku] == temp){
if(ku == 4){
break;
}
temp = 0;
ku++;
}
else if(cc[ku] < temp){
ku = 0;
temp = 0;
ans++;
count = 0;
continue;
}
count++;
}
printf("%d\n",ans+1);
}
return 0;
}
|
#include <iostream>
using namespace std;
const int step[5] = {5, 7, 5, 7, 7};
int N;
string S[40];
int solve() {
for (int i = 0; i < N; ++i) {
bool ok = true;
int idx = i;
for (int t = 0; t < 5; ++t) {
int acc = 0;
while (acc < step[t]) acc += S[idx++].size();
if (acc != step[t]) {
ok = false;
break;
}
}
if (ok)
return i+1;
}
return -1;
}
int main(void) {
while (true) {
cin >> N;
if (N == 0) break;
for (int i = 0; i < N; ++i)
cin >> S[i];
cout << solve() << endl;
}
return 0;
}
|
#include<iostream>
#include<string>
using namespace std;
int main(){
int n;
int d_words[5]={5,7,5,7,7};
while(cin>>n && n!=0){
int* n_words=new int[n];
for(int i=0;i<n;i++){
string str;
cin>>str;
n_words[i]=str.size();
}
int start=0;
int success=0;
while(!success){
int t_words=0;
int tmp=start;
int tmp2=0;
while(1){
tmp2+=n_words[tmp];
if(tmp2==d_words[t_words]){
t_words++;
tmp2=0;
if(t_words==5){
success=start+1;
break;
}
}else if(tmp2>d_words[t_words]){
break;
}
tmp++;
}
start++;
}
cout<<success<<endl;
}
}
|
#include<bits/stdc++.h>
using namespace std;
int len[] = {5,7,5,7,7};
int main(){
int n;
while(cin >> n , n){
string str[n+1];
for(int i=0;i<n;i++){
cin >> str[i];
}
for(int i=0;i<n;i++){
int sum = 0;
int idx = 0;
bool flag = false;
for(int j=i;j<n;j++){
sum += str[j].size();
if(len[idx] == sum){
sum = 0;
idx++;
} else if(len[idx] < sum) break;
if(idx == 5){
flag = true;
break;
}
}
if(flag){
cout << i+1 << endl;
break;
}
}
}
}
|
#include<bits/stdc++.h>
char s[50],a[9]={6,8,6,8,8};
int main(){for(int i,j,p,n,q;scanf("%d\n",&n),n;){for(i=0;i<n;s[i++]=strlen(gets(s+i)));
for(i=j=0;j<6;)for(p=i++,j=q=0;q>=0;)for(q=a[j++]-1;q>0;q-=s[p++]);
printf("%d\n",i);
}}
|
/*** ?????\ ***/
#include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for(int i=a; i<n; i++)
int main() {
int N;
while(cin>>N, N){
int len[41]={};
REP(i, 0, N){
string s;
cin >> s;
len[i]=s.size();
}
REP(i, 0, N){
int num=0;
int haiku[5]={5, 7, 5, 7, 7};
bool flag=false;
REP(j, i, N){
haiku[num]-=len[j];
if(haiku[num]<0) break;
if(haiku[num]==0) num++;
if(num==5){
flag=true;
break;
}
}
if(flag){
cout << i+1 << endl;
break;
}
}
}
return 0;
}
|
#include<bits/stdc++.h>
#define f(X) for(c=0;c<X;c+=v[p++]);if(c-X)goto L;
int main(){for(char n,v[99],s,p,c;n=atoi(gets(v));){for(s=0;s<n;v[++s]=strlen(gets(v+n)));s=0;L:p=++s;f(5)f(7)f(5)f(7)f(7)printf("%d\n",s);}}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n;
while ( cin >> n, n ) {
vector<string> w(n);
for ( int i = 0; i < n; i++ ) cin >> w[i];
for ( int i = 0; i < n; i++ ) {
int id = 0;
vector<int> tanku{5, 7, 5, 7, 7};
for ( int j = i; j < n; j++ ) {
if ( tanku[id] == (int)w[j].size() ) {
id++;
} else if ( tanku[id] > (int)w[j].size() ) {
tanku[id] -= (int)w[j].size();
} else {
break;
}
if ( id == 5 ) break;
}
if ( id == 5 ) {
cout << i+1 << endl;
break;
}
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
void format(int a[]){
for(int i=0;i<5;i++){
if(i==0||i==2)
a[i]=5;
else
a[i]=7;
}
}
int main(){
int n;
while(cin>>n,n!=0){
string word[n];
for(int i=0;i<n;i++)
cin>>word[i];
int cnt[n];
format(cnt);
for(int j=0;j<n;j++){
int flag=0;
format(cnt);
int pointer=0;
for(int i=j;i<n;i++){
cnt[pointer]-=word[i].size();
if(cnt[pointer]<0)
break;
else if(cnt[pointer]==0&&pointer==4){
cout<<j+1<<endl;flag=1;break;
}else if(cnt[pointer]==0)
pointer++;
}
if(flag==1)
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
string tmp;
while (cin >> n, n) {
vector<string> v;
v.reserve(n);
for (int i = 0; i < n; i++) {
cin >> tmp;
v.push_back(tmp);
}
int del = 0;
int flag = 0;
while (flag != 5) {
flag = 0;
int length = 0;
for (int i = del;i < v.size();i++) {
length += v[i].size();
if (length == 5 || length == 12 || length == 17 || length == 24 || length == 31)
flag++;
}
del++;
}
cout << del << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool check(vector<int>& v, int i){
vector<int> x = {5,7,5,7,7};
int id=0;
for(int j=i; j<v.size(); j++){
x[id] -= v[j];
if( x[id] == 0 ){
id++;
if(id == 5) return true;
}
else if( x[id] < 0 ){
return false;
}
}
return false;
}
int main(){
while(1){
int n; cin >> n;
if(!n) break;
vector<int> v(n);
for(int i=0; i<n; i++){
string in; cin >> in;
v[i] = in.size();
}
for(int i=0; i<n; i++){
if( check(v,i) ){
cout << i+1 << endl;
break;
}
}
}
}
|
#include <iostream>
#include <functional>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
int k[5] = {5,7,5,7,7};
int n;
string str[50];
bool dfs(int s, int c, int sum) {
if (sum + str[s].length() == k[c]) {
if (c == 4) return true;
else return dfs(s+1, c+1, 0);
}
else if (sum + str[s].length() > k[c]) return false;
else return dfs(s+1, c, sum + str[s].length());
}
int main(void){
while (1) {
cin >> n;
if (!n) break;
for (int i = 0; i < n; i++) cin >> str[i];
for (int i = 0; i < n; i++) {
int x = dfs(i, 0, 0);
if (x == false) continue;
cout << i+1 << endl;
break;
}
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(void) {
int n;
int tan[5] = {5,7,5,7,7};
cin >> n;
while (n != 0) {
vector<string> str(n);
for (int i = 0; i < n; ++i) {
cin >> str[i];
}
bool find = false;
bool over = false;
int ind = 0;
int ln = 0;
int ret;
for (int i = 0; !find && i < n; ++i) {
over = false;
ind = 0;
ln = 0;
for (int j = i; !over && j < n; ++j) {
if (ln + str[j].length() == tan[ind]) {
if (ind == 4) {
find = true;
ret = i+1;
}
else {
++ind;
ln = 0;
}
}
else if (ln + str[j].length() < tan[ind]) {
ln += str[j].length();
}
else {
over = true;
}
}
}
cout << ret << endl;
cin >> n;
}
return 0;
}
|
#include<bits/stdc++.h>
int i,j,p,n,q,a[9]={5,7,5,7,7,-1};char s[50];
int main(){for(;scanf("%d\n",&n),n;){for(i=0;i<n;s[i++]=strlen(gets(s+i)));
for(i=j=0;j<6;i++)for(p=i,j=q=0;q>=0;)for(q=a[j++];q>0;q-=s[p++]);
printf("%d\n",i);
}}
|
#include <iostream>
using namespace std;
int main(){
int a[]={5,7,5,7,7},n,i,j,c,k;
while(cin>>n,n){
string s[n];
for(i=0;i<n;i++)cin>>s[i];
for(i=0;i<n;i++){
c=k=0;
for(j=i;j<n;j++){
c+=s[j].size();
if(c==a[k]){
c=0;
if(++k==5)goto L;
}
}
}
L:cout<<i+1<<endl;
}
}
|
#include<bits/stdc++.h>
#define N 45
using namespace std;
int n,l[N],L[N],ans;
int d[5]={5,7,5,7,7};
string s;
int main(){
while(1){
cin>>n;
if(!n)break;
for(int i=1;i<=n;i++){
cin>>s,l[i]=s.size();
L[i]=L[i-1]+l[i];
}
ans=0;
for(int i=1;i<=n;i++){
int idx=0,s=i;
for(int j=i;j<=n;j++){
if(L[j]-L[s-1]==d[idx])idx++,s=j+1;
if(!ans&&idx==5)ans=i;
}
}
cout<<ans<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int tanku[5] = {5, 7, 5, 7, 7};
int main(){
for(int n; cin >> n, n;){
vector<int>v(n);
for(int i = 0; i < n; i++){
string s;
cin >> s;
v[i] = s.size();
}
for(int i = 0; i < n; i++){
int flg = 0;
int x = 0, y = 0;
for(int j = i; j < n; j++){
x += v[j];
if(x > tanku[y])break;
if(x == tanku[y]){
x = 0;
y++;
}
if(y == 5){
flg = 1;
break;
}
}
if(flg){
cout << i + 1 << endl;
break;
}
}
}
return 0;
}
|
#include<iostream>
#include<string>
using namespace std;
int main(){
while(1){
int n;
cin>>n;
if(n==0)
break;
int len[40];
for(int i=0;i<n;i++){
string w;
cin>>w;
len[i]=w.size();
}
for(int i=0;i<n;i++){
bool flg=false;
int sta=0;
int sum=0;
for(int j=i;j<n;j++){
sum+=len[j];
if(sum==5||sum==12||sum==17||sum==24||sum==31){
sta++;
}
if(sta==5){
flg=true;
break;
}
else if(sum>=31){
break;
}
}
if(flg){
cout<<i+1<<endl;
break;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
while(1){
int N, i, j, s = 0;
scanf("%d", &N);
if(N == 0){
return 0;
}
vector<string> w(N);
for(i = 0; i < N; i++){
cin >> w[i];
s += w[i].size();
}
vector<int> a(s + 1, 0);
for(i = 0, j = 0; i < N; i++){
a[j] = 1;
j += w[i].size();
}
a[j] = 1;
/* for(i = 0; i < a.size(); i++){
printf("%d", a[i]);
}
printf("\n");
*/ s = 0;
for(i = 0; i < N; i++){
// printf("i = %d\n", i);
// printf("s = %d\n", s);
if(a[s] == 1 && a[s + 5] == 1 && a[s + 12] == 1 && a[s + 17] == 1 && a[s + 24] == 1 && a[s + 31] == 1){
printf("%d\n", i + 1);
break;
}
s += w[i].size();
}
}
}
|
#include <cstdio>
#include <cassert>
#include <string>
#include <vector>
#include <utility>
#include <algorithm>
bool nya(std::vector<int> const& w, size_t k) {
std::vector<int> haiku{5, 7, 5, 7, 7};
int j = 0;
for (size_t i = k; i < w.size(); ++i) {
if (haiku[j] < w[i]) return false;
haiku[j] -= w[i];
if (haiku[j] == 0) {
if (++j == 5) return true;
}
}
return false;
}
int testcase_ends() {
size_t n;
scanf("%zu", &n);
if (n == 0) return 1;
std::vector<int> w(n);
for (auto& wi: w) {
char buf[16];
scanf("%s", buf);
wi = std::string(buf).length();
}
for (size_t i = 0; i < n; ++i)
if (nya(w, i)) return !printf("%zu\n", i+1);
assert(false);
}
int main() {
while (!testcase_ends()) {}
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,d[]={5,7,5,7,7},i,j,t,k;
while(cin>>n,n){
string s[41];
for(i=0;i<n;i++)cin>>s[i];
for(i=0,k=0;k!=5;i++)
for(j=i,t=s[i].size(),k=0;k!=5;t+=s[++j].size())
if(t==d[k])k++,t=0;
else if(t>d[k])break;
cout<<i<<endl;
}
return 0;
}
|
#include<cstdio>
using namespace std;
int n;
int s[40];
int size(char *w) {
int counter = 0;
while (w[counter] != 0) counter++;
return counter;
}
bool ok(int f, int s) {
if (s <= 5) return true;
if (f >= 5 && s <= 12) return true;
if (f >= 12 && s <= 17) return true;
if (f >= 17 && s <= 24) return true;
if (f >= 24 && s <= 31) return true;
return false;
}
int main() {
while (1) {
scanf("%d", &n);
if (n == 0) break;
for (int i = 0; i < n; i++) {
char w[15];
scanf("%s", w);
s[i] = size(w);
}
for (int i = 0; i < n; i++) {
int sum = 0;
for (int j = i; j < n; j++) {
if (!ok(sum, sum + s[j])) break;
sum += s[j];
if (sum == 31) break;
}
if (sum == 31) {
printf("%d\n", i + 1);
break;
}
}
}
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
int cnt[50];
int moji[5]={5,7,5,7,7};
while(1){
cin >> n;
if(n==0) break;
for(int i=0;i < n;i++){
string str;
cin >> str;
cnt[i]=str.size();
}
int ans=-1;
for(int i=0;i<n;i++){
if(ans!=-1)continue;
int now=0;
int len=0;
for(int j=i;j < n;j++){
len+=cnt[j];
if(len == moji[now]){
now++;
len=0;
}else if(len > moji[now]){
break;
}
if(now==5){
ans=i;
break;
}
}
}
cout << ans+1 << endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
int main() {
int n;
constexpr int check[] = {5, 7, 5, 7, 7};
LOOP:
while (std::cin >> n, n != 0) {
std::vector<std::string> v(n);
for (int i = 0; i < n; ++i) {
std::cin >> v[i];
}
for (int i = 0; i < n; ++i) {
int cnt = 0, idx = 0;
for (int j = i; j < n; ++j) {
cnt += v[j].size();
if (cnt == check[idx]) {
cnt = 0;
idx++;
}
if (idx == 5) {
std::cout << i + 1 << std::endl;
goto LOOP;
}
}
}
}
}
|
#include<iostream>
#include<cstring>
using namespace std;
int num[6]={5,7,5,7,7};
int n;
int t[55];
bool check(int a,int s=0,int i=0){
if(s>num[i])return false;
if(s==num[i])i++,s=0;
if(i==5)return true;
if(a>=n)return false;
return check(a+1,s+t[a],i);
}
int main(){
int i,j,k;
int a,b,c;
char ca[15];
while(cin>>n){
if(!n)break;
for(i=0;i<n;i++){
cin>>ca;
t[i]=strlen(ca);
}
for(i=0;i<n;i++){
if(check(i)){
cout<<i+1<<endl;
break;
}
}
}
}
|
// 2018/01/05 Tazoe
#include <iostream>
#include <string>
using namespace std;
int main()
{
while(true){
int n;
cin >> n;
if(n==0)
break;
string w[40];
int len[40];
for(int i=0; i<n; i++){
cin >> w[i];
len[i] = w[i].size();
}
for(int i=0; i<n; i++){
bool flg = false;
int sta = 0;
int sum = 0;
for(int j=i; j<n; j++){
sum += len[j];
if(sum==5 || sum==12 || sum==17 || sum==24 || sum==31){
sta++;
}
if(sta==5){
flg = true;
break;
}
else if(sum>=31){
break;
}
}
if(flg){
cout << i+1 << endl;
break;
}
}
}
return 0;
}
|
#include <stdio.h>
#include <string.h>
int main(){
while(1){
LOOP:
int n;
scanf("%d",&n);
if(!n) break;
char w[40][11];
int c[40];
for(int i=0;i<n;i++){
scanf("%s",w[i]);
c[i]=strlen(w[i]);
}
int f[]={5,7,5,7,7};
int k;
int tmp;
for(int i=0;i<n;i++){
k=0;
tmp=0;
for(int j=i;j<n;j++){
if(f[k]<tmp+c[j])
break;
tmp+=c[j];
if(tmp==f[k]){
k++;
tmp=0;
}
if(k==5){
printf("%d\n",i+1);
goto LOOP;
}
}
}
}
return 0;
}
|
#include"bits/stdc++.h"
#define rep(i,n) for(int i=0;i<n;i++)
typedef long long ll;
using namespace std;
char c[40][15];
int main(){
int n;
while (scanf("%d", &n), n){
int want[] = { 5, 7, 5, 7, 7 };
int cnt = 0;
int j = 0;
for (int i = 0; i < n; i++){
scanf("%s", c[i]);
}
int t;
for (t = 0; t < n; t++){
for (int i = t; i < n; i++){
cnt += strlen(c[i]);
if (cnt == want[j]){
cnt = 0;
if (++j == 5)break;
}
if (cnt > want[j])break;
}
if (j == 5)break;
j = 0;
cnt = 0;
}
printf("%d\n", t+1);
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main(){
int len[5] = {5,7,5,7,7};
int n, i;
string str[41];
while(cin >> n, n){
for(i = 0; i < n; i++){
cin >> str[i];
}
for(i = 0; i < n; i++){
int sum = 0, idx = 0, flag = 0;
for(int j = i; j < n; j++){
sum += str[j].size();
if(len[idx] == sum){
sum = 0;
idx++;
}else if(len[idx] < sum){
break;
}
if(idx == 5){
flag = 1;
break;
}
}
if(flag){
cout << i + 1 << endl;
break;
}
}
}
return 0;
}
|
#include <cstdio>
#include <cstring>
int l[40];
bool check(int *p, int n) {
int i;
for (i=0;i<n;i+=l[(*p)++]);
return (i == n);
}
int main() {
int n;
while (scanf("%d", &n), n!=0) {
for (int i=0;i<n;i++) {
char s[11];
scanf("%s", s);
l[i] = strlen(s);
}
for (int i=0;i<n-4;i++) {
int p = i;
if (!check(&p, 5)) continue;
if (!check(&p, 7)) continue;
if (!check(&p, 5)) continue;
if (!check(&p, 7)) continue;
if (!check(&p, 7)) continue;
printf("%d\n", i+1);
break;
}
}
return 0;
}
|
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "iomanip"
using namespace std;
const long long int MOD = 1000000007;
long long int N, M, K, H, W, L, R;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N;
while (N) {
vector<int>num(N);
vector<int>sum(N);
for (int i = 0; i < N; i++) {
string s;
cin >> s;
num[i] = s.size();
}
for (int i = 0; i < N; i++) {
M = 0;
K = 0;
for (int j = i; j < N; j++) {
M += num[j];
if (M == 5 || M == 12 || M == 17 || M == 24 || M == 31) {
K++;
}
}
if (K == 5) {
cout << i + 1 << endl;
break;
}
}
cin >> N;
}
return 0;
}
|
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int len[5] = {5, 7, 5, 7, 7};
int main() {
int N;
while (cin >> N, N) {
vector<string> a(N); for (int i = 0; i < N; ++i) cin >> a[i];
for (int i = 0; i < N; ++i) {
bool ok = true;
int j = i;
for (int it = 0; it < 5; ++it) {
string str = "";
while (j < N && str.size() < len[it]) str += a[j++];
if (str.size() != len[it]) {
ok = false;
break;
}
}
if (ok) {
cout << i+1 << endl;
break;
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define for_(i,a,b) for(int i=(a);i<(b);++i)
const int len[6] = {5,7,5,7,7,-1};
int main() {
int n;
while (cin >> n) {
if (n == 0) break;
vector< string > s(n);
for_(i,0,n) cin >> s[i];
for_(i,0,n) {
int p = 0, sum = 0;
for_(j,i,n) {
sum += s[j].size();
if (sum > len[p]) break;
if (sum == len[p]) {
sum = 0;
++p;
}
}
if (p == 5) {
cout << i + 1 << endl;
break;
}
}
}
}
|
// 2016-12-12
#include <iostream>
#include <string>
using namespace std;
int main() {
int t[5] = {5, 7, 5, 7, 7};
int n, a[40];
string s;
while (cin >> n, n) {
for (int i = 0; i < n; i++) {
cin >> s;
a[i] = s.length();
}
bool b = false;
for (int i = 0; i < n; i++) {
for (int j = i, k = 0, m = 0; j < n; j++) {
m += a[j];
if (m == t[k]) {
k++;
m = 0;
if (k == 5) {
b = true;
break;
}
} else if (m > t[k]) {
break;
}
}
if (b) {
cout << i + 1 << endl;
break;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int cnt[501];
int main()
{
int n;
while (cin >> n, n) {
fill(cnt, cnt + 501, 0);
int p = 0;
cnt[p] = 1;
for (int i = 0; i < n; i++) {
string w;
cin >> w;
p += w.size();
cnt[p] = i + 2;
}
vector<int> v = { 5, 7, 5, 7, 7 };
vector<int> sum(6);
for (int i = 0; i < 5; i++) {
sum[i + 1] = sum[i] + v[i];
}
for (int i = 0; i <= 400; i++) {
bool ok = true;
for (int j = 0; j < 6; j++) {
ok &= cnt[i + sum[j]] > 0;
}
if (ok) {
cout << cnt[i] << endl;
break;
}
}
}
return 0;
}
|
#include<bits/stdc++.h>
int i,j,d[50],p,n,q,a[5]={5,7,5,7,7};
char s[15];
int main(){
for(n=1;n;){
scanf("%d\n",&n);
for(i=0;i<n;i++)d[i]=strlen(gets(s));
for(i=0;n;i++){
p=i;
for(j=0;j<5;j++){
q=a[j];
while(q>0){
q-=d[p];p++;
}
if(q<0)break;
}
if(j>4){
printf("%d\n",i+1);
break;
}
}
}
}
|
#include <iostream>
#include <vector>
using namespace std;
int main(){
while(1){
int n;
cin >> n;
if(n==0) break;
vector<string> str(n);
for(int i=0; i<n; i++){
cin >> str[i];
}
for(int i=0; i<n; i++){
int sp[5] = {5,7,5,7,7};
int now = 0;
for(int j=0; j<n; j++){
sp[now] -= str[i+j].length();
if(sp[now]<0) break;
if(sp[now]==0) now++;
if(now==5){
cout << i+1 << endl;
i=1e9;
break;
}
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
void readVector(int n, vector<T> &v){
for(int i=0; i<n; ++i){
T t;
cin >> t;
v.push_back(t);
}
}
int a[5] = {5, 12, 17, 24, 31};
void solve(int n){
vector<string> v;
readVector(n, v);
for(int i=0; i<n; ++i){
int cnt = 0;
int flag = 0;
for(int j=i; j<n; ++j){
cnt += v[j].size();
for(int k=0; k<5; ++k)
if(cnt == a[k])
flag += (1 << k);
}
if(flag == 31){
cout << i+1 << "\n";
return;
}
}
}
int main(){
// cin.tie(0);
// ios::sync_with_stdio(false);
while(1){
int n;
cin >> n;
if(n == 0) return 0;
solve(n);
}
}
|
#include<iostream>
#include<string>
int a[40],n;
int haiku(int);
using namespace std;
int main(){
while(1){
string x;
cin >> n;
if(n==0)break;
for(int i=0;i<n;i++){
cin >> x;
a[i]=x.size();
}
int f;
for(int i=0;i<n;i++){
f=haiku(i);
if(f==1){
cout << i+1 << endl;
break;
}
}
}
return 0;
}
int haiku(int x){
int c=0,c2=0;
for(int i=x;i<n;i++){
c+=a[i];
if(c2==0||c2==2){
if(c<5)continue;
else if(c==5){
c=0;
c2++;
continue;
}
else return 0;
}
else{
if(c<7)continue;
if(c==7){
c=0;
c2++;
if(c2==5)return 1;
continue;
}
else return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int a[5] = {5,7,5,7,7};
signed main() {
int n;
while (cin >> n && n) {
vector<int> v(n);
rep(i, n) {
string s; cin >> s;
v[i] = s.size();
}
rep(i, n) {
bool ok = true;
int idx = 0;
int sum = 0;
rep(j, 5) {
while (i + idx < n && sum < a[j]) {
sum += v[i + idx++];
}
if (sum > a[j]) {
ok = false;
break;
}
sum = 0;
}
if (ok) {
cout << i + 1 << endl;
break;
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int n, ans;
int main() {
int i, j;
while(1) {
cin >> n;
if(n == 0) break;
vector<int> v;
for(i = 0; i < n; ++i) {
cin >> s;
v.push_back(s.size());
}
ans = 0;
for(i = 0; i < n; ++i) {
if(ans != 0) break;
int now = 0, ch = 0;
for(j = i; j < n; ++j) {
now += v[j];
if(now == 5 || now == 12 || now == 17 || now == 24 || now == 31) ++ch;
if(now > 31) break;
}
if(ch == 5) ans = ++i;
}
cout << ans << endl;
}
return 0;
}
|
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
int n,cnt,ans;
string s;
vector<int> v;
int f(int a){
int t[5]={5,7,5,7,7};
cnt=0;
while(1){
t[cnt]-=v[a];
if(t[cnt]==0)cnt++;
else if(t[cnt]<0)return 0;
a++;
if(cnt==5)return a+1;
}
}
int main(void){
while(1){
cin>>n;
v={};
if(n==0)return 0;
for(int i=0;i<n;i++){
cin>>s;
v.push_back(s.size());
}
for(int i=0;i<n;i++){
ans=f(i);
if(ans!=0){
cout<<i+1<<endl;
break;
}
}
}
}
|
#include<iostream>
#define f(X) for(c=0;c<X;c+=v[p++]);if(c-X)continue;
using namespace std;
int main(){
for(int n;cin>>n,n;){
int v[50],s,p,c;
for(s=0;s<n;s++){string t;cin>>t;v[s]=t.size();}
for(s=p=0;;p=++s){f(5);f(7);f(5);f(7);f(7);cout<<s+1<<endl;break;}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX_N=41;
int n,sum,t,ok; string w;
vector<int> words(MAX_N);
vector<int> each={5,7,5,7,7};
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
while(cin >> n,n){
for (int i=0;i<n;++i){
cin >> w; words[i]=(int)w.size();
}
for (int i=0;i<n;++i){
t=i,ok=1;
for (int j=0;j<5;++j){
sum=0;
for (int k=t;k<n;++k){
sum+=words[k];
if (sum==each[j]){t=k+1; break;}
if (sum>each[j]){ok=0; break;}
}
}
if (ok){
cout << i+1 << '\n';
break;
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
typedef long long LL;
int main(){
int n;
string s;
int len[5]={5,7,5,7,7};
int count;
int now;
int ans;
while(1){
cin >> n;
if(n==0) return 0;
vector<int> w(n);
for(int i=0;i<n;i++){
cin >> s;
w[i]=s.length();
}
ans=-1;
for(int i=0;i<n;i++){
count=0;
now=0;
for(int j=i;j<n;j++){
count+=w[j];
if(count==len[now]){
now++;
count=0;
if(now==5){
ans=i;
}
}else if(count>len[now]){
break;
}
}
if(ans!=-1){
break;
}
}
cout << ans+1 << endl;
}
return 0;
}
|
#include<iostream>
#include<string>
using namespace std;
int main()
{
int n, a[5] = { 5, 7, 5, 7, 7 }, b[40];
string s[40];
while( cin >> n )
{
if( !n )
break;
for( int i = 0; i < n; i++ )
{
cin >> s[i];
b[i] = s[i].size();
}
for( int i = 0; i < n; i++ )
{
int sum = 0, k = 0, j = i;
while( a[k] >= sum && j < n )
{
sum += b[j];
j++;
if( sum == a[k] )
{
k++;
sum = 0;
}
}
if( k == 5 )
{
cout << i + 1 << endl;
break;
}
}
}
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
const int haiku[5]={5,7,5,7,7};
while(cin>>n,n){
vector<string> w(n);
for(int i=0;i<n;i++) cin>>w[i];
int res=-1;
for(int i=0;i<n && res==-1;i++){
int stage=0;
int cnt=0;
for(int j=i;j<n;j++){
cnt+=w[j].size();
if(cnt==haiku[stage]){
stage++;
cnt=0;
}
if(stage==5){
res=i+1;
break;
}
}
}
cout<<res<<endl;
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int w[42]; // 1-origin
int n;
static const int secToNum[6] = {0, 5, 7, 5, 7, 7};
bool solve(int x) {
int sum;
for (int sec = 1; sec <= 5; sec++) {
sum = 0;
while (sum < secToNum[sec]) {
sum += w[x];
x++;
}
if (sum > secToNum[sec]) {
return false;
}
}
return true;
}
int main() {
while (1) {
cin >> n;
if (n == 0) {
break;
}
string s;
for (int i = 1; i <= n; i++) {
cin >> s;
w[i] = s.size();
}
for (int i = 1; i <= n; i++) {
if (solve(i)) {
cout << i << endl;
break;
}
}
}
return 0;
}
|
// 2018/01/05 Tazoe
#include <iostream>
#include <string>
using namespace std;
int main()
{
while(true){
int n;
cin >> n;
if(n==0)
break;
int len[40]; // 単語の長さ
for(int i=0; i<n; i++){
string w;
cin >> w;
len[i] = w.size();
}
for(int i=0; i<n; i++){
bool flg = false; // 見つかったフラグ
int sta = 0; // 区切り
int sum = 0; // 文字数の合計
for(int j=i; j<n; j++){
sum += len[j];
// 区切りなら
if(sum==5 || sum==12 || sum==17 || sum==24 || sum==31){
sta++;
}
if(sta==5){ // 見つかった
flg = true;
break;
}
else if(sum>=31){ // 見つからなかった
break;
}
}
if(flg){ // 見つかったら
cout << i+1 << endl;
break;
}
}
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main()
{
while(true){
int n;
cin >> n;
if(n==0)
break;
int len[40];
for(int i=0; i<n; i++){
string w;
cin >> w;
len[i] = w.size();
}
for(int i=0; i<n; i++){
bool flg = false;
int sta = 0;
int sum = 0;
for(int j=i; j<n; j++){
sum += len[j];
if(sum==5 || sum==12 || sum==17 || sum==24 || sum==31){
sta++;
}
if(sta==5){
flg = true;
// cout << "OK" << endl;
break;
}
else if(sum>=31){
break;
}
}
if(flg){
cout << i+1 << endl;
break;
}
}
// cout << "Not OK" << endl;
}
return 0;
}
|
#include<iostream>
#include<string>
using namespace std;
string S[1000]; int n, p[5] = { 5,12,17,24,31 };
int main() {
while (true) {
cin >> n; if (n == 0)break;
for (int i = 0; i < n; i++)cin >> S[i];
for (int i = 0; i < n; i++) {
int cnt = 0, sum = 0;
for (int j = i; j < n; j++) {
if (cnt >= 5)continue;
sum += S[j].size();
if (p[cnt] == sum)cnt++;
}
if (cnt == 5) { cout << i + 1 << endl; break; }
}
}
return 0;
}
|
#include <bits/stdc++.h>
int len[] = {5, 7, 5, 7, 7};
std::vector< std::string > w(40);
bool check(int start, int n) {
int i = start, k;
for(k = 0; k < 5; ++k) {
int rest = len[k];
if(i >= n) return false;
while(i < n && rest > 0) {
rest -= w[i].length();
++i;
}
if(rest < 0) {
return false;
}
}
return true;
}
int main() {
int n;
int i;
while(std::cin >> n, n != 0) {
for(i = 0; i < n; ++i) {
std::cin >> w[i];
}
for(i = 0; i < n; ++i) {
if(check(i, n)) {
std::cout << i + 1 << std::endl;
break;
}
}
}
}
|
#include <iostream>
#include <string>
using namespace std;
int N;
int length[44];
int len[]={5,7,5,7,7};
int search_len(int s,int l){
int total=0;
while(s<=N&&total<l) {
total+=length[s];
s++;
}
if (total==l) return s;
else return -1;
}
bool judge(int s){
int next=s;
for(int i=0;i<5;i++){
auto temp=search_len(next,len[i]);
if (temp==-1) return false;
next=temp;
}
return true;
}
int main(){
string buf;
while(true){
cin>>N;
if (N==0) break;
for(int i=1;i<=N;i++){
cin>>buf;
length[i]=buf.size();
}
int i=1;
while(i<=N){
if (judge(i)) {
printf("%d\n",i);
break;
}
i++;
}
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.