Input Data

Search BackLinks only
Display context of search results
Case-sensitive searching

• 2002년도ACM문제샘플풀이/문제C . . . . 3 matches
       struct InputData
       InputData* inputData;
        inputData = new InputData[numberOfData];
        cin >> inputData[i].s >> inputData[i].f >> inputData[i].k;
        count = inputData[i].f - inputData[i].s - 1;
        if(inputData[i].s % 2 == 0)
        if( ((count / inputData[i].k) % 2 == 1 && (count % inputData[i].k) == 0)
        || ((count / inputData[i].k) % 2 == 0 && (count % inputData[i].k) != 0))
        delete [] inputData;
• 2002년도ACM문제샘플풀이/문제E . . . . 3 matches
       struct InputData
       InputData inputData[10];
        cin >> inputData[i].n;
        for(int j = 0 ; j < inputData[i].n ; j++)
        cin >> inputData[i].weight[j];
        InputData temp;
        temp = inputData[i];
        sort(&temp.weight[0],&temp.weight[inputData[i].n]);
        for(int j=0;j<inputData[i].n;j++)
        if(temp.weight[j]!=inputData[i].weight[j])
• [Lovely]boy^_^/USACO/BrokenNecklace . . . . 3 matches
       void InputData();
        InputData();
       void InputData()
• [Lovely]boy^_^/USACO/GreedyGiftGivers . . . . 3 matches
       void InputData();
        InputData();
       void InputData()
• 2002년도ACM문제샘플풀이/문제D . . . . 2 matches
       struct InputData
       InputData inputData[10];
        cin >> inputData[i].n;
        cin >> inputData[i].x;
        for(int j = 0 ; j < inputData[i].n; j++)
        cin >> inputData[i].weight[j];
        sort(&inputData[i].weight[0],&inputData[i].weight[inputData[i].n],greater<int>());
        int team1 = inputData[i].weight[0], team2 = inputData[i].weight[1];
        for(int j=2;j < inputData[i].n;j++)
        team1 += inputData[i].weight[j];
        team2 += inputData[i].weight[j];
        if(abs(team1 - team2) <= inputData[i].x)
• BusSimulation . . . . 1 match
        * 종점에서는 모든 승객이 내린다. 종점에서는 타는 승객이 없다. (주의 - 아래 InputData에서 원하는 시간을 5400(1시간30분)이 아니라 9600(2시간40분)으로 설정함)

Found 6 matching pages out of 7557 total pages (3450 pages are searched)

You can also click here to search title.