absi2011's Blog & Daily Life.

全新的开始　　　　　　　我要省选翻盘　　　　　　　I wanna AK in 高考\化学　　　　　　　自此,生无可恋
[恢复状态] TCO 2016 1A
[破碎的状态] Tc 688 Div 1

[恢复状态] 愚人节大赛April Fools Day Contest 2016

absi2011 posted @ Apr 02, 2016 02:20:31 AM in 网上比赛 with tags 小高考 CF 瞎搞 图论 Div.2 Div.1 , 675 阅读

A

看起来是求2^n..不过..WA on test 3

后来发现..Da Vinci很滞涨的把2^n算错了..

http://oeis.org/A221180

B

Btoh yuo adn yuor roomatme lhoate wianshg disehs, btu stlil sdmoeboy msut peorrfm tihs cohre dialy. Oen dya yuo decdie to idourtcne smoe syestm. Yuor rmmotaoe sstgegus teh fooniwllg dael. Yuo argee on tow arayrs of ientgres M adn R, nmebur upmicnog dyas (induiclng teh cunrret oen) wtih sicsescuve irnegets (teh ceurrnt dya is zreo), adn yuo wsah teh diehss on dya D if adn olny if terhe etsixs an iednx i scuh taht D mod M[i] = R[i], otwsehrie yuor rmootmae deos it. Yuo lkie teh cncepot, btu yuor rmotaome's cuinnng simle meaks yuo ssecupt sthnoemig, so yuo itennd to vefriy teh fnerisas of teh aemnrgeet.

Yuo aer geivn ayarrs M adn R. Cuaclatle teh pceanregte of dyas on wchih yuo edn up dnoig teh wisahng. Amsuse taht yuo hvae iiiftlneny mnay dyas aehad of yuo.

这玩意儿能读?

C

对着图做事即可..

图要做的是什么事呢..?

字符串里的东西如果是大写字母(在'A'到'Z'内)则加其编号,如果是小写字母则减其编号

求最终结果

D

Print Number /of ones in /base 8 /notation of a

第一部分是brainfuck语言

第二部分是Malbolge语言

第三部分是Piet

第四部分是Befunge

....无话可说!

E

在不许用这些东西的情况下,还要写出一个floyd...

Note

You're running short of keywords, so you can't use some of them:

define
do
for
foreach
while
repeat
until
if
then
else
elif
elsif
elseif
case
switch

递归当循环用真心写的233.....

F

这竟然就是一个BlackJack...

我实在无话可说...A就是1点什么的..

G

水题一道,等你AC以后,它这么提示你:

Support of this language is discontinued, starting today. Please rewrite your project using something more modern.
close

...这特么是毛线(让你换个语言再写一遍)

果断不会别的语言...

然后..还要你缩代码...再在程序里加个kitten才放你过

附:代码

A:#include<set>

#include<map>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<time.h>
#include<math.h>
#include<memory>
#include<vector>
#include<bitset>
#include<fstream>
#include<stdio.h>
#include<utility>
#include<string.h>
#include<iostream>
#include<stdlib.h>
#include<algorithm>
using namespace std;
long long a[39]={1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8092, 16184, 32368, 64736, 129472, 258944, 517888, 1035776, 2071552, 4143104, 8286208, 16572416, 33144832, 66289664, 132579328, 265158656, 530317312, 1060634624, 2121269248, 4242538496ll, 8485076992ll, 16970153984ll, 33940307968ll};
int main()
{
    #ifdef absi2011
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    #endif
    int n;
    scanf("%d",&n);
    cout<<a[n]<<endl;
    return 0;
}

B:#include<set>

#include<map>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<time.h>
#include<math.h>
#include<memory>
#include<vector>
#include<bitset>
#include<fstream>
#include<stdio.h>
#include<utility>
#include<string.h>
#include<iostream>
#include<stdlib.h>
#include<algorithm>
using namespace std;
int a[25],b[25];
int main()
{
    #ifdef absi2011
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    #endif
    int n;
    scanf("%d",&n);
    int i;
    for (i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
    }
    for (i=0;i<n;i++)
    {
        scanf("%d",&b[i]);
    }
    int sum=0;
    for (i=0;i<720720;i++)
    {
        int j;
        for (j=0;j<n;j++)
        {
            if (i%a[j]==b[j])
            {
                sum++;
                break;
            }
        }
    }
    printf("%.12lf\n",sum/720720.0);
    return 0;
}

C:#include<set>

