code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;
int main(){
int N;
scanf("%d", &N);
printf("%d\n", N*N);
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_s... | 1 | 61,863,661 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using st=string;
using ch=char;
typedef pair<ll,ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<P> vP;
typedef vector<ch> vc;
typedef vector<vc> vvc;
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define rep(i,n) FOR(i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
int main() {
int x, y, z, k;
cin >> x >> y >> z >> k;
vector<ll> a(x), b(y), c(z);
rep(i, x) cin >> a[i];
rep(i, y) cin >> b[i];
rep(i, z) cin >> c[i];
vector<ll> ab(x * y);
rep(i, x)... | 1 | 87,902,362 |
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<bitset>
#include<deque>
#include<functional>
#include<iterator>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<utility>
using namespace std;
typedef long long ll;
#define a first
#define b second
#def... | #include<iostream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
#define fast_io ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
using namespace std;
#define debug(x) cout<<(#x)<<"="<<(x)<<", ";
#define debug1(x) debug(... | 1 | 76,561,837 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define rep(i, n) for(int i=0;i<(int)n;i++)
#define PI acos(-1)
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
ll mod=1e9+7;
int main(){
int n, k;
cin>>n>>k;
string s;
cin>>s;
vect... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
int main() {
int N, K;
cin >> N >> K;
string S;
cin >> S;
vector<pair<int, int>> A;
int i = 0;
while (i < N) {
int j = i;
while (i < N && S[i] == S[j]) i++;
A.push_back({S[j] - '0', i - j});
}
int... | 1 | 14,398,645 |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
long long Q, H, S, D, N;
cin >> Q >> H >> S >> D >> N;
long long one = min({Q * 4, H * 2, S});
long long ans;
if (2 * one <= D) {
ans = N * one;
} else {
ans = D * (N / 2) + one * (N % 2);
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <string>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < n; i++)
int main(){
ll q, h, s, d;
cin >> q >> h >> s >> d;
ll N;
cin >> N;
ll sum = 0;
ll ... | 1 | 9,708,269 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
ll ans = 0;
int main()
{
ll n ;
cin >> n ;
vector<ll> a(n);
ll su=0;
rep(i, n){
cin >> a[i];
su^=a[i];
}
rep(i,60){
if(su>>i & 1LL){
ans+=1LL<<i;
}
}
rep(i,n){
a[i]=(a[i]|ans)^ans;
}
ll s... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0,i##_max=(N);i<i##_max;++i)
#define repp(i,l,r) for(int i=(l),i##_max=(r);i<i##_max;++i)
#define per(i,N) for(int i=(N)-1;i>=0;--i)
#define perr(i,l,r) for(int i=r-1,i##_min(l);i>=i##_min;--i)
#define all(arr) (arr).begin(), (arr).end()
#define S... | 1 | 54,441,366 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define per(i,n) for (int i = (n)-1; i >=0; --i)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vv = vector<vi>;
int main(){
int w,h,n;
cin>>w>>h>>n;
int minx=0, maxx=w, miny=0, maxy=h;
int x,y,a;
rep(i... | #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<int, int> 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; } re... | 1 | 80,720,245 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); ++i)
#define cout(x) cout<<(x)<<endl
#define all(v) v.begin(), v.end()
using namespace std;
using vi = vector<int>;
using ll = long long;
using P = pair<int,int>;
using Mat = vector<vector<int>>;
const ll inf = 1e18;
const int N = 2e5+10;
int main(){
in... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
constexpr ll INF = ll(1e+18) + 1;
int main() {
int A, B, C;
string ans = "NO";
cin >> A >> B >> C;
rep(b, B) {
if ((A*b)%B == C) {
ans = "YES";
break;
... | 1 | 59,138,661 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vc = vector<char>;
using vb = vecto... | #include<bits/stdc++.h>
#define rep(i,n) for(ll i = 0;i < n;++i)
#define all(v) v.begin(),v.end()
using namespace std;
using ll = long long;
typedef pair<int,int> P;
const int INF = 1001001001;
const long double PI = (acos(-1));
const int mod = 1e9+7;
const int vx[6] = {0,1,0,-1,1,-1};
const int vy[6] = {1,0,-1,0,1,1};... | 1 | 57,060,929 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string s;
while(cin>>s){
int i,c=0;
if(s[0]=='0')break;
for(i=0;i<s.size();i++)c+=s[i]-'0';
cout<<c<<endl;
}
} | #include<iostream>
#include<cstdio>
using namespace std;
int main(){
char ch[1000]="A";
int num,i,a;
while(true){
scanf("%s",&ch);
if(ch[0]=='0')break;
i=0;
num=0;
while(true){
if(ch[i]=='\0')break;
a = ch[i]-'0';
num += a;
... | 1 | 29,407,677 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll big =1e7+2;
ll a[big];
int main()
{ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
ll n;
cin>>n;
for(int i=1;i<=n;++i){
for(int j=i;j<=n;j+=i){
a[j]++;
}
}
ll sum=0;
for(int i=1;i<=n;++i)
sum+=i*a[i... | #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll,ll>
vector<ll> S(10000006, 0);
vector<ll> A(10000006, 0);
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n;
cin>>n;
const ll N=n+1;
A[0]=A[1]=0;
for(ll i=2;i<N;i++){
if(A[i]==0){
for(ll j=2*i;j<N;j... | 1 | 4,038,378 |
#include<iostream>
#include<unordered_set>
using namespace std;
int main(){
int n;
cin>>n;
unordered_set<int>ump;
int index=1;
while(ump.find(n)==ump.end()){
ump.insert(n);
if(n%2==0){
n/=2;
}
else{
n=3*n+1;
}
index++;
}
... | #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 coratz(int n) {
if (n % 2 == 0) return n / 2;
else return 3 * n + 1;
}
int main() {
int s;
cin >> s;
set<int> h;
h.insert(s);
int a, b = s;
int cnt = 1;
while (true... | 1 | 94,438,833 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#define rep(i,m,n) for(int i=m;i<n;i++)
ll mod=1e9+7;
int main(){
int n;
cin>>n;
int a[n+2];
a[0]=0;
a[n+1]=0;
rep(i,0,n) cin>>a[i+1];
int sum[n+2];
sum[0]=0;
rep(i,0,n+1){
sum[i+1]=sum[i]+abs(a[i+1]-a[i]);
... | #include <bits/stdc++.h>
#include <iomanip>
#include <algorithm>
#define ll long long
#include <unordered_map>
using namespace std;
int main() {
ll N, sum = 0;
cin >> N;
vector<ll> A(N);
for(ll i = 0; i < N; i++) {
cin >> A.at(i);
if(i == 0) sum += abs(A.at(0));
else sum += abs(A.at(i) - A.at(i - ... | 1 | 33,237,861 |
#include <iostream>
#include <queue>
#include <string>
using namespace std;
int main()
{
priority_queue<int> PQ;
string com;
int n;
while(cin >> com)
{
if(com == "end")
{
break;
}
if(com[0] == 'i')
{
cin >> n;
PQ.push(n);
}
else if(com[0] == 'e')
{
cout << PQ.top() << endl;
PQ.pop();... | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
#define N 2000001
int heap_size=0;
int key[N];
int parent(int i){
return i/2;
}
int leftc(int i){
return 2*i;
}
int rightc(int i){
return 2*i+1;
}
void maxHeapify(int i){
int l,r,largest;
int st;
l=leftc(i);
r=rig... | 1 | 63,750,448 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define pii pair<int,int>
#define vec vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define inf 1e18
#define ps(x,y) ... | #include <bits/stdc++.h>
using namespace std;
int main(){
int x, y;
cin >> x >> y;
bool flag = false;
for(int i=0; i<=x; i++){
int j = x-i;
if(2*i + 4*j == y)
flag = true;
}
if(flag)
cout << "Yes" << endl;
else
cout << "No" << endl;
} | 1 | 42,689,556 |
#include <bits/stdc++.h>
using namespace std;
int main () {
int N, M, X, Y;
cin >> N >> M >> X >> Y;
vector <int> x(N);
vector <int> y(M);
for (int i = 0; i < N; i++) cin >> x.at(i);
for (int i = 0; i < M; i++) cin >> y.at(i);
sort (x.begin(),x.end());
sort (y.begin(),y.end());
int y_min = y.at(0);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
int main() {
i... | 1 | 100,538,177 |
#include<iostream>
#include<math.h>
#include<vector>
#include<array>
#include<algorithm>
#include<numeric>
#include<map>
#include<queue>
#include<deque>
#include<set>
#include<cstdio>
#include<cstring>
#include<string>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vector<ll>> mat;
ll... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define ld long double
#define pii pair <ll, ll>
#define piii pair <ll, pii>
#define F first
#define S ... | 1 | 83,454,072 |
#include<bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define vi vector<int>
#define all(x) (x).begin(),(x).end()
#define INF 1e9
using ll = long long;
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) ... | #include <iostream>
#include <string>
#include<algorithm>
using namespace std;
using ll = long long;
int main(){
string s, t;
cin >> s;
t = s;
ll k, ans = 0, n = s.length();
cin >> k;
if (n == 1){
cout << k / 2 << '\n';
return 0;
}
int flag = 1;
for(int i = 0; i < n - 1; i++) {
if(s[i] == ... | 1 | 88,887,971 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve() {
ll N;
cin >> N;
vector<ll> U(N-1), V(N-1);
for ( int i = 0; i < N-1; i++ ) {
cin >> U[i] >> V[i];
U[i]--, V[i]--;
}
ll s1 = N*(N+1)*(N+2)/6;
ll s2 = 0;
for ( int i = 0; i < N-1; i++ ) {
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int mod = 1e9+7;
const int maxn = 200005;
int main()
{
ll n;
cin>>n;
ll ans=n*(n+1)*(n+2)/6;
for(int i=0,u,v;i<n-1;i++){
cin>>u>>v;
if(u>v)swap(u,v);
ans-=(ll)u*(n-v+1);
}
cout<<ans<<endl;
return 0;
} | 1 | 26,488,507 |
#include <stdio.h>
int main(){
int height[300], weight[300];
int i = 0, j = 0, count = 0, l = 0;
for(i=1;i<=300;i++){
scanf("%d %d", &height[i], &weight[i]);
if(height[i]==0&&weight[i]==0) break;
count++;
}
for(l=1;l<=count;l++){
for(i=1;i<=height[l];i++){
for(j=1;j<=weight[l];j++){
... | #include <iostream>
using namespace std;
int main()
{
int H, W;
while(true) {
cin >> H >> W;
if (H == 0 && W == 0) {
break;
}
for(int j = 0; j < W; j++) {
cout << '#';
}
cout << endl;
for(int i = 1; i < H-1; i++) {
cout << '#';
for(int j = 1; j < W-1; j++) {
... | 1 | 37,596,057 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main()
{
ll N, A, B;
cin >> N >> A >> B;
if (A > B)
{
cout << 0 << endl;
}
else if (N == 1)
{
if (A != B)
{
cout << 0 << endl;
}
else
{
cout << 1 << e... | #include<bits/stdc++.h>
using namespace std;
int main()
{
long long n, a, b;
cin >> n >> a >> b;
if(a > b || (n == 1 && a != b))
{
cout << 0;
return 0;
}
cout << (n - 2)*(b-a) + 1;
} | 1 | 85,007,812 |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll N=1e5+5;
ll a,b;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>a>>b;
if(a==1)
a+=13;
if(b==1)
b+=13;
if(a>b)
cout<<"Alice";
else if(b>a)
cout<<"Bob";
else
cout<<"Draw";
return 0;
} | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if(a == b) cout << "Draw" << endl;
else if( a == 13 && b == 1) cout << "Bob" << endl;
else if( b == 13 && a == 1) cout << "Alice" << endl;
else if( a < b) cout << "Bob" << endl;
else cout << "Alice" << endl... | 1 | 44,894,851 |
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;
typedef tree<ii,null_type,less<ii>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
int main() {
cin.tie(0); cout.tie(0); ios_base::sync_with_stdi... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<n; i++)
typedef long long ll;
int main(){
char c;
cin >> c;
if(c == 'A') cout << "T" << endl;
else if(c == 'C') cout << "G" << endl;
else if(c == 'G') cout << "C" << endl;
else if(c == 'T') cout << "A" << endl;
ret... | 1 | 95,526,973 |
#include <iostream>
#include <sstream>
using namespace std;
string dunction(int x){
string ans;
stringstream bruh;
bruh << x;
return bruh.str();
}
int main(){
int n, count;
count = 0;
cin >> n;
string bruh;
for (int x = 1; x <= n; x++){
bruh = dunction(x);
if (bruh.si... | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
typedef vector<int> vec;
typedef vector<ll> lvec;
typedef vector<char> cvec;
typedef vector<double> dvec;
typedef p... | 1 | 18,213,094 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = ll(1e12);
const ll mod = ll(1e9+7);
const double pi = acos(-1);
#define rep0(i,n) for(ll (i) = 0; (i) < (n); ++(i))
#define rrep0(i,n) for(ll (i) = (n) - 1; (i) >= 0; --(i))
#define rep1(i,n) for(ll (i) = 1; (i) <= (n); ++(i))
#define rr... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define REPS(i, m, n) for (int i = (m); i <= (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define reps(i, n) for (int i = 0; i <= (int)(n); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rre... | 1 | 44,138,642 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> list(3);
for(int i = 0; i<3; i++){
cin >> list.at(i);
}
sort(list.begin(),list.end());
int answer = list.at(0) + list.at(1) + 10*list.at(2);
cout << answer << endl;
} | #include <bits/stdc++.h>
#define rep(x, y) for (int i = (x); i < (y); i++)
typedef long long ll;
using namespace std;
int main() {
int n[3];
rep(0, 3) cin >> n[i];
sort(n, n + 3);
cout << (n[0] + (n[1] + n[2] * 10)) << endl;
return 0;
} | 1 | 30,830,196 |
#include <bits/stdc++.h>
#include <vector>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<pair<int, int> >mp(n);
for(int i=0;i<n;i++){
cin>>mp[i].first>>mp[i].second;
}
sort(mp.begin(),mp.end());
int64_t ans = 0, i = 0;
while(m>0){
ans += (int64_t)mp[i].first * min(mp[i].second,m);
m -= ... | #include <bits/stdc++.h>
using namespace std;
#include <iostream>
#include <vector>
#include <cstdlib>
#include <cmath>
#include <math.h>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitset>
#include <cassert>
#include<algorithm>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, ... | 1 | 11,613,290 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int i=0;i < (int)n;++i)
int main() {
int a[4];
rep(i,4)cin>>a[i];
cout<<min(a[0], a[1])+min(a[2], a[3])<<endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,d,sum;
cin>>a>>b>>c>>d;
if(a>b && c>d)
sum=b+d;
else if(a>=b && c<=d)
sum=b+c;
else if(a<=b && c<=d)
sum=a+c;
else if(a<=b && c>=d)
sum=a+d;
cout<<sum<<endl;
return 0;
} | 1 | 99,225,743 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define MIN(a,b) ((a)>(b)? (b): (a))
#define MAX(a,b) ((a)<(b)? (b): (a))
const long long INF = 1LL << 60;
typedef unsigned long long ll;
const long long MOD = 1000000000 + 7;
int main(){
int n;
cin >> n;
int h... | #include"bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int n,cn... | 1 | 52,606,736 |
#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>
using namespace std;
int main()
{
int money;
scanf("%lld",&money);
long long much=800*money-money/15*200;
printf("%d\n",much);
return 0;
} | 1 | 18,835,048 |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll inf = 1000000007;
ll a[100005];
int main() {
int n, k;
cin >> n >> k;
if (n == 1) {
cout << k << endl;
return 0;
}
ll ans = k;
int i = 1;
while (i != n ) {
i++;
ans *= (k - 1);
}... | #include <bits/stdc++.h>
#include <string>
#include <vector>
#include <algorithm>
#include <math.h>
#include <iostream>
#include <numeric>
#define rep(i,n) for (int i = 0;i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
#define chmax(x,y) x = max(x,y)
int INF = 1e9;
int main(){
int n,k... | 1 | 10,102,203 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define isLeap(x) ((x % 400 == 0) || (x % 100 ? x % 4 == 0 : false))
#define FAST ios_base::sync_with_stdio(0), cin.tie(0)
#define LCM(a, b) (a / __gcd(a, b)) * b;
#define PI acos(-1.0)
#define inf 0x3f3f3f3f
#define fr(m... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
typedef long long ll;
const int MOD = 1000000007;
const int INF_32 = 1LL << 30;
const int64_t INF_64 = 1LL << 60;
int main()
{
int N;
ci... | 1 | 1,883,304 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 200005;
int n,k;
ll a[N],c[N];
int addd[N];
map<ll,int> mp;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin>>n>>k;
for(int i=1;i<=n;i++){
cin>>a[i];
c[i] = c[i-1] + a[i];
}
ll ans = 0;
mp[0] = 1;
for(int i... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n);
for(int i=0; i<n; i++)
cin >> a[i];
ll dp[n+1];
dp[0] = 0;
for(int i=0; i<n; i++)
dp[i+1] = (dp[i] + a[i] -1... | 1 | 88,711,094 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#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 ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.... | #include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) for (int i=0;i<(n);++i)
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
ll result = 0;
FOR(i, 1, N + 1) {
result += (ll) i * (N - i + 1... | 1 | 12,538,226 |
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
#include <numeric>
#include <queue>
#include <cmath>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n, 0);
int p = 0;
for (int i = 0; i < n... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int x[n];
for (int i = 0; i < n; i++)
cin >> x[i];
sort(x, x+n);
int beg = x[0], end = x[n-1];
int ans;
for (int i = 0; i < end-beg+1; i++) {
int sum = 0;
for (int j = 0; j < n; j++) {
sum += pow((x[j]-(beg + i... | 1 | 1,801,871 |
#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>
using namespace std;
#define s... | #include <iostream>
#include <algorithm>
#include <cstdio>
#include<string>
#include<cstring>
using namespace std;
int m,n,l,a[1100000],b[1100000],d[50],q[10];
void print(int &xx,int &yy)
{
for(int x=1;x<=l;x++)
{
if(abs(xx)>abs(yy))
{
if(xx>0)
{
cout<<"R";
... | 1 | 37,530,064 |
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <string.h>
#include <math.h>
#include <algorithm>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> d(k);
vector<vector<int>> a(k, vector<int>(n));
vector<int> cnt(n + 1);
int ans = 0;
fo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
scanf("%d %d", &n, &k);
set<int> snk;
for(int i = 0; i < k; i++) {
int d;
cin >> d;
for(int j = 0; j < d; j++) {
int a;
cin >> a;
snk.insert(a);
}
}
cout << (n - snk.size());
} | 1 | 30,954,821 |
#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() {
double l;
cin >> l;
double ans = l*l*l/27;
printf("%.7f\n", ans);
return 0;
} | #include <iostream>
#include <map>
#include <string>
#include <algorithm>
#include <vector>
#define ll long long
int main()
{
double L;
std::cin >> L;
printf("%.7f\n", L*L*L/27);
return 0;
} | 1 | 54,661,363 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int main(){
string s;
int q;
cin >> s;
cin >> q;
for(int i=0; i<q; ++i){
string od, p;
int a, b;
cin >> od >> a >> b;
if(od=="replace"){
cin >> p;
s = s.replace(a, b-a+1, p);
}
else if(od=="print"){
cout << s.subst... | #include <iostream>
#include <vector>
#include <map>
#include <cstdlib>
#include <algorithm>
#include <string>
using namespace std;
int main(){
string s, inter, s2;
int q, a, b;
cin >> s >> q;
for (int i = 0; i < q; i++){
cin >> inter >> a >> b;
if (inter == "replace"){
cin >> s2;
s = s.substr(0, a) + s2... | 1 | 17,205,790 |
#include <bits/stdc++.h>
#include <chrono>
using namespace std;
using namespace std::chrono;
#define ll long long
#define ld long double
#define ull unsigned long long
#define endl "\n"
ll google_itr = 1;
#define google(x) cout<<"Case #"<<x<<":"
#define pi 3.14159265358979323846264338327950L
const ll mod = 1e9+... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for(ll (i) = 0LL;(i) < (ll)(n);(i)++)
#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)
#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);... | 1 | 30,750,432 |
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define fastio() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define loop(i,a,b) for(int i=a;i<b;i++)
#define test() int t;cin>>t;loop(test,1,t+1)
#define pb push_back
#define eb emplace_b... | #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 | 31,018,972 |
#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 << "] " ... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <list>
#include <string>
#include <map>
#include <vector>
#include <stack>
#include <queue>
#include <iomanip>
using namespace std;
#define REPD(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) REPD(i, 0, n)
#define DIV0 1... | 1 | 96,566,368 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#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;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(20) << fixed;
long long n;
cin >> n;
vector<long long> timetonextst(n);
vector<long long> firsttrain(n);
vector<long long> cycle(n);
for(long long i = 0; i < n-1; i++){
cin >> t... | 1 | 10,527,053 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
vector<int> dx = {-1, -1, -1, 0, 0, 1, 1, 1};
vector<int> dy = {-1, 0, 1, -1, 1, -1, 0, 1};
int main () {
... | #include<iostream>
#include<queue>
#include<string>
#include<cmath>
#include<cstdio>
#include<cctype>
#include<cstring>
#include<iomanip>
#include<cstdlib>
#include<ctime>
#include<set>
#include<map>
#include<utility>
#include<vector>
#include<stack>
#include<sstream>
#include<algorithm>
using namespace std;
#define ll... | 1 | 32,724,866 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int A,B,C;
cin>>A>>B>>C;
int Max=max(max(A,B),C);
cout<<9*Max+A+B+C<<endl;
return 0;
} | #pragma GCC optimize("Ofast")
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define all(a) (a).begin(), (a).end()
int main() {
int A, B, C;
cin >> A >> B >> C;
cout << max(10 * A + B + C,max( A + 10 * B + C, A + B + 10 * C)) << endl;
} | 1 | 481,091 |
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <numeric>
#include <set>
#include <cstdlib>
#include <queue>
#include <map>
#include <cstdio>
using namespace std;
typedef long long llint;
typedef long double ld;
#define inf 1e18
#define mod 1000000007
template<clas... | #include<iostream>
#include<cmath>
#include<algorithm>
#include<string>
#include<cctype>
#include<vector>
#include<queue>
using namespace std;
#define I int
#define D double
#define F float
#define C char
#define S string
#define B bool
#define L long long
#define rep(n) for(int i=0;i<n;i++)
#define reps(m,n,c) for(int... | 1 | 2,974,692 |
#include<bits/stdc++.h>
using namespace std;
int main( void )
{
int N, Y;
cin >> N >> Y;
int res10000 = -1, res5000 = -1, res1000 = -1;
for( int i = 0; i <= N; i++ ) {
for( int j = 0; i + j <= N; j++ ) {
int k = N - i - j;
if( 10000 * i + 5000 * j + 1000 * k == Y ) {
res10000 = i;
res5000 = j;... | #include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main(){
int N, Y;
cin >> N >> Y;
for(int i = 0; i <= N && i * 10000 <= Y; i++){
for(int j = 0; j <= N - i && j * 5000 <= Y - i * 10000; j++)
if(i * 10000 + j * 5000 + (N - i - j) * 1000 ... | 1 | 24,514,529 |
#include<iostream>
using namespace std;
int main()
{
int x,N;
cin >> N;
x = N/3;
cout << x <<endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef ... | 1 | 40,643,386 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<bool> vb;
#define pb push_back
#define fi first
#define se second
#define in insert
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x... | #include <bits/stdc++.h>
#include <vector>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define ll long long
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if(a == 1) a+= 100;
if(b == 1) b+= 100;
if(a > b) cout << "Alice" << endl;
else if(a < b) cout << "Bob" << endl;
else cout << "Draw" << en... | 1 | 60,031,604 |
#include <bits/stdc++.h>
using ll = long long;
using ld = long double;
#define F first
#define S second
const ll mod = 1e9 + 7;
const ll INF = 922337203685477;
#define pb push_back
#define deb(x) cout << '>' << #x << ':' << x << endl;
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);
#define maxN 200007
usin... | #include "bits/stdc++.h"
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int a[n];
for(int& i : a)cin >> i;
int mx=a[0];
long long stool=0;
for(int i=1;i<n;i++){
if(a[i]<mx){
stool+=mx-a[i];
}
else{
... | 1 | 81,344,913 |
#include <iostream>
#include <tuple>
#include <algorithm>
int N {}, M {};
int princess(std::tuple<int, int> t[])
{
std::sort(t, t + N);
std::reverse(t, t + N);
for (int i {}; i < N; ++i)
if (std::get<1>(t[i]) <= M)
{
M -= std::get<1>(t[i]);
std::get<1>(t[i]) = 0;
... | #include <iostream>
#include <utility>
#include <algorithm>
using namespace std;
int n,m;
int kitaichi(pair<int,int>* pd, int size){
int sum = 0;
for(int i=0;i<n;i++){
sum += pd[i].first*pd[i].second;
}
return sum;
}
int solve(){
pair<int,int> pd[10000];
for(int i=0;i<n;i++){
int... | 1 | 63,507,720 |
#include <iostream>
using namespace std;
int main() {
int card,len1,len2,ten1=0,ten2=0;
cin >> card;
for(int i=0;i<card;i++){
string n1,n2;
cin >> n1 >> n2;
if(n1>n2){
ten1+=3;
}
else if(n2>n1){
ten2+=3;
}
else {
ten... | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, t=0, h=0;
string t_card,h_card;
cin >> n;
while(n--){
cin>> t_card >> h_card;
if(t_card > h_card)
t += 3;
else if(t_card < h_card)
h += 3;
else{
t++;
... | 1 | 33,989,014 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
constexpr int INF = 2e9;
int main() {
int n, m, k;
cin >> n >> m >> k;
int ok = 0;
for (int i = 0; i <= n; i++) {
int ... | #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <map>
#include <set>
#include <tuple>
#include <bitset>
#include <cstdio>
#include <cmath>
#include <iomanip... | 1 | 73,097,459 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,K;
string S;
cin>>N>>S>>K;
char X=S.at(K-1);
for(int Y=0;Y<N;Y++){
if(S.at(Y)==X){
cout<<X;
}
else{
cout<<'*';
}
}
} | #include<bits/stdc++.h>
#define ll long long
#define fixed cout.setf(ios::fixed);
#define rep1 for( i=0; i<n; i++)
#define Precise cout.precision(7);
using namespace std;
int main()
{
ll i,j,n,k;
char key;
string s;
cin>>n>>s>>k;
key=s[k-1];
for(i=0;s[i];i++)
{
if(key!=s[i])
... | 1 | 61,137,532 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int k; cin >> k;
string s; cin >> s;
if(s.size()<=k){
cout << s;
return 0;
}
cout << s.substr(0,k)+"...";
} | #include <bits/stdc++.h>
using namespace std;
#define DBG(x) \
(void)(cout << "L" << __LINE__ \
<< ": " << #x << " = " \
<< (x) << '\n')
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.... | 1 | 84,915,114 |
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define endl '\n'
int mod=1e9+7;
int mod2=998244353;
signed main(){
while(true){
int n,a,b,c,x;
cin>>n>>a>>b>>c>>x;
if(!n&&!a&&!b&&!c&&!x)break;
vector<int> y(n);
for(int i=0;i<n;i++)cin>>y[i];
int np=0;
bool f=false;
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
typedef vector<VI> VVI;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;
const int ... | 1 | 60,805,432 |
#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 <iostream>
#include <vector>
#include <algorithm>
using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))
int const nmax = 100000;
int v[1 + nmax];
int main() {
int n, lim;
std::cin >> n >> lim;
for(int i = 1;i <= n; i++)
std::cin >> v[i];
int i... | 1 | 88,926,883 |
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#define fo(i,a,b) for(i=a;i<=b;i++)
#define fd(i,a,b) for(i=a;i>=b;i--)
using namespace std;
const int N=200000,M=1000000500;
int i,j,n;
int a[N+5],now,sum,num,l,r,mid,top;
int z[N*100][2];
bool bz;
int read()
{
int x=0;char s=getchar();
while ((s... | #include <cstdio>
#include <cstring>
#define N 200010
#define mem(x, a) memset(x, a, sizeof x)
#define fo(x, a, b) for (int x = (a); x <= (b); x++)
#define fd(x, a, b) for (int x = (a); x >= (b); x--)
using namespace std;
int n, a[N], b[N], z[N][2];
inline int read() {
int x = 0, f = 0; char c = getchar();
while (c <... | 1 | 57,101,584 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b;
cin>>a>>b;
if(a*b==15) cout<<"*";
if(a+b==15) cout<<"+";
if(a+b!=15&&a*b!=15) cout<<"x";
return 0;
} | #include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using lint = long;
using llint = long long;
using namespace std;
int main() {
fastIO;
int a, b;
cin >> a >> b;
if (a ... | 1 | 65,833,542 |
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
int n, m;
cin >> n >> m;
int maxL = 0, minR = n;
for(int i = 0; i < m; ++i)
{
int l, r;
cin >> l >> r;
if(maxL < l) maxL = l;
if(minR > r) minR = r;
}
int ans = max(minR - maxL + 1, 0);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define intll int long long
const int INF = 1e9;
const int MOD = 1e9 + 7;
int main() {
int n , m ;
cin >> n >> m ;
int l=0 , r = INF ;
rep(i,n){
int a,b ;
cin >> a >> b... | 1 | 63,841,249 |
#include<iostream>
#include<cstring>
int rollDice(int& diceTopFace, int& diceFront, int& dice1, int& dice2, int& dice3, int& dice4, int& dice5, int& dice6);
int main(){
int question;
int diceTopFace;
int diceFront;
int ans;
int dice1;
int dice2;
int dice3;
int dice4;
int dice5;
int dice6;
std::cin >> dice1 >... | #include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
class Dice {
public:
int a, b, c, d, z, f;
Dice(int a, int b, int c, int d, int z, int f) {
this->a = a;
this->b = b;
this->c = c;
this->d = d;
this->z = z;
... | 1 | 69,611,773 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
int main(void){
int a,b; cin>>a>>b;
cout<<(a-1)*(b-1)<<endl;
} | #include<bits/stdc++.h>
using namespace std;
using p=pair<int,int>;
#define int long long
#define rep(i,N) for(int i=0;i<N;i++)
signed main(){
int A,B;
cin>>A>>B;
A--;
B--;
cout<<A*B<<endl;
return 0;
} | 1 | 98,511,273 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<int >visited(n,-1);
vector<vector<int > >adj(n);
for(int i=0,a,b;i<m;i++){
cin>>a>>b;
adj[a-1].push_back(b-1);
adj[b-1].push_back(a-1);
}
queue<int >q;
visited[0]=0;
q.push(0);... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<LL>;
using VVLL = vector<VLL>;
using VS = vector<string>;
using PII = pair<int,int>;
using VP = vector<PII>;
using VB = vector<bool>;
using VVB = vector<VB>;
#def... | 1 | 69,771,256 |
#include <iostream>
using namespace std;
int main() {
int n;cin>>n;
int ans = 0;
for(int i=n;i>0;--i){
string tmp = to_string(i);
if(tmp.size()%2==1)++ans;
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int digits(int x) {
int result = 0;
while (x) {
result++;
x /= 10;
}
return result;
}
int main() {
int N;
cin >> N;
int ans = 0;
for (int i = 1; i <= N; i++) {
if (d... | 1 | 11,453,390 |
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define x first
#define y second
#define mk(a,b) make_pair(a,b)
#define rr return 0
#define sqr(a) ((a)*(a))
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()... | #include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstring>
#include <chrono>
#include <complex>
#define int long long int
#define vi vector<int>
#define vvi vector < vi >
#define pii pair<int,int>
#define mod 1000000007
#define inf 1000000000000000001
#define all(c) c.begin(),c.en... | 1 | 82,258,364 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int math_number = 0;
cin >> math_number;
int total_math_number = math_number * math_number;
int white_math;
cin >> white_math;
int black_math = total_math_number - white_math;
cout << black_math << endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int n,a,b,c;
for(;;){
cin>>n;
cin>>a;
c=n*n;
if(0<=n&&n<=100&&0<=a&&a<=c){
b=c-a;
cout<<b<<endl;
break;
}
}
} | 1 | 28,896,759 |
#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 rall(x) x.rbegin(), x.rend()
#define fi first
#define se second... | #include <bits/stdc++.h>
using namespace std;
# define ll long long
# define endl "\n"
# define str string
# define vll vector<ll>
# define pb push_back
# define mll map<ll,ll>
# define mp make_pair
# define ff first
# define ss second
# define pll pair<ll,ll>
# define f(x,y) for(int x=0;x<y;x++)
int main(){
ios_ba... | 1 | 37,524,927 |
#include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
#include<string>
using namespace std;
int main()
{
string op;
int num;
priority_queue<int>pq;
while (cin >> op)
{
if (op == "end") break;
if (op == "insert")
{
cin >> num;
pq.push(num);
}
else if (op == "extract")
{
cout << ... | #include <iostream>
using namespace std;
class priorityQueue {
private:
long *queueArray;
long size;
public:
priorityQueue() {
this->queueArray = new long[2000001];
this->size = 0;
}
void insert(long num) {
this->queueArray[size+1] = num;
size++;
heapfyInsert(... | 1 | 59,701,501 |
#pragma target("avx")
#pragma optimize("O3")
#include<bits/stdc++.h>
using ll = int_fast64_t;
using P = std::pair<ll,ll>;
using PP = std::pair<ll,P>;
using V = std::vector<ll>;
template<typename T> using pq = std::priority_queue<T>;
template<typename T> using rpq = std::priority_queue<T, std::vector<T>, std::greater<T>... | #include <iostream>
#include <vector>
#include <cmath>
#include <iomanip>
#include <algorithm>
#include <map>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
int main() {
long long n,ans=0,str=0,sum=0;
cin>>n;
vector<long long>a(n),cnt(n);
rep(i,n){
cin>>a[i];
sum+=a[i];
cnt[i]=sum;
}... | 1 | 97,204,919 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n;
while(cin >> n, n){
vector<int> v(n);
for(int i = 0; i < n; i++) cin >> v[i];
sort(v.begin(), v.end());
int ans = 1e9;
for(int i = 0; i < n - 1; i++){
ans = min(ans, abs(v[i] - v[i + 1]));
... | #include <bits/stdc++.h>
using namespace std;
using VI = vector<long>;
int main() {
while (1) {
long n;
cin >> n;
if (!n) {
return 0;
}
VI v;
for (int i = 0; i < n; i++) {
long a;
cin >> a;
v.push_back(a);
}
sort(v.begin(), v.end());
long diff = 1e9;
for... | 1 | 80,121,815 |
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
using Graph = vector<vector<int>>;
int main() {
int N, M;
cin >> N >> M;
Graph G(N);
for (int i = 0; i < M; ++i) {
int a, b;
cin >> a >> b;
a--, b--;
G[a].push_back(b);
G[b].push_back(a);
}
vector<int> sign(N, -1... | #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 | 23,897,151 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,A,B,sum=0,tmp,j;
cin >> N >> A >> B;
for(int i=1;i<N+1;i++){
j=i;
while(j>0){
tmp += j%10;
j = j/10;
}
if(tmp>=A && tmp <=B){
sum += i;
}
tmp=0;
}
cout << sum << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
int sum_keta(int n){
int ans = 0;
while(n > 0){
ans += n % 10;
n /= 10;
}
return ans;
}
signed main(){
int n, a, b;
cin >> n >> a >> b;
int ans = 0;
for(int i = 1; i <= n; i++){
if(sum_keta(i) >= a && sum_keta(i) <= b) ans += i;
}
cout << ans ... | 1 | 18,128,811 |
#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<utility>
#include<math.h>
#include<cstdlib>
#define rep(i, n) for(int i=0;i<n;i++)
#define repb(i, a, b) for(int i=a;i<b;i++)
using namespace std;
typedef pair<int, int> P;
typed... | #include <bits/stdc++.h>
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define PRINT(V) cout << V << "\n"
#define SORT(V) sort((V).begin(),(V).... | 1 | 19,762,029 |
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
int main(){
long long n;
cin>>n;
vector<long long> dis(n);
vector<long long> a(n),b(n);
for(long long i=0;i<n;i++){
cin>>a.at(i);
}
for(long long i=0;i<n;i++){
cin>>b.at(i);
dis.at(i)=b.at(i)-a.at(i);
... | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define eb emplace_back
#define mk make_pair
#define pr pair<int,int>
#define all(x) x.begin(),x.end()
#define mod 1000000007
int main(){
ios_base::sync_with_stdio(false);
int n; cin>>n;
vector<int> a(n),b(n);
ll sum1=0,sum2=0;
for(int i=0;... | 1 | 81,155,900 |
#include <iostream>
#include <string>
using namespace std;
class Cell
{
private:
int key;
Cell *prev, *next;
public:
Cell(int x, Cell* prev, Cell* next)
{
key = x;
this->prev = prev;
this->next = next;
}
int getKey() { return key; }
void setKey(int key) { this->key = key; }
Cell* getPrev() { return prev; ... | #include <iostream>
#include <algorithm>
#include <string>
#include <string.h>
#include <stdio.h>
#include <cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
struct list {
int key;
list *next,*prev;
};
list *head, *tail, *p;
void insert_x(int key) {
list *make = new list;
make->key = key;
if (head =... | 1 | 93,264,434 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define si(x) scanf("%d", &x)
#define sll(x) scanf("%lld", &x)
#define ssll(x,y) scanf("%lld %lld", &x ,&y)
#define sd(x) scanf("%lf", &x)
#define l0(i,n) for(ll i=0; i<n; i++)
#define MAX ... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll>pi;
const int MAXN=100005;
const int MOD=1000000007;
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define DEC(i,a,b) for(int i=(a);i>=(b);i--)
#define fst first
#define snd second
#define pb push_back
#define sz(v) ((int)(v).size())
#... | 1 | 23,759,665 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define INF 1000000000
#define rep(i,a,b) for(int i =(a);i<(b);i++)
#define fs first
#define ss second
inline int Scan() {
int x=0;... | #include<iostream>
#include<string>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<list>
#include<cstdint>
#include<bits/stdc++.h>
#include<queue>
#include<set>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for(int i = n-1; i >= 0; i--)
#define rep1(i, n) for(i... | 1 | 30,125,977 |
#include<cstdio>
int const maxN=100001;
int a[maxN],place[maxN];
long long ncr[maxN],mcr[maxN];
long long const p=1e9+7;
long long inv(long long n){
long long r0=n,r1=p,r2,a0=1,a1=0,a2,b0=0,b1=1,b2,q1;
while(r1>0){
q1=r0/r1;
r2=r0%r1;
a2=a0-q1*a1;
b2=b0-q1*b1;
r0=r1;
... | #include <bits/stdc++.h>
#define mset(a,b) memset(a,b,sizeof a)
#define mcpy(a,b) memcpy(a,b,sizeof b)
#define max(a,b) ((a)<(b)?(b):(a))
#define min(a,b) ((a)<(b)?(a):(b))
#define swap(a,b) a^=b^=a^=b
#define lb(x) ((x)&(-(x)))
#define dalao 1000000007
#define inf 0x3f3f3f3f
#define N 100010
using namespace std;
typed... | 1 | 64,176,277 |
#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define mod2 998244353
#define PI 3.14159265
#define ll long long
#define ld long double
#define pi pair<ll,ll>
#define pb push_back
#define vi vector<ll>
#define sz size()
#define fi first
#define se second
#define lz length()
#define all(x) (x).begi... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <math.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using ll = long long;
u... | 1 | 17,554,951 |
#include<iostream>
#include<cmath>
#include<stdio.h>
using namespace std;
int main(){
double a, b, C, x, S, L, h;
cin >> a >> b >> C;
C = C*3.1415926535 / 180;
h = b*sin(C);
S = a*h / 2;
x = pow(a,2)+pow(b,2) - 2 * a*b*cos(C);
x = sqrt(x);
L = a + b + x;
printf("%f\n%f\n%f\n", S, L, h);
return 0;
} | #include<iostream>
#include<cmath>
#include<string>
#include<cstdio>
using namespace std;
int main() {
double a, b, C;
cin >> a >> b >> C;
C = C * M_PI / (double)180;
double S = (double)1/(double)2 * a * b* (double)sin(C);
double L = a + b + (double)sqrt(pow(a, 2) + pow(b, 2) - ((2 * a *b * (double)cos(C))));... | 1 | 86,435,476 |
#include <bits/stdc++.h>
#define rep(i, N) for (ll i = 0; i < N; i++)
#define rep1(i, N) for (ll i = 1; i <= N; i++)
#define repr(i, N) for (ll i = N-1; i >= 0; i--)
#define repr1(i, N) for (ll i = N; i > 0; i--)
#define MOD 1000000007
using ll = long long;
using namespace std;
typedef pair<int,int> P;
typedef vector<i... | #ifdef LOCAL
#define _GLIBCXX_DEBUG
#define __clock__
#else
#pragma GCC optimize("Ofast")
#endif
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;
template <typename A,... | 1 | 67,165,893 |
#include <iostream>
using namespace std;
int main() {
int a,b=0;
while(1){
cin >> a;
if(a==0) break;
a=1000-a;
if(a>=500){
a-=500;
b++;
}
while(1){
if(a<100) break;
a-=100;
b++;
}
if(a>=50){
a-=50;
b++;
}
while(1){
if(a<10) break;
a-=10;
b++;
}
if(a>=5){
a-=5;
... | #include <iostream>
#include <vector>
#include <string>
using namespace std;
int main(){
int n;
while(cin >> n&& n!=0){
int sum=0,pri=1000-n;
while(pri>=500){
pri -=500;
++sum;
}
while(pri>=100){
pri -=100;
++sum;
}
while(pri>=50){
pri -=50;
++sum;
}
while(pri>=10){
pri -=10;
+... | 1 | 93,035,538 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ldouble = long double;
const ll inf = 1ll << 60;
const ll mod = (ll)1e9 + 7;
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define print(s) cout << s;
#define println(s) cout << s << endl;
... | #include <bits/stdc++.h>
#define pb push_back
#define SZ(x) ((int)(x.size()))
#define FOR(i,s,n) for (ll i = (s); (i) < (n); ++i)
#define FORD(i,s,l) for (ll i = (s); (i) >= l; --i)
#define F first
#define S second
#define TC int __tc; cin >> __tc; FOR(case_num,1,__tc+1)
#define TEST(x,i) ((x)&(1ll<<(i)))
#define SET(x... | 1 | 23,983,328 |
#include <bits/stdc++.h>
using namespace std;
int main(void){
int k,s;
int ans = 0;
cin >> k >> s;
for(int i=0;i<=k;i++) {
for(int j=0;j<=k;j++) {
int z=s-i-j;
if(0<=z && z<=k) ans++;
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
int main(){
int k,s; cin>>k>>s;
int c=0;
rep(i, k+1){
rep(j, k+1){
int z=s-(i+j);
if(z<=k && z>=0)
... | 1 | 11,052,124 |
#include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <numeric>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
int MOD = 1000000007;
temp... | #include<iostream>
using namespace std;
int main() {
int n; cin >> n;
cout << 800 * n - 200 * (n / 15) << endl;
return 0;
} | 1 | 15,929,140 |
#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define ld long double
#define pb push_back
#define mp3 make_pair
#define rep1(i,a,b) for(ll i=a;i<=b;i++)
#define rep2(i,a,b) for(ll i=a;i<b;i++)
const ll mod=998244353;
... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main()
{
ll a,b,c,d,e,f,g,h,t,tt,ans;
cin>>a>>b>>c>>d;
e=a*c;
f=a*d;
g=b*c;
h=b*d;
t=max(e,f);
tt=max(g,h);
ans=max(t,tt);
cout<<ans<<endl;
} | 1 | 39,804,741 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef long int li;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
typedef pair<ll, ll>P;
#define PI 3.14159265359
#define MOD 998244353
const int MAX = 510000;
int main() {
int N,K;
cin>>N>>K;
vector<ll>V(N);
rep(i... | #include <iostream>
#include <string>
#include <stack>
#include <queue>
#include <cctype>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <stdlib.h>
#include <tuple>
#include <iomanip>
#include <iterator>
#include <stdio.h>
#include <fstream>
#include <time.h>
using namesp... | 1 | 24,287,381 |
#include<bits/stdc++.h>
typedef long long int lli;
typedef long double lld;
typedef long long ll;
#define vi vector<int>
#define vlli vector<long long int>
#define vvi vector<vector<int>>
#define vvlli vector<vector<long long int>>
#define ppi pair<int, int>
#define rppi pair<int, pair<int, int>>
#define lppi pair<pair... | #include <iostream>
#include <vector>
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; }
const int INF = 1 << 30;
int main()
{
int n;
int k;
cin >>... | 1 | 34,343,232 |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int N;
cin>>N;
cout<<ceil((float)N/2)-1;
} | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int n;
cin>>n;
cout<<(n+1)/2-1<<endl;
return 0;
} | 1 | 70,001,368 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
int ans = n * 800 - n / 15 * 200;
cout << ans << endl;
return 0;
} | #include<iostream>
using namespace std;
int main()
{
int a,x,y;
cin>>a;
cout<<a*800-a/15*200;
return 0;
} | 1 | 15,332,459 |
#pragma GCC optimize("O3", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
using pii = pair<int, int>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using Prior = priority_queue<T>;
#define X first
#define... | #include <iostream>
#include <cstdint>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unorder... | 1 | 62,354,340 |
#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,b,a) for(int i=b;i>=a;i--)
#define fori(a) for(auto i : a )
#define all(a) begin(a), end(a)
#define set(a,b) memset(a,b,sizeof(a))
#define sz(a) a.size()
#define pi 3.14159
#define ll long long
#define ull unsigned long long
#define pb push... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
int n, m, k, ans = 0;
cin >> n >> m >> k;
char M[n][m];
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
cin >> M[i][j];
for (int p = 0; p < (1 << n); p++) {
for (... | 1 | 87,696,160 |
#include<bits/stdc++.h>
using namespace std;
long long ans;
int a[200010];
int n;
int main()
{
cin >> n;
for(int i = 1; i <= n; i++)
{
cin >> a[i];
}
for(int i = 2; i <= n; i++)
{
if(a[i] < a[i-1])
{
ans += (a[i-1] - a[i]);
a[i] = a[i-1];
}
}
cout << ans << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
void solve()
{
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
cin>>arr[i];
long long ans=0;
int maxx=0;
for(int i=0;i<n;i++)
{
maxx=max(maxx,arr[i]);
ans+=maxx-arr[i];
}
cout<<ans<<endl;
}
int main()
{
solve();
} | 1 | 87,839,856 |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(int)(b);i++)
#define rep(i,n) FOR(i,0,n)
#define ZERO(a) memset(a,0,sizeof(a))
int dp[1020][1020];
int lcs(string x, string y) {
int n=x.size(), m=y.size();
rep(i,n) rep(j,m) {
if(x[i] == y[j])
dp[i+1][j+1] = d... | #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... | 1 | 34,908,757 |
#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()... | #include <bits/stdc++.h>
using namespace std;
int main(){
long r, d, x2000;
cin >> r >> d >> x2000;
long prev = x2000;
for (int i = 0; i < 10; i++) {
long buf = r * prev - d;
cout << buf << endl;
prev = buf;
}
} | 1 | 98,859,138 |
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <vector>
#include <cctype>
#include <algorithm>
#include <functional>
#include <cmath>
#include <string>
#include <cstring>
#include <vector>
#include <numeric>
#include <iomanip>
#include <limits>
#define roop(i, n) for(int i=0;i<n;i++)
#define D... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sonic ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
ll a[100010];
int main () {
sonic
int n1,n2,n3,n4;
cin>>n1>>n2>>n3>>n4;
int q = 0;
if(n1 == n2 || n1 == n3 || n1 == n4 || n2 == n3 || n2 == n4 || n3 == n... | 1 | 73,448,421 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1000000000;
int main() {
int n, m; cin >> n >> m;
tuple<int, int, int> e[m];
for (int i = 0; i < m; i++) {
int a, b, c; cin >> a >> b >> c;
a--; b--;
e[i] = make_tuple(a, b, c);
}
int d[n][n];... | #include <iostream>
#include <vector>
#include <queue>
#define rep(i, n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
static const int N = 100;
static const int M = 21000;
static const int INF = N * M + 1;
vector<P> adj[N];
int a[M], b[M], c[M];
int n, mat[N][N], p[N... | 1 | 58,447,406 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
#define out(x) cout << x << endl
#define INF 1000000;
#include <map>
#include <math.h>
using ll = long long;
using nam... | #include<iostream>
using namespace std;
int main(void)
{
int r; cin>>r;
if(r<2800){
if(r<1200){
puts("ABC");
}else{
puts("ARC");
}
}else{
puts("AGC");
}
return 0;
} | 1 | 56,579,324 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
int N;
void input() {
cin >> N;
}
int main() {
input();
vector<ll> w(N + 1);
w[0] = 2;
w[1] = 1;
for (int i = 2; i <= N; i++) w[i] = w[i - 1] + w[i -... | #include <bits/stdc++.h>
using namespace std;
void IA(vector<int> &vec) {
for (int i=0; i<vec.size(); i++) cin >> vec.at(i);
}
void PA(vector<int> vec) {
for (int i=0; i<vec.size()-1; i++) cout << vec.at(i) << " ";
cout << vec.at(vec.size()-1) << endl;
return;
}
int main() {
int n; cin >> n;
vec... | 1 | 11,450,211 |
#include <bits/stdc++.h>
using namespace std;
#define ll unsigned long long int
#define mod 1000000007
bool isPrime[1000001];
ll power(ll a,ll b)
{
ll result = 1;
while(b>0)
{
if(b%2)
{
result = (a*result)%mod;
}
a = (a*a)%mod;
b = b/2;
}
return re... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define rep(i,n) for(int i = 0;i < (n); i++)
int main() {
int x, n;
int i, j;
int buf;
cin >> x >> n;
int a[201] = { 0 };
int ans;
rep(i, n) {
cin >> buf;
a[buf]++;
}
for (i = 0; i <= 100; i++) {
if (x - i >= 0) {
if (a[x - i] == 0) {
... | 1 | 12,987,254 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.