简单题。
thestoryofsnow | 3030 | Accepted | 132K | 0MS | C++ | 682B |
/*
ID: thestor1
LANG: C++
TASK: poj3030
*/
#include <iostream>
#include <fstream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <limits>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <cassert>
using namespace std;
int main()
{
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i)
{
int r, e, c;
scanf("%d%d%d", &r, &e, &c);
if (r > e - c)
{
printf("do not advertise\n");
}
else if (r < e - c)
{
printf("advertise\n");
}
else
{
printf("does not matter\n");
}
}
return 0;
}