### FabiOquendo's blog

By FabiOquendo, history, 6 years ago,

When you submit a code, codeforces shows the testcases of the problem, but when the input is too long it can't be copy because the input is INCOMPLETE. Someone knows HOW TO SEE OR COPY A COMPLETE INPUT?

• +5

 » 6 years ago, # |   +20 you can't .
•  » » 6 years ago, # ^ |   0 thanks, and sorry for the unlike, it was an accident.
•  » » » 6 years ago, # ^ |   +1 you welcome , it's not a big deal .
 » 6 years ago, # |   +45 I guess you are interested in your last submission 12190150, which fails 19th test case. Here's how you can abuse the system: Find some distinctive feature of the failing test. This particular one is easy: it is the first test case starting with 'd'. Here's my submission to be sure: 12197471 Once you encountered the failing test case, output raw input instead of the answer: 12197631 Codeforces will output only first 511 characters. It means you are to repeat step 2, writing to the output another portion of the input: 12197650, 12197674, 12197689 And here's extracted test case itself: http://pastebin.com/JxkE7pDV
•  » » 6 years ago, # ^ |   0 Yes, that was for my last submission. Thanks for the trick.
•  » » 6 years ago, # ^ |   +4
•  » » » 6 years ago, # ^ |   0 Exactly. Nobody at Codeforces got time to implement direct download links for every large test case (are they bigger than the average blogpost with comments?). Instead they seem to favor a ridiculous excuse and a load caused by such extraction submissions. If they think that getting full test case is useless, why do they bother showing it at all?
•  » » » » 6 years ago, # ^ |   0 I thounght that my code was good, only I needed the testcase for to know when I was failing.
 » 6 years ago, # |   0 You can't and it's the reason why codeforces doesn't allow to do it is intentional
 » 6 years ago, # |   0 This should really be implemented as a new feature.
»
19 months ago, # |
-56

# include<bits/stdc++.h>

using namespace std; int main() { long int num,base,i=0;

int t;
cin>>t;
while(t--)
{
int n,k,flg=0;
cin>>n>>k;
long long int a[n];
for(int i=0;i<n;i++)
cin>>a[i];

vector<long long int>v;
set<long int>st;
for(int j=0;j<n;j++)
{     num=a[j];base=k,i=0;
while(num>0)
{
if(num%base==1)
{ v.push_back(i);
}
if(num%base>1)
{cout<<"NO"<<endl;
flg=1;
break;}
num=num/base;
i++;
}

}
if(flg==0)
{
for(int i=0;i<v.size();i++)
st.insert(v[i]);

if(v.size()==st.size())
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
}

st.clear();
v.clear();
}
return 0;


}

•  » » 19 months ago, # ^ |   -28 getting wrong answer on test 5, token 15.
•  » » » 19 months ago, # ^ |   +30 What's wrong with you? Why did you bump a 5 year old blog with an unrelated badly formatted code with no context? You don't deserve help, you deserve a ban.
 » 17 months ago, # |   0 Hi for[ https://codeforces.com/problemset/problem/143/A ] what is the wrong here[ https://ideone.com/pk8VRQ ]