#include<map>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<time.h>
#include<math.h>
#include<memory>
#include<vector>
#include<bitset>
#include<fstream>
#include<stdio.h>
#include<utility>
#include<string.h>
#include<iostream>
#include<stdlib.h>
#include<algorithm>
using namespace std;
int main()
{
    #ifdef absi2011
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    #endif
    string a;
    cin>>a;
    int i;
    int sum=0;
    for (i=0;i<a.length();i++)
    {
        char x=a[i];
        if ((x>='A')&&(x<='Z'))
        {
            sum+=x-'@';
        }
        if ((x>='a')&&(x<='z'))
        {
            sum-=x-'`';
        }
    }
    printf("%d\n",sum);
    return 0;
}

D:#include<set>

#include<map>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<time.h>
#include<math.h>
#include<memory>
#include<vector>
#include<bitset>
#include<fstream>
#include<stdio.h>
#include<utility>
#include<string.h>
#include<iostream>
#include<stdlib.h>
#include<algorithm>
using namespace std;
int main()
{
    #ifdef absi2011
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    #endif
    int n;
    scanf("%d",&n);
    int i;
    int sum=0;
    for (;;)
    {
        if (n%8==1) sum++;
        n/=8;
        if (n==0) break;
    }
    printf("%d\n",sum);
    return 0;
}

E:#include<set>

#include<map>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<time.h>
#include<math.h>
#include<memory>
#include<vector>
#include<bitset>
#include<fstream>
#include<stdio.h>
#include<utility>
#include<string.h>
#include<iostream>
#include<stdlib.h>
#include<algorithm>
using namespace std;
int a[105][105];
int n;
int loop2(int i,int x)
{
    scanf("%d",&a[i][x]);
    return x==n?0:loop2(i,x+1);
}
int loop1(int x)
{
    loop2(x,0);
    return x==n?0:loop1(x+1);
}
int loops3(int k,int i,int j)
{
    a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
    return j==n?0:loops3(k,i,j+1);
}
int loops2(int k,int i)
{
    loops3(k,i,0);
    return i==n?0:loops2(k,i+1);
}
int loops1(int x)
{
    loops2(x,0);
    return x==n?0:loops1(x+1);
}
int ans=0;
int loopes2(int i,int x)
{
    ans=max(ans,a[i][x]);
    return x==n?0:loopes2(i,x+1);
}
int loopes1(int x)
{
    loopes2(x,0);
    return x==n?0:loopes1(x+1);
}
int main()
{
    #ifdef absi2011
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    #endif
    scanf("%d",&n);
    n--;
    loop1(0);
    loops1(0);
    loopes1(0);
    printf("%d\n",ans);
    return 0;
}

F:#include<set>

#include<map>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<time.h>
#include<math.h>
#include<memory>
#include<vector>
#include<bitset>
#include<fstream>
#include<stdio.h>
#include<utility>
#include<string.h>
#include<iostream>
#include<stdlib.h>
#include<algorithm>
using namespace std;
int main()
{
    #ifdef absi2011
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    #endif
    string a;
    cin>>a;
    int i;
    int sum=0;
    for (i=1;i<=6;i++)
    {
        sum+=a[i]-'0';
        if (a[i]=='0') sum+=9;
    }
    if (sum>=11)
    {
        sum+=1;
    }
    else
    {
        sum+=11;
    }
    printf("%d\n",sum);
    return 0;
}

G(C++):

#include<set>
#include<map>
#include<list>
#include<queue>
#include<stack>
#include<string>
#include<time.h>
#include<math.h>
#include<memory>
#include<vector>
#include<bitset>
#include<fstream>
#include<stdio.h>
#include<utility>
#include<string.h>
#include<iostream>
#include<stdlib.h>
#include<algorithm>
using namespace std;
char a[105][105]; 
int main()
{
    #ifdef absi2011 
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    #endif
    int n,m,f;
    scanf("%d%d%d",&n,&m,&f);
    int i; 
    for (i=0;i<n;i++)
    {
        scanf("%s",a[i]);
    }
    int sum=0;
    for (i=0;i<m;i++)
    {
        int j;
        int cnt=0;
        for (j=0;j<n;j++)
        {
            if (a[j][i]=='Y')
            {
                cnt++;
            }
        }
        if (cnt>=f) sum++;
    }
    printf("%d\n",sum);
    return 0;
}

G(Pascal):

var i,j,n,m,f,count,ans:longint;
    k:array [1..15] of string;
begin
    read(n,m,f);
    readln;
    for i:=1 to n do
        readln(k[i]);
    ans:=0;
    for i:=1 to m do
    begin
        count:=0;
        for j:=1 to n do
            if k[j][i]='Y' then
                inc(count);
        if count>=f then inc(ans);
    end;
    writeln(ans);
end.
Small_feed 评论 (2)

登录 *


loading captcha image...
(输入验证码)
or Ctrl+Enter