Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commite773398

Browse files
authored
Add files via upload
1 parent018d3c1 commite773398

11 files changed

+1086
-0
lines changed

‎Adding Powers.cpp‎

Lines changed: 114 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,114 @@
1+
#include<bits/stdc++.h>
2+
3+
usingnamespacestd;
4+
5+
typedefdouble D ;
6+
typedeflonglong ll ;
7+
typedeflongdouble ld ;
8+
typedefunsignedint ui ;
9+
typedefunsignedlonglong ull ;
10+
11+
#defineF first
12+
#defineS second
13+
#defineRreturn
14+
#defineCcontinue
15+
#definepb push_back
16+
#definepf push_front
17+
#definemp make_pair
18+
19+
#definevi vector <int>
20+
#definevb vector <bool>
21+
#definevll vector <ll>
22+
#definevs vector <string>
23+
24+
#definevvi vector < vector <int > >
25+
#definevvb vector < vector <bool > >
26+
#definevvc vector < vector <char > >
27+
#definevvll vector < vector < ll > >
28+
#definevvd vector < vector < D > >
29+
#definevvld vector < vector < ld > >
30+
31+
#definepii pair <int ,int >
32+
#definepll pair < ll , ll >
33+
#definepld pair < ld , ld >
34+
#definepDD pair < D , D >
35+
36+
#definevpld vector < pld >
37+
#definevpii vector < pii >
38+
#definevpll vector < pll >
39+
#definevpDD vector < pDD >
40+
#definevvpii vector < vector < pii > >
41+
42+
#defineall(v) (v).begin() , (v).end()
43+
#defineallrev(v) (v).rbegin() , (v).rend()
44+
#defineallcomp(v) v.begin() , v.end() , comp
45+
#defineallrevcomp(v) v.rbegin() , v.rend() , comp
46+
47+
#defineFi(i,L,R)for (int i = L ; i <= R ; i++)
48+
#defineFd(i,R,L)for (int i = R ; i >= L ; i--)
49+
50+
#defineFAST ios_base :: sync_with_stdio (false) ; cin.tie(0) ; cout.tie(0)
51+
52+
#definedist(a,b,p,q) sqrt((p-a)*(p-a) + (q-b)*(q-b))
53+
54+
const ll MOD =1e9 +7 ;
55+
constint infi = INT_MAX ;
56+
const ll infll = LLONG_MAX ;
57+
const ld PI =3.1415926535897932384626 ;
58+
59+
////////////////////////////////////////////////////////////////////////////////////////////////////////////////
60+
61+
voidsolve (int test_case)
62+
{
63+
int n , k ;
64+
cin >> n >> k ;
65+
vlla(n) ;
66+
for (auto &i : a)
67+
cin >> i ;
68+
if (k ==1)
69+
{
70+
cout <<"YES\n" ;
71+
return ;
72+
}
73+
unordered_map <longlong ,int> m ;
74+
for (auto &i : a)
75+
{
76+
ll j = i ;
77+
string base ="" ;
78+
while (j)
79+
{
80+
if (j % k >1)
81+
{
82+
cout <<"NO\n" ;
83+
return ;
84+
}
85+
base +=char(j % k +'0') ;
86+
j /= k ;
87+
}
88+
for (int p =0 ; p < base.length() ; ++p)
89+
if (base[p] =='1')
90+
++m[p] ;
91+
}
92+
for (auto &i : m)
93+
{
94+
if (i.S >1)
95+
{
96+
cout <<"NO\n" ;
97+
return ;
98+
}
99+
}
100+
cout <<"YES\n" ;
101+
}
102+
103+
intmain()
104+
{
105+
//freopen ("input.txt","r",stdin) ;
106+
//freopen ("output.txt","w",stdout) ;
107+
108+
FAST ;
109+
int tc =1 ;
110+
cin >> tc ;
111+
while (tc--)
112+
solve (tc) ;
113+
return0 ;
114+
}

‎Array Splitting.cpp‎

