Remember: maximum accuracy can not be more than 10 in minus the secong degree.
Запомните: максимальная точность числа не больше 10 в -2 степени.

What is the test #11?Give,please......

//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("avx")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

#define re return
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define sqrt(x) sqrt(abs(x))
#define mp make_pair
#define pi (3.14159265358979323846264338327950288419716939937510)
#define fo(i, n) for(int i = 0; i < n; ++i)
#define ro(i, n) for(int i = n - 1; i >= 0; --i)
#define unique(v) v.resize(unique(all(v)) - v.begin())

template <class T> T abs (T x) { re x > 0 ? x : -x; }
template <class T> T sqr (T x) { re x * x; }
template <class T> T gcd (T a, T b) { re a ? gcd (b % a, a) : b; }
template <class T> int sgn (T x) { re x > 0 ? 1 : (x < 0 ? -1 : 0); }

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
typedef double D;
typedef long double ld;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef unsigned long long ull;
typedef tree <pair<int, char>, null_type, less<pair<int, char>>, rb_tree_tag, tree_order_statistics_node_update> _tree;

int main() {
    ll n, m, x;
    cin >> n >> m;
    n *= 3;
    fo(i, m) {
        cin >> x;
        n -= x;
        if (n < 0) {
            cout << "Free after " << i + 1 << " times.\n";
            re 0;
        }
    }
    cout << "Team.GOV!\n";
}

#include <iostream>
#include <cmath>
#include <iomanip>
#include <vector>
#include<algorithm>
using namespace std;
int main() {
    long long a, c, d, min, max, n, x;

    long double b, e, sum;
    cin >> a >> n;
    sum = 0;
    d = 0;
    vector<long long> z(n);
    for (long long i = 0; i < n ; ++i) {
        cin >> z[i];
    }
    for (long long i = 0; i < n; ++i) {

        b = z[i] / 3;
        sum = sum + b;
        d = d + 1;
        if (a < sum) {
            break;
        }

    }
    if (a > sum) {
        cout << "Team.GOV!" << endl;
    }
    else {
        cout << "Free after " << d << " times." << endl;
    }
    return 0;
}

Do not use "n/3" or "n div 3" or "input div 3" or "input/3".
Do not use any division.
while input n, n:=n*3 ;
and then you won't have to divide at 3 every input;
Sorry for bad english.If any questions please ask.

#include "stdio.h"
#include "stdlib.h"
#include<string.h>
int main()
{
    long int m,n,sum=0,a[3001];
    scanf("%ld %ld",&n,&m);
    for(int i=1;i<=m;i++)
    {
        scanf("%d",&a[i]);
    }
n=n*3;
    for(int i=1;i<=m;i++)
    {
        sum+=a[i];
        if(sum>=n)
        {
            printf("Free after %d times.",i);
            return 0;
        }
    }
    printf("Team.GOV!");

}

My code

#include <stdio.h>

int main()
{
    long long n, s;
    int m;
    scanf("%lld%d",&n,&m);
    n*=(long long)3;
    s=0;

    for(int i=0; i<m; i++)
    {
        int t;
        scanf("%d",&t);
        s+=t;
        if(s>n)
        {
            printf("Free after %d times.",i+1);
            return 0;
        }
    }
    printf("Team.GOV!");

    return 0;
}

Works fine on my machine under Linux (g++ 4.8.2).
On the OnlineJudge I get WA1 on g++ and AC on VC++ 2010.

I think something is wrong.

It's strange but for m=0 correct answer is "Team.GOV!".
(I think that the correct answer should be "Free after 0 times."

I have tried double but it does not work can anybody tell me why ???

If you have WA, you must use long long(or int64 in Pascal).And don't use sum/3>n,use sum>n*3.After that you have AC.
По русски.
Не используйте типы int(или integer). Используйте типы int64(или long long). При сравнение не сумма/3>выхода,а сумма>выход*3. Желаю всем красивых AC!

P.S. Sorry for bad English.

What is wrong with this test?

I have wrong answer in my 7th testcase!
can you tell me Why?

To pass this test you should use int64 or long long.Good luck!

what's wrong?
program t1688;
var
  h:array [1..3000] of int64;
  a,p:int64;
  n,m:int64;
  b,i,j:longint;
begin
  readln(a,b);
  for i:=1 to b do
    readln(h[i]);
  for i:=1 to b-1 do
    for j:=b downto i+1 do
    begin
      if h[i]>h[j] then
      begin
        p:=h[i];
        h[i]:=h[j];
        h[j]:=p;
      end;
    end;

  for i:=1 to b do
  begin
    m:=m+h[i];
    if a*3<m then inc(n);
  end;
  if n=0 then writeln('Team.GOV!')
  else writeln('Free after ',b-n,' times.');
end.



Edited by author 16.04.2010 11:37

What's wrong in my program? I can't find mistake. Anybody knows it?
#include<fstream>
#include<iostream>
#include<cstdio>
using namespace std;

    long n, m;
    __int64 x, y = 0, n1;

int main (){
    cin >> n >> m;
    n1 = 3*n;
    for (int i = 0; i < m; ++i){
        cin >> x;
        y+=x;
        if (y >= n1){
            cout << "Free after " << i+1 << " times.";
            return 0;
        }
    }
    cout << "Team.GOV!";
    return 0;
}

People, __int64 not needed! I quickened my program from 0.31 to 0.15 when returned __int64 to int (if that was not a fluctuation).

Listen here. During one meal Ivan can save about 2*10^6/3 ~ 666667 rub. This is maximum increment of saved money. So at maximum the saved sum will be 2*10^9 + 666667, which is much less than 2^31-1.

My trouble (and most likely yours too) was connected with that i checked if saved sum is strictly greater than n fogetting of the fractional part. This is the case when
( integer part of saved money == n)
BUT
( integer part == n AND fractional part > 0)

u can use double but beware during comparison of double numbers since c language behaves abnormally while comparing floating point numbers. otherwise problem is as easy as it seems. if you are getting WA11 then read problem statement properly again and again.

Edited by author 13.05.2009 23:29

Edited by author 13.05.2009 23:29