code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
#define Scd(x) scanf("%d", &x)
#define Scd2(x,y) scanf("%d%d", &x, &y)
#define Scd3(x,y,z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x,y) scanf("%llu%llu", &x, &y)
#define Scll3(x,y,z) scanf("%llu%llu%llu",... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,m;
cin >> n >> m;
map<pair<int,int>,int> mp;
for(int i = 0; i < m; i++) {
int a,b;
cin >> a >> b;
a--;
b... | 0 | 4,381,539 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end()))
#define POSL(x,v) (lower_bound(x.begin(),x.... | #include<bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
char s[100];
int main() {
int n; scanf("%d", &n);
list<int>ls;
rep(i, n) {
scanf("%s", s);
if (!strcmp(s, "insert")) {
int x; scanf("%d", &x);
ls.push_front(x);
}
else if (!strcmp(s, "delete")) {
int x; scanf("%d", &x)... | 0 | 57,785,277 |
#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= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
bool flg=true;
ll k,x;
cin >>k>>x;
if(500*k<x)flg=false;
if(flg)puts("Yes")... | #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<algorithm>
#include<iostream>
#include<queue>
#include<map>
#include<cmath>
#include<set>
#include<stack>
#define ll long long
#define pb push_back
#define max(x,y) ((x)>(y)?(x):(y))
#define min(x,y) ((x)>(y)?(y):(x))
#define cls(name,x) mem... | 0 | 65,621,056 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n;
cin >> n;
const ll LIMIT = 1e18;
vector<ll> a(n);
for (int i = 0; i < n; i++)
{
cin >> a[i];
if (a[i] == 0)
{
cout << 0 << endl;
return 0;
}
}
ll sum = a[0];
for (int i = 1; i < n; i++)
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
void solve();
clock_t start_time;
double get_current_time() {
return (double)(clock() - start_time) / CLOCKS_PER_SEC;
}
int main() {
ios_base::sync_with_stdio(false);
solve();
}
#define fi first
#define re return
#define s... | 0 | 44,309,661 |
#include <bits/stdc++.h>
#define rep(i,x,n) for(int i=x; i<(int)(n); i++)
#define rep_eq(i,x,n) for(int i=x; i<=(int)(n); i++)
using namespace std;
using ll=long long;
int main() {
int N; cin >>N;
set<int> A;
rep(i,0,N) {
int temp; cin >>temp;
A.insert(temp);
}
cout <<((int)A.size()==N ? "YES":"NO") <... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#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, n, m) for(int (i) = (n); (i) < (m); ++(i))
constexpr int INF = 1e9;
constexpr ll mod = 1e9+7;
int main(){
int N;
cin >> N;
... | 0 | 75,029,477 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, l;
string a[101];
cin >> n >> l;
for(int i=0; i<n; i++) {
cin >> a[i];
}
sort(a, a+n);
for(int i=0; i<n; i++) {
cout << a[i];
}
return 0;
} | #include <bits/stdc++.h>
#define rep2(x,fr,to) for(int (x)=(fr);(x)<(to);(x)++)
#define rep(x,to) for(int (x)=0;(x)<(to);(x)++)
#define repr(x,fr,to) for(int (x)=(fr);(x)>=(to);(x)--)
#define all(c) (c).begin(),(c).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll; typedef vector<int> VI; ty... | 0 | 9,978,809 |
#include <stdio.h>
#include <string.h>
#define MAX 512
int main(void){
char words[MAX][33];
int wcnt=0;
int f[MAX], len[MAX];
char word[33];
int longest, mostf;
while (scanf("%s", word)!=EOF){
int wid=-1;
for (int i=0; i<wcnt; i++){
if (strcmp(word, words[i])==0){
wid = i;
}
}
if (wid==-1){
s... | #include <iostream>
using namespace std;
int main()
{
int h,w;
cin>>h>>w;
char a[h][w];
int n[h][w];
for(int i=0;i<h;i++)
{
for(int j=0;j<w;j++)
{
a[i][j]=' ';
n[i][j]=0;
}
}
for(int i=0;i<h;i++)
{
for(int j=0;j<w;j++)
{
cin>>a[i][j];
}
}
for(int i=0;i<h;i++)
{... | 0 | 13,296,854 |
#include <iostream>
#include <vector>
#include <cmath>
#include <cstdio>
using namespace std;
class Position{
public:
double x;
double y;
int get_x(){return x;}
int get_y(){return y;}
void setdata(double a, double b){ x = a; y = b;}
void disp(){printf("%.8lf %.8lf\n", x, y);}
};
void koch(int n, Position ... | #include <cstdio>
#include <iostream>
using namespace std;
inline void grade(int sum, int l, int h, char c) {
if (sum >= l && sum < h) {
printf("%c\n", c);
}
}
int main() {
int m, f, r;
for (;;) {
cin >> m >> f >> r;
if (m == -1 && f == -1 && r == -1) {
break;
}
const int sum = m + f;
... | 0 | 69,708,941 |
#include <numeric>
#include <bits/stdc++.h>
#include <utility>
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <math.h>
#include <string>
#define ll long long
#define ull unsigned long long
#define make(type,x) type x; cin>>x
#define make2(type,x,y) type x,y; cin>>x>>y
#define fr(x,... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
... | 0 | 61,067,325 |
#include <bits/stdc++.h>
using namespace std;
long long n;
int main() {
cin >> n;
long long ans = 1e15;
for (int i=1; i<=sqrt(n); i++) {
if (n % i == 0) {
ans = min(ans, i + (n / i));
}
}
cout << ans - 2 << '\n';
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve() {
ll N, X;
cin >> N >> X;
ll ans = 0, a, b;
ans += X;
a = N, b = N - X;
while ( b > 0 ) {
ans += ( 1 + (a - b) / b * 2) * b + a % b;
if ( a % b == 0 ) ans -= b;
ll t = a % b;
a = b;
... | 0 | 23,744,313 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <cmath>
using namespace std;
#define PI 3.1415926535897932384626433832795
#define MOD (1000000007)
#define EPS (1e-15)
#define rep(i, n)... | #include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define ll long long
#define pii pair<int,int>
#define all(x) begin(x), end(x)
#define loop(i,n) for(int i=0; i<n; i++)
#define rep(i,a,b,c) for(int i=a; i<b; i+=c)
#define brep(i,a,b,c) for(int i=a; i>b; i-=c)
#defi... | 0 | 42,222,970 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | #include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>
#include <bitset>
using namespace std;
using ll = long long int;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
ll mod = 1000000007;
vector<ll> fx(10000005,2);
int main() {
ll n;
cin >> n;
fx[0] = 0; ... | 0 | 36,569,180 |
#define rep(i, n) for(ll i = 0; i < n; i++)
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n,t_max;
cin >> n >> t_max;
vector<ll> t(n);
rep(i,n) cin >> t[i];
ll ans = 0;
for(int i=1;i<n;i++) {
ans += min(t_max, t[i] - t[i-1]);
}
ans += t_max;
cou... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int64_t N;
vector<int> e_array;
int ans=0;
cin >>N;
for(size_t i=2;i*i<=N;i++){
int div_num=i;
int tmp_e=0;
while(N%div_num==0){
N/=div_num;
tmp_e++;
}
if(tmp_e != 0) e_array.push_back(tmp_e);
}
if(N!=1) e_array.... | 0 | 12,769,211 |
#include <iostream>
using namespace std;
int main(void){
int n; cin >> n;
int ans = n % 111 == 0 ? n : n + (111 - (n % 111));
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
long long dfs(int nd, vector<long long> &vis, vector<vector<int>> &adjList)
{
vis[nd] += 1;
long long ans = 0;
for(int cd : adjList[nd])
{
if(!vis[cd])
{
ans += dfs(cd, vis, adjList);
vis[nd] += vis[cd];
}
}
ans += vis[nd] - 1;
return a... | 0 | 19,648,597 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#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 REPL(i,m,n) for(ll i=(ll)(m); i<(ll)(n); i++)
#define repl(i,n) REPL(i,... | #include<bits/stdc++.h>
#define REP(i,n) for(int i=0;i<n;i++)
#define LOOP(i,x,n) for(int i=x;i<n;i++)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define MP make_pair
#define FR first
#define SC second
#define int long long
using namespace std;
signed main(){
vector<string> str={".,!? ","abc","def","gh... | 0 | 21,735,292 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; long long k;
cin >> n >> k;
puts(n*500 >= k ? "Yes" : "No");
return 0;
} | #include <bits/stdc++.h>
#define rep(i, to) for (int i = 0; i < (to); ++i)
#define repf(i, from, to) for (int i = (from); i < (to); ++i)
#define unless(cond) if (!(cond))
using namespace std;
using ll = long long;
template <typename T>
using V = vector<T>;
template <typename T, typename U>
using P = pair<T, U>;
int mai... | 0 | 83,423,231 |
#include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <memory.h>
#include <iomanip>
#include <bitset>
#include <list>
#include <stack>
#include <deq... | #include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
t... | 0 | 55,751,243 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
#define MOD 1000000007
typedef long long int ll;
const ll INF=(ll)1e19;
int main(){
string s;
cin >> s;
sort(ALL(s));
cout << (s == "abc" ? "Yes" : "No... | #include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
int dy[4]={1,0,-1,0};
int dx[4]={0,1,0,-1};
vector<vector<int>> graph;
bool sort_sec(const pair<int,int> &a,const pair<int,int> &b){
if(a.second<b.second){
return true;
}
return false;
}
void swap(int *a,int *b){
int temp=*a;
*a=*b... | 0 | 39,436,020 |
#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;
vector<int> bricks(n);
bool flag = false;
rep(i,n) {
cin >> bricks[i];
if (bricks[i] == 1) flag = true;
}
if (!flag) {
cout << -1 <<... | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int a, b = 0;
cin >> a >> b;
int iResult1 = a / b;
int iResult2 = a % b;
double dResult3 = (double)a / (double)b;
printf("%d %d %.8lf\n", iResult1, iResult2, dResult3);
return 0;
} | 0 | 60,844,911 |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <string>
#include <vector>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> ... | #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;
u... | 0 | 35,894,244 |
#include <iostream>
using namespace std;
const int cost[6] = { 500, 100, 50, 10, 5, 1};
int main()
{
int p;
while (cin >> p, p!=0)
{
int chg = 1000 - p;
int c=0, cnt=0;
while (c < 6)
{
while (1)
{
if (chg-cost[c] >= 0) { cnt++; chg-=cost[c]; }
else break;
}
c++;
}
cout << cnt << endl;... | #include<bits/stdc++.h>
#define range(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i, b) for(int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
#define int long long
using namespace std;
template<typename X, typename T>
auto vectors(X x, T a) {
... | 0 | 60,542,189 |
#include "bits/stdc++.h"
using namespace std;
const int MAX_ROW = 110;
const int MAX_COL = 110000;
struct BitMatrix {
int H, W;
bitset<MAX_COL> val[MAX_ROW];
BitMatrix(int m = 1, int n = 1) : H(m), W(n) {}
inline bitset<MAX_COL>& operator [] (int i) { return val[i]; }
};
void GaussJordan(BitMatrix &A, bool is_ext... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define mp make_pair
#define ff first
#define ss second
#define pb push_back
#define fo(i,n) for(i=0;i<n;i++)
#define fo1(i,n) for(i=1;i<... | 0 | 92,330,983 |
#include <bits/stdc++.h>
const int kN = 1e5 + 5;
int n, siz[kN], fa[kN]; std::vector <int> E[kN];
void Add(int u, int v) { E[u].push_back(v); }
void Dfs(int u) {
int cnt = 0; siz[u] = 1;
for(auto v : E[u]) if(v != fa[u]) {
fa[v] = u; Dfs(v);
siz[u] ^= siz[v];
if(siz[v]) ++cnt;
}
if(siz[u]) ++cnt;
if(cnt >= 2... | #include<bits/stdc++.h>
using ll = long long;
using namespace std;
int main(){
int N, K;
cin >> N >> K;
vector<ll> H(N+1);
for(int i=1; i<=N; i++){
cin >> H[i];
}
vector<vector<ll>> dp1(N+1, vector<ll>(N+1, 1e18));
vector<vector<ll>> dp2(dp1);
dp1[0][0] = 0;
for(int i=0; i<N;... | 0 | 90,958,923 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll a, b;
cin >> a >> b;
a--;
if (a<0) a++;
ll va = 0, vb = 0;
vector<ll> places(44,0);
for (ll i=1; i<=44; i++) {
ll x = 1;
for (ll j=0; j<i; j++) x*=2;
ll y = b;
places[i-1] = (b... | #include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAX = 200000;
const ll INF = 1001001001;
const ll MOD = 1000000007;
ll N, ans=0, tmp=0;
vector<ll> A, B;
map<ll,ll> M;
signed main(){
cin >> N;
for(int i=0;i<N;i++) {
ll a;
cin >> a;
A.push... | 0 | 69,440,590 |
#include <bits/stdc++.h>
using namespace std;
#define mst(a, b) memset(a, b, sizeof(a))
typedef long long LL;
const int N = 150 + 10;
int main() {
#ifdef purple_bro
freopen("in.txt", "r", stdin);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
LL x, y;
cin >> x >> y;
if (abs(x - y) <= 1)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<char>> A(N, vector<char>(N));
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
cin >> A.at(i).at(j);
}
}
vector<vector<char>> B(M, vector<char>(M));
for (int i = 0; i < M; i++) {
... | 0 | 54,515,280 |
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
#define rep(i,n) for(int i = 0; i< n; i++);
int main() {
ll a , b , c , k ;
cin >> a >> b >> c >> k ;
if(k%2==1){
cout << b-a << endl;
}
else {
cout << a-b << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
const int Maxn = 2e5+7;
int n;
int a[Maxn];
int main()
{
cin >> n;
for(int i = 0; i < n; ++i) cin >> a[i];
int l = 1, r = n;
while(l < r)
{
int mid = (l+r)>>1, flag = 0;
vector<pair<int, int> > v;
for(int i = 1; i < n; ++i)
... | 0 | 13,264,125 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n;
cin >> n;
vector<P> ab(n), sum(n);
for(int i=0; i<n; ++i){
cin >> ab[i].first >> ab[i].second;
sum[i].first = ab[i].first + ab[i].second;
sum[i].second = i;
}
sort(sum.begin(),sum.end(... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n); (i)++)
#define rep(i, n) for(int (i)=0; (i)<(n); (i)++)
#define rev(i, n) for(int (i)=(n)-1; (i)>=0; (... | 0 | 81,300,631 |
#include<bits/stdc++.h>
#define int long long
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(a) a.size()
#define re return
#define MP make_pair
#define pb push_back
#define pii pair<int,int>
#define se second
#define fi first
using namespace std;
signed main(){
ios_base::sync_with_std... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i =... | 0 | 18,422,548 |
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mod 1000000007
#define inf 1000000000000000000
#define bpc(x) __builtin_popcountll(x)
#d... | #include <bits/stdc++.h>
using namespace std;
#define ipr pair<int, int>
#define pb push_back
#define ff first
#define ss second
#define fr(i, j, k) for (int i = j; i < k; i++)
#define rf(i, j, k) for (int i = j; i >= k; i--)
#define ll unsigned long long
#define int long long
#define ld long double
#define all(x) x.be... | 0 | 4,609,451 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,N) for(ll i=0;i<N;++i)
typedef long long int ll;
typedef long double ld;
const ll INF = 1<<30;
int main(){
ll H,W; cin >> H >> W;
ll S = H*W;
ll ans = INF;
rep(w,W){
ll S1 = H*w;
ll x1 = floor(((ld)(S - S1) / 2.0) / H);
l... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
using namespace std;
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; ret... | 0 | 94,504,449 |
typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
bool comp(const complex<double> &left,const complex<double> &right){
return arg(left) < arg(right);
}
int main() {
ll n;
std::cin >> n;
vector<complex<double>> xy(n);
for (int i = 0; i < n; i++) {
double tx,ty;
std::... | #include<iostream>
#include<vector>
#include<string>
using namespace std;
vector <int> a;
void insert(int t) {
int k = a.size();
a.push_back(t);
while (k != 0 && a[(k - 1) / 2] < a[k]) {
swap(a[k], a[(k - 1) / 2]);
k = (k - 1) / 2;
}
}
void maxheapify(int i) {
int l = 2 * i + 1;
... | 0 | 12,778,267 |
#include<string>
#include<vector>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<functional>
#include<numeric>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<utility>
#include<sstream>
#include<complex>
#include<fstream>
#include<bitset>
#include <iostream>
using namespace std;
type... | #include <bits/stdc++.h>
#include<algorithm>
#include<stdio.h>
#pragma GCC optimize(2)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll INF=1e13;
const ll maxn=1e6+5;
const int mod=998244353;
const double eps=1e-12;
ll n,m,p;
ll num[maxn];
int pre[maxn][2];
int cur[maxn][2];
struct no... | 0 | 12,394,864 |
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
const ll LINF=1LL<<60;
const int IN... | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int MOD = 1e9+7;
typedef pair<ll, ll> pairs;
typedef vector<pairs> p;
struct edge{
ll to, cost;
};
ll gcd(ll a,ll b){
if(b == 0){
return a;
}else{
r... | 0 | 36,339,752 |
#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < b; i++)
#define Rep(i, a, b) for(int i = a; i <= b; i++)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define ll long long
#define ALL(v) (v).begin(),(v).end()
using namespace std;
void solve() {
string s; cin >> s;
if(s.... | #include <bits/stdc++.h>
#define REPI(x) for(int i=0;i<x;i++)
#define REPJ(x) for(int j=0;j<x;j++)
#define REPISE (s,e) for(int i=s,i<e;i++)
#define REPJSE (s,e) for(int j=s,j<e;j++)
typedef long long ll;
using namespace std;
int main ()
{
int N,cnt,cur,p,res;
char pin[3];
string S;
cin >> N;
cin >> S;
REPI... | 0 | 66,702,251 |
#include<stdio.h>
int main()
{
int A, B, C, D, X, Y;
scanf("%d%d%d%d",&A, &B, &C, &D);
if(A>B){X=B;}
else{
X = A;
}
if (C>D){Y=D;}
else {
Y = C;
}
printf("%d\n", (X+Y) );
return 0;
} | #pragma GCC optimize("O3")
#pragma GCC target ("sse4")
#define NDEBUG
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <cstring>
#include <vector>
#include <map>
#include <cmath>
#include <climits>
#include <list>
#include <functional... | 0 | 64,595,408 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <iomanip>
#include <math.h>
#include <utility>
#include <functional>
using namespace std;
using vl = vector <long long>;
using vs = vector <string>;
using vc = vector <char>;
using ll= long long;
using vvl = vector<v... | #include <iostream>
#include <string>
using namespace std;
int main() {
int check = 0;
do {
string word;
cin >> word;
if (!(word[0] == '-')) {
int m;
cin >> m;
int h;
for (int i = 0; i < m; ++i) {
cin >> h;
string left = word.substr(0, h);
string right = word.substr(h, word.size() - h);
... | 0 | 24,523,840 |
#include<iostream>
#define LL long long
LL K;
LL A[50];
int main(){
std::cin>>K;
std::cout<<50<<std::endl;
for(int i=0;i<50;i++){
A[i]=49+(K/50);
}
for(int i=0;i<K%50;i++){
A[i]+=50;
A[i]-=K%50-1;
}
for(int i=K%50;i<50;i++){
A[i]-=K%50;
}
for(int i=0;i... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int n;
cin >> n;
string s;
cin >> s;
string tmp = "SW";
for(int p = 0; p < 2; p++){
for(int q = 0; q < 2; q++){
for(int r = 0; r < 2; r++){
vecto... | 0 | 30,882,227 |
#include<iostream>
#include<algorithm>
#include<queue>
#include<cmath>
#include<map>
#include<vector>
#include<iomanip>
using namespace std;
typedef long long ll;
ll inf = 100000000;
ll v[205];
ll x[20000005];
ll a[10000005];
ll b[10000005];
ll dp[10005][10005];
ll ex = 1000000007;
int dx[4] = { 1,-1,0,0 };
int dy[4] =... | #include <bits/stdc++.h>
#include <vector>
using namespace std;
int main(){
int n;
cin>>n;
vector<long long> a(n+1);
vector<long long> b(n);
long long sum=0;
for (int i=0; i<n+1; i++) cin>>a[i];
for (int i=0; i<n; i++) cin>>b[i];
for (int i=0; i<n; i++){
if (a[i]<b[i]){
... | 0 | 8,946,903 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0,1,0,-1};
int dy[4] = {1,0,-1,0};
void solve() {
... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setprecision(15) << (x) << "\n"
#define ENDL cout << "\n"
#d... | 0 | 35,675,739 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin>>n;
double arr[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
sort(arr,arr+n);
double ans = (arr[0]+arr[1])/2;
for(int i=2;i<n;i++)
{
ans = (an... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
int h,w,a,b;
cin>>h>>w>>a>>b;
char ans[h][w];
rep(i,h){
rep(j,w){
if(i<b &&... | 0 | 143,674 |
#include<bits/stdc++.h>
#define ALL(c) (c).begin(),(c).end()
#define EACH(i,c) for(auto i=(c).begin();i!=(c).end();++i)
using namespace std;
#define int long long
signed main(signed argc, char** argv){
int N;
cin >> N;
vector<int> X(N), Y(N);
for(int i = 0; i < N; ++i) {
cin >> X[i] >> Y[i];
}
bool g = true;
i... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define ff first
#define ss second
#define file_se_input freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
#define pp long long int
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __bui... | 0 | 41,694,457 |
#include<bits/stdc++.h>
#define ALL(c) (c).begin(),(c).end()
#define EACH(i,c) for(auto i=(c).begin();i!=(c).end();++i)
using namespace std;
int main(){
int n;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; ++i) {
cin >> a[i];
}
sort(ALL(a));
int m = a[n-1];
int l = a[0];
for(int i = 1; i < n - 1; ++i) {
... | #include <iostream>
#include<vector>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = 1; i <= (n); i++)
#define drep(i,n) for(int i = (n)-1; i >= 0; i--)
#define srep(i,s,t) for (int i = s; i < t; i++)
#define rng(a) a.begin(),a.end()
using ll = long long;
using namespace std;
int main() {
... | 0 | 52,832,485 |
#include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_AS... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i < (n); i++)
#define lower(s) transform(s.begin(), s.end(), s.begin(), ::tolower)
using namespace std;
using ll = long long;
int INF = 1001001001;
int main() {
int n, m;
cin >> n >> m;
vector<int> ac(n);
vector<int> wa(n);
int t_ac = 0;
int t_wa = 0;
... | 0 | 35,544,536 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x)(x).begin(), (x).end()
#define rall(v)(v).rbegin(), (v).rend()
#define INF 1LL << 60
typedef long long int LL;
typedef long long int ll;
#define pll pair < ll, ll >
#define F first
#define S second
const int MOD =... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll<<50;
templ... | 0 | 13,788,272 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for(ll i = m; i < n; i++)
#define IFOR(i, m, n) for(ll i = n - 1; i >= m; i-- )
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define FOREACH(x,a) for(auto& (x) : (... | #include <bits/stdc++.h>
using namespace std;
bool check(vector<int> a,vector<int> b){
if(a.size()>b.size()) return true;
else if(a.size()<b.size()) return false;
else{
sort(a.begin(),a.end(),greater<int>());
sort(b.begin(),b.end(),greater<int>());
for(int i=0;i<a.size();++i){
if(a[i]>b[i]){
... | 0 | 15,564,230 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,str,end) for(ll i=(ll)(str); i<(ll)(end); i++)
int main(){
string a,b;
cin>>a>>b;
if(a==b){cout<<"EQUAL"<<endl;return 0;}
else if(a.size()<b.size()){cout<<"LESS"<<endl;return 0;}
else if(a.size()>b.size()){cout<<"GREAT... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
vector<int>prime(1000005,0);
bool mark[1000005];
int nprime;
void sieve(int n)
{
int limit=sqrt(n*1.0)+1,s=0;nprime=0;
mark[1]=true;
mark[2]=false;
prime[nprime++]=2;
for(int i=3;i<=n;i+=2){
if(!mark[i]){prime[nprime++]=i;
... | 0 | 74,203,619 |
#include <bits/stdc++.h>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(... | /*http:
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
while(1){
int n,k;
cin >> n >> k;
if((n==0)&&(k==0)) break;
int s[n+1];
s[0]=0;
rep(i,n){
int a;... | 0 | 75,013,681 |
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<vector>
#include<queue>
#include<map>
#define rep(index,num) for(int index=0;index<num;index++)
#define rep1(index,num) for(int index=1;index<=num;index++)
#define scan(argument) cin... | #include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define ll long long
#define ld long double
#define pb push_back
#define MOD 1000000007
#define LLMN LONG_LONG_MIN
#define... | 0 | 95,365,045 |
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define MOD 1000000007
using namespace std;
int main()
{
ll n, l;
cin >> n >> l;
vector<ll> a(n);
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
vector<ll> ans;
for (int i = 0; i < n; i++)
{
... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define endl "\n"
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <typen... | 0 | 34,122,261 |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n = 4;
vector<vector<int>> g(n, vector<int>(n, n));
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
g[a - 1][b - 1] = 1;
g[b - 1][a - 1] = 1;
}
for (int i = 0; ... | #include <iostream>
using namespace std;
int main(){
int debt = 100000;
int week;
cin >> week;
for(int i = 0; i < week; ++i){
debt *= 1.05;
if(debt % 1000 != 0){
debt = (debt + 999) / 1000;
debt = debt * 1000;
}
}
cout << debt << endl;
r... | 0 | 83,468,231 |
#include <iostream>
#include <climits>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <deque>
#define INF_INT (INT_MAX / 2)
#define INF_LONG (LONG_MAX / 2)
#define DEBUG false
using namespace std;
const int MAX = 100001;
const int MOD = ... | #pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
using base = complex<double>;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define M 1000000007
#define M2 998244353
#define ll long long
#define pll pair... | 0 | 55,611,906 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
int k;
ll ans;
ll solve() {
deque<pair<int, ll>> deq;
set<int> visited;
deq.push_front(make_pair(1, 0LL));
ll ret = 0;
while (!deq.empty()) {
auto cur = deq.front();
d... | #include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <map>
#include <set>
#include <queue>
#include <list>
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,a,b) for(int i=int(a);i<int(b);++i)
#define crep... | 0 | 49,741,528 |
#include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
#ifdef _MSC_VER
#include <Windows.h>
#else
#include <unistd.h>
#endif
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}... | #include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
#include<set>
using namespace std;
#define intmax INT_MAX
#define lmax LONG_MAX
... | 0 | 67,633,884 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define RREP(i,n) for(int i = (n)-1; i >= 0; i--)
#define FOR(i, l, r) for(int i = l; i < r; i++)
#define RFOR(i, l,r) for(int i= (l)-1; i>= (r) ; i--)
#define int64 int64_t
#define uint64 uint64_t
#define uint unsigned
int main(... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int , int> P2;
typedef pair<pair<int , int> , int> P3;
typedef pair<pair<int , int> , pair<int , int> > P4;
#define PB(a) push_back(a)
#define MP(a , b) make_pair((a) , (b))
#define M3P(a , b , c) make_pair(make_pair((a) , (b)) , (c))
#def... | 0 | 61,480,171 |
#include <bits/stdc++.h>
#define s second
#define f first
#define pb push_back
#define endl '\n'
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
char c;
cin >> c;
bool ans =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end(... | 0 | 69,125,613 |
#include<bits/stdc++.h>
using namespace std;
#define gc getchar_unlocked
#define fo(i,n) for(i=0;i<n;i++)
#define Fo(i,k,n) for(i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define ll long long
#define si(x) scanf("%d",&x)
#define sl(x) scanf("%lld",&x)
#define ss(s) scanf("%s",s)
#define pi(x) printf("%d\n",x)
#define pl(x) printf(... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 65;
bool ch[maxn];
long long mask[maxn];
long long a[100005], all;
void Insert(long long t){
for(int i=60;i>=0;i--){
if(ch[i]) continue;
if((t>>i)&1){
if(mask[i]==0){
mask[i] = t;
return;
... | 0 | 43,380,410 |
#include <bits/stdc++.h>
using namespace std;
#define REPI(x) for(int i=0;i<x;i++)
#define REPJ(x) for(int j=0;j<x;j++)
#define SCANFD(x) scanf("%d",&x)
int main(){
int N;
int a[200000];
long long x,y;
long long res;
scanf("%d",&N);
for(int i=0;i<N;i++)
scanf("%d",&a[i]);
x=a[0];... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#includ... | 0 | 34,034,637 |
#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 a, b, c;
cin >> a >> b >> c;
cout << max({ a,b,c }) * 9 + a + b + c << e... | #include<iostream>
#include<iomanip>
#include<math.h>
#include<vector>
#include<string>
#include<stack>
#include<queue>
#include<map>
#include<algorithm>
#include<bitset>
#include <climits>
#include<set>
#include<bitset>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<long long> vl;
typ... | 0 | 60,205,636 |
#include <stdio.h>
#include <string.h>
int main(){
char str[1000],ord[10],work[1000];
int q,a,b,i,k;
scanf("%s%d",str,&q);
for(i=0; i<q; ++i){
scanf("%s",ord);
memset( work , '\0' , 1000);
if(strcmp(ord,"replace") == 0){
scanf("%d%d%s",&a,&b,work);
for(k=a; k <= b; ++k)
str[k]=work[k-a]... | #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,n) for(int i=1;i<=(n);i++)
#define rep3(i,i0,n) for(int i=i0;i<(n);i++)
#define pb push_back
#define mod 1000000007
#define INF 200000000000
template<class T>bool chmax(T &a, const T &b) { if (a<b) ... | 0 | 83,843,034 |
#include <bits/stdc++.h>
#define PI 3.14159265359
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
int main() {
int64_t r, D, x;
cin >> r >> D >> x;
for (int i = 0; i < 10; i++) {
x = x * r - D;
cout << x << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100 + 20;
int n, a[maxn], g;
int main()
{
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
for (int i = 0; i < n; i++)
{
if (a[i] == a[i+1])
{
if (a[i+1] == a[i+2])
{
i += 1;
g++;
}
else
{
g++;
}
}
}
cout ... | 0 | 88,312,725 |
#pragma region
#include <bits/stdc++.h>
using namespace std;
inline void ci(void){
return;
}
template <typename First, typename... Rest>
void ci(First& first, Rest&... rest){
cin >> first;
ci(rest...);
return;
}
inline void co(void){
cout << endl;
return;
}
template <typename First, typename... Rest>
void c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1001001001;
const ll LINF = 1LL << 60;
const int MOD = 1'000'000'007;
template <typename T>
void print(const T &v)
{
for (int i = 0; i < v.size(); i++)
{
if (i)
cout << ' ';
... | 0 | 32,243,530 |
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define rep2(i,n) for(int i=0;i<=n;i++)
#define repr(i,a,n) for(int i=a;i<n;i++)
#define all(a) a.begin(),a.end()
#define... | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define REP(i,a,n) for(int i = a;i < (n);i++)
#define RREP(i,a) for(int i = a;i >= 0;i--)
#define rep(i,n) for(int i = 0;i < (n);i++)
#define rrep(i,n) for(int i = n - 1;i >= 0;i--)
#define all(s) s.begin(), s.end()
#define rall(s) s.rbegin(), s.rend()
... | 0 | 42,552,370 |
#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (b); i++)
#define rrep(i, a, b) for (int i = a; i >= (b); i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
int N, M;
vector<int> V(10);
int ans;
signed main()
{
cin >> N >> M;
for(int i = 0; i < N; i++)
{
int a;
cin >> a;
ans += a;
int tmp = 1;
for(int j = 0; j < 50; j++)
{
V.push_back(a... | 0 | 59,719,070 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
#include<set>
#include<cstdio>
using namespace std;
#define ll long long
#define rep(i, n) for(int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
const ll mod = 10000... | #include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#i... | 0 | 78,512,114 |
#include<bits/stdc++.h>
using namespace std;
using ull=unsigned long long;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define setbits(x) __builtin_popcount(x)
#defin... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <unordered_map>
#include <vector>
#include <string.h>
#include <set>
using namespace std;
#define COUT(x) cout << #x << " = " << (x) << " (L" <... | 0 | 5,164,005 |
#include<stdio.h>
int main(void)
{
int w,h,x,y,r;
scanf("%d %d %d %d %d",&w,&h,&x,&y,&r);
if(w<r+x || h<r+y){
printf("No\n");
}
else if(r>x || r>y){
printf("No\n");
}
else{
printf("Yes\n");
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vout(x) rep(i,x.size()) cout << x[i] << " "
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return... | 0 | 28,713,578 |
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << ends << H;... | #include <bits/stdc++.h>
#ifdef LOCAL_DEBUG
#define DEBUG 1
#define CERR if(DEBUG) cerr
#define MACRO(_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,NAME,...) NAME
#define pr(...) CERR<<MACRO(__VA_ARGS__,pr10,pr9,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)<<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#def... | 0 | 29,120,118 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b, c;
bool have;
int ans;
cin >> a >> b >> c;
if(a == b){
if(b == c) ans = 1;
else ans = 2;
}
else if(a == c){
ans = 2;
}
else if(b == c) ans = 2;
else ans = 3;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#ifdef HIRO
#define d(f_, ...) printf((f_), ##__VA_ARGS__)
#else
#define d(f_, ...)
#endif
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector< pair<int, int> > vii;
typedef vector< ... | 0 | 4,318,636 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll... | #include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
using namespace std;
#define re... | 0 | 356,711 |
#include<cstdio>
#include<cstring>
#define RI register int
#define CI const int&
using namespace std;
const int N=200005;
int n,c; long long ans; char s[N];
int main()
{
RI i; scanf("%s",s+1); n=strlen(s+1);
for (i=1;i<=n;++i) if (s[i]=='B') ++c; else ans+=c;
return printf("%lld",ans),0;
} | #include <cstring>
#include <algorithm>
#include <iostream>
struct card {
char mark;
unsigned int number;
bool operator<(const card& rhs) { return number < rhs.number; }
};
std::ostream& operator<<(std::ostream& os, const card& card)
{
return os << card.mark << card.number;
}
std::istream& operator>>(std::istre... | 0 | 19,393,704 |
#include <iostream>
using namespace std;
int main(){
int N;
cin >> N;
int C[N-1], S[N-1], F[N-1];
for (int i = 0; i < N-1; i++){
cin >> C[i] >> S[i] >> F[i];
}
int ans[N-1];
for (int i = N - 2; i >= 0; i--){
int tmp = S[i] + C[i];
for (int j = i+1; j < N - 1; j++){
if (S[j] >= tmp){
... | #include <iostream>
#include <cstdlib>
#include <string>
#include <typeinfo>
#include <cstring>
#include <iostream>
#define MAX 2000001
#define VMAX 10000
using namespace std;
int main(){
unsigned short *A,*B;
int C[VMAX + 1];
int n,i,j;
cin >> n;
A = static_cast<unsigned short*>(malloc(sizeof(short... | 0 | 39,856,514 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, M, K;
cin >> N >> M >> K;
string ans = "No";
for (int i=0; i<=N; i++) {
for (int j=0; j<=M; j++) {
int k = i * M + j * N - 2 * i * j;
if (k == K) {
ans = "Yes";
break;
}
}
}
cout << ans << endl;
return 0;... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define MOD 1000000007
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n; i++)
#define repr(i, n) for(ll i = n-1; i >= 0; i-... | 0 | 55,751,959 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> P;
#define INF 1000000000000
#define MOD 1000000007
#define MAXR 100000
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define Z class
template <typename T>
T square(T x) { retu... | #include<bits/stdc++.h>
using namespace std;
#define pi acos(-1.0)
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define pb push_back
#define fi first
#define se second
#define in insert
#define mp make_pair
#define GCD(a,b) __gcd(a,b);
#define endl "\n"
#define FRU f... | 0 | 75,476,459 |
#include <cstdio>
#include <algorithm>
using namespace std;
const int N=100010;
const int INF=1e9;
int n;
int a[N];
inline int abs(int x){
return x>=0?x:-x;
}
void readData(){
scanf("%d",&n);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
}
void solve(){
sort(a+1,a+1+n);
int p=lower_bound(a+1,a+1+(n-1),(a[n]+1)>>1)-a;
... | #include <bits/stdc++.h>
#define ll long long
#define ch char
#define st string
using namespace std;
ll a,b,c,d,e,f,g,h;
void Urvatullo_Atoev()
{
cin>>a;
if(a>=400 && a<=599)
{
cout<<8;
}
else if(a>=600 && a<=799)
{
cout<<7;
}
else if(a>=800 && a<=999)
{
cout<... | 0 | 6,903,894 |
#include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <numeric>
#include <iomanip>
#defi... | #include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<numeric>
using namespace std;
int main()
{
int N, M, t, x, y; cin >> N >> M;
long long ans;
vector<int> a(N), c(31,0);
for(int i=0; i<N; i++) cin >> a[i];
sort(a.begin(),a.end(),greater<int>());
for(int i=30; i>... | 0 | 72,409,540 |
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<math.h>
#include<string.h>
using namespace std;
struct node{
int g,t;
}a[100005];
int n,m;
int main()
{
scanf("%d%d",&n,&m);
for(int i=0;i<m;i++)
{
scanf("%d%d",&a[i].g,&a[i].t);
}
int sumstart=a[0].g;
int sumover=a[0].t;
for(int i=1;i<m;i++)
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | 0 | 92,544,732 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(NAME, NUM) for (int NAME = 0; NAME < (NUM); ++NAME)
#define BREP(NAME, NUM) for (int NAME = (NUM)-1; NAME >= 0; --NAME)
#define VEC(TYPE, A, NAME, INIT) vector<TYPE> NAME(A, INIT)
#def... | #include<bits/stdc++.h>
using namespace std;
#define MOD2 998244353
int main(){
int n;
cin >> n;
vector<long long> d(n),dist(n);
long long ans = 1;
for(int i = 0;i < n;i++){
cin >> d[i];
dist[d[i]]++;
}
if(d[0] != 0 || dist[0] != 1){
cout << 0 << endl;
return ... | 0 | 69,134,370 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int inf = 1001001001;
int main(){
char c;
cin >> c;
char C = toupper(c);
cout << (C == c ? "A":"a") << endl;
} | #include <bits/stdc++.h>
using namespace std;
const long long INF = 1LL << 60;
int main() {
int H, W; cin >> H >> W;
vector<vector<char>> data(H, vector<char>(W));
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> data.at(i).at(j);
}
}
for (int i = 0; i <... | 0 | 100,384,624 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,A,B;
cin >> N >> A >> B;
int ans=0;
for(int i=1; i<N+1; i++){
int c=0, t=i;
for(int j=0; j<5; j++){
c += t % 10;
t /= 10;
}
if(A <= c && c <= B){
ans += i;
}
}
cout << ans << endl;
} | #include <iostream>
#include <string>
#include <queue>
#include <vector>
#include <algorithm>
#include <math.h>
#include <map>
#include <iomanip>
#include <queue>
using namespace std;
int main() {
int ans =0, A, B, C;
vector<int> N;
cin >> A >> B >> C;
N.push_back(A);
N.push_back(B);
N.push_back... | 0 | 54,725,147 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
char s[16];
cin>>s;
int l=strlen(s),ans=0;
for(int i=0;i<l;i++)
{
if(s[i]=='o')
{
ans++;
}
}
if((ans+(15-l))>=8)
{
cout<<"YES"<<endl;
}
else
{
cout<<"NO"<<endl;
}... | #include<bits/stdc++.h>
#define rep(i,n) for(ll i = 0;i < n;++i)
#define all(v) v.begin(),v.end()
using namespace std;
using ll = long long;
typedef pair<int,int> P;
const int INF = 1001001001;
const long double PI = (acos(-1));
const int mod = 1e9+7;
const int vx[6] = {0,1,0,-1,1,-1};
const int vy[6] = {1,0,-1,0,1,1};... | 0 | 41,939,848 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main () {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
int ans = a[0];
rep(i, n) ans = __gcd(ans, a[i]);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int s[5];
char op[5];
void solve(int index, int cur_sum) {
if (index == 3) {
if (cur_sum == 7) {
for(int i = 0; i < 4; ++i) {
if (i > 0) cout << op[i];
cout << s[i];
}
cout << "=7";
... | 0 | 70,608,155 |
#include <bits/stdc++.h>
using namespace std;
int main() {
double l,k;
cin >> l;
k = l/3;
double ans = k*k*(l-2*k);
cout << fixed << setprecision(7) << ans << endl;
} | #include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
template<class T> inli... | 0 | 12,321,146 |
#include <bits/stdc++.h>
#define _USE_MATH_DEFINES
#define MOD 1000000007
#define COUNTOF(array) (sizeof(array)/sizeof(array[0]))
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
void solve(){
int S;
cin >> S;
ll dp[2001] = {0};
dp[0] =... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | 0 | 87,798,037 |
#include <iostream>
using namespace std;
#define NUM 100
int main(){
int N,M,P;
double gold = 0;
double give;
double pull;
double get[NUM];
int num[NUM];
int count = 0;
int i;
while(1){
count++;
cin >> N >> M >> P;
if ((N==0 && M==0 && P==0) || count > 100){
count--;
br... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define boost ios_base::sync_with_stdio(false);cin.tie(NULL);
#define pb push_back
#define mp make_pair
#define in insert
#define pi 2*acos(0.0)1
#define srt(s) sort(s.begin(),s.end())
#define all(x) x.begin(),x.end()
const ll mod=1e9+7;
const ll MX=2e5... | 0 | 4,784,965 |
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
int N;
typedef long long LL;
const int maxn = 55;
LL a[maxn];
int main(){
while(cin >> N){
for(int i = 1;i <= N;i++){
scanf("%lld", &a[i]);
}
LL ans = 0;
while(true){
... | #include <iostream>
#include <vector>
#include <cstdlib>
#include <climits>
using namespace std;
int main(){
while(true){
int m, n_min, n_max;
cin >> m >> n_min >> n_max;
if(m == 0) break;
vector<int> p(m, 0);
for(int i = 0; i < m; ++i)
cin >> p[i];
int ga... | 0 | 30,341,734 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
long long n, c, k;
cin >> n >> c >> k;
vector<long long> T;
long long t;
for(long long i = 0; i < n; i++){
cin >> t;
T.push_back(t);
}
sort(T.begin(), T.end());
l... | #include<bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n ; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define whole(f, x, ...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)
using namespace std;
typedef long long ll;
const int INF = 1e9;
int main(void){
... | 0 | 63,695,078 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <numeric>
#include <cmath>
int main(){
unsigned long long int n, a, b;
std::cin >> n >> a >> b;
unsigned long long int ans_1 = (n / (a + b)) * a;
unsigned long long int ans_2 = std::min(a, n % (a + b));
std::cout <... | #include <cstdio>
#include <cstring>
#include <cmath>
#include <utility>
#include <iostream>
#include <functional>
#include <bitset>
#include <algorithm>
#include <vector>
#include <forward_list>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <numeric>
#define ll long long int... | 0 | 73,507,096 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
int64_t K;
cin >> S;
cin >> K;
int64_t ini = 300;
int64_t ini_num = -1;
for ( int64_t i = 0; i < S.size(); ++i){
if ( S[i] != '1' ){
ini = i;
ini_num = S[i] - '0';
break;
... | #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;
}
... | 0 | 57,967,705 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define int long long
using pint = pair<int, int>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dxx[8] = {1, 1, 1, 0, 0... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INF INT_MAX
#define INFLL LLONG_MAX
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define per(i, n) for(ll i=((ll)(n))-1; i>=0; i--)
#define perf(i, n) for(l... | 0 | 86,391,286 |
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define inputInt(a) int a; cin >> a;
#define inputInt2(a,b) int a; int b; cin >> a >> b;
#define inputInt3(a,b,c) int a; int b; int c; cin >> a >> b >> c;
#define inputLong(a) long a;cin >> a;
#define inputIntArray(a,N) int a[N];for(int i=0;i<N;i++){ci... | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <set>
using namespace std;
int main(){
int N, K;
cin >> N >> K;
vector<long long> cnt(K);
for(int i = 1; i <= N; i++){
cnt[i % K]++;
}
long long ans = 0;
for(int i = 1; i <= N; i++){
if((K ... | 0 | 38,257,311 |
#include <iostream>
using namespace std;
long long gcd(int a, int b)
{
if(b == 0)
{
return a;
}
return gcd(b, a % b);
}
int main()
{
long long a, b, total = 0, c, d;
cin >> a >> b >> c >> d;
total += b / c - (a - 1) / c;
total += b / d - (a - 1) / d;
long long x = gcd(c, d);
... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, k, s;
cin >> n >> k >> s;
long long INF = 10000000000;
vector <long long> ans(n, INF);
for (int i; i < k; i ++){
ans[i] = s;
}
for (int i; i < n; i ++){
if (ans[i] == INF){
if (s == 1000000000){
... | 0 | 52,805,712 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
long long T = 0, c1 = 0, c2 = 0, c3 = 0;
for (int i = 0; i < N; ++i) {
string S;
cin >> S;
for (int j = 0; j + 1 < S.size(); ++j) {
if (S[j] == 'A' && S[j + 1] == 'B') ++T;
... | #include <bits/stdc++.h>
typedef long long ll;
#define MOD 1000000007
using namespace std;
int N,A,B,C;
int l[8];
int ans = 1e9;
void dfs(int a, int b, int c, int cur, int mp){
if(cur == N){
if(min(a,min(b,c)) > 0) ans = min(ans,abs(a-A) + abs(b-B) + abs(c-C) + mp -30);
return;
}
dfs(a,b,c... | 0 | 85,732,901 |
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,a[100005];
int main()
{
scanf("%d",&n);
n*=2;
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
sort(a+1,a+n+1);
int ans=0;
for(int i=1;i<=2*n;i+=2)
ans+=min(a[i],a[i+1]);
printf("%d",ans);
return 0;
} | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
ll GCD(ll a,ll b){
if(b==... | 0 | 23,835,790 |
#include <bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const ll MAXN = 200000;
const ll INF = 1001001001;
const ll MOD = 1000000007;
ll N, P, ans=0, tmp1=0, tmp2=0;
string S;
vector<ll> A;
signed main(){
cin >> N >> P >> S;
A.resize(P,0);
A[0]++;
tmp1 = 1;
if(10%P=... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n, k;
cin >> n >> k;
string s;
cin >> s;
if(s.at(n-1) == '0'){
s += '1';
}else{
s += '0';
}
vector<vector<int>> a(0,... | 0 | 61,329,340 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> orderedSet;
... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
#define mod 1000000007
#define IINF INT_MAX
#define INF 1LL << 30
int main() {
int n; cin >> n;
map<string, int> mp;
for(int i = 0; i < n; i++){
... | 0 | 45,477,258 |
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vec... | #include <vector>
#include <list>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip... | 0 | 6,371,601 |
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <stack>
#include <vector>
#include <set>
#include <tuple>
#include <utility>
#include <functional>
using namespace std;
typedef long long ll;
typed... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define pow2(i) (1<<i)
#define BIT(X,i) ((X>>i)&1)
#define DEBUG(x) cerr<<__LINE__<<": "<<#x<<" = "<<x<<"\n"
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}
const int INF = 1e9;
int main() {
... | 0 | 9,156,159 |
#include <iostream>
#include <cmath>
using namespace std;
int main() {
int a;
int n;
while(true){
int sum=0;
int minimum=1000,maximum=0;
cin >> n;
if(n==0) break;
for(int i=0;i<n;i++){
cin >> a;
sum+=a;
maximum=max(maximum,a);
minimum=min(minimum,a);
}
cout << (sum-maximum-minimum)/(n-2) <<... | #include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <climits>
#include <cstring>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <cstdlib>
#include <deque>
#include <stack>
#include <bitse... | 0 | 56,941,348 |
#include <stdio.h>
int main(){
int N,M;
int A,B,X,i,Y;
scanf("%d %d", &N, &M);
A=1;
X=0;
for(i=2;i<=N; i++){
X=X+A;
A++;
}
A=1;
Y=0;
for(i=2;i<=M; i++){
Y=Y+A;
A++;
}
printf("%d", X+Y);
return 0;
} | #include <bits/stdc++.h>
#define REP( i , nn ) for(int i = 0 ; i < (int) nn; i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
template <class T>
void print_vect(std::vector<T> v){
for(int i = 0 ; i < v .size(); i++) cout << v[i] << " ";
cout << endl;
}
constexpr int... | 0 | 32,907,706 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <limits>
#include <queue>
#include <map>
using namespace std;
#define rip(i,n,s) (int i=(s);i<(int)(n);i++)
#define all(a) (a).begin(),(a).end()
long long mod = 1000000007;
long long powr(long long n, long long p, long long k) {
if (... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
constexpr ll INF = 9e18;
constexpr int inf = 1e9;
constexpr double INFD = 1e100;
constexpr ll mod = 1000000007;
const double PI = 3.1415926535897932384626433832795028841971;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0,... | 0 | 95,226,734 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.