code1 stringlengths 54 12k | code2 stringlengths 66 12k | similar int64 0 1 | __index_level_0__ int64 24 101M |
|---|---|---|---|
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i, m, n) for(int i = (int)(m); i < (int)(n); ++i)
int main()
{
int N, Z, W;
cin >> N >> Z >> W;
vector<int> a(N);
REP(i, N) cin >> a[i];
if(N == 1) cout << abs(W-a[0]) << endl;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, Z, W; cin >> N >> Z >> W;
vector<int> a(N); for (auto &x : a) cin >> x;
if (N == 1) cout << abs(W - a[0]) << endl;
else cout << max(abs(W - a[N-1]), abs(a[N-2] - a[N-1])) << endl;
} | 1 | 76,795,319 |
#include<iostream>
#include<set>
#include <bitset>
#include<queue>
#include<vector>
#include<map>
#include<stack>
#include <cstdio>
#include<algorithm>
#include <sstream>
#include<string>
#include<string.h>
#include <cmath>
#include <iomanip>
#include <string>
#include<list>
#include <limits>
#include <numeric>
#includ... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<int> ans = {};
for (int i = 3; i * (i - 1) / 2 <= 100000; i++) {
ans.push_back(i * (i - 1) / 2);
}
bool flag = false;
int keep = 0;
for (int i = 0; i < ans.size(); i++) {
if (N == ans[i]) {... | 1 | 76,785,326 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin()... | #include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int x[N],w[N];
int main()
{
int n,l,t;
scanf("%d %d %d",&n,&l,&t);
for(int i=1;i<=n;i++)scanf("%d %d",&x[i],&w[i]);
int pos=0;
for(int i=1;i<=n;i++)
{
if(w[i]==1)x[i]+=t;
else x[i]-=t;
pos+=x[i]/l;
if(x[i]%l<0)pos--;
x[i]=(x[i]%l+l)%l;
}
... | 1 | 92,936,383 |
#include<iostream>
#include<cstdio>
using namespace std;
int main(){
int a[10000],n,i,j,t,c=0,min; cin>>n;
for(i=0;i<n;i++)cin>>a[i];
for(i=0;i<n;i++){
min=i;
for(j=i;j<n;j++){
if(a[j]<a[min])min=j;
}
if(i!=min){
t=a[min];
a[min]=a[i];
a[i]=t;
c++;
}
}
for(i=0;i<n;i++){
if(i)cout<<" ";... | #include<stdio.h>
#include <sstream>
#include <iostream>
#include <cstdlib>
using namespace std;
#define BUF_SIZE 1024
#define ARRAY_SIZE 100
void selectionSort(int array[],int n,int& change_count)
{
int min;
for(int i = 0; i < n-1; i++){
min = i;
for(int j = i+1; j < n; j++){
if(array[j] < array[min]){
m... | 1 | 32,098,548 |
#include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << "debug" << x << endl;
using namespace std;
int main(){
int w,h,x,y,r;
while(cin >> w >> h >> x >> y >> r){
bool c = true;
if(x - r < 0 || x + r > w) c = false;
... | #include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int w, h, x, y, r;
cin >> w >> h >> x >> y >> r;
cout << (x >= r && x <= w - r && y >= r && y <= h - r ? "Yes" : "No") << endl;
return 0;
} | 1 | 44,905,863 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include<deque>
#include<cmath>
#include<map>
#include<cstring>
#include<iomanip>
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 6;
const ll MOD = 1e9 + 7;
const ll LLINF = 1LL<<60;
#define P pair<int, int>
#define rep(i, n) for (... | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
ll ans = pow(n/k,3);
if (k&1) cout << ans << endl;
else {
ans += pow(n/(k/2)-n/k,3);
cout << ans << endl;
}
} | 1 | 15,994,278 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int A,B,M; cin>>A>>B>>M;
vector<int> a(A); for(int i=0;i<A;i++) cin>>a.at(i);
vector<int> b(B); for(int i=0;i<B;i++) cin>>b.at(i);
int mina=*min_element(a.begin(),a.end());
int minb=*min_element(b.begin(),b.end());
int ans=mina+minb;
for(int i=0;i<... | #include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int min(vector<int> x) {
int min = -1;
rep(i, x.size()) {
if(min == -1 || min > x[i])
min = x[i];
}
return min;
}
int main() {
int A, B, M;
cin >> A >> B >> M;
... | 1 | 94,968,680 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define bn(n) (n).begin(), (n).end()
#define FOR(n) for(int i = 0; i < (int)n; i++)
void solve() {
int a, b, c;
cin >> a >> b >> c;
for (int i = 1; i <= b; i++) {
if (a*i % b == c) {
... | #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 a, b, c;
cin >> a >> b >> c;
map<ll, ll> mp;
ll i = 1;
while (mp[(a * i) % b] == 0) {
mp[(a * i) % b]++;
if ((a * i) % b == c) {
cout << "YE... | 1 | 42,790,260 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
int arr[n+1];
double sum=0;
for(int i=0;i<n;i++)
{
cin>>arr[i];
sum+=arr[i];
}
int count=0;
for(int i=0;i<n;i++)
{
if(arr[i]>=(sum/(4*m)))
{
count++;
}
}
if(cou... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;
#define ll long long
#define ld long double
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
#define sz(x) ((int)(x).size())
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
#define all(x) (x).begi... | 1 | 81,327,202 |
#include <bits/stdc++.h>
using namespace std;
const int INF=123456789;
typedef pair<int,int> P;
char g[1001][1001];
int H,W;
int d[1001][1001];
int ans=0;
int dx[4]={1,0,-1,0}, dy[4]={0,1,0,-1};
queue<P> que;
void bfs(){
while(que.size()){
P p=que.front();que.pop();
if(p.second==12345){
ans++;
if(... | #include <iostream>
#include <vector>
#include <deque>
#include <algorithm>
#include <numeric>
#include <string>
#include <cstring>
#include <list>
#include <unordered_set>
#include <tuple>
#include <cmath>
#include <limits>
#include <type_traits>
#include <iomanip>
#include <map>
#include <unordered_map>
#include <que... | 1 | 93,072,000 |
#include<bits/stdc++.h>
using namespace std;
void func(int nn,int mm);
int n,s;
int box[10];
int sum,cnt;
int main(void){
int i;
for(i=0;i<=9;i++) box[i]=i;
while(1){
cin>>n>>s;
if(n==0&&s==0) break;
sum=0;
cnt=0;
func(0,0);
cout<<cnt<<endl;
}
return 0;
}
void func(int nn,int mm){
int i;
if(mm==n){
... | #include <iostream>
using namespace std;
int c;
void search(int last, int s, int n)
{
if(n==0){
if(s==0) c++;
return;
}
if(n==1){
if(last<s&&s<10) c++;
return;
}
--n;
for(int i=last+1; i<10; i++){
search(i, s-i, n);
}
}
int main()
{
ios::sync_with_... | 1 | 61,121,148 |
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a,b) for(int a=0;a<b;a++)
#define Sort(a) sort(a.begin(),a.end())
#define rev(a) reverse(a.begin(),a.end())
#define fi first
#define se second
#define bgn begin()
#define sz size()
#define en end()
#define pb push_b... | #pragma region header
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rev(i, n) for(int i = (int)(n - 1); i >= 0; i--)
#define rev1(i, n) for(int i = (int)(n); i > 0; i--)
#define pb p... | 1 | 43,988,293 |
#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;
using ll = long long;
template<typename T> using V = std::vector<T>;
using Vi = V<int>;
using VVi = V<V<int>>;
using Vl = V<ll>;
using VVl = V<V<ll>>;
using Vs = V<string>;
template<typename T1, typename T2> using P = std::pair<T1, T2>;
using Pii = P<int, int>;
using Pll = ... | 1 | 46,846,431 |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define ALL(x) (x).begin(), (x).end()
#define REP(i ,n) for(int i = 0; i < (int)(n); i++)
#define pb push_back
typedef vector<int>vint;
typedef vector<ll>vll;
template<typename T> istream &operator>>(istream &is, vecto... | #include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <string>
#include <set>
#include <math.h>
#include <map>
#include <stack>
using namespace std;
static const int INF = 1e9+7;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, a,... | 1 | 67,788,653 |
#include <iostream>
int main(int argc, char const* argv[])
{
int h,w;
std::cin >> h >> w;
while (!(h==0&&h==w)) {
for (int i = 0; i < h; i++) {
for (int i = 0; i < w; i++) {
std::cout << "#" ;
}
std::cout << std::endl;
}
std::cout << std::endl;
std::cin >> h >> w;
}
return 0;
} | #include <iostream>
using namespace std;
int main(){
int h,w,i;
string ans="",temp="";
while(1){
cin>>h>>w;
if (h==0&&w==0)break;
else{
for (i=0;i<w;i++)temp+="#";
temp+="\n";
for (i=0;i<h;i++)ans+=temp;
cout<<ans<<endl;
ans="";temp="";
}
}... | 1 | 18,222,478 |
#include<vector>
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <cmath>
#include<queue>
#include <sstream>
#include <set>
const long long INF = 1000000007;
using namespace std;
typedef long long llong;
int main(){
llong N;
cin >> N;
v... | #include <iostream>
#include <vector>
#include <queue>
using namespace std;
int min(int a,int b){
return a<b?a:b;
}
int main(void){
int N;
vector<int> X;
cin >> N;
for(int i=0;i<N;i++){
int x;
cin >> x;
X.push_back(x);
}
int ans = 100000000;
for(int i=1;i<=100;i++... | 1 | 78,441,786 |
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
using namespace std;
struct dat {
double x, y;
double arg;
};
bool cmp(const dat& a, const dat&b){... | #include<bits/stdc++.h>
#include<string.h>
typedef long long int ll;
#define all(x) (x).begin(), (x).end()
using namespace std;
int nxt() {
int x;
cin >> x;
return x;
}
ll nxtl(){
ll x;
cin>>x;
return x;
}
void SieveOfEratosthenes(int n,vector <int> &primes)
{
bool prime[n+1];
memset(... | 1 | 73,704,269 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define printInt(a) printf("%d\n", a)
#define printll(a) printf("%lld\n", a)
#define printYes() printf("Yes\n")
#define printNo() printf("No\n")
#define scanll(a) scanf("%lld", &a)
#define scanInt(a) scanf("%d", &a)
#define scan2Int(a, b) scanf("%d... | #include <bits/stdc++.h>
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)
#define ALL(x) (x).begin(),(x).end()
#define SIZE(x) ((ll)(x).size())
#define MAX(x) *max_element(ALL(x))
#define MIN... | 1 | 66,765,944 |
#include <iostream>
#include <string>
int main (int argc, char *argv[])
{
while(true)
{
std::string str;
getline(std::cin, str);
int sum = 0;
for(int i = 0; i < (int)str.size(); ++i)
{
sum += str[i] - '0';
}
if(sum != 0)
{
std::cout << sum << std::endl;
}
else
{
break;
}
}
return 0;... | #include <bits/stdc++.h>
using namespace std;
int main(){
while(true){
string str;
cin >> str;
if(str=="0")break;
int ans=0;
for(string::iterator it=str.begin();it!=str.end();++it){
int t=*it-'0';
ans+=t;
}
cout << ans << endl;
}
return 0;
} | 1 | 66,825,425 |
#include <iostream>
#include <functional>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <iomanip>
#include <complex>
#include <random>
#include <bitset>
#include <list>
using namespace std;
#define repi(i,n) for(int i=... | #include <cstdio>
#include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <cmath>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#define rep(i,n) for (int i=0;i<n;i++)
using ll = long long;
using namespace std;
void solve(){
}
int main (){
... | 1 | 84,037,560 |
#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
int main()
{
string s, p;
cin >> s >> p;
string tmp = s... | #include <iostream>
#include <cctype>
#include <string>
#include <string.h>
using namespace std;
int main(){
string a, b;
cin >> a >> b;
a = a + a ;
if(a.find(b) != std::string::npos){
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | 1 | 31,492,401 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double pi=3.141592653589793;
typedef unsigned long long ull;
typedef long double ldouble;
const ll INF=1e18;
#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++)
const int MAX_S = 55;
int ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); i++)
... | 1 | 79,132,041 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,L;
cin >> N >> L;
vector<int> A(N);
for(int i=0;i<N;i++){
cin >> A.at(i);
}
bool a=false;
int C;
for(int i=0;i<N-1;i++){
if(A.at(i)+A.at(i+1)>=L){
C=i+1;
a=true;
break;
}
}
if(!a){
cout << "Impossible" ... | #pragma region
#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <iomanip>
#include <cstdint>
#include <bitset>
using namespace std;
typedef l... | 1 | 79,023,849 |
#include <iostream>
using namespace std;
int main()
{
while(1){
string s;
getline(cin,s);
int l = s.length();
if(l == 1 && s[0] == '0') break;
int sum = 0;
for(int i=0; i<l; i++){
sum += s[i] - '0';
}
cout << sum << endl;
}
return 0;
} | # include<iostream>
using namespace std;
int main() {
string str;
int b = 0;
while (1) {
cin >> str;
if (str=="0") break;
for (int i=0;i<str.size();i++) {
int x = str[i] - '0';
b += x;
}
cout << b << endl;
b = 0;
}
return 0;
} | 1 | 2,696,129 |
#include <bits/stdc++.h>
#define rep(l, r) for (int i = (l); i < (r); i++)
typedef long long ll;
using namespace std;
int main() {
int x, t;
cin >> x >> t;
cout << (x > t ? x - t : 0) << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int X = 0, t = 0;
int result = 0;
cin >> X >> t;
result = X - t;
if(result > 0) {
cout << result << endl;
} else {
result = 0;
cout << result << endl;
}
} | 1 | 40,803,777 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep1(i, n) for(int i = 1; i < n+1; i++)
#define sort(A) sort(A.begin(),A.end())
#define reverse(A) reverse(A.begin(),A.end());
#define vecmin(A) *min_element(A.begin(),A.end());
#define vecmax(A) *max_element(A.begin(),A.... | #include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
#include <map>
#include <vector>
#include <cmath>
using namespace std;
void a_one_card_poker(void) {
int a, b;
cin >> a >> b;
if (a == b) cout << "Draw" << endl;
else if (a == 1) cout << "Alice" << endl;
else if (b == 1) cout << "Bob" << ... | 1 | 47,129,295 |
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <c... | #include <iostream>
using namespace std;
int w, h;
string inp[21];
const int MAX=23;
int room[MAX][MAX];
int cnt;
void init(){
int i, j;
for(i=0; i<MAX; i++){
for(j=0; j<MAX; j++){
room[i][j]=0;
}
}
cnt = 0;
}
void dfs(int x, int y){
cnt++;
room[x][y]=0;
if(room[x... | 1 | 60,693,869 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,c,o;
cin>>a>>b>>c>>o;
int bneed=0;
int cneed=0;
bool shouldno=false;
while (a>=b)
{
if(o==0)
{
shouldno = true;
break;
}
b = b*2;
o--;
}
while (b>=c)
{... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define printl(s) cout << s << endl;
#define rep(i,n) for(int i=0;i<(n);i++)
using ll = long long;
using vvi = vector<vector<int>>;
const ll modSeed = pow(10,9) + 7;
const int INF = 1'000'000'000;
template <typename T>
vector<T> getVector(ll num){
... | 1 | 83,554,009 |
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, c, k;
cin >> n >> c >> k;
vector<int> t(n);
rep(i, n) cin >> t.at(i);
sort(t.begin(), t.end());
int cnt = 1;
int min_time = t.at(0);
int canPassenger = c;
for (int i = 0; i < n; i++) {... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,j,n) for(int i=(int)(j);i<(int)(n);i++)
#define REP(i,j,n) for(int i=(int)(j);i<=(int)(n);i++)
#define per(i,j,n) for(int i=(int)(j);(int)(n)<=i;i--)
#define int long long
#define ll long long
#define ALL(a) (a).begin(),(a).end()
#define pb push_back
#define mp... | 1 | 772,475 |
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define int ll
#define pb push_back
#define setbits(x) __builtin_popcountll(x)
#define endl "\n"
typedef long long ll;
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,k;
cin>>n>>k;
int val=0;
for(int i=0;i<(... | #include <iostream>
using namespace std;
int main() {
int m, k;
cin >> m >> k;
if (m == 0 && k == 0) {
cout << "0 0" << endl;
} else if (m == 1 && k == 0) {
cout << "0 0 1 1" << endl;
} else if (m >= 2 && k < (1 << m)) {
for (int i = 0; i < (1 << m); i++) {
if (i ... | 1 | 34,851,258 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF=1e+9;
const int MOD=1e+9+7;
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define REP2(i,a,b) for(ll i=a;i<(ll)(b);i++)
#define REPD2(i,a,b) for(ll i=a;i>(ll)(b);i--)
template<class T>
vector<T> make_v... | #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <math.h>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <iomanip>
#include <numeric>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll H,W;
ll A[101][101];
ll AA[101][101];
ll ans=0;
P C[101][101];
int kans... | 1 | 69,573,903 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define all(v) v.begin(), v.end()
const ll mod=1000000007;
ll countBits(ll in){
int res=0;
for(;in>0;in>>=1){
if((in&0x01)!=0){
res++;
}
}
return res;
}
template<typename T>... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int a,b,c;
std::cin >> a>>b>>c;
if (a!=b && a!=c && b!=c){
cout << "3" << endl;
}
else if (a==b && b==c) {
cout << "1" << endl;
}
else{
cout << "2" << endl;
}
return 0;
} | 1 | 54,411,952 |
#include <cstdio>
#include <queue>
#include <vector>
#define maxn 200005
using namespace std;
vector<int> G[maxn];
bool vis[maxn];
int bfs(int x)
{
queue<int> q;
q.push(x);
int cnt = 0;
while(!q.empty())
{
x = q.front(); q.pop();
if(vis[x]) continue;
vis[x] = true, cnt ++;
for(int v: G[x])
q.push(v);
}... | #include<bits/stdc++.h>
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define endl "\n"
#define int long long int
using namespace std;
int mod = 1e9 + 7;
vector<int> parent;
vector<int> rnk;
int Find(int i) {
if (i == parent[i])
return i;
return parent[i] = Find(parent[i]);
}
void Union(int a, i... | 1 | 76,012,328 |
#include <bits/stdc++.h>
using namespace std;;
#define ll long long
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P... | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <cmath>
#include <iomanip>
#include <numeric>
using namespace std;
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
typedef long long ll;
ty... | 1 | 3,167,772 |
#include<iostream>
#include<vector>
using namespace std;
int main(){
int a,b,m;
cin >> a >> b >> m;
vector<int> A(a,0);
vector<int> B(b,0);
int a_min = 1000000;
int b_min = 1000000;
for(int i=0;i<a;i++){
cin >> A[i];
if(a_min>A[i]) a_min = A[i];
}
for(int i=0;i<b;i++){
ci... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, M;
cin >> A >> B >> M;
vector<int>a(A);
vector<int>b(B);
vector<vector<int>>xyc(3, vector<int>(M));
for(int i=0; i<A; i++)cin >> a.at(i);
for(int i=0; i<B; i++)cin >> b.at(i);
for(int i=0; i<M; i++){
for(int j=0; j<3; j++){
c... | 1 | 15,965,384 |
#include <stdio.h>
#include <string.h>
int main(){
char a[105];
scanf("%s", a);
char b = ' ';
for(int i=0; i < strlen(a); i++){
if(a[i]== ','){
a[i] = b;
}
}
printf("%s", a);
return 0;
} | #include <iostream>
#include <algorithm>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <unordered_map>
#include <queue>
#define mod 998244353
#define int long long
#define ld long double
#define pb push_back
#define sz(x) (int)x.size()
#defi... | 1 | 72,385,120 |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int N, L;
cin >> N >> L;
vector<int> a(N);
for (int i = 0; i < N; i++) cin >> a[i];
int pos;
bool check = false;
for (int i = 1; i < N; i++) {
if (a[i-1]+a[i] >= L) {
check = true;
... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
int a[N];
int main()
{
int n, L; cin >> n >> L;
for (int i = 1; i <= n; i++) cin >> a[i];
int tmp = 0;
for (int i = 1; i < n; i++) if (a[i] + a[i + 1] >= L) tmp = i;
if (tmp == 0) return cout << "Impossible\n", 0;
cout << "Pos... | 1 | 5,732,161 |
#include <bits/stdc++.h>
using namespace std;
const int N = 5;
vector<int> G[N];
int deg[N], cnt[N];
int main() {
ios::sync_with_stdio(false);
for (int i = 1; i <= 3; i++) {
int a, b;
cin >> a >> b;
deg[a] += 1;
deg[b] += 1;
}
for (int i = 1; i <= 4; i++) {
cnt[de... | #include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<vector>
#include<queue>
#include<map>
#include<iomanip>
#define rep(index,num) for(int index=0;index<num;index++)
#define rep1(index,num) for(int index=1;index<=num;index++)
#define ... | 1 | 6,227,550 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int a,s;
cin>>a;
s=(a*(a+1))/2;
cout<<s;
return 0;
} | #include <bits/stdc++.h>
#define rep(i,n) for(ll i=0;i<(n);++i)
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin>>n;
cout<<(n*(n+1))/2;
return 0;
} | 1 | 25,376,951 |
#include<bits/stdc++.h>
using namespace std;
long long vis[200005],dis[200005];
vector<long long>adj[200005];
void bfs(long long node)
{
queue<long long>q;
q.push(node);
vis[node]=1;
dis[node]=0;
while(!q.empty())
{
long long c=q.front();
q.pop();
for(auto j:adj[c])
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define FOR(i,a,n) for(ll i=a;i<(ll)(n);i++)
int main(){
long N,M;
cin>>N>>M;
vector<vector<long>> list(N);
rep(i, M){
long a,b;
cin>>a>>b;
... | 1 | 93,679,938 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); ++i)
using ll = long long;
int main(){
int h1,m1,h2,m2,k; cin >> h1 >> m1 >> h2 >> m2 >> k;
int x1 = 60 * h1 + m1;
int x2 = 60 * h2 + m2;
int t = x2 - x1;
if(t>=k){
cout << t-k << endl;
}else{
cout ... | #include<bits/stdc++.h>
#define MAXN 100005
#define INF 1000000000
#define MOD 1000000007
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
int a,b,c,d,k;
int main()
{
scanf("%d%d%d%d%d",&a,&b,&c,&d,&k);
printf("%d\n",(c-a)*60+(d-b)-k);
return 0;
} | 1 | 10,581,502 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define file() freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define tt int t; cin>>t; while(t--)
#define nl cout<<"\n";
#define sp cout<<" ";
#define rep(i, a, b... | #include<bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector <int> H(N);
int ans = 1;
bool canSee=true;
for (int i=0; i<N; i++) cin >> H.at(i);
for (int i=1; i<N; i++) {
canSee=true;
for (int j=0; j<i; j++) {
if (H.at(i)<H.at(j)) {
... | 1 | 59,743,457 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
int main() {
int A, P;
cin >> A >> P;
cout << (3*A+P)/2 << endl;
return 0;
} | #include<bits/stdc++.h>
using namespace std;
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n,a;
cin>>n>>a;
cout<<(n*3+a)/2;
return 0;
} | 1 | 55,167,065 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<map>
#include<stdio.h>
#include<vector>
using namespace std;
#define int long long
#define rep(s,i,n) for(int i=s;i<n;i++)
#define c(n) cout<<n<<endl;
#define ic(n) int n;cin>>n;
#define sc(s) string s;cin>>s;
#define mod 1000000007
#define inf 10000000000... | #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,v... | 1 | 70,121,599 |
#include<iostream>
#include<cmath>
#include<iomanip>
using namespace std;
int main() {
double x1, y1, x2, y2;
while( cin >> x1 >> y1 >> x2 >> y2) {
double dx = x2 - x1, dy = y2 - y1;
cout << fixed << setprecision(8) << sqrt( dx * dx + dy * dy) << "\n";
}
return 0;
} | #include<iostream>
#include<cmath>
#include<cstdio>
using namespace std;
int main(){
double x1,x2,y2,y1,dist;
cin>>x1>>y1>>x2>>y2;
printf("%.8lf\n",sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)));
return 0;
} | 1 | 40,952,949 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
using ll = long long;
int mod = 1000000000+7;
int main(){
int n;
string s;
cin>>n>>s;
string s1="",s2="";
int l=0;
rep(i,n){
if(s[i]=='(')l++;
else {
if(l>0)l--;
else s1+='(';
}
}
rep(i,l)s2+=')';
cout<... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_(i, n, m) for (int i = n; i < (int)(m); i++)
#define all(v) v.begin(), v.end()
#define int long long
#define stoi stoll
signed main() {
int N; cin >> N;
string S; cin >> S;
string T;
int k = 0, t = 0;
... | 1 | 5,904,122 |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int a[n];
int s = 0;
for (int i=0; i<n; i++){
cin >> a[i];
s += a[i];
}
int ans = 0;
if (s % n == 0) {
int x = s/n;
for (int i: a){
ans += (x - i)*(x - i);
... | #include<bits/stdc++.h>
using namespace std;
int v[1000],n,s,a,b,c,i;
int main()
{
cin>>n;
for(i=1;i<=n;i++)
{
cin>>v[i];
s+=v[i];
}
s/=n;
for(i=1;i<=n;i++)
{
a+=(v[i]-s+1)*(v[i]-s+1);
b+=(v[i]-s)*(v[i]-s);
c+=(v[i]-s-1)*(v[i]-s-1);
}
cout<<min(min(a,b),c);
} | 1 | 33,630,442 |
#include <bits/stdc++.h>
using namespace std;
#include <math.h>
#include <iomanip>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF=1001001001;
vector<pair<int64_t,int64... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
vector<long long> V(N);
for (int i=0; i<N; i++) {
cin >> V[i];
}
sort(V.begin(), V.end());
reverse(V.begin(), V.end());
long long S=0;
for (int i=K; i<N; i++) {
S+=V[i];
}
cout << S << endl;
} | 1 | 27,025,695 |
#include<iostream>
#include<stdio.h>
#include<math.h>
using namespace std;
int main(){
double a, b, c,d, S, L, h;
cin >> a >> b >> c;
c = c / 180 * 3.1415926535;
h = b * sin(c);
S = a * h * 1 / 2;
L = pow(a, 2) + pow(b, 2)-2*a*b*cos(c);
L = sqrt(L) + a + b;
printf("%f\n%f\n%f\n", S, L, h);
return 0;
} | #include <stdio.h>
#include <math.h>
int main(){
double a,b,t;
scanf("%lf%lf%lf",&a,&b,&t);
printf("%lf\n%lf\n%lf\n",(sin(t*3.14159265359/180)*a*b)/2,a+b+sqrt(a*a+b*b-2*a*b*cos(t*3.14159265359/180)),sin(t*3.14159265359/180)*b);
} | 1 | 69,015,194 |
#include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main(){
ll a,b,c;
cin >> a >> b >> c;
if(a+b>=c) puts("Yes");
else puts("No");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL<<60;
const long long int Mod = 1000000007;
using ll = long long int; using ci = const int;
using vi = vector<int>; using Vi = vector<long long int>;
using P = pair<int, int>; using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#defin... | 1 | 68,027,610 |
#include <iostream>
using namespace std;
int ans[45] = {};
int fib(int n) {
if (n <= 1) return 1;
int a = ans[n];
if (a) return a;
a = fib(n-1) + fib(n-2);
ans[n] = a;
return a;
}
int main()
{
int i = 0;
cin >> i;
cout << fib(i) << endl;
} | #include<bits/stdc++.h>
using namespace std;
int n;
int f[50];
int fib(int k){
if (f[k]!=-1)
return f[k];
if (k==0 || k==1) return 1;
f[k]=fib(k-1)+fib(k-2);
return f[k];
}
int main(){
cin>>n;
memset(f,-1,sizeof(f));
cout<<fib(n)<<endl;
return 0;
} | 1 | 83,496,455 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5 + 5;
int n;
ll res[N];
vector<pair<int, int>> V;
int main() {
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin >> n;
for (int i = 1, a; i <= n; ++i) {
cin >> a;
V.emplace_back(a, i);
}
V.emplace_back(0, n + ... | #include<bits/stdc++.h>
#define ll long long
#define inf 1000000005
#define mod 1000000007
#define put putchar('\n')
#define F(i,a,b) for (int i=(a);i<=(b);i++)
#define D(i,a,b) for (int i=(a);i>=(b);i--)
#define go(i,t) for (int i=head[t];i;i=Next[i])
#define sqr(x) ((x)*(x))
#define re register
#define mp make_pair
#... | 1 | 64,186,891 |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
using namespace std;
typedef long long int LL;
typedef pair<int,int> P;
const int MOD=1000000007;
int ma... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int ans = 9999;
for (int i = 0; i < s.length()-2; i++) {
int temp = 100*(s[i]-'0') + 10*(s[i+1]-'0') + (s[i+2]-'0');
temp = abs(753-temp);
ans = min(ans,temp);
}
cout << ans << endl;
} | 1 | 67,934,068 |
#include<bits/stdc++.h>
#include<iostream>
using namespace std;
int main()
{
int a,b,c;
cin>>a>>b;
c=a+b/2;
cout<<c<<endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll, ll> Pll;
#define rep(i,n) for(int (i) = 0; (i) < (int)(n); (i)++)
#define debug(var) do{std::cout << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cout << e... | 1 | 54,003,206 |
#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 <algorithm>
#include <cmath>
#include <cstring>
#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 = (m); (i) < (n); (i)... | 1 | 13,038,455 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rep1(i,n) for(int i=1;i<=(int)n;i++)
#define sp(n) cout << fixed << setprecision(n)
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... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define rrep(i, n, g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define len(x) (int)(x).size()
#define dup(x, y) (((x) + (y)-1) / (y))
#define ... | 1 | 12,672,241 |
#include <iostream>
#include <string>
#include <sstream>
#include <limits>
#include <numeric>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
using namespace std;
int main ()
{
int a, b;
cin >> a >> b;
cout << "a " << (a < b ? "<" : (a == b ? "==" : ">")) << " b" << endl;
re... | #include <iostream>
int main()
{
int a = 0, b = 0;
std::cin >> a >> b;
if (a > b)
std::cout << "a > b" << std::endl;
else if (a == b)
std::cout << "a == b" << std::endl;
else
std::cout << "a < b" << std::endl;
return 0;
} | 1 | 20,213,929 |
#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#define time__(d) for ( auto blockTime = make_pair(chrono::high_resolution_clock::now(), true);blockTime.second;\
debug("%s: %lld ms\n", d, chrono::duration_cast<... | #include <bits/stdc++.h>
using namespace std;
int main(void){
long long n,r=0,g=0,b=0;
string s;
cin >> n;
cin >>s;
for(int i=0;i<n;i++){
if(s[i]=='R') r++;
else if(s[i]=='G') g++;
else b++;
}
long long ans=r*g*b;
for(int i=0;i<n;i++){
for(int j=1;i+j*2<n;... | 1 | 73,612,974 |
#include <bits/stdc++.h>
#define ll long long
#define vi vector<int>
#define e "\n"
#define MaRiaMa { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); }
#define fix(n) cout << fixed << setprecision(n);
using namespace std;
int main()
{
MaRiaMa;
double a, b;
cin >> a >> b;
double mean = 0;
mean = ((a + b) / 2);
... | #include<bits/stdc++.h>
using namespace std;
int main(void)
{
int a,b,x;
cin>>a>>b;
x=(a+b+1)/2;
cout<<x<<endl;
} | 1 | 8,499,593 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for(int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ve... | #include <stdio.h>
int main() {
int h1, m1, h2, m2, k;
scanf("%d %d %d %d %d",&h1,&m1,&h2,&m2,&k);
if (m1 > m2)
{
h2--;
m2 += 60;
}
int duration = (h2-h1)*60 + (m2-m1);
duration > k ? printf("%d\n",duration-k) : printf("0\n");
return 0;
} | 1 | 13,733,277 |
#include<bits/stdc++.h>
using namespace std;
int check(string s)
{
for(int i=0;i<s.length()/2;i++)
{
if(s[i]!=s[s.length()-1-i])
return 0;
}
return 1;
}
int main()
{
string s,p="",m="";
cin>>s;
int n=s.length();
if(check(s))
{
for(int i=0;i<(n-1)/2;i++)
... | #include <iostream>
#include <iomanip>
#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 | 28,080,979 |
#include<bits/stdc++.h>
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
using namespace std;
#define int long long
signed main(){
int N;cin >> N;
string S;cin >> S;
int r = 0, g = 0, b = 0;
for(int i = 0;i < S.length();i++){
if(S[i] == 'R')r++;
else if(S[i] == 'G')g++;
else b++;
}
int hoge = 0;
... | #include<bits/stdc++.h>
using namespace std;
int main(){
int N;
long long count=0;
string S;
cin >> N >> S;
long long R=0,G=0,B=0;
for(int i=0;i<N;i++){
if(S.at(i)=='R'){
R++;
}
else if(S.at(i)=='G'){
G++;
}
else{
B++;
}
}
for(int i=0;i<N-2;i++){
for(int j=i... | 1 | 48,288,164 |
#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() {
string S;
cin >> S;
int N = S.size();
int W = 0, B = 0;
vector<int> place(N);
rep(i, N) {
if (S[i] == 'W') {
place[i] = W... | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
ll n = s.size();
ll ans = 0;... | 1 | 57,071,052 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
using namespace std ;
using ll = long long ;
using vll = vector<ll> ;
using pll = pair<ll,ll> ;
#define all(v) v.begin(),v.end()
ll INF = 1000000000000 ;
ll gcd(long long a,long long b){if(b==0) return a ; return gcd(b,a%b) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
typedef pair<int,int> P;
vector<int> num = {0,2,5,5,4,5,6,3,7,6};
int main(){
int N, M; vector<int> A(9);
cin >> N >> M;
rep(i,M) cin... | 1 | 20,274,922 |
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=(ll)1e9+7;
const ll INF=(ll)1e18+10;
const double PI=acos(-1);
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 (a>b) { a=b; return 1; } return 0; }
... | #include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;
const int MAX_N = 2005;
const ll MOD = 1000000007;
int n, m, A[MAX_N], B[MAX_N];
ll DP[MAX_N][MAX_N];
int main() {
cin >> n >> m;
for(int i = 1; i <= n; i++) {
cin >> A[i];
}
for(int i = 1; i <= m... | 1 | 71,339,965 |
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#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()
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long lon... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <set>
#include <deque>
#include <utility>
int main(){
int N;
scanf("%d", &N);
std::string s;
... | 1 | 88,851,936 |
#include<iostream>
#include<algorithm>
#include<cmath>
#include<map>
#include<stdio.h>
#include<vector>
using namespace std;
#define int long long
#define rep(s,i,n) for(int i=s;i<n;i++)
#define c(n) cout<<n<<endl;
#define ic(n) int n;cin>>n;
#define sc(s) string s;cin>>s;
#define mod 1000000007
#define inf 10000000000... | #pragma GCC optimize("Ofast,fast-math,unroll-loops")
#include <bits/stdc++.h>
#define int ll
#define endl '\n'
#define all(C) (C).begin(), (C).end()
#define rall(C) (C).rbegin(), (C).rend()
#define mp make_pair
#define pb emplace_back
#define dbg(x) cerr << #x << " : " << x << endl
using namespace std;
using ll = long... | 1 | 51,278,747 |
#include <iostream>
using namespace std;
int main() {
char c;
for (int i = 0; i < 13; i++) {
if (i == 4) cout << " ";
else {
cin >> c;
cout << c;
}
}
cout << endl;
} | #include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
const int INF = 2147483647;
const int MOD = 1000000007;
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
string s;
cin >> s;
cout << s.substr(0,4) << " " << s.substr(4) << endl;
return 0;
} | 1 | 65,424,381 |
#include<iostream>
using namespace std;
const int N = 50;
long long a[N];
int main() {
long long K;
cin>>K;
if (K == 0) {
}
cout<<N<<endl;
for (int i = 0; i < N; ++i)
a[i] = i;
long long q = K / N;
int r = K % N;
for (int i = 0; i < r; ++i) {
... | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
long k;
cin >> k;
long q = k / 50, r = k % 50;
cout << 50 << '\n';
for (long i=0; i<50; i++)
cout << q + i - r + (i < r ? 51 : 0) << (i < 49 ? ' ' : '\n');
return 0;
} | 1 | 3,478,466 |
#include <iostream>
#include <iomanip>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <utility>
#include <string>
#include <cmath>
#include <cstdlib>
#include <cstring>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
type... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define rep2(i, s, n) for (int i = (s); i <... | 1 | 32,934,439 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
constexpr ll mod = ll(1e9 + 7);
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string... | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, m;
int c = 0;
int sum = 0;
int i;
float vote;
cin >> n >> m;
int a[n];
for(i = 0; i < n; i++){
cin >> a[i];
}
for(i = 0; i < n; i++){
sum += a[i];
}
for(i = 0; i < n; i++){
if(a[i] * (4 * m) >= sum){
c++;
}
}
... | 1 | 64,390,717 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pll = pair<ll, ll>;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define Rep(i, m, n) for(ll i = m; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define tmax(x, y, z) max((x), max((y), (z)))
#define tmin(x, y, z) min((x), min((y), (z)))
#de... | #include <bits/stdc++.h>
#define ll uint64_t
#define vi vector <int>
#define vl vector <ll>
#define dl pair <ll, ll>
#define ii pair <ll, ll>
#define vii vector <ii>
#define graph vector <set <int> >
#define REP(a, b, step) for (int a = 0; a < b; a += step)
#define inf 1000000000
using namespace std;
int main() {
i... | 1 | 77,423,885 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i,n) for(ll i=0; i<(ll)(n); ++i)
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int,int>,int>;
template<typename A, size_t N, typename T>
vo... | #include<bits/stdc++.h>
using namespace std;
int main(){
int r;
cin >> r;
if(r<1200){
cout << "ABC" << endl;
}
else if(1200<=r&&r<2800){
cout << "ARC" << endl;
}
else {
cout << "AGC" << endl;
}
} | 1 | 74,105,015 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
const long long INF = 1e15;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
ll n,x,m;
cin >> n >> x >> m;
vector<vector<ll>> sum(40,vector<ll>(m));
vector<vector<ll>> doubling(40... | #include <bits/stdc++.h>
#define io ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define ll long long
#define db long double
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int,int>
#define mii map<pii,int>
#define fi first
#define se second
#define mem1(a) memset(a,... | 1 | 62,010,799 |
#include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
int main() {
ll n;
cin >> n;
vector<ll> b(n-1);
rep(i,n-1) cin >> b[i];
ll ans = b[0];
rep(i,n-2) {
ans += min(b[i], b[i+1]);
}
ans += b... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N = 0;
cin >> N;
vector<int> A(N + 1,100010);
for(int i = 0; i < N - 1; i++) {
cin >> A.at(i + 1);
}
int ans = 0;
for(int i = 0; i < N; i++) {
ans += min(A.at(i), A.at(i + 1));
}
cout... | 1 | 13,534,942 |
#include<stdio.h>
#include<iostream>
#include<vector>
#include<math.h>
#include<queue>
#include<map>
#include<algorithm>
#include<string.h>
#include<functional>
#include<limits.h>
#include<stdlib.h>
#include<string>
#include<unordered_map>
#include <iomanip>
using namespace std;
#define intmax INT_MAX
#define lmax LONG... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int a;
cin >> a;
cout << 800*a - a/15*200 << endl;
} | 1 | 44,862,256 |
#include <iostream>
using namespace std;
using ll = long long;
int main() {
int A, B;
cin >> A >> B;
for (int i = 1; i <= 3; ++i) {
if (i != A && i != B) {
cout << i << endl;
return 0;
}
}
return 0;
} | #include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
#define all(z) (z).begin(),(z).end()
#define MOD 1000000007
#define FAST ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll isprime(ll n)
{
for(int i=2;i<n;i++)
if(n%i==0)
return 0;
return 1;
}
int ... | 1 | 28,847,392 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n; cin >> n;
string a, b; cin >> a >> b;
int cnt=2*n;
for(int i=0; i<n; i++){
string s1 = a.substr(i);
string s2 = b.substr(0, n-i);
if(s1!=s2) continue;
cnt = 2*i+(n-i);
break... | #include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<set>
#include<string>
#include<map>
#include<string.h>
#include<complex>
#include<math.h>
#include<queue>
#include <functional>
#include<time.h>
#include <stack>
#include<iomanip>
#include<unordered_map>
using namespace std;
#define rep(... | 1 | 5,831,777 |
#include <stdio.h>
#include <algorithm>
using namespace std;
int main()
{
int a[10],i;
for(i = 0; i < 10; i++){
scanf("%d",&a[i]);
}
sort(a,a+10);
printf("%d\n%d\n%d\n",a[9],a[8],a[7]);
return 0;
} | #include<iostream>
int main(){
using namespace std;
int a;
int height[10];
int i = 10;
int tmp;
while(i){
cin>>a;
height[10-(i--)]=a;
}
for(int j=0;j<9;j++){
for(int k=j+1;k<10;k++){
if(height[j]<height[k]){
tmp = height[j];
height[j] = height[k];
height[k] = tmp;
}
}
}
cout<<height[... | 1 | 43,218,487 |
# include <iostream>
# include <algorithm>
# include <cmath>
using namespace std;
int main() {
int t_sum = 0;
int t_diff[5] = {};
for (int i = 0; i < 5; ++i) {
int time; cin >> time;
t_diff[i] = ceil(time / 10.0) * 10 - time;
t_sum += ceil(time / 10.0) * 10;
}
int max_diff = *max_element(t_diff, t... | #include<bits/stdc++.h>
#define PI 3.141592653589
#define ll long long
using namespace std;
template<typename T_char>
T_char ToUpper(T_char cX){return toupper(cX);}
int main(){
int x[5];
int num=0, sum = 0;
for(int i=0; i<5; ++i) cin >> x[i];
for(int i=0; i<5; ++i){
if((10-(x[i]%10))>num){
if(x[i]%10=... | 1 | 42,256,400 |
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
typedef long long ll;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int64_t INF = (int64_t)1e18;
const int mxN = 1e5+20;
int n;
int64_t arr[mxN+1][3];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ci... | #include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
using namespace std;
#define int long long
#define fr(i,n) for (int i = 0; i < n; i++)
#define fro(i,m,n) for (int i = m; i < n; i++)
#define pb push_back
#define iter ::iterator
#define fi first
#define se second
void io(){
#ifndef ONLINE_JUDGE
... | 1 | 15,208,366 |
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <bi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define sort(s) sort(s.begin(),s.end())
#define reverse(s) reverse(s.begin(),s.end())
#define rep(i,n) for(ll (i)=0;(i)<(n);(i)++)
const ll mod = 1e9+7;
ll gcd(ll a, ll b) {
return b ? gcd(b, a%b) : a;
}... | 1 | 4,948,365 |
#include <bits/stdc++.h>
using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
using P = pair<ll,ll>;
using ld=long double;
int main(){
int n;cin >>n;
int a,b;cin>>a>>b;
int fi=0,se=0,th=0;
vector<int>p(n);
... | #include <bits/stdc++.h>
#define min(a,b) a<b? a:b
using namespace std;
int main()
{
int n,A,B;
cin>>n>>A>>B;
vector<int>a(n);
for(int i=0;i<n;i++)
{
cin>>a[i];
}
sort(a.begin(),a.end());
int la=0,lb=0;
for(int i=0;i<n;i++)
{
if(a[i]<=A)
la++;
... | 1 | 75,669,106 |
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
using namespace std;
#define rep2(x,from,to) for(int x=(from);(x)<(to);(x)++)
#define rep(x,to) rep2(x,0,to)
int main() {
char s[1010];
int n, a, b;
string str[3] = {"replace", "reverse", "print"};
cin >> s >> n;
string s0 = s;
rep(i,n) {
... | #include <iostream>
using namespace std;
int main(){
string str, task, what;
int q, a, b;
cin >> str >> q;
while(q--){
cin >> task;
if(task.compare("replace") == 0){
cin >> a >> b >> what;
for(int i=a; i<=b; i++)
str[i] = what[i-a];
}
else if(task.compare("reverse")==0){
cin >... | 1 | 96,768,557 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, X = 1;
cin >> N >> K;
while (X < K && N > 0) {
X *= 2;
N--;
}
cout << X + N * K << endl;
} | #include<stdio.h>
int main(){
int n,k;
scanf("%d",&n);
scanf("%d",&k);
int x=1;
for(int i=0;i<n;i++){
if(x*2<x+k){
x*=2;
}
else if(x*2>x+k){
x+=k;
}
else{
x*=2;
}
}
printf("%d",x);
puts("");
return 0;... | 1 | 33,392,639 |
#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng... | #include <bits/stdc++.h>
using namespace std;
const int MAXM = 2e5 + 10, MAXN = 1e5 + 10, INF = 2e9 + 10;
int n, m;
int l, r, d;
long long mark[MAXN];
vector <pair <int, int> > adj[MAXN];
void dfs(int a) {
for(auto pr : adj[a]) {
if(!mark[pr.first]) {
mark[pr.first] = mark[a] + pr.second;
dfs(pr.first);
}
}... | 1 | 79,895,286 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll one = 1;
const ll INF = 9223372036854775807;
const int inINF = 2147483647;
const ll MOD = 100000000... | #include <bits/stdc++.h>
#define pi 3.14159
using namespace std;
int main()
{
int n,i,j,k;
cin>>n;
int a[n],b[n];
for(i=0;i<n;i++)
cin>>a[i];
for(i=0;i<n;i++)
{
b[a[i]]=i+1;
}
for(i=1;i<n+1;i++)
cout<<b[i]<<" ";
} | 1 | 4,140,135 |
#include <bits/stdc++.h>
#include<cstdio>
using namespace std;
typedef long long ll;
int main()
{
int n;
cin>>n;
n--;
ll ans=0;
for(int i=1; i<=n; i++)
{
ans+=n/i;
}
cout<<ans<<endl;
return 0;
} | #include <bits/stdc++.h>
#define append push_back
using namespace std;
using ll = long long;
const int N = 1e5 + 3;
const int M = 1e6 + 7;
const long long MOD = 1e9 + 7;
const long long INF = 1e18 + 9;
const int SM = 1e3 + 5;
const int logN = 22, BL = 400;
const double EPS = 1e-9, PI = acos(-1);
const int dx[] = {1, 0,... | 1 | 72,710,263 |
#include <bits/stdc++.h>
using namespace std ;
typedef long long ll;
typedef string str;
typedef pair<int, int> pii;
typedef vector<int> vint;
typedef vector<double> vdou ;
typedef vector<ll> vll;
typedef vector<vint> vvint;
typedef vector<str> vstr;
typedef pair<ll,ll> pll ;
typedef vector<pii> vpii ;
typedef vector<p... | #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<tuple>
#include<cmath>
#include<iomanip>
#define MOD 1000000007
#define INF 1001001001
#define MIN -1001001001
#define rep(i,k,N) for(int i=k;i<N;i++)
#define MP make_pair
#defin... | 1 | 10,063,518 |
#include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;
int a[100010],L[100010]; int n;
int lis(){
L[0]=a[0];
int l=1;
for(int i=1;i<n;i++){
if(a[i]>L[l-1]) L[l++]=a[i];
else{
*lower_bound(L,L+l,a[i])=a[i];
}
}
return l;
}
int main(){
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("... | #include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stdio.h>
#include<cstring>
#include<math.h>
#include<map>
#include<bitset>
#include<iomanip>
#include<queue>
#include<functional>
#include<stack>
#include<tuple>
#include<cassert>
using namespace std;
#define rep(i, n) for (int i ... | 1 | 9,287,916 |
#define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0;i < (n);i++)
#define all(v) v.begin(),v.end()
#define dec(n) cout << fixed << setprecision(n);
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
ll gcd(ll a,ll b){
if(b == 0) r... | #include <bits/stdc++.h>
#include<math.h>
#include<algorithm>
#define rep(i,n) for (int i = 0; i < (n) ; ++i)
using namespace std;
using ll = long long ;
using P = pair<int, int> ;
#define PI 3.14159265358979323846264338327950
#define INF 1e18
#define mod 1000000007
int main () {
ll r, l ;
cin >> l >> r ;
... | 1 | 82,916,869 |
#include <bits/stdc++.h>
#define newl "\n"
using namespace std;
using lli = long long int;
using vvint = vector <vector <int>>;
const int mod = 1e9 + 7;
const int N = 2e5 + 1;
void solve(){
int n,m,x;
cin >> n >> m >> x;
vector <int> c(n);
vvint a(n,vector <int>(m));
for(int i = 0;i < n;++i){
cin >> c[i];
for(... | #include <iostream>
#include <vector>
int main() {
int N, M, X;
std::cin >> N >> M >> X;
std::vector<int> C(N);
std::vector<std::vector<int>> A(N);
for (int i = 0; i < N; ++i) {
std::cin >> C[i];
A[i].resize(M);
for (int j = 0; j < M; ++j) {
std::cin >> A[i][j];
}
}
bool res = false;... | 1 | 50,174,648 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
string a,b;
cin >> a >> b;
int len=0;
for(int i=0;i<n;i++){
bool ok=true;
for(int j=0;j<n-i;j++)
if(a.at(i+j)!=b.at(j))
ok=false;
if(ok)
len=max(n-i,len);
}
cout << n*2-len << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
const ld PI = acos(-1);
const ld EPS = 0.0000000001;
#define REP(i, n) for(ll i=0; i<(ll)(n); i++)
#define REPD(i, n) for(ll i=n-1; 0<=i; i--)
#define FOR(i, a, b) for(ll i=a; i<(ll)(b); i++)
#define... | 1 | 74,437,035 |
#include <iostream>
#include <map>
#include <vector>
#include <cmath>
#define point pair<double, double>
using namespace std;
int n;
vector<pair<double, double> > points;
void makeCurve(pair<double, double> p1, pair<double, double> p2, int n);
point makeVector(point a, point b);
int main() {
cin>>n;
point start... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <string>
#define BIG 1000000000
#define SIZE 40
#define PI 3.14159265359
using namespace std;
struct Point {
dou... | 1 | 56,155,860 |
#include <bits/stdc++.h>
#include<cmath>
#define N 100005
#define A 1000005
#define MOD 1000000007
#define inf 1000000000000000000
#define ll long long
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for(ll i = 0; i < n;... | #define _USE_MATH_DEFINES
#include <iostream>
#include <algorithm>
#include <climits>
#include <vector>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <cmath>
#include <iomanip>
#include <set>
#include <map>
#include <new>
#include <cstdint>
#include <cctype>
using namespac... | 1 | 4,812,960 |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define db long double
#define pb push_back
#define eb emplace_back
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#defin... | #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;
struct Combination {
Combination(ll n) {
m... | 1 | 83,834,136 |
#include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
using LL = long long;
const LL LINF = 1e18;
const double EPS = 1e-10;
using namespace std;
class Edge{
public:
int from,to,value;
Edge(LL a,LL b,LL c){
from = a;
to = b;
value = c;
}
Edge(LL a,LL b){
fro... | #include<bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int m,nmi,nma;
while(cin>>m>>nmi>>nma,m)
{
--nmi,--nma;
int p[m];
for (int i = 0; i < m; ++i) cin>>p[i];
int ans=-1,gap=-1;
for (int i = nmi; i <= nma; ++i)
{
if(p[i]-p[i+1]>=gap) ans=i,gap=p[i]-p[i+1];
}
cout<<a... | 1 | 57,672,188 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
inline void normal(ll &a)
{
a %= MOD;
(a < 0) && (a += MOD);
}
inline ll modMul(ll a, ll b)
{
a %= MOD, b %= MOD;
normal(a), normal(b);
return (a*b)%MOD;
}
inline ll modAdd(ll a, ll b)
{
a %= MOD, b %= MOD;
... | #include <stdio.h>
#include <algorithm>
using namespace std;
long long mod = 1000000007;
long long f[100010];
long long get_pow(long long x, long long k, long long mod) {
long long res = 1;
while (k) {
if (k & 1) res = (res * x) % mod;
x = (x * x) % mod;
k >>= 1;
}
return res;
}
... | 1 | 100,308,484 |
#include<bits/stdc++.h>
using namespace std;
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define ceil(n, m) ((n / m) + ( n % m ? 1 : 0))
#define fast_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
... | #include<bits/stdc++.h>
using namespace std;
int main()
{
int n,l,i,k;
string s[100];
scanf("%d%d",&n,&l);
for(i=0; i<n; i++)
cin >> s[i];
sort(s,s+n);
for(i=0; i<n; i++)
cout << s[i];
return 0;
} | 1 | 31,984,822 |
#include<cstdio>
using namespace std;
int main(){
int x, y;
scanf("%d %d", &x, &y);
int ans = x + y / 2;
printf("%d\n", ans);
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
const int maxn = 1e6 + 5;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cout << fixed << setprecisi... | 1 | 23,074,687 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.