#include <iostream>
using namespace std;
int dp[1001][1001];
const int mod = 1e9+7;
int main(){
dp[0][0] = 1;
for(int n=1;n<=1000;n++){
dp[n][0] = 1;
for(int k =1;k<=1000;k++)
dp[n][k] = (dp[n-1][k] + dp[n][k-1])% mod;
}
int t , n , k;
cin >> t;
for(int i = 0; i<t;i++){
cin >> n >> k;
cout << dp[n][k] << "\n";
}
return 0;
}
using namespace std;
int dp[1001][1001];
const int mod = 1e9+7;
int main(){
dp[0][0] = 1;
for(int n=1;n<=1000;n++){
dp[n][0] = 1;
for(int k =1;k<=1000;k++)
dp[n][k] = (dp[n-1][k] + dp[n][k-1])% mod;
}
int t , n , k;
cin >> t;
for(int i = 0; i<t;i++){
cin >> n >> k;
cout << dp[n][k] << "\n";
}
return 0;
}
#include<iostream>
using namespace std;
int sum(int n){
return n<10? n :n%10+sum(n/10);
}
bool smith(int n){
int S=sum(n);
int s=0;
for(int i=2;1LL*i*i<=n;i++){
while(n%i==0){
n/=i;
s+=sum(i);
}}if(n>1){
if(s==0)return false;
s+=sum(n);
}
return S==s;
}
int main(){
int n;
cin>>n;
cout<<smith(n);
return 0;
}
using namespace std;
int sum(int n){
return n<10? n :n%10+sum(n/10);
}
bool smith(int n){
int S=sum(n);
int s=0;
for(int i=2;1LL*i*i<=n;i++){
while(n%i==0){
n/=i;
s+=sum(i);
}}if(n>1){
if(s==0)return false;
s+=sum(n);
}
return S==s;
}
int main(){
int n;
cin>>n;
cout<<smith(n);
return 0;
}
hozircha faqat bitta yecha oldim chunki qolganlariga faqat time limit (19) yoki 41 testida beryapti
10-15ta odam qo'shganlar uchun akk sovg'aga niklarini esa 001dan 100 gacha ulgurib qoling bizda faqat 100ta akk bor
va yutgan kishiga yana hamma masala javobi bor bot linkini beraman shoshilib qoling