code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include<stdio.h>
int main()
{
int A,B,C;
scanf("%d%d",&A,&B);
C=A*B;
printf("%d",C);
return 0;
} | #include <bits/stdc++.h>
#define sz(arr) (int)arr.size()
#define all(arr) arr.begin(), arr.end()
using namespace std;
void _cin() {}
template <class Head, class... Tail>
void _cin(Head&& head, Tail&&... tail) {
cin >> head;
_cin(forward<Tail>(tail)...);
}
#define Cin(T, ...) \
T __VA_ARGS__; \
_cin(__VA_A... | 0 |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
int cnt;
int l;
int A[1000000];
int n;
std::vector<int> G;
void insertionSort(int A[], int n, int g) {
for (int i = g; i < n; i++) {
int v = A[i];
int j = i - g;
while (j >= 0 && A[j] > v) {
A[j + g] = A[j];
j -= g;
... | #include <iostream>
#include <algorithm>
#include <string>
#define N 50
using namespace std;
struct data{
string l;
int p,a,b,c,d,e,f,s,m;
double cal;
};
int main(){
int n,i,j,time;
struct data d[N];
while(1){
cin >> n;
if(n==0) break;
for(i=0;i<n;i++){
cin >> d[i].l >> d[i].p >> d[i].a >>... | 0 |
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
#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 ... | #include <iostream>
#include <cmath>
using namespace std;
void sort(int *val, int n) {
for (int i = n - 1; i > 0; i--) {
for (int j = 0; j < i; j++) {
if (val[i] < val[j]) swap(val[i], val[j]);
}
}
}
bool judge(int *val, int n, int num) {
for (int i = 0; i < n; i++) {
if (val[i] % num != 0) return false;... | 0 |
#include "bits//stdc++.h"
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define ALL(v) v.begin(), v.end()
typedef pair<int, int> P;
ll mod_pow(ll a, ll n) {
if (n == 0) return 1;
if (n % 2 == 0) {
ll tmp = mod_pow(a, n / 2);
return (tmp * tmp) % MOD;
}
return (a *... | #include <bits/stdc++.h>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
main() {
int64_t n;
cin >> n;
int64_t x = 0;
vector<int64_t> xx(n);
for (auto i : irange(0L, n)) {
int64_t aa;
cin >> aa;
x ^= aa;
xx[i] = x;
}
constexp... | 1 |
using namespace std;
#include <bits/stdc++.h>
int main()
{
int a,b,c,d;
cin>>a>>b>>c>>d;
if(a+b==c+d)std::cout << "Balanced" << std::endl;
else if(a+b<c+d)std::cout << "Right" << std::endl;
else std::cout << "Left" << std::endl;
} | #include<iostream>
using namespace std;
int main()
{
char S[3];
cin>>S;
if(S[0]=='7'||S[1]=='7'||S[2]=='7')
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
}
| 0 |
#include <iostream>
using namespace std;
#define N 8
#define FREE 0
#define NOT_FREE -1
bool BOARD[N][N] = { false };
int C_COL[N], C_ROW[N], C_DIAGONAL_L[2*N], C_DIAGONAL_R[2*N];
void printBoard() {
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if (BOARD[i][j])
if (C_ROW[i] != j) ... | #include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N = 1e5+5;
ll minnx[N];
int n;
struct node {
ll l,r;
}a[N],s[N];
bool cmp(node a,node b){
return a.l>b.l;
}
int main(){
cin>>n;
ll maxx=0,minn=1e17,maxlen=0;
for(int i=1;i<=n;i++){
cin>>a[i].l>>a[i].r... | 0 |
#include <cctype>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
bool includes_keyword(const char *str) {
const static char *keywords[] = { "the", "this", "that" };
for (const auto keyword : keywords) {
const char *pos = strstr(str, keyword);
if (pos == NULL) { continue; }
... | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
long long int nums[10000];
bool flags[10000];
int index[10000];
int main(){
while(true){
int n;
cin >> n;
if(n == 0){
break;
}
for(int i = 0; i < 10000; i++){
nums[i] = 0;
flags[i] = tr... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
//#define int long long
//signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int h,w;
cin >> h >> w;
vector<int> a(h*w);
for(int i = 0; i < h; i++) {
for(int j = 0; j <... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for(int(i) = (int)(m); i < (int)(n); ++i)
#define rep2(i, m, n) for(int(i) = (int)(n)-1; i >= (int)(m); --i)
#define REP(i, n) rep(i, 0, n)
#define REP2(i, n) rep2(i, 0, n)
#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
using ll = long ... | 0 |
// C
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 1e12
#define PB push_back
#define PF push_front
#define fi first
#define se second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vpi vector<pii>
#define vll vector<ll>
#define vp... | 0 |
#include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false);cin.tie(NULL)
using namespace std;
#define int long long
#define MOD 1000000007
typedef vector<int> vi;
typedef pair<int,int> pi;
#define inf 1e18
#define For(i,a,b) for (int i = a; i < b; i++)
#define Rep(i,a,b) for (int i = a; i <= b; i++)
#define ps(x,... | #include <iostream>
#include <algorithm>
#include <deque>
using namespace std;
int H, W;
string S[2020];
int pt[2020][2020];
deque<pair<int, int> > st;
int main(int argc, const char * argv[]) {
cin >> H >> W;
for (int i = 0; i < H; ++i)
cin >> S[i];
for (int i = 0; i < H - 1; ++i) {
stri... | 0 |
#include <bits/stdc++.h>
#define bp __builtin_popcountll
#define pb push_back
#define in(s) freopen(s, "r", stdin);
#define out(s) freopen(s, "w", stdout);
#define inout(s, end1, end2) freopen((string(s) + "." + end1).c_str(), "r", stdin),\
freopen((string(s) + "." + end2).c_str(), "w", stdout);
#define fi first
#def... | #include <bits/stdc++.h>
using namespace std;
using llong = long long;
using ldbl = long double;
using lpair = pair<llong, llong>;
#define ALL(x) x.begin(), x.end()
constexpr llong mod = 1e9+7;
constexpr llong inf = mod * mod;
int main() {
llong N;
vector<vector<lpair>> A;
cin >> N;
A.resize(N + 1);
for ... | 0 |
#include <iostream>
#include <string>
using namespace std;
int main(){
int i,j,n,k[100],l,len,h;
string s,out;
char data[52]={'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z','A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U',... | #pragma GCC target ("avx2")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("O3")
#include "bits/stdc++.h"
#include <unordered_set>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long ll;
const ll MOD = /*1'000'000'007LL;*/ 998'244'353LL;
#define pb push_back
#define mp make_pa... | 0 |
#include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
using P = pair<ll,ll>;
using graph = vector<vector<int>>;
const int dx[4]... | #include <bits/stdc++.h>
int main(){
int N, T;
std::cin >> N >> T;
std::vector< std::pair< int, int > > AB(N);
for(int i=0; i<N; i++){
std::cin >> AB[i].first >> AB[i].second;
}
std::sort(AB.begin(), AB.end());
std::vector< std::vector< int > > dp(N + 1, std::vector< int >... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
int k;
vector<P> d;
char table[8][8];
vector<int> row;
vector<int> col;
void show_vec(vector<int>);
void solve(){
sort(col.begin(), col.end());
do{
vector<P> v;
for (auto &e: d) v.push... | #include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <stack>
#define N 8
using namespace std;
stack<char> s[N][N];
char map[N][N];
int kazu;
void post(int a,int b){
for(int i=0;i<N;i++){
s[i][b].push(1);
if(i!=b) s[a][i].push(1);
}
for(int i=1;i+a<N&&i+b<N;i++){
s[a+i][b+i].push(1);
}
for(in... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
char s[1500];
int i,n;
cin>>s;
n=strlen(s);
for(i=0;i<n-8;i++){
cout<<s[i];
}
return 0;
}
| #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#... | 0 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int) (n); i++)
using namespace std;
int main(){
int A[55] = {2, 7, 17, 37, 47,
67, 97, 107, 127, 137,
157, 167, 197, 227, 257,
277, 307, 317, 337, 347,
367, 397, 457, 467, 487,
... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main(){
int n; cin >> n;
vector<int> sosu, ans;
int cnt = 0;
for(int i = 2; i <= 555555; i++){
int j;
for(j = 0; j < sosu.size(); j++){
if(i % sosu[j] == 0){
break;
... | 1 |
#include<cstdio>
int main() {
while (1) {
int m, nmin, nmax, p[201], maxg = 0, n;
scanf("%d %d %d", &m, &nmin, &nmax);
for (int i = 1; i <= m; i++) {
scanf("%d", &p[i]);
}
for (int j = nmin; j <= nmax; j++) {
if (p[j] - p[j+1] >= maxg) {
maxg = p[j] - p[j+1];
n = j;
}
}
if (m == 0 && nm... | #include <stdio.h>
char buf[100];
int l[10], v[2];
int main() {
while (scanf("%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d", l, l + 1, l + 2, l + 3, l + 4, l + 5, l + 6, l + 7, l + 8, l + 9, v, v + 1) != -1) {
int total = 0;
int i;
for (i = 0; i < 10; i++) total += l[i];
int now = 0;
for (i = 0; i < 10; i++) ... | 0 |
#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 "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "unordered_map"
#include "unordered_set"
#include "iomanip"
#include "cmath"
#include "random"
#include "bitset"
#include "cstdio"
... | 1 |
#include<iostream>
using namespace std;
int main() {
int n, a[100], i, j, flag, hoge, counta = 0;
cin >> n;
for (i = 0; i < n; i++)cin >> a[i];
flag = 1;
while (flag) {
flag = 0;
i = 0;
for (j = n - 1; j > i; j--) {
if (a[j] < a[j - 1]) {
hoge = a[j];
a[j] = a[j - 1];
a[j - 1] = hoge;
fla... | #include <iostream>
#include <vector>
using namespace std;
bool linearSearch(const vector<int>& ary, int key) {
for (auto i = 0; i < ary.size(); i++) {
if (ary[i] == key) {
return true;
}
}
return false;
}
int main(void) {
int n;
cin >> n;
vector<int> S(n);
for ... | 0 |
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <cmath>
#include <string.h>
using namespace std;
#define FOR(i,s,e) for (int i = int(s); i != int(e); i++)
#define REP(i,e) fo... | #include<iostream>
#include<string>
using namespace std;
int main(){
int n;
int i;
while(cin >> n){
i=n;
string s[n];
cin.ignore();
while(n--){
getline(cin,s[n]);
int ix=0;
while( ( ix =s[n].find("Hoshino") ) >=0 ){
s[n].replace(ix,7,"Hoshina");
}
}
while(i--){
cout << s[i] << endl;
... | 1 |
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <complex>
#include <ctime>
#include <cst... | #include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main(){
int l[10];
char c;
while(1){
for(int i = 0 ; i < 10 ; i++){
cin >> l[i] >> c;
if(cin.eof()) return 0;
}
int a, b;
cin >> a >> c >> b;
int n = 0;
for(int i = 0 ; i < 10 ; i++){
... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define PI 3.141592653589793
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef long double ld;
ll modpow(ll a, ll p, ll M){
ll ret = 1;
while(p){
if(p & 1) ret = ret * a % M;
... | //product of pairs
#include<bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 7;
int main()
{
long long int tt;
tt = 1;
while (tt--)
{
long long int n, i, count = 0;
cin >> n;
long long int a[n + 1], p[n + 1];
for (i = 1; i <= n; i++)
{
cin... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <string>
#include <set>
#include <bitset>
#include <unordered_map>
#include <cmath>
#include <functional>
#include <map>
#include <cstdlib>
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
usin... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
const ll INF = 1e17;
template<typename T, typename E, typename F, typename G, typename H>
class LazySegmentTree {
int n, height;
F f; G g; H h; const T ti; const E ei;
vector<T> dat; vector<E> laz... | 0 |
#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//namespace mp = boost::multiprecision;
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#de... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 MOD = 1e9 + 7;
const i64 INF = i64(1e18) + 7;
template <typename T>
bool chmin(T& x, T y){
if(x > y){
x = y;
return true;
}
return false;
}
template <typename T>
bool chmax(T& x, T y){
if(x < y){
... | 1 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) X.beg... | #include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <queue>
#include <stack>
#include <string>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
int main(void){
int n;
while (cin >> n, n) {
vect... | 0 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cmath>
using namespace std;
const int MAXN = 100 + 5;
int n, m;
char gra[MAXN][MAXN];
short sum[MAXN][MAXN];
int ex, ey;
short f[MAXN][MAXN][MAXN][MAXN];
int... | #include<bits/stdc++.h>
using namespace std;
int line[110][110],col[110][110];
short dp[101][101][101][101];
int main()
{
int n,m,x,y;scanf("%d%d\n",&n,&m);
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++)
{
line[i][j]=line[i][j-1];col[i][j]=col[i-1][j];
char ch=getchar();
if (ch=='E') {x=i;y=j;}
else if (ch==... | 1 |
#include <stdio.h>
int main() {
int N=0, K= 0, z= 1;
scanf("%d\n%d", &N, &K);
for (int i = 0; i < N; i++) {
if (2 * z <= z + K) {
z *= 2;
} else {
z += K;
}
}
printf("%d\n", z);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define fsp(x) cout << fixed << setprecision(x)
const ll inf = LLONG_MAX;
const long double pi = M_PI;
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}... | 0 |
#include <bits/stdc++.h>
typedef long long ll;
#define pb push_back
using namespace std;
typedef pair<ll,ll> pll;
ll n;
string s;
ll a[200005];
ll b[200005];
const ll mod = 1e9 + 7;
ll ans;
ll suf[200005];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
cin >> n; ... | //#include <bits/stdc++.h>
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
//#include "boost/multiprecision/cpp_int.hpp"
//typedef boost::multiprecision::cpp_int LL;
typedef long double dd;
#define i_7 (ll)(1E9+7)
//#define i_7 998244353
#define i_5 i_7-2
ll mod(ll a){
ll c=a%i_7;
if(c>=0)r... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define REPP(i,a,b,c) for(int i=a; i<=b; i+=c)
#define REP(i,a,b) REPP(i,a,b,1)
#define REVV(i,a,b,c) for(int i=a; i>=b; i-=c)
#define REV(i,a,b) REVV(i,a,b,1)
#define FOR(i,a) REP(i,0,(int)a-1)
#define FORD(i,a) REV(i,(int)a-1,0)
#define MP make_pair
#define PB push_back
#... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const ll mod=1000000007;
ll fac[200007],finv[200007],inv[200007];
void cominit(){
fac[0]=fac[1]=1;
finv[0]=finv[1]=1;
inv[1]=1;
for(int i=2;i<200007;i++){
fac[i]=fac[i-1]*i%mod;
inv[i]=mod-inv[mod%i]*(mod/i)%mod;
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N, V, P;
int64_t M;
cin >> N >> M >> V >> P;
vector<int> A(N);
for (int i = 0; i < N; i++)
{
cin >> A.at(i);
}
sort(A.rbegin(), A.rend());
int Ab = A.at(P - 1);
int64_t acc = 0;
vector<int64_t> diff(N);... | #include "bits/stdc++.h"
using namespace std;
void Main() {
long long N;
cin >> N;
vector<long long> A(N, 0), B(N, 0), C(N, 0);
for (long long i = 0; i < N; ++i) {
cin >> A[i];
}
for (long long i = 0; i < N; ++i) {
cin >> B[i];
}
for (long long i = 0; i < N; ++i) {
... | 0 |
#include <cmath>
#include <cstdio>
#include <vector>
#include <iterator>
#include <iostream>
#include <algorithm>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <map>
#include <stdio.h>
#include <functional>
#include <chrono>
using namespace std;
#define rep(i,s,n) for(ll i=... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll MOD = 1e9+7;
// const ll MOD = 998244353;
const ll INF = 1ll<<60;
#define FOR(i,a,b) for (ll i=(a);i<(ll)(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define DEBUG(x) std::cerr << #x << "... | 1 |
#ifdef __GNUC__
#pragma GCC target("avx2")
#pragma GCC optimize ("O30")
#pragma GCC optimize ("tree-vectorize")
#pragma GCC optimize("unroll-loops")
#define iss std::cin
#endif
#include "bits/stdc++.h"
#define rep(i, times) for(ll i = 0; i < (times); ++i)
#define p(x) (cout << (x) << "\n")
using ll = long long; using l... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define MOD 1e9+7;
using namespace std;
using ll = long long;
int main() {
ll n, ans = 0;
cin >> n;
vector<ll> a(n), b(n), c(n);
rep(i,n) cin >> a[i];
sort(a.begin(), a.end());
rep(i,n) cin >> b[i];
sort(b.begin(), b.end());
rep(i,n) c... | 1 |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
bool a[2001][2001];
int res[2001][2001],v2[2001][2001],v1[2001][2001];
int main(){
IOS
int n,m,q;
cin>>n>>m>>q;
for(int i=1;i<=n;i++){
int cnt=0;
string s;
cin>>s;
for(int j=... | 1 |
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int,int>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define ld long double
#define al(a) (a).begin(),(a).end()
#define mk make_pair
#define check cout<<"?"<<endl;
ll MOD=1000000007;
ll mod=998244353;
int inf... | #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 FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
using P = p... | 1 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair <int, int>
#define pll pair <ll, ll>
#define pci pair <char, int>
#define pld pair <ld, ld>
#... | #include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
using namespace std;
#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)
ty... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,x,y,z;
cin>>a>>b;
x=a+b;
y=a-b;
z=a*b;
if(x>=y && x>=z)
{
cout<<x<<endl;
}
else if(y>=x && y>=z)
{
cout<<y<<endl;
}
else
{
cout<<z<<endl;
}
return 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>;
using Graph = vector<vector<int>>;
int main(int argc, const char * argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
int a,b;
cin>>a>>b;
int ans=-1e9;
ans=max(ans,... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using vi = vector<int>;
int d[30];
ll f[30][2][2];
int main() {
int D;
cin>>D;
memset(d, 0, sizeof(d));
int i = 0;
while (D>0) {
d[i] = D % 10;
D /= 10;
i++;
}
ll ans = 0;
for (int len = i-1; len <= 20; ++le... | #include<bits/stdc++.h>
#define fo(i,a,b) for((i)=(a);i<=(b);i++)
#define rfo(i,a,b) for((i)=(a);i>=(b);i--)
#define inrange(x,y,z) (((x)>=(y))&&((x)<=(z)))
#define ALL(vec) (vec).begin(),(vec).end()
#define SOR(vec) sort(ALL(vec))
#define UNI(vec) (vec).erase(unique(ALL(vec)),(vec).end())
using namespace std;
int n;
d... | 0 |
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 3e5 + 5;
typedef long long ll;
template <typename T> void chkmax(T &x, T y) {x = max(x, y); }
template <typename T> void chkmin(T &x, T y) {x = min(x, y); }
template <typename T> void read(T &x) {
x = 0; int f = 1;
char c = getchar();
for (; !isdigit(c);... | #include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#define initdp(a, b) for (int i = 0; i <= a; i++) for (int j = 0; j <= b; j++) dp[i][j] = -1;
#define pb push_back
#define mpr make_pair
#define pii pair<int, int>
#define ll long long
#define pll pair<ll, ll>
#define all(arr) arr.begin(), ar... | 0 |
#include<iostream>
using namespace std;
long long n;
long long a[200003];
long long dp[200003];
long long sumb[200003];
long long ans=-2e18;
long long sum;
long long su;
int main(){
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i];
dp[1]=a[1];
dp[2]=a[2];
sumb[n]=a[n];
sumb[n-1]=a[n-1];
for(int i=3;i<=n;i++) dp[i]=dp[i-... | #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 all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#defi... | 0 |
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define rep(i,N) for(int i=0;i<(int)N;i++)
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
static inline void PUT(char c)
{
static char buf[1<<15],*ptr=buf;
if(ptr==buf+strlen(buf)||c==0){fwrite(buf,1,pt... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef vector<int> vi;;
typedef vector<ll> vll;
#define l() length()
#define sz() size()
#define b() begin()
#define e() end()
#define all(x) x.begin(... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for (int (i) = 0; (i) < (n); i++)
#define ll long long
using namespace std;
int main() {
ll N = 0, A,B;;
cin >> N >> A >> B;
if(N == 1){
cout << "Hello World";
}
else{
cout << A + B;
}
}
| #include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <algorithm>
#include <numeric>
#include <random>
#include <vector>
#include <array>
#include <bitset>
#include <queue>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map... | 0 |
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n = 0, tmp0 = 0, tmp1 = 0;
int tmp2 = 0, tmp3, out1 = 0, out2 = 0;
int a[100];
scanf("%d", &n);
while (n) {
for (tmp3=0;tmp3<100;tmp3++) a[tmp3] = 0;
tmp0 = 0, out2 = 0;
while (tmp0 < n) {
tmp1 = 0... | #include <iostream>
#include <cstdio>
using namespace std;
int main(){
int n,field[11][11];
while (cin >> n, n){
for (int i = 0; i < 11; i++){
for (int j = 0; j < 11; j++) field[i][j] = 0;
}
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++) cin >> field[i][j];
}
for (int i = 0; i < n; i++){
... | 1 |
// ABC 089 A- Grouping 2
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << N / 3 << endl;
}
| #include<iostream>
using namespace std;
int main(){
int a,b=0;
cin>>a;
if(a%3==0 && a>0){
b=(a/3)+b;
}
else if(a%3==1 && a>1){
a-=4;
b++;
b=(a/3)+b;
}
else if(a%3==2 && a>2){
a-=5;
b++;
b=(a/3)+b;
}
else{
system("pause");
}
cout<<b;
} | 1 |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
//using Graph = vector<vector<edge>>;
using dou =long double;
string yes="yes";
string Yes="Yes";
string YES="YES";
string no="no";
string No="No";
string NO="NO";
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return tr... | #include <cstdio>
#include <algorithm>
const int N = 100000;
int n, m, v, p, a[N];
bool test(int t)
{
t = n - t;
int amt = v - t - 1;
int i;
for (i = n - 1; a[t] + m < a[i]; --i, --amt);
long long to = 0;
for (int j = i; j > t; --j) to += a[t] + m - a[j];
for (; i > t && to < (long long)amt * m; --i) {
--am... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <array>
#include <algorithm>
namespace ABC168
{
class B
{
public:
B() = default;
~B() = default;
void Run()
{
std::string S;
int K= 0;
std::cin >> K;
std::cin >> S;
std::string answer = S;
i... | #include<bits/stdc++.h>
#define ll long long
const ll mod = 1000000007 ;
bool isInteger(double n)
{
if(floor(n)==ceil(n))
return true ;
return false ;
}
using namespace std ;
int main()
{
int k;
cin>>k;
string s;
cin>>s;
string s1="" ;
if(s.length()<=k)
cout<<s;
else
{
for(int i=0 ;i<s.length() ;i++... | 1 |
#include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
using ll = int64_t;
using Graph = vector<vector<int> >;
const ll M = 100000000... | #include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
using namespace std;
const int N=2005;
int n,m,t,ans;
int dp[N][N],mp[N][N],st[N],f[N],g[N];
char s[N][N];
bool pd(int x1,int y1,int x2,int y2){
int sum;
sum=mp[x1][y1]+mp[x1][y2]+mp[x2][y1]+mp[x2][y2];
return !(sum&1);
}
... | 0 |
#include<cstdio>
#include<utility>
#include<vector>
#include<queue>
using namespace std;
typedef pair<int, int> P;
const int INF = 1050;
struct vertex {
vector<int> to;
int dist = INF;
};
int n, m;
int sd[1000], prv[1000];
vertex ver[1000];
priority_queue<P, vector<P>, greater<P>> q;
int main() {
scanf("... | #include <bits/stdc++.h>
using namespace std;
#define MAXN 1005
vector<int> g[MAXN];
vector<vector<int>> cycles;
int par[MAXN];
void dfs(int u) {
//$ cerr << u << endl;
for(int v : g[u]) {
if(par[v] == -1) {
par[v] = u;
dfs(v);
} else {
int cur = u;
vector<int> cyc = {u};
while(cur != v && par[... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll n,a,b;
cin>>n;
cout<<50<<endl;
a=n/50;
b=n%50;
for(int i=0;i<b;i++){
cout<<50+a-i<<" ";
}
for(int i=b;i<50;i++){
cout<<max(0LL,49+a-i)<<" ";
}
} | #include <cstdio>
#include <iostream>
#include <cassert>
#include <string>
#include <algorithm>
#include <cstring>
#include <utility>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <deque>
#include <unordered_map>
using namespace std;
typedef long long LL;
ty... | 1 |
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int f(int n)
{
return ((n & 1) ? 3 * n + 1 : n / 2);
}
int main()
{
int n, m;
cin >> n >> m;
... | 1 |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int MAXN=1e5+5;
const int MAXB=65;
typedef long long ll;
int n;
ll a[MAXN],p[MAXN],sum;
bool vis[MAXB];
void ins(ll x){
for (ll i=60;i>=0;i--){
if (!vis[i]) continue;
if (x&(1ll<<i)){
if (!p[i]) p[i]=x;
x^=p[... | #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N;
M = N;
int sum = 0;
for (int i=8; i>=0; i--) {
int W=1;
for (int j=0; j<i; j++){
W *= 10;
}
int x;
x = N / W;
sum += x;
N = N - x*W;
}
if (M % sum == 0) {
cout << "Yes" << endl;
}
e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, x;
cin >> N;
x = N%10 + (N%100)/10 + (N%1000)/100 + (N%10000)/1000 + (N%100000)/10000 + (N%1000000)/100000 + (N%10000000)/1000000 + (N%100000000)/10000000 + (N%1000000000)/100000000;
if (N / x * x == N)
cout << "Yes" << endl;
else cout <... | 1 |
#include <iostream>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
int main() {
long long x;
cin >> x;
long long count = (x / (5 + 6)) * 2;
if (x % (5 + 6) == 0) {}
else if (x % (5 +... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> VI;
typedef vector<vector<int>> VVI;
typedef vector<ll> VLL;
typedef vector<vector<ll>> VVLL;
typedef pair<ll, ll> Pair;
template <class T> T input() {T t; cin>>t; return t;}
#define FOR(i,a,b) for (l... | 0 |
#include<bits/stdc++.h>
const int N = 5005;
const long long inf = 1e18;
using namespace std;
typedef pair <int, int> ii;
vector <ii> mv;
int n, ans;
long long dp[N][N], Min[N];
int main(){
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 1; i <= n; i++){
int x, y;... | #include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define ll long long
#define dbg(v) cerr<<#v<<" = "<<v<<'\n'
#define vi vector<int>
#define vl vector <ll>
#define pii pair<int,int>
#define mp make_pair
#define db long double
#define pb push_back
#define all(s) s.begin(),s.end()
template... | 1 |
#include<stdio.h>
#include<string.h>
int main(void)
{
int a,s,d[10],f,g,h,j,i;
scanf("%d",&a);
while(a!=0){
for(i=0;i<10;i++){
d[i]=0;
}
for(i=1;i<=a;i++){
scanf("%d",&s);
d[s]++;
}
for(i=0;i<10;i++){
if(d[i]!=0){
for(j=1;j<=d[i];j++){
printf("*");
}
}
if(d[i]==0){
printf... | #include<stdio.h>
char table[12][13];
void del(int i,int j){
table[i][j]='0';
if(i>0&&table[i-1][j]=='1')del(i-1,j);
if(j>0&&table[i][j-1]=='1')del(i,j-1);
if(i<11&&table[i+1][j]=='1')del(i+1,j);
if(j<11&&table[i][j+1]=='1')del(i,j+1);
return ;
}
int main(){
while(~scanf("%s",table[0])){
for(int i=1;i<12;i++)s... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define iinf 2000000000
#define linf 1000000000000000000LL
#define ulinf 10000000000000000000ull
#define MOD1 1000000007LL
#define mpr make_pair
typedef long long LL;
typedef unsigned long long ULL;
typedef unsigned long UL;
typedef unsigned short US;
typedef pair < int , i... | #include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
#define rint register int
#define gc() getchar()
inline int read(){int r=0,s=0,c=gc();for(;!isdigit(c);s=c,c=gc());for(;isdigit(c);(r*=10)+=c-48,c=gc());return s^45?r:-r;}
int f[16][32768], g[32768], w[16][16], n, E;
int main()
{
n = read(), E = 1<<n... | 1 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
// Acknowledgement: Special thanks to kyomukyomupurin, who developed this
// template.
template <class T, class U>
std::os... | #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>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const int INF = 1e9 + 10;
int A, B;
int main() {
cin >> A >> B;
cout << A * B << endl;
} | 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 <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
int main... | 1 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <sstream>
#include <string>
#include <utility>
#include <map>
#include <memory>
#include <set>
#include <vector>
#inclu... | //g++ -std=gnu++14 a.cpp
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <random>
#inclu... | 0 |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
void chmax(T &a,T b){
if(a<b)a=b;
}
struct maxhist{
vector<int> hist;
struct rect{int height,idx;};
void add_hist(int a){
hist.push_back(a);
}
int get_max(){
int res=0;
stack<rect> s;
for(int j=0;j<hist.size();j++){
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int mod=998244353;
int dp[4][310*310],a[310];
inline int add_mod(int x){
return x<mod?x:x-mod;
}
int main(){
int n,ret=1,sum=0,minus=1;
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",a+i);
ret=(ll)ret*3%mod;
... | 0 |
#include<cstdio>
#include<vector>
#include<map>
#include<climits>
#include<algorithm>
#include<iostream>
using namespace std;
typedef pair<int,int> Pt;
#define MAX 1000001
#define fr first
#define sc second
int main(){
string s;
int ans = 0;
cin >> s;
for(int i=0;i<s.size();){
int a = 0,b = 0,c = 0;
for... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
ll r;
cin >> r;
if(r < 1200) {
cout << "ABC\n";
} else if (r < 2800) {
cout << "ARC\n";
} else {
cout << "AGC\n";
}
return 0;
} | 0 |
#include <bits/stdc++.h>
using namespace std;
void chmax(string &a, string b) {
if (a == "-")
a = b;
else if (a.size() < b.size())
a = b;
else if (a.size() == b.size()) {
if (a < b) a = b;
}
}
long long num[10] = {2, 5, 5, 4, 5, 6, 3, 7, 6};
string dp[11000];
int main() {
int N, M;
cin >> N >... | #include <bits/stdc++.h>
#define ll long long
#define sz(x) (int)x.size()
using namespace std;
int main(){
int n,k;
cin>>n>>k;
vector<int> a(n);
for(int&i:a)cin>>i;
sort(a.begin(), a.end());
reverse(a.begin(), a.end());
ll ans=0;
for(int i=0;i<k;i++)ans+=a[i];
cout<<ans;
} | 0 |
#include <iostream>
int main() {
int N;
std::cin >> N;
int abc_in;
if (N % 111 == 0)
abc_in = N;
else
abc_in = ((N / 111) + 1) * 111;
std::cout << abc_in << std::endl;
return 0;
}
| #include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long int
#define ld long double
using namespace std;
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
int main(){
fast;
string s;
cin >> s;
if(s == "SUN") cout << "7\n";
else if(s == "SAT") cout << "1\n"... | 0 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define vi vector<int>
#define all(x) (x).begin(),(x).end()
#define INF (1<<30)-1
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if(a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const ... | #include <bits/stdc++.h>
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;
}
#ifdef DEBUG
void debug() { cer... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#de... | #include <bits/stdc++.h>
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define SIZE 200005
#define INF 1000000005LL
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
int main(){
int n;
cin >> n;
string s,t;
cin >> s>>t;
for(int i=n;i>=1;i--){
... | 0 |
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
using namespace std;
int n,a,b,c,d,jun[101],x;
typedef pair<int,int> P;
P t[101];
bool cmp(const P& a,const P& b){
return a.first == b.first ... | #include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define INF 2e18
#define eps 1e-9
#define FastRead ios_base::sync_with_stdio(0);cin.tie(0)
#define fRead freopen("input.txt","r",stdin)
#define fWrite freopen("output.txt","w",stdout)
#d... | 0 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 1e5 + 10;
int n, a[maxn];
int c0, c1, cnt, GCD;
bool solve() {
c1 = 0, c0 = 0, cnt = 0, GCD = 0;
for (int i = 0; i < n; i++) {
if (a[i] == 1) {
c1++;
cnt++;
continue;
}
if (a[i] % 2) {
c1++;
a[i]--;
}
else... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcount
#define ll long long
#define mp make_pair
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define Time (doub... | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define qwq(x) cout<<"# "<<#x<<" = "<<x<<endl;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define f(x,y) g[(x)][(y)+52]
using namesp... | 1 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<cstdio>
#include<queue>
#include<deque>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
typedef pair<ll,ll> pll;
const int INF=1e9;
const ll MOD=1e9+7;
ll gcd(ll x,ll y){
if(y==0) return 0;
re... | #include <iostream>
using namespace std;
int bubbleSort(int a[],int n){
int sw=0;
bool flag=1;
for(int i=0;flag;i++){
flag=0;
for(int j=n-1;j>=i+1;j--){
if(a[j]<a[j-1]){
swap(a[j],a[j-1]);
flag=1;
sw++;
}
}
}
return sw;
}
int main(){
int n,a[100],sw;
cin>>n;
for(int i=0;i<n;i++) cin>>a... | 0 |
#ifdef __GNUC__
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include <set>
#include <q... | #include <bits/stdc++.h>
#include <time.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vi = vector<ll>;
using vv = vector<vi>;
const ll INF = 1001001001;
const ll NUM = 1<<10;
//(開始, 今)を管理
//例:
//(0,0), (1,1), (2,2), (3,3), (4,4), (5,5)
//壁(1,2) ... | 1 |
#include <iostream>
#include <vector>
#include <map>
#include <queue>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int N; cin >> N;
vector<int> V(N);
for(int i = 0; i < N; ++i) cin >> V[i];
map<int, int> odd, even;
for(int i = 0; i < N; ++i){
if(i%2 == 0)... | #include <bits/stdc++.h>
using namespace std;
typedef long long signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for(int i = (l) ; i < (r); i++)
#define incII(i, l, r) for(int i = (l) ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) fo... | 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 <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
ll const INF = 1LL << 60;
ll search(ll l, ll r) {
ll ret = INF;
for (ll i = l; i... | 1 |
#include <bits/stdc++.h>
const int N = 100054;
int n, K, ans;
int p[N], fc[N], nc[N], f[N];
inline void up(int &x, const int y) {x < y ? x = y : 0;}
inline void link(int x, int px) {nc[x] = fc[px], fc[px] = x;}
void dfs(int x, int dep = 0) {
for (int y = fc[x]; y; y = nc[y]) dfs(y, dep + 1), up(f[x], f[y] + 1);
i... | #include <bits/stdc++.h>
using namespace std;
#define sz(x) ((int) ((x).size()))
typedef long long ll;
typedef long double ld;
int n, k, r, a[100100];
vector<int> e[100100];
int dfs(int i = 0) {
int d = 0;
for (int j : e[i])
d = max(d, dfs(j) + 1);
if (d + 1 >= k) {
r += a[i] != 0;
return -1;
}
... | 1 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int n,m,i,j,x,y,w,hd,s,xlh,g[100010],v[21][21],f[100010][21],sy,mx,ans,pr,sz;
int main(){
scanf("%d%d",&n,&m);
for(i=1;i<=m;i++){
scanf("%d%d%d",&x,&y,&w);
xlh+=w;
x--;y--;
v[x][y]=v[y][x]=w;
}
mx=1<<n;
for(s=1;s<mx;s++){
for(i=0;i<n;i++)i... |
/*
Writer: SPD_9X2
https://atcoder.jp/contests/arc081/tasks/arc081_d
長方形にできる必要十分条件は、
内側にある四つ角の周り全てに関して、周りにある黒が偶数個
→そのような条件を満たす四つ角グリッドを考えると最大長方形になる
幅1の長方形に関しては全て作れるので、ans初期値はmax(H,W)
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n,m) for(int (i)=(n);(i)<(m);(i)++)
#define rrep(i,n,m) for(int (i)=(n... | 0 |
#include <bits/stdc++.h>
#define MAX 100005
#define bit(x) (1ll << x)
using namespace std;
int n;
int cnt[64];
long long a[MAX], ans;
inline long long Rd() {
long long x = 0; char ch = getchar();
while(!isdigit(ch)) ch = getchar();
while(isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
return x;
}
struct lin... | #include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
int a[220];
int n;
int main(){
cin >> n;
for(int i=0;i<2*n;i++){
cin >> a[i];
}
sort(a,a+n*2);
int len=0;
for(int i=0;i<n;i++){
len+=a[2*i];
}
cout << len;
} | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i = 1; i <= (n); ++i)
#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x... | # include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if(x == 0) { return y; }
else { return gcd(y%x,x); }
}
lint lcm(lint x, lint y) { return x/gcd(x,y)*y; }
int main() {
lint x,y,ans; cin >> x >> y;
if(abs(x) == abs(y)) {
ans = 1;
} else if(abs(x) < abs(y... | 1 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL -1
using namespace std;
const int64_t MOD = 1e9 + 7;
int main() {
int64_t N;
cin >> N;
int64_t rt = sqrt(N);
for (int64_t i = rt; i > 0; i--) {
if (N % i == 0) {
//cout << i << endl;
int64_t n = N / i;
int64_t cnt = 0;
int64_t m = N / i;... | #include<iostream>
using namespace std;
int count(long long n){
int cnt=0;
while(n>0){
n/=10;
cnt++;
}
return cnt;
}
int main(){
long long n;
long long b;
int cur=0;
int ans=100000;
cin>>n;
for(long long i=1;i*i<=n;i++){
if(n%i==0){
b=n/i;
cur... | 1 |
/* When Talent doesn't work, Hard work beats Talent*/
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include"bits/stdc++.h"
using namespace std;
#define Fast_D cout<<fixed<<setprecision(2);
#define FastIO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
... | #include <bits/stdc++.h>
#define rep(i,cc,n) for(int i=cc;i<=n;++i)
using namespace std;
int main() {
vector<queue<char>> v(3);
string s;
cin >> s;
for (char c : s) v[0].push(c);
cin >> s;
for (char c : s) v[1].push(c);
cin >> s;
for (char c : s) v[2].push(c);
char c = 'a';
while (true)
{
... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
vec<int> mult(vec<int>& A,vec<int>& B){
vec<int> C(A.size());
for(int i=0;i<A.size();i++) C[i] = B[A[i]];
return C;
}
vec<int> pow(vec<int>& A,ll n)... | #include <bits/stdc++.h>
using namespace std;
int MAX_N=262144*2;
vector<int64_t> seg(MAX_N*2-1);
int64_t qu(int a,int b,int k,int l, int r){
if(r<=a||b<=l){
return 0;
}
else if(a<=l&&r<=b){
return seg[k];
}
else{
int64_t X=qu(a,b,k*2+1,l,(l+r)/2);
int64_t Y=qu(a,b,k*2+2,(l+r)/2,r);
retur... | 0 |
#include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#include <unistd.h>
#include <cassert>
#include <cctype>
#include <ra... | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int MOD = 1000000007;
int main(){
const int maxSize = 100001;
vector<long long> inv(maxSize);
vector<long long> fact(maxSize);
vector<long long> factInv(maxSize);
for(int i=0;i<2;i++) inv[i] = fact[i] = factInv[... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int time(int a,int b,int c,int d,int e,int m){
int ret = a+b+c+d+e;
rep(i,m-1){
ret += d+e;
}
return ret;
}
bool cmp(const pair<double,string>&a,const pair<double,string>&b){
i... | #include <iostream>
#define N 100
#define WHITE 0
#define BLACK 1
#define INF 10000
using namespace std;
int M[N][N],n,d[N];
void prim(){
int color[n],p[n];
for(int i=0;i<n;i++){
color[i]=WHITE;
d[i]=INF;
}
d[0]=0;
p[0]=-1;
while(1){
int mincost=INF;
int u;
for(int i=0;i<n;i++){
... | 0 |
#include <algorithm>
#include <iostream>
using namespace std;
static const int MAX = 200000;
static const int sentinel = 1000000000;
long int ninvention = 0;
int merge(int A[], int left, int mid, int right) {
int n1 = mid - left;
int n2 = right - mid;
int L[n1 + 1], R[n2 + 1];
for (int i = 0; i < n1; i++)
... | #include <cstdio>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;
using i64=long long;
template <typename T>
struct BinaryIndexedTree {
size_t n;
vector<T> tree;
BinaryIndexedTree(size_t n, T e=0): n(n) {
tree = vector<T>(n+1, e);
}
void add(size_t i, T w) {
... | 1 |
#include<iostream>
#include<string.h>
#include<vector>
#include<list>
#include<stdio.h>
#include<math.h>
#include<iomanip>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << "debug " << x << endl;
using namespace std;
int flood(char map[][14], int i, int j){
... | #include <bits/stdc++.h>
#define cinf(n,x) for(int i=0;i<(n);i++) cin >> x[i];
typedef long long int ll;
using namespace std;
int main(){
int n,p;
int have[50];
while(true){
cin >> n >> p;
if(n==0 && p==0) break;
for(int i=0;i<n;i++) have[i]=0;
int turn=0;
int cnt=p;
while(true){
if(cnt>0){
cn... | 0 |
#include<iostream>
int rounds;
int Ascore, Bscore;
int Acard,Bcard;
int main(){
while (true){
std::cin >> rounds;
if (rounds == 0)break;
for (int i = 0; i < rounds; i++){
std::cin >> Acard>> Bcard;
if (Acard > Bcard){
Ascore += (Acard + Bcard);
}
else if (Acard < Bcard){
Bscore += (Acard + Bc... | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
using namespace std;
int main(){
int M[13] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
string w[7] = {"Wednesday", "Thursday", "Friday", "Saturd... | 0 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
#define PI 3.14159265359
#define INF 1000100100
#define MOD 1000000007
#define all(x) (x).begin(),(x).end()
typedef long long ll;
#define P pair<ll,ll>
#define PP pair<P,P>
using namespace std;
int dp[80][80][16000];
int main(){
int h,w; cin >> h >>... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<long long>v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
... | 0 |
#include <iostream>
#include <cmath>
using namespace std;
int sign(int x){
return (x>0)-(x<0);
}
int main(){
int x,y;
int count = 0;
cin >> x >> y;
if( sign(x)*sign(y)==1 ){
if( x<y ) cout << y-x << endl;
if( x>y ) cout << x-y+2 << endl;
}
if( sign(x)*sign(y)==-1 ){
if( sign(x)*x<=sign(y)*... | #include<bits/stdc++.h>
using namespace std;
using lli = long long;
#define rep(i,n) for(int i=0;i<n;i++)
lli x, y;
int main(void){
cin >> x >> y;
lli ans = 1e18;
rep(i, 2){
rep(j, 2){
lli xc, yc;
xc = x;
yc = y;
lli c = 0;
if(i == 1) xc*=-1, c++;
if(j == 1) yc*=-1, c++;
if(xc <= yc) c+=yc-x... | 1 |
#include<iostream>
using namespace std;
class Dice{
private:
int d_1,d_2,d_3,d_4,d_5,d_6;
public:
void setDice(int a,int b,int c,int d,int e,int f){
d_1 = a;
d_2 = b;
d_3 = c;
d_4 = d;
d_5 = e;
d_6 = f;
}
void roll_w(){
int tmp = d_1;
d_1 = d_3;
... | #include <iostream>
#include <stdlib.h>
using namespace std;
int main() {
int count,box,random,a=0,b=0,i,j,k,n,dice[100][6];
cin >> n;
for(i=0;i<n;i++){
for(j=0;j<6;j++){
cin >> dice[i][j];
}
}
for(k=1;k<n;k++){
if(b==1){
break;
}
... | 1 |
//#include "debug.h"
#include <string.h>
#include <limits.h>
#include <map>
#include <set>
#include <vector>
#include <algorithm>
using namespace std;
const long long M=1000000007;
//typedef long T;
//#include "math/mod.h"
//#include "math/modulo.h"
template<class T, long long M>
struct modulo {
T n;
T gcd_ext(T a... | #include<cstring>
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#define ll long long
using namespace std;//往左走w-1,往下走h-1
const ll mod=1000000007;
ll f[1000000];
ll quick(ll a,ll b)
{
// cout<<"a"<<a<<"b"<<b<<endl;
ll ans=1;
while(b)
{
if(b&1)
{
ans=(ans*a)%mod;
}
b>>=1;
a=(a*... | 1 |
//#include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include<cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <sta... | #include <stdio.h>
#include <stdint.h>
#include <stdbool.h>
#include <stdlib.h>
#include <string.h>
typedef uint64_t ull;
typedef int64_t sll;
static const ull MOD = 1000000007LL;
int n;
int k;
int q;
ull a[200019];
ull umin (ull a, ull b) {
return (a < b) ? a : b;
}
ull umax (ull a, ull b) {
return (a > b) ? a... | 1 |
#include<bits/stdc++.h>
using namespace std;
int main(void){
int x[5];
for(int i=0;i<5;i++)
cin>>x[i];
int k;cin>>k;
sort(x,x+5);
cout<<((x[4]-x[0])>k?":(":"Yay!")<<endl;
return 0;}
| #include <bits/stdc++.h>
#include "atcoder/fenwicktree.hpp"
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
using namespace std;
using namespace atcoder;
using ll = long long;
int main() {
int n, q;
cin >> n >>q;
fenwick_tree<ll> ft(n);
rep(i, n) {
ll s;
cin >> s;
ft.add(i, s);
}
rep(i, q) {
bool t;
... | 0 |
//
// main.cpp
// ITP1_6-A
//
// Created by Saicj on 2015/07/14.
// Copyright (c) 2015??´ saicj. All rights reserved.
//
#include <iostream>
#include <stdio.h>
using namespace std;
int main(int argc, const char * argv[])
{
int n;
int index = 0;
cin >> n;
int numList[n];
while (true)... | #include<stdio.h>
int main(void){
int a,i;
scanf("%d",&a);
int x[a];
for(i=0;i<a;i++){
scanf("%d",&x[i]);
}
for(i=0;i<a;i++){
printf("%d",x[a-i-1]);
if(i!=a-1){
printf(" ");
}else{
printf("\n");
}
}
}
| 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll n, t;
cin >> n >> t;
ll ans = n*t;
ll last;
cin >> last;
for(int i = 1; i < n; ++i){
int cur;
cin >> cur;
if(cur<(last+t)){
ans += (cur-(last+t));
}
last = cur;
}
cout << ans;
return 0;
}
| #include<iostream>
#include<vector>
using namespace std;
int main(){
int n,t;
cin>>n>>t;
vector<int>v(n);
for(int i=0;i<n;i++)
{
cin>>v[i];
}
int current_time=0;
int result=0;
for(int i=0;i<n;i++)
{
int start_time=v[i];
current_time=v[i]+t;
bool in... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
// Your code here!
int k, t;
cin >> k >> t;
vector<int> a(t);
for(int i=0; i<t; i++)cin >> a[i];
sort(a.begin(), a.end(), greater<int>());
cout << max(a[0] - 1 - (k - a[0]), 0) << endl;
}
| #include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
using ll = long long;
#define rep(i,n) for (ll i=0;i<n;i++)
using namespace std;
void solve(){
}
int main (){
... | 0 |
#include <iostream>
#include <vector>
std::vector<long long> common_divisors(long long a, long long b) {
if (a > b) std::swap(a, b);
std::vector<long long> ret(0), st(0);
for (int i = 1; i <= a / i; i++) {
if (a % i == 0) {
if (b % i == 0) ret.push_back(i);
if (b % (a / i) == 0 && i < a / i) st.push_back(a ... | #include<bits/stdc++.h>
using namespace std;
int main(){
int64_t a,b;
cin >> a >> b;
vector<pair<int64_t,int64_t>> res;
int64_t n=gcd(a,b);
for(int64_t i=2;i*i<=n;i++){
if(n%i!=0)continue;
int64_t s=0;
while(n%i==0){
s++;
n/=i;
}
res.push_back({a,s});
}
if(n!=1)res.push_bac... | 1 |
#include <bits/stdc++.h>
#define err(args...) {}
#ifdef DEBUG
#include "_debug.cpp"
#endif
using namespace std;
using ll = long long;
using ld = long double;
template <typename T> using lim = numeric_limits<T>;
template <typename T> istream& operator>>(istream& is, vector<T>& a) { for(T& x : a) { is >> x; } return is; ... | #include <bits/stdc++.h>
#define mset(a, b) memset(a, b, sizeof(a))
#define mcpy(a, b) memcpy(a, b, sizeof(a))
using namespace std;
typedef long long LL;
const int N = 15;
const int MAXS = (1 << N) + 5;
template <typename T> inline void read(T &AKNOI) {
T x = 0, flag = 1;
char ch = getchar();
while (!isdig... | 0 |
#include<bits/stdc++.h>
using namespace std;
#define int long long int
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
typedef vector<int> vi;
const int mod = 1000000007;
int32_t main() {
ios_base::sync_with_stdio(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,l,r) for(int i=(l);i<(r);i++)
#define pb push_back
#define fi first
#define se second
using ll = long long;
using G = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const ll MOD = 1000000007;
ll GCD(ll x, ll y){
return y ? GCD(y... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double R = 0;
cin >> R;//現在のレーティング
double G = 0;
cin >> G;//したいレーティング
//(R + ans) / 2 = G
//R + ans = 2*G
double ans = 0;
ans = 2*G - R;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG //GCC5.4.1で配列の範囲外アクセスをエラーにする
//cmdで g++ test.cpp とするとコンパイルできる
//制限1秒なら10^6は余裕 10^7は多分間に合う 10^8はよほど単純でないと厳しい
// https://github.com/atcoder/live_library
// cppdbg: test.exeのterminalに標準入力を打てる
#define ALL(x) x.begin(),x.end()
#define get_tp(t,i) get<i>(... | 1 |
#include <bits/stdc++.h>
#define MAXN 100010
#define pii pair<int,int>
#define ff first
#define ss second
#define ll long long
#define in_range(x, y, n) (x >= 0 and x<n and y >=0 and y<n)
using namespace std;
const int mod = 1e9 + 7;
int main (){
string s;
cin >> s;
int n = s.size();
for (int i=0; i... | #include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#define ll long long
#define maxn 1010
inline ll read()
{
ll x=0; char c=getchar(),f=1;
for(;c<'0'||'9'<c;c=getchar())if(c=='-')f=-1;
for(;'0'<=c&&c<='9';c=getchar())x=x*10+c-'0';
return x*f;
}
inline void write(ll x)
{
static... | 0 |
#include<iostream>
#include<cstdio>
using namespace std;
void solve(int delta_x){
int number_of_rectangle, height_of_rectangle;
int integer = 0;
number_of_rectangle = 600 / delta_x;
for(int i = 1;i < number_of_rectangle;i++){
height_of_rectangle = (delta_x * i) * (delta_x * i);
integer += height_of_rectangle *... | #include<iostream>
#include<stdio.h>
#include<string.h>
#include<math.h>
using namespace std;
#define MAX 256
#define S(x) (x*x)
int f(int z){
if (z < 10)return 1;
return 1 + f(z / 10);
}
int main(void){
int ans[MAX];
for (int i = 0; i < MAX; i++){
ans[i] = 0;
}
int d;
int i = 0;
while (scanf("%d", &d)... | 1 |
#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 all(x) (x).begin(),(x).end()... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <unordered_map>
#include <queue>
#include <deque>
using namespace std;
using ll = long long;
void _cin(){} template <class Head, class... Tail> void _cin(Head&& head, Tail&&... tail){ cin >> head;... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { ... | #include<bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main()
{
int d,g;
cin>>d>>g;
vector<array<int,2>> s(d);
for(int i=0;i<d;i++)
cin>>s[i][0]>>s[i][1];
int ans=INT_MAX;
for(int i=0;i<(1<<d);i++)
{
int left=-1,sum=0,count=0;
for(int j=0;j<d;j... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.