code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 45 101M |
|---|---|---|---|
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <bits/stdc++.h>
#define PI acos(-1)
#define fs first
#define sc second
#define debug freopen("1.in","r",stdin),fre... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
typedef vector<ll> VL;... | 1 | 1,137,814 |
#include<iostream>
#include<string>
#include<cmath>
#include<iomanip>
using namespace std;
double PI = acos(-1);
int main(){
double a, b, c, deg, rad;
double area, circum, height;
cin >> a >> b >> deg;
rad = 2 * PI * deg / 360;
c = sqrt(a * a + b * b - 2 * a * b * cos(rad));
area = 0.5 * a * b *... | #include <iostream>
#include <cmath>
const double pi = 3.14159265358979;
using namespace std;
double deg2rad(double degree)
{
return degree/180*pi;
}
int main(void)
{
double a, b, c;
double r, s, length, h;
cin >> a >> b >> r;
r *= pi/180;
h = b * sin(r);
s = a * h / 2;
c = sqrt(a*a + b*b - 2*a*b*cos(r));
leng... | 1 | 5,890,345 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define forin(in) for(int i=0; i<(int)in.size(); i++) cin>>in[i]
#define forout(out) for(int i=0; i<(int)out.size(); i++) cout<<out[i]<<endl
#define rep(i, n) for(int i=0; i<(n); i++)
int main(){
int h, w, k; cin>> h >> w >... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int H, W, K;
cin >> H >> W >> K;
vector<vector<char>> blocks(H, vector<char>(W));
rep(i, H) {
rep(j, W) {
cin >> blocks.at(i).at(j);
}
}
int... | 1 | 36,909,581 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using ll = long long;
const ll MOD = 1e9+7; ll LLINF = 1LL << 60; int INF = INT_MAX;
int main(){
int n; cin>>n;
vector<long double> x(n);
vector<string> c(n);
rep(i,0... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define ALL(x) (x).begin(),(x).end()
const int IINF = 1e9;
const LL LINF = 1e18;
const LL MOD = 1e9+7;
int main() {
int N;
cin >> N;
double k = ... | 1 | 61,014,327 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i < (int)n; i++)
const int inf = 1000000000;
int main() {
int n;
cin >> n;
std::vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
int ans = inf;
for (int i = 1; i <= 100; i++) {
... | #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define pi 3.141592653589... | 1 | 56,209,981 |
#include<bits/stdc++.h>
#define int long long
#define all(a) a.begin(),a.end()
#define sz(a) a.size()
#define re return
#define MP make_pair
#define pb push_back
#define pii pair<int,int>
#define se second
#define fi first
using namespace std;
signed main(){
ios_base::sync_with_stdio(0);
int a,b,c,d;
cin>>a>>b>>c>>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = LONG_LONG_MAX / 2;
const ll mod = 1000000000 + 7;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
if (abs(a - c) <= d || (abs(a - b) <= d && abs(b - c) <= d))
... | 1 | 1,186,887 |
#include <iostream>
#include <cmath>
using namespace std;
struct Point{
double x, y;
};
void koch(int n, Point a, Point b){
if(n == 0) return ;
Point s, t, u;
double th = M_PI * 60.0 / 180.0;
s.x = (2.0 * a.x + 1.0 * b.x) / 3.0;
s.y = (2.0 * a.y + 1.0 * b.y) / 3.0;
t.x = (1.0 * a.x + 2.0 * b.x) / 3.0;
t... | #include <iostream>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <memory>
#include <array>
#include <bitset>
#include <deque>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using point = complex<double_t>;
void print(const po... | 1 | 41,046,430 |
#include <iostream>
using namespace std;
int main(void){
int list[3];
int tmp;
cin >> list[0] >> list[1] >> list[2];
for(int i = 0; i < 2; i++){
for(int j = 1; j < 3; j++){
if(list[i] > list[j]){
tmp = list[i];
list[i] = list[j];
list[j] = tmp;
}
}
}
cout << list[0] << " " << list[1] << " " ... | #include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
int main(){
std::vector<int>a;
for (int i = 0; i < 3; ++i){
int t;
std::cin >> t;
a.push_back(t);
}
std::sort(a.begin(), a.end());
std::cout << a[0] << " " << a[1] << " " << a[2] << std::endl;
} | 1 | 72,119,638 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int k;
char arr[100];
cin >> k;
scanf("%s", arr);
if(strlen(arr) <=k){
printf("%s", arr);
}
else{
for(int i=0; i<k; ++i){
cout << arr[i];
}
cout << "...";
}
} | #include<stdio.h>
#include<string.h>
int main()
{
int n;
scanf("%d",&n);
char str[102];
scanf("%s",&str);
int len=strlen(str);
if(len>n)
{
str[n]='.';
str[n+1]='.';
str[n+2]='.';
str[n+3]='\0';
}
printf("%s",str);
return 0;
} | 1 | 51,594,923 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int64_t N, ans = 0;
cin >> N;
vector<int64_t> A(2 * N);
for (int i = 0; i < 2 * N; i++)
{
cin >> A.at(i);
}
sort(A.begin(), A.end());
for (int i = 0; i < 2 * N; i += 2)
{
ans += A.at(i);
}
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int a[ 210 ];
int main()
{
int n;
cin >> n;
for ( int i = 0; i < 2 * n; i++ )
{
cin >> a[ i ];
}
sort( a, a + 2 * n );
long long int ans = 0;
for ( int i = 0; i < 2 * n; i += 2 )
{
ans += min( a[ i ], a[ i ... | 1 | 74,868,943 |
#include<bits/stdc++.h>
using namespace std;
int n,t=0;
void dfs(int k,int end,string s)
{
if(k>end)
if(++t==n)
{
cout<<s;
exit(0);
}
else return ;
for(char ch=s[s.size()-1]-1;ch<=s[s.size()-1]+1;ch++)
if(ch>='0'&&ch<='9')
dfs(k+1,end,s... | #include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1... | 1 | 27,453,382 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
cin >> n >> m;
if((n+m) == 15)
cout << '+';
else if((n*m) == 15)
cout << '*';
else
cout << 'x';
} | #include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9+7;
const int64 LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n" )
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n" )
#define ANS(n) cout << (n) << "\n"
#define R... | 1 | 68,863,294 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define leading zero str.erase(0, min(str.find_first_not_of('0'), str.size()-1));
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tree<ll, null_type, less<ll>... | #include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
int main(){
ll N, K, S;
cin >> N >> K >> S;
ll num = pow(10, 9);
if(num == S){
rep(... | 1 | 35,515,786 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define fr(a,b) for(int i=a;i<b;i++)
#define prDouble(x) cout<<fixed<<setprecison(18)<<x
#define mod 1000000007
int solve(std::vector<int>& v, int n, int k)
{
ll dp[n + 2][k + 2];
for (int j = 0; j <= k; j++)
dp[1][j] = (j > v[1]... | #include<bits/stdc++.h>
#define ll long long
#define MOD 1000000007
using namespace std;
int dp[100][100005];
int main()
{
int n,k;
cin>>n>>k;
int a[n];
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<=a[0];i++)
dp[0][i] = 1;
for(int i=1;i<n;i++){
vector<int>pref(k+1);
... | 1 | 30,179,485 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod = 1000000007;
vector<ll> fac(1000005);
vector<ll> ifac(1000005);
ll modpow(ll x, ll n){
ll ans = 1;
while(n != 0){
if(n & 1)
ans = ans * x % mod;
x = x * x % mod;
n = n >> 1;
}
return ans;
... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
long long inf=1000000007;
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
int main(){
int x,y... | 1 | 61,020,742 |
#include <bits/stdc++.h>
using namespace std;
#define int int64_t
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define all(x) (x).begin(), (x).end()
#define gsort(x) sort((x).begin(), (x).end(), greater<int>())
#define rv(s) reverse((s).begin(), (s).end())
#define pi... | #include<bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
typedef vector <int> vi;
typedef pair<int,int> ii;
typedef long long ll;
typedef long double ld;
const int mod = 998244353;
const ll inf = 3e18 + 5;
int add(int a, int b) { return (a += b) < mod ? a : a -... | 1 | 70,423,866 |
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
int max(int a,int b){
if(a>b){
return a;
}else{
return b;
}
}
int main(void){
int a,b,c;
cin >> a >> b >> c;
cout << max(c -(a-b),0) << endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 1 | 59,146,151 |
#include <iostream>
using namespace std;
int main(){
char str[4] ;
int i1 ;
cin >> str ;
if ( str[0] == str [1] ){
i1++;
}
if ( str[0] == str [2] ){
i1++;
}
if ( str[0] == str [3] ){
i1++;
}
if ( str[1] == str [2] ){
i1++;
}
if ( str[1] == str [3] ){
i1++;
}
if ( str[2] =... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;cin>>s;
char st;
int cnt;
for (int i=0; i<4;i++) {
cnt =0;
st = s[i];
for (int j=0;j<4;j++){
if (st == s[j]) cnt++;
}
if (cnt != 2) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | 1 | 48,554,142 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
vector<int> a(M), b(M);
for(int i=0; i<M; i++) cin >> a[i] >> b[i];
vector<int> cnt(N+1, 0);
for(int i=0; i<M; i++)
{
cnt[a[i]]++... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
template<class T, class S> void cmin(T &a, const S &b) { if (... | 1 | 84,438,677 |
#include <bits/stdc++.h>
using namespace std;
struct D{
int size;
vector<int> num;
D(){
size = 6;
num = vector<int>{1,2,3,4,5,6};
}
D(vector<int> _num){
size = _num.size();
num = _num;
}
void change(vector<int> idx){
auto ret(num);
for(int i = 0; i < size; i++){
ret[i] = num[idx[i]];
}
swap(re... | #include <iostream>
using namespace std;
class Dice {
public:
int face[6];
int getRightFace(int up, int front);
};
int Dice::getRightFace(int up, int front)
{
if ((up == face[1] && front == face[2]) ||
(up == face[2] && front == face[4]) ||
(up == face[3] && front... | 1 | 40,879,882 |
#include <iostream>
#include <algorithm>
using namespace std;
int main(){
int dp[50001];
int c[20];
int n;
int m;
cin >> n >>m;
for(int i=0;i<m;i++) cin>> c[i];
sort(c,c+m);
for(int j=0;j<=n;j++) dp[j] = j;
for(int i=1;i<m;i++)
for(int j=1;j<=n;j++)
if(j>=c[i]) dp[j] = min(dp[j],dp[j-c[i]]+1... | #include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
const long long int MOD = 1000000007;
const long long int INF = 100000000;
long long int N,M;
long long int C[30];
long long int dp[21][100000];
int D... | 1 | 49,614,639 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
int ans = 1;
cin >> n >> k;
for (int i = 0; i < n; i++) {
ans = min(ans*2, ans+k);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define pb push_back
#define Int long long
using namespace std;
const int MAXN=50005;
const int NAX=1005;
const long MOD=(long)(1e9+7);
Int N,M,K;
Int X,Y,Z;
int main()
{
int start=1;
cin>>N>>K;
int times=N;
while(times--){
if(start<K) start*=2;
else start+=K;
... | 1 | 83,424,381 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<math.h>
using namespace std;
int main()
{
int n; cin>>n;
string s,ss; cin>>s>>ss;
for(int i=0;i<n;i++)
{
cout<<s[i]<<ss[i];
}
} | #include <algorithm>
#include <iostream>
#include <vector>
#include <functional>
#include <string>
#include <cmath>
#include <iomanip>
using namespace std;
int main(){
cout << fixed << setprecision(6);
int n; cin >> n;
string s,t; cin >> s >> t;
string out ="";
for (int i = 0; i < n; i++)
{
... | 1 | 7,778,926 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define Rep(i,s,f) for(int i=(int)s;i<(int)f;i++)
using ll=long long;
using namespace std;
int main()
{
int N,C,K;
cin>>N>>C>>K;
vector<int> T(N);
rep(i,N) cin>>T[i];
sort(T.begin(),T.end());
int prev=T[0];
int cnt=1;
int i=1;
int ans=0;
while... | #include <bits/stdc++.h>
#include <boost/range/algorithm.hpp>
#include <boost/range/numeric.hpp>
#include <boost/integer/common_factor.hpp>
#include <boost/integer/common_factor_rt.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using std::string;
using std::vector;
us... | 1 | 98,148,239 |
#include <iostream>
#include <string>
#include <cstring>
#include <fstream>
#include <random>
#include <cmath>
#include <iomanip>
#include <climits>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <deque>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <list>
#... | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
struct COODINATE
{
public:
int x, y, n;
};
vector<string> Gin;
Graph Gout;
queue<COODINATE> Q;
int search(int x, int y, int n, int h, int w){
if(x<0 || w<=x || y<0 || h<=y || Gout... | 1 | 82,629,016 |
#include <vector>
#include <set>
#include <map>
#include <array>
#include <iostream>
#include <cstdio>
#include <cstdint>
#include <algorithm>
#include <numeric>
#include <bitset>
using ll = long long;
using namespace std;
#define rep(i,n) for(ll i=0;i<(n);++i)
inline void yes(bool cond) { cond ? puts("Yes") : puts("No... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | 1 | 99,143,706 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define FastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie... | #include <bits/stdc++.h>
#define PI 3.1415926535897932
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int A,B,C,D;
cin>>A>>B>>C>>D;
int low=max(A,C);
int up=min(B,D);
cout<<max(0,up-low)<<endl;
} | 1 | 88,777,159 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
int main(){
int N, K;
cin >> N >> K;
vector<int> p(N);
rep(i,N){
cin >> p.at(i);
}
int ans = 0;
sort(p.begin(), p.end());
rep(i,K){
ans += p.at(i);
}
cout << ans;
... | #include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <queue>
#include <iostream>
#include <cmath>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
typedef long long... | 1 | 23,277,590 |
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <cstdio>
#include <vector>
#include <iterator>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <map>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main() {
int N, K;... | 1 | 84,850,733 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef int ll;
typedef long double ld;
const ll N = 100005;
char en = '\n';
ll inf = 1e17;
ll mod = 1e9 + 7;
ll power(ll x, ll n, ll mod) {
ll res = 1;
x %= mod;
while (n) {
if (n & 1)
res = (res * x) % mod;
x = (x * x) % mod;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007LL;
ll mod_inv(ll a, ll m) {
ll b = m, x = 1, y = 0, s, t;
while ( b != 0 ) {
s = y;
y = x - ( a / b ) * y;
x = s;
t = b;
b = a % b;
a = t;
}
return (x % m + m) % ... | 1 | 40,260,374 |
#include<bits/stdc++.h>
#define rep(i,x,y) for (int i=(x); i<=(y); i++)
#define per(i,x,y) for (int i=(x); i>=(y); i--)
#define ll long long
#define N 300010
using namespace std;
int n,a,b,now,t1,t2,k1,k2,d[N];
int main(){
bool flag=0;
scanf("%d%d%d",&n,&a,&b);
per (i,b,1) d[b-i+1]=i;
a--; now=b;
if (a){
t1=(n-b... | #include <bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(),x.end()
#define lop(i,s,t) for(int i=s;i<(t);++i)
#define rep(i,s,t) for(int i=s;i<=(t);++i)
#define dec(i,s,t) for(int i=s;i>=(t);--i)
using namespace std;
int n,a,b,cur;
int main(int argc,char *argv[]){
#ifdef CURIOUSCAT
#endif
cin>>n>>a>>b;
i... | 1 | 6,519,702 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0;i<n;i++)
int main(){
int n, k;
cin >> n >> k;
vector<int> a(n);
vector<int> c(n,n);
rep(i,n){
cin >> a[i];
}
rep(j,k){
vector<int> d(n+1);
rep(i,n){
d[max(i-a[i],0)]++;
... | 1 | 48,308,319 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setprecision(15) << (x) << "\n"
#define ENDL cout << "\n"
#d... | 1 | 997,483 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n, m;
cin>> n >> m;
string input;
vector<string>vec;
for(int i = 1; i <= n; i++)
{
cin>> input;
vec.push_back(input);
}
sort(vec.begin(),vec.end());
for(int i = 0; i < vec.size(); i++)
{
cout<< ... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define vec vector<int>
#define map map<int,int>
#define scn(t) scanf("%d",&t);
#define lscn(t) scanf("%lld",&t);
#define mod 1000000007
#define rep(i,a,b) for(int i=a;i<b;i++)
#define endl "\n... | 1 | 48,184,741 |
#include<iostream>
main(){int y,m,d;for(std::cin>>d;std::cin>>y>>m>>d;printf("%d\n",196490-d))d+=195*--y+y/3*5+19*m+m/2+!(++y%3)*(m-1)/2;} | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
usi... | 1 | 80,227,647 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
string t = "keyence";
if(s == t){
cout << "YES" << endl;
return 0;
}
int l = s.size();
bool ok = false;
for(int i = 0; i < l; i++){
for(int j = i; j < l; j++){
string ans = "";
for(int k = 0; k < l; k++... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
string key = "keyence";
int n = s.size();
for (int i = 0; i <= n - 7; i++) {
if (i == 0) {
if (s == key) {
cout << "YES" << endl;
... | 1 | 25,607,944 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i,a,b) for(int i=a;i<=b;i++)
inline ll r() {
ll x=0,f=1;
char c=getchar();
while(c<'0'||c>'9')c=getchar();
if(c=='-')f=-1,c=getchar();
while(isdigit(c))x=x*10+c-'0',c=getchar();
return x*f;
}
#define d r()
ll n;
int main(){
n=d;
if(n>=4... | #include <stdio.h>
#include <math.h>
#include <stdlib.h>
int main()
{
int n;
scanf("%d", &n);
if (n>=400 && n<=599) printf("8");
else if(n>=600 && n<=799) printf("7");
else if(n>=800 && n<=999) printf("6");
else if(n>=1000 && n<=1199) printf("5");
else if(n>=1200 && n<=1399) printf("4");
else ... | 1 | 72,214,112 |
#include<iostream>
using namespace std;
int main() {
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
long long n,m;
cin >> n >>m;
cout << abs((n-2) * (m-2));
} | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long n, m; cin >> n >> m;
if (n > m) swap(n, m);
long long ans;
ans = (n == 1) ? abs(m - 2) : (n - 2) * (m - 2);
cout << ans << '\n';
return 0;
} | 1 | 68,735,009 |
#include<bits/stdc++.h>
using namespace std;
const int n = 1e5+3;
char x[n];
int main(void){
char b;
cin>>b;
pair<char,char>x[2];
x[0]=make_pair('A','T');
x[1]=make_pair('C','G');
for(int i=0;i<2;i++)
{
if(x[i].first==b)
cout<<x[i].second<<endl;
else if(x[i].second==b)
cout<<x[i].first<<endl;
}
... | #include <iostream>
#include <vector>
#include <string>
#include <unordered_set>
#include <unordered_map>
#include <sstream>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <numeric>
#include <iterator>
using namespace std;
namespace {
}
int main()
{
map<char, char> e{ { 'A', 'T' }, { 'T',... | 1 | 40,101,441 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 510000;
const int MOD = 998244353;
const int Inv2 = (MOD+1)/2;
signed main(){
int q,h,s,d,n;cin>>q>>h>>s>>d>>n;
h=min(2*q,h);s=min(2*h,s);d=min(d,2*s);cout<<(n/2)*d+(n%2)*s<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<ll, ll>;
ll n;
int main() {
vector<ll> v(4);
rep (i, 4) {
cin >> v[i];
}
cin >> n;
n *= 4;
vector<ll> want(4, 0);
vector<P> vperL(4);
rep (i, 4) {
vperL[i] = make_pai... | 1 | 64,613,133 |
#include <stdio.h>
int main () {
int n, a, b, dig1, dig2, dig3, dig4, dig5;
int sum = 0;
scanf("%d %d %d", &n, &a, &b);
for(int i = 1; i <= n; i++) {
dig1 = i%10;
dig2 = (i/10)%10;
dig3 = (i/100)%10;
dig4 = (i/1000)%10;
dig5 = (i/10000)%10;
if ((dig1+dig2+dig3+dig4+dig5) >= a && (dig1+dig2+dig3+dig4+dig... | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
int A;
int B;
int sum = 0;
string n_str;
cin >> N >> A >> B;
for (int i = 1; i <= N; i++) {
n_str = to_string(i);
int tmp = 0;
for (int j = 0; j < n_str.size(); j++) {
tmp = tmp... | 1 | 91,590,577 |
#include <iostream>
#include <map>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <sstream>
#include <cmath>
#include <math.h>
#include <string>
#include <set>
#include <queue>
#include <utility>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0;... | 1 | 28,381,164 |
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define filein freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
void fun1(int* a,int* b){
int sum=*a+*b;
int dif=abs(*a-*b);
*a=sum;
*b=dif;
}
int main() {
int k;
cin>>k;
long long a[100005]={0,1,2,3,4,5,6,7,... | #include <iostream>
#include <queue>
using namespace std;
int main(){
int K;
cin >> K;
queue<long long> q;
for (int i = 1; i < 10; i++){
q.push(i);
}
long long x;
for (int i = 0; i < K; i++){
x = q.front();
q.pop();
if(x%10 != 0){
q.push(10*x + x%10 - 1);
}
q.push(10*x + x%10... | 1 | 27,478,544 |
#include<string>
#include<iostream>
#include<stdio.h>
using namespace std;
int main(){
string str1,str2,e,v;
int n,m,size;
char ch[1]={};
while(1)
{
cin>>str1;
ch[0]=str1[0];
if(ch[0]=='-')break;
size=str1.size();
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&m);
str2=str1.substr(0,m);
e=str1.erase(0,m);
str1=e+str... | #include<iostream>
#include<vector>
#include<string.h>
using namespace std;
int main()
{
vector<char> s;
char ch[201];
int m;
while(cin>>ch&&ch[0]!='-')
{
for(int i=0;i<strlen(ch);i++)
{
s.push_back(ch[i]);
}
cin>>m;
int h;
for(int i=0;i<m;... | 1 | 38,635,941 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef vector<... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define S second
#define F first
#define pb push_back
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define lb lower_bound
#define si(c) (int)(... | 1 | 71,330,034 |
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
#define e_b emplace_back
#define all(x) (x).begin(),(x).end()
#define uniq(x) ((x).erase(unique(all(x... | #include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <cstdlib>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functiona... | 1 | 25,955,849 |
#include<bits/stdc++.h>
#define dbug printf("I am here\n");
#define Fast ios_base::sync_with_stdio(false); cin.tie(0);
#define vs v.size()
#define ss s.size()
#define sot(v) sort(v.begin(),v.end())
#define rev(v) reverse(v.begin(),v.end())
#define ii pair<int, int>
#define... | #include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <tuple>
typedef unsigned long long ull;
typedef long long ll;
#define mod 1000000007
#define REP(i, n) for (unsigned long long i = 0; i < (n); i++)
#define FOR(i, a, b) for (unsigned long long i = (a); i <= (b); i++)
#define FO... | 1 | 93,209,040 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
stri... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < (n); i++)
#define REPS(i, n) for(int i = 1; i <= (n); i++)
#define RREP(i, n) for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#de... | 1 | 77,532,732 |
#include <bits/stdc++.h>
using namespace std;
string s;
map<int,int>mp, cnt;
int main(){
cin>>s;
int cur = 0, x;
for(int i = 0; i < s.size(); ++i){
cur ^= (1 << (s[i] - 'a'));
if(cur == 0){
if(i == s.size() - 1){
cout<<1<<endl;return 0;
}
}
... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define LD long double
#define SC(t,x) static_cast<t>(x)
#define AR(t) vector < t >
#define PII pair < int, int >
#define PLL pair < LL, LL >
#define PIL pair < int, LL >
#define PLI pair < LL, int >
#define MP make_pair
#define PB push_back
#define PF ... | 1 | 20,440,816 |
#include <bits/stdc++.h>
#include <chrono>
#include <math.h>
using namespace std;
using ll = long long;
using ld = long double;
using namespace std::chrono;
#define fo(i,z,n) for(int i = z;i<n;i++)
#define Fo(i,z,n) for(ll i = z;i<n;i++)
#define INT_BITS 32
#define mod 1000000007
#define vi vector<int>
#define vll vec... | #include<bits/stdc++.h>
using namespace std;
map<int,int>mp;
int cnt=0;
void Divisors(int n)
{
vector<int>v;
for (int i=1; i<=sqrt(n); i++)
{
if (n%i == 0)
{
if (n/i == i)
v.push_back(i);
else
{
v.push_back(i);
... | 1 | 14,443,177 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
if(n%2==0) --n;
cout << n/2 << endl;
} | #include<bits/stdc++.h>
#define all(vc) vc.begin(),vc.end()
#define ll long long
#define MIN(a,b) ((a)<(b)) ? (a) : (b)
#define EVEN(a) (a)%2==0 ? 1 : 0
#define fi first
#define se second
#define speed ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define DEBUG
#pragma GCC optimize("Ofast")
#pragma GCC ... | 1 | 67,204,743 |
#include<math.h>
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ll long long int
#define py printf("Yes\n")
#define pn printf("No\n")
#define in cin>>
using namespace std;
int INF = 1001001001;
int main()
{
string s,t;
in s>>t;
sort(s.begin(), s.end(... | #include<bits/stdc++.h>
using namespace std;
int comp(const char &a,const char &b)
{
return a>b;
}
int main()
{
string s;
string t;
cin>>s>>t;
sort(s.begin(),s.end());
sort(t.begin(),t.end(),comp);
if(s<t)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} | 1 | 50,466,445 |
#include<bits/stdc++.h>
using namespace std;
#define debug(x) cout<<#x<<" :"<<x<<endl;
#define ff first
#define ss second
#define ar array
#define int long long
#define ld long double
#define pb push_back
#define mp make_pa... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printInt(a) printf("%d\n", a)
#define printll(a) printf("%lld\n", a)
#define printYes() printf("Yes\n")
#define printNo() printf("No\n")
#define scanll(a) scanf("%lld", &a)
#define scanInt(a) scanf("%d", &a)
#define scan2Int(a, b) scanf("%d... | 1 | 13,665,097 |
#include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
ll func(int num, int cnt){
ll ans = 1;
rep(i, cnt) ans *= num;
return ans;
}
int main(){
in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repr(i,n) for(int i = (int)(n); i >= 0; i--)
#define all(v) v.begin(),v.end()
typedef long long ll;
int main(){
ll N,P;
cin >> N >> P;
vector<ll> A(N);
rep(i,N){
cin >> A[i];
}
ll odd... | 1 | 82,004,021 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int R;
cin >> R;
if(R < 1200) {
cout << "ABC\n";
} else if(R<2800) {
cout << "ARC\n";
} else {
cout << "AGC\n";
}
return 0;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define mfill(x,y) memset(x,y,sizeof(x))
#define all(v) v.begin(), v.end()
#define y0 y12345
#define y1 y54321
#ifdef LOCAL
#define debug(...) fprintf(stderr,__VA_ARGS__)
#else
#define debug(...) 42
#endif
using u... | 1 | 80,726,651 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for (int i = 0; i < (n); ++i)
int main(){
int n;
int ans=0;
std::cin >> n;
for (int i = 1; i <=n ; i+=2) {
int temp=i;
int na=0;
for (int j = 1; j <= i ; j++) {
if(temp%j==0){na++;}
}
if(na==8)ans++;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const int MOD = (int)1e9 + 7;
const double PI = 3.14159265358979323846;
template <class T, class U>
void chmin(T& t, const U& u) {
if (t > u) t = u;
}
template <class T, class U>
void chmax(T& t, const ... | 1 | 83,345,796 |
#include <iostream>
using namespace std;
int N;
int M;
int main(){
cin >> N >> M;
cout << (N * (N - 1) / 2) + (M * (M - 1) / 2);
} | #include <bits/stdc++.h>
#define mod 1000000007
#define INF LLONG_MAX
#define ll long long
#define ln cout<<endl
#define Yes cout<<"Yes"<<endl
#define NO cout<<"NO"<<endl
#define YES cout<<"YES"<<endl
#define No cout<<"No"<<endl
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define all(... | 1 | 7,489,396 |
#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#define llint long ... | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long N,M;cin>>N>>M;
long long A[N],B[N];
vector<pair<long long,long long>>C(N);
for(int i=0;i<N;i++){
cin>>A[i]>>B[i];
C[i].first=A[i];
C[i].second=B[i];
}
sort(C.begin(),C.end());
long long ans=0;
... | 1 | 32,286,726 |
#include <array>
#include <vector>
#include <deque>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <string>
#include <algorithm>
#include <numeric>
#include <functional>
#include <iterator>
#include <tuple>
#include <utility>
#include <limits>
#include <iostream>
#include <cstd... | #include<iostream>
#include<vector>
using namespace std;
int main(){
int n;
cin >> n;
vector<vector<int> > a(n + 1, vector<int>(n + 1, 0));
for (int i = 1; i <= n; i++) {
int u, k;
cin >> u >> k;
for (int j = 0; j < k; j++) {
int v;
cin >> v;
a... | 1 | 18,087,590 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
string s;
cin >> s;
bool ret = s[0] == 'A';
int count = 0;
for (int i = 2; i < s.size() - 1; i++) {
if (s[i] == 'C')count++;
}
if (count != 1)ret = false;
count = 0;
for (int i = 0; i... | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i <(n); ++i)
#define REP2(i,x,n) for (int i = x; i <(n); ++i)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int,int>;
static const double PI = acos(-1);
int main(){
string s;
... | 1 | 91,032,070 |
#include <iostream>
using namespace std;
int main(){
int k;
char* s = (char*)calloc(100, sizeof(char));
cin >> k >> s;
for(int i = 0; i < k; i++){
if(s[i] == 0) break;
cout << s[i];
}
int len = 0;
while(*s != 0){
s++;
len++;
}
if(len > k) cout << "..." << endl;
} | #include<bits/stdc++.h>
using namespace std;
using ll=long long int;
int main()
{
int n;
cin>>n;
string s;
cin>>s;
if(s.length()<=n)
cout<<s<<endl;
else
{
cout<<s.substr(0,n)+string(3,'.');
}
} | 1 | 54,291,783 |
#pragma GCC optimize("O3")
#include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<cstdlib>
#include<set>
#include<vector>
#include<sstream>
#include<queue>
#include <iomanip>
#include<unordered_set>
#include <stack>
#include <unordered_map>
#include <map>
#include<numeric>
#include<chrono>
#in... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<map>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } retu... | 1 | 52,713,869 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define show(x) {for(auto i: x){cout << i << " ";} cout << endl;}
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
rep(i, N) {
... | #pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include... | 1 | 19,482,426 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
int main() {
int h, w, d;
cin >> h >> w >> d;
char field[505][505];
char buf[2][2];
buf[0][0] = 'R';
buf[0][1] = 'Y... | #include<bits/stdc++.h>
using namespace std;
string s="RGBY";
int n,i,j,x,y,d,m;
inline int read(){
int x=0,f=1;
char c;
c=getchar();
while(c<'0'||c>'9'){
if(c=='-') f=-1;
c=getchar();
}
while(c>='0'&&c<='9'){
x=x*10+c-48;
c=getchar();
}
return x*f;
}
int main(){
n=read();m=read();d=read();
for(i=0;i... | 1 | 4,678,307 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
typedef pair< long long, long long > P;
typedef pair< long long, P > PP;
typedef pair< P, P > PPP;
const double DINF = 5e14, eps = 1e-10;
const long long MOD = 1e9 + 7, INF = 5e18;
const int di[4] = { 1,0,-1,0 }, dj[4] =... | #include <iostream>
#include <vector>
using namespace std;
vector<int> v[100010];
int main(){
long long i,j,k,n;
cin >> n;
for(i=0;i<=n;i++){
if(i*(i+1)/2==n){
k = i;
break;
}
if(i==n){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
cout << k+1 << endl;
int x = 1;
for(i=1;i<=k+1;... | 1 | 57,124,813 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define ll long long
#define rep(i,n) for (ll i = 0; i < (ll)(n); ++i)
#define be(v) (v).begin(), (v).end()
#define dcout cout << fixed << setprecision(20)
ll INF = 1LL << 60;
ll mod = 1e9 + 7;
int main() {
int x,a,b; cin >> x >> a >> b;
if(b<=a) cout <... | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
using namespace std;
typedef long long ll;
ll MOD = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
ll x, a, b;
cin >> x >> a >> b;
if ( a >= b ) cout << "delicious" << endl;
else if ( b - ... | 1 | 13,763,125 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int A,B,C,D;
cin >> A >> B >> C >> D;
if(A+B > C+D)
cout << "Left" << endl;
if(A+B == C+D)
cout << "Balanced" << endl;
if(A+B < C+D)
cout << "Right" <<endl;
} | #include <bits/stdc++.h>
using namespace std;
signed main(){
int A, B, C, D;
scanf("%d%d%d%d", &A, &B, &C, &D);
if(A + B > C + D){
printf("Left\n");
}
else if(A + B == C + D){
printf("Balanced\n");
}
else{
printf("Right\n");
}
return 0;
} | 1 | 41,441,300 |
#include <iostream>
#include <vector>
#include <string>
#include <cmath>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
int main(void) {
Int a, b;
cin >> a >> b;
cout << (a - 1) * (b - 1) << endl;
return 0;
} | #include<iostream>
#include<vector>
#include<utility>
#include<map>
#include<algorithm>
using namespace std;
using ll = long long;
int main() {
int A, B;
cin >> A >> B;
cout << (A - 1) * (B - 1) << endl;
} | 1 | 59,649,981 |
#include<iostream>
#include<stdio.h>
#include<vector>
#include<float.h>
#include<iomanip>
#include<algorithm>
#include<string>
#include<cstring>
#include<math.h>
#include<cmath>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include <cassert>
#include <cmath>
#include<cstdint>
#define INF 1e9
#define re... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | 1 | 76,247,950 |
#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef p... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <cassert>
#include <cstdlib>
#include <cctype>
#include <ctime>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <numeric>
#include <utility>
#include <string>
#include <algorithm>
#include <vector>
#include <map>
#include <queue>
#include... | 1 | 15,725,613 |
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef p... | #include "bits/stdc++.h"
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll =long long;
using P =pair<int,int>;
int main(){
int n,m;
cin >> n >> m;
vector <vector <int>> v(n+1),v2(n+1);
vector <vector <int>> so;
vector <vector <int>> ans(m,vector <int> (2));
int p,y;
re... | 1 | 81,477,628 |
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod=1000000007;
const ll inf=1e18;
vector<vector<ll>> soinsu(ll a){
if(a<=0) return {};
if(a==1) return {{1,1}};
vector<ll> f;
ll b=a;
for(ll i=2;i*i<=a;i++){
if(b%i==0){
f.push_back(i);
b=b/i;
i--;
}
if... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
vector<int>prime(1000005,0);
bool mark[1000005];
int nprime;
void sieve(int n)
{
int limit=sqrt(n*1.0)+1,s=0;nprime=0;
mark[1]=true;
mark[2]=false;
prime[nprime++]=2;
for(int i=3;i<=n;i+=2){
if(!mark[i]){prime[nprime++]=i;
... | 1 | 92,894,370 |
#include <bits/stdc++.h>
using namespace std;
template<typename T> void drop(const T &x){cout<<x<<'\n';exit(0);}
void solve() {
int n, d;
cin >> n >> d;
vector<vector<int>> x(n, vector<int>(d));
for(int i=0; i<n; ++i) {
for(int j=0; j<d; ++j) {
cin >> x[i][j];
}
}
int ans = 0;
for(int i=0; i... | #include <iterator>
#include <list>
#include <algorithm>
#include <iostream>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <sstream>
#include <iomanip>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <numeric>
using namespace std... | 1 | 23,349,805 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
string s,t("... | #include <bits/stdc++.h>
using namespace std;
int main(void){
string S;
cin >> S;
string T = "keyence",S1 = " ", S2 = " ",T1;
int k = 0;
bool flag = true;
for(int i = 0; i < S.size(); i++){
if(S[i] != T[k] && flag == true){
flag = false;
S1 = S.substr(0,i);
... | 1 | 74,358,636 |
#include <bits/stdc++.h>
using namespace std;
long long n;
vector<long long> a;
map<long long, long long> mp;
long long solve();
int main() {
cin >> n;
a.resize(n);
for (int i = 0; i < n; ++i) cin >> a[i];
cout << solve() << endl;
return 0;
}
long long solve() {
mp[0] = 1;
long long res = 0, now = 0;
fo... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
signed main(){
lint N; cin >> N;
vector<lint> a(N);
lint sum = 0;
map<lint, lint> MAP;
MAP[0]++;
for(lint i = 0; i < N; i++) cin >> a[i], sum += a[i], MAP[sum]++;
lint ans = 0;
for(auto value : MAP){
ans += (value.second - 1) * va... | 1 | 73,470,181 |
#include <cstring>
#include <map>
#include <unordered_map>
#include <string>
#include <list>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <cstdio>
#include <iostream>
#include <set>
#include <unordered_set>
using namespace std;
#define MAX(a,b) (a>b?a:b)
#define MIN(a,b) (a<b?a:b)
t... | #include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
const ll LINF=1LL<<60;
const int IN... | 1 | 75,874,139 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll one = 1;
const ll INF = 9223372036854775807;
const int inINF = 2147483647;
const ll MOD = 100000000... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0,i##_max=(N);i<i##_max;++i)
#define repp(i,l,r) for(int i=(l),i##_max=(r);i<i##_max;++i)
#define per(i,N) for(int i=(N)-1;i>=0;--i)
#define perr(i,l,r) for(int i=r-1,i##_min(l);i>=i##_min;--i)
#define all(arr) (arr).begin(), (arr).end()
#define S... | 1 | 53,459,435 |
#include <stdlib.h>
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main(void){
int N;
int K;
long long A[100010];
long long B[100010];
long long CAN[30];
cin >> N >> K;
for(int i=0;i<N;i++){
cin >> A[i] >> B[i];
}
CAN[0] = K;
int count... | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double,double> pdd;
#define IOS ios_base::sync_with_stdio(0); cin.tie(0)... | 1 | 70,361,622 |
#include <iostream>
using namespace std;
int main()
{
int x;
cin >> x;
cout << 180*(x -2);
return 0;
} | #include <iostream>
#include <vector>
#include <chrono>
#include <random>
std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
int main() {
std::ios_base::sync_with_stdio(false); std::cin.tie(NULL);
int n;
std::cin >> n;
std::cout << (n - 2) * 180 << '\n';
} | 1 | 56,982,638 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>... | #include <iostream>
#include <cstdio>
#include <string>
#include <queue>
#include <functional>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define rep1(i,n) for(int i=1;i<=(n);++i)
#define all(c) (c).begin(),(c).end()
typedef pair<int,int> P;
priority_queue<P,vector<P>,greater<P> > que;
int main(){
wh... | 1 | 24,654,934 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n, ans;
int main()
{
ios::sync_with_stdio(false);
cin >> n;
for (ll i = sqrt(n) + 1; i >= 1; i--)
{
if (n % i == 0)
{
ans = i + n / i - 2;
cout << ans << endl;
break;
}
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int mod = 1e9+7;
#define pi pair<int,int>
#define pl pair<lld,lld>
#define dump(x) cout << #x << " = " << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO" ) << endl
#define Yes(n) cout << ((n) ? "Y... | 1 | 21,228,032 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define str to_string
#define endl "\n"
#define PI 3.141592653589
using namespace std;
using lint = long long;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size()... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x)... | 1 | 66,048,292 |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define all(v) v.begin(),v.end()
#define sz size()
#define mp make_pair
#define pb push_back
#define rep(p,a,b) for(ll p=a ; p<b ; p++)
#define F first
#define S second
using namespace std;
typedef vector <ll> vl;
typedef pair< ll, ll > pll;
int main()... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const ll INF_LL = 1001001001001001001LL;
int main(void){
int n; cin >> n;
vector<int> a(n); rep(i,n) cin >> a[i];
int dif = -1;
rep(i,n){
for(int j = i+1;j<n;j++){
... | 1 | 38,699,295 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
#define int long long
using P = pair<int,int>;
signed main(){
int n,m;cin >>n >>m;
vector<P> res;
rep(i,n){
int a,b;cin >> a >> b;
res.emplace_back(a,b);
}
sort(res.begin(),r... | #include <cmath>
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
int main() {
int n, m;
cin >> n >> m;
ll sum = 0;
vector<P>p(n);
for (int i = 0; i < n; i++) {
cin >> p[i].first >> p[i].second;
}
sort(p.begin(), p.e... | 1 | 20,596,480 |
#include <bits/stdc++.h>
using namespace std;
int i,j;
long long k,ans[55];
int main(){
scanf("%lld", &k);
long long t = k / 50;
k = k % 50;
for(i = 0; i < 50; i++)
ans[i] = i + t;
for(i = 0; i < k; i++){
for(j = 0; j < 50; j++){
if(i == j)
ans[j] += 50LL;
else
ans[j]--;
}
}
printf("%d\n", 50);
... | #include <iostream>
#include <stdio.h>
#include <string.h>
#define int long long
using namespace std;
signed main()
{
int n=50,K;
scanf("%lld",&K);
int avg=K/n,rst=K%n;
printf("%lld\n",n);
for(int i=1;i<=rst;i++) printf("%lld ",n-1+avg-rst+n);
for(int i=rst+1;i<=n;i++) printf("%lld ",n-1+avg-rst);
printf("\n");
... | 1 | 64,250,615 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0;}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0;}
int ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#... | 1 | 84,092,029 |
#include <iostream>
#include <cstdio>
#include <utility>
using namespace std;
class Dice{
int T,S,E,W,N,D;
public:
Dice(int T, int S, int E,
int W, int N, int D)
: T(T), S(S), E(E),
W(W), N(N), D(D) {}
int get_top(){ return T; }
int get_south(){ return S; }
int get_east() { return E; }
void ... | #include <iostream>
#include <string>
using namespace std;
class Dice
{
private:
int top, front, right, left, back, bottom, temp;
public:
void set(int *nums)
{
this->top = nums[0];
this->front = nums[1];
this->right = nums[2];
this->left = nums[3];
this->back = nu... | 1 | 71,362,692 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
while (true) {
int n;
cin >> n;
if (n == 0) {
break;
}
int count = 0;
bool leftdown = true;
bool rightdown = true;
bool up = false;
for (int i = 0; i < n; i++) {
string str;
cin >> str;
if (str == "lu") {
leftdown... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(i64 (i) = (s);(i) < (e);(i)++)
#define all(x) x.begin(),x.end()
#define let auto const
int main() {
i64 n;
while(cin >> n, n) {
vector<string> f(n);
rep(i,0,n) cin >> f[i];
i64 now = 0;
i64 state = 0;
i64... | 1 | 49,728,423 |
#include <iostream>
using namespace std;
const int MAX = 100000;
int parent(int i){
return i/2;
}
int left(int i){
return 2*i;
}
int right(int i){
return 2*i + 1;
}
int main() {
ios::sync_with_stdio(false);
int H, i, A[MAX+1];
cin >> H;
for(i=1; i<=H; i++) cin >> A[i];
for(i=1; i<=H; i++){
... | #include <iostream>
#include <cstdio>
using namespace std;
int parent(int i) { return i / 2; }
int left(int i) { return 2 * i; }
int right(int i) { return 2 * i + 1; }
int main()
{
int H[300];
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &H[i]);
for (int i = 1; i <= n; i++) {
printf("node %... | 1 | 73,899,398 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll mod = 1000000007;
const int INF = 1001001001;
int main(){
ll n ; cin >> n;
vector<ll> a(n);
rep(i,n){
cin >> a.at(i);
... | #include <bits/stdc++.h>
using namespace std;
int main(){
long long int N,ans=0,tmpf,tmpb;
cin >> N;
vector<long long int> A(N);
vector<pair<long long int,long long int>> P;
for(int i=0;i<N;i++){
cin >> A[i];
}
sort(A.begin(),A.end());
tmpf = A[0];
tmpb = A.back();
for(in... | 1 | 29,374,779 |
#include <iostream>
using namespace std;
int main() {
int x;
cin >> x;
cout << ((x < 1200) ? "ABC" : "ARC") << endl;
return 0;
} | #include <iostream>
int main(){int x;std::cin>>x;std::cout<<((x<1200)?"ABC":"ARC");} | 1 | 10,403,702 |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a,cnt=0,cmp;
vector<int> q;
int w[6]={500,100,50,10,5,1};
while(1){
cin >> a;
if(a==0){break;}
q.push_back(a);
}
int g=q.size();
for(int j=0;j<g;j++){
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define all(c) (c).begin(), (c).end()
#define rep(i, n) for (... | 1 | 14,603,851 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define MIN(a,b) ((a)>(b)? (b): (a))
#define MAX(a,b) ((a)<(b)? (b): (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
int main(){
string a, b, c;
cin >> a >... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL -1
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
string A, B, C;
cin >> A >> B >> C;
char a, b, c, d;
a = A.at(A.size() - 1);
b = B.at(0);
c = B.at(B.size() - 1);
d = C.at(0);
if ((a == b) && (c == d)) {
cout << "YES" << endl;
}
... | 1 | 33,833,475 |
#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long long ll;
const int INT_INF = 1e9;
const ll INF = 1LL << 30;
int main() {
ll n; cin >> n;
V<ll> v(n);
for(int i = 0; i < n; i++){
ll a; cin >> a;
v[i] = a - (i + 1);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9+7;
int main() {
ll n;
cin >> n;
if(n==1){
cout << 0 << endl;
return 0;
}
vector<ll>a(n);
for(ll i=0;i<n;i++){
cin >> a[i];
a[i]-=(i+1);
}
sort(a.begin(),a.end());
ll... | 1 | 37,027,836 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using P = pair<int, int>;
int modPow(long long a, long long n, long long p) {
if (n == 0) return 1;
if (n == 1) return a % p;
if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;
long long t = ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
int n=min(a,b);
int m=max(a,b);
for(int i=0;i<m;i++)
cout<<n;
} | 1 | 45,060,100 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int MOD = 1e9 + 7;
void add(int &a, int b)
{
a = (a + b) % MOD;
}
int main()
{
int n, k;
cin >> n >> k;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
vector<vector<int>> dp(n+1, vector<int>(k+1, 0));
dp[0][0] = 1... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
# define M_PI 3.14159265358979323846
const int MOD=1e9+7;
void solve(){
int n,k;
cin>>n>>k;
vector<int>a(n+1);
for(int i=1;i<=n;i++)
cin>>a[i];
int dp[n+1][k+1];... | 1 | 2,545,132 |
#include <iostream>
using namespace std;
int width, height;
int ans = 0;
char map[20][20];
int checked[20][20];
void search(int x, int y);
int main(){
while (1) {
ans = 0;
for (int y=0; y<20; y++) {
for (int x=0; x<20; x++) {
map[y][x] = '#';
checked[y][x] = 0;
}
}
cin >> width >> height;
if (w... | #include <bits/stdc++.h>
using namespace std;
#define iota(i,n,b,s) for(int i=int(b);i!=int((b)+(s)*(n));i+=(s))
#define range(i,n,m) iota(i,(((n)>(m))?((n)-(m)+1):((m)-(n)+1)),(n),((n)>(m)?-1:1))
#define rep(i,n) iota(i,(n),0,1)
#define INF (1e9)
#define EPS (1e-9)
#define cons(a,b) (make_pair(a,b))
#define car(a) (a.... | 1 | 91,126,201 |
#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define pi pair<int,int>
#define pl pair<long long,long long>
#define lg length()
#define pb push_back
ifstream in("file.in");
ofstream out("file.out");
#define MAXN 100005
... | #include <iostream>
#include <vector>
using namespace std;
const int MAXn = 1e5 + 10;
vector<int> g[MAXn];
int n, odd[MAXn], even[MAXn];
int dfs(int v, int par) {
if (g[v].size() == 1 && par != 0)
return 1;
int cnt = 0;
for (int i = 0; i < g[v].size(); i++)
if (g[v][i] != par) {
cnt += dfs(g[v][i], v);
}
i... | 1 | 5,635,189 |
#include <bits/stdc++.h>
using namespace std;
#define R (long long)(1e9 + 7)
#define INF (long long)(1e16L + 5)
#define ll long long
#define grid vector<vector<ll>>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<i... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define FOR(i, a, b) for (int i = a; i <= (b); i++)
#define ROF(i, a, b) for (int i = a; i >= (b); i--)
using pii = pair<int, int>; using vpii = vector<pii>... | 1 | 22,075,460 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
void solve()
{
ll a[] = {1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
ll k;
cin>>k;
cout<<a[k-1]<<endl;
}
int main()
{
ios_base::sync_wit... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl ;
typedef pair<ll,ll> pl;
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define rep(i,N) for(int i=0; i < (int)N; i++)
#define all(v) (v).begin(),(v).end()
const int MOD = 998244353;
const int INF = 10... | 1 | 80,119,618 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.