toj_2804_2.cpp

来自「Tianjin University Online Judge 的80多道题目 」· C++ 代码 · 共 32 行

  /*Input
The input will contain multiple test cases. Each test case contains a single line with a single integer n, the number of vertices of the polygon. (3 ≤ n ≤ 10^1000)

The input will be terminated by the end of file.

Output
For each corresponding n, output a single line with the number of guards needed( n / 3 )
Sample Input

5
100
99999999999999999999

Sample Output

1
33
33333333333333333333

Problem Setter: nuanran


Source: TJU Programming Contest 2007 Preliminary*/
#include<cstdio>

#define max 1000
int main()
{
  char num[ 10000 ][ 1000 ];
  int i , j , k;
  scanfNum( num ,