A. Polycarp and Coins
Submit code:
void solve() {
int n;
cin >> n;
int a, b;
if(n == 1) {
a = 1;
b = 0;
}
else if(n % 3 == 0) {
b = n / 3;
a = n - (2 * b);
}
else if(n % 3 == 1) {
b = n / 3;
a = n - (2 * b);
}
else {
b = n / 3 + 1;
a = n - (2 * b);
}
cout << a << ' ' << b << endl;
}
int main() {
int n;
cin >> n;
while (n --) {
solve();
}
return 0;
}
better answer:
void mainA() {
int n;
cin >> n;
int t = n % 3;
cout << n / 3 + (t == 1) << " " << n / 3 + (t == 2) << "\n";
}
int main() {
int n;
cin >> n;
while(n --) mainA();
return 0;
}