Search found 2 matches
- Tue Apr 05, 2016 3:36 pm
- Forum: Volume 1 (100-199)
- Topic: 195 - Anagram
- Replies: 242
- Views: 58296
Re: 195 - Anagram
Is there a way to use std function lexicographical_compare and sort to sort the way the problem wants?
- Fri Mar 11, 2016 1:10 am
- Forum: Volume 101 (10100-10199)
- Topic: 10114 - Loansome Car Buyer
- Replies: 38
- Views: 21261
Re: 10114 - Loansome Car Buyer
Wonder if someone could help me. I'm getting WA and I am not sure the reason.
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t, dr;
double dp, al;
while(scanf("%d %lf %lf %d", &t, &dp, &al, &dr) != EOF)
{
double vet[2][dr+1];
int aTax = 0, aT = 0;
double carValue = al+dp ...
#include <bits/stdc++.h>
using namespace std;
int main()
{
int t, dr;
double dp, al;
while(scanf("%d %lf %lf %d", &t, &dp, &al, &dr) != EOF)
{
double vet[2][dr+1];
int aTax = 0, aT = 0;
double carValue = al+dp ...