text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<char, int>P;
int main(){
int l;
while (cin >> l, l) {
int cnt = 0;
int ans = -1;
rep(i, 12) {
int m, n; cin >> m >> n;
cnt += m - n;
if (!~ans&&l <= cnt)ans = i + 1;
}
printf(~ans ? "%d\n" : "NA\n", ans);
}
return 0;
} |
#include<stdio.h>
int main ()
{
int M,N,w,m;
int num[12]={};
long R;
w=0;m=0;
while(1)
{
w=0;m=0;
scanf("%ld",&R);
if(R==0)break;
for(int i=0;i<12;i++){
scanf("%d %d",&M,&N);
w=w+(M-N);
if(w>=R){num[m]=(i+1);m++;}
}
if(w>=R)printf("%d\n",num[0]);
else printf("NA\n");
}
return 0;
} |
#include<iostream>
using namespace std;
int main() {
int money;
while (cin >> money&&money != 0) {
int get[12], use[12];
for (int i = 0; i < 12; ++i) {
cin >> get[i] >> use[i];
}
int ans = -1;
int num = 0;
for (int i = 0; i < 12; ++i) {
num += get[i] - use[i];
if (num >= money) {
ans = i + 1;
break;
}
}
if (ans != -1) {
cout << ans << endl;
}else{
cout << "NA" << endl;
}
}
return 0;
} |
#include<iostream>
int l, m, n, money = 0, month;
int main(){
while(true){
std::cin >> l;
if(!l)
return 0;
for(int i=0; i<12; i++){
std::cin >> m >> n;
money += m-n;
if(money >= l && !month)
month = i+1;
}
if(!month)
std::cout << "NA" << std::endl;
else
std::cout << month << std::endl;
money = 0;
month = 0;
}
} |
#include <iostream>
using namespace std;
int main(){
int L;
while(cin >> L, L){
int N, M;
int sum = 0, ans = -1;
for(int y = 1; y <= 12; y++){
cin >> N >> M;
sum += N - M;
if(ans != -1){
continue;
}
if(sum >= L){
ans = y;
}
}
if(ans == -1){
cout << "NA\n";
}
else{
cout << ans << endl;
}
}
} |
#include <iostream>
using namespace std;
int main(int argc, char const* argv[])
{
int L,N,M;
int sum;
int answer;
while( cin >> L && L != 0 ){
sum = 0;
answer = 0;
for( int i = 0;i < 12;i++ ){
cin >> M >> N;
sum += M - N;
if( sum >= L && answer == 0 ) answer = i + 1;
}
if( answer != 0 ) cout << answer << endl;
else cout << "NA" << endl;
}
return 0;
} |
#include<iostream>
using namespace std;
int main(void)
{
int M[12] = {0};
int N[12] = {0};
int L = 0;
while (true)
{
int ans = 0;
cin >> L;
if (L == 0) { return 0; }
int i = 0;
for (i = 0; i < 12; i++)
{
cin >> M[i] >> N[i];
}
for (i = 0; i < 12; i++)
{
if (L <= 0)
{
break;
}
ans++;
L = L + N[i] - M[i];
}
if (i == 12 && L > 0)
{
cout << "NA" << endl;
continue;
}
cout << ans << endl;
}
return 0;
} |
#include <iostream>
using namespace std;
int main(){
int l,m,n;
while( cin >> l,l ){
int s = 0;
int ans;
int f = 1;
for(int i = 1 ; i <= 12 ; i++ ){
cin >> m >> n;
s += (m - n);
if(s >= l && f == 1){ans = i;f = 0;}
}
if(f == 1)cout << "NA" << endl;
else cout << ans << endl;
}
return 0;
} |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int L;
int M[12],N[12];
while( cin >> L , L ){
int sum = 0, ans = 13;
for(int i=0 ; i<12 ; ++i ){
cin >> M[i] >> N[i] ;
sum += (M[i]-N[i]);
if( sum >= L ){
ans = min(ans,i+1);
}
}
((ans==13)? cout << "NA" : cout << ans ) << endl;
}
} |
#include<iostream>
using namespace std;
#define M 12
int main(){
int cost,m,n;
int sum;
int st;
while(1){
sum=0;
st=0;
cin >>cost;
if(cost==0) break;
for(int i=1;i<=M;i++){
cin >>m>>n;
if(sum<cost){
sum+=(m-n);
if(sum>=cost)st=i;
}
}
if(st!=0)cout <<st<<endl;
else cout <<"NA"<<endl;
}
return 0;
} |
#include <iostream>
using namespace std;
int main()
{
int L;
while (cin >> L) {
if (L == 0)
break;
int money = 0, ans = -1;
for (int i = 0; i < 12; ++i) {
int M, N;
cin >> M >> N;
money += M - N;
if (money >= L && ans == -1)
ans = i+1;
}
if (ans == -1)
cout << "NA" << endl;
else
cout << ans << endl;
}
return 0;
} |
#include <stdio.h>
#define MONTHS 12
int main(void){
int l;
int m, n, ok;
while (scanf("%d", &l), l){
ok = -1;
for (int i=1; i<=MONTHS; i++){
scanf("%d%d",&m,&n);
l -= (m-n);
if (ok<0 && l<=0) ok = i;
}
if (ok==-1) puts("NA");
else printf("%d\n", ok);
}
return 0;
} |
#include <iostream>
using namespace std;
int main()
{
int M,N,L;
while(1)
{
int sum = 0;
int count = 0;
int ans;
cin >> L;
if(L == 0)
{
break;
}
for(int i = 1; i <= 12; i++)
{
cin >> M >> N ;
sum += M - N;
if(sum >= L && count < 1)
{
count++;
ans = i;
}
}
if(sum >= L && count < 2)
{
cout << ans << endl;
}
else
{
cout << "NA" << endl;
}
}
return 0;
} |
#include<iostream>
using namespace std;
int main(){
int l,i;
int m,n,sum,flg;
while(1){
cin>>l;
sum=flg=0;
if(l==0) break;
for(i=1;i<=12;i++) {
cin>>m>>n;
sum+=m-n;
if(sum>=l && flg==0) flg=i;
}
if(sum<l) cout<<"NA"<<endl;
else if(flg!=0)cout<<flg<<endl;
}
return 0;
} |
#include<iostream>
using namespace std;
int main(){
int l,i,sum=0,flag,m,n;
cin >>l;
while(l!=0){
sum=0;flag=-1;
for(i=0;i<12;i++){
cin >> m >> n;
sum+=m-n;
if(flag==-1&&sum>=l){
flag=i+1;
}
}
if(flag!=-1){
cout << flag<<endl;
}else{
cout << "NA"<<endl;
}
cin >>l;
}
}
|
#include <iostream>
using namespace std;
typedef long long ll;
int main(){
while(1){
ll L;
cin >> L;
if(L==0) break;
bool first=true;
ll sum=0;
for(int i=0;i<12;i++){
ll M, N;
cin >> M >> N;
sum+=M-N;
if(first && sum>=L){
first=false;
cout << i+1 << endl;
}
}
if(first) cout << "NA" << endl;
}
return 0;
} |
#include<iostream>
#include<vector>
using namespace std;
int main() {
while (1) {
int a;
cin >> a;
if (a == 0)break;
vector<int>s(12);
for (int b = 0; b < 12; b++) {
int c, d;
cin >> c >> d;
s[b] = c - d;
if (a <= 0) {
cout << b + 1 << endl; break;
}
}
for (int f = 0; f < 12; f++) {
a -= s[f];
if (a <= 0) { cout << f + 1 << endl; break; }
if (f == 11) { cout << "NA" << endl; break; }
}
}
} |
#include<iostream>
using namespace std;
#define ll long long
int main()
{
ll l,m,n;
while(cin >>l)
{
if(l==0)break;
int ans = 0;
for(int i=1;i<13;i++)
{
cin >> m >> n;
l -= (m-n);
if(l<=0 && ans ==0)
ans = i;
}
if(ans!=0)cout << ans << endl;
else cout << "NA" <<endl;
}
return 0;
} |
#include <iostream>
using namespace std;
int main()
{
int l, m, n, tmp, tmp2;
while(1){
cin >> l;
if(l == 0){
break;
}
tmp = tmp2 = 0;
for(int i = 1, f = 0; i <= 12; i++){
cin >> m >> n;
tmp += (m-n);
if(tmp >= l && f == 0){
tmp2 = i;
f = 1;
} else if(tmp < l && f == 1){
tmp2 = 0;
f = 0;
}
}
if(tmp2 == 0){
cout << "NA" << endl;
} else {
cout << tmp2 << endl;
}
}
return 0;
} |
#include <iostream>
using namespace std;
int main()
{
int L;
while (cin >> L, L) {
int M, N;
int ans = 0;
for (int i = 0; i < 12; i++) {
cin >> M >> N;
L -= (M - N);
if (L <= 0 && ans == 0)
ans = i + 1;
}
if (ans == 0)
cout << "NA" << endl;
else
cout << ans << endl;
}
return 0;
} |
#include <iostream>
using namespace std;
int main(int argc, char* argv[])
{
while(1) {
bool isfirst = true;
int M, N, L, S = 0;
cin >> L;
if( L == 0 )
break;
for( int i = 0; i < 12; i++ ) {
cin >> M >> N;
S += M - N;
if( L <= S && isfirst ) {
cout << i+1 << endl;
isfirst = false;
}
}
if( isfirst ) {
cout << "NA" << endl;
}
NEXT:;
}
return 0;
} |
#include <cstdio>
int main() {
int L, M, N;
while (scanf("%d", &L)) {
if (L == 0) break;
int res = 0;
bool flag = true;
for (int i=0; i<12; i++) {
scanf("%d%d", &M, &N);
L -= (M - N);
if (flag) {
res++;
}
if (L <= 0) flag = false;
}
if (res == 12 && L > 0) {
printf("NA\n");
} else {
printf("%d\n", res);
}
}
} |
#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 l,m,n;
int main(){
while(cin>>l){
if(!l)return 0;
int s=0,mo=0;
while(mo<12&&s<l){
cin>>m>>n;
s+=m-n;
mo++;
}
if(s>=l)cout<<mo<<endl;
else cout<<"NA"<<endl;
if(mo<12)for(int i=mo;i<12;i++)cin>>m>>n;
}
} |
#include <iostream>
using namespace std;
int main(){
long long int price,a,b,n,month;
bool judge;
while(cin >> n && n){
price = 0;
judge = false;
for(int i = 0;i< 12 ;i++){
cin >> a >> b;
price += (a-b);
if(price >= n && judge == false) {
month = i + 1;
judge = true;
}
}
if(judge == true) cout << month << endl;
else cout << "NA" << endl;
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]){
int l, m, n;
while(std::cin >> l, l){
int sum = 0, ans = 1e9;
for (int i = 0; i < 12; i++) {
std::cin >> m >> n;
sum += m - n;
if(sum >= l && ans == 1e9)ans = i + 1;
}
if(ans == 1e9) std::cout << "NA" << std::endl;
else std::cout << ans << std::endl;
}
return 0;
} |
#include <iostream>
using namespace std;
int main(){
int l,m,n;
int k[12];
while(cin >> l){
if(l==0)
break;
for(int i=0;i<12;i++){
cin >> m >> n;
k[i]=m-n;
}
for(int i=0;i<12;i++){
l -= k[i];
if(l<=0){
cout << i+1 << endl;
break;
}
}
if(l>0)
cout << "NA" << endl;
}
} |
#include <iostream>
using namespace std;
int main()
{
int l, m, n, mu, f;
while (cin >> l, l){
mu = f = 0;
for (int i = 0; i < 12; i++){
cin >> m >> n;
l -= (m - n);
if (l <= 0 && f == 0){
mu = i + 1;
f = 1;
}
}
if (mu != 0) cout << mu << endl;
else cout << "NA" << endl;
}
return (0);
} |
#include <iostream>
using namespace std;
int main(void) {
while(1) {
int L, mt = 0;
int gL = 0;
cin >> L;
if( L == 0 ) break;
for(int i = 0; i < 12; i++) {
int n, m;
cin >> n >> m;
gL += n - m;
if(gL >= L && mt == 0) {
mt = i + 1;
}
}
if(mt == 0) {
cout << "NA" << endl;
} else {
cout << mt << endl;
}
}
} |
#include <cstdio>
#define REP(a, n) for (int i = (a); i < n; i++)
using namespace std;
int main()
{
int l, m, n;
while (scanf("%d", &l), l != 0){
int sum = 0, month = 1;
bool flag = true;
REP(0, 12){
scanf("%d%d", &m, &n);
sum += m - n;
if (sum >= l) flag = false;
if (flag) month++;
}
if (month <= 12) printf("%d\n", month);
else printf("NA\n");
}
return (0);
} |
#include <iostream>
using namespace std;
int hoge(int *L){ cin >> *L; return *L;}
int main(){
int L,M,N;
while(hoge(&L)){
int j=0;
for(int i=0;i<12;i++){
if(L>0) j++;
cin >> M >> N;
L -= M-N;
}
if(L>0) cout << "NA" << endl;
else cout << j << endl;
}
return 0;
} |
#include <iostream>
#define MAX 100000000
using namespace std;
int main(void){
int L;
while( cin >> L , L ){
int M,N;
int ans = 0;
for( int i = 1 ; i <= 12 ; i++ ){
cin >> M >> N;
L -= ( M - N );
if( L <= 0 ){
ans = i;
L = MAX;
}
}
if( ans ) cout << ans << endl;
else cout << "NA" << endl;
}
return 0;
} |
#include<cstdio>
int main()
{
int l,c=0,t=0,m,n;
while(1){
scanf("%d",&l);
if(l==0)break;
for(int i=0;i<12;i++){
scanf("%d %d",&m,&n);
t+=m-n;
c++;
if(t>=l)c--;
}
if(t>=l)printf("%d\n",c+1);
else
printf("NA\n");
t=c=0;
}
return 0;
} |
#include <iostream>
using namespace std;
bool solve() {
int L;
cin >> L;
if (!L) {
return false;
}
int s = 0;
int ans = -1;
for (int i = 1; i <= 12; ++i) {
int m, n;
cin >> m >> n;
if (ans != -1) {
continue;
}
s += m - n;
if (s >= L) {
ans = i;
}
}
if (ans > 0) {
cout << ans << endl;
} else {
cout << "NA" << endl;
}
return true;
}
int main() {
while (solve()) {}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int L;
while(cin>>L,L!=0){
int chokin=0,month=0;
for(int i=1;i<=12;i++){
int syuueki,syouhi;
cin>>syuueki>>syouhi;
chokin+=(syuueki-syouhi);
if(month!=0)
continue;
if(chokin>=L)
month=i;
}
if(month==0)
cout<<"NA"<<endl;
else
cout<<month<<endl;
}
return 0;
} |
#include <iostream>
using namespace std;
int main(){
int n;
while(cin >> n,n){
int sum = 0,mon = -1;
for(int i = 0;i < 12;i++){
int a,b;
cin >> a >> b;
sum += a - b;
if(n <= sum && mon == -1) mon = i;
}
if(mon == -1) cout << "NA" << endl;
else cout << mon + 1 << endl;
}
return 0;
} |
#include<iostream>
using namespace std;
int main() {
int l;
while (cin >> l, l) {
int a[12][2];
for (int i = 0;i < 12;i++) {cin >> a[i][0] >> a[i][1];}
int c = 0;
int m = 0;
int flg = 1;
for (int i = 0;i < 12;i++) {
c += a[i][0] - a[i][1];
m++;
if (c >= l) {
flg = 0;
break;
}
}
if (flg == 1)cout << "NA" << endl;
else cout << m << endl;
}
return 0;
} |
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int main(void){
int l;
while(cin >> l && l){
int a=0;
for(int i = 1; i <= 12; i++){
int n,m;
cin >> n >> m;
if(!a) l -= n-m;
if(!a && l <=0) a = i;
}
if(l > 0) cout << "NA" << endl;
else cout << a << endl;
}
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int m,n,l,day,sum;
while(1){
cin>>l;
if(l==0)break;
day=0;
sum=0;
for(int i=0;i<12;i++){
cin>>m>>n;
if(day!=0)continue;
sum+=m-n;
if(sum>=l){
day=i+1;
}
}
if(day!=0){
cout<<day<<endl;
}
else{
cout<<"NA"<<endl;
}
}
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int L, M, N;
while( cin >> L, L ) {
bool flag = false;
for(int i=0; i<12; i++) {
cin >> M >> N;
L -= M - N;
if( L <= 0 && !flag ) {
cout << i+1 << endl;
flag = true;
}
}
if( !flag ) cout << "NA" << endl;
}
} |
#include <iostream>
#include <sstream>
using namespace std;
int main(){
int i;
string month;
long int cost,sum,income,outcome;
while(cin >> cost && cost != 0){
// cout << cost;
int sum = 0;
bool flag = 1;
for(i=0;i<12;i++){
cin >> income >> outcome;
sum += income - outcome;
if(sum >= cost && flag){
stringstream tuki;
tuki << i+1;
month = tuki.str();
flag = !flag;
}
}
if(flag) month = "NA";
cout << month << endl;
}
} |
#include<iostream>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
int l,m,n,s,a;
while(cin>>l,l){
s=0,a=1;
rep(i,12){
cin>>m>>n; s+=m-n;
if(s<l)a++;
}
if(a<=12)cout<<a<<endl;
else cout<<"NA"<<endl;
}
return 0;
} |
#include<stdio.h>
int main(){
int l,m,n,i,j;
while(0<=scanf("%d",&l)){
if(l==0) break;
j=-1;
for(i=0;i<12;i++){
scanf("%d%d",&m,&n);
l-=(m-n);
if(j==-1 && l<=0) j=i;
}
if(j!=-1){
printf("%d\n",j+1);
continue;
}
printf("NA\n");
}
return 0;
} |
#include <iostream>
using namespace std;
int main() {
for (;;) {
int L, M[12], N[12];
cin >> L;
if (!L) return 0;
int r = 0;
for (int i = 0; i < 12; i++)
cin >> M[i] >> N[i];
for (int i = 0; i < 12; i++) {
r += M[i] - N[i];
if (r >= L) {
cout << i + 1 << endl;
break;
}
}
if (r < L)
cout << "NA" << endl;
}
} |
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<functional>
using namespace std;
int main(void)
{
int i,j,sum,m,n,nn,x;
while(1) {
scanf("%d",&nn);
if(nn==0) break;
sum=0;
x=1;
for(i=1;i<=12;i++) {
scanf("%d %d",&m,&n);
sum+=m-n;
if(sum<nn) x++;
}
if(sum>=nn) printf("%d\n",x);
if(sum<nn) printf("NA\n");
}
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
long long int l, m, n;
long long int savingMoney;
bool output = true;
while(cin >> l, l){
savingMoney = 0;
output = true;
for(int i=1; i <= 12; i++){
cin >> m >> n;
savingMoney += m - n;
if(l <= savingMoney && output){
cout << i << endl;
output = false;
}
if(i == 12 && savingMoney < l){
cout << "NA" << endl;
}
}
}
} |
#include <cstdio>
#include <iostream>
using namespace std;
int main()
{
int L, M, N;
while (scanf("%d", &L), L){
int sum = 0, reach;
bool check = true;
for (int i = 0; i < 12; i++){
scanf("%d%d", &M, &N);
sum += M - N;
if (check && sum >= L){
reach = i + 1;
check = false;
}
}
if (!check){
printf("%d\n", reach);
}
else {
printf("NA\n");
}
}
return (0);
} |
#include<iostream>
#include<algorithm>
#define MONTH 12
using namespace std;
int main() {
long l;
while (cin >> l){
if (l == 0)break;
int n = 13;
long sum = 0;
for (int i = 0; i < MONTH; i++){
long long a, b; cin >> a >> b;
sum += a - b;
if (sum >= l){
n = min(n, i + 1);
}
}
if (n == 13){
cout << "NA";
}
else cout << n;
cout << endl;
}
return 0;
} |
#include <iostream>
using namespace std;
int main()
{
int l;
int m,n;
int a[12];
while(true){
int num = 0;
cin >> l;
if(l==0)
break;
for(int i=0 ;i<12 ;i++){
cin >> m >> n;
num = num+(m - n);
a[i] = num;
}
for(int i=0 ;i<12 ;i++){
if(a[i] >= l){
cout << i+1 << endl;
break;
}
else if(i==11){
cout << "NA" << endl;
}
}
}
return 0;
} |
#include<stdio.h>
int main(void){
int L,M,N,k[12],i,kai;
while(0==0){
scanf("%d",&L);
if(L==0) break;
kai=0;
for(i=1;i<13;i++){
scanf("%d %d\n",&M,&N);
k[i]=M-N;
}
for(i=1;i<13;i++){
L-=k[i];
if(L<=0){
kai=i;
break;
}
}
if(kai==0) printf("NA\n");
else printf("%d\n",kai);
}
return 0;
} |
#include <iostream>
using namespace std;
int main() {
int L,M,N;
int sum,ans;
while(cin >> L) {
if(L==0) break;
sum=0;
bool r = true;
for(int i=0;i<12;i++) {
cin >> M >> N;
sum += M-N;
if(sum >= L && r) {
ans = i+1;
r = false;
}
}
if(!r)
cout << ans << endl;
else
cout << "NA" << endl;
}
} |
#include <cstdio>
using namespace std;
int main()
{
int plan;
while (scanf("%d", &plan) && plan){
int rec = 0;
bool flag = false;
for (int i = 0; i < 12; i++){
int n, m;
scanf("%d %d",&m, &n);
rec += (m - n);
if (flag == false && rec >= plan){
printf("%d\n", i + 1);
flag = true;
}
}
if (flag == false){
printf("NA\n");
}
}
return (0);
} |
#include<iostream>
using namespace std;
int a[12],b[12],c;
int main()
{
while(cin>>c,c)
{
for(int i=0;i<12;i++)cin>>a[i]>>b[i];
bool f=1;
for(int i=0;i<12;i++)
{
c-=a[i]-b[i];
if(c<=0)
{
cout<<i+1<<endl;
f=0;
break;
}
}
if(f)cout<<"NA"<<endl;
}
}
|
#include<iostream>
using namespace std;
int main(){
int M, N, L;
int c = 0;
while(1){
cin >> L;
if(L == 0) break;
for (int i = 0; i < 12; i++){
cin >> M >> N;
if(L <= 0) continue;
L -= M - N;
c++;
}
if(L > 0) cout << "NA" << endl;
else cout << c << endl;
c = 0;
}
return 0;
} |
#include <iostream>
using namespace std;
int main(){
int shotoku[12];
int l,m,n;
int i,total;
while(cin>>l,l){
for(i=0;i<12;i++){
cin>>m>>n;
shotoku[i]=m-n;
}
total=0;
for(i=0;i<12;i++){
total+=shotoku[i];
if(l<=total){
cout<<i+1;
break;
}
}
if(i==12) cout<<"NA";
cout<<endl;
}
return 0;
} |
// 0206
#include <iostream>
using namespace std;
int main(){
while(1){
int L, M, N, ans = 0;
cin>>L;
if(L == 0)
break;
for(int i=1;i<=12;i++){
cin>>M>>N;
L -= M-N;
if((L <= 0) && (ans == 0))
ans = i;
}
if(ans == 0)
cout<<"NA"<<endl;
else
cout<<ans<<endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int L, M, N;
while (cin >> L, L) {
int sum = 0, j = -1;
for (int i = 0; i < 12; i++) {
cin >> M >> N;
sum += (M - N);
if (j == -1 && sum >= L) {
j = i;
}
}
if (j >= 0) {
cout << j+1 << endl;
} else {
cout << "NA" << endl;
}
}
return 0;
} |
#include <iostream>
using namespace std;
int main() {
int L, m, n, brk, i, j;
while (cin >> L && L) {
brk = -1;
for (i=1; i<13; i++) {
cin >> m >> n;
L -= m - n;
if (L <= 0 && brk == -1) {
brk = i;
}
}
if (brk == -1) {
cout << "NA" << endl;
} else {
cout << brk << endl;
}
}
return 0;
} |
#include <iostream>
using namespace std;
int main(void) {
int L, M, N;
while(cin >> L, L) {
int sum = 0;
bool flag = true;
for(int i = 0; i < 12; i++) {
cin >> M >> N;
sum += M - N;
if(sum >= L && flag) {
cout << i + 1 << endl;
flag = false;
}
}
if(flag)
cout << "NA" << endl;
}
} |
#include<iostream>
using namespace std;
int main() {
int L,M,N,a;
while(cin>>L, L) {
a = 0;
for(int i=1; i<=12; ++i) {
cin>>M>>N;
L -= (M-N);
if(L <= 0 && a == 0)
a = i;
}
if(a == 0)
cout<<"NA"<<endl;
else
cout<<a<<endl;
}
} |
#include <iostream>
using namespace std;
int main () {
int L;
while (cin >> L, L) {
int sum = 0, mon = 0;
for (int i = 1; i <= 12; ++i) {
int M, N;
cin >> M >> N;
if (!mon && (sum += M - N) >= L) mon = i;
}
if (mon) cout << mon << endl;
else cout << "NA" << endl;
}
} |
#include <iostream>
using namespace std;
int main() {
// your code goes here
int n,m,s,sum;
while(cin >> n && n!=0){
sum=0;
int i;
for(i=0;i<12;i++){
cin >> m >> s;
sum+=m-s;
if(sum>=n){
cout << i+1 << endl;
break;
}
}
for(i=i+1;i<12;i++)
cin >> m >> s;
if(sum<n)
cout << "NA" << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int L;
while(cin >> L && L)
{
int n,m;
int flag=0;
for(int i=0;i<12;i++)
{
cin >> n >> m;
L-=(n-m);
if(L<=0 && !flag)
{
flag=1;
cout << i+1 << endl;
}
}
if(L>0)cout << "NA" << endl;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define for_(i,a,b) for(int i=(a);i<(b);++i)
int main() {
int L;
while (cin >> L, L) {
int sum = 0, ans = -1;
for_(i,0,12) {
int M, N;
cin >> M >> N;
sum += (M - N);
if (sum >= L && ans == -1) ans = i + 1;
}
if (ans == -1) puts("NA");
else cout << ans << endl;
}
} |
#include<iostream>
using namespace std;
int main() {
int a, ans,moku, b, tyokin;
while (1) {
cin >> moku;
if (moku == 0) {
goto a;
}
tyokin = 0;
ans = 0;
for (int i = 1; i <= 12; i++) {
cin >> a >> b;
tyokin += a - b;
if (moku <= tyokin) {
ans = i;
tyokin = -99999999;
}
}
if (ans == 0) {
cout << "NA" << endl;
}
else {
cout << ans << endl;
}
}
a:;
}
|
#include <iostream>
using namespace std;
int main()
{
int l;
while (cin >> l && l != 0){
int m, n, a = 0;
for (int i = 1; i <= 12; i++){
cin >> m >> n;
l = l - m + n;
if (l > 0){
a = i;
}
}
if (a == 12){
cout << "NA" << endl;
continue;
}
cout << a + 1 << endl;
}
} |
#include<iostream>
using namespace std;
int main()
{
int l;
while (cin >> l&&l) {
int m[12] = {};
int n[12] = {};
int cho = 0;
int tuki = 0;
for (int i = 0; i < 12;i++) {
cin >> m[i] >> n[i];
}
for (int i = 0; i < 12; i++) {
cho += m[i] - n[i];
if (cho >= l) {
tuki = i+1;
break;
}
}
if (tuki == 0) {
cout << "NA" << endl;
}
else {
cout << tuki << endl;
}
}
return 0;
} |
#include <iostream>
#include <set>
#include <map>
using namespace std;
int main() {
int l;
while(cin >> l && l){
int n, m, sum = 0;
bool flag = false;
for(int i = 0; i < 12; ++i){
cin >> m >> n;
sum += (m - n);
if(sum >= l && !flag){
cout << i + 1 << endl;
flag = true;
}
}
if(!flag)
cout << "NA" << endl;
}
return 0;
} |
#include<iostream>
using namespace std;
int main()
{
int l, m, n, ans, t;
while(1)
{
t = 0;
ans = -1;
cin >> l;
if(l == 0)
break;
for(int i = 0; i < 12; i++)
{
cin >> m >> n;
t += m - n;
if(t >= l && ans == -1)
ans = i + 1;
}
if(ans == -1)
cout << "NA\n";
else
cout << ans << endl;
}
} |
#include <iostream>
using namespace std;
int main(void){
int i,L,M,N,bank=0,min=99;
while(1){
min = 99;
bank = 0;
cin >> L;
if(L == 0) break;
for(i = 1; i <= 12; i++){
cin >> M >> N;
bank += M - N;
if(bank >= L){
if(i < min) min = i;
}
}
if(bank >= L) cout << min << endl;
else cout << "NA" << endl;
}
return 0;
} |
#include<iostream>
using namespace std;
int main()
{
int n;
int M,N;
int i,j;
int ans;
for(;cin >> n;)
{
if(n==0)
break;
ans=0;
for(i=0;i<12;i++)
{
cin >> M >> N ;
n-=M-N;
if(ans==0 && n<=0)
ans=i+1;
}
if(ans!=0)
cout << ans <<endl;
else
cout << "NA" << endl;
}
} |
#include <cstdio>
using namespace std;
int main(void){
int m, n, s, l, ans, i;
while(1){
scanf("%d",&l);
if(l == 0){
break;
}
s = ans = 0;
for(i = 1;i <= 12;i++){
scanf("%d%d",&m,&n);
s += m - n;
if(ans == 0 && s >= l){
ans = i;
}
}
if(ans != 0){
printf("%d\n",ans);
}else{
printf("NA\n");
}
}
return 0;
} |
#include <stdio.h>
int main(){
while(1){
int n;
scanf("%d", &n);
if(n==0) break;
int v = 0;
int t,u;
int flag = 1;
for(int i=0;i<12;i++){
scanf("%d%d", &t, &u);
v += (t-u);
//printf("%d - %d = %d \n", t,u,v);
if(v>=n&&flag){
printf("%d\n", i+1);
flag = 0;
}
}
if(flag) puts("NA");
}
} |
// 2010/12/21 Tazoe
#include <iostream>
using namespace std;
int main()
{
while(true){
int L;
cin >> L;
if(L==0)
break;
int M[12], N[12];
for(int i=0; i<12; i++)
cin >> M[i] >> N[i];
int chochiku = 0;
int getsusuu = 0;
for(int i=0; i<12; i++){
chochiku += (M[i]-N[i]);
if(chochiku>=L){
getsusuu = i+1;
break;
}
}
if(getsusuu!=0)
cout << getsusuu << endl;
else
cout << "NA" << endl;
}
return 0;
} |
#include <iostream>
using namespace std;
int main() {
int l;
int m,n;
int saving;
int success;
while(cin >> l) {
if(l==0) break;
saving=0;
success=0;
for(int i=0;i<12;i++) {
cin >> m >> n;
saving+=m-n;
if(saving>=l) {
if(success==0) success=i+1;
}
}
if(success>0) cout << success << endl;
else cout << "NA" << endl;
}
return 0;
} |
#include <iostream>
#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
using namespace std;
int main(){
int n,a[12],b[12];
while(cin >> n, n) {
int m = 0;
rep(i,12) {
cin >> a[i] >> b[i];
}
rep(i,12) {
m += a[i]-b[i];
if(m>=n) {
cout << i+1 << endl;
break;
}
}
if(m<n) cout << "NA" << endl;
}
} |
#include <iostream>
using namespace std;
int main()
{
int L;
while( cin >> L && L ){
int M, N;
int deposit = 0;
int month = 0;
for( int i = 0; i < 12; ++i ){
cin >> M >> N;
deposit += M - N;
if( !month && L <= deposit ){
month = i + 1;
}
}
if( !month ){
cout << "NA" << endl;
}else{
cout << month << endl;
}
}
return 0;
} |
#include <iostream>
using namespace std;
#define NA 13
int main(void){
int L;
while(true){
cin>>L;
if(L==0){break;}
int money=0;
int retval=NA;
int M,N;
for(int month=1;month<=12;month++){
cin>>M>>N;
money+=M-N;
if(money>=L){
retval=min(retval,month);
}
}
if(retval==NA){
cout<<"NA"<<endl;
}
else{
cout<<retval<<endl;
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(void)
{
int M[12];
int N[12];
int L;
while(cin >> L){
if(!L) break;
for(int i=0; i<12; i++){
cin >> M[i] >> N[i];
}
int month = 0;
int sum=0;
for(;month<12; month++){
sum+=M[month]-N[month];
if(sum>=L) break;
}
if(month!=12) cout << month + 1 << endl;
else cout << "NA" << endl;
}
return 0;
} |
#include<stdio.h>
int main(){
while(1){
int to=0,ans=-1;
bool f=true;
int e;
scanf("%d",&e);
if(e==0)return 0;
for(int i=0;i<12;i++){
int a,b;
scanf("%d %d",&a,&b);
if(f)to+=a-b;
if(f&&to>=e){
ans=i+1;
f=false;
}
}
if(ans==-1)printf("NA\n");
else printf("%d\n",ans);
}
} |
#include<bits/stdc++.h>
using namespace std;
int main() {
int L, M, N;
while( cin >> L && L ) {
int t = 0, S = 0;
for ( int i = 1; i <= 12; i++ ) {
cin >> M >> N;
S += M - N;
if ( S >= L && t == 0 ) t = i;
}
if ( S < L ) cout << "NA" << endl;
else cout << t << endl;
}
} |
#include <iostream>
#include <string>
#include <algorithm>
#include <map>
using namespace std;
int main(){
int l,m,n;
while(cin>>l){
int flag=0;
if(l==0)break;
for(int i=1;i<=12;i++){
cin>>m>>n;
l=l-(m-n);
if(l<=0&&flag==0){
cout<<i<<endl;
flag=1;
}
}
if(flag==0)cout<<"NA"<<endl;
}
return 0;
} |
#include<iostream>
#include<string>
using namespace std;
int main(){
int n,m,l,a,b;
while(true){
cin>>l;
if(l==0)
break;
a=0;
b=0;
for(int i=1;i<=12;i++){
cin>>m>>n;
a+=m-n;
if(a>=l&&b==0)
b=i;
}
if(b==0)
cout<<"NA"<<endl;
else
cout<<b<<endl;
}
return 0;
}
|
#include<iostream>
using namespace std;
int main(){
int M,N,L;
int ans;
while(1){
cin>>L;
ans=1;
if(L==0)break;
for(int i=0;i<12;i++){
cin>>M>>N;
L=L-(M-N);
if(L>0) ans++;
}
if(L>0)cout<<"NA"<<endl;
else cout<<ans<<endl;
}
return 0;
} |
#include<vector>
#include<list>
#include<algorithm>
#include<iostream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
int main(){
int i,j;
int l,m,n;
while(cin>>l&&l){
for(i=0;i<12;i++){
cin>>m>>n;
l-=m-n;
if(l<=0)
break;
}
for(j=i+1;j<12;j++)
cin>>m>>n;
if(i==12)
cout<<"NA"<<endl;
else
cout<<i+1<<endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,a,b;
while(cin>>n,n){
int q=12,o=1;
while(q--){
cin>>a>>b;
n-=a-b;
if(o&&n<=0){
cout<<12-q<<endl;
o--;
}
}
if(o)cout<<"NA"<<endl;
}
} |
#include <iostream>
using namespace std;
int main(void){
for(int cost; cin >> cost, cost;){
int result = 0;
for(int i = 1, in, out; i <= 12; i ++){
cin >> in >> out;
cost -= (in - out);
if(cost <= 0 && !result) result = i;
}
if(!result) cout << "NA" << endl;
else cout << result << endl;
}
return 0;
} |
#include <cstdio>
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main()
{
int m, n, l, s, f, res;
while (true) {
scanf("%d", &l); if (l == 0) break;
s = f = 0;
rep(i, 12) {
scanf("%d%d", &m, &n);
s += (m - n);
if (!f && s >= l) { res = i+1; f = 1; }
}
if (!f) puts("NA"); else printf("%d\n", res);
}
return 0;
} |
#include<iostream>
using namespace std;
int main()
{
int L,i,count;
int M,N;
while(cin>>L,L){
count = 0;
for(i=0;i<12;i++){
cin>>M>>N;
L -= (M-N);
if(L<=0 && !count)count=i+1;
}
if(L<=0)cout<<count<<endl;
else cout<<"NA"<<endl;
}
return 0;
} |
#include <cstdio>
int n;
int main(){
while(scanf("%d", &n),n){
int in, out, month = 0;
bool ok = true;
for(int i = 0; i < 12; i++){
scanf("%d%d", &in, &out);
n -= in-out;
if(n <= 0 && month == 0) month = i+1;
}
if(n <= 0) printf("%d\n", month);
else printf("NA\n");
}
} |
#include<iostream>
using namespace std;
int main(){
int L, Gain[12], Consume[12], i, saving, month;
while(cin >> L, L){
for(i=0; i<12; i++){
cin >> Gain[i] >> Consume[i];
}
saving = 0;
month = 0;
for(i=0; i<12; i++){
if(saving < L){
month += 1;
}
saving += Gain[i] - Consume[i];
}
if(month<=12 && saving >= L){
cout << month << endl;
}else{
cout << "NA" << endl;
}
}
} |
#include <iostream>
using namespace std;
int main()
{
int l = 0, m = 0, n = 0, cash = 0, ans = 0;
cin >> l;
while (l){
for (int i = 1; i <= 12; i++){
cin >> m >> n;
cash += m - n;
if (cash >= l){
ans = i;
break;
}
}
if (ans){
for (int i = ans + 1; i <= 12; i++){
cin >> m >> n;
}
cout << ans << endl;
} else{
cout << "NA" << endl;
}
m = n = cash = ans = 0;
cin >> l;
}
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int l, m, n, sum, month;
while(cin >> l, l){
sum = month = 0;
for(int i = 1; i <= 12; ++i){
cin >> m >> n;
sum += (m - n);
if(sum >= l && month == 0) month = i;
}
if(month)cout << month << endl;
else cout << "NA" << endl;
}
return 0;
} |
#include <iostream>
using namespace std;
int main(){
int l, m, n;
while(cin >> l, l){
int ans = -1;
for(int i = 0; i < 12; i++){
int m, n;
cin >> m >> n;
if(ans != -1) continue;
l -= m - n;
if(l <= 0){
ans = i + 1;
}
}
if(ans == -1){
cout << "NA\n";
}
else{
cout << ans << endl;
}
}
} |
#include <iostream>
#include <cstdio>
using namespace std;
int main(void) {
int L;
int M[12], N[12];
int cnt, sum;
int i;
while(1) {
sum = 0; cnt = 0;
cin >> L;
if(L == 0) break;
for(i = 0 ; i < 12 ; i++) {
cin >> M[i] >> N[i];
}
for(i = 0 ; i < 12 ; i++) {
sum += (M[i] - N[i]);
if(sum >= L) break;
//cout << sum << endl;
}
if(sum < L) cout << "NA" << endl;
else cout << i + 1 << endl;
}
return 0;
} |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
int L,M,N;
while(cin>>L&&L!=0){
int ac=-1;
int sum=0;
bool f=false;
for(int i = 0; i < 12; i++){
int a,b;
cin>>a>>b;
sum+=a-b;
if(sum>=L&&!f){
ac=i;
f=true;
}
}
if(ac!=-1)
cout<<ac+1<<endl;
else
cout<<"NA"<<endl;
}
return 0;
} |
#include<iostream>
using namespace std;
int main(void)
{
int L,m,n;
while(1){
int a =0;
int q =0;
cin >> L ;
if(L == 0) break;
else{
for(int i =1 ; i <= 12;++i){
cin >> m >> n;
a += m-n;
if(a >= L) ++q;
}
if(a < L) cout << "NA" << endl;
else if(a >= L) cout << 12-q+1 << endl;
}
}
return 0;
} |
#include<stdio.h>
int main(void){
while(1){
int l,m,n,r=0,cnt=0;
scanf("%d",&l);
if(l==0)return 0;
int i;
for(i=0;i<12;i++){
scanf("%d%d",&m,&n);
r+=(m-n);
if(r>=l&&cnt==0)cnt=i+1;
}
if(cnt!=0)printf("%d\n",cnt);
else printf("NA\n");
}
return 0;
} |
#include<bits/stdc++.h>
// Shrotening
#define fst first
#define snd second
#define pb push_back
// Loop
#define FOR(i,a,b) for(auto i=(a);i<(b);++i)
#define RFOR(i,a,b) for(auto i=(a);i>=(b);--i)
#define REP(i,a) for(long i=0;i<(a);++i)
#define RREP(i,a) for(long i=(a);i>=0;--i)
#define EACH(i,a) for(auto (i)=(a).begin(),_END=(a).end();i!=_END;++i)
#define REACH(i,a) for(auto (i)=(a).rbegin(),_END=(a).rend();i!=_END;++i)
//Algorithm
#define ALL(a) (a).begin(), a.end()
#define RALL(a) (a).rbegin(), a.rend()
#define EXIST(a,x) ((a).find(x)!=(a).end())
#define SORT(a) std::sort((a).begin(), (a).end())
#define UNIQUE(a) std::sort((a).begin(), a.end()), a.erase(std::unique((a).begin(), a.end()), a.end());
#define SUM(a) std::accumulate((a).begin(), (a).end(), 0);
//Setting
#define OPT std::cin.tie(0);std::ios::sync_with_stdio(false);
//debug message
bool debug = true;
#define MSG(s) if(debug){std::cout << s << std::endl;}
#define DEBUG(x) if(debug){std::cout << "debug(" << #x << "): " << x << std::endl;}
//alias
typedef long long LL;
typedef std::vector<char> VC;
typedef std::vector<int> VI;
typedef std::vector<long> VL;
typedef std::vector<long long> VLL;
typedef std::vector< VC > VC2;
typedef std::vector< VI > VI2;
typedef std::vector< VL > VL2;
typedef std::vector< VLL > VLL2;
typedef std::pair<int,int> PII;
typedef std::pair<int, PII> PIII;
int main() {
PIII p1, p2;
std::cin >> p1.fst >> p1.snd.fst >> p1.snd.snd >> p2.fst >> p2.snd.fst >> p2.snd.snd;
if(p1 < p2) std::swap(p1, p2);
int ans = p1.fst - p2.fst + (int)(p1.snd > p2.snd);
std::cout << ans << std::endl;
}
|
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
int a[3],b[3],p=0;
rep(i,3)cin>>a[i];
rep(i,3)cin>>b[i];
if(a[0]>b[0])rep(i,3)swap(a[i],b[i]);
else if(a[0]==b[0]&&a[1]>b[1])rep(i,3)swap(a[i],b[i]);
else if(a[0]==b[0]&&a[1]==b[1]&&a[2]>b[2])rep(i,3)swap(a[i],b[i]);
if(a[1]<b[1])p++;
if(a[1]==b[1]&&a[2]<b[2])p++;
cout<<b[0]-a[0]+p<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> mp;
ll inf = 1e9;
typedef pair<ll,mp> mmp;
int main(){
int y1,y2,m1,m2,d1,d2;
cin>>y1>>m1>>d1>>y2>>m2>>d2;
mmp a = mmp(y1,mp(m1,d1) );
mmp b = mmp(y2,mp(m2,d2) );
mmp m = min(a,b);
mmp M = max(a,b);
int dis = abs( y1-y2 );
if( M.second.first > m.second.first || (M.second.first==m.second.first && M.second.second > m.second.second) ){
cout<<dis + 1 <<endl;
}else{
cout<<dis<<endl;
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.