code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, q;
while (scanf("%d %d", &n, &q) && n){
int a[128] = {0};
for (int i = 0; i < n; i++){
int m;
scanf("%d", &m);
for (int j = 0; j < m; j++){
int x;
... | #include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n, q, m, mx, t, s;
bool a[51][101], f;
while(1){
cin >> n >> q;
if(n == 0 && q == 0){
break;
}
mx = 0;
fill(&a[0][0], &a[50][100], false);
for(int i = 0; i < n; i++){
cin >> m;
for(int j = 0; j < m; j++){
c... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int FB, F, B;
FB = N / 15;
F = N / 3;
B = N / 5;
long long ans = 0;
for(int i = 1; i <= N; i++) {
ans += i;
}
for(int i =1 ; i <= F; i++) {
ans -= i*3;
}
for(int i =1 ; i <= B; i++) {
ans -= i... | #include<bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back
#define sci(x) int x; scanf("%d", &x);
#define TC(x) sci(x); while(x--)
typedef long long ll;
using namespace std;
int main()
{
int n;
cin>>n;
ll sum = 0;
for(int i=1;i<=n;i++){
if(i%5!=0 && i... | 1 |
#if __has_include("debug.h")
#include "debug.h"
#else
#include <bits/stdc++.h>
using namespace std;
#define d(...) 2;
#endif
#define int long long int
#define ld long double
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl "\n"
#define all(c) (c).begin(),(c).end()
#define ra... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i =... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long lint;
typedef long long llint;
typedef pair<int, int> pint;
typedef pair<long long, long long> pllint;
// static const int MAX = 1e6;
// static const int NIL = -1;
// static const llint INF = 1<<21;
// static const llint MOD = 1e9 + 7;
bool compPair(const pi... | #include<bits/stdc++.h>
#define lg long long int
#define loop(i,s,e) for(lg i=s;i<=e;i++)
#define iloop(i,s,e) for(lg i=e;i>=s;i--)
#define pb push_back
#define mp make_pair
#define mod 1000000007
using namespace std;
lg min(lg a,lg b)
{return a<b?a:b;}
lg max(lg a,lg b)
{return a>b?a:b;}
lg lcm(lg a ,lg b)
{
re... | 0 |
#include<bits/stdc++.h>
#include<cctype>
using namespace std;
#define rep(i,n) for (int i=0;i<(n);i++)
#define all(v) (v).begin(),(v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int,int>
int main(){
ll N; cin >> N;
ll a, b, c, d, e; cin >... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <functional>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <bitset>
#define ll long long
using namespace std;
const int MOD = 1000000007;
const long long INF = 1LL << 60;
in... | 0 |
#include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll ... |
#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() {
cerr << endl;
}
template <typename H, typename... T>
void d_err(H h... | 1 |
#include<iostream>
int main() {
int a; std::cin >> a;
std::cout << a + a*a + a*a*a << std::endl;
} | // Example program
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
ll n;
cin >> n;
ll s1 = pow (n,2);
ll s2 = pow (n,3);
cout << n + s1 + s2 << endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define rng(a) a.begin(),a.end()
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
string s;
cin >> s;
int n = s.size();
reverse(rng(s));
bool ok = false;
int cnt = 0, nt = 0;
rep(i,n) {
if(s[i]=='... | 0 |
//#define _USE_MATH_DEFINES
#include <iostream>
//#include <stdio.h>
//#include <iomanip>
//#include <vector>
//#include <string>
//#include <algorithm>
//#include <functional>
//#include <cmath>
using namespace std;
class Dice
{
public:
Dice(int num[6]);
int Play(char c);
int T;
private:
int NS[4],EW[4];
int NS... | #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, k;
cin >> n >> k;
vector<int> x(n);
rep(i, n) cin >> x[i];
int ans = 2e9;
for (int l = 0; l + k - 1 < n; ++l) {
int r = l + k - 1;
if (x[l... | 0 |
#include<stdio.h>
int main(){
char date[10], month[10], year[10];
scanf("%[^/]/%[^/]/%s", year, month, date);
printf("2018/01/%s", date);
return 0;
} | #include<stdio.h>
struct SI{int top;int west;int south;int east;int north;int back;};
struct SI E(struct SI P);
struct SI W(struct SI);
struct SI S(struct SI P);
struct SI N(struct SI P);
int main(){
struct SI P;
char q;
scanf("%d%d%d%d%d%d",&P.top, &P.south, &P.east, &P.west, &P.north, &P.back);
while(scanf("%c"... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
ll sp[100010],sm[100010];
int main(){
int n,k;
cin>>n>>k;
int z=0;
vector<ll> x(n);
vector<ll> p,m;... | #include<bits/stdc++.h>
using namespace std;
main(){
while(1){
long long n,m;
long long sum=0;
cin>>n>>m;
if(n==0&&m==0) break;
long long p[1005];
for(int i=0;i<n;i++){
cin>>p[i];
sum+=p[i];
}
sort(p,p+n,greater<long long>());
for(int i=1;i<=n;i++){
if(i%m==0){
s... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> duo;
#define TT template<typename T>
TT T sq(T x){ return x*x; }
TT int ubnd(vector<T>& v,T x){ return upper_bound(v.begin(), v.end(), x) - v.begin(); }
TT int lbnd(vector<T>& v,T x){ return lower_bound(v.begin(), v.end()... | #include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<functional>
#include<algorithm>
#include<cstdio>
using namespace std;
int main() {
int h, w;
while (cin >> h >> w&&h != 0 && w != 0) {
int t = h*h + w*w;
int h... | 1 |
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define pii pair < int , int >
#define F first
#define S second
#define int long long
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC optimize ("Ofast")
using namespace std;
/// khodaya komak... | #include <bits/stdc++.h>
using namespace std;
#define TRACE(x) x
#define WATCH(x) TRACE(cout << #x" = " << x << endl)
#define WATCHR(a, b) TRACE(for (auto it=a; it!=b;) cout << *(it++) << " "; cout << endl)
#define WATCHC(V) TRACE({cout << #V" = "; WATCHR(V.begin(), V.end());})
#define all(x) (x).begin(), (x).end()
... | 1 |
#include<bits/stdc++.h>
using namespace std;
const double pi=acos(-1.0);
int n,x[105],y[105];
double ang[105];
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)scanf("%d%d",&x[i],&y[i]);
for(int i=1;i<=n;i++)
{
int c=0;
for(int j=1;j<=n;j++)if(i^j)ang[c++]=atan2(y[j]-y[i],x[j]-x[i]);
sort(ang,ang+c);
doub... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i < (n);i++)
using namespace std;
using ll = long long;
using pii = pair<int,int>;
int main(){
int n;
cin >> n;
vector<int> a;
ll sum = 0;
a.push_back(0);
rep(i,n){
int c;
cin >> c;
a.push_back(c);
}
a.push_... | 0 |
#include <bits/stdc++.h>
//#include <atcoder/all>
//using namespace atcoder;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); i++)
typedef pair<int,int> P;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n+1);
for(int i = 1; i <= n; i++) {
cin >> a[i];
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,cnt=0;
cin >> n;
int p[n],m=(1<<30);
for(int i=0;i<n;i++){
cin >> p[i];
if(m>p[i]){
cnt++;
m=min(m,p[i]);
}
}
cout << cnt << endl;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
inline int read() {
int x = 0, fh = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') fh = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = (x << 1) + (x << 3) + c - '0';
c = getchar();
}
return x * fh;
}
const int... | #include<bits/stdc++.h>
#define ll long long
#define P pair<int ,int>
using namespace std;
int main(){
int n;
cin >> n;
vector<int>vec = {};
if(n == 0){
cout << "0" << endl;
return 0;
}
while(n != 1){
if(n%2 == 1 || n%2 == -1){
vec.push_back(1);
... | 0 |
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Kishan Sairam Adapa
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include... | //----------------------------------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
//----------------------------------------------------------------------
using namespace std;
using ll = long long;
using P = pair<int,int>;
using G... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using LL = long long;
using P = pair<int,int>;
int main(){
int N, K;
cin >> N >> K;
int ans = 0;
for(int i = 1; i <= N - K + 1; ++i) {
ans++;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb push_back
#define all(v) (v).begin(), (v).end... | 0 |
#include<cstdio>
#include<cstring>
#define N 300010
using namespace std;
int to[8][2]={2,1,
3,5,
4,7,
6,1,
2,2,
5,5,
3,3,
2,1};
char s[N];
int f[N][8];
const int p=1e9+7;
int main()
{
scanf("%s",s);
int n=strlen(s);
f[n][1]=f[n][5]=1;
for(int i=n-1;i>=0;i--)
for(int j=0;j<8;j++)... | const int LG = 21;
const int FN = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define forn(i, n) for (int (i) = 0; (i)... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a,x) for (auto& a : x)
#define sz(x) (int... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
// #define INF __INT32_MAX__
#define INF 1e9
#define LINF __LONG_LON... | 0 |
#include <bits/stdc++.h>
using namespace std;
/*
提出前に確認!
- setとmultisetを間違えない
*/
int mod = 1e9 + 7;
int main(void)
{
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
long long ans = 0;
long long all = 0;
for (int i = 0; i < n; i++)
{
ans += all * a[i] % mod;
ans %= mod;
all +... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
#define inf 1e6+18
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define mod 1000000007
#define f1(i,n) for(i=1;i<=n;i++)
#define f0(i,n) for(i=0;i<n;i++)
#define w(x) while(x--)
const int maxn=500... | 1 |
#include<iostream>
#include<cmath>
using namespace std;
int main() {
while (1) {
int h, w;
cin >> h >> w;
if (h == 0 && w == 0) break;
int m = h * h + w * w;
bool end = false;
for (int m = h * h + w * w; m <= 45000; ++m) {
//cout << m << endl;
... | //#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define rep(i,n) for(ll (i)=0;(i)<(ll)(n);(i)++)
#define all(x) (x).begin(),(x).end()
#define MOD 1000000007LL
#define INF (1LL<<60LL)
#define int long long
#define MAX_N (100001)
typedef long long ll;
using namespace std;
vector<vector<bool>> v(100, vecto... | 0 |
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int MAXN = 100 + 10;
int total, N;
int a[MAXN]= {0};
int st[MAXN]= {0}, ed[MAXN]= {0};
int odd[MAXN]= {0}, ocnt = 0;
int ans[MAXN]= {0}, acnt = 0;
int getnum () {
int num = 0;
char ch = getchar ();
while (! isdigit (ch))
ch =... | #include<bits/stdc++.h>
#define inf 1000000000
#define N 5005
using namespace std;
char s[N];
int n,m,l[N][N],a[N][N],up[N][N],r[N][N],R[N][N],L[N][N];
int main(){
scanf("%d%d",&n,&m);
for (int i=1;i<=n;i++){
scanf("%s",s+1);
for (int j=1;j<=m;j++){
if (s[j]=='#') a[i][j]=1;
else a[i][j]=0;
}
}
int ans=... | 0 |
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int maxn = 200010;
int n, ans;
int read()
{
int x = 0, w = 1;
char ch = 0;
while (ch < '0' || ch > '9') {
if (ch == '-') w = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + (ch - '0');
ch = getchar(... | /*
M-SOLUTIONS プロコンオープン
3以上の整数Nが与えられる。
正N角形の内角の和を求める。
制約
・3<=N<=100
方針
N角形の内角の和は、(N-2)*180
で求めらえる。
*/
#include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = 0; i <= (n); i++)
using namespace std;
typedef long long ll;
const ll INF = 1LL<<62;
template<... | 1 |
#include <iostream>
#include <iomanip> //setprecision
#include <cstdlib>
#include <cmath>
double abs(double coodinate1, double coodinate2);
int main(void) {
double x1;
double y1;
double x2;
double y2;
std::cin >> x1 >> y1 >> x2 >> y2;
double dif_x = abs(x1, x2);
double dif_y = abs(y1, y2)... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll N,A,B;
cin >> N >> A >> B;
ll now,next;
cin >> now;
ll ans = 0;
for(int i = 0; i < N-1; i++){
cin >> next;
ans += min(abs(now - next)*A, B);
now = next;
}
cout << ans << endl;
}
| 0 |
#include<cstring>
#include<string>
#include<vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<list>
#include<set>
#include<map>
#include<complex>
#include<sstream>
#include<climits>
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
const ll MOD = 10000... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n,h,w;
cin >> n >> h >> w;
int a = 0;
int b = 0;
for(int i = 1; i <= n; i++){
if(i+w-1 <= n) a++;
if(i+h-1 <= n) b++;
}
cout << a*b << endl;
return 0;
} | 1 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <climits>
#include <iostream>
#include <iomanip>
#include <list>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <algorithm>
#include <numeric>
#include <functional>
#define FO... | #include <stdio.h>
#include <limits.h>
int main(){
int n,m,s,i,j;
scanf("%d%d",&n,&m);
int e[m+1][3],dist[m+1],update=1,k,d[200][200];
//printf("xxx");
for(i=0;i<n;i++){
for(j=0;j<n;j++){
if(i==j)d[i][j]=0;
else d[i][j]=INT_MAX;
}
}
for(i=0;i<m;i++){
for(j=0;j<3;j++){
scanf("%d",&e[i][j]);
}
d... | 1 |
#include <iostream>
#include <iomanip>
using namespace std;
int main()
{
char s[4];
cin >> ("%s",s);
if(s[0]=='7'||s[1]=='7'||s[2]=='7')
cout << ("Yes");
else
cout << ("No");
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=100005;
int n,L,Q,x[maxn],f[maxn][18],g[maxn][18];
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&x[i]);
scanf("%d",&L);
for(int i=1;i<=n;i++)
f[i][0]=upper_bound(x+1,x+n+1,x[i]+L)-x-1;
for(int j=1;j<=17;j++)
for... | #ifdef _MSC_VER
#define _CRT_SECURE_NO_WARNINGS
# include <intrin.h>
# define __builtin_popcount __popcnt
#endif
#define _USE_MATH_DEFINES
#include <stdio.h>
#include <iostream>
#include <vector>
#include <unordered_map>
#include <stack>
#include <list>
#include <math.h>
#include <map>
#include <iomanip>
#include <... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define repp(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define repm(i,n) for(int (i)=(n-1);(i)>=0;(i)--)
#define INF (1ll<<60)
#define all(x) (x).begin(),(x).end()
typedef long long lint;
const lint MOD =1000000007;
const lint MAX =... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <deque>
#include <numeric>
#include <sstream>
#include <ioman... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define vt vector
#define sz(x) int((x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
using ll = long long;
using pii = pair<int, int>;
void solve() {
... | #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <cmath>
#include <map>
#include <climits>
#include <cassert>
#include <algorithm>
#include <utility>
using namespace std;
using Int = long long int;
using UInt = unsigned long long int;
using VI = vector<long long int>;
using VVI = vec... | 1 |
//
// abc167_Bracket_Sequencing.cpp
// learningCplusplus
//
// Created by Tran Duc Chinh on 2020/04/04.
// Copyright © 2020 Tran Duc Chinh. All rights reserved.
//
#include <iostream>
#include <queue>
#include <map>
#include <algorithm>
#include <math.h>
using namespace std;
typedef long long ll;
ll mod = 99824435... | #include <bits/stdc++.h>
using namespace std;
using VS = vector<string>; using LL = long long;
using VI = vector<int>; using VVI = vector<VI>;
using PII = pair<int, int>; using PLL = pair<LL, LL>;
using VL = vector<LL>; using VVL = vector<VL>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).... | 0 |
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int n = 50;
int main() {
ll k;
cin >> k;
cout << n << endl;
vector<ll> ret(n, n - 1);
for (int i = 0; i < k % n; i++) {
for (int j = 0; j < n; j++) {
if (i == j)ret[j] += n;
els... | #include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b){
while(b){
a %= b;
swap(a, b);
}
return a;
}
int who_wins(vector<int> a){
int q[2] = {};
for(int v : a) q[v % 2]++;
if(q[0]%2){
return 1;
}
if(q[1] > 1){
return 2;
}
for(int &v : a) if(v%2){
if(v == 1) return 2;
v--;
}
int g = 0... | 0 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int s=0,i=0;
while(s<=n){
i++;
s=i*i;
}
i--;
cout << i*i << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
signed main(){
string N;
cin >> N;
int ans = 0;
bool kuriage = false;
for(int i = N.size()-1; i >= 0; i--) {
int keta = (int)(N[i]-'0');
if (kuriage) {
keta++;
... | 0 |
#include <iostream>
#include <string>
#include <algorithm>
#include <math.h>
using namespace std;
void b_accepted(void) {
string s;
cin >> s;
bool judge_a = false, judge_b = false, judge_c = false;
int cnt_c = 0;
for (int i = 0; i < s.size(); i++) {
if (i == 0) {
if (s[i] == 'A') judge_a = true;
else ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
string S;cin>>S;
if(S[0]!='A'||S.size()<3){printf("WA");return 0;}
int countc=0;
for(int i=2;i<S.size()-1;i++)if(S[i]=='C')countc++;
if(countc!=1){printf("WA");return 0;}
for(int i=1;i<S.size();i++)if(S[i]!='A'&&S[i]!='C'&&S[i]-'A'>=0&&S[i]-'A'<=2... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
long N;
vector<long> t;
cin >> N;
for (int i = 0; i < 5; ++i) {
long k;
cin >> k;
t.push_back(k);
}
long min = *min_element(begin(t), end(t));
cout << ((N - 1) / min) + 5 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
ll mm=1000000000;ll MM=mm+7;
#define rep(i, n) for(int i=0;i<n;i++)
#define PI 3.141592653589793
int main(){
int n;
cin >> n;
VI a(n+2);
a[0]=0;
a[n+1]=0;
for(int i=1;i<=n;i++){
cin >> a.at(i);
... | 0 |
#include <iostream>
using namespace std;
int main() {
int X, Y;
cin >> X >> Y;
if (X < 9 && Y <9){
cout << "Yay!" << endl;
return 0;
}
cout << ":(" << endl;
}
| #include <iostream>
#include <stdio.h>
using namespace std;
int main(void){
int l, i=0, a[10];
while(2 > i){
cin >> a[i];
i++;
}
if (a[0] > 8 || a[1] > 8) {
cout << ":(" << "\n";
} else {
cout << "Yay!" << "\n";
}
} | 1 |
#include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
template<class F>auto recursive(F f){return[f](auto...a){return f(f,a...);};}
template<class T>using rev_priority_queue=priority_queue<T,vector<T>,greater<T>>;
templat... | #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << endl
#define debugArray(x, n) \
for (long long hoge = 0; (hoge) < (n); ++(hoge)) \
cerr << #x << "[" << hoge << "]: " << x[hoge] << endl
using namespace std;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
... | 0 |
//E869120さんのコード
#include <bits/stdc++.h>
using namespace std;
long long N; string S;
int main() {
cin >> N;
if (N == 0) { cout << "0" << endl; return 0; }
while (N != 0) {
if (N % 2 == 1 || N % 2 == -1) { N--; S += "1"; }
else { S += "0"; }
N /= -2;
}
reverse(S.begin(), S.end());
cout << S << endl;
ret... | #include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
bool ans=true;
int cnt=0;
for(int i=0;i<s.size();i++){
if(isupper(s[i])) cnt++;
}
if(cnt!=2) ans=false;
cnt=0;
if(s[0]!='A') ans=false;
for(int i=2;i<s.size()-1;i++){
if(s[i]=='C') cnt++;
}
if(cnt!=1) ans=false;... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 1e5 + 5;
int ans, n, m1, m2, m3, m4;
int a[N];... | #include<bits/stdc++.h>
using namespace std;
int a[3][100000];
int x[100000];
int inv[100000];
int BIT[100001];
void init(){
for(int i=1;i<=100000;i++)
BIT[i]=0;
}
void add(int x){
for(;x<=100000;x+=x&-x)
BIT[x]++;
}
int query(int x){
int res=0;
for(;x>0;x-=x&-x)
res+=BIT[x];
return res;
}
void fail(){
... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(m); i<(int)(n); i++)
#define RREP(i,m,n) for(int i=(int)(n-1); i>=m; i--)
#define rep(i,n) REP(i,0,n)
#define rrep(i,n) RREP(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define fi first
#define se second... | //g++ -std=c++14 test.cpp -o test.out
//問題URL
//https://atcoder.jp/contests/jsc2019-qual/tasks/jsc2019_qual_c
//左端、右端を選んで操作、という操作は
//まず左端のみに注目し、次に右端のみに注目していく
//また最左端にまとめるなんて考え方も
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#i... | 1 |
#include <bits/stdc++.h>
#define REP(i, n) for(long long i=0; i<n; i++)
#define REPR(i, n) for(long long i=n-1; i>=0; i--)
#define FOR(i, m, n) for(long long i=m; i<=n; i++)
#define FORR(i, m, n) for(long long i=m; i>=n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, k, tem, ans;
cin >> a >> b >> c >> k;
ans = a + b + c - max({a, b, c});
tem = max({a, b, c});
for ( int i = 0; i < k; i++ ) {
tem *= 2;
}
cout << ans + tem << endl;
return (0);
} | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | #include<cstdio>
#include<algorithm>
#define RI register int
#define CI const int&
using namespace std;
const int N=100005;
int n,a[N],m,v,p; long long sum[N];
inline bool cmp(CI x,CI y)
{
return x>y;
}
int main()
{
RI i; for (scanf("%d%d%d%d",&n,&m,&v,&p),i=1;i<=n;++i) scanf("%d",&a[i]);
for (sort(a+1,a+n+1,cmp),i=... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define each(itr,v) for(auto itr:v)
#define pb push_back
#define all(x) (x).be... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i,s, t) for(int i = s; i < t; i++)
#define ALL(a) a.begin(), a.end()
#define SZ(x) (int)x.size()
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define SORT(a) sort(ALL(a))
using VI = vector<int>;
using LL = long long;
using VVL = vector<vector<LL>>;
u... | 1 |
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<n;++i)
using namespace std;
typedef pair<int,int>P;
const int N = 1 << 17;
//?????????????????????0?§???????
//????°????????±???????????????°??????(RMQ)
//?????°???????????¨???????????°???????... | #include <cmath>
#include <cstdio>
#include <vector>
#include <algorithm>
#pragma warning(disable : 4996)
using namespace std;
int N, Q;
int main() {
scanf("%d%d", &N, &Q);
vector<int> tp(Q), s(Q), t(Q), x(Q);
for (int i = 0; i < Q; i++) {
scanf("%d%d", &tp[i], &s[i]);
if (tp[i] == 0) scanf("%d%d", &t[i], &x[i])... | 1 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)
#define Rep(i, r, n) for (ll... | #include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#ifndef AT_HOME
#define getchar() IO::myGetchar()
#define putchar(x) IO::myPutchar(x)
#endif
namespace IO {
static const int IN_BUF = 1 << 23, OUT_BUF = 1 << 23;
inline char myGetchar() {
static char buf[IN_BUF], *ps = buf, *pt = buf;
if... | 1 |
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
using namespace std;
#define INF 100000000
#define... | #include <iostream>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <algorithm>
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using hset = unordered_set<T>;
template<class Key, class T> using hmap = unordered_map<Key, T... | 1 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<sstream>
#include<numeric>
#include<cassert>
#define f first
#define s second
#define mp make_pair
#define ... | #include <cstdio>
using namespace std;
typedef long long LL;
const int N = 55;
int n; LL K, a[N];
template <class T> inline void in(T &x) {
x = 0; int f = 1; char ch = getchar();
for (; ch<'0' || ch>'9';) {if (ch=='-') f=-1; ch = getchar();}
for (; ch>='0' && ch<='9';) x = x*10 + (LL)ch-'0', ch = getchar();
x *= ... | 0 |
#include <iostream>
#include <cstring>
#include <cmath>
#include <vector>
#include <algorithm>
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <set>
#include <map>
#include <iterator>
#include <stack>
#include <string.h>
#include <cstdlib>
#include <queue>
#include <list>
#include <string>
using name... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define ALL(a) (a).begin(... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A;
cin >> A;
int B;
cin >> B;
int count=0;
int a1,a2,a3,a4;
// ここにプログラムを追記
for(int i=0;i<B-A+1;i++){
a1=(A+i)/10000;
a2=((A+i)%10000)/1000;
a3=(((A+i)%10000)%1000)%100... | /* FUCK U*/
#include <iostream>
#include <fstream>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <string>
using namespace std;
void solve(){
int n,k,count;
cin>>n>>k;
for(int i=n;i<=k;++i){
string str=to_string(i);
if(str.at(0)==str.at(4) && str.at(1)== str.a... | 1 |
#include <iostream>
int triple(int n) {
return n * n * n;
}
int main() {
int input;
std::cin >>input;
std::cout << triple(input) << std::endl;
return 0;
} | #include <bits/stdc++.h>
#include <math.h>
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rrep(i, n) for(int i = (n-1); i >= 0; i--)
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const ll INF = 1LL<<60;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } ret... | 0 |
#include <stdio.h>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
using namespace std;
int base[3] = {0, 0, 0};
void Hit()
{
if (base[2] == 1)
{
base[2] = 0;
}
if (base[1] == 1)
{
base[2] = 1;
}
if (base[0] == 1)
{
base[1] = 1;
}
else if (base[0] == 0)
{
base[0] = 1;
... | #include <bits/stdc++.h>
using namespace std;
template <typename T> void print(T t) { cout<<t<<endl; }
template<typename T, typename... Args> void print(T t, Args... args) { cout<<t<<" "; print(args...); }
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl '\n'
#define int long long
#define d... | 0 |
#include<bits/stdc++.h>
using namespace std;
const int maxn=100010,mod=998244353;
#define lson o<<1,l,mid
#define rson o<<1|1,mid+1,r
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define ROF(i,a,b) for(int i=(a);i>=(b);i--)
#define MEM(x,v) memset(x,v,sizeof(x))
inline int read(){
int x=0,f=0;char ch=getchar();
while... | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int N, M;
int a[300], b[300], c[300];
int g[15][15];
ll dp[1<<15][15];
const ll INF = 1e+12;
int main(){
ios::sync_with_stdio(false);
cin.t... | 1 |
#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const st... | #include <cstdio>
typedef long long LL;
const int N=1000005,mo=998244353;
LL fac[N],inv[N];
LL ksm(LL x,int y){
LL i=1;
for (;y;y>>=1,x=x*x%mo)
if (y&1) i=i*x%mo;
return i;
}
void Pre(int n){
fac[0]=1;
for (int i=1;i<=n;i++) fac[i]=fac[i-1]*i%mo;
inv[n]=ksm(fac[n],mo-2);
for (int i=n;i>=1;i--) inv[i-1]=inv[i]*... | 0 |
#pragma region header
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define mt make_tuple
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i > static_cast<decltype(i)>(-1); i--)
#de... | #include <bits/stdc++.h>
using namespace std;
typedef vector< vector<int> > vvi;
typedef vector< vector<bool> > vvb;
typedef vector< vector<char> > vvc;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef long long ll;
int main(){
int N;
string S;
cin >> N >> S;
ll a=0,b=... | 0 |
#include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
// output
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');... | #include <iostream>
#include <algorithm>
#include <string>
#include <cstdio>
#include <set>
#include <queue>
#include <map>
#include <iomanip>
#include <cstring>
#include <cmath>
using namespace std;
const long double eps = 1e-12;
typedef long long ll;
typedef pair<int , int> pt;
#define sz(a) ((int) a.size() )
#def... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a(4);
vector<int> b(2);
for (int i = 0; i<4; i++) {
cin >> a[i];
}
for (int i = 0; i<2; i++) {
cin >> b[i];
}
sort(a.begin(), a.end());
sort(b.begin(), b.end());
cout << a[3] + a[1] + a[2] +b[1] <... | #include<iostream>
#include<stdio.h>
using namespace std;
int main(){
int a[4],e,f,sum=0,x=120;
for(int i=0;i<4;i++){
cin >> a[i];
sum=sum+a[i];
if(a[i]<x)x=a[i];
}
sum=sum-x;
cin >> e;
cin >> f;
if(e>f){sum=sum+e;}
else if(e<f){sum=sum+f;}
else if(e==f){sum=sum+e;}
cout << sum << endl;
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
#define mod 1000000007
#define INF (1LL<<60)
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define YES puts("YES")
#define Yes puts("Yes... | #include<stdio.h>
int main() {
char character1[100];
char character2[100];
scanf("%s", character1);
scanf("%s", character2);
printf("%s%s", character2, character1);
return 0;
} | 0 |
#include <bits/stdc++.h>
#define FASTIO
using namespace std;
using ll = long long;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = numeric_limits<int>::max();
constexpr ll L_INF = numeric_limits<ll>::max();
//=================================... | #include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
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; } return 0; }
ll mod= 1e9 + 7;
... | 1 |
#include<iostream>
#include<climits>
using namespace std;
// 完成版。
int tree[(1 << 18)];
void Update(int s, int t, int m, int left = 0, int right = (1 << 17), int key = 0){
if(t < left || right <= s) return;
if(s <= left && right - 1 <= t){ tree[key] = max(tree[key], m); return; }
Update(s, t, m, left, (lef... | #include <iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
using namespace std;
struct Node {
int key;
Node *left, *right, *parent;
};
Node *root, *NIL;
void insert(int k) {
if(root == NIL) {
root = (Node *)malloc(sizeof(Node));
root->key = k;
root->left = root->r... | 0 |
#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(void){
int n, r;
cin >> n >> r;
if(n < 10) cout << r+100*(10-n) << endl;
else cout << r << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s; int w; cin >> s >> w;
string ans = "";
for (int i = 0; i < s.size(); i+=w) {
ans += s[i];
}
cout << ans << endl;
return 0;
} | 0 |
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
const int N = 45;
const int mod = 1e9 + 7;
using namespace std;
int n, x, y, z, now, lim, f[N][(1 << 17) + 5], ans;
template < typename T >
inline T read()
{
T x = 0, w = 1; char c = getchar();
while(c < '0' || c > '9') { if(c == '-') w... | #include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string... | 1 |
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include <random>
#include... | #include<iostream>
#include<string.h>
#include<string>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<bitset>
#include<math.h>
#include<stack>
#include<queue>
#include<set>
#include<map>
using namespace std;
typedef long long ll;
typedef long double db;
typedef vector<int> vi;
typedef pair<int,int> pii... | 1 |
//kruskal tree
#include <cstdio>
#include <algorithm>
using namespace std;
#define M 100000
int parent[M],a[M],b[M];
pair<int,int>node[M];
int root(int a){return parent[a]==a?a:parent[a]=root(parent[a]);}
int unite(int a,int b){
int x=root(a),y=root(b);
if(x==y)return 0;
parent[x]=y;
return 1;
}
int main(){
int i,... | #include <bits/stdc++.h>
#define rep(n) for(int i=0;i<n;i++)
#define repp(j, n) for(int j=0;j<n;j++)
#define reppp(i, m, n) for(int i=m;i<n;i++)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define debug(x) cerr << #x << ": " << x << endl
using namespace std;
typedef long long ll;
typedef p... | 1 |
#include <iostream>
#include <vector>
#include <utility>
using namespace std;
void fnInput(int &rnMaxSiz, vector<int> &rvnNum)
{
cin >> rnMaxSiz;
rvnNum.resize(rnMaxSiz);
for (int i = 0; i < rnMaxSiz; i++)
cin >> rvnNum[i];
}
void fnPartition(vector<int> &rvnNum, int nStart, int nEnd, int &nCur)
{
for (... | #include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;
#define println(x) cout << x << endl;
using namespace... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
for (int i = 0; i < h; i++) cin >> s[i];
int cnt = 0;
queue<pii> q;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++) {
if (s[i][j... | #include <bits/stdc++.h>
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define irrep(i,n) for(int i = (int)(n-1); i > -1; i--)
#define irrep2(i,n,a) for(int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using ll = long long;
u... | 1 |
#include<bits/stdc++.h>
#define MOD_1_000_000_007 (1000000007LL)
#define LINF (1LL<<60)
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define rep1(i, n) for (long long i = 1; i < (long long)(n); i++)
#define rep2(i, n) for (long long i = 2; i < (long long)(n); i++)
#define rep0c(i, n) for (lo... | #include <iostream>
using namespace std;
int main(int argc, char* argv[]) {
int ina, inb, n;
cin >> n;
while(n != 0){
int a=0, b=0;
for(int i=0;i<n;i++){
cin >> ina >> inb;
if(ina > inb){
a += ina+inb;
}else if(ina < inb){
b += ina+inb;
}else{
a += ina;
... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 100000000;
#define rep1(i, n) for (ll i=0; i<(n); i++)
#define rep2(i, k, n) for (ll i=k; i<(n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>... | #include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
ll l, r;
cin >> l >> r;
if(r - l >= 2019){
cout << 0;
}
else{
ll ans = 2018;
for(long long i = l; i <= r - 1; i++){
for(long long j... | 1 |
#include<iostream>
int H,W,A,B;
int main(){
std::cin>>H>>W>>A>>B;
for(int i=0;i<H*W;i++)std::cout<<(i%W<A^i/W<B)<<(i%W==W-1?"\n":"");
return 0;
} | #include<stdio.h>
//this file is not a C file but a C++ file
void seisekiduke(void);//宣言
int main(void){
int stnum;//the number of the student
while(1) {
scanf(" %d", &stnum)... | 0 |
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define piii pair<int,pii>
#define pll pair<ll,ll>
#define plii pair<ll,pii>
#define vi vector<int>
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define SORT(x) sort(x.begin(), x.end())... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D, X, Y;
cin >> A >> B >> C >> D;
X = min(A, B);
Y = min(C, D);
cout << X + Y << endl;
} | 0 |
#include<bits/stdc++.h> //Ithea Myse Valgulious
namespace chtholly{
typedef long long ll;
#define re0 register int
#define rel register ll
#define rec register char
#define gc getchar
//#define gc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<23,stdin),p1==p2)?-1:*p1++)
#define pc putchar
#define p32 pc(' ')
#define pl puts("... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | 1 |
#include <bits/stdc++.h>
using namespace std;
int h, w;
string s[400];
int a[400][400];
int b = 0;
pair<int, int> dyx[4] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
void bfs(int y, int x) {
queue<pair<int,int>> q;
q.push(make_pair(y, x));
a[y][x] = b;
while (!q.empty()) {
int x, y;
tie(y, x) = q.front();
... | #include <bits/stdc++.h>
using namespace std;
using State = pair<pair<int, int>, int>;
int MX = 81*2*81 + 9;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
int n, m;
cin >> n >> m;
//n = 80; m = 80;
vector<vector<int>> a(n, vector<int>(m));
for (int i = 0; i < n; i++) {
f... | 0 |
#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
#define FOR(i,k,n) for(int i=(k); i<(int)n; ++i)
#define REP(i,n) FOR(i,0,n)
#def... | #include<bits/stdc++.h>
using namespace std;
typedef pair< int, int > Pi;
const static int dy[] = {0, 1, 0, -1};
const static int dx[] = {1, 0, -1, 0};
const static int INF = 1 << 30;
int w, h, mas[20][20];
Pi S, G;
bool In(int x, int y)
{
return(0 <= x && x < w && 0 <= y && y < h);
}
int rec(int x, int y, int d, ... | 0 |
#include<iostream>
#include<string>
#include<vector>
#include <algorithm>
using namespace std;
int main() {
int N,x;
cin >> N >> x;
int a;
vector<int> A(N);
for(int i=0;i<N;i++){
cin >> a;
A.at(i) = a;
}
sort(A.begin(), A.end());
int count=0;
for(int i=0;i<N;i++){
... | #include <bits/stdc++.h>
#define inf 0x3f3f3f3f3f3f3f3f
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define fi first
#define se second
#define N 305
using namespace std;
typedef pair<int,int> Pair;
const int mod = 1e9 + 7;
inline int add(int x, int y) { return (x += y) - (x >= mod ? mod : 0); }
inline void inc(int... | 0 |
#include <bits/stdc++.h>
using namespace std;
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
#ifdef __LOCAL
#define debug(x) cerr << __LINE__ << ": " << #x << " = " << x << endl
#define debugArray(x, n) ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
cout<<n + (n*n) + (n*n*n);
}
| 0 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <chrono>
using namespace __gnu_pbds;
using namespace std;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
// order_of_key (val): returns the no. of values le... | #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 A,B,C;
cin>>A>>B>>C;
if((A<C&&C<B)||(B<C&&C<A)){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
return 0;}
/*compile
g++ code.cpp
./a.o... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
string s;
cin >> s;
vector<long long> b;
int ans ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 200 + 10;
ll a[maxn];
const int L = 63;
ll d[L];
bool add(ll x){
for(int i = L - 1; i >= 0; i--) if(x & 1ll << i){
if(d[i] == -1){d[i] = x; return true;}
x ^= d[i];
}
return false;
}
int main(){
// Fast... | 1 |
#include<cstdio>
#include<algorithm>
using namespace std;
int mod;
int mypow(int a,int b)
{
int ans=1;
while(b)
{
if(b&1)ans=1ll*ans*a%mod;
a=1ll*a*a%mod;
b>>=1;
}
return ans;
}
int n,pw2[6005],pw3[6005],ans=0,fac[6005],invfac[6005];
int main()
{
scanf("%d%d",&n,&mod);n=3*n;
pw2[0]=pw3[0]=1;
pw2[1]=mypow(... | #include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
using ll = long long int;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
#define l_ength size
ll MOD;
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll b){
a = (a<MOD)?a:(a-M... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define mtv(kit) cout<<#kit<<" - "<<kit<<"\n";
#define ff first
#define ss second
#define pb push_back
#define rep(i,a,b) for(i=a;i<b;i++)
#define pii pair<ll , ll>
#define all(x) x.begin(),x.end()
#define nl "\n"
#define ump unordered_map
void doit(){... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
const ll MOD = 10000... | 0 |
#include <bits/stdc++.h>
//#include <atcoder/all>
#define rep(i, n) for (int i=0; i < (n); i++)
using namespace std;
//using namespace atcoder;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
const int INF = 1 << 30;
const ll LINF = 1LL << 61;
const int NIL = -... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main()
{
int a,b;
cin >> a >> b;
int ans = 0;
for(int i = a; i <= b; i++){
string s = to_string(i);
string t = s;
reverse(t.begin(),t.end());
if(s == t){
ans++;
... | 0 |
#include<cstdio>
#include<algorithm>
#include<functional>
using namespace std;
int main()
{
int i,a[4],b,c,sum;
for(i=0;i<4;i++){
scanf("%d",&a[i]);
}
scanf("%d %d",&b,&c);
sort(a,a+4,greater<int>());
for(i=0;i<3;i++){
sum+=a[i];
}
if(b>c){
sum+=b;
}
else{
sum+=c;
}
printf("%d\n",sum);
return 0;
}
... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
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; }
const int INF=1001001001;
vector<pair<int64_t,int64... | 0 |
#include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
typedef pair<ll, ll> P;
// forループ
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
// 定数宣言
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
// グラフ表現
using Graph = vector<vector<int>>;
// グラフの辺表現
using Edge = map<pair<int,int>,i... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
#def... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";... | #include<stdio.h>
#include<string.h>
#include<stdlib.h>
int i,j,k;
int a,b,c,flag[304],n;
typedef struct result{
int x,y,z,r;
}RESULT;
RESULT w[1005];
int main(){
scanf("%d %d %d",&a,&b,&c);
while(a!=0 && b!=0 && c!=0){
for(i=1;i<=a+b+c;i++)flag[i]=2;
scanf("\n%d",&n);
for(i=1;i<=n;i++){
scanf("%d %d %d %... | 0 |
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
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; } re... | #include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ll long long
#define mod107 1000000007
#define rep(i, n) for (int i = 0; i < n; ++i)
using Graph = vector<vector<int>>;
#define grepq priority_queue<double, std::vector<double>, std::greater<double>>
#define all(v) v.begin(), v.end()
#define PI ac... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
int N;
int D[100010];
int mod = 998244353;
signed main()
{
cin >> N;
rep(i, N)
{
int d;
cin >> d;
D[d]++;
if(i == 0 && d != 0)
{
cout << 0 << endl;... | #include <bits/stdc++.h>
#include <algorithm>
#include <map>
#include <cstdlib>
#include <cmath>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
const double pi=acos(-1);
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
int main(... | 0 |
#include<stdio.h>
#include<math.h>
#include<algorithm>
#define reg register
#define ri reg int
#define rep(i, x, y) for(ri i = x; i <= y; ++i)
#define nrep(i, x, y) for(ri i = x; i >= y; --i)
#define DEBUG 1
#define ll long long
#define max(i, j) (i) > (j) ? (i) : (j)
#define min(i, j) (i) < (j) ? (i) : (j)
struct IO ... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;
int main()
{
// que[R] = {L, index_of_query};
... | 1 |
#include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
using ll = long long int;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = 998244353ll;
#define l_ength size
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll b){
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using P = pair<ll, ll>;
template <typename T> using pq = priority_queue<T>;
template <typename T> using minpq = priority_queue<T, vector<T>, greater<T>>;
... | 0 |
///\/\/\/
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i,x,y) for(ll i=x;i<y;i++)
#define irep(i,a) for(auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n,a) ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i]
#define vecrep(n,a,type) vector<type>a(n);rep(i,0,n)c... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; i++)
#define repr(i, n) for(int i = n; i >= 0; i--)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main()
{
int n;
cin >> n;
vector<int> even(1e5+1, 0);
vector<int> odd(1e5+1, 0);
rep(i,n) {
... | 1 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)
#define Rep(i, r, n) for (ll... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int i,n,su=0;
string a,s,d;
cin>>n>>a>>s>>d;
set<char>se;
for(i=0;i<n;i++)
{
se.insert(a[i]);
se.insert(s[i]);
se.insert(d[i]);
su+=se.size()-1;
se.clear();
}
cout<<su<<endl;
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(ll i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vect... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <iomanip>
using ll = long long;
using uint = unsigned int;
using graph = std::vector<std::vector<ll>>;
using wGraph = std::vector<std::vector<std::pair<l... | 0 |
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<set>
#include<algorithm>
#include<utility>
#include<map>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
const int INF = 1001001001;
ll pow_mod(ll p, ll n, ll m) {
if (n == 0) return 1;... | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
constexpr char newl = '\n';
constexpr double ep... | 0 |
#include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
template<class F>auto recursive(F f){return[f](auto...a){return f(f,a...);};}
template<class T>using rev_priority_queue=priority_queue<T,vector<T>,greater<T>>;
templat... | #include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
namespace IO {
template <typename _T>
inline bool read (_T& x) {
x = 0;
_T y = 1;
char c = getchar();
while ((c < '0' || '9' < c) && c != EOF) {
if (c == '-') y = -1;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<int> A(N);
for (int i = 0; i < N; i++) cin >> A.at(i);
while (K--) {
vector<int> V(N);
for (int i = 0; i < N; i++) {
V.at(max(0, i - A.at(i)))++;
if (i + A.at(i) + 1 < N) V.at(i + A.at(i) + 1)--;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 200005;
ll n, k;
array<ll, N> old, nw;
bitset<N> used;
int main() {
cin.sync_with_stdio(0); cin.tie(0);
cin >> n >> k;
vector<ll> a(n);
for (auto& i : a) cin >> i;
for (int i = 0; i < n; ++i) {
old[max... | 1 |
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <cmath>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <iostream>
#include <random>
#include <map>
#include <iomanip>
#include <stdlib.h>
#inclu... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <math.h>
#include <map>
using namespace std;
int main(){
double n;
cin >> n;
cout << n*(180-(360/n)) << endl;
return 0;
}
| 1 |
#include <iostream>
using namespace std;
#define MOD 1000000007
int main(int argc, const char * argv[]) {
int N;
cin>>N;
int *A=new int[N];
long long s=0,s2=0;
for(int i=0;i<N;++i){
cin>>A[i];
s+=A[i];
s%=MOD;
s2+=(long long)A[i]*A[i];
s2%=MOD;
}
s*=s... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i < b; i++)
#define out(x) cout << x << endl
#define EPS (... | 0 |
#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) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | #include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
if(n - 1)
{
int a, b;
cin >> a >> b;
cout << a + b << endl;
}
else
{
cout << "Hello World" << endl;
}
return 0;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int k; cin >> k;
string s; cin >> s;
string ans;
if (s.size() <= k) ans = s;
else {
ans = s.substr(0, k);
ans += "...";
}
cout << ans << endl;
return 0;
} | //abc168
#include <bits/stdc++.h>
#include <string>
using namespace std;
int main() {
int k;
string s;
cin >> k >> s;
if(s.size() <= k){
cout << s;
}else{
cout << s.substr(0,k) << "..." << endl;
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define F_OR(i, a, b, s) for (int i=(a); (s)>0?i<(b):i>(b); i+=(s))
#define F_OR1(e) F_OR(i, 0, e, 1)
#define F_OR2(i, e) F_OR(i, 0, e,... | #include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
int main()
{
int a[5],k;
for(int i=0;i<5;i++)
{
cin>>a[i];
}
cin>>k;
sort(a,a+5);
string ans="Yay!";
if(a[4]-a[0]>k)
{
ans=":(";
}
cout<<ans<<endl;
} | 1 |
#include "bits/stdc++.h"
typedef long long ll;
#define int ll
#define fi first
#define se second
#define SORT(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; i++)
#define REP(i,n) for(int i = 0;i < (n) ; i++)
#define MP(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define INF LLONG_MAX/2
#defi... | /**
*Makacha
**/
#include <bits/stdc++.h>
using namespace std;
template <typename T> inline void read (T &x) {bool b = 0; char c; while (!isdigit (c = getchar()) && c != '-');
if (c == '-') c = getchar(), b = 1; x = c - 48; while (isdigit(c = getchar())) x = (x<<3) + (x<<1) + c - 48; if (b)x=-x;}
template <typenam... | 1 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.