Lines changed: 89 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,89 @@
1+
#include<bits/stdc++.h>
2+
3+
usingnamespacestd;
4+
5+
typedefdouble D ;
6+
typedeflonglong ll ;
7+
typedeflongdouble ld ;
8+
typedefunsignedint ui ;
9+
typedefunsignedlonglong ull ;
10+
11+
#defineF first
12+
#defineS second
13+
#defineRreturn
14+
#defineCcontinue
15+
#definepb push_back
16+
#definepf push_front
17+
#definemp make_pair
18+
19+
#definevi vector <int>
20+
#definevb vector <bool>
21+
#definevll vector <ll>
22+
#definevs vector <string>
23+
24+
#definevvi vector < vector <int > >
25+
#definevvb vector < vector <bool > >
26+
#definevvc vector < vector <char > >
27+
#definevvll vector < vector < ll > >
28+
#definevvd vector < vector < D > >
29+
#definevvld vector < vector < ld > >
30+
31+
#definepii pair <int ,int >
32+
#definepll pair < ll , ll >
33+
#definepld pair < ld , ld >
34+
#definepDD pair < D , D >
35+
36+
#definevpld vector < pld >
37+
#definevpii vector < pii >
38+
#definevpll vector < pll >
39+
#definevpDD vector < pDD >
40+
#definevvpii vector < vector < pii > >
41+
42+
#defineall(v) (v).begin() , (v).end()
43+
#defineallrev(v) (v).rbegin() , (v).rend()
44+
#defineallcomp(v) v.begin() , v.end() , comp
45+
#defineallrevcomp(v) v.rbegin() , v.rend() , comp
46+
47+
#defineFi(i,L,R)for (int i = L ; i <= R ; i++)
48+
#defineFd(i,R,L)for (int i = R ; i >= L ; i--)
49+
50+
#defineFAST ios_base :: sync_with_stdio (false) ; cin.tie(0) ; cout.tie(0)
51+
52+
#definedist(a,b,p,q) sqrt((p-a)*(p-a) + (q-b)*(q-b))
53+
54+
const ll MOD =1e9 +7 ;
55+
constint infi = INT_MAX ;
56+
const ll infll = LLONG_MAX ;
57+
const ld PI =3.1415926535897932384626 ;
58+
59+
////////////////////////////////////////////////////////////////////////////////////////////////////////////////
60+
61+
voidsolve (int test_case)
62+
{
63+
int n , k ;
64+
cin >> n >> k ;
65+
viv(n) ;
66+
vi ans ;
67+
for (auto &i : v)
68+
cin >> i ;
69+
for (int i =1 ; i < n ; ++i)
70+
ans.pb(v[i-1] - v[i]) ;
71+
sort(all(ans)) ;
72+
ll res = v[n-1] - v[0] ;
73+
for (int i =0 ; i < k-1 ; ++i)
74+
res += ans[i] ;
75+
cout << res ;
76+
}
77+
78+
intmain()
79+
{
80+
//freopen ("input.txt","r",stdin) ;
81+
//freopen ("output.txt","w",stdout) ;
82+
83+
FAST ;
84+
int tc =1 ;
85+
//cin >> tc ;
86+
while (tc--)
87+
solve (tc) ;
88+
return0 ;
89+
}

‎Fixing Typos.cpp‎

Lines changed: 91 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,91 @@
1+
#include<bits/stdc++.h>
2+
3+
usingnamespacestd;
4+
5+
typedefdouble D ;
6+
typedeflonglong ll ;
7+
typedeflongdouble ld ;
8+
typedefunsignedint ui ;
9+
typedefunsignedlonglong ull ;
10+
11+
#defineF first
12+
#defineS second
13+
#defineRreturn
14+
#defineCcontinue
15+
#definepb push_back
16+
#definepf push_front
17+
#definemp make_pair
18+
19+
#definevi vector <int>
20+
#definevb vector <bool>
21+
#definevll vector <ll>
22+
#definevs vector <string>
23+
24+
#definevvi vector < vector <int > >
25+
#definevvb vector < vector <bool > >
26+
#definevvc vector < vector <char > >
27+
#definevvll vector < vector < ll > >
28+
#definevvd vector < vector < D > >
29+
#definevvld vector < vector < ld > >
30+
31+
#definepii pair <int ,int >
32+
#definepll pair < ll , ll >
33+
#definepld pair < ld , ld >
34+
#definepDD pair < D , D >
35+
36+
#definevpld vector < pld >
37+
#definevpii vector < pii >
38+
#definevpll vector < pll >
39+
#definevpDD vector < pDD >
40+
#definevvpii vector < vector < pii > >
41+
42+
#defineall(v) (v).begin() , (v).end()
43+
#defineallrev(v) (v).rbegin() , (v).rend()
44+
#defineallcomp(v) v.begin() , v.end() , comp
45+
#defineallrevcomp(v) v.rbegin() , v.rend() , comp
46+
47+
#defineFi(i,L,R)for (int i = L ; i <= R ; i++)
48+
#defineFd(i,R,L)for (int i = R ; i >= L ; i--)
49+
50+
#defineFAST ios_base :: sync_with_stdio (false) ; cin.tie(0) ; cout.tie(0)
51+
52+
#definedist(a,b,p,q) sqrt((p-a)*(p-a) + (q-b)*(q-b))
53+
54+
const ll MOD =1e9 +7 ;
55+
constint infi = INT_MAX ;
56+
const ll infll = LLONG_MAX ;
57+
const ld PI =3.1415926535897932384626 ;
58+
59+
////////////////////////////////////////////////////////////////////////////////////////////////////////////////
60+
61+
voidsolve (int test_case)
62+
{
63+
string s ;
64+
cin >> s ;
65+
int n = s.length() ;
66+
string ans ="" ;
67+
for (int i =0 ; i < n ; ++i)
68+
{
69+
char ch = s[i] ;
70+
int len = ans.length()-1 ;
71+
if(len >=1 && ans[len] == ch && ans[len-1] == ch)
72+
continue ;
73+
if(len >1 && ans[len] == ch && ans[len-1] == ans[len-2])
74+
continue;
75+
ans += ch;
76+
}
77+
cout << ans ;
78+
}
79+
80+
intmain()
81+
{
82+
//freopen ("input.txt","r",stdin) ;
83+
//freopen ("output.txt","w",stdout) ;
84+
85+
FAST ;
86+
int tc =1 ;
87+
//cin >> tc ;
88+
while (tc--)
89+
solve (tc) ;
90+
return0 ;
91+
}

