acwing hdu1276 #include using namespace std; int t,n,sum=0; bool judge[5005]; int main(){ cin>>t; for(int cishu=1;cishu<=t;cishu++){ cin>>n;memset(judge,false,sizeof(judge));sum=n; for(int i=1;sum>3;i++){ if(i%2==1){ int p=0; for(int j... acwing물 문제데이터 구조
hdu1276 #include using namespace std; int t,n,sum=0; bool judge[5005]; int main(){ cin>>t; for(int cishu=1;cishu<=t;cishu++){ cin>>n;memset(judge,false,sizeof(judge));sum=n; for(int i=1;sum>3;i++){ if(i%2==1){ int p=0; for(int j... acwing물 문제데이터 구조