code1 stringlengths 54 12k | code2 stringlengths 71 12k | similar int64 0 1 | __index_level_0__ int64 0 101M |
|---|---|---|---|
#include <bits/stdc++.h>
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, r) for (int i = (l); i < (r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
using name... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using namespace std;
int main()
{
int n;
cin >> n;
int a;
vector<int> p(n + 1);
rep(i, n)
{
cin >> p[i] >> a;
}
p[n] = a;
vector <vector <int> > m(n, vector<int>(n));
for (... | 0 | 35,587,757 |
#include <iostream>
using namespace std;
int main(void){
int n, x, cnt=0;
while(1){
cin >>n >>x;
if(n==0 && x==0){
break;
}
for(int i=1; i<n-1; i++){
for(int j=i+1; j<n; j++){
for(int k=j+1; k<n+1; k++){
if(i+j+k==x){
cnt++;
}
}
}
}
cout <<cnt <<endl;
cnt=0;
}
retur... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <list>
#include <utility>
#include <tuple>
#include <cstdio>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#inclu... | 0 | 44,240,308 |
#include <iostream>
using namespace std;
int main() {
int v[5];
for (int i = 0; i < 5; i++) {
cin >> v[i];
}
int minIdx = -1;
int minRest = 10;
for (int i = 0; i < 5; i++) {
if(v[i]%10!=0 && v[i]%10<minRest) {
minIdx = i;
minRest = v[i]%10;
}
}
int ans = 0;
for (int i = 0; i < ... | #include <bits/stdc++.h>
#include <cmath>
const double PI = 3.14159265358979323846;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define r... | 0 | 1,801,321 |
#include<bits/stdc++.h>
#include<ctype.h>
# define pb push_back
#define fst first
#define sec second
#define For(i,a,b) for(int i=a;i<b;i++)
#define ll long long int
#define ull unsigned long long int
#define mod 1000000007
#define fo(i,n) for(ll i=0;i<n;i++)
#define endl "\n"
#define rev(i,n) for(ll i=n-1;i>=0;i--)
#d... | #include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int mod = 1e9+7;
const ll inf = 1e18;
const double pi = 3.1415926535897932384626;
ll mpow(ll a,ll b,ll m){
ll res=1;
while(b){
if(b%2) res=res*a%m;
a=a*a%m;
b/=2;
}
return res;
}
ll inv(ll a,ll m){
return mpow(a,m-2,m);
}
l... | 0 | 10,671,659 |
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0;i < (int)(n);i++)
using ll = long long;
const ll MOD=1000000007;
const long long INF = 1LL << 60;
const double pi=acos(-1.0);
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return fa... | #include<iostream>
#include<iomanip>
#include<string>
#include<vector>
#include<algorithm>
#include<utility>
#include<tuple>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<numeric>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
using ll = long long;
using... | 0 | 62,272,158 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i,a,b) ((a)<=(i) && (i)<(b))
#define debug(x) cout << #x << " = " <... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<vector<int>> Matrix;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define ALL(x) (x).begin(), (x).end()
ll gcd(ll a, ll b){
if(a % b == 0) return b;
else return gcd(b, a%b);
}
ll lcm(ll a, ll b){
ll... | 0 | 25,232,506 |
#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(){
cin.tie(0);
ios::sync_with_stdio(false);
int n, m, v, p;
cin >> n >> m >> v >> p;
vector<int> a(n);
rep(i, n) cin >> a[i];
sort(a.rbegin(), a.rend());
int low =... | #include <bits/stdc++.h>
using namespace std;
typedef long long lol;
#define REP(i,n) for(lol i=0;i<lol(n);i++)
#define REPD(i,n) for(lol i=n-1;i>=0;i--)
#define FOR(i,a,b) for(lol i=a;i<=lol(b);i++)
#define FORD(i,a,b) for(lol i=a;i>=lol(b);i--)
#define ALL(x) x.begin(),x.end()
#define SIZE(x) lol(x.size())
#define ... | 0 | 4,549,373 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
int ans = 0;
if (a >= b) {
ans += b;
} else {
ans += a;
}
if (c >= d) {
ans += d;
} else {
ans += c;
}
cout << ans << endl;
} | #include <iostream>
#include <ctype.h>
using namespace std;
int main(void){
char data[1200];
cin.getline(data, sizeof(data));
for (int i = 0; i < 1200; i++)
{
if (islower(data[i]) != 0)
{
data[i] = toupper(data[i]);
}
else
{
data[i] = tolow... | 0 | 60,286,294 |
#include<bits/stdc++.h>
using namespace std;
int main(){
int M=1e9+7,n,m;
cin>> n >> m;
vector<int> s(n),t(m);
for (int i=0; i<n; i++) cin>> s[i];
for (int i=0; i<m; i++) cin>> t[i];
vector<vector<int>> dp(n,vector<int>(m));
if (s[0]==t[0]) dp[0][0]=1;
for (int i=1; i<n; i++){
dp[i][0]=dp[i-1][0];
... | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <queue>
using namespace std;
int main(void){
long long v,e,a[101][101],INF=1e12;
cin>>v>>e;
for(int i=0;i<101;i++){
for(int j=0;j<101;j++){
a[i][j]=INF;
if(i==j)a[i][j]=0;
... | 0 | 20,709,170 |
#include<bits/stdc++.h>
using namespace std;
int main() {
int A, N, r;
cin >> N;
cin >> A;
r = N % 500;
if (r <= A) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll =long long;
int main(){
ll N; cin>>N;
vector<ll> H(N);
for (ll i = 0; i < N; i++){
cin>>H[i];
}
ll ans=0,cnt=0;
ll i=0;
while(i<N-1){
if(H[i]>=H[i+1]){
cnt++;
}else{
ans=max(ans,cnt);
... | 0 | 28,087,610 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define pb push_back
#define COUT(x) cout << (x) << endl
#define COUTF(x) cout << setprecision(15) << (x) << endl
#define ENDL cout << endl
#d... | #include <stdio.h>
int main(){
char str[15];
char ans[15];
scanf("%s", str);
int j = 0;
for (int i=0; str[i]!='\0'; i++){
if (str[i] != 'B'){
ans[j++] = str[i];
if (str[i+1] == 'B'){
j--;
}
ans[j] = '\0';
}
else{... | 0 | 56,683,384 |
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
#define eb emplace_back
#define pb push_back
#define pob pop_back
#define mp make_pair
#define upb upper_bound
#define lwb lower_bound
#define fi first
#define se second
#define For(i, l, r) for (int i = l; i < r; i++)
#define ForE(i, ... | #include <cstdio>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
int k;
int n;
vector<int> a;
void solve() {
vector<int> diff;
diff.push_back(k+*a.begin()-a[n-1]);
for (auto i=a.begin();i!=a.end();i++) {
diff.push_back(*(i+1) - *i);
}
sort(diff.begin(), diff.e... | 0 | 93,252,071 |
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <iomanip>
using namespace std;
int main() {
int hour[3];
cin >> hour[0] >> hour[1] >> hour[2];
int ans = 1000;
for (int i = 0; i < 2; i++) {
for (int j = i + 1; j < 3; j++) {
ans = min(ans, hour[i] + hour[j])... | #include <bits/stdc++.h>
using namespace std;
#define loop(v, st, en) for (int v = st; v < en; v++)
#define loopdesc(v, st, en) for (int v = st; v >= en; v--)
#define INF 1E9
#define clr(v, d) memset(v, d, sizeof(v))
#define P(x) cout << #x << " = { " << x << " }\n"
#define PI acos(-1)
typedef long long ll;
typedef pai... | 0 | 1,324,849 |
#include<iostream>
#include<set>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
int main(){
string T[4]={"dream","dreamer","erase","eraser"};
string S;
cin>>S;
reverse(S.begin(),S.end());
for(int i=0;i<4;i++){
reverse(T[i].begin(),T[i].end());
}
bool ans2 =true;
for(int i... | #include <iostream>
#include <algorithm>
#include <queue>
#define rep(i,n) for (int i=0; i < (n); ++i)
using ll = long long ;
using namespace std;
const int INF = 1001001001;
const int MOD = 1e9+7;
int dp[110000] ;
int main() {
int n,k ;
cin >> n >> k ;
int h[n];
rep(i,n) cin >> h[i] ;
dp[0] = 0 ;
... | 0 | 64,390,328 |
#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "iomanip"
#include "random"
using namespace std;
const long long int MOD = 1000000007;
const long double EPS = 0.00000001;
const lo... | #include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <vector>
#include <set>
#include <queue>
#include <map>
#include <string>
#include <bitset>
#define rep(i, a, b) for ( ll i = (a); i < (b); i++ )
#define per(i, a, b) for ( ll i = (b)-1; i >= (a); i--)
#define pb push_back
#define mp ... | 0 | 39,702,524 |
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <list>
#include <algorithm>
using namespace std;
int main(int argc, char const* argv[])
{
ios::sync_with_stdio(false);
cin.tie(0);
vector<int> nl;
int mx = 0;
do{
int n;
cin >> n;
if (!cin.eof()){
... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T>
bool ch... | 0 | 34,840,107 |
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i,a,n) for(ll i = a;i < n;i++)
#define rrep(i,a,n) for(ll i = n; i >= a;i--)
#define index_check(i,n) if(i > n-1 || i < 0) continue;
#define LINF 1e18
#define INF 1e9
using namespace std;
#define fs first
#define sc second
using P = pair<ll,ll>;
using Pll = pa... | #include<bits/stdc++.h>
using namespace std;
#define fastio ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout<<fixed; cout<<setprecision(12);
#define randomINT mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout<<"\n"
#define DISP(as) for(auto it : as) cout<<it<<" ";n... | 0 | 53,103,452 |
#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 FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
t... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define rep(i, m, n) for (lli i = m; i < (n); i++)
#define repe(i, m, n) for (lli i = m; i <= (n); i++)
#define ALL(x) (x).begin(), (x).end()
#define SIZE(x) ((lli)(x).size())
#define MAX(x) *max_element(ALL(x))
#... | 0 | 89,524,592 |
#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... | #include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ll long long
#define mm(arr) memset(arr, 0, sizeof(arr))
#define scanArray(a,n) for(int i = 0; i < n; i++){cin >> a[i];}
#define pb push_back
#define PI 3.141592653589793
#de... | 0 | 69,302,560 |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll l1[10];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n,x=0,s2=0,k;
cin>>n>>k;
ll l1[n+1];
map<ll,ll>m;
map<ll,ll>m2;
vector<ll>v;
vector<ll>v2;
set<ll>s;
for(int i=1;i<=n;i++){
ci... | #include <bits/stdc++.h>
typedef long long ll;
#define endl '\n'
using namespace std;
const int MOD = 1000000007, MAX = 2000000007, MAXN = 2005;
ll s[MAXN], t[MAXN],sum[MAXN][MAXN];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n,m;
cin>>n>>m;
for(int i=0; i<n; i++)
cin... | 0 | 19,657,458 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int h, w; cin >> h >> w;
vector<string> mas;
for(int i = 0; i < h; i++){
string line; cin >> line;
int num = count(line.begin(), line.end(), '.');
if(num != line.size())
mas.push_back(line);
}
for(int i = 0; i < w; i++)... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const double PI = 3.14159265358979323846;
typedef vector<int> vint;
typedef pair<int, int> pint;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template<typename T>
class UnionFindTreeWithPotential {
c... | 0 | 64,911,899 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = 1e9;
const ll INF = 1e18;
const double pi = 3.14159265358979323846;
#define rep(i, n) for (int i = 0; i < (n); i++)
using pint = pair<int, int>;
using Graph = vector<vector<int>>;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dx... | #pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <utili... | 0 | 71,952,424 |
#include<iostream>
#include <string>
#include <algorithm>
using namespace std;
void Reverse()
{
string str;
cin>>str;
reverse(str.begin(), str.end());
cout<<str<<endl;
return;
}
int main()
{
Reverse();
return 0;
} | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
ll mod=1e9+7;
int main() {
ll n;
cin >> n;
pll l,r;
ll temp;
string s;
map<string,ll> c;
c["Vacant"]=0;
c["Male"]=1;
c["Female"]=-1;
cout << 0 << endl;
cin >... | 0 | 38,258,485 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using G = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const ll MOD = 1000000007;
ll GCD(ll x, ll y){
return y ? GCD(y, x%y) : x;
}
int main() {
int a, b; cin >> a >> b;
for(int i=1;i<=1300;i++){
int c = i*0.08;
in... | #include<bits/stdc++.h>
using namespace std;
namespace FAST_IO
{
template<typename T> void read(T &a)
{
a=0;
int f=1;
char c=getchar();
while(!isdigit(c))
{
if(c=='-')
{
f=-1;
}
c=getchar();
}
while(isdigit(c))
{
a=a*10+c-'0';
c=getchar();
}
a=a*f;
}
template <typename T> v... | 0 | 41,759,325 |
#include <iostream>
#include <string>
#include <vector>
class Card{
public:
Card( const std::string str );
char GetSymbol();
int GetNumber();
std::string GetString();
private:
std::string pair;
};
void MySwap( Card& a, Card& b );
void BubbleSort( std::vector<Card>& vec );
void SelectionSort( std::ve... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < (int)(n); i ++)
int main(){
int n, q; cin >> n >> q;
vector <vector<int>> G(n + 1);
vector <int> point(n + 1);
rep(i, n - 1){
int a, b; cin >> a >> b;
G.at(a).push_back(b);
G.at(b).push_back(a);
... | 0 | 76,819,088 |
#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 (){
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
int main(){
int N;
cin >> N;
vector<int> p(N);
for ... | 0 | 58,455,066 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repi(i, s, n) for (int i = (s); i < (n); i++)
#ifdef LOCAL
#define INPUT_FILE \
ifstream in("atcoder-problems/abc132_a.txt"); \
cin.rdbuf(in.rdbuf());
#define print_vec(v) \
rep(l, v.size()) { cou... | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <bitset>
#include <cstdint>
#include <initializer_list>
using namespace std;
using namespace __gnu_pbds;
#define data_set(type) tree<type,null_type,less<type>,rb_tree_tag,tree_order_... | 0 | 52,972,046 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
typedef long long ll;
int main(){
int N,M;
cin >> N >> M;
int a;
int b[N];
ll dp[N+1];
for(int i=0;i<N;i++){
b[i]=1;
dp[i]=0;
}
for(int i=0;i<M;i++){
cin >> a;
b[a]=0;
}... | #include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define fast_io ios_base::sync_with_stdio(false) ; cin.tie(0); cout.tie(0);
int main() {
fast_io;
ll a,b,c,k;
cin>>a>>b>>c>>k;
ll ans=0;
if(k<=a) {
ans+=k;
cout<<ans<<endl;
return 0;
}
else {
... | 0 | 91,490,577 |
#include <iostream>
#include <vector>
#include <map>
using namespace std;
int main(void) {
int N;
cin >> N;
vector<string> W(N);
map<string, int> S;
for(int i = 0; i < N; i++){
cin >> W[i];
}
for (int i = 0; i < N - 1; i++) {
if (W[i][W[i].size() - 1] != W[i + 1][0]) {
cout << "No" << endl;
... | #define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>
#include <string>
#include <cstring>
#include <vector>
#include <bitset>
#include <queue>
#include <set>
#include <map>
#include <stack>
#in... | 0 | 2,040,536 |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int judge(string t, string h)
{
int comp_num;
int ret_if_draw;
if (t.size() > h.size())
{
comp_num = h.size();
ret_if_draw = 1;
}
else if (t.size() < h.size())
{
comp_num = t.size();
ret_if_draw = -1;
}
else
{
comp_num =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int64_t a = 2;
int64_t b = 1;
int64_t c = a + b;
if(N == 1){
cout << 1 << endl;
}else if(N == 2){
cout << 3 << endl;
}else{
for(int i = 0; i < N - 2; i++){
a = b;
b = c;
... | 0 | 69,894,744 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for(int i... | 0 | 5,912,908 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main() {
int h, w;
cin >> h >> w;
vector<string> s(h);
rep(i,h) cin >> s[i];
vector<vector<int>> cnt(h, vector<int>(w));
rep(i,h) {
vector<int> do... | #include <bits/stdc++.h>
using namespace std;
int main()
{
char b;
cin >> b;
if ('A' == b) {
cout << 'T' <<endl;
return 0;
}
if ('T' == b) {
cout << 'A' <<endl;
return 0;
}
if ('C' == b) {
cout << 'G' <<endl;
return 0;
}
if ('G' == b) {
cout << 'C' <<endl;
return 0;
}
return 0;
} | 0 | 79,837,458 |
#include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
#define INF 10e7
#define MOD 1000000000 + 7
#define MAX 51000
#define all(x) (x).begin(), (x).end()
#define MX(x) *max_element(all(x))
#define MN(x) *min_element(all(x))
using namespace std;
void solve(void)
{
string s;
... | #include<iostream>
int main(){
int n, count = 0;
bool isprime [1000000];
for(int i = 0; i < 1000000; i++)
isprime[i] = true;
isprime[0] = isprime[1] = false;
for(int i = 2; i <= 1000; i++){
if(isprime[i]){
for(int j = i * 2; j < 1000000; j += i){
isprime[j... | 0 | 6,189,091 |
#include<iostream>
#include<algorithm>
using namespace std;
int main (void)
{
int a,x;
cin>>x>>a;
if(x<a)cout<<"0"<<endl;
else cout<<"10";
} | #include <bits/stdc++.h>
using namespace std;
struct UnionFind{
int num;
vector<int> rs,ps;
UnionFind(){}
UnionFind(int n) : num(n),rs(n,1),ps(n,0){iota(ps.begin(),ps.end(),0);}
int find(int x){
return ( x==ps[x] ? x: ps[x] = find(ps[x]));
}
bool same(int x, int y){
return fi... | 0 | 100,246,227 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, K;
cin >> A >> B >> K;
for(int i=0; i<K; i++) {
if(i%2 ==0 && A%2 !=0) { A--; B += A/2; A /=2;}
else if(i%2 ==0 && A%2 ==0) { B += A/2; A /=2;}
else if(i%2 !=0 && B%2 !=0) { B--; A += B/2; B /=2;}
else if(i%2 !=0 && B%2 ==0) { A ... | #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 ll = unsigned long long int;
using namespace std;
int harshad(int n) {
int sum = 0;
while (n > 0) {
sum += n % ... | 0 | 57,100,302 |
#include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<time.h>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.b... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#incl... | 0 | 14,722,898 |
#include <bits/stdc++.h>
#define rep(i,n) for(long long i=0; i<n; i++)
#define Rep(i,n) for(long long i=1; i<n; i++)
#define ll long long
#include <math.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define PI acos(-1... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N=5e5+50;
int gi(){
char ch=getchar(); int x=0,q=0;
while(ch<'0'||ch>'9') q=ch=='-'?1:q,ch=getchar();
while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return q?-x:x;
}
int vis[N],d[N],head[N],nn[N][2],cnt=1,flag;
ll ans;
#de... | 0 | 29,169,808 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define repe1(i, n) for (int i = 0; i <= (n); ++i)
#define all(x) (x).begin(),(x).end()
#define pb(x) push_back(x)
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=... | #include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
const double pi = 4 * atan(1.0);
int
main(int argc, const char *argv[])
{
int a, b, C;
cin >> a >> b >> C;
double S, L, h;
if (C == 90) {
S = a * b / 2;
L = a + b + sqrt(a*a + b*b);
h = b;
} else if ... | 0 | 10,456,011 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
int ans = 100000;
cin >> n;
while( n-- ) {
ans += ans / 100 * 5;
if( ans % 1000 > 0 ) {
ans = ans / 1000 * 1000;
ans += 1000;
}
}
cout << ans << endl;
} | #include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int s_num[26];
int p_num[26];
int main()
{
int i, j;
char c;
bool is=false;
string s, p, comp;
getline(cin, s);
getline(cin, p);
for (i = 0; i < s.size(); i++) {
j = i;
comp.clear();
while (comp.size()!=p.size()) {... | 0 | 10,530,471 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ldbl;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#... | #include <bits/stdc++.h>
using namespace std;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using P = pair<int, int>;
ll GCD(ll a, ll b) { retur... | 0 | 77,945,906 |
#include <cstdio>
#include <algorithm>
#include <stack>
using namespace std;
typedef pair<int, int> ii;
int main() {
int N;
scanf("%d", &N);
int A[N + 1];
A[0] = 0;
for (int i = 1; i <= N; ++i) scanf("%d", &A[i]);
int l = 1, u = N, m;
while (l != u) {
m = (l + u) / 2;
stack<ii> st;
bool can = true;
for (... | #include <iostream>
#include <bits/stdc++.h>
#define ll long long
#define inf 100000000000000000
#define mod 1000000007
#define ld long double
#define point complex<long double>
#define pi acos(-1)
#define IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)... | 0 | 97,428,169 |
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
typedef pair<int,int> P;
const int INF=1e9;
int main(){
int n,now=1,ans=0;
cin>>n;
vector<int> a(n);
rep(i,n) cin>>a[i];
for(int i=0;i<n;i++){
if(a[i]==now){
now++;
}
else ans++;
... | #include <cstdlib>
#include <iostream>
using namespace std;
int cmp(int* a, int* b)
{
return (*a < *b) ? 1 : ((*a > *b) ? -1 : 0);
}
int main()
{
int dat[10];
for (int i = 0; i < 10; i++)
{
cin >> dat[i];
}
qsort(dat, 10, sizeof(int), reinterpret_cast<int(*) (const void*, const void*)>(cmp));
for (int i = 0; ... | 0 | 4,070,617 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define FOR(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define MOD (1000000007)
#define INF (1e9)
#define INFL (1e18)
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
template<class ... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define rep(i,n) for(ll i=0;i<(n);i++)
#define repr(i,n) for(ll i=(n-1);i>=0;i--)
#define all(x) x.begin(),x.end()
#define br cout << "\n";
using namespace std;
const long long INF = 1e9;
const long long MOD = 1e9+7;
using Graph = vector<vector<ll>>... | 0 | 1,924,278 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
int n;
1<=n<=100;
0<=a<=n*n;
cin>>n;
cin>>a;
cout <<n*n-a<< endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (ll)(n); i++)
int main() {
ll n, h; cin >> n >> h;
vector <pair <ll, ll>> a(n, pair <ll, ll> ());
vector <pair <ll, ll>> b(n, pair <ll, ll> ());
rep(i, n) {
... | 0 | 95,819,040 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define REP(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) std::cout << x << '\n'
#define all(a) a.begin(), a.end()
#define r... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF=1e9+7;
const ll LINF=9223372036854775807;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld EPS = 1e-10;
int ii() { int x; if (sca... | 0 | 76,885,505 |
#include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int mod = 1e9+7;
typedef pair<ll, ll> pairs;
typedef vector<pairs> p;
struct Edge{
ll to, weight;
Edge(ll t, ll w) : to(t), weight(w){}
};
using graph = vector<vector<l... | #include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <list>
#include <iomanip>
#include <fstream>
using namespace std;
inline in... | 0 | 62,871,786 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,K;
cin>>N>>K;
vector<int>data(60);
for(int i=0;i<N;i++){
cin>>data.at(i);
}
sort(data.begin(),data.end());
reverse(data.begin(),data.end());
int count;
for(int i=0;i<K;i++){
count =count+data.at(i);
}
cout<<count<<endl;
} | #include<iostream>
using namespace std;
int main(){
double p[4][2];
while(cin>>p[0][0]>>p[0][1]){
for(int i=1; i<4; i++)
for(int j=0; j<2; j++)
cin >>p[i][j];
for(int i=1; i<4; i++)
for(int j=0; j<2; j++)
p[i][j]-=p[0][j];
double det,im[2][2],s[2];
det = p[1][0]*p[2][1]-p[1][1]*p[2][0]... | 0 | 84,779,363 |
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi vector<vector<int> >
#define vvl vector<vector<l... | #include <iostream>
#include <cmath>
using namespace std;
long long n;
int ans;
int main() {
cin >> n;
if(n == 1) {
cout << 0;
return 0;
}
long long x = sqrt(n);
for(long long i = 2; i < x; i++) {
int e = 0;
long long pow = i;
while(n%pow == 0) {
e... | 0 | 69,920,020 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
int main() {
int n;
int c[500]... | #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli,lli> pii;
#define rep(i, n) for (int i =... | 0 | 69,312,969 |
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9;
using namespace std;
using ll = long long;
int main() {
int x , y;
cin >> x >> y;
int t = abs(abs(x)-abs(y));
if((x > 0 && y < 0) || (x < 0 && y > 0)){
t++;
}
else if((x == 0 || y == 0) && y < ... | #include<iostream>
#include<cctype>
#include<cstdio>
#include<cstring>
#include<string>
using namespace std;
int main(){
string alpha;
int n;
string taro;
string hanako;
int ptaro = 0;
int phanako = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> taro >> hanako;
if(taro... | 0 | 70,764,659 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define REP(i, m, n) for (int i = (int)(m); i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
template<class T> inline bool chmax(T& a, T b)... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N;
cin >> N;
long long ans = 0;
vector<long long> a(N);
for (int i=0; i<N; i++) {
cin >> a[i];
}
long long term = 0;
bool loop_end = false;
for (int jsndfjn = 0; jsndfjn <= 100000000000; jsndfjn++) {
loop_end = true;
term... | 0 | 43,553,309 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main(){
int a;
cin >> a;
if(a<1200){
cout << "ABC" << endl;
}
else if(a<2800){
cout << "ARC" << endl;
}
else{
cout << "AGC" << endl;
}
} | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <cctype>
#include <iostream>
#include <functional>
#include <algorithm>
#include <string>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <iter... | 0 | 74,846,815 |
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1001001001LL;
constexpr long long LINF = 1001001001001001001;... | #include <bits/stdc++.h>
using namespace std;
int main () {
int N;
cin >> N;
vector<long long> a(N+1, 0);
for (int i = 1; i <= N; i++) {
cin >> a[i];
a[i] += a[i-1];
}
long long ans;
for (int i = 1; i+1 <= N; i++) {
long long x = a[i];
long long y = a[N]-a[i];... | 0 | 91,785,620 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,m,x;
cin >> n >> m >> x;
long long ans=99999999999999999;
vector<vector<int>> data(13,vector<int>(13));
for(int i=0;i<n;i++){
for(int j=0;j<=m;j++){
cin >> data.at(i).at(j);
}
}
bool over = true;
for(int bit=0;bit < (1<<n... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(){
int n,k;
cin >> n >> k;
string s;
cin >> s;
vector<int>nums;
int now = 1;
int count = 0;
for(int i=0; i<n; i++){
if(s[i]==('0'+now)) count++;
else{
nums.push_back(count);
now = 1-now;
count = 1;
... | 0 | 75,060,761 |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,d=0;
string c;
cin>>a>>c>>b;
if(c[0]=='+')
{
d=a+b;
}
else
{
d=a-b;
}
cout<<d<<endl;
return 0;
} | #include <iostream>
#include <cmath>
using namespace std;
#define ll long long
int res(ll n){
int ans =0;
for(int i=2;i<=sqrt(n);i++){
if(n%i==0){
int fac =0;
while(n%i==0){
n/=i;
fac++;
}
ans+=(sqrt(8*fac+1)-1)/2;
}... | 0 | 28,208,994 |
#include <bits/stdc++.h>
#define rep_n(_1, _2, _3, NAME,...) NAME
#define rep_2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep_3(i, initial, n) for(int i = (int)(initial); i < (int)(n); ++i)
#define repeat(...) rep_n(__VA_ARGS__, rep_3, rep_2, rep_1)(__VA_ARGS__)
#define rep_r_n(_1, _2, _3, NAME,...) NAME
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define pb push_back
#defin... | 0 | 34,429,474 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
#define pb push_back
#define ff first
#define ss second
#define INF int(3e9)
#define BIG_INF ll(9e18)
#define SIZE 100001
#defin... | #include<bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int cnt = 0;
for(int i =1;i < n ;i++) {
int add = (n+i-1)/i -1;
cnt+=add;
}
cout << cnt;
return 0;
} | 0 | 76,820,804 |
#include <algorithm>
#include <iostream>
#include <cctype>
using namespace std;
using ll = long long;
using ld = long double;
#define ALL(x) begin(x), end(x)
#define REP(i, n) for (size_t i = 0, i##_len = (n); i < i##_len; ++i)
const string YES = "Yes";
const string NO = "No";
void solve(ll A, ll B, string S) {
bool ... | #include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
using std::bitset;
#define rep(i,n) for(int i=0; i<(int)n; i++)
#define reps(i,s,e) for(int i=s; i<(int)e; i++)
#define coutd(i) cout << std::fixed << std::setprecision(i)
typedef long double ld;
typedef ... | 0 | 87,507,077 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define irep(i, n) fo... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(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 | 90,239,250 |
#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, a, b) for (int i = (a); i < (b); ++i)
#define PI acos(-1)
#define pcnt __builtin_popcountll
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define sz(x) (int)(x).size()
#define v(T) vector<T>
#define vv(T) v... | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <sstream>
#include <utility>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pai... | 0 | 13,306,856 |
#include<iostream>
#include<vector>
#include<string>
#include<bitset>
#include<algorithm>
#include<map>
#include<queue>
#include<cmath>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int main() {
int h, w;
cin >> h >> w;
vector<vector<char>> grid(h,vector<char>... | #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int prime[1000000];
int Prime_creat()
{
int i,j;
for(i=2;i<=1000000;i++)
{
if(prime[i])
{
for(j=i+i;j<=1000000;j+=i)
prime[j]=0;
}
}
}
int main()
{
int i,n,ans;
memset(prime... | 0 | 24,227,969 |
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
#define rep(a,n) for(ll a ... | #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+... | 0 | 14,194,936 |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0; i<(n); i++)
using namespace std;
int main() {
long long N;
cin >> N;
int m = INFINITY;
for(long long i=1; i<=sqrt(N)+1; i++) {
if(N%i==0) {
int x = max(log10(i)+1,log10(N/i)+1);
m = min(m,x);
}
else continue;
}
cout << m << endl... | #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#in... | 0 | 8,574,793 |
#define _USE_MATH_DEFINES
#define INF 0x3f3f3f3f
#include <cstdio>
#include <iostream>
#include <sstream>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>
#in... | #include <bits/stdc++.h>
#define pb emplace_back
#define ll long long
#define fi first
#define se second
#define mp make_pair
using namespace std;
typedef pair<int, int> pii;
const int N = int(2e5 + 7);
const int nAlpha = 'z' - 'a' + 1;
const int mod = int(1e9 + 7);
unordere... | 0 | 74,344,711 |
#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <utili... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<(int)(n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n+1), b(n);
ll count = 0;
rep(i,n+1) {
cin >> a[i];
count += a[i];
}
rep(i,n) cin >> b[i];
rep(i,n) {
i... | 0 | 82,909,177 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef pair<int, int> P;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define rall... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define LL_HALFMAX 9223372036854775807 / 2
int main()
{
ll n,k;
cin >> n >> k;
vector<ll>a(n);
for(ll i = 0; i < n; i++)
{
cin >> a[i];
}
ll result = LL_HALFMAX;
ll addcost = 0;
for(ll bit = 0; bit <(1<<... | 0 | 55,217,286 |
#include <iostream>
#include <cmath>
using namespace std;
inline bool is_right_triangle(int a, int b, int c){
return (a*a == b*b + c*c || b*b == a*a + c*c || c*c == a*a + b*b) ? true : false;
}
int main() {
ios::sync_with_stdio(false);
int n, a, b, c;
cin >> n;
for(int i=0; i<n; i++){
cin >> a >> b >> c;
if(is... | #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(int i=int(a);i<int(b);i++)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define rrep(i,n) for (int i=(n-1);i >= 0;i--)
#define all(v) v.begin(),v.end()
#define sz(v) (int)((v).si... | 0 | 12,235,379 |
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
S = regex_replace(S, regex("9"), "x");
S = regex_replace(S, regex("1"), "9");
S = regex_replace(S, regex("x"), "1");
cout << S << "\n";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5+5;
int n , k;
int ar[N];
int cnt[N];
int main(){
int dif = 0;
scanf("%d%d" , &n , &k);
for(int i = 1; i <= n; i++){
scanf("%d" , &ar[i]);
if(cnt[ar[i]] == 0)
dif ++;
cnt[ar[i]]++;
}
... | 0 | 89,361,250 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (int i = (a); i < (int)(b); ++i)
#define endl "\n"
typedef long long ll;
const double pi=3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9') return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define repex(i, a, b, c) for(int i = a; i < b; i += c)
#define repx(i, a, b) repex(i, a, b, 1)
#define rep(i, n) repx(i, 0, n)
#define repr(i, a, b) for(int i = a; i >= b; i--)
LL a[101010], b[101010];
int main(){
int N;
scanf("%d", &N);
r... | 0 | 10,233,434 |
#include <iostream>
#include <utility>
#include <map>
#include <vector>
#include <algorithm>
#include <queue>
#include <math.h>
#include <stack>
#include <set>
#include <deque>
#include <cmath>
using namespace std;
typedef long long ll;
ll mod = 1e9+7;
#define rep(i,n) for(int i = 0; i < (n); ++i)
int main() {
stri... | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX
#define EPS 1e-9
#define rep(i, n) for(ll i=0, i##_len=(ll)(n); i<i##_len; i++)
#define repf(i, n) for(ll i=1, i##_len=(ll)(n+1); i<i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#defi... | 0 | 66,300,927 |
#include <iostream>
using namespace std;
const int N_MAX = 100000;
long long gcd(long long a, long long b) {
if (a < 0) a = -a;
if (b < 0) b = -b;
while (a != 0) {
long long tmp = b % a;
b = a;
a = tmp;
}
return b;
}
long long lcm(long long a, long long b) {
return a / gcd(a, b) * b;
}
int factor2(long long... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define N 100005
#define MOD 1000000007
#define dd double
#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep1(i,b) for(int i=1;i<=b;i++)
#define pb push_back
#define mp make_pair
#define clr(x) x.clear()
#de... | 0 | 53,528,202 |
#include <bits/stdc++.h>
#define sp ' '
#define nyan "(=^・ω・^=)"
#define mkp make_pair
#define intmax 2147483647
#define llmax 9223372036854775807
#define lP pair<ll,ll>
#define iP pair<int,int>
typedef long long ll;
using namespace std;
const int mod = 1000000007, mod998 = 998244353;
int N, A, t;
ll res;
int main() {
... | #include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
typedef long long int lint;
using namespace std;
int main() {
vector<string> s = {"NO", "YES"};
lint n;
cin >> n;
vector<lint> a(n + 1);
lint sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum += a[i];
}
a[n]... | 0 | 58,580,495 |
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <string>
#include <cmath>
#include <complex>
#include <numeric>
#include <cassert>
#include <vector>
#include <array>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#define int64 l... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
#define fi first
#define se second
#define pb push_back
#define sqr(x) ((x) * (x))
const char *fin = "arc077_b.inp";
const char *fon = "arc077_b.out";
#define oo (int) (1e9+7)
#define maxn (int) (1e5+5)
int n, A, B;
int a[maxn], pos[maxn];
long lo... | 0 | 18,529,165 |
#include "bits/stdc++.h"
using namespace std;
#define rep(i,n)for(int i=0;i<(int)(n);i++)
#define PI 3.141592653589793
int main()
{
int a, b, c;
cin >> a >> b >> c;
int cnt = 3;
if (a == b && b == c)
cnt = 1;
else if (a == b || b == c || c == a)
cnt = 2;
else
cnt = 3;
cout << cnt << endl;
} | #include"bits/stdc++.h"
using namespace std;
using ll = int64_t;
int main() {
ll N;
cin >> N;
vector<ll> A(N), C(N + 1, 0);
for (ll i = 0; i < N; i++) {
cin >> A[i];
C[A[i]]++;
}
vector<ll> D(N + 1, 0);
for (ll i = 1; i <= N; i++) {
D[C[i]]++;
}
vector<ll> sum... | 0 | 34,542,917 |
#include<iostream>
using namespace std;
int main()
{
int a[4][3][10] = {0};
int n, b, f, r, v;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> b >> f >> r >> v;
a[b-1][f-1][r-1] += v;
}
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 3; j++) {
for (int k = 0; k < 10; k++) {
cout << " " << a[i][j][k]... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using pii=pair<int,int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(),a.end()
#define rrng(a) a.end(),a.begin()
#define rep(i,N) for(int i=0;i<N;i++)
int main(){
ios::sync_with_stdio(false);
cin... | 0 | 52,946,089 |
#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define rep2(i, m, n) for(int i = (int)(m); i < (int)(n); i++)
#define rep_inv(i, n, m) for(int i = (int)(n); i > (int)(m); i--)
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vc = vector<char>;
using vvl = vector<vl>;
... | #define TEMPLATE_USED
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pl;
typedef vector<pl> vp;
const ll INF=1001001001;
const ll LINF=1001001001001001001;
const ll D4[]={0,1,0,-1,0};
const ll D8[]={0,1,1,0,-1,-1,1,-1,0};
#define _o... | 0 | 96,274,802 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> buttons(N);
for (int n = 0; n < N; n++) cin >> buttons.at(n);
int answer = 0;
int pushedButton = 0;
for (int n = 0; n < N; n++) {
answer++;
if (buttons.at(pushedButton) == 2) {
cout << answer << endl;... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<ll,ll> P;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define EFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i, n) FOR(i,0,n)
#define INF 1e9
const int MOD = 998244353;
int main(void){
string org;
... | 0 | 61,008,256 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,Y,A=-1,B=-1,C=-1;
cin>>N>>Y;
Y/=1000;
for(int i=0;i<=N;i++){
for(int j=0;j+i<=N;j++){
if(i*5+j*10+N-i-j==Y){
A=j,B=i,C=N-i-j;
}
}
}
cout<<A<<" "<<B<<" "<<C<<endl;
} | #include<bits/stdc++.h>
using namespace std;
int main(){
int a;
while(true){
cin >> a;
if(a==0)break;
int k[a];
for(int i=0;i<a;i++)cin >> k[i];
sort(k,k+a);
int ans=10000000;
for(int i=0;i<a-1;i++){
if(k[i+1]-k[i]<ans)ans=k[i+1]-k[i];
... | 0 | 52,490,916 |
#define _USE_MATH_DEFINES
#include <cmath>
#include <iostream>
using namespace std;
int main()
{
unsigned int n;
cin >> n;
double a = 100000;
for (int i = 0; i < n; i++)
{
a *= 1.05;
a /= 1000;
a = ceil(a);
a *= 1000;
}
cout << (int)a << endl;
return 0;
} | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using vi = vector<int>;
constexpr char newl = '\n'... | 0 | 66,655,209 |
#include<iostream>
#include<vector>
#include<algorithm>
#include<queue>
#include <iomanip>
using namespace std;
int main(){
int n,m;
cin>>n>>m;
vector<int>a(1000000);
vector<int>b(1000000);
cin>>a[0]>>b[0];
for(int i=0;i<n;i++){
cin>>a[i+1];
}
for(int i=0;i<=n;i++){
a[i]+=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<double> vd;
typedef vector<string> vs;
typedef pair<int, int> P;
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).beg... | 0 | 4,383,416 |
#include <bits/stdc++.h>
int main()
{
int N;
scanf("%d", &N);
int sum{};
for (int i{1}; i <= N; i++)
{
sum += i;
if (sum >= N)
{
for (int j{1}; j <= i; j++)
if (j != sum - N)
printf("%d\n", j);
return 0;
}
}
return 0;
} | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define MAX 1001
const char INF = '#';
const int MM = 10000000;
typedef pair<int,int> P;
int num,d[MAX][MAX],n,m;
int dx[4] = {1,0,-1,0},dy[4] = {0,1,0,-1};
char field[MAX+1][MAX+1];
int bfs(int sy,int sx,int gy,int gx){
queue<P> que;
f... | 0 | 83,115,410 |
#include<bits/stdc++.h>
using namespace std;
int main(){
string s;
cin >> s;
int ans = 0;
if(s == "RSR"){
cout<<1<<endl;
return 0;
}
for(int i=0;i<3;i++){
if(s[i] == 'R')ans++;
}
cout << ans << endl;
return 0;
} | #include <cstdio>
using namespace std;
int main() {
int n;
int i, j, k, m;
int counter;
while (scanf("%d", &n) != EOF) {
counter = 0;
for (i = 0; i < 10; i++) {
for (j = 0; j < 10; j++) {
for (k = 0; k < 10; k++) {
for (m = 0; m < 10; m++) {
if (... | 0 | 58,904,169 |
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
string s;
cin >> s;
int N = s.size();
int cnt = 0;
for (int i = 0; i < N; ++i) {
if ((s[i] + i) % 2 == 0) ++cnt;
}
cout << min(cnt, N - cnt) << endl;
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <cstdlib>
using namespace std;
#define rep0(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vecto... | 0 | 43,296,447 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,ll>pa;
const int N=2e5+100;
const int mod=1e9+7;
vector<pa>ve[N];
int n;
ll vis[N];
queue<pa>q;
void bfs(int k)
{
memset(vis,-1,sizeof vis);
vis[k]=0;
q.push(make_pair(k,0));
while(q.size()){
pa kk=q.front();q.p... | #include <iostream>
#include <algorithm>
using namespace std;
int selectionSort(int a[],int n){
int i,j,sw=0,minj;
for(i=0;i<n-1;++i){
minj=i;
for(j=i;j<n;++j)
if(a[j]<a[minj]) minj=j;
swap(a[i],a[minj]);
if(i!=minj) ++sw;
}
return sw;
}
int main(){
int n,a[100],i,sw;
cin>>n;
for(i=0;i<n;++i) cin>>a[i... | 0 | 20,656,938 |
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
int main(){
ll a,b;
cin >> a >> b;
a %= 3;
b %= 3;
ll c = a + b;
c %= 3;
if(a*b*c ==... | #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <cmath>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep2(i,n) for(int i=1;i<(n);i++)
typedef long long ll;
ll gcd(ll a, ll b){
if(a<b) swap(a,b);
if(a%b == 0) return b;
else retu... | 0 | 98,885,221 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000001;
const float PI = 3.14;
const int mod = 1e9+7;
typedef long long LL;
typedef vector<int> vi; ... | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define inf 1001001001
#define mod 1000000007
#define pi 3.141592653589793
ll gcd(ll a,ll b){
if(b>a) swap(a,b);
if(b==0) return a;
return gcd(b,a%b);
}
ll lcm(ll a,ll b){
ll g=gcd(a,b);
re... | 0 | 93,206,479 |
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int MAX_N = 1005;
int c[MAX_N][MAX_N];
int main()
{
string X,Y;
cin >> X;
cin >> Y;
for(int i=0;i<=X.length();i++){
c[i][0] = i;
}
for(int j=0;j<=Y.length();j++){
c[0][j] = j;
}
for(int i=1;i<=X.length();i++){
for(int j=1;j... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#include <fstream>
#include<string.h>
#include <algorithm>
#include<math.h>
#inclu... | 0 | 60,420,588 |
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
const LL INF = 10000000000;
const int V = 110;
const int E = 10000;
LL d[V][V];
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int v, e;
cin >> v >> e;
for(int i = 0; i < v; ++i){
for(int j = 0; j < v; ++j){
d[i][j] = ... | #include<iostream>
#include<queue>
#include<string>
#include<vector>
#include<math.h>
#include<algorithm>
#include<cstdio>
#include<stdio.h>
#include<stack>
#include<sstream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<list>
#include<numeric>
typedef long long ll;
#define pi 3.141592653589793238462... | 0 | 69,275,839 |
#include<cstdio>
#include<iostream>
#include<string>
#include<algorithm>
#include<stdio.h>
#include<locale.h>
#include<set>
#include<stack>
#include<queue>
using namespace std;
int prime[1000000]={};
int spf[10000001];
bool is_prime[1000001];
void sieve(int n)
{
int p=0;
for(int i=0; i<=n;i++){ is_prime[i]=true; s... | #include <bits/stdc++.h>
using namespace std;
using VS = vector<string>; using LL = long long;
using VI = vector<int>; using VVI = vector<VI>;
using PII = pair<int, int>; using PLL = pair<LL, LL>;
using VL = vector<LL>; using VVL = vector<VL>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).rb... | 0 | 79,149,899 |
#pragma GCC optimize("Ofast")
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdl... | #include <bits/stdc++.h>
#include <math.h>
#define _GLIBCXX_DEBUG
#define _LIBCPP_DEBUG 0
using namespace std;
#define ll long long
#define rep(i,n) for (int i = 0; i < n; i++)
#define rrep(i,n) for (int i = n-1; i >= 0; i--)
#define MOD (1000000007)
#define vi vector<int>
#define vl vector<ll>
#define vb vector<bool>
... | 0 | 10,823,454 |
#include <stdio.h>
#include <string.h>
int main() {
int leng, x = 0, y = 0;
int counter = 0;
int a1 = 0;
int a2 = 0;
char str[105];
char str2[105];
char str3[105];
scanf("%d", &leng);
scanf("%s", str);
for(int j = leng/2; j < leng;j++){
str2[x] = str[j];
a1 += str2[x];
x++;
}
for(int i = 0;i < leng/2... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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 ll INF = 1LL << 60;
const int MAX = 1000000010;
const ll MOD... | 0 | 89,094,876 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmi... | #include"bits/stdc++.h"
#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()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int n;
bool ans = true;
cin >> n;
... | 0 | 70,028,511 |
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#incl... | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; 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)
#define ALL(v) (v).begin(),(v... | 0 | 5,675,930 |
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <functional>
#include <cmath>
#include <cstring>
#include <numeric>
#include <random>
#include <map>
#include <unordered_map>
#include <queue>
#include <regex>
#include <complex>
#include <list>
#include <cassert>
#include <deque>
#i... | #include <bits/stdc++.h>
#define rep(i,n) for (int i=0; i<(n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;
int main(){
int n; ll k;
cin>>n>>k;
map<int,ll>mp;
rep(i,n){
int a,b;
cin>>a>>b;
mp[a]+=b;
}
ll cnt=0;
for(auto&p:mp){
cnt+=... | 0 | 8,293,947 |
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <algorithm>
#include <complex>
#include <array>
#include <iomanip>
using namespace std;
#define REP(i,... | #include <iostream>
#include <functional>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <iomanip>
#include <complex>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;++i)
#define repi(i,n) for(ll i=n-1;i>=0;--i)
#d... | 0 | 85,313,531 |
#include <bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(a) (a).begin(),(a).end()
using namespace std;
using ll = long long int;
using vec = vector<int>;
using P = pair<int,int>;
const int INF = 1e9+7;
int main() {
int n, k;
cin >> n >> k;
vec a(n);
rep(i,n) {
cin >> a[i];
}
r... | #include<bits/stdc++.h>
using namespace std;
#define fast() ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long int
#define test() ll t; cin>>t; while(t--)
#define lp0(i,begin,end) for(ll i=begin;i<end;i++)
#define lp1(i,begin,end) ... | 0 | 36,951,434 |
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <array>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <list>
#include <numeric>
#include <stack>
#include <iomanip>
#include <random>
... | #include<iostream>
using namespace std;
int main() {
int H,W;
int i,n,m;
while (1) {
cin>>H>>W;
if (H == 0 && W == 0) break;
for (n = 0; n < H; n++) {
for (m = 0; m < W; m++) {
cout << "#";
}
cout << endl;
}
cout << endl;
}
return 0;
} | 0 | 31,382,741 |
#include <iostream>
#include <algorithm>
#include <vector>
#include <climits>
#include <queue>
#include <list>
using namespace std;
static const int MAX = 10000;
static const int INFTY = 1 << 29;
vector<int> g[MAX];
list<int> out;
bool v[MAX];
int n;
int deg[MAX];
void bfs(int s)
{
queue<int> q;
q.push(s);
v[s] = tr... | #include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
using nam... | 0 | 82,682,109 |
#include<iostream>
#include<vector>
#include<cmath>
using namespace std;
int main(){
int n;
cin>>n;
vector<int> a(n,0);
int min_cost=1001001;
for(int i=0;i<n;i++){
cin>>a[i];
}
for(int i=-100;i<=100;i++){
int cost=0;
for(int j=0;j<n;j++){
int re=i-a[j];
cost+=pow(re,2);
}
... | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
typedef vector<int>vint;
typedef pair<int,int>pint;
typedef vector<pint>vpint;
template<typename A,typename B>inline voi... | 0 | 16,800,419 |
#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <ctype.h>
#include <math.h>
#include <stack>
#include <string>
#include <string.h>
using namespace std;
double PI = 3.1415926535897932;
long mod = 1000000007;
const long INF = (1<<30);
int main() {
int s;
cin >> s;
if(s == 25)
cout << ... | #include <iostream>
#include <vector>
using namespace std;
int d[110][110],e[110][110] = {};
int main(){
int i,j,k,n,m; cin >> n >> m;
for(i=0;i<m;i++){
int a,b,c; cin >> a >> b >> c;
a--; b--;
e[a][b] = c; e[b][a] = c;
}
for(i=0;i<n;i++){
for(j=0;j<n;j++){
d[... | 0 | 821,897 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.