#include<stdio.h>
#include<stdbool.h>
#define MAXVALUE 1000 // 可能的最大值
bool triple(int a[],int b)//函式原型定義
{
int j=0;
for(int i=0;i<b;i++)
{
if((a[i]!=0)&&(a[i]%3==0))
{
j++;
break;
}
if(j!=0)
return 1;
else
return 0;
}
}
int main() {
int values[MAXVALUE+1]={0}; // 宣告整數陣列並全部設成0。value[i]要用來紀錄數字i出現的次數。
int v; // 讀到的整數
int max=0; // 目前已知的最大值
while(scanf("%d",&v
)!=EOF
) { values[v]++; // 讀到數值v, 把value[v]加1
if(v>max) max=v; // 如果目前讀到的值比最大值還大就修改已知的最大值
}
// 傳入檢查的陣列,以及陣列長度(若最大數字是k,須檢查陣列index 0,1,...,k, 共k+1個)
if(triple(values,max+1)==true) {
}
else {
}
return 0;
for(int i=0;i<max+1;i++)
{
}
}
I2luY2x1ZGU8c3RkaW8uaD4KI2luY2x1ZGU8c3RkYm9vbC5oPgojZGVmaW5lIE1BWFZBTFVFIDEwMDAgIC8vIOWPr+iDveeahOacgOWkp+WAvAogCmJvb2wgdHJpcGxlKGludCBhW10saW50IGIpLy/lh73lvI/ljp/lnovlrprnvqkKewoJaW50IGo9MDsKCWZvcihpbnQgaT0wO2k8YjtpKyspCgl7CgkJaWYoKGFbaV0hPTApJiYoYVtpXSUzPT0wKSkKCQl7CgkJCWorKzsKCQkJYnJlYWs7CgkJfQoJCWlmKGohPTApCgkJcmV0dXJuIDE7CgkJZWxzZQoJCXJldHVybiAwOwoJfQp9CmludCBtYWluKCkgewogIGludCB2YWx1ZXNbTUFYVkFMVUUrMV09ezB9OyAvLyDlrqPlkYrmlbTmlbjpmaPliJfkuKblhajpg6joqK3miJAw44CCdmFsdWVbaV3opoHnlKjkvobntIDpjITmlbjlrZdp5Ye654++55qE5qyh5pW444CCCiAgaW50IHY7ICAgLy8g6K6A5Yiw55qE5pW05pW4CiAgaW50IG1heD0wOyAvLyDnm67liY3lt7Lnn6XnmoTmnIDlpKflgLwKICB3aGlsZShzY2FuZigiJWQiLCZ2KSE9RU9GKSB7CiAgICB2YWx1ZXNbdl0rKzsgIC8vIOiugOWIsOaVuOWAvHYsIOaKinZhbHVlW3Zd5YqgMQogICAgaWYodj5tYXgpIG1heD12OyAgLy8g5aaC5p6c55uu5YmN6K6A5Yiw55qE5YC85q+U5pyA5aSn5YC86YKE5aSn5bCx5L+u5pS55bey55+l55qE5pyA5aSn5YC8CiAgfQogIC8vIOWCs+WFpeaqouafpeeahOmZo+WIl++8jOS7peWPiumZo+WIl+mVt+W6pijoi6XmnIDlpKfmlbjlrZfmmK9r77yM6aCI5qqi5p+l6Zmj5YiXaW5kZXggMCwxLC4uLixrLCDlhbFrKzHlgIspCiAgaWYodHJpcGxlKHZhbHVlcyxtYXgrMSk9PXRydWUpIHsKICAgIHByaW50ZigiVElHRVIhIik7CiAgfQogIGVsc2UgewogICAgcHJpbnRmKCJDQVQhIik7CiAgfQogIHJldHVybiAwOwogIGZvcihpbnQgaT0wO2k8bWF4KzE7aSsrKQoJewoJCXByaW50ZigiJWRcbiIsdmFsdWVzW2ldKTsKCX0KfQ==