code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cassert>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
using namespace std;
typedef long long i64;
const int inf = (int)1.05e9;
const char* colors = "RGBY";
int main()
{
int h, w, ... | #include <bits/stdc++.h>
using namespace std;
#define sswap(x, y) { x+=y; y=x-y; x-=y; }
#define LSOne(S) ((S) & (-S))
#define EPS 1e-6
#define MOD 1000000007
#define fi first
#define se second
#define pb push_back
#define ende '\n'
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define ... | 0 | 91,662,984 |
#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <iomanip>
#include <stdlib.h>
#include <string.h>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <stdio.h>
#include... | #include<cstdio>
#include<iostream>
#include<queue>
using namespace std;
typedef struct{
int x;
int y;
}P;
char graph[1000][1000];
P aim[10];
P s,g;
int N,W,H;
int vis[1000][1000];
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
int bfs(P s,P g);
int main(){
int i,j,t,step=0;
cin>>H>>W>>N;
for(i=0;i<H;i++)
for(... | 0 | 30,463,673 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/agc023_a.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, M;
cin >> N >> M;
vector<vector<char> > A(N, vector<char>(N));
vector<vector<char> > B(M, vector<char>(M));
for(int i = 0; i < N; i++) {
... | 0 | 12,439,839 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define ALL(c) (c).begin(),... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef vector<int> Vi;
#define FOR(i, s, x) for (int i = s; i < (int)(x); i++)
#define REP(i, x) FOR(i, 0, x)
#define ALL(c) c.begin(), c.end()
#define DUMP(x) cerr << #x << " = " << (x) << endl
... | 0 | 99,340,018 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int x, n;
cin >> x >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
if (n == 0) {
cout << x << endl;
} else {
sort(p.begin(), p.end()... | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(int argc, char *argv[])
{
for(;;) {
int n;
cin >> n;
if(n==0) break;
vector<int> vs;
for(int i = 0; i < n; i++) {
int k;
... | 0 | 18,153,547 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vl vector<ll>
#define vi vector<int>
#define pi pair<int,int>
#define pl pair<ll,ll>
#define all(a) a.begin(),a.end()
#define mem(a,x) memset(a,x,sizeof(a))
#define pb push_back
#defi... | #include<bits/stdc++.h>
using namespace std;
int main(){
int h, w;
cin >> h >> w;
vector<vector<int>> campas(h, vector<int>(w));
for (int i=0; i<h; i++){
string s;
cin >> s;
for (int j=0; j<w; j++){
if (s[j] == '#') campas[i][j] = 1;
else campas[i][j] = 0;... | 0 | 9,300,693 |
#include<bits/stdc++.h>
using namespace std;
int f(int n,int k){
if(k>n) return 0;
if(k==0) return 1;
if(k==1) return n;
if(k==2) return n*(n-1)/2;
if(k==3) return n*(n-1)*(n-2)/6;
}
int tenth(int k){
int ret = 1;
for(int i=0; i<k; i++) ret*=9;
return ret;
}
int main(){
string s;
int k;
cin>>s>>k;
vector<i... | #include <iostream>
#include <string>
using namespace std;
int main() {
string N;
cin >> N;
long long sum = 0;
for (char n : N) {
sum += static_cast<long long>(n - '0');
}
if (sum % 9 == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | 0 | 22,648,142 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[])
{
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
long long a[20] = {0};
for (int i = 0; i < N; i++) {
cin >> a[i];
}
const long long INF = 0xfffffffffffff;
long long min_cost = I... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (in... | 0 | 31,879,054 |
#include<bits/stdc++.h>
#define ll long long int
#define vll vector<ll>
using namespace std;
int main(){
ios_base::sync_with_stdio(true);
cin.tie(NULL);
ll x;
cin >> x;
double y;
cin >> y;
ll y1 = 100*y + 0.5;
x *= y1;
x = x/100;
cout << x << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main()
{
cin.tie(0); cout.tie(0); ios::sync_with_stdio(0);
char C; cin >> C;
switch (C)
{
case 'A':
cout << "T\n";
break;
case 'T':
cout << "A\n";
break;
case 'G':
cout <... | 0 | 51,835,852 |
#include "bits/stdc++.h"
using namespace std;
const int MAX = 700000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD /... | #include<iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
int LCS(string p, string q) {
vector<vector<int> > f(p.size()+1, vector<int>(q.size()+1,0));
int t;
for (int i = 1; i <= p.size(); i++) {
for (int j = 1; j <= q.size(); j++) {
if (p[i-1] == q[j-1])
f[i][j] = f[i - ... | 0 | 59,723,061 |
#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<double> x(n);
vector<string> u(n);
rep(i, n) cin >> x[i... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <random>
#include <ctime>
#include <sstream>
#include <numeric>
using namespace std;
int main(){
int a,b,k ;
cin >> a >> b >> k ;
bool nowa = true ;
for (size_t i = 0; i < k; i++)
{
if (now... | 0 | 31,530,152 |
#include <iostream>
#include <algorithm>
int main(int argc, char const *argv[])
{
int N,K,X,Y;
std::cin >> N >> K >> X >> Y;
int fee = -1;
if(N >= K){
fee = K * X + (N - K) * Y;
} else{
fee = N * X;
}
std::cout << fee << '\n';
return 0;
} | #include<iostream>
#include<string>
#include<queue>
#include<algorithm>
#include<cmath>
#include<iomanip>
using namespace std;
int main()
{
long long N; cin >> N;
vector<long long> fac(N+1);
for(int i=1; i<=N; ++i)
{
for(int k=1; k*i<=N; ++k)
{
++fac[k*i];
}
}
... | 0 | 56,445,861 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1000000007;
const double PI=3.14159265358979;
const ll INF= pow(10,18);
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i,0,n)
string abc="abcdefghijklmnopqrst... | #include <iostream>
#include <string>
#include <cstdlib>
using namespace std;
#define N 200000000
#define INF 200000001
int size;
int h[N];
void swap(int *a, int* b) {
int tmp = *a;
*a = *b;
*b = tmp;
}
void maxHeapify(int i) {
int l = 2*i;
int r = 2*i+1;
int valM;
if ( l <= size && h[l] > h[i] ) valM = l... | 0 | 33,530,757 |
#include <bits/stdc++.h>
using namespace std;
template<class Func, class Callback, class T>
void recurse(int from, int to, Func f, Callback cb,
int& i, T& p, T q) {
if (p == q) return;
if (from == to) {
cb(i, to, p);
i = to; p = q;
} else {
int mid = (from + to) / 2;
recurse(from, mid, f, cb, i,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl1;
typedef vector<vl1> vl2;
int main()
{ ll i, j, k, n, kn, val, tmp, suma, maxa;
cin>>n;
vl2 veka(n+1, vl1(4)), dp(n+1, vl1(4));
for(i=1;i<=n;i++) cin>>veka[i][1]>>veka[i][2]>>veka[i][3];
veka[0][1]=0; veka[0][2]=0; veka[0... | 0 | 13,897,977 |
#include <bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
using namespace std;
int main(){
int n,m;
string s;
while(cin>>n,n){
char a[n][3],d;
r(i,n){cin>>a[i][0]>>a[i][1];}
cin>>m;
char s[m];
r(i,m)cin>>s[i];
r(i,m){r(j,n)if(s[i]==a[j][0]){s[i]=a[j][1];break;}}
r(i,m)cout<<s[i];
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<pii> vpii;
typedef vector<pair<ll,ll> > vpll;
const int MOD=1e9+7;
const int MAX=1e5+5;
const double PI= acos(-1.0);
const long double EPS=1e-10;
const int64_t INF=1e18+10;
#define fasti... | 0 | 46,562,716 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0; i<(n); i++)
#define REP2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int main()
{
int N, K, sum=0;
ci... | #include<iostream>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int a[n];
for(int i=0; i<n; i++) cin >> a[i];
int curr = 0; int mx = 0; int i=0;
while(i<n-1){
if(a[i]>=a[i+1]){
curr++;
mx = max(mx,curr);
}
else{
curr=0;
}
i++;
}
cout << mx;
return ... | 0 | 42,737,451 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pll = pair<ll, ll>;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define rrep(i, m, n) for(ll i = m; i > n; i--)
#define Rep(i, m, n) for(ll i = m; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define lmax(x, y) max<ll>(x, y)
#define lmin(x... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A,B,C;
cin >> A >> B >> C;
if(A==B && B!=C)
cout << C;
else if(B==C && C!=A)
cout << A;
else
cout << B;
cout << endl;
} | 0 | 22,637,148 |
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MAX=2001000;
int main(){
ll N;
cin>>N;
vector<int>A(N);
for(ll i=0;i<N;i++)cin>>A[i];
vector<int>M(MAX,0);
for(auto a:A){
if(M[a]!=0){
M[a]=2;continue;
}
for(ll i=a;i<=MAX;i+=a)M[i]++;
}
ll ans=0;
for(auto a:A)... | #define inf 9223372036854775807
#define ll long long
#define pii pair<ll,ll>
#define m_p make_pair
#define ull unsigned long long
#define spd ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#include <bits/stdc++.h>
using namespace std;
int main()
{
ll h,w,m,i,hi,wi,r,c,mxr=0,ans=0,mxc=0;
cin>>h>>w>>m... | 0 | 15,787,755 |
#include<bits/stdc++.h>
using namespace std;
vector<pair<int,int> > v[1<<18];
int a[1<<18],tmp;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin>>n;
int m=(1<<n);
for(int i=0;i<m;i++)
cin>>a[i];
for(int i=0;i<m;i++){
v[i].push_back(make_pair(0,-1));
v[i].push_back(make_pair(a[i],i));
if(i... | #include <bits/stdc++.h>
using namespace std;
int main(){
int i, j, k;
int N, X[1000], Y[1000], S[1000];
cin >> N;
for(i=0; i<N; i++){
cin >> X[i] >> Y[i];
S[i] = X[i] + Y[i];
if((S[i] - S[0]) % 2 != 0){
cout << -1 << endl;
... | 0 | 4,364,341 |
#include <algorithm>
#include <iostream>
#include <string>
#include <random>
#include <cassert>
#include <cstring>
#include <chrono>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
ii ma[1 << 18];
void Update(ii& a, int x) {
if (x > a.first) {
a.second = a.first... | #include <iostream>
#include <utility>
#include <vector>
#include <algorithm>
#include <stdio.h>
using namespace std;
int main(void){
long long int N,M;
while(1){
scanf("%lld %lld",&N,&M);
if(N==0&&M==0)break;
else{
vector<pair<long long int,long long int> > buri;
... | 0 | 73,927,755 |
#include <stdlib.h>
#include <cmath>
#include <cstdio>
#include <cstdint>
#include <string>
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
using namespace std;
using ll = long long;
int main(){
int x1,x2,y1,y2;
cin >> x1 >> y1 >> x2 >> y2;
int vect_x=x2-x1;
int vect... | #include <bits/stdc++.h>
using Int = int64_t;
using UInt = uint64_t;
using C = std::complex<double>;
#define rep(i, n) for(Int i = 0; i < (Int)(n); ++i)
#define guard(x) if( not (x) ) continue;
#ifndef LOCAL_
#define fprintf if( false ) fprintf
#endif
struct DisjointSet {
DisjointSet(Int n)
: ps(n, -1), ns(n, ... | 0 | 42,009,982 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
int all = 0;
for (int i=1; i<=N; i++) all = all + i;
cout<<all<<endl;
} | #include <bits/stdc++.h>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
int dx[4] = {1, 0, 0, -1};
int dy[4] = {0, 1, -1, 0};
int main()
{
int h, w;
cin >> h >> w;
vector<s... | 0 | 47,889,257 |
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n;
string s;
cin >> s;
cin >> k;
rep(i, s.size()) {
if (s.at(i) != s.at(k - 1)) s.at(i) = '*';
}
cout << s << endl;
return ... | #include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(... | 0 | 67,424,454 |
#include <bits/stdc++.h>
using namespace std;
using ll =long long;
typedef pair<int,int> P;
#define SORT(a) sort((a).begin(),(a).end())
#define rSORT(a) reverse((a).begin(),(a).end())
#define For(i, a, b) for(int i = (a) ; i < (b) ; ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (... | #include<bits/stdc++.h>
#define REP(i,n) for(long long i=0;i<n;++i)
#define FOR(i,a,b) for(long long i=a;i<b;++i)
using namespace std;
int n;
long long d[100][100];
const long long INF=1LL<<32;
void floyd(){
REP(k,n){
REP(i,n){
if(d[i][k]==INF)continue;
REP(j,n){
if(d... | 0 | 82,112,810 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin()... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double lld;
ll MOD = (1e9)+7;
const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1};
const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1};
const int kx[] = {+1, +2, -1, -2, +1, +2, -1, -2};
const int ky[] = {+2, +1, +2, +1, -2, -1, -2, -1};
in... | 0 | 16,620,386 |
#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... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int mod=1000000007;
#define pb push_back
#define FOR(i,n) for(int i=0;i<(n);i++)
#define FORA(i,a,b) for(int i=(a);i<=(b);i++)
#define FORD(i,a,b) for(int i=(a);i>=(b);i--)
#define FAST ios_base::sync_with_stdio(false);cin... | 0 | 14,744,234 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <queue>
#include <stack>
#include <cstdlib>
#include <map>
#include <iomanip>
#include <set>
#include <stdio.h>
#include <ctype.h>
#include <random>
#include <string.h>
#include <cmath>
#include <unordered_map>
#inc... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
int main() {
int N;
cin >> N;
double balance;
for (int i=0; i<N; i++){
double x;
string u;
... | 0 | 35,027,716 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define MOD 1000000007
int main(void) {
string S;
cin >> S;
S[5] = ' ';
S[13] = ' ';
cout << S << endl;
return 0;
} | #include <bits/stdc++.h>
#define mset(a, b) memset(a, b, sizeof(a))
#define mcpy(a, b) memcpy(a, b, sizeof(a))
#define rg register
using namespace std;
typedef long long LL;
const int MAXN = 200005;
const int MAXS = (1 << 26) + 5;
template <typename T> inline void read(T &AKNOI) {
T x = 0, flag = 1;
char ch = g... | 0 | 90,042,110 |
#include<iostream>
using namespace std;
int main()
{
int a,b,x;
cin>>a>>b;
x=a+b;
if(x%2==1)
cout<<x/2+1;
else
cout<<x/2;
} | #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);
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 yes c... | 0 | 76,262,372 |
#include<bits/stdc++.h>
using namespace std;
#define pi acos(-1.0)
#define Fast_Input ios_base :: sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL);
#define pb push_back
#define mem(a, b) memset(a, b, sizeof(a))
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds... | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long int A,B,K,t;
cin >> A >> B >> K;
t = A;
if(K >= A){
A = 0;
K -= t;
}
else{
A-= K;
K -= t;
}
if(K > 0){
B -= K;
if(B < 0) B = 0;
}
cout << A << " " << ... | 0 | 4,084,652 |
#include<bits/stdc++.h>
#define ls ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long
#define __ <<" "<<
#define loop(m,n) for(m=0;m<n;m++)
#define case(z) "Case " << z++ << ": "
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define quit return 0
using namespace std;
void ... | #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 d[1010][1010];
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int main(){
int H,W;
cin>>H>>W;
char maze[H][W];... | 0 | 22,030,713 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P>IP;
typedef vector<ll> V;
typedef vector<V> V2;
typedef vector<vector<P> > G;
void g_dir(G &graph, ll a, ll b, ll w = 1){graph[a].push_back(P(b, w));}
void g_undir(G &graph, ll a, ll b, ll w = 1){g_dir(graph, ... | #include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;... | 0 | 92,003,960 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <string>
#include <vector>
#include <utility>
#include <complex>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x... | 0 | 42,428,587 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <map>
#include <iostream>
#include <utility>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <unordered_set>
#include <unordered_map>... | #include<bits/stdc++.h>
using namespace std;
typedef long long llint;
typedef long double ld;
typedef pair<int,int> P;
#define inf 1e18
#define mod 1000000007
#define sort(v) sort(v.begin(),v.end())
#define reverse(v) reverse(v.begin(),v.end())
#define rep(i,a,n) for(int i=a;i<n;i++)
priority_queue<llint,vector<llint>,... | 0 | 19,875,225 |
#include <bits/stdc++.h>
#define SIZE 300005
#define MOD 1000000007LL
#define EPS 1e-10
#define INF 1 << 29
#define LLINF 1LL << 60
#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define DOWN(i,b,a) for(int i=b;i>=a;i--)
#define SET(a,c) memset(a,c,sizeof a)
#define BIT(i,j) ((i)>>(j))&1... | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define _ << ' ' <<
using namespace std;
using ll = long long;
ll df(ll a, ll b)
{
if (b < 0) a = -a, b = -b;
return a / b - (a % b < 0);
}
ll dc(ll a, ll b)
{
if (b < 0) a = -a, b = -b;
return a / b + (a % b > 0);
}
int main()
{
ll w, h;
... | 0 | 84,195,724 |
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<queue>
#include<deque>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define REP(i,m,n) for(int i=(int)m ; i < (int) n ; i++ )
#define rep(i,n) REP(i,0,n)
typedef long long ll;
typede... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (long long)(1e9+7)
#define INF (1LL<<60)
#define rep(i,n) for(ll i = 0; i < (n); i++)
#define rep1(i,n) for(ll i = 1; i <= (n); i++)
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return fa... | 0 | 12,014,428 |
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <set>
using namespace std;
#define INF (1ll<<60)
int main(int argc, char const *argv[]) {
int n;cin>>n;
vect... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5;
ll x[N], nx[N];
int w[N];
int main() {
ios::sync_with_stdio(false), cin.tie(0);
ll n, l, t; cin >> n >> l >> t;
for(int i = 0; i < n; i++) {
cin >> x[i] >> w[i];
if(w[0] == 2) x[i] = l - 1 - x[i];
if(w[0] == w[i]) nx... | 0 | 91,155,021 |
#include <bits/stdc++.h>
#include <string>
#include <algorithm>
#include <string.h>
#include <ctype.h>
#include <math.h>
#include <float.h>
#include <iomanip>
#include <iostream>
using namespace std;
int gcd(int x,int y){
if(y==0)return x;
return gcd(y,x%y);
}
int lcm(int x,int y){
return x*y/gcd(x,y);
}
in... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using Map = map<string,ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
ll INF=1LL<<60;
ll MOD=1000000007;
ll N;
int main(){
ll A;
cin >> A;
ll B;
cin >> B;
vector<ll> Acount(50,0LL);
vector<ll> ... | 0 | 48,930,648 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<bool> vb;
template <typename T, typename U> std::istream&operator>>(st... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int t; cin>>t; while(t--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a, b... | 0 | 82,811,611 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, n) FOR(i, 0, n - 1)
using namespace std;
typedef long long ll;
template <class T> inline bool dpmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool dpmax(T &a, T b) {
if ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(A) A.begin(),A.end()
int main()
{
int N;
cin >> N;
vector<int> A(N);
for(int i=0;i<N;i++)
{
cin >> A.at(i);
}
int counter = 0;
for(int i=0;i<N;i++)
{
int j=A.at(i);
if(A.at(j-1)==i... | 0 | 26,586,645 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
const int INF = 100010001;
const ll LINF ... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using Map = map<ll,vl>;
using vvl = vector<vector<ll>>;
ll INF=1LL<<60;
ll MOD=1000000007;
int main(){
ll N;
cin >> N;
ll K;
cin >> K;
vector<ll> A(N+1,0);
for(ll i=0;i<N;i++){
... | 0 | 51,995,727 |
#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<... | #include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <stdint.h>
#include <queue>
#include <bitset>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
#define PI (3.14159265358979323846)
#define INF (2147483647)
#define INF_LL (9223372036854775807)
#d... | 0 | 70,518,025 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int h, w;
cin >> h >> w;
vector<string> mp(h);
int c = 0;
vector<pair<int, int>> v;
for (int i = 0; i < h; i++) {
cin >> mp[i];
for (int k = 0; k < w; k++)
if (mp[i][k] == '#') {
... | #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <deque>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <iomanip>
#include <bitset>
#include <set>
#include <map>
#include <stdio.h>
#include <numeric>
#include <cstring>
#define rep(i,n) for (int i = 0;... | 0 | 56,609,855 |
#pragma warning(disable:4786)
#include<string>
#include<map>
#include<iostream>
#include<cstdio>
using namespace std;
int main(void){
map<int,string>ward;
string in,out,siz,space;
string::size_type poi=0;
int x,j,i=0;
int cnt=0,data=0;
space=' ';
while((cin>>in)!=0){
ward.insert(map<int,string>::value_type(i... | #include<iostream>
#include<iomanip>
#include<algorithm>
#include<string>
#include<map>
#include<cmath>
#include<queue>
#include<functional>
using namespace std;
namespace MyLib {
#define ALL(a) a.begin(),a.end()
#define REP(i,n) for(int i=0;i<n;i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)
#define debug(x) if(1)cout... | 0 | 34,521,124 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <stack>
#include <map>
#include <set>
#include <math.h>
#include <stdio.h>
#include <string.h>
using namespace std;
typedef long long LL;
typedef long long int int64;... | #include <bits/stdc++.h>
using namespace std;
const int N = 10000;
bool dp[2][N+N], tmp[N+N];
void modify(int dir, int cnt) {
memset( tmp, 0, sizeof(tmp));
for (int i = 0; i < N+N; i++) {
if ( dp[dir][i] ) {
tmp[i-cnt] = 1;
tmp[i+cnt] = 1;
}
}
for (int i = 0; i < N+N; i++) dp[dir][i] = tmp[i... | 0 | 44,367,505 |
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void){
vector<int> a(3);
cin>>a[0]>>a[1]>>a[2];
sort(a.begin... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector <int>
#define vii vector <pair<int,int>>
#define ii pair<int,int>
#define loop(n) for(int i=0;i<n;i++)
#define loopj(n) for(int j=0;j<n;j++)
#define endl "\n"
ll mod=1e9+7;
const int N = 1e6+7;
int arr[N];
int main()
... | 0 | 73,337,325 |
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#define FAST_IO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define mod 1000000007
#define endl "\n"
#define PI 3.14159265358979323846264338327950288
using namespace std ;
using bigint = long long int ;
using v... | #include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
typedef long long ll;
const int N=100005;
int n,i,j,k,a[N],head[N],adj[N*2],nxt[N*2],d[N];
ll w[N];
bool dfs(int x,int dad)
{
if(!nxt[head[x]])
{
w[x]=a[x];
return true;
}
long long s=0,mx=0;
for(int y=head[x];y;y=nxt[y... | 0 | 65,765,451 |
#include <bits/stdc++.h>
using namespace std;
#define lp(i,n) for(int i=0;i<n;i++)
int main(){
while(1){
int n,m,p;
cin>>n>>m>>p;
if(n==0&&m==0&&p==0) break;
int count=0,ans,a;
lp(i,n){
cin>>a;
count+=a;
if(i==m-1) ans=a;
}
count*=100;
count*=(100-p);
if(ans!=0)cout<<count/ans/100<<endl;
e... | #include <cstdio>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define repi(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,a) repi(i,0,a)
#define r... | 0 | 59,268,244 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define fr(a,b) for(int i=a;i<b;i++)
#define prDouble(x) cout<<fixed<<setprecison(18)<<x
#define mod 1000000007
std::vector<int> tree[100001];
ll dp[100001][2];
int solve(int u, bool constraint, int pr)
{
if (dp[u][constraint] != -1... | #include<bits/stdc++.h>
#define LL long long
using namespace std;
const int maxn = 105;
int q;
const long double eps = 1e-9;
int main()
{
scanf("%d", &q);
for(int i = 0; i < q; i ++) {
int a, b;
scanf("%d%d", &a, &b);
if(a > b)
swap(a, b);
long double t = (long double... | 0 | 39,067,284 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define IOS ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define PI acos(-1)
#define EPS 1e-5
#define sz(v) ((int)(v).size())
#define all(v) v.begin(),v... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define all(n) begin(n),end(n)
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
const long long INF = numeric_limits<long long>::max();
int main(){
int A,B;
cin>>A>... | 0 | 99,086,790 |
#include <bits/stdc++.h>
using namespace std;
#define S size()
#define E end()
#define B begin()
#define L length()
#define endl "\n"
#define cnt count
#define in insert
#define er erase
#define fi first
#define se second
#define fl float
#define ld long double
#define ll long long
#define gcd __gcd
#define mp make_pai... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define sz(x) int(x.size())
#define pb push_back
#define eb emplace_back
using ll=long long;
using P = pair<int,int>;
using LP=pair<ll,int>;
#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)
const ll MOD=1000000007,MOD2=... | 0 | 15,404,854 |
#include <bits/stdc++.h>
#define ll long long
#define pi 3.14159265358979
#define mod 1000000007
#define rep(i,n) for(ll i=0;i<n;i++)
using namespace std;
int main(){
ll a,b,x;
double ans;
cin>>a>>b>>x;
if(2*x>a*a*b){
ans=180*atan((double)(2.0*(a*a*b-x)/(a*a*a)))/pi;
}else{
ans=90-18... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#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 fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
const long long INF = 1LL<<40;
int main(void){
ll n, k;
cin >> n >> k;
... | 0 | 52,723,224 |
#include <iostream>
using namespace std;
int main()
{
string s, res = "No";
cin >> s;
for(int i = 1; i < s.size(); i++)
{
if(s[0] == s[i])
{
switch(i)
{
case 1:
if(s[2] == s[3] && s[0] != s[2]) res = "Yes";
break;
case 2:
if(s[1] == s[3] && s[0] ... | #include <iostream>
#include<stdio.h>
#include<string>
#include<queue>
using namespace std;
int main()
{
string moji, kari, ushiro, mae; int a = -1;
while (cin >> kari) {
a++;
char c = kari[0];
if (isdigit(c)) {
int number = stoi(kari);
ushiro = moji.substr(number);
mae = moji.substr(0, number);
moj... | 0 | 37,694,697 |
#include <iostream>
using namespace std;
int main() {
int N, a;
cin >> N >> a;
if (a >= N % 500) cout << "Yes" << endl;
else cout << "No" << endl;
} | #include <bits/stdc++.h>
#include <math.h>
#include <cmath>
using namespace std;
using ll =long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vs = vector<string>;
using vvs = vector<vs>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector... | 0 | 20,484,576 |
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i,n) for(int i=0, i##_len=(int)(n); i<i##_len; i++)
#define reps(i,n) for(int i=1 , i##_len=(int)(n);i<=i##_len;i++)
#define rrep(i,n) for(int i=((int)(n)-1);i>=0;i--)
#define rreps(i,n) for(int i=((int)(n));i>0;i--)
#define all(x) (x).begi... | #include <iostream>
#include <algorithm>
#include <cmath>
#include <limits>
#include <iomanip>
#include <vector>
#include <cstring>
#include <queue>
#include <map>
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
using namespace std;
using ll = long long;
using ld = long double;
using ull =... | 0 | 36,608,301 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M;
cin >> N >> M;
int cost = N+M/2;
cout << cost;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define MOD 998244353
#define MAX 100
#define INF 800000000
int main(){
int N;
string s;
cin>>N;
int left=0;
int right=N;
vector<int> seat(N,-1);
cout<<0<<endl;
cin>>s;
if(s!="Vacant"){
if(s=="Male"){
seat.at(0)=1;
}else{
... | 0 | 58,415,513 |
#include <bits/stdc++.h>
using namespace std;
const string C = "[]()";
int main() {
for(string s; getline(cin, s) && s != ".";) {
try {
stack<int> stk;
for(int i = 0; i < s.size(); ++i) {
int p = C.find(s[i]);
if(p == string::npos) continue;
if(p % 2 == 0) {
stk.push(... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a,b) for(int a=0;a<b;a++)
#define Sort(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define fi first
#define se second
#define co(a) cout<<a<<endl
#define sz size()
#define bgn begin()
#define en end()
#define pb(a) pu... | 0 | 69,789,700 |
#include <iostream>
using namespace std;
int main() {
int A, B; cin >> A >> B;
if (A % 3 == 0 || B % 3 == 0 || (A + B) % 3 == 0) printf("%s\n", "Possible");
else printf("%s\n", "Impossible");
} | #include <bits/stdc++.h>
using namespace std;
int main(){
long long ans = 0, n;
cin >> n;
vector<int> score(40);
int num = 1, point = 1;
while (num < 40) {
for (int i = 1; i <= point + 1; i++) {
score[num] = point;
num++;
}
point++;
}
for (long... | 0 | 72,289,168 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
vector<int>a(s.length());
vector<int>c(26,0);
for (int i = 0; i < s.length(); i++) {
a.at(i) = s.at(i) - 'a';
c.at(a.at(i))++;
}
if (s.length() <= 25) {
ll ans;
for (int i = 0; i < 26; i++) {
if (c.at(... | #include<bits/stdc++.h>
using namespace std;
int main(void){
int H,W;
cin>>H>>W;
vector<vector<char>> s(H,vector<char>(W));
for(int i=0;i<H;i++){
for(int j=0;j<W;j++){
cin>>s[i][j];
}
}
bool ans=true;
for(int i=1;i<H-1;i++){
for(int j=1;j<W-1;j++){
if(s[i][j]=='#... | 0 | 5,612,880 |
#include<iostream>
#include<algorithm>
#include<string>
#include<cmath>
#include<map>
#include<vector>
#include<math.h>
#include<stdio.h>
#include<stack>
#include<queue>
#include<tuple>
#include<cassert>
#include<set>
#include<functional>
#define int long long
#define mod(int)(1000000007)
using namespace std;
const int... | #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 all(A) A.begin(),A.end()
typedef long long ll;
int main(){
int x;
cin >> x;
if(x>=2000){
cout << 1 << endl;
return 0;
}
rep(a,20){
rep(b,20){
rep(c,20)... | 0 | 100,269,273 |
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define debug(x) cerr<<#x<<" = "<<x
#define sp <<" "
#define el <<endl
#define fgx cerr<<" ---------------------------------------------- "<<endl
#define uint unsigned int
#define ULL unsigned long long
#define DB long double
#define LDB long double
#d... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
struct UnionFind
{
vector<int> par;
UnionFind(int n): par(n){
for(int i = 0;i < n;++i){
par.at(i) = i;
}
}
int root(int x){
if(par.at(x) == x){
return x;
}else{
... | 0 | 13,940,614 |
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
long long int mod = (long long int)1000000007;
using namespace std;
void solve()
{
ll i,j,k,n;
std::cout.precision(10);
int yes=0;
cin>>n;
double m,a[n];
cin>>m;
double sum=0;
for(i=0;i<n;i++)
{
cin>>a[i];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define FORV(i,v) for(auto i=v.begin(); i!=v.end();i++)
#define SORT(s) sor... | 0 | 45,547,794 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define all(v) v.begin(), v.end()
const ll mod=1000000007;
ll countBits(ll in){
int res=0;
for(;in>0;in>>=1){
if((in&0x01)!=0){
res++;
}
}
return res;
}
template<typename T>... | #include<iostream>
using namespace std;
int main()
{
long long n,m,mn,i,a,s=1;
cin>>n;
cin>>a;
mn=a;
for(i=2;i<=n;i++)
{
cin>>a;
if(a<mn)
{
s++;
}
mn=min(mn,a);
}
cout<<s<<endl;
return 0;
} | 0 | 50,473,571 |
#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... | #include <iostream>
#include <stdlib.h>
using namespace std;
int main(){
long max;
char str[10];
int i, j, k;
int num, nnum;
long setdata[2][5001], tmp;
int focus;
while(cin>>num){
if(num==0) break;
for(i=0; i<num; i++){
cin>>str;
setdata[0][i]=(long)atol(str);
}
max=100001*(-1... | 0 | 83,585,882 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
vector<int>a(n),b(n),c(n);
for(int i=0;i<n;i++){
cin>>a[i];
c[i] = a[i];
}
for(int i=0;i<n;i++){
cin>>b[i];
}
sort(c.begin(),c.end());
int apos,bpos,cnt = 0;
do{
if(a == c) apos = cnt;
if(b == c) bpos = cnt;
cnt++;
}while(ne... | #include<iostream>
#include<algorithm>
#include<cmath>
#include<map>
#include<stdio.h>
#include<vector>
#include<queue>
#include<math.h>
#include<deque>
using namespace std;
#define double long double
#define int long long
#define rep(s,i,n) for(int i=s;i<n;i++)
#define c(n) cout<<n<<endl;
#define ic(n) int n;cin>>n;
#... | 0 | 35,932,488 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0; i<(n); i++)
const ll INF = 1e15;
const int MX = 305;
int n,k,h[MX],un[MX],e;
ll dp[MX][MX][MX],ans=INF;
map<int,int> zp;
int main(){
scanf("%d%d", &n, &k);
rep(i,n){
scanf("%d", h+i);
un[i] = h[i];
}
sort(un, un+n+1... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i,n) for(int i = 0;i < n;i++)
#define all(x) x.begin(),x.end()
#define dup(x,y) (x + y - 1)/y
#define sz(v) (int)v.size()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
template<class T> ... | 0 | 38,428,452 |
#include <bits/stdc++.h>
#define PB push_back
#define LL long long
const int mod = 1000 * 1000 * 1000 + 7;
using namespace std;
int a[105];
map<int , int> m;
int main()
{
ios_base::sync_with_stdio(0);
int n;
cin >> n;
for(int i = 0; i < n; i++)
{
cin >> a[i];
m[a[i]]++;
}
sort(a , a + n);
int diam = a[n - 1... | #include <map>
#include <set>
#include <list>
#include <cmath>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <cstdio>
#include <string>
#include <vector>
#include <random>
#include <chrono>
#include <utility>
#include <numeric>
#include <cstdlib>
#include <cstring>
#include <climits>
#in... | 0 | 74,768,419 |
#include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;
typedef long long ll;
struct ee{
int fi,se;
}p[524290];
int n,a[524290],N,ans;
void f(int x,int y)
{
if(x==p[y].fi||x==p[y].se) return;
if(a[x]>a[p[y].fi]) p[y].se=p[y].fi,p[y].fi=x;
else if(a[x]>a[p[y].se]) p[y].se=x;
}
int main()
{
scan... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int a = 0 ,b = 0 ;
string s1,s2;
cin >> s1 >> s2 ;
for(int cnt = 0 ,a=0,b=0; a<s1.size() || b<s2.size(); cnt++ )
{
if(cnt%2==0)
{
cout << s1[a++] ;
}
else
cout << s2[b++] ;
... | 0 | 5,214,052 |
#include<iostream>
using namespace std;
#define V 10
#define INF (1<<30)-1
struct edge{int from,to,cost;};
int main(){
int d[V];
int n;
while(cin>>n){
if(n==0) break;
edge es[2*n];
int a,b,c;
int ans = INF,ansi;
for(int i=0;i<2*n;i+=2){
cin >> a >> b >> c;
es[i].from = es[i+1].to =... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
const int MAX_K=5000;
int main(){
long long N, K;
cin >> N >> K;
long long a[N];
long long sets[MAX_K]={}, sets_next[MAX_K]={};
long long tmp;
long long ans;
long long imax, imin, ii, ians;
bool flag;
for(lo... | 0 | 30,624,520 |
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
typedef long long ll;
const int N = 1e5 + 500;
int n, l, bst, a[N];
int main(){
scanf("%d%d", &n, &l);
for(int i = 0;i < n;i++){
scanf("%d", a + i);
if(i && a[i] + a[i - 1] >= l)
bst = i;
}
if(!bst){
printf("Impo... | #include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
#define NMAX 100000
inline int c2(int n) {
return n * (n - 1) >> 1;
}
static vector<int> buc[NMAX + 10];
int main() {
int n;
scanf("%d", &n);
int k = 1;
for (; c2(k + 1) <= n; k++) ;
if (c2(k) == n) ... | 0 | 37,714,236 |
#include <iostream>
#define INF 1000000
using namespace std;
int n, m;
int _dp[50010];
int c[30];
int dp(int cost){
if(_dp[cost]) return _dp[cost];
if(cost == 0) return 0;
int min = INF;
for(int i=0; i<m; i++){
if(cost - c[i] >= 0){
int temp = dp(cost - c[i]) + 1;
if(temp < min) min = temp;
}
}
_dp[cost... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0,i##_max=(N);i<i##_max;++i)
#define repp(i,l,r) for(int i=(l),i##_max=(r);i<i##_max;++i)
#define per(i,N) for(int i=(N)-1;i>=0;--i)
#define perr(i,l,r) for(int i=r-1,i##_min(l);i>=i##_min;--i)
#define all(arr) (arr).begin(), (arr).end()
#define S... | 0 | 36,025,685 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int H,W; cin >> H >> W;
vector<string> s(H);
for(int i=0; i<H; i++) cin >> s[i];
vector<vector<int>> flip(H,vector<int>(W,1000000));
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
if(i==0&&j==0){
if(s[i][j]=='#') flip[i][j]=1;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> l_l;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#def... | 0 | 84,599,390 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<n;i++)
int N;
int D[100010];
int mod = 998244353;
signed main()
{
cin >> N;
rep(i, N)
{
int d;
cin >> d;
D[d]++;
if(i == 0 && d != 0)
{
cout << 0 << endl;
... | #include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
using namespace std;
#define ll long long int
#define rep(i,n) for... | 0 | 91,262,301 |
#include<stdio.h>
int main()
{
int x,y,z;
scanf("%d %d",&x,&y);
z = x+(y/2);
printf("%d\n",z);
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;
int main() {
string s,t;
... | 0 | 64,229,312 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
double res,part=0;
cin>>n;
double a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=0;i<n;i++){
part=part+(1/a[i]);
}
res=1/part;
cout<<res<<endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... | 0 | 48,842,019 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,b,c;
long long k;
scanf("%d%d%d%lld",&a,&b,&c,&k);
if (k&1) swap(a,b);
printf("%d",a-b);
} | #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;
int main() {
int s,cnt=1;... | 0 | 42,533,749 |
#include <iostream>
int main()
{
char c;
std::cin >> c;
std::string s = "A";
if('a' <= c && c <= 'z') {
s = 'a';
} else if('A' <= c && c <= 'Z') {
s = "A";
}
std::cout << s << std::endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define endl "\n"
#define speed() ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sz(x) (int)(x).size()
#define _USE_MATH_DEFINES
using namespace std;
typedef long lon... | 0 | 45,942,949 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string X, Y;
int x, y;
cin >> X >> Y;
if(X == "A") {
x = 10;
}
if(X == "B") {
x = 11;
}
if(X == "C") {
x = 12;
}
else if(X == "D") {
x = 13;
}
else if(X == "E") {
x = 14;
}
else if(X == "F") {
x = 15;
}
if... | #include <bits/stdc++.h>
#define endl "\n"
#define rep(i,n) for(int i=0;i<int(n);i++)
#define e_b emplace_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ipair;
typedef pair<ll,ll> lpair;
template <class T... | 0 | 15,205,162 |
#include "bits/stdc++.h"
using namespace std;
int main() {
long long N, A[100], X[100] = {}, MIN, MAX;
cin >> N;
for (int i = 0; i < N; i++) cin >> A[i], X[A[i]]++;
sort(A, A + N);
MIN = A[0], MAX = A[N - 1];
if (MIN * 2 - 1 == MAX) {
if (X[MIN] != 2) {
cout << "Impossible" << endl;
return 0;
}
}
else... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
vector<string> a;
vector<string> b;
for (int k = 0; k < n; k++)
{
string s;
cin >> s;
a.push_back(s);
}
for (int k = 0; k < m; k++)
{
string s;
cin >> s;
b.push_back(s);
}
bool ans = false;
... | 0 | 64,179,694 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
typedef long long ll;
typedef unsigned int uint;
using namespace std;
const int INF = 1000000007;
int N,M,R;
int d[201][201];
int r[9];
int A,B,C;
int res;
bool used[9];
void dfs (int c, int las, int dist) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int main() {
int N;
cin >> N;
vector<int> V(N), W(N);
for(int i=0; i<N; i++) cin >> V[i];
for(int i=0; i<N; i++) {
if(i % 2 == 0) {
W[i/2] = V[N-i-1];
}
else {
... | 0 | 67,219,262 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair< ll, ll > Pi;
#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
const ll INF = 1LL << 60;
template<class T>bool chmax(T... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i < (int)(n); i++)
using ull = unsigned long long;
using pii = pair<int, int>;
vector<pii> A;
int main() {
int H, W, D;
cin >> H >> W >> D;
A.assign(H*W+1, pii(0, 0));
int ai;
rep(y, H) rep(x, W) {
cin >> ai;
... | 0 | 34,082,096 |
#include<bits/stdc++.h>
#define REP(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
const ll MOD = 1000000007;
int main() {
int n, k;
cin >> n >> k;
cout << n % k << endl;
return 0;
} | #include <iostream>
#include <vector>
#include <fstream>
#include <algorithm>
#include <cstring>
#include <iomanip>
typedef long long ll;
using namespace std;
vector<ll>a(5005);
vector<ll>b(5005);
vector<ll>track;
bool vis[5005];
void dfs(int u , long long total_cycle){
if(vis[u]) return ;
... | 0 | 50,814,730 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
vector<int> A;
long sum=0;
for(int i=0; i<N; i++)
{
int a; cin >> a;
sum+=a;
A.push_back(a);
}
long min = INT_MAX;
long sum2 =0;
for(int i=0; i<N-1; i++){
sum2+=A[i];
sum-=A[i];
if(abs(sum2-sum)<min)
{
... | #define _CRT_SECURE_NO_WARNINGS
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <... | 0 | 96,491,403 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,s,e) for((i)=(s);(i)<(int)(e);(i)++)
#define REP(i,e) FOR(i,0,e)
#define all(o) (o).begin(), (o).end()
#define psb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
typedef long long ll;
typedef pair<int, int> PII;
const double EPS = 1e-10;
const int N = 44;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int n, L, qq;
cin >> n;
vector<int> x(n);
for (int i = 0; i < n; i++) {
cin >> x[i];
}
cin >> L >> qq;
const int K = 20;
vector<vector<int>> next(n, vector<int>(K));
for (int i = 0, j = 0; i < n; i++) {
... | 0 | 86,525,848 |
#include <stdio.h>
#include <stdlib.h>
int main()
{
int X, Y;
for (X = 1; X < 10; X++)
{
for (Y = 1; Y < 10; Y++)
{
printf("%dx%d=%d\n", X,Y,(X*Y));
}
}
return 0;
} | #include <iostream>
using namespace std;
#define MAX 250
int main() {
int n;
int x;
int H[MAX];
cin >> n;
for(int i=0; i<n; i++) {
cin >> x;
H[i] = x;
}
for(int i=0; i<n; i++) {
cout << "node " << i+1 << ": ";
cout << "key = " << H[i] << ", ";
if(i>0) ... | 0 | 60,303,254 |
#include<iostream>
#include<queue>
using namespace std;
int main(){
int w,h;
while(cin>>w>>h , w+h){
char Map[20][20]={0};
int pos = 0;
for(int i=0;i<h;i++){
for(int j=0;j<w;j++){
cin>>Map[i][j];
if(Map[i][j]=='@') pos=i*w+j;
}
}
int cnt=0;
queue<int> q;
q.push(pos);
w... | #include <cstdint>
#include <iostream>
#include <string>
using namespace std;
static uint32_t dp[1001][1001];
static void init_dp(uint32_t len1, uint32_t len2)
{
for (uint32_t i = 0; i < len1; i++) {
dp[i][0] = 0;
}
for (uint32_t i = 0; i < len2; i++) {
dp[0][i] = 0;
}
}
int32_t main()
{
uint32_t n;
... | 0 | 21,115,841 |
#define _USE_MATH_DEFINES 1
#define _EXT_CODECVT_SPECIALIZATIONS_H 1
#define _EXT_ENC_FILEBUF_H 1
#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std;
using namespace __gnu_pbds;
#define MOD 1000000007ll
#define EPS 1e-9
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock... | #include <iostream>
#include <vector>
using namespace std;
using int_vec = vector<int>;
const int MAX_NUM = 10000;
void print(const int_vec& v) {
auto it = v.begin();
for (; it != v.end()-1; ++it) {
cout << *it << " ";
}
cout << *it << endl;
}
int_vec counting_sort(const int_vec& a) {
int_ve... | 0 | 64,457,217 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string S;
cin >> S;
int win = 0;
for (int i = 0; i < S.size(); ++i) {
if(S[i] == 'o') win++;
}
win += 15 - S.size();
if(win >= 8){
cout << "YES" << "\n";
} else{
cout << "NO" << "\n";... | #include <bits/stdc++.h>
namespace IO {
template <typename Tp> inline Tp input() {
Tp x = 0, y = 1;
char c = getchar();
while ((c < '0' || '9' < c) && c != EOF) {
if (c == '-')
y = -1;
c = getchar();
}
if (c == EOF)
return 0... | 0 | 3,332,125 |
#include <bits/stdc++.h>
#include <atcoder/all>
#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
usin... | #include<bits/stdc++.h>
using namespace std;
#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 erep(i,a,n) for(int i = a;i<=n;i++)
typedef long long ll;
#define int long long
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<string>
#define vdouble... | 0 | 39,656,344 |
#include <iostream>
using namespace std;
const int num[] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};
int ans = 0, n, s, sum = 0;
void subsetsum(int n, int k)
{
for(int i = n; i < 10; i++){
if(k){
sum += num[i];
subsetsum(i + 1, k - 1);
if(sum == s && k == 1)
ans++;
sum -= num[i];
}else{
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef tuple<int, int> duo;
const int dx[] = {0, 0, 1, -1, 1, 1, -1, -1};
const int dy[] = {1, -1, 0, 0, 1, -1, 1, -1};
const int Mod = 1000000000 + 0;
#define TT_ template<typename T>inline
#define TTF_ template<typename T,typ... | 0 | 77,259,786 |
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <iomanip>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | 0 | 9,301,343 |
#include <stdio.h>
int main(void)
{
while(1){
int n;
scanf("%d", &n);
if(n==0){
break;
}
int a[5000];
int max;
int i,j;
for(i=0; i<n; ++i){
scanf("%d", &a[i]);
int sum = 0;
for(j=i; j>=0; --j){
sum += a[j];
if((i==0 && j==0) || sum>max){
... | #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... | 0 | 84,885,374 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mo=1000000007;
ll modpow(ll a, ll n, ll mod){
ll ret = 1;
while(n > 0){
if(n & 1) ret = ret * a % mod;
a = a * a % mod;
n >>= 1;
}
return ret;
}
ll MOD(ll a, ll mod){
ll temp = a % mod;
if(temp < 0) temp += mod;
retur... | #include <bits/stdc++.h>
#define F first
#define S second
#define MAX 10000003
using namespace std;
typedef long long int ll;
const ll mod = 1e17;
long double PI=3.1415926;
ll power(ll a,ll b){
if(b==0){
return 1;
}
ll temp=power(a,b/2)%mod;
if(b%2==0){
return (temp*temp)%mod;
}
... | 0 | 87,561,891 |
#include<stdio.h>
int main() {
char character1;
scanf("%c", &character1);
printf("%c", character1 + 1);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define in insert
#define PI 3.1415926535897932384626433832795
#define F first
#define S second
#define aLL(str) (str).begin(), (str).end()
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#def... | 0 | 91,855,839 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int N=2e3+5;
int n,a[N],x,y;
int main(){
cin.tie(NULL);
cout.tie(NULL);
ios_base::sync_with_stdio(false);
cin>>n>>x>>y;
for(int i=0;i<n;i++)
cin>>a[i];
if(n>1)
cout<<max(abs(a[n-2]-a[n-1]),abs(a[n-1]-y)... | #include <bits/stdc++.h>
#include <string>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef long long ll;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define INF 10000... | 0 | 87,471,520 |
#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;
cin >> N;
vector<int> A(N);
rep(i,N) cin >> A.at(i);
int max1 = 0, max2 = 0;
rep(i,N) {
if (A.at(i) > max2) max2 = A.at(i);
... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x,y) make_pair(x,y)
#define all(x) (x).begin(),(x).end()
#define pb push_back
using ll = long long;
using vin=vector<int>;
using vll=vector<ll>;
using vst=vector<string>;
using P = ... | 0 | 53,771,322 |
#include <iostream>
using namespace std;
int main(int argc, char **argv)
{
int n, tmp, count;
while(cin >> n){
count = 0;
for(int i = 0; i <= 9; i++){
if(i > n){
break;
}
for(int j = 0; j <= 9; j++){
if((i + j) > n){
break;
}
for(int k = 0; k <= 9; k++){
tmp = i + j + k;
if... | #include <sstream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <iostream>
#include <utility>
#include <set>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;
int f(int n) {
return n * n;
}
int main(void... | 0 | 10,826,778 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int ans = 0;
for(int i=1;i<n;i++){
int tmp = (n-1)/i;
ans += tmp;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#include <queue>
using namespace std;
int main(){
int N;
cin >> N;
typedef pair<int, int> Student;
priority_queue<Student, vector<Student>, greater<Student>> que;
int num;
for(int i=0; i<N; i++){
cin >> num;
que.push(Student(num, i));
}
while (!qu... | 0 | 30,694,692 |
#include <iostream>
using namespace std;
int main(){
long long N, M;
cin >> N >> M;
if (M % 2){
for (int i = 0; i < M/2; i++){
cout << i + 1 << " " << M - i << endl;
}
for (int i = 0; i < M/2 + 1; i++){
cout << M + i + 1 << " " << 2 * M - i + 1 << endl;
}
} else {
for (int i = 0; i < M/2; i++){
c... | #include <iostream>
using namespace std;
int main(){
int y, m, d, i, times, D1, D2, D3;
cin >> times;
i = 0;
while(1){i++;
if(i>times){break;}
cin >> y >> m >> d;
D1 = (y-1)/3*200+((y-1)-(y-1)/3)*195;
if(y%3==0){
D2 = (m-1)*20+d;
}
else{
... | 0 | 21,154,046 |
#include <bits/stdc++.h>
#include<vector>
using namespace std;
#define rep(i, n) for(int i=0; i<(int)(n); ++i)
int main() {
int a,b;
int c,d=1;
cin>>a>>b;
a=a-b;
rep(i,b)d*=2;
cout<<b*d*1900+a*d*100;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fi first
#define se second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define debug(a) cout << #a << " = " << a << " ";
#define endl "\n"
const int MOD=1e9 + 7;
const int N=1000100;
template<typename T> istream &operator>>(is... | 0 | 35,757,495 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.