code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include<iostream>
#include <algorithm>
#include <string>
using namespace std;
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
typedef long long ll;
const int INF = numeric_limits<int>::max();
const int MOD = (1e9 + 7);
int main(){
int H, W, ans1, ans2, ans3, ans4, ans5, ans6, ans7, ans8, a... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pcnt(bit) __builtin_popcountll(bit)
#define mod 1000000007
#define pi acos(-1.0)
using namesp... | 0 | 95,230,267 |
#include<stdio.h>
#include<math.h>
#include<iostream>
using namespace std;
int main() {
int i, j, a[10] = {0}, temp;
for (i = 0; i < 10; i++) {
cin >> a[i];
}
for (i = 0; i < 9; i++) {
for(j = i + 1; j < 10; j++) {
if (a[j] < a[i]) {
temp = a[j];
a[j] = a[i];
a[i] = temp;
}
}
}
for (i = 9;... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx")
#define all(x) (x).begin(),(x).end()
#define rep(i,n) for(int (i)=0;i<(n);i++)
#define rrep(i,n) for(int (i)=1;i<=(n);i++)
#define REP(i,m,n) for(int (i)=(m);(i)<(n);(i)++)
#define MOD 1000000007
#define INF 1e18
#defi... | 0 | 63,421,833 |
#include<stdio.h>
int main(void)
{
int a[3];
int i,j,temp;
for (i=0;i<3;i++){
scanf("%d",&a[i]);
}
for (i=0;i<2;i++){
for (j=i+1;j<3;j++){
if (a[i]>a[j]){
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
for(i=0;i<2;i++){
printf("%d ",a[i]);
}
printf("%d\n",a[2]);
return 0;
} | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int n;
vector<int> a;
void update(int i, int x);
int query... | 0 | 10,809,510 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1999999999
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define MODA 1000000007
int main() {
int ans = 0;
int tmp;
int n, k;
cin >> n >> k;
vector<int> a(n);
REP(i, n) cin >> a[i];
sort(a.begin(), a.... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
int main() {
string S,T; cin >> S >> T;
if(S... | 0 | 2,710,436 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int K;
vector<ll> ans;
const ll MAX = 3234566667;
void dfs(ll cur)
{
if(cur > MAX) return;
ans.push_back(cur);
int last = cur%10;
dfs(10*cur+last);
if(last >= 1) dfs(10*cur+last-1);
if(last <= 8) dfs(10*cur+last+1);
}
void solve()
{
for(int i=1;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll x;
cin>>x;
for(int i=1;i<=360;i++){
if(i*x%360==0){
cout<<i;
return 0;
}
}
return 0;
} | 0 | 17,096,992 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int a, b;
cin >> a >> b;
string ans;
if(a%3==0 || b%3==0 || (a+b)%3==0) ans = "Possible";
else ans = "Impossible";
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
const int MOD = 1e9+7;
typedef long long ll;
using namespace std;
const int mod=1000000007;
int N,K;
long ans;
vector<long> X(100100);
long power(long a, long n, long m) {
long ret = 1;
for (; n > 0; n >>= 1, a = a * a % m) {
if (n % 2 == 1) {
ret = ret * a % m;
}
}
retur... | 0 | 58,220,127 |
#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
int main(){
char ch;
while(1) {
scanf("%c", &ch);
if(ch == '0'){
break;
}
int sum = ch - '0';
while(1){
scanf("%c", &ch);
if(ch == '\n') break;
sum += int(ch) - '0';
}
cout << sum <<endl;
}
return 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) << "\n"
#define COUTF(x) cout << setprecision(15) << (x) << "\n"
#define ENDL cout << "\n"
#d... | 0 | 30,428,234 |
#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<vector>
#include<algorithm>
#include<map>
#include<cstring>
#include<math.h>
#include<bitset>
#include<queue>
#include<set>
#include<iomanip>
#include<math.h>
#include<assert.h>
#include<string>
#include<cstdlib>
#include<cctype>
#include<unordered_map>
#include<sstream>
#include<numeric>
#i... | 0 | 97,995,361 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpii;
#define F first
#define S second
#define PU push
#define PUF push_front
#define PUB push_back
#define PO pop
#define POF pop_front
#define POB pop_back
#define R... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<set>
using namespace std;
typedef pair<long int,long int> P;
int main(){
long int H,W,M;
cin>>H>>W>>M;
long int h[M],w[M];
set<P> s;
vector<long int> x(H),y(W);
for (long int i=0;i<M;i++){
cin>>h[i]>>w[i];... | 0 | 6,936,662 |
#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define all(v) (v).begin(), (v).end()
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<n;++i)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << end
#define EPS (1e-7)
#define gearup ios_base::sync_with_st... | 0 | 25,456,684 |
#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for... | #include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
using namespace std;
int main() {
int n;
cin >> n;
long long *nodes = new long long[n+1];
for (int i = 1; i <= n; ++i)
cin >> nodes[i... | 0 | 57,011,566 |
#include<iostream>
#include<string>
#include<vector>
#include <algorithm>
using namespace std;
int kaibunnsuu (int n){
vector<int> N;
while(n > 0){
int ind_digit = n % 10;
N.push_back(ind_digit) ;
n = n /10;
}
int size = N.size() ;
vector<int> rev_N(size);
for(int i=0;i<s... | #include <cstdio>
using namespace std;
int main(){
int i = 0;
while(i < 10000){
int x;
scanf("%d", &x);
if(x == 0) break;
i++;
printf("Case %d: %d\n", i, x);
}
return 0;
} | 0 | 14,597,395 |
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
ll ans = 1000;
... | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define Max(x,y,z) max(x,max(y,z))
#define Min(x,y,z) min(x,min(y,z))
#define fr(i,s,e) for(i=s;i<e;i++)
#define rf(i,s,e) for(i=s-1;i>=e;i--)
#define pb push_back
#define eb emblace_back
#defin... | 0 | 6,878,925 |
#pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define PI 3.141592
#define LL_INF 9000000000000000000
#define LL_MINF -9000000000000000000
#define INT_INF 2000000000
#define INT_MINF -2000000000
#define all(a) (a).begin(), (a).end()
#def... | #include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn = 100000 + 100;
int T, A, B; ll pro;
bool check(ll k)
{
ll a = k, b = k; bool fa = 0, fb = 0;
if(k >= A) a++, fa = 1; if(k >= B) b++, fb = 1;
ll c = a >> 1, d = b >> 1;
if(k & 1)
{
... | 0 | 86,698,658 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
int main()
{
ll x, y;
cin >> x >> y;
ll ay = abs(y);
ll ax = abs(x);
if(x < y)
{
if(x * y >= 0)
{
cout << abs(ay - ax) << endl;
}
else
{
cou... | #include<bits/stdc++.h>
#define Yes cout<<"Yes"<<endl;
#define No cout<<"No"<<endl;
#define ll long long int
using namespace std;
int main()
{
ll tc, a,b,c,n,x,y,z,cnt=0,sum=0;
string str;
cin>>x;
if(x>=400 && x<600)cout<<8<<endl;
else if(x>=600 && x<800)cout<<7<<endl;
else if(x>=800 && x<1000)c... | 0 | 35,339,640 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
const int maxn = 105;
int n;
int a[maxn];
int main(){
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n;
int len = 0;
int ans = 0;
for(int i = 1... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VLL;
typedef vector<VLL> VVLL;
typedef vector<... | 0 | 33,308,743 |
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define FOR0(i,n) for(int i=0, _##i=(n); i<_##i; ++i)
#define FOR(i,l,r) for(int i=(l), _##i=(r); i<_##i; ++i)
#define FORD(i,l,r) for(int i=(r), _##i=(l); --i>=_##i; )
#define repi(i,a)... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
#define INF INT_MAX
vector<ll> dp;
ll f(vector<ll> &v,ll n)
{
if(n==0)
{
return 0;
}
if(n<0)
{
return INF;
}
if(dp[n]!=-1)
{
return dp[n];
}
ll val1,val2,left,right;
l... | 0 | 79,383,705 |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(int argc, char *argv[])
{
int x;
vector<int> freq;
int X[120] ={0};
while(cin >>x){
freq.push_back(x);
}
int maxf = 0;
for(int i = 0;i < freq.size();i++){
X[freq[i]]++;
maxf = max(maxf,X[freq[i]]);
}
... | #include<iostream>
using namespace std;
int main(){
int n, m, i, j;
char chg[1000000], word[100000];
while (true){
cin >> n;
if(n == 0) break;
for(i = 0; i < n * 2; i ++){
cin >> chg[i];
}
cin >> m;
for(i = 0; i < m; i ++){
cin >> word[i];
for(j = 0; j < m; j ++){
if(j % 2 == 0){
if(wor... | 0 | 67,137,428 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
string s1;
int n,l;
cin>>n>>l;
vector <string> v;
vector <string>:: iterator it;
while(n--){
cin>>s1;
v.push_back(s1);
}
sort(v.begin(),v.end());
string s2="";
for(it=v.begin();it!=v.end();it++){
s2... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define INF 1e9
#define LINF 1e18
#define IMOD 1000000007
#define irep(i,n) for(int i = 0; i < (int)(n); i++)
#define irep2(i,a,n) for(int i = (int)(a); i <= (int)(n); i++)
#define lrep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define lrep2(i,a,n) for(long l... | 0 | 67,108,228 |
#include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using na... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include<random>
#define int long long
#define pp pair<int,int>
#define ss second
#define ff first
#define pb push_back
#define mod 1000000007
#define pi 3.14159265359
#define mk(arr,n,type) type *arr=n... | 0 | 16,933,521 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
int k;
cin>>k;
int n=s.size();
for(int i=0;i<min(k,n);i++){
if(s[i]=='1'){
if(i+1==k){
cout<<1<<endl;
return 0;
}
}else {
cout<<s[i]<<endl;
return 0;
}
}
} | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define FOR(i,n,j) for(int i=(j);i<(n);++i)
using namespace std;
using ll=long long;
using ld=long double;
typedef pair<int,int> P;
class Calc_Mod{
public:
unsigned int mod=1000000007;
ll plus_mod(ll a,ll b){
return (a+b)%mo... | 0 | 74,430,083 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n; cin >> n;
const int f = 380000;
double ans = 0;
for (int i = 0; i < n; i++) {
double x; string s; cin >> x >> s;
if (s == "JPY") {
ans+=x;
}
else {
ans+=x*f;
}
}
cout << fixed << setprecision(11) << ans << end... | #if !defined(__clang__) && defined(__GNUC__)
#include <bits/stdc++.h>
#else
#include <cstdlib>
#include <climits>
#include <iostream>
#include <cstdint>
#include <vector>
#include <string>
#include <complex>
#include <bitset>
#include <queue>
#include <deque>
#include <stack>
#include <utility>
#include <set>
#include ... | 0 | 67,059,377 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pll;
typedef pair<ll,pair<ll,ll>>plll;
#define fastread() (ios_base:: sync_with_stdio(false),cin.tie(NULL));
#define vll(v) v.begin(),v.end()
#define all(x) x.rbegin(),x.rend()
#define min3(a, b, c) m... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define REP(i,n) for(int _n=n, i=0;i<_n;++i)
#define FOR(i,a,b) for(int i=(a),_b=(b);i<=_b;++i)
#define FORD(i,a,b) for(int i=(a),_b=(b);i>=_b;--i)
#define trav(a, x) for (auto& a : x)... | 0 | 19,523,651 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <ctime>
#include <queue>
#include <map>
#include <set>
#include <tuple>
#include <functional>
#include <cassert>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);++i)
#define reps(i,n) for(int i=1;i<=(n);++i)
#define all(x) (x).begin(),(x).end()
#define int long long
#define mk_p(a,b) make_pair((a),(b))
... | 0 | 69,003,192 |
#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;
vector<int> v(n + 1, 1);
for (int i = 2; i <= n; i++) ... | #include <bits/stdc++.h>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch: s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.clear... | 0 | 68,299,352 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector <int> p(n);
for (int i=0 ; i<n ; i++){
cin >> p.at(i) ;
}
int min_dis =100000000 ;
for (int i= 1 ; i<=100 ; i++){
int sum_dis = 0;
for (int j=0 ; j<n ; j++){
sum_dis += (p.at(j)-i)*(p.at(j)-i) ;
}
min... | #include <iostream>
#include <string>
using namespace std;
int main()
{
int a, b, c, k;
cin >> a >> b >> c >> k;
while (k > 0) {
if (a >= b) {
b *= 2;
k--;
continue;
}
if (b >= c) {
c *= 2;
k--;
continue;
... | 0 | 36,491,208 |
#include <iostream>
using namespace std;
int main(){
long long x,y;
cin >> x >> y;
long long sum = 0;
for(long long i = x; i <= y; i*=2)sum++;
cout << sum <<endl;
} | #include <iostream>
using namespace std;
int main() {
while(true) {
int n, x;
cin >> n >> x;
if(n == 0 && x == 0) {
break;
}
int count = 0;
int i, ii, iii = 0;
for(i=1; i <= n; i++) {
for(ii = i + 1; (ii > i && ii <= n); ii++) {
... | 0 | 14,929,226 |
#include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef priority_queue<int> HEAP;
typedef priority_queue<int, vector<int>, greater<int> > RHEAP;
const int N = 10, M = 1010, INF = 0x3f3f3f3f;
int n, a, b, c;
int len[N]... | #pragma GCC optimize ("O3")
#include <bits/stdc++.h>
#define endl "\n"
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define prt(x) cout << (x)
#define prtl(x) cout << (x) << endl
#define rep(i,a,b) for(ll i=a; i<b; i++)
#define rrep(i,a,b) for(ll i=a; i>b; i--)
#define mp(a, ... | 0 | 46,572,645 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18) + 1;
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define y... | #include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int d[1005][1005];
int main(){
string s1,s2;
cin>>s1>>s2;
s1=' '+s1;
s2=' '+s2;
int l1=s1.size();
int l2=s2.size();
int i,j;
for( i=1;i<l1;i++)d[i][0]=i;
for( j=1;j<l2;j++)d[0][j]=j;
for( i=1;i<l1;i++){... | 0 | 96,759,069 |
#include<bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int main(){
int N,K;
scanf("%d %d",&N,&K);
if(N%K == 0){
printf("0\n");
}else{
printf("1\n");
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define P pair<ll, ll>
#define FORm(i, m) for (auto i = m.begin(); i != m.end(); i++)
#define all(v) v.begin(), v.end()
#define sortAl(v) sort(all(v))
#define sortAlr(v) \
sort(v.begin(), v.end()); \
reverse(v.begin()... | 0 | 63,922,957 |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ll;
typedef pair<int, int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
#define ff first
#define ss second
#def... | #include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
using namespace std;
int main() {
int N; cin >> N;
vector<int> W(N, 0);
for (int i = 0; i < N; ++i) cin >> W[i];
int a = 0, b = 0, i = 0, j = N - 1;
while (i <= j) {
if (a <= b) {
a += W[i], i++;
... | 0 | 62,678,517 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
string a,b,c;
int main(void){
cin>>a>>b>>c;
char A=a[0]-32,B=b[0]-32,C=c[0]-32;
cout<<A<<B<<C<<endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
c... | 0 | 76,755,753 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin >> n;
vector<int> a(n);
int mini = -1, maxi = -1;
for(int i=0; i<n; i++){
cin >> a[i];
if(a[i] > maxi || maxi == -1) maxi = a[i];
if(a[i] < mini || mini == -1) mini = a[i];
}
cout << maxi - mini << endl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#includ... | 0 | 32,231,739 |
#include <iostream>
int n = 0;
int main(void){
int a, b, c, d;
int cnt;
while(std::cin >> n){
cnt = 0;
for(a=0; a<=9; ++a) for(b=0; b<=9; ++b) for(c=0; c<=9; ++c) for(d=0; d<=9; ++d) if(a+b+c+d == n) cnt++;
std::cout << cnt << std::endl;
}
} | #include<iostream>
#include<iomanip>
#include<cstdio>
#include<string>
#include<cstring>
#include<climits>
#include<algorithm>
#include<vector>
#include<cmath>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<tuple>
#include<list>
#include<unordered_map>
#define ll long long
#define pii pair<int,int... | 0 | 87,215,120 |
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define IOS ios::sync_with_stdio(false); cin.tie(0);
#define sd(n) scanf("%d",&n)
#define sl(n) scanf("%lld",&n)
#define pd(n) printf("%d",n)
#define pl(n) printf("%lld",n)
#define sf(n) scanf("%f",&n)
#define pf(n) printf("%.12f",n)
#define psp printf(... | #include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <bitset>
using namespace std;
const long int INF = 1000000007;
bool isInclude(vector<vector<char>> a, vector<vector<char>> b, int M, int x, int y)
{
for (int i = 0; i < M; i++)
{
for (int... | 0 | 2,813,684 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a, b;
string ans = ":(";
cin >> a >> b;
if (a <= 8 && b <= 8) {
ans = "Yay!";
}
cout << ans << endl;
} | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | 0 | 17,401,446 |
#include <bits/stdc++.h>
#include <string>
using namespace std;
#define ll long long
#define For(i,a,b) for(int (i)=(a);(i) < (b); ++(i))
const int N =100;
bool isprime(int n)
{
if (n <= 1)
return false;
for (int i = 2; i*i<=n; i++)
if (n % i == 0)
return false;
return true;
}
in... | #include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
string s;
long long k, ans = 0, end = 0, cnt = 0, d = 0, f = 0;
cin >> s >> k;
long long l = s.size();
if(s[0] == s[l-1]) end = 1;
if(1<l){
for(int i=l-1;1<=i;i--){
if(s[l-1]==s[i]){
... | 0 | 28,316,656 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main(){
int H, W, K;
cin >> H >> W >> K;
string board[H], t;
for(int i=0; i<H; i++) {
for(int j=0; j<W; j++) {
cin >> board[i][j];
}
}
int ans = 0;
for(int is=... | #include <bits/stdc++.h>
#define REP(i, e) for(int (i) = 0; (i) < (e); ++(i))
#define FOR(i, b, e) for(int (i) = (b); (i) < (e); ++(i))
#define ALL(c) (c).begin(), (c).end()
#define PRINT(x) cout << (x) << "\n"
using namespace std;
using ll = long long; using pint = pair<int, int>; using pll = pair<ll, ll>;
const long ... | 0 | 45,992,539 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
double a, b, x;
cin >> a >> b >> x;
double s = x / a;
double rad;
if (s >= a * b / 2) {
double h = (a * b - s) * 2 / a;
rad = atan2(h, a);
} else {
double w = s * 2 / ... | #include <iostream>
#include <cstdio>
#define fi first
#define se second
#define mp make_pair
using namespace std;
pair <int, int> a[100005];
int d[100];
int aabs(int x){
return x >= 0 ? x : -x;
}
long long dis(pair <int, int> x, pair <int, int> y){
return 1LL * aabs(x.fi - y.fi) + aabs(x.se - y.se);
}
int main(){
i... | 0 | 3,012,699 |
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
using Grid= vector<vector<char>>;
using vin= vector<int>;
using ll=long long;
using vll= vector<ll>;
using vbl=vector<bool>;
using vch=vector<char>;
using pinin=pair<int ,int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define r... | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <vector>
#include <string>
#include <bitset>
#include <stack>
#include <queue>
#include <tuple>
#include <regex>
#include <cmath>
#include <map>
#include <set>
#include <functional>
#include <cstring>
using namespace std;
template<t... | 0 | 72,005,810 |
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#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 tr... | #include<bits/stdc++.h>
#include<string.h>
typedef long long int ll;
#define all(x) (x).begin(), (x).end()
using namespace std;
int nxt() {
int x;
cin >> x;
return x;
}
ll nxtl(){
ll x;
cin>>x;
return x;
}
void SieveOfEratosthenes(int n,vector <int> &primes)
{
bool prime[n+1];
memset(... | 0 | 82,865,082 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
const ll INF = 1LL << 60;
int main(){
int p,q,r;
cin >> p >> q >> r;
cout << min(p+q,min(q+r,r+p)) << endl;
} | #include<iostream>
#include<map>
#include<string>
using namespace std;
int main() {
map<string, int> M;
string word, fword, lword = "";
int s = 0;
while(cin >> word) {
M[word]++;
if(M[word] > s) {
s = M[word];
fword = word;
}
if(word.size() > lword.size()) lword = word;
}
cout <<... | 0 | 84,940,239 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
long long a;
cin>>s>>a;
if(s.size()==1){
cout<<s[0]<<"\n";
return 0;
}
int cnt=0;
for(int i=0;i<s.size();i++){
if(s[i]!='1') break;
cnt++;
}
if(a<=cnt)cout<<"1\n";
else cout<<s[cnt]<<"\n";
return 0;
} | #include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <vector>
#include <climits>
#include <sstream>
using namespace std;
void CountingSort(int *a, int *b, int k, int n){
int *c = new int[10001];
for(int i=0;i<=k;i++){
c[i] = 0;
}
for(int j=0;... | 0 | 9,187,004 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N , M;
cin >> N;
int goukei = 0;
int MAX = 0;
vector<string> ao(N);
for (int i = 0; i < N; i++){
cin >> ao.at(i);
}
cin >> M;
vector<string> aka(M);
for (int i = 0; i < M; i++){
cin >> aka.at(i);
}
for (int i = 0; i < N; i++)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
vector<int> K(M);
vector<vector<int>> S(M);
for(int i=0; i<M; i++)
{
cin >> K[i];
S[i].resize(K[i]);
for(int j=0; j<K... | 0 | 28,018,994 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <time.h>
#define int long long
#define ... | #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 com(int a, int b){
int m = min(a-b, b);
int ans = 1;
b = m;
rep(i, m){
ans *= a;
a--;
}
rep(i, m){
ans /= b;
b--;
}
... | 0 | 89,463,752 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
int main()
{
int n;
cin >> n;
vector<int> p(n), q(n), per(n);
rep(i, n) cin >> p[i];
rep(i, ... | #include <iostream>
#include <fstream>
#include <cassert>
#include <typeinfo>
#include <vector>
#include <stack>
#include <cmath>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <iomanip>
#include <cctype>
#include <random>
#include <complex>
#define syos... | 0 | 4,155,810 |
#include <bits/stdc++.h>
using namespace std;
#define M 1005
#define N 15
#define ll long long
int arr[N];
int main()
{
int n;
cin>>n;
int k;
cin>>k;
int cnt = 0;
for(int i = 0 ; i < n ; i++)
{
int x;
cin>>x;
if(x >= k)
cnt++;
}
cout<<cnt<<endl;
... | #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 | 1,400,214 |
#include <iostream>
using namespace std;
using ll = long long;
using ld = long double;
#define ALL(x) begin(x), end(x)
#define REP(i, n) for (size_t i = 0, i##_len = (n); i < i##_len; ++i)
void solve(string s) {
s.insert(4," ");
cout << s << endl;
}
int main() {
string s;
cin >> s;
solve(s);
return 0;
} | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
using namespace std;
using ll = long long;
int gcd(int x, int y);
const int INF = 1001001001;
int main() {
ll n, m;
cin >> n >> m;
ll ans;
if (n >= 3 && m >= 3)
ans = (n - 2) * (m - 2);
else if (n == 2 || m == 2)
... | 0 | 19,372,195 |
#include <bits/stdc++.h>
using namespace std;
string s;
int mt[1 << 26];
int main() {
fill(mt, mt + (1 << 26), 1E6);
cin >> s;
mt[0] = 0;
const int n = s.size();
vector<int> dp(n + 1);
iota(dp.begin(), dp.end(), 0);
int state = 0;
for (int i = 1; i <= n; ++i) {
const int cc = s[i - 1] - 'a';
sta... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
vector<long long> H(N);
for (long long i = 0; i < N; i++) {
cin >> H[i];
}
sort(H.begin(), H.end(), greater<long long>());
if (N - K <= 0) {
cout << 0;
return 0;
}
long l... | 0 | 80,481,695 |
#include <bits/stdc++.h>
#define MX_N 500001
#define mp make_pair
#define mod7 1000000007
#define modpi 314159
#define PI 3.141592653589793238
#define pb push_back
#define FastIO ios_base::sync_with_stdio(false);cin.tie(0);co... | #include <bits/stdc++.h>
#define debug(var) do{std::cerr << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cerr << e << std::endl;}
template<typename T> void view(const std::vector<T>& v){for(const auto& e : v){ std::cerr << e << " "; } std::cerr << std::endl;}
template<typename T> void vie... | 0 | 33,716,568 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for (ll i=0; i<n; ++i)
#define all(c) begin(c),end(c)
int main(){
ll W,H,a,ans=0; cin>>W>>H;
vector<pair<ll,ll>> V(0,{0,0});
rep(i,W) cin>>a, V.push_back({a,1LL});
rep(i,H) cin>>a, V.push_back({a,0LL});
sort(all(V));
H++, W++... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int (i) = (0); (i) < (n... | 0 | 82,928,761 |
#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 <bits/stdc++.h>
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < b; i++)
using namespace std;
int gcd(int a, int b)
{
if (a % b == 0)
{
return (b);
}
else
{
return (gcd(b, a % b));
}
}
int main()
{
int n;
ll X;
cin >> n >> X;
ll a;
n += ... | 0 | 6,406,394 |
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <iomanip>
#include <functional>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <map>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PLL;
#define rep(i,n) for (ll i = 0; ... | #include<iostream>
#include<iomanip>
#include<stack>
#include<queue>
#include<list>
#include<vector>
#include<set>
#include<map>
#include<string>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<ctime>
#define ll long long
#define db double
#define inf 200001
#define IN... | 0 | 26,629,456 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | #include<bits/stdc++.h>
#define int long long
#define fi first
#define si second
#define mp make_pair
#define ... | 0 | 81,779,025 |
#include<map>
#include<bitset>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<stack>
#define REP(i,x,y) for(ll i=x;i<=y;i++)
typedef long long ll;
using namespace std;
ll grid[505][505];
char xxx[5] = { 't','R','G','B','Y' };
struct point{
ll x; ll y;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<ll,ll> P;
#define M 1000000007
#define F first
#define S second
#define PB push_back
#define INF 1000000000000000000
ll n,m,v,p,a[100005],s;
int main(void){
scanf("%lld%lld%lld%lld",&n,&m,&v,&p);
for(int i=1;i<=n;... | 0 | 21,735,179 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MM = 1000000000;
const int MOD = MM + 7;
const int MAX = 510000;
#define rep(i, n) for(ll i=0; i<n; i++)
#define Rep(i, j, n) for(ll i=j; i<n; i++)
#define all(vec) vec.begin(), vec.end()
template<class T> inline bool chmin(T& a, T b) {if(a >... | #include<iostream>
using namespace std;
int main(){
int i,n,m,p,x[1001],total;
while(1){
total = 0;
cin >> n >> m >> p;
if(n==0 && m==0 && p==0)break;
for( i = 1; i <=1000; i++){
x[i]=0;
}
for( i = 1; i <= n; i++){
cin >> x[i];
total += x[i]*100;
}
if(x[m]>0){
... | 0 | 39,990,702 |
#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, ans=0, tmp=0;
vector<vector<ll>> A;
string S;
signed main(){
cin >> S;
A.resize(26);
for(int i=0;i<S.size();i++) {
ll abc = S[... | #include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <stack>
#include <complex>
#include <stdlib.h>
#include <stdio.h>
#include <functional>
#include <cfloat>
#include <math.h>
... | 0 | 3,649,848 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int r, d, x0;
cin >> r >> d >> x0;
vector<int> x(11);
x.at(0) = x0;
rep(i, 10) {
x.at(i + 1) = r * x.at(i) - d;
}
rep(i, 10) cout << x.at(i + 1) << endl;
} | #include <iostream>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
#include <queue>
#include <cmath>
#include <bitset>
#include <complex>
#include <functional>
#include <numeric>
#include <iomanip>
#define SPBR(w, n) std::cout... | 0 | 90,325,118 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int mod = 1e9 + 7;
const ll INF = 1e14;
void solve(){
int x, y; cin >> x >> y;
if(((4*x - y >= 0 ? 4*x - y : 1) % 2 == 0) && ((y - 2*x >= 0 ? y - 2*x : 1) % 2 == 0))
cout << "Yes";
else cout << "No";
}
int ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int a[20],n,s,h;
string v;
main()
{
a[0]=1;
for(int i=1;i<=15;i++)
a[i]=a[i-1]*10;
s=0;
for(int i=10;i>=1;i--)
{
int check = a[i]-1;
cout << "? " << check << "\n";
fflush(stdout);
cin >> v;
if(v == "N")
{
s = i+1;
break;
... | 0 | 39,942,734 |
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <deque>
int main(){
long long S;
scanf("%lld", &S);
long long x1, x2, x3, y1, y2, y3;
x1=0;
y1=0;
x... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define mod 1000000007
#define pb(i) push_back(i)
#define f first
#define s second
#define mk(l,r) make_pair(l,r)
#define all(vc) vc.begin(),vc.end()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define ms(i,j) memset(i,j,... | 0 | 22,341,677 |
#include<iostream>
#include<vector>
using namespace std;
int main(void){
int n,m,p;
while(cin >> n >> m >> p,n|m|p){
vector<int>cnt(n);
int sum = 0;
for(int i=0;i<n;i++){
cin >> cnt[i];
sum += cnt[i];
}
sum *= 100;
int ans = sum - sum * p / 100;
if(cnt[m-1]==0)cout << 0 << en... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
const int N = 200005;
const ll mod = 2000000011;
#define ld long double
#define PI 3.14159265358979323846
const int INF = 10000000;
void flash()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout.setf... | 0 | 43,805,818 |
#include<stdio.h>
#include<iostream>
#include<string>
using namespace std;
int main() {
int N = 0;
int R = 0;
int Ans = 0;
cin >> N >> R;
if (N >=10) {
Ans = R;
}
else
{
Ans = R + (100 * (10 - N));
}
cout << Ans << endl;
return 0;
} | #include <functional>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <random>
#include <bitset>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;
const ll MOD = 10000000... | 0 | 21,480,027 |
#include<bits/stdc++.h>
#define ll long long int
#define sz 200010
using namespace std;
ll num[sz];
map<ll,ll>cnt;
set<ll>st;
set<ll>::iterator it;
int main()
{
ll n,i,j,k,p,d,m,a,x,ar;
ll c=0;
cin>>n;
for(i=1; i<=n; i++)
{
cin>>num[i];
st.insert(num[i]);
cnt[num[i]]++;
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1e18
#define pb push_back
#define mk make_pair
#define fastIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
int main()
{
fastIO;
ll n;
cin>>n;
string str;
ll x,y,val,val1;
vector<string>v;
map<string,ll>m;
... | 0 | 76,805,467 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#include <numeric>
using namespace std;
int main()
{
long long a,b;
cin >> a >> b;
long long c = gcd(a,b);
cout << a * b / c;
} | #include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <deque>
#include <queue>
#include <array>
#include <set>
#include <map>
#include <cmath>
#include <complex>
#include <algorithm>
#include <numeric>
#include <utility>
#include <tuple>
#include <bitset>
#include <cstdint>
#include <casse... | 0 | 32,721,729 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
const ll LINF = 10010... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int N;
cin>>N;
vector<int>c(N-1);
vector<int>s(N-1);
vector<int>f(N-1);
rep(i,N-1){
cin>>c.at(i)>>s.at(i)>>f.at(i);
}
vector<int>a... | 0 | 49,994,129 |
#include<cstdio>
#include<cstring>
int main(void){
int i,j,n,x=0,y=0;
scanf("%d",&n);
for(i=0;i<n;i++){
char a[101],b[101];
scanf("%s%s",a,b);
for(j=0;1;j++){
if ((a[j]=='\0')&&(b[j]!='\0')){
y=y+3;
}else if ((b[j]=='\0')&&(a[j]!='\0')){
x=x+3;
}else if((a[j]=='\0')&&(b[j]=='\0')){
y++;
x++;
}el... | #include<iostream>
#include<stdio.h>
using namespace std;
int main(){
while(1){
int n, k;
cin>> n>> k;
if(n==0&&k==0) break;
int a[n];
for(int i=0; i<n; i++){
cin>> a[i];
}
int s[n+1];
fill(s, s+n+1, 0);
for(int i=0; i<n; i++){
s[i+1]=s[i]+a[i];
}
int ans=-100... | 0 | 47,817,022 |
#include <bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define clr(a,h) memset(a, (h), sizeof(a))
#define mem(a,h) memset(a, (h), sizeof(a))
#define fi first
#define se second
#define por(... | #include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
#define ALL(obj) (obj).begin(), (obj).end()
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF=(long long)1E17;
#define i_7 (long long)(1E9+7)
long mod(long a){
long lon... | 0 | 23,957,536 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long long N, A, B;
cin >> N >> A >> B;
long long ans = 0;
long long AB = A + B;
ans += (N / AB) * A;
N %= AB;
if(N < A)ans += N;
else ans += A;
if(A == 0)ans = 0;
cout << ans << endl;
} | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <stack>
#include <functional>
#include <queue>
#include <cmath>
#include <set>
#include <map>
#define rep(i,j,k) for(int i=j;i<k;i++)
#define Sort(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
... | 0 | 57,900,720 |
#include <iostream>
int main(int argc, char const *argv[]) {
while(1){
int H=0,W=0;
std::cin >> H >> W;
if((H==0)&&(W==0))break;
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
if(i==0 || i==(H-1)){
std::cout << "#";
}else if(j==0 || j==(W-1)){
std::cout << "#";
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
const double pi = 3.141592653589793238462643383279;
const int INF = 1000000000;
const ll LINF = 100000000000000000;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
const string abc = "abcdefghijkl... | 0 | 14,050,224 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Pl = pair<ll,ll>;
#define REP(i,n) for(ll i = 0;i < (ll)n;i++)
#define REPD(i,n) for(ll i = (ll)n - 1;i >= 0;i--)
#define ALL(x) (x).begin(),(x).end()
#define FILLl(n,first_dimension_size,value) fill((ll*)n,(ll*)(n+first_d... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int H, W;
bool seen[10000][10000];
char S[10000][10000];
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
vector<pair<ll, ll>> prime_factorize(ll n) {
vector<pair<ll, ll>> res;
for (ll i = 2; i * i <= n; i++)
{
if (n % i !... | 0 | 44,569,232 |
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
using namespace std;
#define N (1000000000+7)
#define INF 1e16
typedef long long ll;
typedef pair<ll,ll> P;
int main(void){
ll ... | #include<bits/stdc++.h>
using namespace std;
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void ... | 0 | 48,082,765 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#define ll long long int
using namespace std;
ll n,k,x,y;
int main()
{
ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
cin>> n ... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i,n) for(int i = 0; i < ((int)(n)); i++)
int main() {
int H, W, D; cin >> H >> W >> D;
map<int, pair<int,int>> M;
int x = 1, y = 1;
rep(i, H*W) {
int j; cin >> j;
M[j] = make_pair(x,y);
if (++x > W) ... | 0 | 13,583,891 |
#include<stdio.h>
int A[2000000];
int B[2000000];
void Counting_Sort(int k){
int i,j;
int C[10001];
for(i=0;i<10001;i++)C[i]=0;
for(j=0;j<k;j++)C[A[j]]++;
for(i=1;i<10001;i++)C[i]+=C[i-1];
for(j=k-1;j>=0;j--){
C[A[j]]--;
B[C[A[j]]]=A[j];
}
}
int main(){
int n,i;
scanf("%d",&n);
for(i=0;i<n... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n,t1=0,h1=0;
std::string t,h;
std::cin>>n;
while(n--){
std::cin>>t>>h;
if(t<h){
h1+=3;
}else if(t>h){
t1+=3;
}else{
h1++;
t1++;
}
}
std::cout<<t1<<" "<<h1<<"\n";
} | 0 | 90,151,899 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
ll cnt[1000010];
int main() {
ll a, b, c, d; cin >> a >> b >> c >> d;
cout << max({a * c, a * d, b * c, b * d}) << endl;
} | #include <stdio.h>
int main(){
int stay,i,a,cou;
char m1[3],m2[3];
while(1){
scanf("%d",&a);
if(a==0)break;
stay=0;
cou=0;
for(i=0;i<a/2;i++){
scanf("%s %s",m1,m2);
if(stay==0&&m1[1]=='u'&&m2[1]=='u'){
cou++;
stay=1;
}else if(stay==1&&m1[1]=='d'&&m2[1]=='d'){
cou++;
stay=... | 0 | 98,764,893 |
#include<functional>
#include<algorithm>
#include<iostream>
#include<iomanip>
#include<string>
#include<math.h>
#include<vector>
#include<cmath>
#include<stack>
#include<queue>
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,x,n) for(int i=x;i<n;i++)
using namespace std;
const int INF=100000000;
char a[20][20];
in... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
using ll = long long int;
ll mygcd(ll a, ll b){
if(a < b){
ll tmp = a;
a = b;
b = tmp;
}
while(b > 0){
int r = a % b;
a = b;
b = r;
}
return a;
}
int main... | 0 | 60,890,285 |
#include <iostream>
#include <vector>
#define rep(i,n) for(int i=0; i<n;i++)
using namespace std;
int main()
{
int n;
long long money=1000,chicket=0;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
rep(i,n-1){
money+=chicket*a[i];
chicket=0;
if(a[i]<a[i+1]){
chicket=money/a[i];
mon... | #include <bits/stdc++.h>
using namespace std;
int main(void){
while(true){
string s;
getline(cin,s);
if(s[0]=='.') break;
stack<char> st;
bool err = false;
for(int i = 0; i < s.size(); ++i){
if(s[i] == '(' || s[i] == '['){
st.push(s[i]);
}else if(s[i] == ')' || s[i] == ']'){
if(st.empty() |... | 0 | 35,850,307 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<map>
#include<cmath>
#include<iomanip>
#include<set>
#include<string>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, st, n) for (int i = st; i < n; ++i)
using pii = pair<int, int>;
... | #include <bits/stdc++.h>
using namespace std;
string S;
string t[4] = {"maerd",
"remaerd",
"esare",
"resare"};
int main()
{
cin >> S;
string s;
for (int i = S.size()-1; i >=0; i--)
{
s += S[i];
for (int j = 0; j < 4; j++)
{
... | 0 | 48,165,451 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, l;
string ss[110];
cin >> n >> l;
for (int i = 0; i < n; i++) {
cin >> ss[i];
}
sort(ss, ss + n);
for (int i = 0; i < n; i++) {
cout << ss[i];
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define FOR(i,a,n) for(int i=(a), i##_len=(n); i<i##_len; ++i)
#define REP(i,n) FOR(i,0,n)
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, co... | 0 | 46,105,417 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
const int mx=1e6+11;
const double PI = acos(-1);
#define MOD 1000000007
#define nl '\n'
#define pb push_back
#define F first
#de... | #include "bits/stdc++.h"
using namespace std;
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define li long int
#define ld long double
#define lld long long double
#define pb push_back
#define mk make_pair
#define F first
#define S second
#define all(v) (v).begin(),(v).end()
... | 0 | 21,027,685 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = (int)a; i <= (int)b; i++)
int n, arr[100050], l, q, a, b, p[100050][20];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
FOR(i, 1, n) cin >> arr[i];
cin >> l >> q;
FOR(i, 1, n-1) p[i][0] = upper_bound(arr+1, arr+n+... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define mod2 998244353
const double pi = acos(-1);
#define inf (1ll<<61)-1
#define ll long long
#define ld long double
#define floop(i,a,n) for(ll i=a;i<n;i++)
#define loopf(i,a,n) for(ll i=n-1;i>=a;i--)
#define space " "
#define TEST(t) ll t; cin>>t... | 0 | 45,480,639 |
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <string>
#include <set>
#include <bitset>
#include <unordered_map>
#include <cmath>
#include <functional>
#include <map>
#include <cstdlib>
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using... | #include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<deque>
#include<cmath>
#include<map>
#include<cstring>
#include<iomanip>
using namespace std;
typedef long long ll;
const int INF = 1e9 + 6;
const ll MOD = 1e9 + 7;
const ll LLINF = 1LL<<60;
#define P pair<int, int>
#define rep(i, n) for ... | 0 | 41,597,677 |
#include "bits/stdc++.h"
using namespace std;
template <typename T>
void printv(const vector<T> &v) {
int sz = v.size();
for (int i = 0; i < sz; i++) {
cout << v[i] << " \n"[i == sz - 1];
}
}
using Graph = vector<vector<int>>;
const int MAX_N = 100010;
Graph g(MAX_N);
int dfs(int cur, int pre) {
if ((int)g[... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using edge = pair<int, ll>;
using graph = vector<vector<int>>;
using WeightedGraph = vector<vector<edge>>;
const ll INF = 1LL << 60;
const int INF32 = 1 << 29;
const ll MOD = 1000000007;
int n;
vecto... | 0 | 29,035,746 |
#include <bits/stdc++.h>
#include <algorithm>
#include <functional>
#include <map>
#include <queue>
#include <set>
#include <stack>
using namespace std;
#define rep(i, m, n) for (int(i) = (int)(m); i < (int)(n); ++i)
#define rep2(i, m, n) for (int(i) = (int)(n)-1; i >= (int)(m); --i)
#define REP(i, n) rep(i, 0, n)
#def... | #include <bits/stdc++.h>
using namespace std;
int main () {
int n;
cin >> n;
vector<pair<int, int>> a_i(n);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
a_i.at(i) = make_pair(i + 1, a);
}
sort(a_i.begin(), a_i.end(), [](const auto &x, const auto &y) {
return x.s... | 0 | 19,816,727 |
#include <bits/stdc++.h>
#define N 100005
typedef long long ll;
using namespace std;
int main()
{
int n,a,b;scanf("%d%d%d",&n,&a,&b);
if((a-b)&1)puts("Borys");
else puts("Alice");
return 0;
} | #pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld double
#define rep(i,a,b) for(ll i=a; i<b; ++i)
#define BOOST std::ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define all(v) v.begin(),v.end()
#define sl(a) a.size()
#define mo... | 0 | 70,942,363 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int n,m;
int main()
{
cin >>n>>m;
if(n%2==1){
for(int i=1;i<=m;i++){
cout<<i<<" "<<n+1-i<<endl;
}
}
else{
for(int i=1;i<=m&&i<=n/4;i++){
cout<<i<<" "<<n+1-i<<endl;
}
if(m>n/4) {
for(int i=n/4+1;i<=m;i++... | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
using bint = boost::multiprecision::cpp_int;
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i,n) for (int i = 0; i < (n); i++)
#define repSE(i,s,n) for (int i = (s); i < (n); i++)
#define ... | 0 | 40,309,920 |
#include <iostream>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;
vector<int> count[200100];
int ans[200100];
vector<bool> seen;
void dfs(const Graph &G, int v, int p) {
seen[v] = true;
if (p != -1) ans[v] = ans[p];
for (auto a : count[v]){
ans[v] += a;
}
for (auto next_v ... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
vector<pair<int64_t,int64_t>>prime_factorize(int64_... | 0 | 86,223,892 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
int cnt = 0;
for(int i = 1; i <= n; i++){
string s = to_string(i);
if(s.size()%2 != 0) cnt++;
}
cout << cnt << endl;
} | #include <iostream>
using namespace std;
int main(){
int j,k;
cin>>j>>k;
if (j*k==15) cout<<'*'<<endl;
else if (j+k==15) cout<<'+'<<endl;
else cout<<'x'<<endl;
return 0;
} | 0 | 93,041,489 |
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define emplace_back push_back
#define pb push_back
using namespace std;
typedef long long ll;
typedef unsigned long long ... | #include <iostream>
using namespace std;
int main(){
int h,w,i;
refrain:
cin>>h;
cin>>w;
if(h==0&&w==0) return 0;
for(i=0;i<w;i++){
cout<<"#";
}
cout<<endl;
for(i=2;i<h;i++){
cout<<"#";
for(int j=2;j<w;j++){
cout<<".";
}
cout<<"#"<<endl;
}
for(i=0;i<w;i++){
cout<<"#";
}
cout<<endl;
cout<<en... | 0 | 67,408,688 |
#include <cstdio>
int main(){
int N,p,g,a[9]={};
int i,o;
char v,prev;
scanf("%d",&N);
for(i=1;i<=N+1;i++){
p=0;
while(1){
p++;
scanf("%c",&v);
if(v=='\n') break;
if(v=='1') a[0]++;
if(v=='2') a[1]++;
if(v=='3') a[2]++;
if(v=='4') a[3]++;
if(v=='5') a[4]... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair < int , int >;
using i3 = pair < int , ii >;
using li = pair < ll , int >;
using lii = pair < ll , ii >;
using pll = pair < ll , ll >;
using vi = vector < int >;
using vl = vector < ll >;
using ... | 0 | 94,561,774 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n-1; i >= 0; i--)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
const int mod = 1e9+7;
const int INF = 1e9;
const int MAX = 1e6;
int m... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> asum(n+1);
rep(i, n) {
cin >> a[i];
if ( i == 0 ) asum[0] = abs(a[i]);
else asum[i] = asum[i-... | 0 | 80,445,938 |
#include <iostream>
#include <cstring>
#include <queue>
using namespace std;
int main(){
priority_queue<int> priorityqueue;
char loader[8];
int loadnum;
while (1){
cin >> loader;
if (strcmp(loader, "insert") == 0){
cin >> loadnum;
priorityqueue.push(loadnum);
}
if (strcmp(loader, "extract") == 0){
... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define REP(i,n) for(int _n=n, i=0;i<_n;++i)
#define FOR(i,a,b) for(int i=(a),_b=(b);i<=_b;++i)
#define FORD(i,a,b) for(int i=(a),_b=(b);i>=_b;--i)
#define trav(a, x) for (auto& a : x)... | 0 | 83,827,331 |
#include <bits/stdc++.h>
using namespace std;
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
#define pb push_back
#define mp make_pair
#define cotu cout
#define itn int
#define Red ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define F first
... | #include <bits/stdc++.h>
#define rep(i,n)for(long long i=0;i<(long long)(n);++i)
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T&... | 0 | 84,182,041 |
#include <bits/stdc++.h>
using namespace std;
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++){
if((i*(m-j)+(n-i)*j)==k){
ans="Yes";
break;
}
}
if(ans=="Yes") break;
... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
string s, t;
int main() {
cin >> s >> t;
bool flg = true;
vect... | 0 | 13,172,664 |
#include<iostream>
using namespace std;
int t[]={500,100,50,10,5,1};
int main(){
while(1){
int n,ans=0;
cin>>n;
if(n==0)break;
n=1000-n;
for(int i=0;i<6;i++)ans+=n/t[i],n%=t[i];
cout<<ans<<endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
int p;
cin >> p;
long ans = p;
for (int i = 0; i < n - 2; i++)
{
int b;
cin >> b;
ans += min(b, p);
p = b;
}
ans += p;
cout << ans << endl;
return 0;
} | 0 | 41,347,456 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll=long long;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define MOD 1000000007
const ll INF... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define per(i, n) for (int i = (int)(n-1); i >= 0; i--)
#define sz(x) int(x.size())
#define all(x) (x).begin(), (x).end()
#define INF 2e9
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, m; cin >> n... | 0 | 73,529,599 |
#include<bits/stdc++.h>
using namespace std;
#define nl cout<<"\n";
#define su ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int main()
{
su;
int n;
cin>>n;
cout<<(n+1)*n/2;
nl;
return 0;
} | #include<bits/stdc++.h>
#define FRU freopen("out.txt","w",stdout)
#define FRO freopen("in.txt","r",stdin)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define mem(ara,n) memset(ara,n,sizeof ara)
#define loop(i,j,n) for(i=j;i<n;i++)
#define rloop(i,j,n) for(i=n;i>=j;i--)
#define INF 21474... | 0 | 15,346,188 |
#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+1;i++)
#define sort(A) sort(A.begin(),A.end())
#define reverse(A) reverse(A.begin(),A.end())
typedef long long ll;
typedef pair<int,int> P;
int main(){
int a,b,c;
cin >> a >> b >> c;
if(a+b >= c) ... | #include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<un... | 0 | 15,118,234 |
#include <iostream>
using namespace std;
int main() {
int a[100],n;
cin>>n;
for(int i=0; i<n; i++){
cin>>a[i];
}
int sw = 0;
for(int i=0; i<n ; i++){
int minj = i;
for(int j=i; j<n; j++){
if(a[minj]>a[j]){
minj = j;
}
}
if(i != minj){
swap(a[i],a[minj]);
sw++;
}
}
for(int i=0; i<n ; ... | #include <bits/stdc++.h>
const char nl = '\n';
using namespace std;
using ll = long long;
using ld = long double;
const int N = 1e5+10;
ll n, m, v, p;
int a[N];
bool check(int x) {
ll score = a[x] + m;
ll rem = 1LL * (v-1) * m;
int k = 0;
for (int i = 0; i < n; i++) {
if (i == x) continue;
if (a[i] > s... | 0 | 67,351,042 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define INF 1000000007
#define llINF 1000000000000000007
#define v(i) vector<i>
#define vv(i) vector<vector<i>>
int keta(ll n){int ans=0;while(n>0){n /= 10; ans++;}return ans;}
ll _pow(ll a,ll b){ll ans ... | #include<bits/stdc++.h>
using namespace std;
int main(){
vector<int>a(4);
char c;
for(int i=0;i<4;i++){
cin >> c;
a.at(i)=c-'0';
}
for(int i=0;i<(1<<3);i++){
bitset<3>n=i;
int k=a.at(0);
for(int j=0;j<3;j++){
if(n.test(j))
k+=a.at(j+1);
else
k-=a.at(j+1);
}
... | 0 | 15,804,721 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, k;
string s;
int solve(int i, int cnt, int upper, bool limit) {
if (cnt == 0) return 1;
if (i == n) return 0;
if (limit) {
int res = 0;
if (upper != 0) {
res += solve(i + 1, cnt - 1, s[i + 1] - '0', true);... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)n;i++)
using Graph = vector<vector<int> >;
using GraphC = vector<vector<char> >;
typedef pair<int, int> P;
int N, M;
map<string, int> score;
int main() {
cin >> N;
rep(i, N) {
string tmp;
cin >> tmp;
score[tmp] ++;
}
cin >> M;
... | 0 | 3,519,550 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.