code1 stringlengths 54 12k | code2 stringlengths 65 12k | similar int64 0 1 | __index_level_0__ int64 1 101M |
|---|---|---|---|
#include<bits/stdc++.h>
#include<string>
#include<cmath>
using namespace std;
#define ll long long int
#define loop(i, n) for (int i = 0; i < n; i++)
#define loops(i, s, n) for (int i = s; i < n; i++)
#define pb push_back
#define mp make_pair
#define all(v) v.begin(),v.end()
#define sz(x) ((int)(x).size())
#define fi f... | #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;
template<class T> inline bool chmax(T& a, T b) { if (a < b) ... | 0 | 80,144,787 |
#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 = 1e9 + 7;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int ans = 0;
rep(v, 1000) {
vector<int> a(3);
a[0] = v / 100;
a[1] = v / 10 - (v / 100) * 10;
a[2] ... | #include<math.h>
#include<iomanip>
#include<iostream>
using namespace std;
int main()
{
double x1, x2, y1, y2, d;
cin >> x1 >> y1 >> x2 >> y2;
d = pow((x2 - x1)*(x2 - x1) + (y2 - y1)*(y2 - y1), 0.5);
cout << fixed << setprecision(6) << d << endl;
return 0;
} | 0 | 11,964,778 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll gcd(ll a, ll b) {
while (b) {
ll c = b;
b = a % b;
a = c;
}
return a;
}
ll lcm(ll a, ll b) {
if (!a || !b) return 0;
return a * b / gcd(a, b);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll a, b, c, d;
cin >... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for(ll i=0; i<n; i++)
#define repr(i, s, e) for(ll i=s; i>=e; i--)
#define reps(i, s, e) for(ll i=s; i<=e; i++)
#define inf 1e18
#define all(v) v.begin(),v.end()
#define ceil(a, b) (a+b-1)/b
#define ok cout << "ok" << endl;
#define sp ... | 0 | 19,554,368 |
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define INF 1000000000000000000
typedef pair<ll, ll> pll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s, t; cin ... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int rows,cols;
cin>>rows>>cols;
char input[rows][cols];
int co=1e9+7;
for(int i=0;i<rows;i++)
{
for(int j=0;j<cols;j++)
cin>>input[i][j];
}
int dp[rows][cols];
memset(dp,0,sizeof(dp));
dp[rows-1][cols-1]=1;
for(int i=cols-2;i>=0;i--)
... | 0 | 100,268,070 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int h, w;
cin >> h >> w;
string s[h];
rep(i, h) cin >> s[i];
vector<vector<int>> a(h, vector<int>(w));
rep(i, h) {
int l = 0, r = 0;
rep(j, w) {
if (s[i][j] == ... | 0 | 65,884,503 |
#include <iostream>
using namespace std;
int main()
{
int A , B , C , D;
cin >> A >> B >> C >> D;
if ((A >= B) && (C >= D)) {cout << B + D;}
else if ((A <= B) && (C >= D)) {cout << A + D;}
else if ((A >= B) && (C <= D)) {cout << B + C;}
else if ((A <= B) && (C <= D)) {cout << A + C;}
} | #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... | 0 | 10,298,030 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int maxv = -100, a, b, c;
scanf("%d%d%d", &a, &b, &c);
if((a * 10 + b) + c > maxv)maxv = (a * 10 + b) + c;
if((a * 10 + c) + b > maxv)maxv = (a * 10 + c) + b;
if((b * 10 + a) + c > maxv)maxv = (b * 10 + a) + c;
if((b * 10 + c) + a > maxv... | #include <iostream>
#include <cstdio>
#include <string.h>
#include <algorithm>
#define INF 1000000
int cost[1000][1000];
int d[1000];
bool used[1000];
int n,a,b,c,m;
using namespace std;
void dijkstra(int s){
d[s] = 0;
while(1){
int v = -1;
for(int u = 0 ; u <= m ; u++ ){
if(!used[u] && (v == -1 || d[... | 0 | 18,854,613 |
#include<iostream>
using namespace std;
int main() {
int cnt[10001] = { 0 };
int len;
cin >> len;
int* arr = new int[len+1];
int* narr = new int[len+1];
int max = -1;
for (int i = 1; i < len + 1; i++) {
cin >> arr[i];
if (arr[i] > max)
max = arr[i];
narr[i] = 0;-
cnt[arr[i]]++;
}
for (int i = 1; i <... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
#define int long long
int32_t main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int ans = 0;
int n; cin >> n;
for(int i = 1; i <= n; ++i) {
string a = to_string(i);
if (a.length() % 2 == 1) ++ans;
}
... | 0 | 48,402,091 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")... | #include <iostream>
#include <iomanip>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cstring>
#include <functional>
using namespace std;
typedef long long ll;
typedef ... | 0 | 10,319,784 |
#include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
using ll = int64_t;
using Graph = vector<vector<int> >;
const ll M = 100000000... | #include<bits/stdc++.h>
using namespace std;
int n,ans,maxx;
int a[100005],shu[100005];
int main(){
cin >> n;
for(int i = 1;i <= n;i++){
cin >> a[i];
shu[a[i]]++;
if(a[i] > maxx) maxx = a[i];
}
for(int i = 1;i <= maxx;i++)
if(shu[i] > 1)
ans += shu[i] -... | 0 | 30,117,040 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
while(true){
int N,A,B,C,X;
cin >> N >> A >> B >> C >> X;
if(N==0) break;
vector<int> Y(N);
for(int j=0;j<N;j++) cin >> Y[j];
int ind = 0;
int s=0;
for(int i=0;i<10002;i++){
... | #include<bits/stdc++.h>
#define rep(i,n) for (int i=0; i<n; i++)
#define REP(i,x,n) for (int i=x; i<n; i++)
using namespace std;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
int main(){
int n;
cin >> n;
vi a(n+2);
a.at(0) = 0;
a.at(n+1) = 0;
int sum = 0;
REP(i,1,n+1){
cin >> a... | 0 | 19,272,504 |
#include <bits/stdc++.h>
using namespace std;
#include<math.h>
typedef long long int ll;
int main()
{
ll n, i, temp, z, mx1=0,mx2=0,i1,i2;
scanf("%lld", &n);
ll ara[n];
for(i=0;i<n;i++){
scanf("%lld", &ara[i]);
if(ara[i]>mx1){
mx1 = ara[i];
i1 = i;
}
}... | #include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <vector>
#include <cstdio>
#include <cstring>
#include <sstream>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
#define offcin ios::sync_with_stdio(false)
#define DEBU... | 0 | 78,972,864 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e15;
int dp[55555];
int c[22];
int n, m;
int rec(int money) {
if (money == 0) {
return dp[money] = 0;
}
if (dp[money] != INF) {
return dp[money];
}
int ans = INF;
for (int i = 0; i < m; i++) {
if (money - c[i] <... | #include<bits/stdc++.h>
using namespace std;
const int mod = 7 + (1e+9);
template<long long mod>
class modint{
private:
long long num;
long long extgcd(long long a, long long b, long long&x, long long&y)const {
long long d = a;
if(b != 0){d = extgcd(b, a%b, y, x); y -= (a/b) * x;}
else{x = 1; y = 0;}
... | 0 | 91,755,534 |
#include <bits/stdc++.h>
using namespace std;
int main(){
vector<int> vec(3);
for(int i=0;i<3;i++){
cin >> vec.at(i);
}
stable_sort(vec.begin(),vec.end());
cout << vec.at(2)-vec.at(0) << endl;
} | #include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#include <utility>
#include<vector>
#include<iomanip>
#include<map>
#include <queue>
#include<cmath>
#include<cstdio>
#include<iomanip>
#include<set>
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define REP(i,n) for... | 0 | 9,286,462 |
#include<bits/stdc++.h>
#define ll long long
#define P pair<ll, ll>
using namespace std;
int main(){
int n, m;
cin >> n >> m;
vector<vector<int>>G(n);
vector<int>p(m), y(m);
for(int i=0;i<m;i++){
cin >> p[i] >> y[i];
p[i]--;
G[p[i]].push_back(i);
}
vector<ll>ans(m);
... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define sz(a) ll((a).size())
#define all(a) (a).begin(), (a).end()
#define REP(i,n) for(int i=0;i<(n);++i)
#define REPD(i,n) for(int i=(n)-1;i>=0;--i)
#... | 0 | 35,435,711 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = 1LL << 60;
int gcd(int a, int b) {
if(a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
int main() {
string S;
cin >> S;
int zero_count = count(S.begin(), S.end(), '0');
int one... | #include <bits/stdc++.h>
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
using ll = long long;
using P = pair<int,int>;
using graph = vector<vector<int>>;
const int dx[4] ... | 0 | 4,778,462 |
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
using namespace std;
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define PB push_back
#define MP make_pair
#define F first
#defin... | #include "bits/stdc++.h"
#include <set>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
... | 0 | 72,302,025 |
#include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358979323
#define ll long long int
#define vi vector <int>
#define vl vector <ll>
#define all(v) (v).begin(),(v).end()
#define pb push_back
ll power(ll a, ll b){
ll res=1;
while(b>0){
if(b&1){res=(res*a);b--;}
a=(a*a);
b>... | #pragma GCC optimize("avx2, O3")
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <deque>
#include <map>
#include <fstream>
#include <utility>
#include <stack>
#include <unordered_map>
#include <unord... | 0 | 19,093,497 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, s, e;
cin >> N;
int ans = 0;
for(int i = 0;i<N ; i++) {
cin >> s >> e;
ans += e-s+1;
}
cout << ans << endl;
return 0;
} | #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>
#incl... | 0 | 70,963,683 |
#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>
#incl... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n,m;
cin >> n >> m;
ll a[n];
ll b[n+1];
b[0]=0;
map<ll,ll> mp;
for(ll i=0;i<n;i++){
cin >> a[i];
b[i+1]=b[i]+a[i];
b[i+1]%=m;
}
for(ll i=0;i<=n;i++){
mp[b[i]]++;
}
... | 0 | 46,709,364 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,x,t;
cin>>n>>x>>t;
int a;
if(n%x==0){
a=n/x;
}
else{
a=n/x +1;
}
cout<<a*t<<endl;
} | #include <stdio.h>
int main(){
int a[3][3], c[3][3]={0};
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
scanf("%d", &a[i][j]);
}
}
int N;
scanf("%d", &N);
int b[N];
for(int i=0;i<N;i++){
scanf("%d", &b[i]);
}
for(int k=0;k<N;k++){
for(int i=0;i<3;i++){
for(int j=0;j<3;j++){
if(a[i][j] == b[k]){
... | 0 | 14,517,935 |
#include <stdio.h>
int main(){
char name1[110];
char name2[110];
scanf("%s%s", &name1, &name2);
printf("%s%s", name2, name1);
return 0;
} | #include<bits/stdc++.h>
#define endl '\n';
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
using ll = long long;
using P = pair<int,int>;
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("Ofast")
constexpr ll INF = 1e18;
constexpr int inf = 1e9;
constexpr... | 0 | 24,557,031 |
#include<iostream>
using namespace std;
int main(){
int d,a;
while(cin>>d){
a=0;
for(int i=0;i+d<=600;i+=d)
a+=d*i*i;
cout<<a<<endl;
}
} | #include <iostream>
#include <vector>
using namespace std;
int X[100];
int main() {
int N, M;
double P;
while (cin >> N >> M >> P, N) {
P /= 100;
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> X[i];
sum += 100 * X[i];
}
M--;
if (X[M]... | 0 | 17,955,388 |
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<vector>
#include<functional>
#include<algorithm>
#include<stdlib.h>
#include<string>
#include<string.h>
#define _USE_MATH_DEFINES
#include<math.h>
#include<deque>
#include<set>
#include<map>
#include<queue>
#include<list>
#include<iostream>
#include <bitset>
us... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | 0 | 58,838,896 |
#include<bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i=0, i##_len=(n); i<i##_len; ++i)
typedef long long ll;
#define pb push_back
#define fi first
#define se second
#define ALL(x) (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
template <class T, class U> ostream &operator<<(ostream &os,... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) std::cout << x << '\n'
#define all(a) a.begin(), a.end()
#define r... | 0 | 20,937,558 |
#include<iostream>
using namespace std;
int main(){
int a, b, c, info = 0;
cin >> a >> b >> c;
for (;;){
if (c % a == 0){
info += 1;
}
a += 1;
if (a > b){
break;
}
}
cout << info << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void){
int N;
vector<int64_t> A, B;
int64_t ans=0;
cin >>N;
for(int i=0;i<N+1;i++){
int64_t tmp;
cin >>tmp;
A.push_back(tmp);
}
for(int i=0;i<N;i++){
int64_t tmp;
cin >>tmp;
B.push_back(tmp);
}
for(int i=0;i<N;i++){
if(... | 0 | 63,767,225 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <numeric>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <string>
#include <functional>
#include <list>
#include <random>
#include <time.h>
#include <iomanip>
#include <assert.... | #include <iostream>
#include <fstream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <cstdlib>
#include <cstdio>
#include <string>
#include <cstring>
#include <cassert>
#include <utility>
#include <iomanip>
#include <chrono>
#include <ra... | 0 | 95,971,581 |
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll (i) = 0 ; (i) < (ll)(n) ; ++(i))
#define REPN(i, m, n) for (ll (i) = m ; (i) < (ll)(n) ; ++(i))
#define REP_REV(i, n) for (ll (i) = (ll)(n) - 1 ; (i) >= 0 ; --(i))
#define REPN_REV(i, m, n) for (ll (i) = (ll)(n) - 1 ; (i) >= m ; --(i))
#define INF ... | #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... | 0 | 34,948,780 |
#include <bits/stdc++.h>
#include <functional>
#include <iomanip>
using namespace std;
#define int long long
#define pb push_back
#define F first
#define S second
#define FOR(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define REP(i,n) FOR(i,0,n)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#d... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> bricks(n);
for (int i = 0; i < n; i++) {
cin >> bricks[i];
}
int next_no = 1;
for (int i = 0; i < n; i++) {
if (bricks[i] == next_no) {
next_no++;
}
}
if (next_... | 0 | 33,702,288 |
#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef uns... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";n... | 0 | 45,390,361 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,m,x,y,a,b;
cin >> n >> m >> x >> y;
int MXx = -101,MNy = 101;
for ( int i = 0; i < n; i++){
cin >> a;
MXx = max(MXx,a);
}
for ( int i = 0; i < m; i++){
cin >> b;
MNy = min(MNy,b);
}
for ( int i = x + 1; i <= y; i++){
if... | #include<bits/stdc++.h>
using namespace std;
const int MAXN = 18;
int sum[MAXN+1][1<<MAXN];
int boro[MAXN+1][1<<MAXN];
int main() {
int n;
cin >> n;
for (int i = 0; i < (1<<n); i++) {
cin >> boro[0][i];
sum[0][i] = -1;
}
for (int p = 1; p <= n; p++) {
for (int msk = 0; msk < ... | 0 | 87,771,458 |
#include <iostream>
#include <vector>
using namespace std;
int main(){
int N;
while(cin >> N){
vector<long long> A(N);
long long all = 0;
for(auto& t : A){
cin >> t;
all ^= t;
}
int start = 0;
for(int i=60;i>=0;i--){
if(all&(1LL... | #include <bits/stdc++.h>
#define f(i,j,k) for(int i=j;i<k;i++)
using namespace std;
int main(){
string s;
cin>>s;
bool f=true;
long long ans=0;
if(s[0]!='A'){
f=false;
}
f(i,2,s.size()-1){
if(s[i]=='C'){
ans++;
}
else if(s[i]-'a'<0){
f=... | 0 | 36,196,446 |
#include <bits/stdc++.h>
using namespace std;
#define FasterIO ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define TIME clock()*1.0/CLOCKS_PER_SEC
#define pi acos(-1.0)
#define mem(a,b) memset(a,b,sizeof(a))
#define all(a) a.begin(),a.end()
#define Sort(x) sort(x.begin(),x.end())
#defi... | #include<iostream>
#include<bits/stdc++.h>
#include<math.h>
#include<vector>
#include<string>
#include<cstring>
#include<ctype.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, ... | 0 | 13,969,161 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = n; i <= 999; i++) {
string str = to_string(i);
set<char> st;
for (int i = 0; i < str.size(); i++) {
st.insert(str[i]);
}
if (st.size() == 1) {
cout << i << endl;
break;
}
}
return... | #include <bits/stdc++.h>
using namespace std;
int main(){
int h,w;
cin>>h>>w;
vector<vector<char>> c(h,vector<char>(w));
vector<vector<char>> d(h*2,vector<char>(w));
for(int i=0; i<h; i++){
for(int j=0; j<w; j++){
cin>>c[i][j];
d[i*2][j]=c[i][j];
d[i*2+1][... | 0 | 10,379,360 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef unsigned long long int sll;
typedef double ld;
#define A 1000000007ll
#define D 1000000000ll
#define B 998244353ll
#define C 1000000000000000000ll
#define FAST ios::sync_... | #include <iostream>
#include <fstream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <string.h>
#include <cstring>
#include <math.h>
#include <cmath>
#include <iomanip>
#include <set>
#include <vector>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <nume... | 0 | 29,062,518 |
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
#define repr(i, n) for (ll i = n - 1; i >= 0; --i)
#define INF 10e8
#define MOD 1000000000 + 7
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
usi... | #include<cstdio>
#include<iostream>
using namespace std;
int main(){
for(int i=1; i<10; i++){
for(int j=1; j<10; j++){
cout << i << 'x' << j << '=' << i*j << "\n";
}
}
} | 0 | 16,495,904 |
#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 a, b, x;
cin >> a >> b >> x;
if (x >= a && x <= a + b) cout << "YES" << endl;
else cout << "NO" << endl;
return 0;
} | #include <iostream>
#include <cstdio>
#include <vector>
#include <iomanip>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
using namespace std;
using VI = vector <int>;
using VVI = vector <VI>;
int main() {
int N;
int K;
cin >> N >> K;
... | 0 | 56,275,977 |
#include<bits/stdc++.h>
#define ll long long int
#define pb push_back
#define mk make_pair
#define all(v) v.begin(),v.end()
#define fi first
#define se second
#define vl vector<long long int>
#define vvl vector<vector<ll> >
#define fo(i,a,b) for(int i=a;i<b;i++)
#define rof(i,a,b) for(int i=b;i>=a;i--)
using namespac... | #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 <fstream>
#include <numeric>
using namespac... | 0 | 21,264,784 |
#include<iostream>
using namespace std;
int main(){
int a,b=1;
do{
cin >> a;
if(a!=0){
cout << "Case" << " "<< b <<": "<< a<<"\n";
}
b++;
}while(a!=0);
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int dp[100005][3];
int main(){
int n;
cin>>n;
int v[n][3];
for(int i=0; i<n; i++){
for(int j=0; j<3; j++)
cin>>v[i][j];
}
dp[0][0] = v[0][0];
dp[0][1] = v[0][1];
dp[0][2] = v[0][2];
for(int i=1; i<n; i++){
for(... | 0 | 71,356,923 |
#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... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1<<(n))
using namespace std;
typedef long long ll;
typedef long d... | 0 | 53,436,752 |
#include <iostream>
using namespace std;
typedef long long ll;
ll a,b,c;
int main(void){
cin>>a>>b>>c;
for(int i=0;i<c;i++){
if(i%2==0){
if(a%2==1)a--;
b+=a/2;
a-=a/2;
}
else{
if(b%2==1)b--;
a+=b/2;
b-=b/2;
}... | #include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<tuple>
#include<map>
#include<queue>
#include<stack>
#include<deque>
#include<bitset>
#include<math.h>
using namespace std;
int main(){
int n,k;
cin >> n >> k;
int c[n][1];
for(int i=0;i<n;i++){
c[i][0]=0;
}
... | 0 | 57,738,776 |
#include <bits/stdc++.h>
using namespace std;
using P = pair<int,int>;
int main(){
int N, K;
cin >> N >> K;
if(K > (N-1)*(N-2)/2){
cout << -1 << endl;
}
else{
vector<P> vec(0);
for(int i=1; i<N; i++){
P p = {1,i+1};
vec.push_back(p);
}
int cnt = (N-1)*(N-2)/2;
bool end = fa... | #include <stdio.h>
#include <string.h>
#include <iostream>
#include <vector>
#include <bitset>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
string s;
cin >> s;
vector<int> x(4);
rep(i, 4) {
x[i] = s[i] - '0';
}
string ans;
rep(j, 8) {
bitset<3> ... | 0 | 41,255,389 |
#include<iostream>
#include<vector>
using namespace std;
vector<int> u[10010];
int n,m,t[10010],d[10010];
void dfs(int p){
cout<<p<<"\n";
for(int i=0;i<u[p].size();i++){
d[u[p][i]]++;
if(d[u[p][i]]==t[u[p][i]]){
dfs(u[p][i]);
d[u[p][i]]=1008610086;
}
}
}
int main(){
cin>>n>>m;
for(int i=0;i<m;i++){
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(),(x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var << "] " ... | 0 | 100,604,966 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(),(x).end()
#define ... | #include <bits/stdc++.h>
using namespace std;
int main(void){
int K;
string S;
cin >> K >> S;
if(K >= S.size()) {
cout << S << endl;
}
else {
for (int i=0;i<K;i++) {
cout << S[i];
}
cout << "..." << endl;
}
} | 0 | 25,617,013 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int num = K;
for (int i = 0; i < N - 1; i++) num *= K - 1;
cout << num << endl;
} | #include <bits/stdc++.h>
#include <boost/range/adaptors.hpp>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
using namespace boost::adaptors;
int main() {
int64_t n, m;
cin >> n >> m;
unordered_map<int64_t, int64_t> nums;
++nums[0];
int64_t ans = 0, s = 0;
for (auto... | 0 | 66,084,925 |
#include <bits/stdc++.h>
#pragma region Macro
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define SORT(v) sort(v.begin(), v.end())
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define vi vector<int>
#define vvi vector<vector<int>>
#define chmax(x,y) (x =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int T[100000];
int main() {
int N, C, K;
cin >> N >> C >> K;
for (int i=0; i<N; i++) {
cin >> T[i];
}
sort(T, T+N);
queue<int> q;
for (int i=0; i<N; i++) {
q.push(T[i]);
}
int cnt = 0;
while(! q.empty()) {
cnt++;
int c = 1;
int t = ... | 0 | 41,300,622 |
#include<cstdio>
#include<iostream>
using namespace std;
int main()
{
int i,j,n,s=0,t=0;
for(i=1;i<=4;i++)
{
cin>>n;
s+=n;
}
for(i=1;i<=4;i++)
{
cin>>n;
t+=n;
}
if(s>=t)cout<<s<<endl;
else cout<<t<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
#define all(a) (a).begin(), (a).end()
#define all2(a, b) (a).begin(), (a).begin() + (b)
#define debug(vari) cerr << #vari << " = " << (vari) << endl;
... | 0 | 1,228,360 |
#include<bits/stdc++.h>
using namespace std;
int main(){
vector<int> s={1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51};
int k;
cin >> k;
cout << s.at(k-1) <<endl;
return 0;
} | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <lim... | 0 | 92,669,961 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using si = set<int>;
using ii = pair<int, int>;
using vii = vector<ii>;
#define fastio ios::sync_with_stdio(0); cin.tie(0)
#define rep(i, n) for (int i = 0; i < n; i++)
#define dotc() int tcs; if (c... | #include "bits/stdc++.h"
typedef long long ll;
#define int ll
#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) make_pair(a,b)
#define pb(a) push_back(a)
#define INF LLONG_MAX/2
#define... | 0 | 92,419,316 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> a(N);
rep(i, N) cin >> a[i];
ll hi = 1e18, lo = -1;
while (lo + 1 < hi) {
ll mi = (lo + hi) / 2, s = 0;
rep(i, N) {
... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vec... | 0 | 19,301,585 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e18;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template<class T> inline bool chmin(T& a, T ... | #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);
int K; cin >> K;
queue<string> q;
for(int i = 1; i <= 9; i++){
q.push(to_string(i));
}
int num = 0;
while(true){
string now = q.front(... | 0 | 38,291,625 |
#include<iostream>
#include<cstdlib>
#include<utility>
#include<tuple>
#include<string>
#include<vector>
#include<numeric>
#include<algorithm>
#include<queue>
#include<deque>
#include<bitset>
#include<cmath>
#include<map>
#include<iomanip>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
#define rep(i... | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define ln '\n'
using namespace std;
using LL = long long;
u... | 0 | 55,908,520 |
#include<iostream>
#include<iomanip>
#include<cmath>
using namespace std;
const double pi = 3.141592653589793;
struct Cordinate{
double x;
double y;
};
void kock( int n, Cordinate p1, Cordinate p2 ){
if( n==0 ){
return;
}
Cordinate s, t, u;
s.x = (2*p1.x+1*p2.x)/3;
s.y = (2*p1.y+1*p2.y)/3;
t.x = (1*... | #include<bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie();cout.tie();
#define FILE_READ_IN freopen("input.txt","r",stdin);
#define FILE_READ_OUT freopen("output.txt","w",stdout);
using namespace std;
typedef long long ll;
int main(){
#ifndef ONLINE_JUDGE
FILE_READ_IN
FILE_READ_OUT... | 0 | 94,672,982 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define fi ... | #include<bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
int arr[205][205];
int main(){
int n,m,r;
cin>>n>>m>>r;
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++) arr[i][j] = INF;
}
vector<int>town(r);
for(int i=0; i<r; i++) cin>>town[i];
sort(town.begin(),town.end());
while(m--){
int a,b,c;
... | 0 | 16,482,880 |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
int n;
cin >> n;
vector<int> a(n), b(n);
long long suma = 0, sumb = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
suma += a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
sumb += b[i];
}
if (sumb > suma) {
... | #include <bits/stdc++.h>
using namespace std;
int main(void){
string S;
cin>>S;
int count=0;
for(int i=1;i<3;i++){
if(S[i]==S[i-1]){
count++;
}
}
if(count==2){
cout<<"No"<<endl;
return 0;
}
else{
cout<<"Yes"<<endl;
}
return 0;
} | 0 | 33,007,397 |
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
#include <random>
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 ALL(v) v.begin(), v.end()
const int NOT_DEFINED = -111;
class Tree {
int n;... | #include<iostream>
#include<vector>
#include<algorithm>
#include<iomanip>
#include<stack>
#include<queue>
#include<string>
#include<set>
#include<map>
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)++)
typedef long long ll;
int main(){
int m,nmin,nmax;
... | 0 | 52,705,309 |
#include<iostream>
#include<iomanip>
#include<math.h>
#include<vector>
#include<string>
#include<stack>
#include<queue>
#include<map>
#include<algorithm>
#include<bitset>
#include <climits>
#include<set>
#include<bitset>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
ty... | #include <iostream>
using namespace std;
const int MOD = 1000000007;
int N;
int dig[60];
long long A[300100];
int main() {
cin >> N;
for (int i = 0; i < N; i++) cin >> A[i];
long long ans = 0, dig = 1;
for (int i = 0; i < 60; i++) {
long long zero = 0, one = 0;
for (int j = 0; j < N; j++... | 0 | 94,091,441 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for(ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina c... | #include <bits/stdc++.h>
using namespace std ;
typedef long long ll;
typedef string str;
typedef vector<int> vint;
typedef vector<double> vdou ;
typedef vector<ll> vll;
typedef vector<vint> vvint;
typedef vector<str> vstr;
typedef pair<int, int> pii;
typedef vector<pii> vpii ;
#define REP(i, n) for (ll (i) = 0; (i) < (... | 0 | 94,468,566 |
#include<bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 62)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64,i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
templa... | #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(){
ll n,m;
cin >> n >> m;
ll a,b;
vector <int> k(n);
rep(i,m){
cin >> a >> b;
++k[a-1];
++k[b-1];
}
rep(i,n){
if(k[i]... | 0 | 20,163,390 |
#include <bits/stdc++.h>
using namespace std;
#define pr(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
#define all(v) (v).begin(), (v).end()
#define int long long
#define sz(v) (int)(v).size()
#define mod 1000000007
voi... | #include<iostream>
#include<cstdio>
using namespace std;
typedef long long ll;
const int maxn=1e5+100;
int a[maxn],b[maxn];
int fac[32];
int main()
{
int N,K;
scanf("%d%d",&N,&K);
ll res=0;
for(int i=0;i<N;i++){
scanf("%d%d",&a[i],&b[i]);
if((a[i]|K)==K) res+=b[i];
}
for(int i=0;... | 0 | 98,112,843 |
#include <bits/stdc++.h>
#include <numeric>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
using ll = long long;
using ld = long double;
const int MOD = 1e9+7;
const ll INF = 1LL << 60;
int main() {
string s; cin >> s;
int n = s.size();
V<int> a(n + 1);
for(int i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
ll P[100005];
ll Q[100005];
int main()
{
in... | 0 | 66,613,113 |
#include <bits/stdc++.h>
using namespace std;
#define pi acos(-1)
#define IOS ios_base::sync_with_stdio(0); cin.tie(); cout.tie();
#define ff first
#define ss second
#define pb push_back
#define debug(val) cerr << "The Value Of " << #val << " is : " << val << '\n';
typedef long double ld;
typedef long long ll;
typedef ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
string N;
ll K;
ll dp[105][2][4];
int ma... | 0 | 37,517,955 |
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
int n,tot=0,head[100001];
struct data {
int next,num;
}edge[200001];
void add(int u,int v) {
edge[++tot].next=head[u];
edge[tot].num=v;
head[u]=tot;
}
int dfs(int x,int fa) {
int ans=0;
for (int i=head... | #include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
int main()
{
while (true) {
int n;
cin >> n;
if (n == 0) {
break;
}
vector<int> s(n);
for (int i = 0; i < n; i++) {
cin >> s[i];
}
... | 0 | 34,665,257 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.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 chmi... | #include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) (v).begin(),(v),end()
#define pb push_back
typedef long long ll;
typedef pair<int,int> P;
template<typename A,typename B> inline void chmin(A &a,B b){if(a>b) a=b;}
template<typename A,typename B> inline void chmax(A &a,B... | 0 | 76,415,436 |
#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 <bits/stdc++.h>
#include <stdio.h>
#include <iostream>
#include <cstdio>
#include <bitset>
#include <algorithm>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <string.h>
#include <cmath>
#include <utility>
#include <functional>
#include <map>
#include <set>
#incl... | 0 | 54,263,690 |
#include <bits/stdc++.h>
#define int long long
#define x first
#define y second
#define getbit(x, i) (((x) >> (i)) & 1)
using namespace std;
typedef pair<int, int> pii;
#define hashset unordered_set
#define hashmap unordered_map
#define newline fast_writechar('\n')
#define unify(arr) arr.resize(unique(arr.begin(), arr.... | #include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#includ... | 0 | 17,423,092 |
#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
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;
#define SC scanf
#define PR printf
#define pb push_back
#define mp make_pair
#define SZ(v) ((int)(v).size())
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define db double
#define ldb long double
#define uint... | 0 | 71,238,674 |
#include<iostream>
using namespace std;
int main(void){
int m[100][100];
int n, u, k, v;
cin >> n;
for(int i=0; i<n; i++){
for(int j=0; j<n; j++){
m[i][j]=0;
}
}
for(int i=0; i<n; i++){
cin >> u >> k;
u--;
for(int j=0; j<k; j++){
cin >> v;
v--;
m[u][v]=1;
}
... | #pragma region include
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
#include <queue>
#include <stack>
#include <cmath>
#include <set>
#include <cstdio>
#include <tuple>
#define ALL(obj) (obj).begin(),(obj).end()
#define RALL(obj) (obj).rbegin(),(obj).rend()
#define REP(i, ... | 0 | 45,200,128 |
#include <bits/stdc++.h>
#define fast_io ios :: sync_with_stdio(false);
using namespace std;
int main() {
cout << fixed << setprecision(3);
fast_io;
int x, n, h;
int cont = 0;
cin >> n;
int max = 0;
while (n--) {
cin >> h;
if(h >= max) {
cont++;
max = h;
}
}
cout << cont;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef unsigned long long ull;
void oneCase() {
int a, b, c;
cin>> a >> b >> c;
if (a == b) {
cout << c;
} else if (c == a) {
cout << b;
} else {
cout << a;
}
cout ... | 0 | 15,210,247 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int A,B;
cin>>A>>B;
cout<<6-(A+B)<<endl;{
}
} | #include <bits/stdc++.h>
#include <iostream>
#include<math.h>
using namespace std;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int64_t cx(int64_t i) {
int64_t r... | 0 | 54,107,613 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int l, r; cin >> l >> r;
const int INF = 2000000005;
int ans = INF, cnt = 0;
for (int i=l; i<=r; i++) {
... | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
string from,to;
cin>>from>>to;
int f[from.size()+1][to.size()+1];
for(int i=0;i<from.size()+1;i++){
for(int j=0;j<to.size()+1;j++){
f[i][j]=0;
}
}
for(int i=1;i<from.size()+1;i++){
f[... | 0 | 75,932,936 |
# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <unordered_map>
constexpr int MOD = 1000000000 + 7;
constexpr i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h,w;
cin >> h >> w;
vector<string> s(h);
for(int i=0;i<h;i++)
{
cin >> s.at(i);
}
string ans = "Yes";
for(int i = 0;i<h;i++)
{
for(int j = 0;j<w;j++)
{
int z1=0,z2=0,z3=0,z4=0;
char nw = s.at(i).at(j);
if(nw == '.')
{
continue... | 0 | 79,755,285 |
#include <iostream>
#include <string>
using namespace std;
int main() {
while (1) {
string str;
cin >> str;
if (str == "-") {
break;
}
int m;
cin >> m;
int first = 0;
for (int i = 0; i < m; i++) {
int h;
cin >> h;
first = (first + h) % str.size();
}
for ... | #include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <limits>
#include <random>
#include <complex>... | 0 | 31,100,371 |
#include <iostream>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b>>c;
a=a+b;
if(a>=c)
cout<<"Yes";
if(a<c)
cout<<"No";
return 0;
} | #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <sstream>
#include <map>
using namespace std;
int main()
{
int n;
while(cin>>n,n){
vector<long long> dp(n);
long long re... | 0 | 41,365,072 |
#include <iostream>
#include <algorithm>
#include <string>
#include <math.h>
#include <cstdint>
#include <map>
using namespace std;
typedef long long ll;
ll ans,mx,sum,mn=1e8;
int main(){
ll n,m;
cin>>n>>m;
if(n*2 >= m){
cout<<m/2;
}
else cout<<n+(m-(n*2))/4<<endl;
} | #include<bits/stdc++.h>
#define fast ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define int long long
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define vii ... | 0 | 70,400,937 |
#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 fi first
#define se second
constexpr ll mod = 1000000007;
constexpr ll INF = (1ll << 60);
constexpr double pi = 3.14159265358979323846;
template... | #include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <vector>
#include <deque>
using namespace std;
#define fors(i,a,b) for(int i=(a);i<=(b);++i)
#define ford(i,a,b) for(int i=(a);i>=(b);--i)
#define min(x,y) ((x) < (y) ? (x) : (y))
#define max(x,y) ((... | 0 | 59,326,129 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,A;
cin >> N >> A;
N = N%500;
if(N - A > 0){
cout << "No" << endl;
}
if(N - A <=0){
cout << "Yes" << endl;
}
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int a,b,x;
cin>>a>>b>>x;
if(a>x){
cout<<"NO"<<endl;
}
else if(a+b>=x){
cout<<"YES"<<endl;
}
else{
cout<<"NO"<<endl;
}
return 0;
} | 0 | 35,850,615 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,tmp;
vector<pair<int,int>> a;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> tmp;
a.push_back(make_pair(tmp,i));
}
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
cout << a.at(i).second+1;
if (i != n - 1) {
cout << " ";
}
}
c... | #include <bits/stdc++.h>
using namespace std;
const int inf = 1e5;
int dp[101][101];
signed main () {
int h, w, a, b;
cin >> h >> w >> a >> b;
string t1, t2;
for (int i = 0; i < a; ++i) {
t1 += '1';
t2 += '0';
}
for (int i = 0; i < w - a; ++i) {
t1 += '0';
t2 += '... | 0 | 73,518,502 |
#include<iostream>
using namespace std;
bool backet(char a){
if(a=='(')return true;
if(a==')')return true;
if(a=='[')return true;
if(a==']')return true;
if(a=='{')return true;
if(a=='}')return true;
return false;
}
bool check(char a,char b){
if(a=='(' && b==')')return true;
if(a=='[' && b==']')return ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef double db;
const double pi = 3.141592654;
#define pb push_back
#define forab(i,a,b) for(int i=(a);i<=(b);i++)
#define CIN ios_base::sync_with_stdio(0); cin.tie(0)
#define pcase(z,x) printf("Case %ld: %lld\n",z,x)
#define nw ... | 0 | 35,490,508 |
#include <iostream>
#include <bits/stdc++.h>
#include <string>
#include <ctype.h>
#include <algorithm>
#include <cmath>
#define REP(i, n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
#define square(x) (x) * (x)
#define cube(x) (x) * (x) * (x)
const int INF = 1e9;
using namespace std;
class dice{
... | #include <cmath>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<double, double> pdd;
typedef p... | 0 | 59,369,741 |
#include <iostream>
#include <string>
using namespace std ;
int main(){
string s = "aaaaaaaaaaaaa" ;
for(int i=0;i<13;i++){
if(i==4) s.at(i) = ' ' ;
else{
char c ; cin >> c ;
s.at(i) = c ;
}
}
cout << s << endl ;
} | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
const int INF = 1001001001;
const int MOD = 1000000007;
typedef long long ll;
template<typename T> void print(const T & v);
int main() {
int A,... | 0 | 14,088,393 |
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair <ll,ll> P;
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define REPR(i, n) for(int i = n-1; i > 0; i--)
#define FOR(i, n, m) for(int i = n; i < (int)(m); i++)
#define PRINT(x) cout << x << endl
#define ALL(v) v.begin(), v.end()
... | #include <bits/stdc++.h>
using namespace std;
int main(){
while(1){
int n;
cin>>n;
if(n == 0) break;
vector <int> data(n);
for(int i=0; i<n; i++){
cin>>data.at(i);
}
sort(data.begin(), data.end());
reverse(data.begin(),data.end());
vector <int> gap(n);
for(int i=0; i<... | 0 | 65,112,120 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> x(n);
for (int i = 0; i < n; i++) {
cin >> x.at(i);
}
int ans = 1e9;
for (int p = 1; p <= 100; p++) {
int po = 0;
for (int i = 0; i < n; i++) {
po += (x.at(i) - p) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1001001001;
const ll mod = 1000000007;
int main(){
ll n; cin >> n;
set<ll> st;
for(ll i = 1; i * i <= n; i++){
if(n % i == 0){
st.insert(i);
st.insert(n / i);
}
}
ll ans = 0;
... | 0 | 88,256,939 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#include<iomanip>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#defi... | #include<bits/stdc++.h>
using namespace std;
#define LL long long
#define DD double
#define Pb push_back
#define Bp pop_back
#define Pf push_front
#define Fp pop_front
#define Ub upper_bound
#define Lb lower_bound
#define In insert
#define All(x) x.begin(), x.end()
#define mem(a, b) memset(a, b, sizeof(a))
#define fast... | 0 | 33,224,852 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include <bits/stdc++.h>
using namespace std;
int64_t calc_gcd(int64_t a, int64_t b)
{
a = a % b;
if (a == 0)
return b;
return calc_gcd(b, a);
}
int64_t calc_lcm(int64_t a, int64_t b)
{
return a / calc_gcd(a, b) * b;
}
int64_t calc_vec_lcm(const vector<int64_t> &a_vec, int64_t upper)
{
int64... | 0 | 18,288,659 |
#include <algorithm>
#include <array>
#include <assert.h>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#includ... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define int ll
#define double long double
#define YES {cout<<"YES"<<'\n';}
#define NO {cout<<"NO"<<'\n';}
#define Yes {cout<<"Yes"<<'\n';}
#define No {cout<<"No"<<'\n';}
#define yes {cout<<"yes"<<'\n';}
#define no {co... | 0 | 25,159,844 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(... | #include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
int main()
{
std::string str;
std::size_t q;
std::cin >> str >> q;
for (std::size_t i = 0; i < q; ++i) {
std::string command;
std::size_t a, b;
std::cin >> command;
if (command == "replace") {
... | 0 | 22,752,994 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
if(n>=400&&n<600) cout<<8;
else if(n>=600&&n<800) cout<<7;
else if(n>=800&&n<1000) cout<<6;
else if(n>=1000&&n<1200) cout<<5;
else if(n>=1200&&n<1400) cout<<4;
else if(n>=1400&&n<1600) cout<<3;
else if(n>=1600&&n<1800) cout<<2;
else if(n>... | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define P pair<ll,ll>
#define INF 1000000000000000000
#define N 100001
using namespace std;
ll q, k;
ll dist[N];
vector<vector<P>> edge;
void make_dist(int cur){
for (auto p : edge[cur]){
ll u = p.first;
ll d = p.second;
if (dist[u] ... | 0 | 62,783,345 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin>>S;
for(int i=S.size()-2;i>0;i-=2){
bool bo=false;
for(int j=0;j<i/2;j++)
if(S[j]!=S[j+i/2]){
bo=true;
break;
}
if(bo)
continue;
cout<<i<<endl;
return 0;
}
} | #include<bits/stdc++.h>
using namespace std;
int ar[2000010], br[100010], cr[2000010];
int main()
{
int i, n;
scanf("%d", &n);
memset(br, 0, sizeof(br));
for(i = 1; i <= n; ++i)
{
scanf("%d", &ar[i]);
++br[ar[i]];
}
for(i = 1; i < 100001; ++i)
... | 0 | 30,277,798 |
#include <iostream>
#include <utility>
using namespace std;
#define N 1000000
#define INF 1000000
typedef pair<char, int> Card;
void bubSort(Card cards[], int n){
for (int i=0; i<n; i++){
for (int j=n-1; j>=i+1; j--){
if (cards[j].second < cards[j-1].second){
Card tmp;
tmp = cards[j]; cards[... | #include<bits/stdc++.h>
using namespace std;
const int mod = 1e9+7;
char s[200100];
int n,ans=1,num;
int main(){
int i,j,k;
scanf("%d",&n);
scanf("%s",s);
for(i=0;i<2*n;i++)
if(!(((s[i]=='W')^num)&1))
num++;
else{
ans=1ll*ans*num%mod;
num--;
}
... | 0 | 41,123,697 |
# include <stdio.h>
int main(){
int n,i,ans=0,r=0,l=0;
char s[3];
for(;;){
scanf("%d",&n);
if(n==0){
break;
}
for(i=1;i<=n;i++){
scanf("%s",s);
if(s[0]=='l'&&s[1]=='u'){
l=1;
}
if(s[0]=='l'&&s[1]=='d'){
l=0;
}
if(s[0]=='r'&&s[1]=='u'){
r=1;
}
if(s[0]==... | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)... | 0 | 71,911,806 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
string op;
cin >> A >> op >> B;
char c = op.at(0);
if (c=='+') {
cout << A+B << endl;
}
else {
cout << A-B << endl;
}
} | #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... | 0 | 3,566,168 |
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int N, A, B;
cin >> N >> A >> B;
int num[3] = { 0,0,0 };
for (int i = 0; i < N; i++) {
int p;
cin >> p;
num[(p > A) + (p > B)]++;
}
cout << min({ num[0], num[1], num[2] }) << endl;
} | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int a,b,c;
cin >> a >> b >> c;
bool f = false;
for(int i = 0; i < b; i++){
if((i * a%b)%b == c){
f = true;
break;
}
}
if(f) puts("YES");
else puts("NO");
} | 0 | 30,169,683 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<ll,ll> P;
#define pb push_back
#define ft first
#define sd second
#define mp make_pair
#define fr(i,n) for(int i=0;i<n;i++)
#define Fr(i,n) for(int i=0;i++<n;)
#define ifr(i,n) for(int i=n-1;i>=0;i--)
#define iFr(i,n) for... | #include <bits/stdc++.h>
#define rep(i, e, n) for (int i = e; i < (n); ++i)
using namespace std;
typedef long long ll;
using P = pair<int,int>;
const ll inf=1000000000007;
int main(){
int n;
cin >> n;
vector<int> a(n);
vector<int> val(1000001,0);
rep(i,0,n) cin >> a[i];
rep(i,0,n) {
int vali=a[i];
f... | 0 | 82,340,303 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
double n, k; cin >> n >> k;
double ans = 0;
for(int i=1; i<=n; i++){
double tmp = 1.0/n;
int now = i;
while(now < k){
now *= 2;
tmp /= 2;
}
ans += tmp;
}
pr... | #include <bits/stdc++.h>
#define MAX 1000000
#define MOD 1e9
#define pb push_back
#define pairs pair<int, int>
#define vi vector<int>
#define vb vector<bool>
#define vii vector<pairs>
#define lb lower_bound
#define ub upper_bound
#define ll long long
#define endl '\n'
using namespace std;
#define FastInput ios_base::sy... | 0 | 87,991,894 |
#include<iostream>
#include<string>
#include<cmath>
using namespace std;
int main(void){
string st1, st2;
int q, val[1001][1001];
cin >> q;
for(int i=0; i<q; i++){
cin>>st1;
cin>>st2;
for(int j=0; j<=st1.length(); j++){
for(int k=0; k<=st2.length(); k++){
if(j==0 || k==0) val[j][k] = 0;
else... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> c(n-1), s(n-1), f(n-1);
rep(i,n-1) cin >> c[i] >> s[i] >> f[i];
rep(i,n-1) {
int t = 0;
rep(j,n-i-1) {
if (t < s[i+j]) {
t = s[i+j];
} else i... | 0 | 64,131,886 |
#include<iostream>
#include<string>
using namespace std;
int main(){
string S;
cin>>S;
int ans1=0;
int ans2=0;
for(int i=0;i<=(int)(S.length()-1);i++){
if(i%2==0){
if(S[i]=='0')ans1++;
}
else{
if(S[i]=='1')ans1++;
}
}
for(int i=0;i<=(int)(S.length()-1);i++){
if(i%2==0){
... | #include <bits/stdc++.h>
#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define LCM(a, b) (a) / __gcd((a), (b)) * (b)
#define CEIL(a, b) (a)/(b)+(((a)%(b))?1:0)
#define ln '\n'
using namespace std;
using LL = long long;
u... | 0 | 59,479,213 |
#include<bits/stdc++.h>
using namespace std;
const int N=2003;
int n,m,ans,f1[N][N],f2[N][N],f3[N][N],f4[N][N];
char mp[N][N];
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)scanf("%s",mp[i]+1);
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
if(mp[i][j]=='.')f1[i][j]=f1[i-1][j]+1,f2[i][j]=f2[i]... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
map<int,int> a;
for(int i=0;i<n;i++){
int time; cin >> time;
a[time]=i+1;
}
for(auto stu:a){
cout << stu.second << " ";
}
} | 0 | 6,793,115 |
#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl... | #include<bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
int main() {
while (1) {
int n, m, p;
cin >> n >> m >> p;
if (!n) return 0;
--m;
vector<int> x(n);
int sum = 0;
for (int i = 0; i < n; ++i) {
cin >> x[i];
sum += x[i... | 0 | 3,881,348 |
#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, M;
cin >> N >> M;
priority_queue<double> p_que;
ll ans = 0;
rep(i, N){
double a;
cin >> a;
p_que.push(a);
}
rep(i, M){
double va... | #include<iostream>
using namespace std;
int x[200000], n, a, b, c, d, p, rell, y[200000];
int main() {
while (true) {
cin >> n >> a >> b >> c >> p; if (!n) { break; }
x[0] = p; rell = 0;
for (int i = 1; i < 200000; i++) { x[i] = (x[i - 1] * a + b) % c; }
for (int i = 0; i < n; i++) { cin >> y[i]; }
for (int ... | 0 | 2,737,237 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.