QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#732418#9248. An Easy Math ProblemSHOJIG#WA 0ms3568kbC++202.9kb2024-11-10 14:28:422024-11-10 14:28:43

Judging History

This is the latest submission verdict.

  • [2024-11-10 14:28:43]
  • Judged
  • Verdict: WA
  • Time: 0ms
  • Memory: 3568kb
  • [2024-11-10 14:28:42]
  • Submitted

answer

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
int k, p ,x;
string s[6];

vector<int> get(string str) {
    int sum = 0, i = 0, k = 0;
    vector<int> v;
    while(i < str.length()) {
        sum = 0;
        while(isdigit(str[i])) {
            k = 1;
            sum = sum * 10 + str[i++] - '0';
        }
        if(k == 1) v.push_back(sum);
        k = 0;
        while(!isdigit(str[i])) i++;
    }
    return v;
}
vector<int> gets(string str) {
    int sum = 0, i = 0, k = 0, flag = 0;
    vector<int> v;
    while(i < str.length()) {
        sum = 0;
        while(isdigit(str[i])) {
            k = 1;
            sum = sum * 10 + str[i++] - '0';
        }
        if(k == 1) v.push_back(sum);
        k = 0;
        while(!isdigit(str[i])) {
            if(str[i] == ',') {
                v.push_back(1e8);
            }
            i++;
        }
    }
    return v;
}
int calc(int l, int r, int step) {
    if(step > 0) {
        
    }
    return 0;
}
void solve() {
    for(int i = 1; i <= 5; i++) {
        getline(cin, s[i]);
    }
    int ans = 0;
    int l, r, step;
    vector<int> v, v2;
    v = get(s[2]);
    v2 = gets(s[3]);
    if(v.size() == 2) {
        l = v[0];
        r = v[1];
        step = 1;
    }
    else {
        l = v[0];
        r = v[1];
        step = v[2];
    }
    int l1, r1, step1;
    cout << l << " " << r << " " << step << endl;
    cout << "--------" << endl;
    for(int i = l; i < r; i += step) {
        if(v2.size() == 5) {
            l1 = v[0];
            r1 = v[2];
            step1 = v[4];
        }
        else if(v2.size() == 4) {
            if(v[0] == 1e8) { // l1 = i;
                l1 = i;
                r1 = v[1];
                step1 = v[3];
            }
            else if(v[2] == 1e8) { // r1 = i;
                l1 = v[0];
                r1 = i;
                step1 = v[3];
            }
            else {
                l1 = v[0];
                r1 = v[2];
                step1 = i;
            }
        }
        else if(v2.size() == 2) {
            if(v2[0] == 1e8) {
                l1 = i;
                r1 = v2[1];
                step1 = 1;
            }
            else {
                l1 = v2[0];
                r1 = i;
                step1 = 1;
            }
        }
        else if(v2.size() == 3) {
            l1 = v2[0];
            r1 = v2[2];
            step1 = 1;
        }
        cout << l1 << " " << r1 << " " << step1 << endl;
        ans += calc(l1, r1, step1);
    }

    // cout << ans << endl;
}
/*
ans=0
for a in range(1,3):
for b in range(5,1,-2):
ans+=b
print(ans)

ans=0
for q in range(100,50,-1):
for i in range(q,77,20):
ans+=i
print(ans)
*/
signed main() {
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int _ = 1;
    //cin >> _;
    while(_--) solve();
}

詳細信息

Test #1:

score: 0
Wrong Answer
time: 0ms
memory: 3568kb

input:

10
1
2
3
4
5
6
7
8
9
10

output:

1 0 0
--------

result:

wrong answer 1st lines differ - expected: '1', found: '1 0 0'