A题:给一个n,请你写出最少的不同数字,使得这些数字的和为n。
直接暴力贪心全部为1,一定可以加到n即可。
#include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<climits>
#include<stack>
#include<vector>
#include<queue>
#include<set>
#include<map>
//#include<regex>
#include<cstdio>
#define up(i,a,b) for(int i=a;i<b;i++)
#define dw(i,a,b) for(int i=a;i>b;i--)
#define upd(i,a,b) for(int i=a;i<=b;i++)
#define dwd(i,a,b) for(int i=a;i>=b;i--)
//#define local
typedef long long ll;
const double esp = 1e-6;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int inf = 1e9;
using namespace std;
int read()
{
char ch = getchar(); int x = 0, f = 1;
while (ch<'0' || ch>'9') { if (ch == '-')f = -1; ch = getchar(); }
while (ch >= '0' && ch <= '9') { x = x * 10 + ch - '0'; ch = getchar(); }
return x * f;
}
typedef pair<int, int> pir;
int n;
int main()
{
n = read();
cout << n << endl;
up(i, 0, n)cout << "1" << " ";
return 0;
}
B题:祖母游戏。
两个人玩祖母,只有两个一样就消除,最后一个人不能消除了,就输了。问谁赢。
只要有两个的必定消除,模拟祖玛即可。因为两个人都是最优解,所以一开始游戏有的两个连在一起的必定消除,然后合并继续消除。
#include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<climits>
#include<stack>
#include<vector>
#include<queue>
#include<set>
#include<map>
//#include<regex>
#include<cstdio>
#define up(i,a,b) for(int i=a;i<b;i++)
#define dw(i,a,b) for(int i=a;i>b;i--)
#define upd(i,a,b) for(int i=a;i<=b;i++)
#define dwd(i,a,b) for(int i=a;i>=b;i--)
//#define local
typedef long long ll;
const double esp = 1e-6;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int inf = 1e9;
using namespace std;
int read()
{
char ch = getchar(); int x = 0, f = 1;
while (ch<'0' || ch>'9') { if (ch == '-')f = -1; ch = getchar(); }
while (ch >= '0' && ch <= '9') { x = x * 10 + ch - '0'; ch = getchar(); }
return x * f;
}
typedef pair<int, int> pir;
string s;
char st[1000005];
int cnt[1000005];
int top;
int main()
{
cin >> s;
st[top] = '*';
int temp = 0;
up(i, 0, s.size())
{
if (st[top] == s[i])
{
cnt[top]++;
if (cnt[top] == 2)
{
temp++;
top--;
}
}
else
{
st[++top] = s[i];
cnt[top] = 1;
}
}
if (temp&1)cout << "Yes" << endl;
else cout << "No" << endl;
return 0;
}
C题:
给出4x4的放个,放置2x1或者1x2的砖块若干个,任意某行某列填满即可消除。问方法。
可以看到,2x1摆在上面两行,1x2摆在第三行即可,一直模拟这个过程。
#include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<climits>
#include<stack>
#include<vector>
#include<queue>
#include<set>
#include<map>
//#include<regex>
#include<cstdio>
#define up(i,a,b) for(int i=a;i<b;i++)
#define dw(i,a,b) for(int i=a;i>b;i--)
#define upd(i,a,b) for(int i=a;i<=b;i++)
#define dwd(i,a,b) for(int i=a;i>=b;i--)
//#define local
typedef long long ll;
const double esp = 1e-6;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int inf = 1e9;
using namespace std;
int read()
{
char ch = getchar(); int x = 0, f = 1;
while (ch<'0' || ch>'9') { if (ch == '-')f = -1; ch = getchar(); }
while (ch >= '0' && ch <= '9') { x = x * 10 + ch - '0'; ch = getchar(); }
return x * f;
}
typedef pair<int, int> pir;
string s;
int main()
{
cin >> s;
int x1 = 0, y1 = 1;
up(i, 0, s.size())
{
if (s[i] == '0')
{
x1++;
if (x1 == 5)x1 = 1;
cout << "1 " << x1 << endl;
}
else
{
y1 += 2;
if (y1>4)y1 = 1;
cout <<"3 " <<y1<< endl;
}
}
return 0;
}
D题
交互。每次询问x,y,返回(xmoda) (ymoda) 谁大谁小。
我们知道moda出来的值可以形成一个递增区间,然后间断点,重复。
例如a==8,
那么i%8(0<=i<=7)的值为0,1,2,3,4,5,6,7。 到i=8的时候,返回0,然后i继续增加,继续变成1,2,3,4,5.。。。。
所以我们就开始取l=1,r=2,如果是递增,则l*=2,r*=2,即二分找区间。且保证了第一个出现间断点的时候,一定是第一个a而不是a的倍数的值。
找到这个区间, 二分间断点即可。
#include<iostream>
#include<string>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<climits>
#include<stack>
#include<vector>
#include<queue>
#include<set>
#include<map>
//#include<regex>
#include<cstdio>
#define up(i,a,b) for(int i=a;i<b;i++)
#define dw(i,a,b) for(int i=a;i>b;i--)
#define upd(i,a,b) for(int i=a;i<=b;i++)
#define dwd(i,a,b) for(int i=a;i>=b;i--)
//#define local
typedef long long ll;
const double esp = 1e-6;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int inf = 1e9;
using namespace std;
int read()
{
char ch = getchar(); int x = 0, f = 1;
while (ch<'0' || ch>'9') { if (ch == '-')f = -1; ch = getchar(); }
while (ch >= '0' && ch <= '9') { x = x * 10 + ch - '0'; ch = getchar(); }
return x * f;
}
typedef pair<int, int> pir;
char s[100];
int main()
{
while (cin >> s)
{
if (strcmp(s, "end") == 0)break;
fflush(stdout);
ll l = 1; ll r = 2;
for (;l<1e10;)
{
cout << "?" << " " << l << " " << r << endl;
fflush(stdout);
scanf("%s", s);
if (l == 1 && r == 2 && s[0] == 'x')
{
cout << "? " << "0 " << "1" << endl;
fflush(stdout);
cin >> s;
if (s[0] == 'x')
{
cout << "! " << 1 << endl; fflush(stdout); break;
}
else
{
cout << "! " << 2 << endl; fflush(stdout); break;
}
}
if (s[0] == 'y')
{
l *= 2, r *= 2; continue;
}
else
{
while (r>l)
{
ll mid = (l + r)>>1;
cout << "? " << mid << " " << r << endl;
fflush(stdout);
cin >> s;
if (s[0] == 'y')r = mid;
else l = mid + 1;
}
cout << "! " << r << endl;
fflush(stdout);
break;
}
}
}
return 0;
}