code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <bits/stdc++.h>
using namespace std;
long long a[100010],n,sisi1,sisi2;
int main() {
cin>>n;
for(int i=1;i<=n;i++) {
cin>>a[i];
}
sort(a+1,a+n+1);
for(int i=n;i>=2;i--) {
if(a[i]==a[i-1]) {
sisi1=i;
break;
}
}
for(int i=sisi1-2;i>=2;i--) {
if(a[i]==a[i-1]) {
sisi2=i;
break;
}
}
cout<<a[sisi1]*a[si... | #include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<queue>
#include<cmath>
#include<algorithm>
#include<iomanip>
#include<functional>
#include<set>
#include<map>
#include<utility>
#define ul unsigned long long int
#define ll long long int
#define MAX 1000000+1
using namespace std;
#define F f... | 1 | 29,921,029 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ar array
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_upda... | #include<iostream>
#include <vector>
using namespace std;
#define ll long long
const ll MOD = 1e9+7;
int main(){
ll n;
cin >> n;
vector<ll> a(n);
for(ll i = 0; i < n; i++){
cin >> a[i];
}
ll ans = 0;
for(ll i = 0; i < 61; i++){
ll x = 0, y = 0;
for(ll j = 0; j < n; j+... | 1 | 53,770,834 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for(int i = n-1; i >= 0; i--)
#define all(x) (x).begin(),(x).end()
#define rall(v) (v).rbegin(), (v).rend()
#define FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ... | #include<iostream>
#include<algorithm>
#include<cmath>
#include<map>
#include<stdio.h>
#include<vector>
#include<queue>
using namespace std;
#define int long long
#define double long double
#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;
#define sc(s) string s;cin>>s;
#de... | 1 | 35,331,224 |
#include <iostream>
using namespace std;
int main(){
int N, A, B, C, X;
while(cin >> N >> A >> B >> C >> X, N+A+B+C+X){
int Y[N], time = -1, ran = X;
for(int i = 0; i < N; ++i){
cin >> Y[i];
}
int j = 0;
while(time <= 10000 && j != N){
++time;
if(ran == Y[j]) ++j;
ran = (A * ran + B) % C;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<P,P> PP;
const ll MOD = 1000000007;
const int IINF = INT_MAX;
const ll LLINF = LLONG_MAX;
const int MAX_N = int(1e5 + 5);
const double EPS = 1e-10;
const int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};
#define REP... | 1 | 36,818,332 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1e9 + 7;
#define rep1(i, n) for (ll i=0; i<(n); i++)
#define rep2(i, k, n) for (ll i=k; i<(n); i++)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> i... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using vll = vector<ll> ;
#define all(v) v.begin(),v.end()
#define MAX_V 210
int d[MAX_V][MAX_V];
int N;
int main(){
int N,M,R;cin>>N>>M>>R;
vector<int> r(R);rep(i,R){cin>>r[i];r[i]--;}
rep(i,N)r... | 1 | 100,761,976 |
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i,a,n) for(ll i = a;i < n;i++)
#define rrep(i,a,n) for(ll i = n; i >= a;i--)
#define LINF (ll)1e18
#define INF (int)1e9
#define ll_1e9 (ll)1e9
using namespace std;
int main(){
ll n,cnt = 0;
cin >> n;
ll memo = 0,a = 0;
rep(i,0,n){
cin >> a;
cnt ... | #include <iostream>
#include <vector>
#include <climits>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <bitset>
#include <utility>
#include <numeric>
#include <queue>
#include <stack>
using ll = long long;
using namespace std;
constexpr int MOD = 1e9 + 7;
constexpr ll MO... | 1 | 52,035,681 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
cin >> N;
int JPY=0;
int64_t BTC=0;
double x;
string u;
for(int i=0; i<N; i++){
cin >> x >> u;
if(u=="JPY"){
JPY+=(int)x;
}
else{
BTC+=(int64_t)(x*100000000);
}
}
double BTCd;
BTCd=BTC*380000;
BTCd/=100... | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <string>
#include <numeric>
#include <math.h>
using namespace std;
void func()
{
int N;
cin >> N;
double JPY = 0, BTC = 0;
for (int i = 0; i < N; ++i)
{
string S;
double money;
cin >> money >> S;
if (S == "JPY")
JPY += mo... | 1 | 91,997,806 |
#include <bits/stdc++.h>
#include <algorithm>
#define rep(i,n) for(int i=0;i<(n);++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
const int mod =1e+9+7;
const int dy[4]={0,1,0,-1};
const int dx[4]={1,0,-1,0};
const ll INF=1e10;
int main(){
ll n;... | #include <iostream>
#include <vector>
int main() {
int64_t N;
std::cin >> N;
std::vector<int64_t> count(N + 1, 0);
for (int64_t i = 1; i < N + 1; ++i) {
for (int64_t j = i; j < N + 1; j += i) {
count[j] += 1;
}
}
int64_t ans = 0;
for (int64_t i = 1; i < N + 1; ++i... | 1 | 24,832,989 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
using namespace std;
struct Node{
int key;
Node *prev;
Node *next;
};
Node *head;
Node *listSearch(int key){
Node *cur = head->next;
while(cur != head && cur->key != key){
cu... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <cstdlib>
using namespace std;
class bilist{
long a[2000001];
long L, R;
public:
bilist(){ L = 0, R = -1; }
long size(){
return R - L + 1;
}
void insert(long x){
a[++R] = x;
}
void deleteFirst... | 1 | 63,738,082 |
#include<bits/stdc++.h>
using namespace std;
set<string> dic;
int main()
{
int n;
string s1,s2;
cin >> n;
for(int i=0;i<n;i++){
cin >> s1 >> s2;
if(s1.length() == 6){
dic.insert(s2);
}else{
set<string>::iterator it = dic.find(s2);
if(it == dic.end()){
cout << "no" << "\n";
}else{
cout << "... | #include <iostream>
#include <cstdio>
#include <cstring>
#define M 1046527
#define NIL (-1)
#define L 14
char H[M][L];
int getint(char ch) {
if (ch == 'A') return 1;
else if (ch == 'C') return 2;
else if (ch == 'G') return 3;
else if (ch == 'T') return 4;
else return 0;
}
long long getkey(char str[]) {
long long ... | 1 | 100,393,374 |
#include <iostream>
#include <string>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cctype>
#include <cstdlib>
#define rep(i,a,b) for(int i=(a);i<b;i++)
#define INF 1000000000
using namespace std;
bool debug=false;
int main(){
int n,m,p;
while(1){
... | #include <iostream>
#include <algorithm>
using namespace std;
int main(){
while(true){
int n;
int m;
int p;
cin >> n >> m >> p;
if(n==0 && m == 0 && p == 0){
break;
}
int allcnt = 0;
int viccnt = 0;
for(int i=0;i<n;i++){
int num;
cin >> num;
allcnt += num;
if(i+1 == m){
viccnt += n... | 1 | 46,773,949 |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
typedef unsigned long long int ull;
typedef pair<ll,ll> P;
template<class T> using V=vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
const ll mod=1000000007;
ll gcd(ll a... | #include <iostream>
using namespace std;
int main(){
char buf[40];
int kld[]={1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,1,1,1,1,0,1,1,1,0,1};
int bi,wasleftk,kccnt;
while (1){
cin >> buf;
if (buf[0]=='#')break;
bi=0;
wasleftk=2;
kccnt=-1;
while (buf[bi]!='\0'){
if (kld[buf[bi]-'a']!=wasleftk... | 1 | 100,305,364 |
#include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep1(i, n) for(int i = 1; i <= (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
ll n;
cin>>n;
ll num[n];
ll sumn=0;
rep(i, n){
cin>>num[i];
sumn+=num[i];}
ll dis[n... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
#define rep(i,n) for (ll i=0;i<n;++i)
#define rep2(i,a,b) for (ll i=a;i<b;++i)
const ll MOD=1000000007;
template<class T> inline bool chmin(T &a,T b){
if (a>b){
a=b;
return true;
... | 1 | 99,186,871 |
#include<cstdio>
using ll = long long;
const static int MOD = 1000000007;
int main(){
int n, m;
scanf("%d %d", &n, &m);
ll x = 0;
for (int i = 0; i < n; ++i){
ll tmp;
scanf("%lld", &tmp);
x += tmp*(i*2 - (n - 1));
}
x %= MOD;
ll y = 0;
for (int i = 0; i < m; ++i){
ll tmp;
scanf("%lld", &tmp);
y += t... | #include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=1000000007;
signed main(){
int n,m,x1,y1;
cin>>n>>m>>x1;
int ans1=0,ans2=0;
for(int i=0;i<n-1;i++){
int x2;
cin>>x2;
ans1=(ans1+(x2-x1)*(i+1)%mod*(n-1-i)%mod)%mod;
x1=x2;
}
cin>>y1;
for(int i=0;i<m-1;i++){
... | 1 | 67,713,944 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int n,k;
vector<int> l;
vector<int> r;
int ans = 1;
void input(){
cin >> n >> k;
}
void solve(){
rep(i,n){
if (ans+k <= ans*2){
ans += k;
} else {
ans *= 2;
}
}
... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define invrepr(i,a,b) for(int i=b-1;i>=a;i--)
#define invrep(i,n) invrepr(i,0,n)
#define repitr(itr,a) for(auto itr=a.begin();itr!=a.end();++itr)
#define P pair<int,ll>
con... | 1 | 61,687,384 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
long long int n,a,i,sum=0,sum1=0,l,s=0,dif,mx;
vector<int>v;
cin>>n;
for(i=0;i<n;i++)
{cin>>a;
v.push_back(a);
s+=a;
}
for(int i=n-1;i>=1;i--)
{
s-=v[i];
sum+=v[i];
dif=abs(s-sum);
... | #include <bits/stdc++.h>
#define N 200020
#define ll long long
using namespace std;
inline ll read(){
ll x=0,f=1;char ch=getchar();
while(ch>'9'||ch<'0')ch=='-'&&(f=0)||(ch=getchar());
while(ch<='9'&&ch>='0')x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
return f?x:-x;
}
ll a[N], sum, ans = 1ll << 60;
int main(int argc, char... | 1 | 25,638,332 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
int n,... | #include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <random>
#include <chrono>
#include <queue>
#include <math.h>
#include <string>
#include <sstream>
#include <stack>
#include <deque>
#define pb push_back
#define make ... | 1 | 19,577,587 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1000000007;
const int IINF = INT_MAX;
const ll LLINF = LLONG_MAX;
const ll MAX_N = ll(1e5 + 5);
const double EPS = 1e-10;
const int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};
#define REP(i, n) for (int i = 0; i <... | #include <iostream>
int min(int x,int y){
if(x>y){
return y;
}else{
return x;
}
}
int main(){
int n;
int t[100002],a[100002],da[100002];
std::cin >> n;
for(int i=0;i<n;i++){
std::cin >> t[i];
}
for(int i=0;i<n;i++){
std::cin >> a[i];
da[i]=-1;
}
da[0]=t[0];
for(int i=1;i<n;i++){
if(t[i]!=t[i-1])... | 1 | 65,220,808 |
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#if defined(ENABLE_PRINT)
#define Print(v) \
do {\
cout << #v << ": " << v << endl; \
}while(0)
#defin... | #include <bits/stdc++.h>
using namespace std;
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl
#define rep(i, n) for (int i = (int)(0); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define dump(v) \
cerr << #v ":[ "; ... | 1 | 7,964,560 |
#include<iostream>
#include<algorithm>
#define N 2
using namespace std;
void output_array_int(int*,int,char);
void input_array_int(int*,int);
int main(){
int a,b,c,i,s;
s=0;
cin>>a>>b>>c;
for(i=a;i<=b;i++){
if(c%i==0){
s++;
}
}
cout<<s<<endl;
return 0;
}
void output_array_int(int * a,int n,c... | #include <iostream>
using namespace std;
int main(){
int st,en,num,cnt=0;
cin>>st>>en>>num;
for(int i=st;i<=en;i++){
if(num%i);
else cnt++;
}
cout<<cnt<<endl;
return 0;
} | 1 | 18,529,780 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int n;
cin>>n;
string s , t;
cin>>s>>t;
ll ans =2*n;
for(int i=0;i<n;i++)
{
int len = n -i;
string temp = t.substr( 0 , len);
string temp2 = s.substr( i ,len);
if( temp == temp2 )
{
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, i;
string s, t;
cin >> N >> s >> t;
for (i = N; i; --i)
if (equal(begin(s) + N - i, end(s), begin(t))) break;
cout << 2 * N - i << endl;
return 0;
} | 1 | 11,038,011 |
#include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <list>
#include <iterator>
#pragma warning(disable:4996)
typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a,... | #include <bits/stdc++.h>
typedef long long int LL;
typedef unsigned long long int ULL;
using namespace std;
LL a[100005];
LL b[100005];
LL hb (LL num)
{
if (!num)
return 0;
int ret = 0;
while (num >>= 1)
ret ++;
return ret;
}
int main() {
LL n, k;
cin >> n >> k;
for (int i = ... | 1 | 93,824,921 |
#include <cstdio>
#include <cstring>
#define mx 200005
char S[mx],T[mx];
int main(){
scanf("%s",S);
scanf("%s",T);
int ans=0;
for(int i=0;i<strlen(S);i++)
ans+=(S[i]!=T[i]);
printf("%d\n",ans);
} | #include <algorithm>
#include <iostream>
#include <string>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
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 all(a) begin((a)),end((a))
#define uniq(c) ... | 1 | 93,512,314 |
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<iostream>
using namespace std;
long long a[5005];
int main()
{
int n;
long long k;
cin>>n>>k;
for (int i=1;i<=n;i++)
{
cin>>a[i];
}
sort(a+1,a+1+n);
int ans=n;
long long sum=0;
for (int i=n;i>... | #include <iostream>
#include <vector>
#include <algorithm>
#include <bitset>
using namespace std;
int N, K;
vector<long> a;
bitset<5005> dp;
bool C(long i) {
dp >>= 5005;
dp[0] = true;
for(int j = 0; j < N; ++j) {
if(i == j) continue;
for(int k = K; k >= a[j]; --k) {
dp[k] = dp[k... | 1 | 85,806,368 |
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define vl vector
#define ff first
#define ss second
using namespace std;
int main()
{
ll a,b,i,j,n,t;
cin>>n;
n--;
a=n*(n+1);
a/=2;
cout<<a;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define si set<int>
#define mii map<int,int>
#define pb push_back
#define pf push_front
#define pii pair<int,int>
#define extract_word(s) stringstream str(s); while(str>>word)
#define fastio ios_base::sync_with_stdio(false);cin.t... | 1 | 90,470,573 |
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(long long i=0;i<n;i++)
#define REP1(i,n) for(long long i=1;i<=n;i++)
#define REP2D(i,j,h,w) for(long long i=0;i<h;i++) for(long long j=0;j<w;j++)
#define REP2D1(i,j,h,w) for(long long i=1;i<=h;i++) for(long long j=1;j<=w;j++)
#define PER(i,n) for(long lo... | #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;
#define REP(i,m,n) for... | 1 | 39,032,591 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define fastIO ios_base::sync_with_stdio(false);cin.tie(NULL);
#define vl vector<ll>
#define N 100005
#define mod 1000000007
ll lcm(ll a,ll b)
{
return a/__gcd(a,b)*b;
}
int main()
{... | #include <iostream>
using namespace std;
long long gcd(long long a, long long b){
while(a%b>0){
long long g = a%b;
a = b;
b = g;
}
return b;
}
int main() {
int n;
cin>>n;
long long num;
long long multi=1;
for (int i=0; i<n; i++){
cin >> num;
long long g = gcd(multi,num);
multi = multi/g*num;
}
cou... | 1 | 70,032,278 |
#include<bits/stdc++.h>
using namespace std;
template <typename T>
inline T read(){
T x=0,f=1;char c=getchar();
while(!isdigit(c)){ if(c=='-') f=-f;c=getchar();}
while(isdigit(c)){x=(x<<3)+(x<<1)+(c-48);c=getchar();}
return x*f;
}
#define lint long long int
#define ulint unsigned lint
#define readint read<int>()
#d... | using namespace std;
#include <bits/stdc++.h>
#define frr(i, r, l) for(int i = r; i >= l; --i)
#define fr(i, l, r) for(int i = l; i < r; ++i)
#define forit(it, type, var) for(type::iterator it = var.begin(); it != var.end(); it++)
#define ii pair<int, int>
#define iii pair<int, ii>
#define MEMS(a,b) memset(a,b,sizeof(a... | 1 | 9,551,729 |
#include <stdio.h>
#include <math.h>
#define pi 3.14159265358979
int main(void) {
double a, b, c, d, s;
scanf("%lf%lf%lf", &a, &b, &c);
c = c / 180 * pi;
d = sqrt(a * a + b * b - 2 * a * b * cos(c));
s = a * b / 2 * sin(c);
printf("%f\n%f\n%f\n", s, a + b + d, s * 2 / a);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
cout<<fixed<<setprecision(12);
double a, b, C, c, S, L, h, rad;
cin>>a>>b>>C;
rad = C / 180 * acos(-1);
S = (a * b * sin(rad)) / 2;
c = sqrt(a * a + b * b -2 * a * b * cos(rad));
L = a + b + c;
h = 2 * S / a;
cout<<S<<endl<<L<<endl<<h<<endl;
return 0;
... | 1 | 60,807,792 |
#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>
#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair
using namespace std;
typedef long lon... | #include <iostream>
#include <set>
#include <vector>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int main(){
int d[2]={0},t;
rep(i,2) rep(j,4)cin >> t , d[i] += t;
cout << max(d[0],d[1]) << endl;
} | 1 | 53,805,959 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<set>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
signed main(){
ll n,ans,a;
set<ll> st;
cin >> n;
for(int i=0;i<n;i++){
cin >> a;
st.insert(a);
}
ans = st.size();
if(ans%2==0... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
map<int, int> mp;
rep(i, n){
int a;
... | 1 | 34,879,402 |
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
string s;
cin >> s;
int cnt0 = 0;
int cnt1 = 0;
re... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string> ... | 1 | 63,185,870 |
#include<bits/stdc++.h>
#define int long long
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define repa(i, s, n) for(int i = s; i < (int)n; i++)
#define MOD 1000000007
using namespace std;
using ll = long long;
typedef vector<int> vi;
typedef pair<int, int> P;
#define rrep(i,a,b) for(int i=a;i>=b;i--)
template<cla... | #include <iostream>
#include <string>
using namespace std;
int n, a[200200], c[200200]; long long r;
int main()
{
cin >> n;
for (int i = 0; i < n; i++){
cin >> a[i];
r += c[a[i]]++;
}
for (int i = 0; i < n; i++){
r -= --c[a[i]];
cout << r << endl;
r += c[a[i]]++;
}
return 0;
} | 1 | 55,593,981 |
#include <bits/stdc++.h>
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define codefor int test;scanf("%d",&test);while(test--)
#define yn(ans) cout<<(ans?"Yes":"No")<<endl
#define YN(ans) cout<<(ans?"YES":"NO")<<endl
#define umap unordered_map
#define... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef complex<double> P;
int A[2000000];
int B[2000000];
int C[10001] = {0};
int k = 0;
int n;
void counting_sort() {
for (int i = 0; i < n; i++) {
C[A[i]]++;
}
for (int i = 1; i <= k; i++) {
C[i] += C[i-1];
}
for (int i = n-1; i >= ... | 1 | 77,301,911 |
#include<bits/stdc++.h>
using namespace std;
int N, K;
int main() {
int a;
cin >> N >> K;
int sum = 0;
for (int i=0; i<K; i++) {
cin >> a;
sum += a;
}
sum >= N ? cout << "Yes\n" : cout << "No\n";
return 0;
} | #include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main(){
int h, n, a;
int b = 0;
cin >> h >> n;
rep (i,n){
cin >> a;
b = b + a;
}
if (b >= h){
cout << "Yes... | 1 | 27,972,957 |
#include<stdio.h>
#include<iostream>
#include<string.h>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<functional>
using namespace std;
int main(){
char s[50],t[50];
vector<int>ques(50);
scanf("%s",s);
scanf(" %s",t);
int slen,tlen;
slen=strlen(s);
tlen=strlen(t);
i... | #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<vector>
#include<utility>
#include<queue>
#include<deque>
#include<stack>
#include<set>
#include<map>
#include<bitset>
#include<string>
#define rep(i,n,m) for(int i=(n);i<(int)(m);i++)
#define reps(i,n,m) for(int i=(n);i<=(int)(m);i++)
#de... | 1 | 88,512,129 |
#include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) =... | #include<bits/stdc++.h>
using namespace std;
#include<math.h>
#define ll long long
#define ld long double
#define Summon_Tourist ios::sync_with_stdio(false);cin.tie(0);
ll gcd(ll a , ll b) { return b==0?a: gcd( b, a%b); }
ll lcm(ll a , ll b) { return a/gcd(a,b) * b ; }
ll inf = 1e9 + 7;
ll modexp( ll base ,ll power)
{... | 1 | 84,884,398 |
#include <iostream>
using namespace std;
int f_func(int x){
int ans=0;
while(x>0){
ans+=x%10;
x/=10;
}
return ans;
}
int main(){
int n;
cin>>n;
if(n%f_func(n)==0)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
} | #include <bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define ALL(a) (a).begin(),(a).end()
using namespace std;
using ll = long long;
const double PI = 3.14159265358979;
void solve()
{
int n;
cin >> n;
int sum = 0;
int tmp = n;
while(tmp > 0)
... | 1 | 78,730,419 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> x(n);
for(int i=0;i<n;i++){
cin>>x[i];
}
int sum=1000000;
for(int i=1;i<=100;i++){
int tmp=0;
for(int j=0;j<n;j++){
tmp+=(x[j]-i)*(x[j]-i);
}
sum=min(sum,tm... | #include <bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define INF 2e18
#define eps 1e-9
#define FastRead ios_base::sync_with_stdio(0);cin.tie(0)
#define fRead freopen("input.txt","r",stdin)
#define fWrite freopen("output.txt","w",stdout)
#defi... | 1 | 39,116,179 |
#include <iostream>
using namespace std;
int main(int argc, char **argv)
{
long int min=0, max=0, sum=0;
int temp;
int n;
cin>>n;
for(int i =0;i<n;i++){
cin>>temp;
if(i==0){
min = temp;
max = temp;
}
sum+=temp;
if(temp<min){
mi... | #include<iostream>
using namespace std;
#include<stdio.h>
int main(){
int n;
scanf("%d\n", &n);
int i = 0;
int x, min, max;
long sum;
min = 1000000;
max = - 1000000;
sum = 0;
while (i <= n){
if(i == n){
printf("%d %d %ld\n", min, max, sum);
break;}... | 1 | 76,061,647 |
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(false);
string s; cin >> s;
reverse(s.begin(), s.end());
int n_s = s.size();
string t; cin >> t;
reverse(t.begin(), t.end());
int n_t = t.size();
bool ok = false;
int n = n_... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
bool restore = false;
for (int i = s.size() - t.size(); i >= 0; i--)
{
bool replace = true;
for (int j = 0; j < t.size(); j++)
{
if (s[i + j] != '?' && s[i + j] != t[j])
... | 1 | 35,913,171 |
#include <bits/stdc++.h>
#include <string>
#define ft first
#define sc second
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) (a)=max(a, b);
#define chmin(a, b) (a)=min(a, b);
#define moC(a, s, b) (a)=((a)s(b)+MOD)%MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
static const ll INF=1e18... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
const long long INF = 1LL << 60;
const int MOD = 1000000007;
signed ... | 1 | 62,764,197 |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
const int INF = 1<<10;
int H, W, N;
char field[1010][1010];
int dx[4] = {0,0,1,-1}, dy[4] = {1,-1,0,0};
int vt[1010][1010];
int sx, sy;
int cnt = 0;
int bfs() {
for (int i = 1; i <= N; i++) {
queue<P> q;
for (int y = 0; y < H; y++)
... | #include<iostream>
#include<queue>
#include<cstdio>
#include<cstring>
#include<utility>
using namespace std;
struct dir
{
int x,y;
}dir[4]={{-1,0},{1,0},{0,-1},{0,1}};
char hole[1005][1005];
int d[1005][1005],h,w,factory[10][2];
typedef pair<int,int> P;
int bfs(const int &sx,const int &sy,const int &gx,const int &gy)
... | 1 | 48,139,823 |
#include<iostream>
using namespace std;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int d,t,s; cin>>d>>t>>s;
if(d<=t*s) cout << "Yes\n";
else cout << "No\n";
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int d, t, s;
cin >> d >> t >> s;
if (s * t >= d) cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
} | 1 | 58,823,013 |
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, ans, t, l;
string s, mcxi = "mcxi";
cin >> n;
for (int i = 0; i < n; ++i) {
ans = 0;
for (int k = 0; k < 2; ++k) {
cin >> s;
l = s.size();
t = 1;
for (int j = 0; j < l; ++j) {
if (s[j] == 'm') {
t ... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
... | 1 | 15,112,461 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main(){
int n,k;
cin>>n>>k;
vector<int> d(k);
vector<vector<int>> a(k, vector<int>(n));
rep(i,k){
cin>>d[i];
rep(j,d[i]) cin>>a[i][j];
}
int ans=n;
for(int... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i, a, b) for(int i = a; i < b; i++)
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define pb push_back
#define debug(x... | 1 | 56,898,517 |
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < n; i++)
#d... | #include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using ll = long long;
using namespace std;
using P = pair<int,int>;
int main(){
int n;
string s;
cin >> n >> s;
int ans = 0;
for(int i = 0; i < n - 1; i++){
if(s[i] != s[i + 1]) ++ans;
}
ans++;
cout << ans << endl;
r... | 1 | 95,066,672 |
#include<bits/stdc++.h>
using namespace std;
int n,a[10000];
int main(){
while(true){
cin>>n;if(n==0)break;for(int i=0;i<n;i++)cin>>a[i];
sort(a,a+n);int minx=1000000;
for(int i=0;i<n-1;i++){
minx=min(minx,a[i+1]-a[i]);
}
cout<<minx<<endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define INF 1e9
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
while(1){
int n;
cin>>n;
if(n==0)break;
vector<int> a(n);
for(int i=0;i<n;i++)cin>>a[i];
sort(a.begin(),a.end());
int ans=INF;
... | 1 | 84,602,246 |
#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, ... | #include <iostream>
using namespace std;
int main(){
int n;
cin >> n;
int A[n], B[n];
for(int i = 0; i < n; i++){
cin >> A[i];
}
B[0] = 0; B[1] = abs(A[1] - A[0]);
for(int i = 2; i < n; i++){
int one = abs(A[i] - A[i-1]), two = abs(A[i] - A[i-2]);
B[i] = min(B[i-1]... | 1 | 43,807,210 |
#include<bits/stdc++.h>
#define ll long long
#define pp pair<ll,ll>
#define mod 1000000007
#define trace(x) cerr<<#x<<": "<<x<<" "<<endl
#define trace2(x, y) cerr<<#x<<": "<<x<<" | "<<#y<<": "<<y<<endl
#define trace3(x, y, z) cerr<<#x<<":" <<x<<" | "<<#y<<": "<<y<<" | "<<#z<<": "<<z<<endl
#define sa(a,n) for(int i =0 ;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
map<ll,ll>m;
const int N = 2e5;
ll sum[N+100];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,k;
ll ans = 0;
cin >> n >> k;
m[0] = 1;
for(ll i=1;i<=n;i++){
ll a;
cin >> a;
sum[i] = (sum[i-1]+a)%k;
ans += (m[(sum[i]-(i... | 1 | 79,773,030 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
int32_t main()
{
string o,e;
cin>>o>>e;
int n=o.length()+e.length();
string ans="";
for(int i=0;i<n;i++)
{
if(i&1)
{
ans+=e[i/2];
}
else ans+=o[i/2];
}
cout<<ans;
} | #include <iostream>
#include <iomanip>
#include <string>
#include <algorithm>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main()
{
string o, b;
cin >> o >> b;
int n = min(o.size(), b.size());
repi(i, ... | 1 | 8,342,166 |
#include <iterator>
#include <algorithm>
#include <iostream>
#include <unordered_set>
#include <vector>
#include <sstream>
#include <iomanip>
using namespace std;
int main(int argc, char **argv) {
int A, B, K;
cin >> A >> B >> K;
int i = max(A, B);
int k = 0;
while (true) {
if (A % i == 0 && B % i == 0) {... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int a,b,k;
cin >> a >>b >> k;
int cnt = 0;
int ans;
for(int i = 100; i >=1 ;i--){
if(a%i ==0 && b%i == 0) cnt++;
if(cnt == k) {
ans = i;
break;
}
}
cou... | 1 | 7,063,878 |
#include<bits/stdc++.h>
#define rep(i,a) for(int i=(int)0;i<(int)a;++i)
#define rrep(i,a) for(int i=(int)a-1;i>=0;--i)
#define REP(i,a,b) for(int i=(int)a;i<(int)b;++i)
#define RREP(i,a,b) for(int i=(int)a-1;i>=b;--i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin... | #include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
int N;
typedef long long LL;
const int maxn = 55;
LL a[maxn];
int main(){
while(cin >> N){
for(int i = 1;i <= N;i++){
scanf("%lld", &a[i]);
}
LL ans = 0;
while(true){
... | 1 | 19,742,220 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin>>S;
unordered_set<int> A;
for(char c:S)
A.insert(c);
for(char c='a';(int)c<='z';c=(char)((int)c+1))
if(!A.count(c)){
cout<<c<<endl;
return 0;
}
cout<<"None"<<endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repn(i,n) for(int i = 0; i <= (int)(n); i++)
#define srep(i,l,n) for(int i = l; i < (int)(n); i++)
#define srepn(i,l,... | 1 | 471,077 |
#include <iostream>
#include <algorithm>
#include <utility>
using namespace std;
char board[23 * 23];
int way[4] = { -1,1,-23,23 };
int gCount;
void solve(int pos) {
gCount++;
board[pos] = '#';
for (int i = 0; i < 4; i++)
if (board[pos + way[i]] == '.')
solve(pos + way[i]);
}
int main() {
cin.tie(0);
ios::s... | #include<iostream>
using namespace std;
typedef pair<int, int> pii;
pii dxdy[]={{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
char fld[21][21];
bool used[20][20];
int W, H;
int rec(int i, int j){
if(fld[i][j]=='#') return 0;
if(used[i][j]) return 0;
used[i][j]=true;
int ret=0;
for(pii dd: dxdy){
int ni=i+dd.f... | 1 | 6,344,093 |
#include <iostream>
#include <algorithm>
using namespace std;
typedef pair<int, int> P;
const int M = 1<<18;
int main(){
int m_idx[M], m2_idx[M];
m_idx[0] = 0;
m2_idx[0] = -1;
int N;
cin >> N;
int A[M];
for(int i = 0; i < (1<<N); i++){
cin >> A[i];
}
for(int i = 1; i < (1<<N)... | #include <stdio.h>
#include <algorithm>
#include <vector>
#include <set>
using namespace std;
vector<int> C[1<<18];
int N,A[1<<18],R[1<<18];
int main()
{
scanf ("%d",&N);
for (int i=0;i<(1<<N);i++){
scanf ("%d",&A[i]);
set<int> chk;
chk.insert(i);
for (int j=0;j<N;j++) if (i & (1 << j)){
for (auto x : C[i-... | 1 | 96,957,723 |
#include<cstdio>
#include<algorithm>
using namespace std;
bool solve(){
int a,b,n;
int map[16][16];
scanf("%d %d",&a,&b);
if(a==0&&b==0) return 0;
fill(map[0],map[0]+256,0);
scanf("%d",&n);
for(int i=0;i<n;i++){
int x,y;
scanf("%d %d",&x,&y);
map[--x][--y] = -1;
}
map[0][0] = 1;
for(int ... | #include <iostream>
#include <vector>
int main(){
int a,b;
int x,y;
int n;
while(std::cin >> a >> b){
if(a == 0 && b == 0)
break;
std::cin >> n;
std::vector<std::vector<int>> cor(b+1,std::vector<int>(a+1,0));
std::vector<std::vector<int>> pro(b+1,std::vector<i... | 1 | 61,686,045 |
#include<iostream>
using namespace std;
#define MAX 1000000
bool prime[MAX];
int countPrime(int n){
if(n < 2) return 0;
if(n == 2) return 1;
int ret = 0;
for(int i = 0; i < MAX; i++){
prime[i] = true;
}
for(int i = 2; i * i <= n; i++){
if(prime[i]){
for(int j = i*i; j <= n; j += i){
prime[j] = false;
... | #include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#define MAXN 999999
using namespace std;
bool is_prime[MAXN];
int prime[MAXN];
int main()
{
int p=0;
for(int i=0;i<=MAXN;i++) is_prime[i]=true;
is_prime[0]=is_prime[1]=false;
for(int i=2;i<=MAXN;i... | 1 | 94,207,424 |
#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | #include <iostream>
#include <string>
using namespace std;
typedef long long ll;
int main() {
ll k, l, cnt, a[100], ans = 0LL;
string s;
cin >> s >> k;
l = s.length();
cnt = 0LL;
for (int i = 0; i < l; i++) {
if (s[i] == s[0]) {
cnt++;
}
}
if (cnt == l) {
cout << l * k / 2LL << endl;
... | 1 | 75,810,952 |
#include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<functional>
#include<string>
#include<iomanip>
#include<map>
#include<utility>
#include<string>
#include<unordered_map>
#include<queue>
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
tem... | #include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(int i=0; i<(int) n; i++)
using namespace std;
typedef long long ll;
int main() {
int n;
string s, t;
cin >> n >> s >> t;
int acc = n * 2;
for (int i = n; i >= 0; i--) {
string si = s.substr(s.length() - i, i);
... | 1 | 57,433,952 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll,ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i,m,n) for(ll (i)=(m),(i_len)=(n);(i)<(i_len);++(i))
#define FORR(i,v) for(auto (i):v... | #include <iostream>
#include <string>
#include <map>
using namespace std;
int main() {
string S, T;
cin >> S >> T;
bool flag = true;
map<char,char> A, iA;
for (int i = 0; i < S.size(); ++i) {
char s = S[i], t = T[i];
if (A.count(s) && A[s] != t) flag = false;
if (iA.count(t) ... | 1 | 68,348,117 |
#include <iostream>
#include <vector>
using namespace std;
struct UnionFind
{
vector<int> parent;
UnionFind(int n) : parent(n) {
for(int i = 0; i < n; i++) parent[i] = i;
}
int root(int x){
return x == parent[x] ? x : (parent[x] = root(parent[x]));
}
void unite(int x, int y){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int N = 1e5 +... | 1 | 83,188,707 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
#define MOD 10000000... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define fsp(x) cout << fixed << setprecision(x)
const ll inf = LLONG_MAX;
const long double pi = M_PI;
void Yes() {cout << "Yes" << endl;}
void No() {cout << "No" << endl;}... | 1 | 58,428,096 |
#include <iostream>
#include <vector>
#include <string>
#include <cstdlib>
#include<algorithm>
#include <iomanip>
#include <math.h>
#include <cctype>
#define db double
#define vi vector<int>
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ld long double
#define maxn 5005
#define mo... | #include <bits/stdc++.h>
using namespace std;
#define Hello ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
#define ll long long
int main(){
Hello
int a, b, k, ans = 0;
cin >> a >> b >> k;
for(int i = 200; i >= 1; i--){
if(a % i == 0 && b % i == 0){
ans ++;
... | 1 | 37,860,697 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
const ll mod=1000000007;
const int MAX_N = 1000;
double nCk(int n, int k) {
double res=1.0;
for(int i=0; i<n; i++){
res*=0.5;}
for(int i=0; i<k; i++){
res*=(double)(n-i);
res/=(double)(k-i);
}
return res;}
int... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n,k; cin >> n >> k;
vector<pair<ll,ll>> a(n);
for(int i = 0; i < n; i++) {
int x,y; cin >> x >> y;
pair<ll,ll> p(x,y);
a.at(i)=p;
}
sort(a.begin(),a.end());
for(ll i = 0; i < n; i++) {
... | 1 | 98,932,838 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-10;
int ii() { int x; if (sca... | #include <bits/stdc++.h>
using namespace std;
int main()
{
int a;
cin>>a;
queue <long long> bfs;
for (long long i=1;i<10;i++)
bfs.push(i);
while (!bfs.empty())
{
long long now=bfs.front();
bfs.pop();
a--;
if (!a)
{
cout<<now<<endl;
return 0;
}
if (now%10==9)
{
bfs.push(now*10+now%10-1);... | 1 | 1,884,504 |
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
int n,a,now=2;
long long ans=0;
scanf("%d%d",&n,&a);
ans+=a-1;
for(int i=1;i<n;i++)
{
scanf("%d",&a);
if(a>now)
ans+=(a-1)/now;
else if(a==now)
now++;
}
printf("%lld",ans);
... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <assert.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair... | 1 | 43,803,408 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define irep(i, n) for (int i = (n); i >= 0; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = 1 << 30;
int main() {
ll a, b;
cin >> a>> b;
ll c = __gcd(a,b);
ll ans = a * b / c;
cout << ans << end... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair<int,int>
#define fi first
#define sc second
#define all(x) (x).begin(),(x).end()
void MAIN() {
int a, b;
cin >> a >> b;
cout << a / __gcd(a, b) * b << '\n';
}
signed main() {
ios::sync_with_stdio(0); cin.tie(0);
int T = 1;
w... | 1 | 28,744,529 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
#define pb push_back
#define ff first
#define ss second
#define all(s) (s).begin(), (s).end()
const ll mod = 1e9 + 7;
ll binpow(ll x, ll y)
{
ll res = 1... | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>
#include <stack>
#include <queue>
#include <functional>
#include <set>
#include <map>
#include <tuple>
#include <bitset>
#include <random>
#define REP(i,n) for(int i=0;i<n;i++)
#define INF 1000000007
using namespace std;
using... | 1 | 70,196,572 |
#include <iostream>
#include <vector>
using namespace std;
using ll = long long int;
int main() {
ll N;
cin >> N;
vector<ll> V(1e5+1);
for (int i = 0; i < N; i++) {
ll bi;
cin >> bi;
V[bi] += 1;
}
ll cur = 0;
for (int i = 1; i <= 1e5; i++) {
cur += V[i];
V[i] = cur;
}
if (N % 2 == 1... | #include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <utility>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
typedef pair<int, int> pair;
int main(){
int k; cin >> k;
... | 1 | 74,720,333 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
ll H, W;
vector<string> maze;
ll w_dist[2010][2010];
ll h_dist[2010][2010];
int main() {
cin >> H >> W;
maze.resize(... | #include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64... | 1 | 17,974,985 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll solve(ll a, ll n)
{
ll s = 1;
while(n) s = s * ((n % 2) ? a : 1) % 1000000007, a = a * a % 1000000007, n >>= 1;
return s;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, k;
cin >> n >> k;
ll... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
const ll inf=1LL<<61;
ll mpow(ll x, ll n) {
ll ans=1;
while(n>0) {
if(n&1) {
ans=ans*x%mod;
}
x=x*x%mod;
n>>=1;
}
return ans;
}
i... | 1 | 39,239,575 |
#include <cstdlib>
#include <iostream>
using namespace std;
#if 1
char query(string s) {
cout << "? " << s << endl;
char c;
cin >> c;
return c;
}
void answer(string s) {
cout << "! " << s << endl;
}
#else
int ans = -1;
string ans_str;
char query(string s) {
if (ans == -1) cin >> ans;
ans_str... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int keta = -1;
for (int i = 1, x = 10; i < 10; i++) {
cout << "? " << x << endl;
char ans;
cin >> ans;
if (ans == 'N') {
keta = i;
break;
}
x *= 10;
}
if (keta == -1) {
ll ... | 1 | 17,268,219 |
#include <bits/stdc++.h>
using namespace std;
bool check(int i, string s) {
string num = to_string(i);
while (num.size() < 3) num = '0' + num;
int idx = 0;
for (int j=0; j<s.size(); j++) {
if (idx == 3) return true;
if (num[idx] == s[j]) {
idx++;
}
}
return id... | #include<iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
using P = pair<int,int>;
char tolower(char c) {return (c + 0x20);}
char toupr(char c) {return (c - 0x20);}
int main()
{
int n; cin >> n;
string s; cin >> s;
int ans = 0;
for(char ... | 1 | 67,331,579 |
#include <iostream>
#include <algorithm>
#include <math.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <utility>
#include <iomanip>
using namespace std;
using ll = long long;
#define rep(i,a,b) for(int i=(a); i<(b); i++)
#define YES cout << "YES" << endl;
#define NO cout << "NO" << en... | #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... | 1 | 13,553,594 |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N = (int)1e5 + 5;
const int A = 60;
ll n, a[N], cnt[A], basis[A];
void init() {
cin >> n;
for(int i = 0 ; i < n ; ++i) {
cin >> a[i];
for(int j = 0 ; j < A ; ++j) if((1LL << j) & a[i]) cnt[j]++;
}
}
void solve() {
ll ans = 0;
... | #include <assert.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <bitset>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#pragma warning(disable : 4996... | 1 | 41,839,533 |
#include<bits/stdc++.h>
using namespace std;
int arra[10001];
int main()
{
int n,temp,j,mini;
scanf("%d",&n);
int ara[n];
for(int i=0;i<n;i++)
{
scanf("%d",&ara[i]);
arra[ara[i]]++;
}
int frst=1;
for(int i=0;i<10001;i++)
{
if(arra[i]!=0)
{
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef complex<double> P;
int A[2000000];
int B[2000000];
int C[10001] = {0};
int k = 0;
int n;
void counting_sort() {
for (int i = 0; i < n; i++) {
C[A[i]]++;
}
for (int i = 1; i <= k; i++) {
C[i] += C[i-1];
}
for (int i = n-1; i >= ... | 1 | 99,916,649 |
#include <bits/stdc++.h>
using namespace std;
int main(){
long N;
cin >> N;
long A[N], cnt[N+1];
long ans = 0;
for(long i=0;i<N+1;i++){
cnt[i] = 0;
}
for(long i=0;i<N;i++){
cin >> A[i];
cnt[A[i]]++;
}
for(long j=0;j<N+1;j++){
ans += cnt[j] * (cnt[j] - 1) / 2;
}
for(long i=0;i<N;i++){
long tmp = ans... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
vector<ll> cnt(n, 0);
rep(i, n) {
cin >> a[i];
a[i]--;
cnt[a[i]]++;
}
ll sum = 0;
r... | 1 | 73,389,935 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define IN freopen("in.txt","r",stdin)
#define OUT freopen("out.txt","w",stdout)
#define pi pair<int,int>
#define F first
#define S second
#define pb push_back
#define pp pop_back
#define mod 1000000007
#define pai acos(-1)
#define N 100005
int ar[N][3]... | #include<bits/stdc++.h>
#define int ll
#define M 1000000007
#define hell 998244353
#define inf 1e18
#define pb push_back
#define pi 3.1415926536
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define all(a) a.begin(),a.end()
#define ll long long
#defin... | 1 | 10,527,656 |
#include <iostream>
using namespace std;
inline int selectionSort(int a[], int n) {
int sw = 0;
for (int i = 0; i < n - 1; i++) {
int minj = i;
for (int j = i +1; j < n; j++) {
if (a[j] < a[minj]) {
minj = j;
}
}
if (i != minj) {
swap(a[i], a[minj]);
sw++;
}
}
return sw;
}
int main() {
co... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main(int argc,char* argv[]){
int number,input,index,count=0;
vector<int> values;
cin >> number;
vector<int>::iterator it;
for(int i=0;i<number;i++){
cin >> input;
values.push_back(input);
}
for(int i=0;i<number-1;i++)... | 1 | 93,679,800 |
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#in... | #include "bits/stdc++.h"
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } retu... | 1 | 6,367,459 |
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> vi;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int... | #include<map>
#include<set>
#include<bitset>
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<string>
#include<chrono>
#include<stack>
#include<fstream>
#include<math.h>
#include<list>
#include<complex>
#define REP(i,x,y) for(ll i=x;i<=y;i++)
#define SIZE(a) ll(a.size())... | 1 | 94,577,432 |
#include <iostream>
using namespace std;
int main()
{
unsigned int n, b, f, r = 0;
int v, temp;
unsigned int resident[4][3][10];
string inptn;
int innum;
for (int i = 0; i < 4; i++)
{
for (int j = 0; j < 3; j++)
{
for (int k = 0; k < 10; k++)
{
resident[i][j][k] = 0;
}
}
}
cin >> n;
for (in... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define FOR(i, m, n) for(int i = m; i < n; i++)
int main() {
int n;
cin >> n;
int A[5][4][11] = {};
REP(i, n) {
int b, f, r, v;
cin >> b >> f >> r >> v;
A[b][f][r] += v;
}
FOR(b, 1,... | 1 | 73,679,726 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int count = N;
int answer = K;
for (int i = 1; i < count; i++)
{
answer *= (K-1);
}
cout << answer << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
cin >> N >> K;
if(N==1) cout << K << endl;
else cout << fixed << setprecision(0) << K*pow(K-1,N-1) << endl;
} | 1 | 67,686,507 |
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <bitset>
#include <map>
#include <tuple>
#include <unordered_set>
#include <unordered_map>
#include <list>
#include <numeric>
#include <utility>
#include <iterator>
#include <cstdio>
#i... | #include<bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
#define spa << " " <<
#define test cout<<"test"<<endl;
#define fi first
#define se second
#define rep(i,n,m) for(ll i = n; i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = n - 1; i >= (ll)(m); i--... | 1 | 2,795,418 |
#include<iostream>
using namespace std;
int main(){
int a,b;
char map[300][300];
while(1){
cin>>a>>b;
if(a==0&&b==0){
break;
}
for(int i=0;i<a;i++){
for(int j=0;j<b;j++){
map[j][i]='#';
cout<<map[j][i];
}
cout<<endl;
}
cout<<endl;
}
return(0);
} | #include <iostream>
using namespace std;
int main() {
int h, w;
while(h+w)
{
cin >> h >> w;
for(int i =0; i < h; i++){
for(int j = 0; j < w; j++){
cout << "#";
}
cout << endl;
}
if(h+w)cout << endl;
}
return 0;
} | 1 | 63,966,722 |
#include <bits/stdc++.h>
#include <array>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for(UL i = 0; i < (n); i++)
struct Problem {
void Solve() {
LL a, b, c; cin >> a >> b >> c;
ULL K; cin >> K;
if (K % 2) swap(a, b);
cout << (a - b) << endl... | #include <iostream>
using namespace std;
using int64 = long long;
int main() {
int64 a,b,c,k;
cin >> a >> b >> c >> k;
cout << (k%2? b-a : a-b) << endl;
return 0;
} | 1 | 61,756,650 |
#include <iostream>
#include <cmath>
#include <algorithm>
#include <bitset>
#include <iomanip>
#include <cstdio>
#include <new>
#include <vector>
#include <cstdlib>
#include <string>
#include <set>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b >> c;
int sum = 1;
if (a != b) {
sum++;
}
if (a != c)... | #include<iostream>
#include<cmath>
#include<vector>
#include<climits>
#include<algorithm>
#include<numeric>
#include<iomanip>
#include<map>
#include<set>
#include<random>
#include<cassert>
using namespace std;
#define ll long long int
#define ld long double
const ll Mod = 1000000007;
ll CaseN=1;
const ld PI = 22/7.0;
b... | 1 | 10,865,236 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstring>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <functional>
#include <sstream>
#include <complex>
#include <climits>
using namespace std;
#define REP(i,a,n) for(int i=(a);i<(int)(n);i++)
#define rep... | #include<iostream>
#include <functional>
#include<algorithm>
#include <cmath>
#include <string>
#include <map>
using namespace std;
int main(){
int max=0;
string a;
map<string,int> s;
string x,y;
cin>>a;
s[a]++;
x=y=a;
while(cin>>a){
s[a]++;
if(y.size()<a.size())
y=a;
if(s[a]>max){
max=s[a];
x=a;... | 1 | 69,530,956 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> pint;
signed main()
{
int N; cin>>N;
for(int k=2;k*(k-1)/2<=N;k++){
if(k*(k-1)/2==N){
cout<<"Yes"<<endl;
cout<<k<<endl;
map<pair<int,int>,int> mp;
int id=0;
for(int i=0;i<k;i... | #include <iostream>
#include <algorithm>
#define int long long
using namespace std;
signed main() {
int a[500], l = 2;
for (int i = 2;; i++) {
a[i] = i * (i - 1) / 2;
if (a[i] > 100000)break;
l++;
}
int n; cin >> n;
int flag = 0;
for (int i = 2; i < l; i++) {
if (a[i] == n) { flag = i; break; }
else if ... | 1 | 64,267,695 |
#include<bits/stdc++.h>
#define rep(i,N) for(int i=0;i<(N);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e12;
const int inf = 1e9;
const int mod = 1e9+7;
typedef long long ll;
typedef pair<ll,int> P;
typedef set<int> S;
int main(){
cout <... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define INF 1000000007
#define llINF 1000000000000000007
#define v(i) vector<i>
#define vv(i) vector<vector<i>>
int keta(ll n){int ans=0;while(n>0){n /= 10; ans++;}return ans;}
ll _pow(ll a,ll b){ll ans ... | 1 | 86,607,638 |
#include <iostream>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
int main(){
int r, d, x;
cin >> r >> d >> x;
rep(i, 10){
x = r * x - d;
cout << x << endl;
}
return 0;
} | #include<iostream>
using namespace std;
int main(){
int x[11];
int r, d;
cin >> r >> d >> x[0];
for (int i = 1; i < 11; i++)
{
x[i] = r * x[i - 1] - d;
}
for (int i = 1; i < 11; i++)
{
cout << x[i] << endl;
}
return 0;
} | 1 | 59,269,897 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
cin>>s;
long long int count=0;
for(int i=0; i<s.size()-1; i++){
if(s[i]!=s[i+1]){
count+=1;
}
}
cout<<count<<endl;
} | #include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i, s, n) for (int i = s; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool ch... | 1 | 24,386,605 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll t[200000];
int main() {
int N, T;
cin >> N >> T;
for (int i=0; i<N; i++) {
cin >> t[i];
}
ll ans = 0;
for (int i=0; i<N-1; i++) {
if (t[i+1] - t[i] < T) {
ans += (t[i+1] - t[i]);
} else {
ans += T;
}
}
ans += T;
cout << ans <<... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int,int>;
const int MOD = 1000000007;
int main() {
int n,T;
ll ans=0;
cin>>n>>T;
vector<int> t(n);
rep(i,n) {
cin>>t[i];
}
int before=t[0];
int end=be... | 1 | 71,558,688 |
#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
int b,i;
int sum=0;
char x[1001];
while(1){
cin >> x;
sum = 0;
if(x[0] == '0')break;
for( i=0; x[i] != 0; i++){
b = x[i]-'0';
sum += b;
}
cout << sum << endl;
}
return 0;
} | #include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
int main()
{
while(true){
string S;
cin >> S;
if( S == "0")
break;
int sum = 0;
for(auto& c : S){
sum += c - '0';
}
cout << sum << endl;
... | 1 | 86,157,479 |
#include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#include <complex>
#include <unistd.h>
#include <cassert>
#include <cctype>
#include <ra... | #include<cstdio>
#include<cstdlib>
#include<vector>
#include<algorithm>
using namespace std;
const int MAXN=100005;
void NoSolution()
{
puts("NO");
fclose(stdin);
fclose(stdout);
exit(0);
}
int n,A[MAXN];
vector<int> adj[MAXN];
int dfs(int u,int fa=0)
{
if(adj[u].size()==1U)
return A[u];
long long sum=0;
int t... | 1 | 56,293,592 |
#include <iostream>
#include <vector>
#include <array>
#include <queue>
#include <stack>
#include <map>
#include <string>
#include <climits>
#include <tuple>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cmath>
#include <algorithm>
#include <memory>
#include <iomanip>
#define rep(i, n) for(... | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <cstdio>
#include <cmath>
#include <tuple>
#include <iomanip>
#include <numeric>
#include <unordered_map>
#include <sstream>
#in... | 1 | 43,648,498 |
#include <bits/stdc++.h>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
vector<string> split(const string &s, char delim) {
vector<string> elems;
string item;
for (char ch: s) {
if (ch == delim) {
if (!item.empty()) {
elems.push_back(item);
}
item.clear... | #include <iostream>
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int kmod = 1e9 + 7;
vector<int>par(200006);
vector<int>cap(200006);
int find(int a)
{
if(par[a] == a)
return a;
return par[a] = find(par[a]);
}
int main() {
int n , m;
cin>>n>>m;
for(int i = 0 ;i<= n ;i++)... | 1 | 23,315,163 |
#include<bits/stdc++.h>
using namespace std;
stack<int> st;
int main(){
int n,a,b,x,y,all;
cin >> n >> a >> b;
x = n - a;
y = b - 1;
if(x <= 0 || y <= 0){
if(x == 0 && y == 0) for(int i = 1;i <= n;i++) cout << i << ' ';
else cout << "-1" << endl;
}
else if((x % y == 0 && x / y > a) || (x % y != 0 && x / y + ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(int)(n);++i)
int n,a,b;
bool memo[300001]={true};
signed main() {
scanf("%d%d%d",&n,&a,&b);
if (n > a*b || n < a+b-1) puts("-1");
else {
int now=b,cnt=n;
while(1) {
rep(i,b) {
... | 1 | 23,848,653 |
#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... | #include <bits/stdc++.h>
#define ll long long int
#define yorn(f) cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define put(x) cout << x << endl;... | 1 | 77,052,313 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.