首頁 web前端 html教學 Codeforces Round #274 (Div. 2)_html/css_WEB-ITnose

Codeforces Round #274 (Div. 2)_html/css_WEB-ITnose

Jun 24, 2016 am 11:56 AM

链接:http://codeforces.com/contest/479

 

A. Expression

time limit per test

1 second

memory limit per test

256 megabytes

 

Petya studies in a school and he adores Maths. His class has been studying arithmetic expressions. On the last class the teacher wrote three positive integers a, b, c on the blackboard. The task was to insert signs of operations '+' and '*', and probably brackets between the numbers so that the value of the resulting expression is as large as possible. Let's consider an example: assume that the teacher wrote numbers 1, 2 and 3 on the blackboard. Here are some ways of placing signs and brackets:

  • 1+2*3=7
  • 1*(2+3)=5
  • 1*2*3=6
  • (1+2)*3=9
  • Note that you can insert operation signs only between a and b, and between b and c, that is, you cannot swap integers. For instance, in the given sample you cannot get expression (1+3)*2.

    It's easy to see that the maximum value that you can obtain is 9.

    Your task is: given a, b and c print the maximum value that you can get.

    Input

    The input contains three integers a, b and c, each on a single line (1?≤?a,?b,?c?≤?10).

    Output

    Print the maximum value of the expression that you can obtain.

    Sample test(s)

    Input

    123
    登入後複製

    Output

    Input

    2103
    登入後複製

    Output

    60
    登入後複製

     

    <span style="font-size:14px;">#include <cstdio>#include <algorithm>using namespace std;int max6(int a, int b, int c, int d, int e, int f){    return max(max(max(a,b), max(c,d)),max(e,f));}int main(){    int a, b, c;    scanf("%d %d %d", &a, &b, &c);    int a1 = a + b + c;    int a2 = a * b + c;    int a3 = a * (b + c);    int a4 = a * b * c;    int a5 = a + (b * c);    int a6 = (a + b) * c;    int ans = max6(a1, a2, a3, a4, a5, a6);    printf("%d\n", ans);}</span> 
    登入後複製


    B. Towers

    time limit per test

    1 second

    memory limit per test

    256 megabytes

    As you know, all the kids in Berland love playing with cubes. Little Petya has n towers consisting of cubes of the same size. Tower with number i consists of ai cubes stacked one on top of the other. Petya defines the instability of a set of towers as a value equal to the difference between the heights of the highest and the lowest of the towers. For example, if Petya built five cube towers with heights (8, 3, 2, 6, 3), the instability of this set is equal to 6 (the highest tower has height 8, the lowest one has height 2).

    The boy wants the instability of his set of towers to be as low as possible. All he can do is to perform the following operation several times: take the top cube from some tower and put it on top of some other tower of his set. Please note that Petya would never put the cube on the same tower from which it was removed because he thinks it's a waste of time.

    Before going to school, the boy will have time to perform no more than k such operations. Petya does not want to be late for class, so you have to help him accomplish this task.

    Input

    The first line contains two space-separated positive integers n and k (1?≤?n?≤?100, 1?≤?k?≤?1000) ? the number of towers in the given set and the maximum number of operations Petya can perform. The second line contains n space-separated positive integers ai (1?≤?ai?≤?104) ? the towers' initial heights.

    Output

    In the first line print two space-separated non-negative integers s and m (m?≤?k). The first number is the value of the minimum possible instability that can be obtained after performing at most k operations, the second number is the number of operations needed for that.

    In the next m lines print the description of each operation as two positive integers i and j, each of them lies within limits from 1 to n. They represent that Petya took the top cube from the i-th tower and put in on the j-th one (i?≠?j). Note that in the process of performing operations the heights of some towers can become equal to zero.

    If there are multiple correct sequences at which the minimum possible instability is achieved, you are allowed to print any of them.

    Sample test(s)

    Input

    3 25 8 5
    登入後複製

    Output

    0 22 12 3
    登入後複製

    Input

    3 42 2 4
    登入後複製

    Output

    1 13 2
    登入後複製

    Input

    5 38 3 2 6 3
    登入後複製

    Output

    3 31 31 21 3
    登入後複製

    Note

    In the first sample you need to move the cubes two times, from the second tower to the third one and from the second one to the first one. Then the heights of the towers are all the same and equal to 6.

    分析:分能否整除两种情况,每操作一次就排一次序,因为n不大,不会超时,要特判n=1和a[i]都相等的情况

    <span style="font-size:14px;">#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int const MAX = 1005;struct Info{    int h;    int pos;}info[MAX];int re[5000];int cmp(Info a, Info b){    return a.h < b.h;}int main(){    memset(re, 0, sizeof(re));    int n, k, sum = 0, ave = 0, mod = 0;    scanf("%d %d", &n, &k);    for(int i = 1; i <= n; i++)    {        info[i].pos = i;        scanf("%d", &info[i].h);        sum += info[i].h;    }    sort(info + 1, info + n + 1, cmp);    mod = sum % n;    ave = sum / n;    int tmp = 0;    int cnt = 0;    int cnt2 = 0;    int ma = info[n].h - info[1].h;    if(n == 1 || ma == 0)    {        printf("0 0\n");        return 0;    }    while(1)    {        if(mod != 0)        {            k--;            cnt2++;            info[n].h--;            info[1].h++;            re[cnt++] = info[n].pos;            re[cnt++] = info[1].pos;            sort(info + 1, info + n + 1, cmp);            ma = min(ma, info[n].h - info[1].h);            if(ma == 1 || k == 0)                break;        }        else        {            k--;            cnt2++;            info[n].h--;            info[1].h++;            re[cnt++] = info[n].pos;            re[cnt++] = info[1].pos;            sort(info + 1, info + n + 1, cmp);            ma = min(ma, info[n].h - info[1].h);            if(ma == 0 || k == 0)                break;        }    }    printf("%d %d\n", ma, cnt2);    for(int i = 0; i < cnt - 1; i += 2)        printf("%d %d\n", re[i], re[i+1]);}</span>
    登入後複製


    C. Exams

    time limit per test

    1 second

    memory limit per test

    256 megabytes

    Student Valera is an undergraduate student at the University. His end of term exams are approaching and he is to pass exactly n exams. Valera is a smart guy, so he will be able to pass any exam he takes on his first try. Besides, he can take several exams on one day, and in any order.

    According to the schedule, a student can take the exam for the i-th subject on the day number ai. However, Valera has made an arrangement with each teacher and the teacher of the i-th subject allowed him to take an exam before the schedule time on day bi (bi?

    Valera believes that it would be rather strange if the entries in the record book did not go in the order of non-decreasing date. Therefore Valera asks you to help him. Find the minimum possible value of the day when Valera can take the final exam if he takes exams so that all the records in his record book go in the order of non-decreasing date.

    Input

    The first line contains a single positive integer n (1?≤?n?≤?5000) ? the number of exams Valera will take.

    Each of the next n lines contains two positive space-separated integers ai and bi (1?≤?bi?

    Output

    Print a single integer ? the minimum possible number of the day when Valera can take the last exam if he takes all the exams so that all the records in his record book go in the order of non-decreasing date.

    Sample test(s)

    Input

    35 23 14 2
    登入後複製

    Output

    Input

    36 15 24 3
    登入後複製

    Output

    Note

    In the first sample Valera first takes an exam in the second subject on the first day (the teacher writes down the schedule date that is 3). On the next day he takes an exam in the third subject (the teacher writes down the schedule date, 4), then he takes an exam in the first subject (the teacher writes down the mark with date 5). Thus, Valera takes the last exam on the second day and the dates will go in the non-decreasing order: 3, 4, 5.

    In the second sample Valera first takes an exam in the third subject on the fourth day. Then he takes an exam in the second subject on the fifth day. After that on the sixth day Valera takes an exam in the first subject.

    分析:先对给定日期排序,相同的话对提前日期排队,优先考虑提前日期

    <span style="font-size:14px;">#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int const MAX = 5005;struct Info{    int a, b;}info[MAX];int cmp(Info x, Info y){    if(x.a == y.a)        return x.b < y.b;    return  x.a < y.a;}int main(){    int n;    scanf("%d", &n);    for(int i = 0; i < n; i++)        scanf("%d %d", &info[i].a, &info[i].b);    sort(info, info + n, cmp);    int ans = info[0].b;    for(int i = 1; i < n; i++)    {        if(ans <= info[i].b)            ans = info[i].b;        else            ans = info[i].a;    }    printf("%d\n", ans);}</span>
    登入後複製


     

     

     

    本網站聲明
    本文內容由網友自願投稿,版權歸原作者所有。本站不承擔相應的法律責任。如發現涉嫌抄襲或侵權的內容,請聯絡admin@php.cn

    熱AI工具

    Undresser.AI Undress

    Undresser.AI Undress

    人工智慧驅動的應用程序,用於創建逼真的裸體照片

    AI Clothes Remover

    AI Clothes Remover

    用於從照片中去除衣服的線上人工智慧工具。

    Undress AI Tool

    Undress AI Tool

    免費脫衣圖片

    Clothoff.io

    Clothoff.io

    AI脫衣器

    Video Face Swap

    Video Face Swap

    使用我們完全免費的人工智慧換臉工具,輕鬆在任何影片中換臉!

    熱門文章

    <🎜>:泡泡膠模擬器無窮大 - 如何獲取和使用皇家鑰匙
    3 週前 By 尊渡假赌尊渡假赌尊渡假赌
    北端:融合系統,解釋
    3 週前 By 尊渡假赌尊渡假赌尊渡假赌
    Mandragora:巫婆樹的耳語 - 如何解鎖抓鉤
    3 週前 By 尊渡假赌尊渡假赌尊渡假赌

    熱工具

    記事本++7.3.1

    記事本++7.3.1

    好用且免費的程式碼編輯器

    SublimeText3漢化版

    SublimeText3漢化版

    中文版,非常好用

    禪工作室 13.0.1

    禪工作室 13.0.1

    強大的PHP整合開發環境

    Dreamweaver CS6

    Dreamweaver CS6

    視覺化網頁開發工具

    SublimeText3 Mac版

    SublimeText3 Mac版

    神級程式碼編輯軟體(SublimeText3)

    熱門話題

    Java教學
    1665
    14
    CakePHP 教程
    1424
    52
    Laravel 教程
    1321
    25
    PHP教程
    1269
    29
    C# 教程
    1249
    24
    了解HTML,CSS和JavaScript:初學者指南 了解HTML,CSS和JavaScript:初學者指南 Apr 12, 2025 am 12:02 AM

    WebDevelovermentReliesonHtml,CSS和JavaScript:1)HTMLStructuresContent,2)CSSStyleSIT和3)JavaScriptAddSstractivity,形成thebasisofmodernWebemodernWebExexperiences。

    HTML:結構,CSS:樣式,JavaScript:行為 HTML:結構,CSS:樣式,JavaScript:行為 Apr 18, 2025 am 12:09 AM

    HTML、CSS和JavaScript在Web開發中的作用分別是:1.HTML定義網頁結構,2.CSS控製網頁樣式,3.JavaScript添加動態行為。它們共同構建了現代網站的框架、美觀和交互性。

    HTML,CSS和JavaScript的未來:網絡開發趨勢 HTML,CSS和JavaScript的未來:網絡開發趨勢 Apr 19, 2025 am 12:02 AM

    HTML的未來趨勢是語義化和Web組件,CSS的未來趨勢是CSS-in-JS和CSSHoudini,JavaScript的未來趨勢是WebAssembly和Serverless。 1.HTML的語義化提高可訪問性和SEO效果,Web組件提升開發效率但需注意瀏覽器兼容性。 2.CSS-in-JS增強樣式管理靈活性但可能增大文件體積,CSSHoudini允許直接操作CSS渲染。 3.WebAssembly優化瀏覽器應用性能但學習曲線陡,Serverless簡化開發但需優化冷啟動問題。

    HTML的未來:網絡設計的發展和趨勢 HTML的未來:網絡設計的發展和趨勢 Apr 17, 2025 am 12:12 AM

    HTML的未來充滿了無限可能。 1)新功能和標準將包括更多的語義化標籤和WebComponents的普及。 2)網頁設計趨勢將繼續向響應式和無障礙設計發展。 3)性能優化將通過響應式圖片加載和延遲加載技術提升用戶體驗。

    HTML與CSS vs. JavaScript:比較概述 HTML與CSS vs. JavaScript:比較概述 Apr 16, 2025 am 12:04 AM

    HTML、CSS和JavaScript在網頁開發中的角色分別是:HTML負責內容結構,CSS負責樣式,JavaScript負責動態行為。 1.HTML通過標籤定義網頁結構和內容,確保語義化。 2.CSS通過選擇器和屬性控製網頁樣式,使其美觀易讀。 3.JavaScript通過腳本控製網頁行為,實現動態和交互功能。

    HTML:建立網頁的結構 HTML:建立網頁的結構 Apr 14, 2025 am 12:14 AM

    HTML是構建網頁結構的基石。 1.HTML定義內容結構和語義,使用、、等標籤。 2.提供語義化標記,如、、等,提升SEO效果。 3.通過標籤實現用戶交互,需注意表單驗證。 4.使用、等高級元素結合JavaScript實現動態效果。 5.常見錯誤包括標籤未閉合和屬性值未加引號,需使用驗證工具。 6.優化策略包括減少HTTP請求、壓縮HTML、使用語義化標籤等。

    HTML與CSS和JavaScript:比較Web技術 HTML與CSS和JavaScript:比較Web技術 Apr 23, 2025 am 12:05 AM

    HTML、CSS和JavaScript是構建現代網頁的核心技術:1.HTML定義網頁結構,2.CSS負責網頁外觀,3.JavaScript提供網頁動態和交互性,它們共同作用,打造出用戶體驗良好的網站。

    HTML:是編程語言還是其他? HTML:是編程語言還是其他? Apr 15, 2025 am 12:13 AM

    HTMLISNOTAPROGRAMMENGUAGE; ITISAMARKUMARKUPLAGUAGE.1)htmlStructures andFormatSwebContentusingtags.2)itworkswithcsssforstylingandjavascript for Interactivity,增強WebevebDevelopment。

    See all articles