Codeforces Round #439 (Div. 2)【A、B、C】

1 #include<cstdio>
2 int main(){
3     puts("Karen");
4     return 0;
5 }

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<algorithm>
 4 using namespace std;
 5 typedef long long ll;
 6 int main(){
 7     ll a, b, x, y;
 8     scanf("%lld %lld", &a, &b);
 9     if(b-a>=5) puts("0");
10     else {
11         ll d = b - a; ll t = 1;
12         x = b % 10;
13         for(int i = 0 ; i < d; ++i) t *= (x-i);
14         printf("%lld\n", t%10);
15     }
16     return 0;
17 }

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<algorithm>
 4 using namespace std;
 5 typedef long long ll;
 6 const ll mod = 998244353;
 7 const int N = 5001;
 8 ll c[N][N];
 9 void init() {
10     int i, j;
11     for(i = 0; i < N; ++i) c[0][i] = 1;
12     for(i = 1; i < N; ++i)
13         for(j = i; j < N; ++j)
14             c[i][j]=(c[i-1][j]+c[i-1][j-1]*j)%mod;
15 }
16 int main() {
17     init();
18     int x, y, z;
19     scanf("%d%d%d", &x, &y, &z);
20     if(x>y)swap(x, y); if(x>z)swap(x, z); if(y>z)swap(y,z);
21     printf("%lld\n", (((c[x][y]*c[x][z])%mod)*c[y][z])%mod );
22     return 0;
23 }