code_file1 stringlengths 80 4k | code_file2 stringlengths 91 4k | similar_or_different int64 0 1 |
|---|---|---|
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define LL long long
using namespace std;
LL A[1010][1010];
int n,Color[1010][1010];
int N,P[101010],T1[1010*1010],T2[1010*1010],n1,n2;
bool f[101010],vis[1010][1010];
int dx[4]={0,0,1,-1},dy[4]={1,-1,0,0};
void Pre(){
for (int i=2;i<=100000;i++... | #include<bits/stdc++.h>
using namespace std;
long long a[1100],na,n;
bool p(int x){for (int i=2;i<x;i++)if (x%i==0)return 0;return 1;}
int main(){
for (int i=2;i<=8000;i++)if (p(i))a[++na]=i;
cin>>n;
for (int i=1;i<=n;i++){
for (int j=1;j<=n;j++)
if ((i+j)%2==0)cout<<a[(i+j)/2]*a[(i-j+n)/2+n+1]<<' ';
else co... | 1 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 4e5 + 10;
int s[maxn], t[maxn];
int a[maxn], b[maxn];
int fail[maxn];
int n, m;
void getfail()
{
memset(fail, 0, sizeof(fail));
int len = n;
int j = 0, k = fail[0] = -1;
while (j < len)
{
while (k != -1 && t[j] != t[k])
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename T>
struct Compress {
vector<T> xs;
Compress(const vector<T>& vs) : xs(vs) {
sort(xs.begin(), xs.end());
xs.erase(unique(xs.begin(), xs.end()), xs.end());
}
int compress(const T& x) {
return ... | 1 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef lon... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll A[222222];
ll N;
cin >> N;
ll i;
for(i=0;i<=N-1;i++)
cin >> A[i];
ll sum[222222] = {0}; //sum[i]=A[i]までの和
sum[0] = A[0];
for(i=1;i<=N-1;i++){
sum[i] = (sum[i-1] + A[i]) % 1000000007;
}
ll ans = 0;
for(i=0;... | 0 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#define rep(i,l,r) for(int i=(l);i<=(r);++i)
#define per(i,r,l) for(int i=(r);i>=(l);--i)
using namespace std;
const int N=1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define mp make_pair
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define all(v) v.begin(),v.end()
const int maxn = 1e6 + 100, maxc = 256;
const l... | 1 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#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)... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define FOR(i,l,r) for(i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define F first
#define S second
signed main(){
ll n,m,d;cin>>n>>m>>d;if(d)d=2*(n-d);else d=n;
printf("%.20f",(double)(m-1)*d/... | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
double expected_value(int n) {
return (double)((1 + n) * n / 2) / (double)n;
}
int main() {
int n, k;
cin >> n >> k;
vector<double> ps(n + 1);
vector<double> comsum(n + 1, 0);
int p;
... |
/**
* author : Sudipta Banik Trisha
* created : September 10, 2020 5:11 PM
* Problem Name : D - Dice in Line
* Problem Limit : 2000 ms , 1024 MB
* Problem Url : https://atcoder.jp/contests/abc154/tasks/abc154_d
* @genarated by : ai-virtual-assistant
**/
#include<bits/stdc++.h>... | 1 |
#include <cstdio>
#include <cstring>
#include <vector>
#include <deque>
#define MAXN 1000010
using namespace std;
int n;
char s1[MAXN],s2[MAXN];
vector<int> S[30];
int p[MAXN];
struct Queue{
deque<int> Q;
int d;
void push_back(int x){ Q.push_back(x-d); }
void push_front(int x){ Q.push_front(x-d); }
int back(){ ... | #include <cstdio>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> Q;
int n, m;
Q g[100000];
int p[10000];
int r[10000];
void init(){
rep(i, n){
p[i] = i;
r[i] = 0;
}
}
int find(int i){
return p[i] == i ? i : p[i] = find... | 0 |
#include <iostream>
#include <string>
#include <cstring>
#include <algorithm>
#include <functional>
#include <cmath>
#include <set>
#include <queue>
#include <deque>
#include <vector>
#include <climits>
#include <sstream>
#include <iomanip>
#include <map>
#include <stack>
using namespace std;
typedef unsigned long long... | #include<cstdio>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;
using ll=long long;
using vi=vector<int>;
using vvi=vector<vi>;
using pii=pair<int,int>;
using vll=vector<ll>;
using vvll=vector<vll>;
using vpii=vector<pii>;
int main(void)
{
int h, w;
int d_max=80*80;
while(scanf("%d%d", &... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
long long N, M, V, P; cin >> N >> M >> V >> P;
vector<long long> A(N);
for(auto& t : A) cin >> t;
sort(A.begin(), A.end());
int L = -1, R = N-1;
while(R-L > 1){
int mid = (L+R)/2;
long l... | //Author:xht37
#include <bits/stdc++.h>
#define ui unsigned int
#define ll long long
#define ul unsigned ll
#define ld long double
#define pi pair <int, int>
#define fi first
#define se second
#define mp make_pair
#define ls (p << 1)
#define rs (ls | 1)
#define md ((t[p].l + t[p].r) >> 1)
#define vi vector <int>
#d... | 0 |
#include<bits/stdc++.h>
#include<math.h>
#define rep(i,k,n) for(int i=k;i<n;i++)
#define MOD 1000000007LL
#define ROD 1000000000
#define INF 12345678
#define MIN(a,b) (a>b?b:a)
using namespace std;
#include<bits/stdc++.h>
#include<math.h>
#define rep(i,k,n) for(int i=k;i<n;i++)
#define ll long long
#define mp make_pair... | #pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
//const ll mod=998244353;
const ll mod=1000000007;
const vector<int> dy={-1... | 0 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
uint N;
long long x;
cin >> N >> x;
vector<long long> a(N, 0);
long long sum = 0;
for (auto &c: a) {
cin >> c;
sum += c;
}
if (sum < x) {
cout << a.size() - 1 << endl;
... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
ios_base :: sync_with_stdio(0);
cin.tie(0);
int n, x;
cin >> n >> x;
vector<int> a;
int i, count = 0;
for(i=0; i<n; i++){
int p;
cin >> p;
a.push_back(p);
}
sort(a.begin(), a.end());
for(i=0; i<n; i++){
if(a[i]>x... | 1 |
#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); ++i)
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) {a = b;return true;}return false;}
using namespace std;
using ll = long long;
using P = pair<in... | #include <bits/stdc++.h>
using namespace std;
int main (){
int N,K,sum,s;
cin>>N;
K=1;
sum=0;
for (int i=0;i<8;i++){
for(int j=0;j<i;j++){
K*=10;
}
s=(N-N%K)%(K*10)/K;
sum+=s;
K=1;
}
int m;
m=N%sum;
if (m==0){
cout<<"Yes"<<endl;
}
else{
cout<<"No"<<endl;
}
}
| 1 |
#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
unsigned long long a;
double b;
cin>> a >>b;
unsigned long long c = 1000*b;
unsigned long long d = a*c;
unsigned long long e = d/1000;
cout<< e <<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main (){
int A, B;
cin >> A >> B;
int ans = A*B;
cout << ans << endl;
}
| 1 |
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
typedef vector <int> VI;
typedef set <int> SI;
int get_digit( int n )
{
int count = 0;
while ( n >= 10 )
{
n /= 10;
count++;
}
return count + 1;
}
int ten_pow( int n )
{
int answer = 1;
for ( int i = 0; i < n; i+... | #include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <set>
#define rep(i,n) for(int i = 0; i < n; i++)
using namespace std;
int n, k;
string str[10];
int main(){
while(scanf("%d", &n),n){
set<string> s;
scanf("%d", &k);
rep(i,n) cin >> str[i];
if(k == 2){
for(int i = 0; i... | 1 |
#include <bits/stdc++.h>
#define pb push_back
#define ll long long
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
for(int T = 0; T < t ; T++){
ll n, x;
cin >> n >> x;
ll a[n], ans = 0;
for(int i = 0; i < n; i++)
ci... | #include <algorithm>
#include <boost/optional.hpp>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string... | 1 |
#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <uno... | #include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
char convNext(char ch) {
if('a' <= ch && ch <= 'y') return ch+1;
if(ch=='z')return 'a';
return ch;
}
int main() {
char str[90];
while(true) {
if(!fgets(str, 90, stdin))break;
for(int i = 0; i < 26; i++) {
if(strstr(str,"this") |... | 0 |
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#define LL long long
using namespace std;
const LL mod=1e9+7;
LL f[1010][1010],n,a,b,c,d,C[1010][1010],inv[1010][1010],fac[1010],finv[1010];
void pre()
{
inv[0][1]=inv[1][1]=1;fac[0]=fac[1]=1;
for(LL i=2;i<=1000;i++) inv[i][1]=(mod-mod/i)*inv[mod... | #include<cstdio>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<iomanip>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<string>
#include<queue>
using namespace std;
#define DEBUG(x) cout<<#x<<"="<<x<<endl
#define DEBUG2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<... | 0 |
#include <bits/stdc++.h>
using namespace std;
vector<bool> digit(10, false);
bool check(int N) {
bool res = true;
while(N > 0) {
int x = N % 10;
if (digit[x]) {
res = false;
break;
}
N /= 10;
}
return res;
}
int main() {
int N, K;
cin >> N >> K;
for (int i = ... | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(S, L) for (int i = S; i < L; ++i)
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> ng_d;
int dd;
vector<int> d;
for (int i = 0; i < k; ++i) {
cin >> dd;
ng_d.push_back(dd);
}
for (int i = 0; i < 10; ++i... | 1 |
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
int H, W;
bool check(int i, int j, int dx, int dy, vector<vector<int>> &field) {
int x = i + dx;
int y = j + dy;
return (x >= 0 && x < H && y >= 0 && y < W && (field[x][y] == -1));
}
int main() {
cin >> H >> W;
vector<vecto... | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef vector<lint> vlint;
typedef vector<vlint> vvlint;
typedef vector<bool> vbool;
typedef vector<int> vint;
#define inf 1e+9
#define endl "\n"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n);... | 1 |
#include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
int i=1;
while(i*i<=n) i++;
cout << (i-1)*(i-1) << "\n";
return 0;
}
| #include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n;
cin >> n;
n = pow(n, 0.5);
cout << n * n << endl;
... | 1 |
#define DIN freopen("input.txt","r",stdin);
#define DOUT freopen("output.txt","w",stdout);
#include <bits/stdc++.h>
#define mem(a,b) memset(a,b,sizeof(a))
#define REP(i,a,b) for(int i=(a);i<=(int)(b);i++)
#define REP_(i,a,b) for(int i=(a);i>=(b);i--)
#define pb push_back
using namespace std;
typedef long long LL;
typed... | #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>;
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; } retur... | 1 |
#include<stdio.h>
int main(){
int n,c[101][2][7],z,Z,x;
scanf("%d",&n);
for(int i=0;i<n;i++){
for(int t=0;t<6;t++){
scanf("%d",&c[i][1][t]);
c[i][0][t]=t;
}
}
for(int p=0;p<n-1;p++){
for(int s=p+1;s<n;s++){
///????????????????????????///
for(int i=0;i<6;i++){
///??????c[... | #include<iostream>
#include<cctype>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<cctype>
#include<cstring>
#include<utility>
const int inf=0x7fffffff;
typedef long long int ll;
using namespace std;
const int N=100+5;
char s[... | 1 |
#include <bits/stdc++.h>
#define mp make_pair
#define X first
#define Y second
#define FOE(x, a) for(auto x : a)
#define FOR(i, a, b) for(int i = a; i <= b; i++)
#define FOD(i, a, b) for(int i = a; i >= b; i--)
using namespace std;
typedef long long ll;
typedef pair <int, int> ii;
const int N = 2e5 + 10;
const ll I... | //
// main.cpp
//
#include <algorithm>
#include <array>
#include <assert.h>
#include <iostream>
#include <limits>
#include <math.h>
#include <memory>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#inclu... | 0 |
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef pair<int,int> pii;
typedef priority_queue< int, vector< int >, greater< int > > minHeap;
#define ones(x) __builtin_popcount(x)
#define onesl(x) __builtin_popcountl(x)
#define onesll(x) __builtin_popco... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll x;
cin >> x;
if(x%11==0) cout << 2*x/11;
else if(x%11<=6) cout << (x/11)*2+1;
else cout << (x/11)*2+2;
cout << endl;
} | 0 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
if (N == 1)
cout << "Hello World" << endl;
else {
int A, B;
cin >> A >> B;
cout << A + B << endl;
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int const NMAX = 100;
char v[1 + NMAX][1 + NMAX];
int main() {
int n, m;
cin >> n >> m;
cout << max(n * m, max(n - m, n + m));
return 0;
}
| 0 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
typedef long long ll;
int main() {
ll N, m = LONG_LONG_MAX;
cin >> N;
rep(i, 5) {
ll x;
cin >> x;
m = min(m, x);
}
ll ans = 4 + (ll)... | #include <bits/stdc++.h>
#define rep(i, e, n) for (int i = e; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int,int>;
const ll inf=1000000000007;
int main() {
ll n,a,b,c,d,e;
cin >> n >> a >> b >> c >> d >> e;
ll mn= min(min(min(a,b),c),min(d,e));
ll ans = (n-0.5)/mn +5;
cout << ans... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n; cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> b[i];
}
vector<int> c(n);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n; cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
double average = (double)accumulate(a.begin(), a.end(), 0)/n;
int ans = 0;
double minv=100100100;
r... | 0 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll N;
//1 <= N <= 10^10なので
//1回のfor文すら回せない
//N = A * B なので√Nまで探索すればok
int findDigit(ll x, ll y)
{
ll s, t;
s = log10(x) + 1;
t = log10(y) + 1;
return max(s, t);
}
int main()
{
cin >> N;
ll s = sqrt(N);
ll res = N;
for... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(){
string S;
cin >> S;
reverse(S.begin(), S.end());
int N = S.length();
const long long INF = 1e18;
vector<long long> dp(2,INF);
dp[0] = 0;
for(auto c : S){
vector<long long> dp_(2,INF);
for(int i = 0; i < ... | 0 |
// ABC162-D RGB Triplets
#include <bits/stdc++.h>
using namespace std;
signed main() {
int n, a, b, pos1, pos2;
long long dp[3][4000] = {}, ans = 0;
string s;
cin >> n;
cin >> s;
ans = 0;
for(int i=0 ;i<n ;i++ ) {
if(s[i] == 'R') {
dp[0][i] = 1;
}
els... | #include<iostream>
#include<string>
using namespace std;
int main()
{
char s[5000];
long long n,i,j,k,total=0,red[5000]={0},green[5000]={0},blue[5000]={0},r=0,g=0,b=0,x,y;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>s[i];
}
for(i=1;i<=n;i++)
{
if(s[i]=='R')
{
r++... | 1 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000000LL;
#define all(x) (x).begin(),(x).end()
vector<... | #include <bits/stdc++.h>
#define debug(x) cerr << #x << " " << (x) << endl
using namespace std;
const int N = 305;
const long long mod = 998244353ll;
int n, K, num[N], pre[N], cnt = 0;
char str[N];
long long f[N][N << 1], g[N][N << 1], tmp[N][N << 1];
int main () {
scanf("%s%d", str, &K), n = strlen(str);
int pos ... | 0 |
#include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// typedef
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> ... | #ifdef _WIN32
#include "XOR.h"
#endif
#include <stdio.h>
#include <iostream>
#include <vector>
#include <array>
constexpr int64_t MOD = 1'000'000'007;
constexpr int64_t help = 1;
#define ll long long int
#define o(X) ll bits##X = 0
#define ok(X) bits##X += !!(d & (help << X))
#define oke(X) ans += (bits##X * (n -... | 0 |
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int H, W;
vector<string> fi;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
cin >> H >> W;
fi.resize(H);
for (int i = 0; i < H; ++i) cin >> fi[i];
// 多点をスタートとして扱う
vector<vector<int> > dist(H, vector<i... | #include<bits/stdc++.h>
using namespace std;
int H, W, x, y, ans = 0, flag = 0;
queue<int> Qx, Qx_next; queue<int> Qy, Qy_next;
bool can_go(int x, int y){
return (1 <= x && x <= H && 1 <= y && y<= W);
}
void f(vector<vector<int>>& A, int x, int y){
if(can_go(x,y)){
if(A[x][y] == 1){
flag ... | 1 |
/*
* src.cpp
*
* Created on: 2016/08/04
* Author: joi
*/
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)
const int MAX_N=1e4;
int n;
int p[3];
char out[MAX_N+5];
int main(){
do{
cin>>n;
if (n){
REP(i,n){
int ave=0;
b... | #include <stdio.h>
void grade(int students)
{
while(students != 0) {
for(int i = 0; i < students; ++i) {
int math, english, japanese;
scanf("%d %d %d", &math, &english, &japanese);
int mean = (math + english + japanese) / 3;
if ((math == 100) || (english == 1... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
vector<ll> z_algorithmll(const vector<ll> &s)
{
vector<ll> prefix(s.size());
for (int i = 1, j = 0; i < s.size(); i++)
{
if (i + prefix[i - j] < j + prefix[j])
{
prefix[i] = prefix[... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#defi... | 0 |
#include<bits/stdc++.h>
#define For(i,x,y) for (register int i=(x);i<=(y);i++)
#define FOR(i,x,y) for (register int i=(x);i<(y);i++)
#define Dow(i,x,y) for (register int i=(x);i>=(y);i--)
#define Debug(v) for (auto i:v) printf("%lld ",i);puts("")
#define mp make_pair
#define fi first
#define se second
#define pb push_b... | #include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <limits.h>
#include <math.h>
#include <functional>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <float.h>
#includ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod =(1e9)+7;
using P = pair<ll,ll>;
int main() {
int n;cin >>n;
n-=2;
cout <<n*180<<endl;
return 0;
}
| #include <bits/stdc++.h> // ver1.8
#define int long long
#define ALL(v) (v).begin(),(v).end()
#define Vi vector<int>
#define pb push_back
#define mp make_pair
#define rep(i,a,b) for(int i=a;i<b;i++)
#define repeq(i,a,b) for(int i=a;i<=b;i++)
#define repr(i,a,b) for(int i=a;i>b;i--)
#define repreq(i,a,b) for(int i=a;i>... | 1 |
# include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<int,int>
typedef long long ll;
int arr[100005];
int n,k,x;
int gcd(int a,int b){
if(b==0) return a;
return gcd(b,a%b);
}
int main(){
ios_base::sync_with_stdio(false)... | #include <iostream>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <vector>
using namespace std;
int main(){
cin.tie(NULL);
ios::sync_with_stdio(false);
int a[10];
int k,b;
for(int i=0;i<5;i++){
cin>>a[i];
}
cin>>k;
sort(a,a+5);
b=a[4]-a[0];
if(k<b){
cout<<":("<<"\n";
}... | 0 |
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <bitset>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
typedef long long ll;
typedef pair<int,int> p... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
int main(){
int N,x,y,M,l;
char d;
map<char,int> D;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
D['E']=0; D['W']=1; D['N']=2; D['S']=3;
while(cin>>N,N){
bool a[21][21]={};
rep(i,N){
... | 1 |
/**
* author: yuya1234
* created: 25.06.2020 13:29:29
**/
#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--)
#defin... | #include <bits/stdc++.h>
using namespace std;
int main(){
long int n,x;
cin >> n >> x;
vector<long int> a(n);
long int sum=0;
int i;
for(i=0; i<n; i++){
cin >> a.at(i);
sum+=a.at(i);
}
sort(a.begin(),a.end());
if(x>sum) cout << n-1 << endl;
else if(x==sum) cout... | 1 |
#include <math.h>
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
long sum;
cin >> sum;
cout << int(pow(sum, 3)) << endl;
} | #include <iostream>
using namespace std;
int main(void){
int x,y;
x=y=0;
cin>>x;
y=x*x*x;
cout<<y<<endl;
return 0;
} | 1 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define flash ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define lb lower_bound
#define ub upper_bound
#define endl '\n'
ll dp[2][2][100];
ll mod=1e9+7;ll d;
ll mo(ll x)
{
if(x>=0)
return(x%d... | #include<iostream>
#include<string>
using namespace std;
int alignment(string s,string t){
int a[1001][1001];
int n=s.size();
int m=t.size();
a[0][0]=0;
for(int i=0;i<n;i++){
a[i+1][0]=a[i][0]+1;
}
for(int i=0;i<m;i++){
a[0][i+1]=a[0][i]+1;
}
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(s[i]==t[... | 0 |
#include <stdio.h>
int main(void) {
int n, i, po[2] = {0}, ca[2];
while(scanf("%d", &n)){
if(!n)break;
po[0] = 0;
po[1] = 0;
for(i = 0; n > i; i++){
scanf("%d%d", &ca[0], &ca[1]);
if(ca[0] > ca[1]) po[0] += ca[0]+ca[1];
else if(ca[0] < ca[1]) po[1] += ca[0]+ca[1];
else{ po[0] += ca[0]; po[1] += ca[1];... | #pragma GCC optimize ("O3")
#pragma GCC target ("avx2")
//#include<bits/stdc++.h>
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define ... | 0 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false); cin.tie(NULL);
int cnt=0;
string s;
cin>>s;
int m =0;
for(int i =0 ;i<3;i++)
{
if(s[i]=='R')m++;
else
{
cnt = max(m,cnt);
m =0;
}
}
cnt = max(m,cnt);
cout<<cnt;
return 0;
}
| #include<bits/stdc++.h>
#define io ios_base::sync_with_stdio(false); cin.tie(NULL);
#define N 4e7
#define nl "\n"
#define f first
#define s second
#define pi acos(-1.0)
#define MOD 1000000007
#define pb push_back
#define vector<int> VI;
#define vector<long long> VII;
typedef long long ll;
typedef double db;
using na... | 1 |
#include <iostream>
using namespace std;
const int MAX = 500;
int main() {
int n, m, Q;
cin >> n >> m >> Q;
int S[MAX+1][MAX+1] = {};
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
S[l][r]++;
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
S[i][j] += S[i][j-1];
}
}
for (int... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<pii>... | 1 |
#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... | #include <iostream>
#include <vector>
#include <limits>
#include <algorithm>
struct RangeUpdateQuery{
int n, now;
std::vector<int> dat, time;
void init(int n_){
n = 1;
now = 0;
while(n < n_) n *= 2;
dat.resize(2 * n - 1, std::numeric_limits<int>::max());
time.resize... | 0 |
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
int stage[12][12] = {{0}};
int n;
int j = 0;
int x = 0,y = 0,xx = 0;
for(;;){
cin >> n;
if(n == 0)break;
for(int i = 0;i < n; i++){
for(j = 0;j < n; j++){
cin >> stage[i][j];
... | #include<stdio.h>
#include<string.h>
#define SIZE 1002
int main(){
int i,j;
int na,nb,nc,n;
int a[SIZE],b[SIZE],c[SIZE],d[SIZE];
int data[SIZE];
while(1){
scanf("%d %d %d",&na,&nb,&nc);
if(na==0 && nb==0 && nc==0)break;
scanf("%d",&n);
for(i=1;i<=na+nb+nc;i++)data[i]=2;
for(i=0;i<n;i++){
scan... | 0 |
// A - Rated for Me
#include <bits/stdc++.h>
using namespace std;
int main(){
int r; cin>>r;
string ans = "ARC";
if(r < 1200) ans = "ABC";
if(2800 <= r) ans = "AGC";
cout<< ans <<endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
typedef long long ll;
template<typename T> bool chmax(T &a, T b) {if(a <= b){a = b; return true;}return false;}
template<typename T> bool chmin(T &a, T b) {if(a >= b){a = b; return true;}return false;}
#define ABC 001
#define ... | 1 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
co... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template<class T>inline bool chmax(T &a, const T &b) { if (b > a) { a = b; return true; } return false; }
template<class T>inline bool chmin(T &a, const T &b) { if (b < ... | 0 |
#include <iostream>
#include <string>
using namespace std;
int map[21][21];
void search(int a[][21], string d, int i, int *x, int *y) {
if (d == "N") {
for (int j = 1; j <= i; j++) a[*y + j][*x] = 2;
*y += i;
} else if (d == "S") {
for (int j = 1; j <= i; j++) a[*y - j][*x] = 2;
*y -= i;
} else if (d == "... | #include <iostream>
using namespace std;
int main()
{
int a,b,c; int CASE[1000][3];
while(1)
{
cin >> a >> b >> c ; int total=a+b+c;
if(a==0 && b==0 && c==0) break;
int N,i,j,k,r; int pnt=0;
cin >> N ;
int* test=new int[total]; for(int n=0;n<total;n++) test[n]=2;
for(int n=0;n<N;n++)
{
cin >> i >> ... | 0 |
#include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define ln '\n'
using namespace std;
using LL = long long;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
map<ll, int, greater<ll>> m;
rep(i, n) {
ll a;
cin >> a;
m[a]++;
}
int cnt = 0;
ll ans = 0;
for (auto e : m) {
... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int h1, m1, h2, m2, k; cin >> h1 >> m1 >> h2 >> m2 >> k;
int a = h1 * 60 + m1, b = h2 * 60 + m2;
int ans = b - a;
if (ans < 0) ans += 24 * 60;
ans -= k;
cout << ans << "\n";
return 0;
}
| #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll h1,m1,h2,m2,k;
cin>>h1>>m1>>h2>>m2>>k;
ll t=((h2-h1)*60)-m1+m2;
ll d=t-k;
if(d<=0){
cout<<"0"<<"\n";
}
else{
cout<<d<<"\n";
}
return 0;
} | 1 |
#include <iostream>
using namespace std;
typedef long long ll;
const ll mod = 998244353;
int n;
int a[305];
ll dp[305][90005];
ll dp2[305][90005];
ll p(ll a, ll x) {
ll res = 1;
while(x > 0) {
if(x & 1) res = res * a % mod;
a = a * a % mod;
x >>= 1;
}
return res;
}
int main() {
cin >> n;
i... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#define MOD 998244353
using namespace std;
typedef long long ll;
template <typename Tp> inline void getint(Tp &num){
register int ch, neg = 0;
while(!isdigit(ch = getchar())) if(ch == '-') neg = 1;
num ... | 1 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
#include<cmath>
using namespace std;
double len(int x1,int x2, int y1,int y2){
double res;
double x=x1-x2;
double y=y1-y2;
res=pow(x*x+y*y,0.5);
return res;
}
int main(){
int n;
cin>>n;
int x[n],... | #include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int MN = 1e5 + 5;
int x[8], y[8];
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
int N;
cin >> N;
double sum = 0;
int cnt = 0;
for (int i = 0; i < N; i... | 1 |
#include <bits/stdc++.h>
using namespace std;
int N,M,Q,m;
const int maxn=600000+5;
int siz;
int C[maxn],a[maxn],ret[maxn];
struct node{
int l,r,id;
bool operator<(const node& other)const{
return other.r > r;
}
}x[maxn],y[maxn];
void add(int x,int v){
for(int i=x;i<=m;i+=i&-i) C[i]+=v;
}
int sum(int x){
int r... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n, m, q;
cin >> n >> m >> q;
vector<vector<int>> cnt(n+1, vect... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P,char> Q;
ll N;
vector<Q> v;
vector<vector<P>> V,H;
set<P> S;
vector<vector<ll>> LU,LD,RU,RD;
int main(){
cin >> N;
V.resize(200010);
H.resize(200010);
LU.resize(400010);
LD.resize(400010);
... | #include<cstdio>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const static int MOD = 1e9+7;
int main(){
int N;
scanf("%d\n", &N);
bool is_black[2*N];
for (int i = 0; i < 2*N; ++i){
char tmp;
scanf("%c", &tmp);
is_black[i] = tmp == 'B';
}
bool is_left_end[2*N];
if(!is_black[0]... | 0 |
#include <bits/stdc++.h>
typedef long long LL;
#define FOR(i,a,b) for(LL i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
using namespace std;
LL p = 1000000007ll;
int main(void)
{
int n;
cin >> n;
vector<int> a(n);
for(auto &x: a) cin >> x;
vector<vector<int> > cnt0(1<<20);
int zeros = 0;
int part = 0;
f... | #include <bits/stdc++.h>
using namespace std;
const int N = 550000;
const int MOD = 1e9 + 7;
int a[N], sum[N], cnt[N];
vector<int> pos[1 << 21];
int chk[1 << 21];
inline int modExp(int a, int n, int mod) {
int ret = 1;
while (n) {
if (n & 1) ret = (long long)ret * a % mod;
a = (long long)a * a % mod;
n >>= 1... | 1 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
// Grid Repainting 2
int h, w; cin >> h >> w;
vector<string> s(h);
rep(i,h) cin >> s.at(i);
vector<int... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define yn(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YN(ans) if(ans)printf("YES\n");else printf("NO\n")
#de... | 0 |
#include <stdio.h>
#include <math.h>
#define MAXINPUT 100
int main(void){
int h[MAXINPUT],w[MAXINPUT];
int ansh[MAXINPUT]={},answ[MAXINPUT]={};
int i=0,j=0;
int ans=0;
int num=0;
int k;
while(i<MAXINPUT){
scanf("%d %d",&h[i],&w[i]);
if(h[i]==0 && w[i]==0)break;
i++;
num++;
}
for(i=0;i<num;i++,ans=0){... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a) (a).begin(),(a).end()
#define pb push_back
#ifdef Debug
#define dump(x) cerr << #x << " = " << (x) << endl
#else
#define dump(x)
#endif
... | 1 |
#include <bits/stdc++.h>
using namespace std;
bool IsPrime(long long n){
if(n == 1) return false;
for(long long i = 2; i * i < n; i++){
if(n%i == 0) return false;
}
return true;
}
vector<pair<long long, long long>> PrimeFactorize(long long n){
vector<pair<long long, long long>> res;
long long a = 0;
... | /*
ID: anonymo14
TASK: wormhole
LANG: C++
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
... | 1 |
#include <bits/stdc++.h>
using namespace std;
//#define MOD 1000000007
#define MOD 998244353
#define INF 1145141919810893364
//#define INF 810114514
#define PI 3.141592653589
typedef long long ll;
typedef pair<ll,ll> PP;
#define int ll
#define setdouble setprecision
#define REP(i,n) for(int i=0;i<(n);++i)
#define OREP(... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL mod = 998244353;
struct node{
int l,r;
};
const int N = 1e6+7;
string s[N];
int n;
vector<node>a;
vector<node>b;
bool cmp(node x,node y)
{
return x.r<y.r;
}
bool cmp1(node x,node y){
return x.l<y.l;
}
int main()
{
cin >> n;
... | 1 |
#include <iostream>
using namespace std;
long long int get_digit(long long int l){
long long int digit = 0;
while(l != 0){
l /= 10;
digit++;
}
return digit;
}
int main(void){
// Your code here!
long long int n;
cin >> n;
long long int j;
long long int... | // -*- mode:c++; coding:utf-8; indent-tabs-mode:nil; -*-
// ALDS1_4-A: Linear Search
#include <cstdio>
static int linear_search(const int as[], const int target) {
int i = 0;
while (as[i] != target) {
++i;
}
return i;
}
int main(void) {
int n;
std::scanf("%d", &n);
int ss[n+1]; // n+1(sentinel)
f... | 0 |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
using namespace std;
... | #include <bits/stdc++.h>
using namespace std;
double ev[305][305][305], p[305][305][305];
int main()
{
int n;
cin>>n;
vector<int> cnt(4,0);
for(int i=0; i<n; i++)
{
int x;
cin>>x;
cnt[x]++;
}
p[cnt[1]][cnt[2]][cnt[3]] = 1;
for(int c=n; c >= 0; c--)
... | 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++)
#... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define int ll
typedef pair<int,int> pii;
#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)... | 1 |
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define N 303
const int mod=998244353;
inline int read(){
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9'){
if(c=='-')f=-1;
c=getchar();
}
while(c>='0'&&c<='9'){
x=(x<<1)+(x<<3)+c-'0';
c=getchar();
}
return x*f;
}
int n,m,gu,dp[... | // FUCKED UP FUCKED UP FUCKED UP FUCKED UP FUCKED UP
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O2,no-stack-protector,unroll-loops,fast-math")
#define F first
#define S second
#define pb push_back
#define SZ(x) (ll)(x.size())
#define all(x) x.begin(),x.end()
#define MP make_pair
typedef long... | 1 |
#include <stdio.h>
int main(){
int a, b, c, d;
int K;
scanf("%d %d %d %d %d", &a, &b, &c, &d, &K);
int diff1 = c - a;
int diff2 = d - b;
int min = (diff1 * 60) + diff2;
printf("%d", min - K);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define fi first
#define se second
#define pb push_back
#define mod 998244353
#define floop(i,a,b) for (int i=(a);i<(b);i++)
#define rloop(i,a,b) for (int i=(a);i>=(b);i--)
#define floopeq(i,a,b) for (int i=(a);i<(b);i++)
#define pa pair<int,int>
#... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int na, nb, nt;
cin >> na >> nb >> nt;
vector<int> a(na), b(nb);
for (int i = 0; i < na; i++) {
cin >> a[i];
}
for (int i = 0; i < nb; i++) {
cin >> b[i];
}
int ans = *min_element(a.begin(), a.end()) + *min_ele... | #include <bits/stdc++.h>
typedef long long int LL;
typedef unsigned long long int ULL;
using namespace std;
// 插入此處
LL a[100005];
int main() {
LL n, m, v, p;
cin >> n >> m >> v >> p;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n, [](LL x, LL y) { return x > y; });
// for ... | 0 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define fr(i,a,b) for(int i = a ; i <= b ; ++i)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#... | #include<bits/stdc++.h>
using namespace std;
long long s,ans;
int n,a[200003];
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i];
sort(a+1,a+1+n);
for(int i=2;i<=n;i++)
{
s=(s+a[i-1])%1000000007;
ans=(ans+s*a[i])%1000000007;
}
cout<<ans<<endl;
return 0;
}
| 0 |
#include <stack>
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <numeric>
using namespace std;
using ll = long long;
#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;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define In_The_Name_Of_Allah_The_Merciful ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define Alhamdulillah return 0;
#define all(v) v.begin(),v.end()
#define debug(n) cerr << "[" << #n << " = " << n << "]" << endl
void Suhaib_Sa... | 0 |
#include <iostream>
#include <iomanip>
using namespace std;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
int main() {
int n, k;
cin >> n >> k;
int p[n];
rep(i,n) cin >> p[i], p[i]++;
int s = 0, m = 0;
rep(i,n) {
s = s + p[i] - (i >= k ? p[i-k] : 0);
m = max(m, s);
}
cout << fixed << s... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
double expected_value(int n) {
return (double)((1 + n) * n / 2) / (double)n;
}
int main() {
int n, k;
cin >> n >> k;
vector<double> ps(n + 1);
vector<double> comsum(n + 1, 0);
int p;
... | 1 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mk make_pair
#define MAX 1000001
ll prime[MAX];
#define mod 1000000007
ll rec(vector<vector<ll> >& dp,vector<ll>& arr,int n,int i,int k,int w)
{
ll ans=0;
if(i>=n)
return 0;
if(dp[i][k]!=-1)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
int ans = a + a*a + a*a*a;
cout << ans << endl;
} | 1 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <sstream>
#include <cstdio>
using namespace std;
int main()
{
int n;
string str;
cin >> n;
cin.get();
for(int i=0;i<n;++i)
{
int loc;
getline(cin, str);
lo... | #include<bits/stdc++.h>
using namespace std ;
main(){
int n ;
string s ;
char c[] = {'H','o','s','h','i','n','o'} ;
cin >> n ;
for( int k=0 ; k<=n ; k++ ){
getline( cin , s ) ;
for( int i=0 ; i<s.size() ; i++ ){
int cnt = 0 ;
if( s[i] == 'H' ){
for( int j=0 ; j<s.size() && j<7 ; j++ ){
if(... | 1 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pi 3.141592653589793238
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define MOD 1000000007
void solve()
{
ll a,b,c;
cin>>a>>b>>c;
cout<<a+b+c-max({a,b,c});
return;
}
int main()
{
fast;
ll q;
... | #include<queue>
#include<stack>
#include<math.h>
#include<cmath>
#include<bitset>
#include<stdio.h>
#include<string>
#include<map>
#include<algorithm>
#include<vector>
#include<iostream>
#include<utility>
#include<functional>
#include<deque>
#include<list>
using namespace std;
typedef long long ll;
typedef pair<int,int... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using st=string;
using ch=char;
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<ch> vc;
typedef vector<vc> vvc;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i... | #include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<queue>
#include<vector>
#include <bitset>
#include <cmath>
#include <limits>
#include <iostream>
#include<set>
#include<tuple>
using namespace std;
#define INF 11000000000
#define MAX 100000
#define MOD 1000000007
typedef long long ll;
t... | 0 |
#define _GLIBCXX_DEBUG
#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 MOD=1000000007;
const long long INF = 1LL << 60;
const double pi=acos(-1.0);
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return f... | #include <bits/stdc++.h>
using namespace std;
int D;
int d[22];
long long ans;
bool analyze(int ndig) {
int tmp = D;
for (int i = ndig; i >= 1; --i) {
d[i] = tmp % 10; tmp /= 10;
}
return tmp == 0;
}
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
cin >> D;
for (int ndig = 2; ndig <= 20; ++ndig) ... | 0 |
#include <iostream>
#include <string>
#include <algorithm>
int main(void)
{
std::string str1;
std::string str2;
std::cin >> str1 >> str2;
int l1 = str1.size();
int l2 = str2.size();
int A[l1 + 1][l2 + 1] = {};
for (int i = 0; i <= l1; i++)
{
for (int j = 0; j <= l2; j++)
... | #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... | 1 |
#include <iostream>
#include <vector>
#include <algorithm>
long long solve(int n, const std::vector<long long> & a, const std::vector<long long> & b, const std::vector<long long> & c) {
long long res { 0LL };
for (int i = 0; i < n; ++i) {
const long long m { b[i] };
const long long an { st... | #include <algorithm>
#include <iostream> //標準入出力
#include <fstream> //ファイルでの入出力
#include <vector>
#include <set>
#include <functional>
#include <string>
#include <utility> //pair
#include <cmath> //sqrt
#include <iomanip> //setprecision
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#defin... | 1 |
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
using namespace std;
template<class t> inline t read(t &x){
char c=getchar();bool f=0;x=0;
while(!isdigit(c)) f|=c=='-',c=getchar();
while(isdigit(c)) x=(x<<1)+(x<<3)+(c^48),c=getchar();
if(f) x=-x;return x;
}
template<... | #include<bits/stdc++.h>
#define N 10
using namespace std;
typedef long long ll;
int n,k,a[N];
set<ll> s;
int check(){
int perm[N];
for(int i=0;i<n;i++)perm[i]=i;
do{
ll num=0;
for(int i=0;i<k;i++){
if(!(a[perm[i]]/10))num=num*10+a[perm[i]];
else num=num*100+a[perm[i]];
}
s.insert(num)... | 0 |
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef int_fast64_t ll;
template<int N, typename T, T M>
struct ModFact {
T fact[N+1];
constexpr ModFact() : fact() {
fact[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
if(S[0] == 'W' || S[2 * N - 1] == 'W') {
cout << 0 << endl;
return 0;
}
vector<bool> f(2 * N);
f[0] = true;
for(int i=1; i<2*N; ++i) {
if(S[i - 1] != S[i]) f[i] = f[i... | 1 |
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <sstream>
#include <cctype>
#include <stack>
#include <queue>
#include <cstring>
#include <map>
using namespace s... | #include<iostream>
using namespace std ;
int s[31] = {} ;
int ans[31] = {} ;
void cal(){
s[1] = 1 ;
s[2] = 2 ;
s[3] = 4 ;
for( int i=4 ; i<=30 ; i++ ){
s[i] = s[i-1] + s[i-2] + s[i-3] ;
}
for( int i=1 ; i<=30 ; i++ ){
ans[i] = s[i] / 3650 ;
if( s[i] % 3650 > 0 ) ans[i]++ ;
}
}
int main(){
cal() ;... | 0 |
#include <stdio.h>
#include <algorithm>
int n;
int a[100010];
int b[100010];
int c[100010];
long long psum_b[100010];
long long ans;
long long find_bc(int st,int ed,int x){
int mid = (st+ed)/2;
if(ed-st<=1){
if(x<c[st]) return n-st;
if(x>=c[ed]) return n-ed-1;
return n-ed;
}
if(c[mid]<=x) return find_bc(mid,e... | #include<bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)
int N;
int A[3][100001];
LL dp[3][100001] = {};
int main() {
scanf("%d", &N);
rep(j, 3) { rep(i, N) scanf("%d", &A[j][i]); A[j][N] = 1000000001; }
rep(j, 3) sort(A[j... | 1 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll INF = 1e18;
int main(){
int N;
cin >> N;
vector<ll> a(N);
ll sum =0;
for(int i=0;i<N;i++){
cin >> a[i];
sum += a[i];
}
ll m = INF;
for(int i=0;i<N;i++){
m = min(m,abs(sum- N*a[i]));
}
... | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <math.h>
#include <map>
using namespace std;
int main(){
int n,sum=0,mi_idx;
double avg,mi=1e9;
cin >> n;
vector<int> d(n,0);
for(int i=0;i<n;i++){
cin >> d[i];
sum+=d[i];
}
avg=(double)sum/(double)n;
for(int i=n-... | 1 |
#include <iostream>
#include <algorithm>
#include <cassert>
#include <cctype>
#include <complex>
#include <cstdio>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int w,h,m[21][21],sx,sy,gx... | #include <iostream>
#include <algorithm>
#include <vector>
#include <functional>
using namespace std;
using i64 = int64_t;
const i64 MOD = 1e9+7;
const i64 INF = 1e18+7;
struct UnionFind{
int n;
vector<int> par;
UnionFind(int n) : n(n), par(n, -1){}
int Find(int x){return par[x] < 0 ? x : Find(par[x]);}
bool U... | 0 |
#include <iostream>
#include <vector>
#include <math.h>
using namespace std;
typedef vector<int> vi;
typedef vector<vi> vvi;
void printDP(vvi &dp){
for(auto v: dp){
for(auto x: v){
cout << x << " ";
}
cout << endl;
}
cout << endl;
}
void inc(bitset<15> &a){
a = a.t... | #include <bits/stdc++.h>
using namespace std;
int counter(int bits) {
if (bits == 0) return 0;
return counter(bits >> 1) + (bits & 1);
}
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<int> a(n+1);
vector<vector<int> > x(n+1, vector<int>(n+1));
vector<vector<int> > y(n+1, ... | 1 |
#include<bits/stdc++.h>
using namespace std;
const int N_MAX=31;
int dp[N_MAX];
int rec(int n){
int res;
if(n<0)return 0;
if(n==0)return 1;
if(dp[n]>=0){
return dp[n];
}else{
res=rec(n-1)+rec(n-2)+rec(n-3);
}
return dp[n]=res;
}
int main(){
int n;
while(cin>>n){
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int a, b, ans = 0;
cin >> a >> b;
while(a <= b){
if(a / 10000 == a % 10 &&(a / 1000 - (a / 10000) * 10) == (a % 100 - a % 10) / 10){
ans++;
}
a++;
}
cout << ans;
} | 0 |
#include<bits/stdc++.h>
#define mo 998244353
#define pi 3.1415926535898
#define eps 1e-9
using namespace std;
long long read(){
long long xx=0,flagg=1;
char ch=getchar();
while((ch<'0'||ch>'9')&&ch!='-')
ch=getchar();
if(ch=='-'){
flagg=-1;
ch=getchar();
}
while(ch>='0'&... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 998244353
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i)... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for(ll (i)=(m);(i)<(n);++(i))
#define REP(i, n) FOR(i,n,0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll) 1e15;
ll calc(ll &m, ll p) {
ll ret = 1;
m += p... | #include <iostream>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
ll s=0, t=0;
for(int i=0; i<n; i++) {
ll x,y;
cin >> x >> y;
s += x*y;
t += y;
}
ll k=s%9;
if(k==0) k=9;
cout << t-1+(s-k)/9 << endl;
} | 1 |
#include <bits/stdc++.h>
using namespace std;
int n;
map<char, int> mp;
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
int main(){
// cin.tie(0);
// ios::sync_with_stdio(false);
mp['N'] = 0;
mp['S'] = 1;
mp['E'] = 2;
mp['W'] = 3;
while(1){
cin >> n;
if(n == 0) return 0;
int a[25][25] = {{}};
for(i... | //include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <... | 1 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if(n % 111 == 0) {
cout << n << endl;
return 0;
}
else {
cout << 111 * ((n / 111)+1) << endl;
}
} | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define repi(i,x) for(a... | 0 |
#pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned 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 vld = vector<l... | #include<bits/stdc++.h>
using namespace std;
bool comp(pair<long long int,long long int>a,pair<long long int,long long int>b)
{
if(a.first==b.first)
{
if(a.second<=b.second)
return true;
else
return false;
}
if(a.first>b.first)
return true;
else return false;
}
lo... | 0 |
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef long long ll;
#define rep(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define REP(i,num,n) for(int i=num, i##_len=(n); i<i##_len; ++i)
template<class T>bool ... | #include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i=0; i<n; i++)
#define rep1(i, n) for(int i=1; i<=n; i++)
#define repr(i, n) for(int i=n-1; i>=0; i--)
#define repr1(i, n) for(int i=n; i>=1; i--)
#define all(v) v.begin(),v.end()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<in... | 0 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
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){a = b;return true;}return false;}
using namespace std;
u... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int a, x, y;
cin >> a;
x = a;
// ここにプログラムを追記
while (x > 0) {
y += x % 10;
x /= 10;
}
if ((a % y) == 0) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
| 0 |
#include <iostream>
using namespace std;
int order[4000];
bool search(int);
class Member {
public:
Member() {sum = 0;}
void add(long price, long num) {
sum += (long long int)price*num;
}
bool milion()
{
if (sum >= 1000000) return true;
else return false;
}
private:
long long int sum;
int id;
};
... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int findNum(vector<pair<int, long long> > comm, int num) {
for(int i=0; i<comm.size(); i++) {
if(comm[i].first == num) {
return i;
}
}
return comm.size();
}
int main() {
int n;
cin>>n;
while(n != 0) {
i... | 1 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
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 (a>b) { a=b; return 1; } return 0; }
#define _overload3(_1,_2,_3,name,...) name
#def... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXV = 100;
const ll INF = (1LL<<60);
int V, E;
ll adjMat[MAXV][MAXV];
int main(){
scanf("%d%d",&V,&E);
for (int i = 0; i < V; i++)
for(int j = 0; j < V; j++)
adjMat[i][j] = INF;
for (int i = 0, s, t, d; ... | 0 |
#include<bits/stdc++.h>
using namespace std;
int gcd(int x,int y){
if(x%y==0) return y;
else return gcd(y,x%y);
}
int main(){
int n,i,k,a,G,MAX;scanf("%d%d",&n,&k);
scanf("%d",&G);MAX = G;
if(n == 1){
printf((k==G) ? "POSSIBLE\n":"IMPOSSIBLE\n");
return 0;
}
for(i=1;i<n;i++){
scanf("%d",&a);
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n)... | 1 |
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
using namespace std;
int main()
{
int R;
cin >> R;
if (R < 1200) {
cout << "ABC" << endl;
}
else if (R < 2800) {
cout << "ARC" << endl;
}
else {
cout << "AGC" << endl;
}
}
| #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <math.h>
#include <complex>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <functional>
#include <assert.h>
#define int long
#def... | 0 |
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <assert.h>
#include <memory.h>
#include <queue>
using namespace std;
#define N 303
int dp[N][N][N];
char s[N];
void solve() {
scanf(" %s",s+1);
int n = strlen(s+1);
int k;scanf("%d",&k);
for(int cc = k;cc>=0;--cc) {
fo... | #include <bits/stdc++.h>//Carefully Crafted by hetp111
using namespace std;
#define int long long
#define double long double
#define all(v) (v).begin(),(v).end()
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int,int>
#define vii vector<pii>
#define MOD 1000000007
#define MOD2 998244353
#define MOD3 100... | 0 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll GCD(ll x,ll y){
if(y == 0) return x;
else return GCD(y,x%y);
}
int main() {
int n;
cin >> n;
cout << n / 3 << endl;
}
| #include<iostream>
#include<string>
#include<vector>
using namespace std;
int main()
{
int a;
cin>>a;
a += (a*a) + (a*a*a);
cout<<a;
cout<<endl;
return 0;
} | 0 |
#include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
int N;
cin>>N;
int A[200000],B[200000];
for(int i=0;i<N;i++) cin>>A[i];
for(int i=0;i<N;i++) cin>>B[i];
sort(B,B+N,greater<int>());
vector<int> same;
for(int i=0;i<N;i++){
... | #include <iostream>
#include <string>
#include <queue>
using namespace std;
class Player{
private:
int base;
public:
Player(int i){
base=1;
}
void SetBase(int a){
this->base =a;
}
int GetBase(){
return this->base;
}
};
class Baseball{
private:
int score;
int out;
queue<Player> q... | 0 |
#define _CRT_SECURE_NO_WARNINGS
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <... | #include <bits/stdc++.h>
#define rep(i, n) for (int i{ 0 }; i < n; ++i)
using namespace std;
int main() {
int d, g;
cin >> d >> g;
vector<int> ps(d);
vector<int> cs(d);
rep(i, d) cin >> ps[i] >> cs[i];
// for(auto p :cs) cout <<p;
int min_cnt{ INT_MAX };
rep(i, 1 << d) {
int ... | 0 |
#include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using lint = long;
using llint = long long;
using namespace std;
int main() {
fastIO;
string s;
cin >> s;
for (size_... | #include <iostream>
#include <numeric>
#include <math.h>
#include <algorithm>
#include <float.h>
#include <limits>
#include <vector>
#include <string.h>
#include <iomanip>
#define rep(i,a,n) for(ll int (i) = (a);(i) < (n);(i)++)
#define urep(i,a,n) for(ll int (i) = (a);(i) > (n);(i)--)
#define MOD 1000000007
#define ... | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.