‎Little Elephant and Problem.cpp‎

Lines changed: 97 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,97 @@
1+
#include<bits/stdc++.h>
2+
3+
usingnamespacestd;
4+
5+
typedefdouble D ;
6+
typedeflonglong ll ;
7+
typedeflongdouble ld ;
8+
typedefunsignedint ui ;
9+
typedefunsignedlonglong ull ;
10+
11+
#defineF first
12+
#defineS second
13+
#defineRreturn
14+
#defineCcontinue
15+
#definepb push_back
16+
#definepf push_front
17+
#definemp make_pair
18+
19+
#definevi vector <int>
20+
#definevb vector <bool>
21+
#definevll vector <ll>
22+
#definevs vector <string>
23+
24+
#definevvi vector < vector <int > >
25+
#definevvb vector < vector <bool > >
26+
#definevvc vector < vector <char > >
27+
#definevvll vector < vector < ll > >
28+
#definevvd vector < vector < D > >
29+
#definevvld vector < vector < ld > >
30+
31+
#definepii pair <int ,int >
32+
#definepll pair < ll , ll >
33+
#definepld pair < ld , ld >
34+
#definepDD pair < D , D >
35+
36+
#definevpld vector < pld >
37+
#definevpii vector < pii >
38+
#definevpll vector < pll >
39+
#definevpDD vector < pDD >
40+
#definevvpii vector < vector < pii > >
41+
42+
#defineall(v) (v).begin() , (v).end()
43+
#defineallrev(v) (v).rbegin() , (v).rend()
44+
#defineallcomp(v) v.begin() , v.end() , comp
45+
#defineallrevcomp(v) v.rbegin() , v.rend() , comp
46+
47+
#defineFi(i,L,R)for (int i = L ; i <= R ; i++)
48+
#defineFd(i,R,L)for (int i = R ; i >= L ; i--)
49+
50+
#defineFAST ios_base :: sync_with_stdio (false) ; cin.tie(0) ; cout.tie(0)
51+
52+
#definedist(a,b,p,q) sqrt((p-a)*(p-a) + (q-b)*(q-b))
53+
54+
const ll MOD =1e9 +7 ;
55+
constint infi = INT_MAX ;
56+
const ll infll = LLONG_MAX ;
57+
const ld PI =3.1415926535897932384626 ;
58+
59+
////////////////////////////////////////////////////////////////////////////////////////////////////////////////
60+
61+
voidsolve (int test_case)
62+
{
63+
int n ;
64+
cin >> n ;
65+
vi v ;
66+
vi v2 ;
67+
for (int i =0 ; i < n ; ++i)
68+
{
69+
int t ; cin >> t ;
70+
v.pb(t) ;
71+
v2.pb(t) ;
72+
}
73+
sort(all(v2)) ;
74+
int cnt =0 ;
75+
for (int i =0 ; i < n ; ++i)
76+
{
77+
if (v[i] != v2[i])
78+
++cnt ;
79+
}
80+
if (cnt <=2)
81+
cout <<"YES" ;
82+
else
83+
cout <<"NO" ;
84+
}
85+
86+
intmain()
87+
{
88+
//freopen ("input.txt","r",stdin) ;
89+
//freopen ("output.txt","w",stdout) ;
90+
91+
FAST ;
92+
int tc =1 ;
93+
//cin >> tc ;
94+
while (tc--)
95+
solve (tc) ;
96+
return0 ;
97+
}

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp