code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define irep(i, n) fo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const long double PI = (acos(-1));
const long long MOD = 1000000007;
long long modpow(long long a, long long n, long long m)
{
long long ans = 1;
while (n)
{
if (n & 1)
{
ans = (ans * a) % m;
}
a ... | 1 | 86,608,958 |
#include <cmath>
#include <iostream>
#include <algorithm>
using namespace std;
int Q, A, B;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cin >> Q;
for (int i = 0; i < Q; i++) {
cin >> A >> B;
if (A > B) swap(A, B);
int l = 0, r = 2000000018;
while (r - l > 1) {
int m = ((long long)l + r) >>... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int T;
int main(){
scanf("%d",&T);
while(T--){
ll a,b,ans=0;
scanf("%lld%lld",&a,&b);
ll x=sqrt(a*b);
if(x*(x+1)<a*b)ans=2*x-1;
else if(x*x==a*b){
if(a==b)ans=(x-1)*2;
else ans=(x-1)*2-1;
}
else ans=(x-1)*2;
printf("%lld\n",ans);... | 1 | 72,772,409 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <iomanip>
#include <limits>
using namespace... | #include <bits/stdc++.h>
using namespace std;
int main(){
int k, a, b;
cin >> k >> a >> b;
bool ans = false;
for(int i = a; i <= b; i++){
if(i % k == 0){
ans = true;
break;
}
}
if(ans){
cout << "OK" << endl;
}else{
cout << "NG" << endl;
}
} | 1 | 14,887,151 |
#include <bits/stdc++.h>
using namespace std;
int mod = 1000000007;
int64_t large = 9223372036854775807;
double PI = 3.141592653589793;
int main()
{
double A, B, X, rad;
cin >> A >> B >> X;
if (X < A * A * B / 2)
{
rad = atan((A * B * B) / (X * 2));
}
else
{
X = A * A * B - X... | #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... | 1 | 23,006,675 |
#include <iostream>
double func(double input) {
return input * input;
}
double integral(double h, double min_x = 0, double max_x = 600) {
double sum = 0;
for (double x = min_x; x < max_x; x+= h) {
sum += func(x) * h;
}
return sum;
}
int main()
{
int input;
while(std::cin >> input) {
... | #include <cassert>
#include <iostream>
int f(int x)
{
return x * x;
}
int main()
{
while(true){
int d;
std::cin >> d;
if(std::cin.eof()) break;
int s = 0;
for(int x = d; x < 600; x += d){
s += d * f(x);
}
std::cout << s << std::endl;;
}
... | 1 | 1,036,869 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int t[10] = {0};
int index = 0;
for (string::iterator it = s.begin(); it != s.end(); it++) {
if (*it == '0') {
t[index++] = 0;
} else if (*it == '1') {
t[index++] = 1;
} else if (*it == 'B') {
... | #include <stdio.h>
#include <string.h>
int main(){
char word[13];
scanf ("%s", word);
int X = strlen(word);
int save[11] = {0};
int B=0;
for (int i=0; i<=X; i++){
if (word[i]=='B'){
B++;
continue;
}
else if (word[i]!='B'){
int remo = 0;
remo = B*2;
for (int j=1; j<=remo; j++){
if (i-j >= ... | 1 | 67,878,995 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
#define ll long long
#define vvi vector< vector<int> >
#define All(X) X.begin(),X.end()
#define FOR... | #include <bits/stdc++.h>
using namespace std;
#define PI 4*atan(1)
#define INF 1e8
int dx[4] = {1,0,-1,0};
int dy[4] = {0,1,0,-1};
int main(){
int N, A, B, C, X;
while(cin >> N >> A >> B >> C >> X, N||A||B||C||X){
vector<int> Y(N);
for(int i = 0; i < N; i++){
cin >> Y[i];
}
int x = X, index = ... | 1 | 71,035,152 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
rep(i,n) cin >> a[i];
rep(i,n) {
b[i] = a[i];
}
sort(b.begin(), b.end());
rep(i,n) {
... | #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);
int m1 = 0, i1 = 0;
rep(i,n) {
cin >> a[i];
if (max(m1,a[i]) != m1) {
i1 = i;
... | 1 | 95,835,748 |
#include<iostream>
using namespace std;
int main()
{
int H, W, A, B; cin >> H >> W >> A >> B;
for(int i=0; i<H; i++){
for(int j=0; j<W; j++){
if(j < A){
if(i < B) cout << 1;
else cout << 0;
}else{
if(i < B) cout << 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, A, B;
cin >> H >> W >> A >> B;
for (int i = 0; i < H; i++) {
if (i < B) {
for (int j = 0; j < W; j++) {
if (j < A) cout << 0;
else cout << 1;
}
}
else {
for (int j = 0; j < W; j++) {
if (j < ... | 1 | 7,625,888 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 17;
int n, timer = 0, q, k;
vector < pair < int, int > > g[maxn];
int tin[maxn], tout[maxn];
int64_t d[maxn];
void dfs (int u, int p) {
tin[u] = ++timer;
for (auto pr: g[u]) {
int v = pr.first, w = pr.second;
if (v != p) {
d[v] = d[u... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl "\n"
#define ll long long
#define int ll
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (... | 1 | 8,080,351 |
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long LL;
typedef pair<LL,LL> P;
const LL mod=1000000007;
const LL LINF=1LL<<60;
const int IN... | #include<bits/stdc++.h>
using namespace std;
#define res register int
#define ll long long
template<typename T>
inline void read(T &x)
{
static char ch;bool f=1;
for(x=0,ch=getchar();!isdigit(ch);ch=getchar()) if(ch=='-') f=0;
for(;isdigit(ch);x=(x<<1)+(x<<3)+(ch^48),ch=getchar());x=f?x:-x;
}
template<typen... | 1 | 17,055,297 |
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#d... | #include <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
typedef pair< int, int > iP;
int main() {
int n;
while(cin >> n, n) {
vector< iP > v;
vector< int > t(24 * 3600, 0);
for(int i = 0; i < n; i++) {
int h, m, s, hh, ... | 1 | 85,708,499 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(ll i=0;i<n;i++)
#define P pair<ll,ll>
#define Graph vector<vector<ll>>
#define INF (1ll<<60)
#define mod 1000000007
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return true;} return false;}
template<class T> inline bool ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
#define INF __INT32_MAX__
#define LINF __LONG_LONG_MAX__
ll check(ll x, ll y) {
ll ans = LINF;
if (x >= 3) {
for (int i = 1; i <=... | 1 | 22,804,331 |
#include <iostream>
using namespace std;
#define ll long long int
ll max(ll a, ll b){
if(a > b) return a;
return b;
}
ll min(ll a, ll b){
if(a < b) return a;
return b;
}
ll Solve(int N, int R, int S, ll* H, ll* Kai){
ll ret = LLONG_MAX>>2;
if(R <= 0){
ret = 0;
}else if(S == 1){
ret = H[R];
}else... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
const int n_max = 310;
ll dp[n_max][n_max];
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n,k;
cin >> n >>... | 1 | 3,324,634 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
int main(){
ll n,m,d;
string S;
cin >> n >> m >> d;
ld cnt = 0;
if(d != 0){
cnt = n-2*d+n;
}else{
c... | #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
typedef pair<int,int> ... | 1 | 14,453,282 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
int main(){
ll n;
cin>>n;
n--;
ll ans=n*(n+1)/2;
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(){
long long n;
cin >> n;
cout << n*(n-1)/2;
} | 1 | 20,745,698 |
#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cstdlib>
#include<queue>
using namespace std;
#define rep(i, n) for(long int i = 0; i < n; i++)
int main(){
int h, w;
cin >> h >> w;
string s[h];
rep(i, h) cin >> s[i];
rep(i, h){
cout << s[i] << endl;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
for(int i = 0; i < N;i++){
string S;
cin >> S;
cout << S << endl;
cout << S << endl;
}
} | 1 | 68,292,307 |
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <algorithm>
#include <bitset>
#define range(i, r) for(int i=0;i<r;i++)
#define ranges(i, l, r) for(int i=l;i<r;i++)
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi std::vector<std::vector<int> >
#define vvl std::... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,s,n) for(ll i = (s); i < (n); i++)
#define rep0(i,n) rep(i,0,n)
#define rep1(i,n) rep(i,1,n+1)
#define repR(i,s,n) for(ll i = (n-1); i >= (s); i--)
#define repR0(i,n) repR(i,0,n)
#define repR1(i,n) repR(i,1,n+1)
#define BR "\n"
#define SP... | 1 | 59,119,086 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string a,b,c;
cin>>a>>b>>c;
cout<<char(a[0]-'a'+'A');
cout<<char(b[0]-'a'+'A');
cout<<char(c[0]-'a'+'A');
} | #include <bits/stdc++.h>
using namespace std;
int main(){
string c,a,b;
cin >> a >> b >> c;
char e = a.at(0);
char f = b.at(0);
char g = c.at(0);
int n = (int)e-32;
int m = (int)f-32;
int o = (int)g-32;
cout << (char)n << (char)m << (char)o << endl;
} | 1 | 48,407,442 |
#include<iostream>
using namespace std;
char getGrade(int m,int f, int r){
int sum = m + f;
char grade;
if(sum < 30 || m == -1 || f == -1) grade = 'F';
else if(sum >= 80) grade = 'A';
else if(65 <= sum && sum < 80) grade = 'B';
else if(50 <= sum && sum < 65) grade = 'C';
else if(30 <= sum && sum < 50){
... | #include <iostream>
using namespace std;
int main() {
int m, f, r;
do{
cin >> m >> f >> r;
if (m == -1 || f == -1){
if (m == -1 && f == -1 && r == -1) break;
else cout << "F" << endl;
}
else if ((80<=(m+f))) cout << "A" << endl;
else if ((65<=(m+f)... | 1 | 34,030,219 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#define pi 3.14159265358979323846264338327950
int main() {
int N; std::cin >> N;
std::vector<int> D(N);
std::vector<int> DD(N);
for (int i = 0; i < N; ++i) {
std::cin >> D[i];
--D[i];
}
for (int... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int x[n],y[n];
for (int i=1;i<n+1;i++){
cin>>x[i];
y[x[i]]=i;
}
for (int i=1;i<n+1;i++){
cout<<y[i]<<" ";
}
return 0;
} | 1 | 18,064,512 |
#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&... | #include <bits/stdc++.h>
#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)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
int n, k;
cin >> n >> k;
vector<int> vs(n);
rep(i,n) cin >> vs[i];
ll ans =... | 1 | 90,359,168 |
#include <bits/stdc++.h>
using namespace std;
string s;
int main(){
cin >> s;
int ans = 0;
for (int i = 0; i < s.length(); i++) if (s[i] == 'o') ans++;
cout << (ans + 15 - s.length() >= 8 ? "YES" : "NO");
return 0;
} | #include <iostream>
#include <string>
#include <queue>
#include <map>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <math.h>
#include <set>
#define INTINF 2147483647
#define LLINF 9223372036854775807
using namespace std;
using ll=long long;
typedef pair<int,int> P;
int main(){
string s;
cin... | 1 | 71,997,307 |
#include <bits/stdc++.h>
#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++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main()
{
int n;
cin >> n;
double a[n];
double ans = 0;
rep(i, n) cin >> a[i];
sort(a, a + n);
r... | #include<iostream>
#include<vector>
#include<queue>
#include<string>
#include<algorithm>
#include<map>
#include<cmath>
#include<cstring>
#include<iomanip>
#include<set>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define INF 1000000100
#define rep(i,n) for (int i=0;i<n;i++)
int main(){
int N... | 1 | 33,610,389 |
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <climits>
using namespace std;
typedef lo... | #include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
const int mod = 1000000007;
ll dp[100100][2];
int main()
{
string s;
cin >> s;
int n = s.size();
rep(i,100100)rep(j,2) dp[i][j] = 0;
dp[0][0] = 1;
for (int i=1; i<=n; i++) {
if... | 1 | 56,042,996 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 100;
int n, d[N];
bool dead[N];
vector<int> nei[N];
queue<int> q;
void input() {
cin >> n;
for (int i = 0; i < n - 1; i++) {
int u, v;
cin >> u >> v;
nei[--u].push_back(--v);
nei[v].push_back(u);
}
}
int match(int v) {
for (int u: nei[v])
i... | #include<bits/stdc++.h>
using namespace std;
const int Nmax = 1e5 + 100;
int n, avail[Nmax], ass[Nmax], t, res;
vector<int> a[Nmax];
bool visit(int u) {
if (avail[u] != t) avail[u] = t;
else return false;
for(int i = 0; i < (int)a[u].size(); ++i) {
int v = a[u][i];
if (!ass[v] || visit(ass[v... | 1 | 87,048,422 |
#include<iostream>
using namespace std;
int main(void){
int h;
int i;
int best[3]={0,0,0};
for(i=0;i<10;i++){
cin>>h;
if(best[0] < h ){
best[2] = best[1];
best[1] = best[0];
best[0] = h;
}
else if(best[1] < h){
best[2] = best[1];
best[1] = h;
}else if(best[2] < h){
best[2] =h;
}
}
co... | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
vector<int> mt;
for(int i=0;i<10;i++){
int tmp;
cin>>tmp;
mt.push_back(tmp);
}
sort(mt.begin(),mt.end());
for(int i=9;i>=7;i--){
cout<<mt[i]<<endl;
}
return 0;
} | 1 | 16,033,876 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cassert>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define rep(i,n) FOR(i,0,n)
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define vint vector<int>
#define vdouble vector<double>
#define vs... | #include <cstdlib>
#include <cstring>
#include <cstdio>
struct Node {
int key;
Node *prev, *next;
};
struct Node *nil;
void init() {
nil = (Node *)malloc(sizeof(Node));
nil->next = nil;
nil->prev = nil;
}
void insert(int key) {
Node *x = (Node *)malloc(sizeof(Node));
x->key = key;
x->next = nil->next;... | 1 | 56,681,502 |
#include <iostream>
#include <vector>
using namespace std;
auto itrMinInVector(vector<int>::iterator itr_first, vector<int>::iterator itr_last){
auto itr_min = itr_first;
for(auto itr=itr_first;itr!=itr_last;++itr){
if(*itr_min>*itr) itr_min = itr;
}
return itr_min;
}
int cnt=0;
std::vector<int>... | #include <iostream>
using namespace std;
const int MAX_N = 100;
int a[MAX_N];
int selectionSort(int a[], int n);
int main(){
int n;
cin >> n;
for(int i = 0; i < n; i++) cin >> a[i];
int ex = selectionSort(a, n);
for(int i = 0; i < n; i++) {
if (i) cout << " ";
cout << a[i];
}
cout << endl;
cout << ex << en... | 1 | 69,005,527 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define int ll
typedef pair<int,int> pii;
#define fi first
#define se second
#define Sort(a) sort(a.begin(),a.end())
#define rep(i,n) for(int i = 0;i < (n) ; i++)
#define REP(i,n) for(int i = 0;i < (n) ; i++)
#define MP(a,b) m... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define fi first
#define se second
const ll mod = 1e9+7;
const int N = 1e6+5;
int a[4][4];
int b[4][4];
void solve(){
for(int i=1;i<=3;i++){
for(int j=1;j<=3;j++){
cin>>a[i][j];
}
}
int n;
cin>>n... | 1 | 18,642,756 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char s;
bool judge=true;
cin >> s;
switch(s){
case'a':break;
case'i':break;
case'u':break;
case'e':break;
case'o':break;
default:judge=false;
}
if(judge ==true)
cout << "vowel" << endl;
else ... | #include <bits/stdc++.h>
using namespace std;
int main() {
char c;
cin >> c;
string v = "aeiou";
int is_vowel = 0;
for(int i=0; i<v.size(); i++) {
if(v.at(i) == c) {
is_vowel = 1;
break;
}
}
if (is_vowel) {
cout << "vowel";
} else {
cout << "consonant";
}
cout << ... | 1 | 77,173,737 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <cmath>
#include <iomanip>
#include <set>
#include <sstream>
#include <queue>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
vector<int> cnt(2, 0);
for (int i = 0; i < s.size(); i++)... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define FOR(i, a, b) for (int i = a; i <= (b); i++)
#define ROF(i, a, b) for (int i = a; i >= (b); i--)
using pii = pair<int, int>; using vpii = vector<pii>... | 1 | 100,009,853 |
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int H=60*60;
const int M=60;
const int S =1;
int train[24*H+1];
int unit[3]={H,M,S};
int getTime(string s){
string tmp;
int res=0;
for(int i=0;i<3;i++){
tmp=s.substr(3*i,2);
int val=atoi(tmp.c_str());
res+=unit[i]*val;... | #include<cstdio>
#include<utility>
#include<algorithm>
#include<vector>
using namespace std;
int main(){
int n,h,m,s;
while(scanf("%d",&n),n){
vector< pair<int,int> > v;
for(int i=0;i<n;i++){
scanf("%d:%d:%d",&h,&m,&s);
v.push_back(make_pair(h*3600 + m*60 + s,1));
scanf("%d:%d:%d",&h,&m,&s... | 1 | 22,471,568 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF INT_MAX
#define LLINF LLONG_MAX
#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
#define MODB 998244353
template <typename T>
std::istream& operator>>(std::istream& is, std::vector<T>& ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
const i... | 1 | 63,534,573 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll=long long;
int main(){
int n;
cin>>n;
int p[200010];
int ans=0;
int tmp=200010;
rep(i, n){
cin>>p[i];
if(tmp>p[i]) ans++;
tmp=min(tmp,p[i]);
}
cout<<ans<<endl;
} | #include<bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rep(i, n) for(ll i = 0; i < n; i++)
const ll INF = 1LL << 60;
int main(){
int N, M, A, B, C;
string s1, s2;
cin >> N;
vector<int> P(N);
rep(i, N) cin >> P... | 1 | 93,574,943 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i = 0; i < (long long)(n); ++i)
using namespace std;
using ll = long long;
int main() {
string n;
cin >> n;
string ans = "No";
rep(i, 3) if (n[i] == '7') ans = "Yes";
cout << ans << endl;
return 0;
} | #include <iostream>
#include<deque>
using namespace std;
int main()
{
char a[3];
cin >> a[0]>>a[1]>>a[2];
for (int i = 0; i < 3; i++)
{
if(a[i]=='7'){
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} | 1 | 94,025,146 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,n-1,0)
#define all(v) v.begin(), v.end()
const int inf = 1e9+7;
const ll longinf = 1LL... | #include <bits/stdc++.h>
using namespace std;
int main()
{
long long N, A, B;
cin >> N >> A >> B;
long long ma = (N - 1) * B + A;
long long mi = (N - 1) * A + B;
long long ans = max( 0LL, ma - mi + 1 );
cout << ans << endl;
} | 1 | 94,488,307 |
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
string make_ans(string s, string t, int cur){
string ans = "";
for(int i=0; i<s.size(); i++){
if(s[i] == '?') ans += 'a';
else ans += s[i];
}
for(int i=0; i<t.size(); i++){
ans[cur + i] = t[i];
}
return an... | #include<iostream>
#include<string>
using namespace std;
int main()
{
int n,m,i,j;
string s,t;
cin >> s >> t;
n=s.size();
m=t.size();
for(i=n-m;i>=0;i--){
for(j=0;j<m;j++)
if(t[j]!=s[i+j] && s[i+j]!='?')
break;
if(j==m)
break;
}
if(i<0){
cout << "UNRESTORABLE" << endl;
... | 1 | 33,251,303 |
#include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
const int MOD = 1000000007;
const int INF = 1e14;
using Graph = vector<vector<int>>;
signed main(){
int N;
cin >> N;
vector<int> A(N);
for( int i = 0; i < N; i++ ) cin >> A[i];
int money = 1000;
int kabu = 0;
fo... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 1 | 9,557,632 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
string s; cin>>s;
int o=0,n=s.length();
for (int i = 0; i < n; i++)if(s[i]=='1')o++;
if(o==0 || n-o==0)return cout<<0,0;
cout<<2*min(o, n - o);
} | #include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int n = (int) s.size();
stack<int> st;
int ans = 0;
for(int i = 0; i < n; i++) {
if(st.size() && st.top() != s[i]) {
st.pop();
ans++;
} else {
st.push(s[i]);
}
}
cout << ans * ... | 1 | 58,408,982 |
#define _GLIBCXX_DEBUG
#define ll long long
#include <bits/stdc++.h>
using namespace std;
int main()
{
int16_t k,a,b;
bool f = false;
cin >> k;
cin >> a >> b;
for (int i = a; i<=b; i++) {
if (i%k == 0){
f = true;
cout << "OK" << endl;
return 0;
}
... | #include <stdio.h>
int main(void) {
int k, a, b;
scanf("%d", &k);
scanf("%d%d", &a, &b);
int largest = (b / k) * k;
if (a <= largest) {
puts("OK");
} else {
puts("NG");
}
return 0;
} | 1 | 69,354,265 |
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <utility>
#include <algorithm>
#include <cmath>
#include <climits>
#include <iomanip>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
int main() {
ll n, m; cin >> n >> m;
ll *h = new ll... | #define rep(i, n) for (int i = 0; i < (n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MOD = 1000000007;
int main() {
int n, m;
cin >> n >> m;
vector<int> h(n);
rep(i, n) cin >> h.at(i);
vector<bool> ok(n, true);
rep(i, m) {
... | 1 | 37,307,795 |
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <utili... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n, a[2 * 100000];
long long sum1 = 0, sum2 = 0, ans = 1e+17;
cin >> n;
for(int i = 0; i < n; i++) {
cin >> a[i];
sum2 += a[i];
}
sum1 += a[0], sum2 -= a[0];
for(int i = 1; i < n; i++) {
ans... | 1 | 57,102,557 |
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <cmath>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <iostream>
#include <random>
#include <map>
#include <iomanip>
#include <stdlib.h>
#inclu... | #include <bits/stdc++.h>
#define rep(i,N) for(int i = 0; i < N;i++)
#define ALL(a) (a).begin(),(a).end()
#define ll long long int
using namespace std;
ll dig(ll N, ll K) {
ll dig = 0;
while (N) {
dig++;
N /= K;
}
return dig;
}
ll gcd(ll x, ll y) {
ll r;
while (x%y) {
r = x % y;
x = y;
y = r;
}
return ... | 1 | 25,758,976 |
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<time.h>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.b... | #include <iostream>
#include <string>
#include <map>
int main()
{
std::map<std::string, int> word_frequency;
std::string word;
while (std::cin >> word) {
word_frequency[word]++;
}
std::string most_frequent_word;
std::string longest_word;
int max_frequency = 0;
for (std::map<std::string, int>::iterator i = wor... | 1 | 47,915,464 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL<<60;
ll gcd(ll a, ll b) {
if(b == 0) return a;
return gcd(b, a % b);
}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b... | #include <bits/stdc++.h>
using namespace std;
int n;
int a[2002];
int m[2][2002];
int main() {
cin>>n>>a[0]>>a[1];
for (int i=0; i<n; i++) cin>>a[i+2];
for (int i=n+1; i>1; i--) {
m[0][i] = abs(a[i-1] - a[n+1]);
for (int j=n+1; j>i; j--) {
m[0][i] = max(m[1][j], m[0][i]);
}
m[1][i] = abs(a[i... | 1 | 29,627,981 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1337;
const int MOD = 1e9+7;
char B[N][N];
int dp[N][N];
int main(){
int h,w; cin >> h >> w;
for(int i = 1; i <= h; i++){
for(int j = 1; j <= w; j++){
cin >> B[i][j];
}
}
dp[1][1] = 1;
for(int i = 1; i <= h; i++)... | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int mxn = 1005;
int dp[mxn][mxn];
char grid[mxn][mxn];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
cin >> grid[i][j];
dp[1][1] = 1;
for (int i = 1; i <... | 1 | 45,405,378 |
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;
#define REP(i,n) for(int i=0; i<n; i++)
#define FOR(i,a,b) for(int i=a; i<=b; i++)
#define FORR(i,a,b) f... | #include<iostream>
#include<string>
using namespace std;
int main(){
string a;
char b[101];
while(true){
int count=0;
getline(cin,a);
if(a==".")
break;
for(int i=0;i<a.size();i++){
if(a[i]=='('||a[i]==')'||a[i]=='['||a[i]==']'){
b[count]=a[i];
count++;
}
}
int check;
while(true){
check=count;
... | 1 | 918,606 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> h(n);
rep(i, n) cin >> h[i];
const int inf = 1e9+7;
vector<int> dp(n + 2, inf);
dp[0] = 0;
rep(i, n) {
dp[i+1] = min(dp[i+... | #include <iostream>
#include <algorithm>
#include <queue>
#define rep(i,n) for (int i=0; i < (n); ++i)
using ll = long long ;
using namespace std;
const int INF = 1001001001;
const int MOD = 1e9+7;
int dp[110000] ;
int main() {
int n ;
cin >> n ;
int h[n+1];
rep(i,n) cin >> h[i] ;
dp[0] = 0 ;
fo... | 1 | 3,429,961 |
#include <bits/stdc++.h>
#define DEBUG fprintf(stderr, "Passing [%s] line %d\n", __FUNCTION__, __LINE__)
#define File(x) freopen(x".in","r",stdin); freopen(x".out","w",stdout)
using namespace std;
typedef long long LL;
typedef pair <int, int> PII;
typedef pair <int, PII> PIII;
template <typename T>
inline T gi()
{
T f... | #include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> x(4,0);
for(int i=0;i<3;i++){
int a,b;
cin>>a>>b;
a--;b--;
x.at(a)++;
x.at(b)++;
}
bool flag=true;
for(int i=0;i<4;i++){
if(x.at(i)==3){
flag=false;
}
}
if(flag){
cout<<"YES"<<endl;
}else{
cou... | 1 | 29,471,511 |
#include<bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
using namespace std;
long long N, K;
long long h[505];
int main(){
cin >> N >> K;
long long h;
long long num = 0;
rep(i, N) {
cin >> h;
if(h >= K) num++;
}
cout << num << endl;
} | #include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define allr(a) a.rbegin(), a.rend()
#define rev(v) reverse(v.begin(), v.end());
#define io() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); srand(time(NULL));
#define check cout<<"?\n";
using namespace std;
typedef long long ll;
typedef long double... | 1 | 28,939,347 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define MOD 1000000007
#define mod9 1000000009
#define fast ios_base :: sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define mp make_pair
#define pb push_back
#define ct ll t;cin>>t;while(t-... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i )
using namespace std;
typedef long long ll;
int main(){
int N;cin >> N;
vector<int> num_list(N);
int count = 0;
int min = 0;
rep(i,N){
int tmp;
cin >> tmp;
num_list.push_back(tmp);
if (count == 0){... | 1 | 99,572,709 |
#include <bits/stdc++.h>
#define pb emplace_back
#define ll long long
#define fi first
#define se second
#define mp make_pair
using namespace std;
const int N = int(3e5) + 7;
const int logN = 17;
const int mod = int(1e9) + 7;
typedef pair<int, int> pii;
int p[N][logN + 1], x... | #include <bits/stdc++.h>
int n, L, Q, lg;
std::vector <int> a;
std::vector <std::pair<int,int>> query;
std::vector <std::vector<int>> reach;
int main () {
std::cin >> n;
a.resize (n+1);
for (int i = 1; i <= n; ++i)
std::cin >> a[i];
std::cin >> L >> Q;
query.resize (Q);
for (int i = 0; i < Q; ++i)
std::cin >>... | 1 | 84,721,464 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N;
cin>>N;
vector<int> A(N+2);
vector<long long> sum(N+2,0);
for(int i=1; i<=N; i++) cin>>A[i];
A[0] = A[N+1] = 0;
for(int i=1; i<=N+1; i++){
sum[i] = sum[i-1]+abs(A[i]-A[i-1]);
}
for(int i=1; i<=N; i++){
... | #include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for(ll i = (k); i < (n); i++)
#define FORe(i, k, n) for(ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for(ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for(ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre(i, ... | 1 | 22,664,704 |
#include <iostream>
#include <string>
using namespace std;
int main()
{
string str;
while(getline(cin, str))
{
if(str == "-"){ break; }
string buf;
getline(cin, buf);
int n = stoi(buf);
for(int i = 0; i < n; i++)
{
getline(cin, buf);
in... | #include <bits/stdc++.h>
using namespace std;
void solve(string &str, int m, vector<int> h);
int main()
{
while (1)
{
string str;
cin >> str;
if (str == "-") break;
int m = 0;
cin >> m;
vector<int> h(m, 0);
for (int i = 0; i < m; i++)
{
... | 1 | 61,776,489 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int a[n+5]={0};
for(int i=1;i<=n;i++){
cin>>a[i];
}
long long ans=1000;
for(int i=1;i<n;i++){
if(a[i]<a[i+1]){
ans+=(ans/a[i])*(a[i+1]-a[i]);
}
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,arr[100];
int main(){
cin >> n;
for(int i=0;i<n;i++) cin >> arr[i];
ll ans = 1000,s=0;
for(int i=0;i<n-1;i++){
if(arr[i] < arr[i+1]){
s += ans/arr[i];
ans = ans%arr[i];
}else if(arr[i] > arr[i+1]){
ans += arr[i] * s;
s = 0... | 1 | 9,265,607 |
#include <bits/stdc++.h>
#include <functional>
#include<stdio.h>
using namespace std;
#define ll long long int
#define dd long double
#define pb push_back
#define pf push_front
#define pi pair<ll,ll>
#define vi vector<ll>
#define vpi vector<pi>
#define mi ... | #include <array>
#include <functional>
#include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
std::vector<std::vector<int>> G(N);
for (int i = 0; i < N - 1; ++i) {
int x, y;
std::cin >> x >> y;
x--, y--;
G[x].push_back(y);
G[y].push_back(x);
}
int mod = 1000000007;
st... | 1 | 96,020,597 |
#include <stdio.h>
int main(){
int n,a[10001],temp,low=10001;
for(int i=0;i<10001;i++){
a[i]=0;
}
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&temp);
if(temp<low)low=temp;
a[temp]++;
}
printf("%d",low);
a[low]--;
for(int i=0;i<10001;i++){
while(a[i]>0){
a[i]--;
printf(" %d",i);
}
}
printf("\... | #include <bits/stdc++.h>
using namespace std;
int n,a[2000001],freq[100100];
void countingsort(int a[]){
for(int i=1;i<=n;i++){
freq[a[i]]++;
}
int idx=0;
for(int i=0;i<=10000;i++){
for(int j=1;j<=freq[i];j++){
idx++;
a[idx]=i;
}
}
}
int main(){
ci... | 1 | 13,360,882 |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a),i##formax=(b);i< i##formax;i++)
#define FORR(i,a,b) for(int i=(a),i##formin=(b);i>=i##formin;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz... | #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... | 1 | 74,086,561 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for(int (i)=0; (i) < (n); (i)++)
int main()
{
ll H, W; cin >> H >> W;
vector<string> S(H, "");
rep(i,H) {
cin >> S[i];
}
vector<string> S2;
rep(i, H) {
bool allw = true;
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define irep(i, n) fo... | 1 | 83,885,125 |
#include "bits/stdc++.h"
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define len(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define test int _; cin >> _; while(_--)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
const... | #include<bits/stdc++.h>
using namespace std;
typedef long long int li;
typedef long double ld;
typedef vector<li> vi;
typedef pair<li,li> pi;
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define B begin()
#define E end()
#define f(i,l,r) for(li i=l;i<=r;++i)
#define fr(i,l,r) for(li i=l;i>... | 1 | 52,126,785 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int cmp(int a,int b){
return a<b;
}
int main(){
int n,k;cin>>n>>k;
int niz[n];
for(auto &a:niz)
cin>>a;
sort(niz,niz+n,cmp);
ll rj=0;
for(int i=0;i<k;i++){
rj+=niz[i];
}
cout <<rj<<endl;
} | #include<iostream>
using namespace std;
#include <vector>
#include <algorithm>
int main(){
int n,k; cin >> n >> k;
vector<int> p(n);
for(int i=0; i<n; i++) cin >> p[i];
sort(p.begin(),p.end());
int ans = 0;
for(int i=0; i<k; i++) ans += p[i];
cout << ans << endl;
} | 1 | 7,891,959 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> P;
int INF = 1e9+7;
int mod = 1e9+7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
string S;
int K;
cin >> S >> K;
for(int i = 0; i < K; i++) {
if(S[i] != '1') {
cout << ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
string S;
ll K;
cin >> S >> K;
rep(i, S.size()) {
if (S[i] != '1') {
cout << S[i] << "\n";
return 0;
}
if (K == i + 1) {
... | 1 | 55,074,986 |
#include <bits/stdc++.h>
using namespace std;
typedef pair <int, int> pii;
const int N = 8003;
string s;
int x, y;
vector <pii> a, b;
bool can[N][2 * N];
void make(string s, vector <pii> &a, vector <pii> &b) {
try {
a.clear(); b.clear();
int cnt = 0, flip = 0;
s += 'T';
for (auto x: ... | #include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define maxn 16005
int n,m;
bool f[maxn],g[maxn],tmp[maxn];
char s[maxn];
inline int read(){
int x=0,f=1; char ch=getchar();
for (;ch<'0'||ch>'9';ch=getchar()) if (ch=='-') f=-1;
for (;ch>='0'&&ch<='9';ch=g... | 1 | 59,530,728 |
#include <iostream>
using namespace std;
int main(){
int n,k,ans=1,tmp_a,tmp_b;
cin>>n>>k;
for(int i=0;i<n;i++){
tmp_a=2*ans;
tmp_b=ans+k;
if(tmp_a<tmp_b)
ans=tmp_a;
else
ans=tmp_b;
}
cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
using ll = long long;
using P = pair<int, int>;
int main() {
int n,k;
cin >> n >> k;
int ans = 1;
rep(i,n) {
int bai = ans*2;
int plu = ans+k;
if (bai <= plu) ans *= 2;
else ans += k;
}
cout << ans << end... | 1 | 19,363,764 |
#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,H,W;
cin>>N>>H>>W;
vector<int>A(N);
vector<int>B(N);
int ans=0;
rep(i,N){
cin>>A.at(i)>>B.at(i);
if(A.at(i)>=H&&B.at(i)>=W){
ans++;
}
}
cout<<ans<<endl;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int gcd(int a, int b) {
return b != 0 ? gcd(b, a % b) : a;
}
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
main() {
int n,a,b,ans=0;
cin >> n >> a >> b;
for(int i=0;i<n;i++){
int aa,bb;
cin >> aa >> bb;
if(aa>=a&&bb>=b)ans++;
... | 1 | 3,313,124 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main() {
LL N, A, B;
cin >> N >> A >> B;
if (N < A + B - 1 || N > A * B) {
cout << -1 << endl;
return 0;
}
bool maked = false;
for (int i = 1; i <= B; i++) {
int remain = N - A * i;
if (remain < 0) continue;
int leng... | #pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<l... | 1 | 76,773,247 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define REP(i,n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define vout(x) rep(i,x.size()) cout << x[i] << " "
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return 1;}return... | #include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
sort(s.begin(), s.end());
bool ans = s == "abc";
cout << (ans? "Yes" : "No") << endl;
} | 1 | 98,292,912 |
#include <iostream>
using namespace std;
int ct, n, s;
void sum(int m, int i, int n){
if (n == 0 && m == s){
ct++;
return;
}
if (n == 0 || i == 10) return;
sum(m, i + 1, n);
sum(m + i, i + 1, n - 1);
}
int main()
{
while (cin >> n >> s, n){
ct = 0;
sum(0, 0, n);
cout << ct << endl;
}
... | #include<bits/stdc++.h>
using namespace std;
int serch(int i,int j,int n)
{
if(!n&&!j)return 1;
else if(i==10||!n)return 0;
return serch(i+1,j-i,n-1)+serch(i+1,j,n);
}
int main()
{
int n,s;
while(cin>>n>>s&&(n!=0||s!=0))cout<<serch(0,s,n)<<endl;
} | 1 | 71,438,478 |
#include <bits/stdc++.h>
using namespace std;
struct Fast {Fast(){cin.tie(0);ios::sync_with_stdio(0);}} fast;
using intpair = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define int ll
using pint = pair<int, int>;
signed main() {
string s;
cin >> s;
int n = s.size();
string t;
... | 1 | 38,435,616 |
#include <iostream>
#include <algorithm>
#include <vector>
int main()
{
int n, k, sum = 0, tmp;
std::vector<int> l;
std::cin >> n >> k;
for (int i = 0; i < n; i++)
{
std::cin >> tmp;
l.push_back(tmp);
}
std::sort(l.begin(), l.end(), std::greater<int>());
std::vector<int>::iterator itr;
itr = l... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = 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++)
int main() {
int N, K;
cin >> N >> K;
vector<int> vec(N);
rep(i, N) {
cin >> vec.at(i);
}
sort(vec.be... | 1 | 49,859,902 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
typedef long long ll;
int main(){
ll n,a,b; cin>>n>>a>>b;
ll ans=(n-2)*(b-a)+1;
if(ans<0) cout<<0<<endl;
else cout<<ans<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
int main(){
LL N, A, B;
scanf("%lld %lld %lld", &N, &A, &B);
LL ans = max(0LL, (N - 2) * (B - A) + 1);
printf("%lld\n", ans);
return 0;
} | 1 | 21,216,178 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
signed main() {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
const ll M = 1e18;
int si[] = {-1, 0, 1, 0};
int sj[] = {0, -1, 0, 1};
int main(){
int n,k;
cin >> n >> k;
cout << n%k << endl;
return 0;
} | 1 | 26,557,409 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e18;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define int ll
using pint = pair<int, int>;
signed main() {
int n;
cin >> n;
int h[n];
rep (i, 0, n) cin >> h[i]... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> h(n);
for(int i=0;i<n;++i) cin>>h[i];
int x,count,sum=0;
int ans=0;
while(ans<n){
count=0;
x=0;
ans=0;
for(int i=0;i<n;++i){
if(x==0 && h[i]>0) ++count;
x=h[i];
if(h[i]>0) --h[i];
e... | 1 | 441,994 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
cout << fixed << setprecision(cout.precision()) << sqrt(pow(abs(x1 - x2), 2) + pow(abs(y1 - y2), 2)) << endl;
return 0;
} | #include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
long double distance(long double x1, long double y1, long double x2, long double y2);
int main () {
long double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
long double d;
d = distance(x1, y1, x2, y2);
cout << fixed;
co... | 1 | 43,700,630 |
#include <bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long
#define pii make_pair
int ceil(int a, int b) { if(a%b==0) return a/b; else return a/b+1; }
bool checkbit(int pos, int mask) { return mask&(1<<pos); }
int turnon(int pos, int mask) { retur... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
long long MOD = 1000000000 + 7;
int main(){
cout << setprecision(10);
string S;
cin >> S;
int N = S.size();
int K;
cin >> K;
vector<vector<ll>> dp1(N, vector<ll>(K+1, 0));
vector<vector<ll>> dp2(N, vector<ll>(... | 1 | 72,126,881 |
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <map>
#include <vector>
#include <math.h>
#include <algorithm>
#include <queue>
#include <set>
#include <tuple>
using namespace std;
#define FOR(i,init,a) for(int i=init; i<a; i++)
#define rep(i,a) FOR(i,0,a)
#define rrep(i,a) for(int i=a; i>=0; i--)
#... | #include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = long long;
using std::cout;
using std::endl;
using std::cin;
template<typename T>
std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
return std::vector<declt... | 1 | 92,514,164 |
#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;
ll a[n];
ll freq[200001]={0};
for(i=0;i<n;i++)
{
cin>>a[i];
freq[a[... | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define Rep(i,s,f) for(int i=(int)s;i<(int)f;i++)
using ll=long long;
using namespace std;
int main()
{
int N;
cin>>N;
map<int,ll> m;
vector<int> A(N);
rep(i,N)
{
cin>>A[i];
m[A[i]]++;
}
ll ans=0;
for(auto p : m)
{
ans+=p.second*(p.secon... | 1 | 9,545,407 |
#pragma GCC optimize(2)
#include<bits/stdc++.h>
#define ll long long
#define maxn 2005
#define inf 1e9
#define eps 1e-10
using namespace std;
inline ll read()
{
ll x=0,w=1; char c=getchar();
while(c<'0'||c>'9') {if(c=='-') w=-1; c=getchar();}
while(c<='9'&&c>='0') {x=(x<<1)+(x<<3)+c-'0'; c=getchar();}
return w==1?x... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1000000007;
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
int main() {
int n, m;
cin >> n >> m;
ll s[n], t[m];
rep(i, n) { cin >> s[i]; }
rep(j, m) { cin >> t[j]; }
ll dp[n + 1][m ... | 1 | 57,709,139 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <deque>
#include <queue>
#include <array>
#include <set>
#include <map>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cstdint>
#include <ca... | #include<iostream>
#include<algorithm>
using namespace std;
long long N,A,B,ans;
int main(void){
cin>>N;
long long cuisine[N];
for(int i=0;i<N;i++){cin>>A>>B;cuisine[i]=A+B;ans+=A;}
sort(cuisine,cuisine+N,std::greater<long long>());
for(int i=1;i<N;i+=2){ans-=cuisine[i];}
cout<<ans<<endl;
re... | 1 | 39,593,408 |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <cassert>
using namespace std;
#define GET_ARG(a,b,c,F,...) F
#define REP3(i,s,e) for (i = s; i <= e; i++)
#define REP2(i,n) REP3 (i,0,(int)(n)-1)
#define REP(...) GET_ARG (__VA_ARGS__,R... | #include<bits/stdc++.h>
#define r(i,n) for(int i=0;i<n;i++)
#define mk make_pair
using namespace std;
int dx[]={0,0,1,-1},dy[]={1,-1,0,0};
int main(){
int h,w,n,sum=0,x1,y1;
cin>>h>>w>>n;
string s[h];
for(int i=0;i<h;i++)cin>>s[i];
r(i,h)r(j,w)if(s[i][j]=='S')y1=i,x1=j;
for(int o=1;o<=n;o++){
int used[h... | 1 | 71,772,508 |
#include<bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(long long i=(l);i<(r);++i)
#define REP(i,n) FOR(i,0,n)
#define REPS(i,n) FOR(i,1,n+1)
#define RFOR(i,l,r) for(long long i=(l);i>=(r);--i)
#define RREP(i,n) RFOR(i,n-1,0)
#define RREPS(i,n) RFOR(i,n,1)
#define int long long
#define mp make_pair
#define ... | #include "bits/stdc++.h"
using namespace std;
using ll=long long;
#define print(n) cout<<n<<endl
int M=100111;
int mod=1000000007;
int main(){string l;cin>>l;ll top=1,below=0;int n=l.size();for(int i=0;i<n;i++){if(l[i]=='1'){below=(3*below+top)%mod;top=2*top%mod;}else below=3*below%mod;}cout<<(top+below)%mod<<endl;;} | 1 | 75,671,037 |
#include <bits/stdc++.h>
using namespace std;
int a[60], b[60], c[60], d[60];
int main() {
int N, M;
cin >> N >> M;
for (int i = 0; i < N; i++) cin >> a[i] >> b[i];
for (int i = 0; i < M; i++) cin >> c[i] >> d[i];
for (int i = 0; i < N; i++) {
int minDist = 1001001001, ans = 0;
for (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
vector<int> a(n), b(n), x(m), y(m);
for (int i = 0; i < n; i++) cin >> a[i] >> b[i];
for (int i = 0; i < m; i++) cin >> ... | 1 | 83,871,587 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=(0);i<(n);i++)
using namespace std;
typedef long long ll;
int bit(int x, int n){
return (x >> n) & 1;
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<int> A(N);
vector<ll> B(N);
rep(i, N) cin >> A[i] >> B[i];
int l = 32... | #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... | 1 | 79,837,846 |
#include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_AS... | #include <iostream>
#include <algorithm>
int main () {
int n, k, x=0;
std::cin >> n >> k;
int a, check[200000] ={0};
for(int i = 0; i < n; i++){
std::cin >> a;
check[a] += 1;
}
for(int i = 0; i < 200000; ++i){
if(check[i] != 0) ++x;
}
std::sort(check, check + 2000... | 1 | 28,373,996 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int GetDigitsCount(int targetNumber, int baseNumber=10) {
int digitsCount = 0;
while (targetNumber != 0) {
digitsCount++;
targetNumber /= baseNumber;
}
return digitsCount;
}
int main() {
int n, c; cin >> n;
int ans = 0;
for (int i = 1; i <= ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define ull unsigned ll
#define all(x) x.begin(), x.end()
typedef tree<ll, null_type, less_equal<ll>, rb_tree_tag,
tree_order_statistics_no... | 1 | 9,192,871 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
#define rrep(i,n) for(int i = (n)-1; i >= 0; i--)
#define rep1(i,n) for(int i = 1; i <= (n); i++)
#define rrep1(i,n) for(int i = (n); i > 0; i--)
#define ll long long
#define pi pair<int, int>
#define pll pair<ll, ll>
#define MOD 1000000007
#define I... | #include <bits/stdc++.h>
#define long long long int
using namespace std;
int main() {
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<string> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
vector<vector<int>> d(n, vector<int>(m));
d[0][0] = a[0][0] == '#';
for (int i = 0; i ... | 1 | 30,817,643 |
#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;
string s;
cin >> N >> s;
bool is = true;
rep(i, N-1) if(s[i] != s[i+1]) is = false;
if(is){
cout << 1 << endl;
return 0;
}
int ans = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long int n,m,i=0,j,p[200010],min=1000000,ans=0;
string s;
cin >> n >> s;
ans=n;
s=s+'A';
for(i=0;i<n;i++)
{
if(s[i]==s[i+1])
{
ans--;
}
}
cout << ans << endl;
return 0;
} | 1 | 97,154,583 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int h1,m1,h2,m2,k;
cin >> h1 >> m1 >> h2 >> m2 >> k;
int hour_diff = h2-h1;
int min_diff = m2-m1;
int total = hour_diff*60+min_diff-k;
cout << total <<endl;
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#define ll long long int
#define mod 1000000007
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
int t;
if(a == c)
... | 1 | 63,766,923 |
#include <bits/stdc++.h>
#define INF 2e9
#define MOD 1000000007
#define MOD9 998244353
#define intMAX 51000;
#define PI 3.14159265359
using namespace std;
typedef long long llong;
typedef long double ldouble;
using Graph = vector<vector<int>>;
int main(){
int s;
cin >> s;
int count = 1;
if(s==2 || s==1){
s=4;
c... | #include <bits/stdc++.h>
using namespace std;
int C[1000001], s, i;
int main()
{cin >> s; while (++i, !C[s]++) s = s % 2 ? 3 * s + 1 : s / 2;
cout << i;} | 1 | 3,466,291 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) v.begin(),v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
const int INF=1e9;
const int di[] = {-1,0,1,0};
const int dj[] = {0,-1,0,1};
int main(){
string s;
cin>>s;
int ans=(... | #include<bits/stdc++.h>
#define INF (int)1e9
#define EPS 1e-9
#define MOD 1000000007ll
#define PI 3.14159
#define fio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define REP(i, a, b) \
for (int i = int(a); i <= int(b); i++)
#define TRvi(c, it) \
for (vi::iterator it = (c).begin(); it != (c).end();... | 1 | 13,275,328 |
#include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<ll,ll> P;
const ll mod=1000000007;
const ll LINF=1LL<<60;
const ll INF... | #pragma GCC optimize("trapv")
#include<bits/stdc++.h>
#define pb push_back
#define all(x) x.begin(), x.end()
using namespace std;
using vi = vector<int>;
using ll = long long;
const int maxn = 1<<20, mod = 924844033;
int n;
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n;
vi a(n);
for(auto &i : a) cin >> i;
... | 1 | 84,645,035 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 200000 + 10;
int n; char s[N];
int main() {
scanf("%s",s+1);
int c=0;n=strlen(s+1);
for(int i=1;i<=n;i++){
if(s[i]=='o')c++;
}
c+=15-n;
printf("%s\n", c>=8?"YES":"NO");
} | #include<iostream>
#include<string>
using namespace std;
int main() {
string buff;
getline(cin, buff);
int win = 0;
for (int i = 0; i < buff.length(); ++i) {
if (buff[i] == 'o') {
++win;
}
}
cout << (win + (15 - buff.length()) >= 8 ? "YES" : "NO") << endl;
} | 1 | 54,173,728 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
#define all(x) (x).begin(),(x).end()
using ll = long long;
string char_to_string(char val) {
return string(1, val);
}
int char_to_int(char val) {
return val - '0';
}
template<class T> inline bool chmin(T& a, T b... | #include <iostream>
#include <cmath>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
int main(){
int n;
cin >> n;
int maxh = 0;
int ans = 0;
rep(i, n){
int h;
cin >> h;
if (h >= maxh){
ans++;
maxh = h;
}
}
cout << ans << endl;
return 0;
} | 1 | 62,985,565 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int H, W, i;
string row, output;
while (true) {
row = "";
output = "";
cin >> H >> W;
if (H == 0 && W == 0)break;
for (i = 0; i < W; i++) row += '#';
row += '\n';
for (i = 0; i < H; i++)output += row;
cout << output << endl;
}
} | #include <iostream>
using namespace std;
int main ()
{
int x, y;
while ((cin >> x >> y), x, y)
{
for (int i=1; i<=x; i++)
{
for (int j=1; j<=y; j++)
{
cout << "#";
if (j==y) cout << endl;
}
}
cout << endl;
}
return 0;
} | 1 | 84,124,856 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (y > x) swap(x,y);
if (y == 0) return x;
else return gcd(y, x % y);
}
int main(void){
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
int ans = gcd(a[0],a[1]);
for... | #include <bits/stdc++.h>
#define rep(i, n) for(int i= 0; i < (n); i++)
using ll= long long int;
using namespace std;
ll mod= 1e9 + 7;
int main() {
int n;
cin >>n;
int a[n];
rep(i,n)cin >>a[i];
int ans=a[0];
for(int i=1;i<n;i++){
ans=__gcd(ans,a[i]);
}
cout << ans << endl;
} | 1 | 77,159,666 |
#include <iostream>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <list>
#include <set>
#include <unordered_set>
#include <vector>
#include <utility>
#include <algorithm>
#include <queue>
#include <cstdint>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace st... | #include <bits/stdc++.h>
typedef long long int ll;
using namespace std;
#define mod 1000000007
ll ruijou (ll a, ll n) {
if (n == 0) return 1;
if (n % 2) {
return a * ruijou(a, n - 1) % mod;
}
else {
ll k = ruijou(a, n/2);
return k * k % mod;
}
}
int main() {
string l;
... | 1 | 19,364,677 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<int> B(*max_element(A.begin(), A.end()) + 1, 0);
for (int a : A) {
for (int b = a; b < (int)B.size(); b += ... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define all(v) v.begin(),v.end()
#define repf(i,a,b) for(ll i=a;i<b;i++)
#define repb(i,a,b) for(ll i=a;i>=b;i--)
#def... | 1 | 62,398,485 |
#include <algorithm>
#include <iostream>
#include <stdio.h>
using namespace std;
#define INFTY (1 << 30)
#define MAX 2000000
int N = 0;
int left(int i) { return i * 2; }
int right(int i) { return i * 2 + 1; }
int parent(int i) { return i / 2; }
int maxOf3Node(int data[], int base) {
int l = left(base);
int r = righ... | #include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;
const ld eps=1e-9;
int main() {
priority_queue<int>que;
while (1) {
string st; cin >> st;
if (st == "end")break;
... | 1 | 5,143,572 |
#include <iostream>
#include <array>
#include <algorithm>
int main(){
std::array<int, 5> num;
while(std::cin >> num[0] >> num[1] >> num[2] >> num[3] >> num[4]){
sort(num.begin(), num.end(), std::greater<int>());
std::cout << num[0] <<" "<< num[1] << " " << num[2] <<" "<< num[3] << " " << num[4] << std::endl;
}
... | #include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <string>
#include <map>
#include <functional>
#include <cmath>
#include <cstdio>
using namespace std;
int main(){
vector<int> a(5);
for(int i = 0; i < 5; i++){
cin >> a[i];
}
sort(a.begin(), a.end(), greater<int>());
for(... | 1 | 37,861,828 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.